fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r045-oct2-162038291500148
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for ClientsAndServers-PT-N0010P0

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1668.451 133782.00 150352.00 172.40 TFTTFFFFTFTFFFFT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fko/mcc2021-input.r045-oct2-162038291500148.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ClientsAndServers-PT-N0010P0, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r045-oct2-162038291500148
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 372K
-rw-r--r-- 1 mcc users 9.3K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 99K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Mar 28 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 28 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 23 03:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 03:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 22 12:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 22 12:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 8 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 9.1K May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ClientsAndServers-PT-N0010P0-00
FORMULA_NAME ClientsAndServers-PT-N0010P0-01
FORMULA_NAME ClientsAndServers-PT-N0010P0-02
FORMULA_NAME ClientsAndServers-PT-N0010P0-03
FORMULA_NAME ClientsAndServers-PT-N0010P0-04
FORMULA_NAME ClientsAndServers-PT-N0010P0-05
FORMULA_NAME ClientsAndServers-PT-N0010P0-06
FORMULA_NAME ClientsAndServers-PT-N0010P0-07
FORMULA_NAME ClientsAndServers-PT-N0010P0-08
FORMULA_NAME ClientsAndServers-PT-N0010P0-09
FORMULA_NAME ClientsAndServers-PT-N0010P0-10
FORMULA_NAME ClientsAndServers-PT-N0010P0-11
FORMULA_NAME ClientsAndServers-PT-N0010P0-12
FORMULA_NAME ClientsAndServers-PT-N0010P0-13
FORMULA_NAME ClientsAndServers-PT-N0010P0-14
FORMULA_NAME ClientsAndServers-PT-N0010P0-15

=== Now, execution of the tool begins

BK_START 1620563305377

Running Version 0
[2021-05-09 12:28:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-09 12:28:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 12:28:27] [INFO ] Load time of PNML (sax parser for PT used): 18 ms
[2021-05-09 12:28:27] [INFO ] Transformed 25 places.
[2021-05-09 12:28:27] [INFO ] Transformed 18 transitions.
[2021-05-09 12:28:27] [INFO ] Parsed PT model containing 25 places and 18 transitions in 48 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 12:28:27] [INFO ] Initial state test concluded for 5 properties.
FORMULA ClientsAndServers-PT-N0010P0-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0010P0-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0010P0-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 6 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2021-05-09 12:28:27] [INFO ] Computed 8 place invariants in 4 ms
[2021-05-09 12:28:27] [INFO ] Implicit Places using invariants in 108 ms returned []
// Phase 1: matrix 18 rows 25 cols
[2021-05-09 12:28:27] [INFO ] Computed 8 place invariants in 4 ms
[2021-05-09 12:28:27] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 25 cols
[2021-05-09 12:28:27] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-09 12:28:27] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 18/18 transitions.
[2021-05-09 12:28:27] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-09 12:28:27] [INFO ] Flatten gal took : 16 ms
FORMULA ClientsAndServers-PT-N0010P0-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0010P0-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0010P0-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 12:28:27] [INFO ] Flatten gal took : 29 ms
[2021-05-09 12:28:27] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 100018 steps, including 80 resets, run finished after 56 ms. (steps per millisecond=1786 ) properties (out of 25) seen :23
Running SMT prover for 2 properties.
// Phase 1: matrix 18 rows 25 cols
[2021-05-09 12:28:27] [INFO ] Computed 8 place invariants in 3 ms
[2021-05-09 12:28:27] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-09 12:28:27] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-09 12:28:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 12:28:27] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2021-05-09 12:28:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 12:28:27] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-09 12:28:27] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-09 12:28:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 12:28:27] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-09 12:28:27] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-09 12:28:27] [INFO ] Added : 16 causal constraints over 4 iterations in 20 ms. Result :sat
[2021-05-09 12:28:27] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-09 12:28:27] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 0 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
[2021-05-09 12:28:27] [INFO ] Initial state test concluded for 1 properties.
FORMULA ClientsAndServers-PT-N0010P0-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((G(p0) U p1) U X(G(p2))))], workingDir=/home/mcc/execution]
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 1 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 12:28:27] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-09 12:28:27] [INFO ] Implicit Places using invariants in 18 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 19 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 12:28:27] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 12:28:27] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Starting structural reductions, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 12:28:27] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-09 12:28:27] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 314 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p1) p0), true, (NOT p0), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0010P0-01 automaton TGBA [mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(OR (AND p1 p2) (AND p0 p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 (NOT p0) p2), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={0} source=6 dest: 6}]], initial=1, aps=[p2:(LEQ s12 s11), p1:(LEQ 1 s8), p0:(LEQ s16 s18)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 22 steps with 6 reset in 2 ms.
FORMULA ClientsAndServers-PT-N0010P0-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0010P0-01 finished in 415 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||F(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 1 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 12:28:28] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 12:28:28] [INFO ] Implicit Places using invariants in 13 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 19 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 12:28:28] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 12:28:28] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Starting structural reductions, iteration 1 : 20/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 12:28:28] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 12:28:28] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0010P0-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p1:(GT s14 s10), p0:(GT s19 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 181 ms.
Product exploration explored 100000 steps with 50000 reset in 125 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 50000 reset in 54 ms.
Product exploration explored 100000 steps with 50000 reset in 54 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 20 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 20/20 places, 18/18 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 20 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 7 place count 20 transition count 18
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 10 place count 20 transition count 18
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 14 place count 16 transition count 14
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 18 place count 16 transition count 14
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 18 rules in 6 ms. Remains 16 /20 variables (removed 4) and now considering 14/18 (removed 4) transitions.
[2021-05-09 12:28:29] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 16 cols
[2021-05-09 12:28:29] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 12:28:29] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 16/20 places, 14/18 transitions.
Product exploration explored 100000 steps with 50000 reset in 166 ms.
Product exploration explored 100000 steps with 50000 reset in 131 ms.
[2021-05-09 12:28:29] [INFO ] Flatten gal took : 1 ms
[2021-05-09 12:28:29] [INFO ] Flatten gal took : 2 ms
[2021-05-09 12:28:29] [INFO ] Time to serialize gal into /tmp/LTL13106794560114649770.gal : 1 ms
[2021-05-09 12:28:29] [INFO ] Time to serialize properties into /tmp/LTL7291367615066026015.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL13106794560114649770.gal, -t, CGAL, -LTL, /tmp/LTL7291367615066026015.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL13106794560114649770.gal -t CGAL -LTL /tmp/LTL7291367615066026015.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("(Ci>CR)")||(F("(Si>MtF)")))))
Formula 0 simplified : !X("(Ci>CR)" | F"(Si>MtF)")
Detected timeout of ITS tools.
[2021-05-09 12:28:44] [INFO ] Flatten gal took : 1 ms
[2021-05-09 12:28:44] [INFO ] Applying decomposition
[2021-05-09 12:28:44] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph2927219074534919496.txt, -o, /tmp/graph2927219074534919496.bin, -w, /tmp/graph2927219074534919496.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph2927219074534919496.bin, -l, -1, -v, -w, /tmp/graph2927219074534919496.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 12:28:44] [INFO ] Decomposing Gal with order
[2021-05-09 12:28:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 12:28:44] [INFO ] Removed a total of 2 redundant transitions.
[2021-05-09 12:28:44] [INFO ] Flatten gal took : 30 ms
[2021-05-09 12:28:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-09 12:28:44] [INFO ] Time to serialize gal into /tmp/LTL11594171659166160386.gal : 1 ms
[2021-05-09 12:28:44] [INFO ] Time to serialize properties into /tmp/LTL14245871189406441237.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL11594171659166160386.gal, -t, CGAL, -LTL, /tmp/LTL14245871189406441237.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL11594171659166160386.gal -t CGAL -LTL /tmp/LTL14245871189406441237.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("(gu6.Ci>gu6.CR)")||(F("(gu4.Si>gu4.MtF)")))))
Formula 0 simplified : !X("(gu6.Ci>gu6.CR)" | F"(gu4.Si>gu4.MtF)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12703941716828357235
[2021-05-09 12:28:59] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12703941716828357235
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin12703941716828357235]
Compilation finished in 203 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin12703941716828357235]
Link finished in 47 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(((LTLAPp0==true)||<>((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin12703941716828357235]
LTSmin run took 261 ms.
FORMULA ClientsAndServers-PT-N0010P0-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0010P0-03 finished in 32083 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0 U (F(p1) U X(p2)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 0 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 12:29:00] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 12:29:00] [INFO ] Implicit Places using invariants in 28 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 12:29:00] [INFO ] Computed 3 place invariants in 6 ms
[2021-05-09 12:29:00] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Starting structural reductions, iteration 1 : 20/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 12:29:00] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 12:29:00] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 233 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0010P0-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ s3 s0), p1:(LEQ s15 s10), p2:(AND (LEQ s15 s10) (LEQ s3 s0))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 11682 reset in 215 ms.
Product exploration explored 100000 steps with 12703 reset in 130 ms.
Knowledge obtained : [p0, p1, p2]
Stuttering acceptance computed with spot in 281 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p1)]
Product exploration explored 100000 steps with 12120 reset in 196 ms.
Product exploration explored 100000 steps with 12440 reset in 138 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 195 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p1)]
Support contains 4 out of 20 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 20/20 places, 18/18 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 20 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 5 place count 20 transition count 18
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 20 transition count 18
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 10 place count 18 transition count 16
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 18 transition count 16
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 18 transition count 16
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 16 transition count 14
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 16 transition count 14
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 19 rules in 2 ms. Remains 16 /20 variables (removed 4) and now considering 14/18 (removed 4) transitions.
[2021-05-09 12:29:02] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 16 cols
[2021-05-09 12:29:02] [INFO ] Computed 3 place invariants in 4 ms
[2021-05-09 12:29:02] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 1 iterations. Remains : 16/20 places, 14/18 transitions.
Product exploration explored 100000 steps with 12851 reset in 144 ms.
Product exploration explored 100000 steps with 12456 reset in 150 ms.
[2021-05-09 12:29:02] [INFO ] Flatten gal took : 1 ms
[2021-05-09 12:29:02] [INFO ] Flatten gal took : 1 ms
[2021-05-09 12:29:02] [INFO ] Time to serialize gal into /tmp/LTL14410316396284360732.gal : 4 ms
[2021-05-09 12:29:02] [INFO ] Time to serialize properties into /tmp/LTL12294038029850046549.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL14410316396284360732.gal, -t, CGAL, -LTL, /tmp/LTL12294038029850046549.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL14410316396284360732.gal -t CGAL -LTL /tmp/LTL12294038029850046549.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("(SR<=Uf)")U((F("(StR<=MtF)"))U(X("((StR<=MtF)&&(SR<=Uf))"))))))
Formula 0 simplified : !X("(SR<=Uf)" U (F"(StR<=MtF)" U X"((StR<=MtF)&&(SR<=Uf))"))
Detected timeout of ITS tools.
[2021-05-09 12:29:17] [INFO ] Flatten gal took : 3 ms
[2021-05-09 12:29:17] [INFO ] Applying decomposition
[2021-05-09 12:29:17] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph7781202132075637510.txt, -o, /tmp/graph7781202132075637510.bin, -w, /tmp/graph7781202132075637510.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph7781202132075637510.bin, -l, -1, -v, -w, /tmp/graph7781202132075637510.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 12:29:17] [INFO ] Decomposing Gal with order
[2021-05-09 12:29:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 12:29:17] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-09 12:29:17] [INFO ] Flatten gal took : 3 ms
[2021-05-09 12:29:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-09 12:29:17] [INFO ] Time to serialize gal into /tmp/LTL2465417655209532094.gal : 1 ms
[2021-05-09 12:29:17] [INFO ] Time to serialize properties into /tmp/LTL9402985839569457228.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL2465417655209532094.gal, -t, CGAL, -LTL, /tmp/LTL9402985839569457228.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2465417655209532094.gal -t CGAL -LTL /tmp/LTL9402985839569457228.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("(gu2.SR<=gu2.Uf)")U((F("(gu4.StR<=gu4.MtF)"))U(X("((gu4.StR<=gu4.MtF)&&(gu2.SR<=gu2.Uf))"))))))
Formula 0 simplified : !X("(gu2.SR<=gu2.Uf)" U (F"(gu4.StR<=gu4.MtF)" U X"((gu4.StR<=gu4.MtF)&&(gu2.SR<=gu2.Uf))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin971238572918376784
[2021-05-09 12:29:32] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin971238572918376784
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin971238572918376784]
Compilation finished in 112 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin971238572918376784]
Link finished in 38 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(((LTLAPp0==true) U (<>((LTLAPp1==true)) U X((LTLAPp2==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin971238572918376784]
LTSmin run took 927 ms.
FORMULA ClientsAndServers-PT-N0010P0-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0010P0-04 finished in 33213 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0&&F(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 18
Applied a total of 2 rules in 1 ms. Remains 23 /25 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2021-05-09 12:29:33] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 12:29:33] [INFO ] Implicit Places using invariants in 18 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 19 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 12:29:33] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 12:29:33] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Starting structural reductions, iteration 1 : 22/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 12:29:33] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 12:29:33] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 2 iterations. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 79 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N0010P0-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ 2 s16), p0:(OR (LEQ 3 s20) (LEQ s4 s14))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 7163 reset in 65 ms.
Product exploration explored 100000 steps with 7129 reset in 150 ms.
Knowledge obtained : [(NOT p1), p0]
Stuttering acceptance computed with spot in 82 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 7142 reset in 58 ms.
Product exploration explored 100000 steps with 7181 reset in 73 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Support contains 4 out of 22 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 22/22 places, 18/18 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 22 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 5 place count 22 transition count 18
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 22 transition count 18
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 11 place count 19 transition count 15
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 14 place count 19 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 19 transition count 15
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 18 transition count 14
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 18 transition count 14
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 17 rules in 6 ms. Remains 18 /22 variables (removed 4) and now considering 14/18 (removed 4) transitions.
[2021-05-09 12:29:34] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 18 cols
[2021-05-09 12:29:34] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 12:29:34] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 18/22 places, 14/18 transitions.
Product exploration explored 100000 steps with 4147 reset in 173 ms.
Stack based approach found an accepted trace after 272 steps with 10 reset with depth 35 and stack size 34 in 1 ms.
FORMULA ClientsAndServers-PT-N0010P0-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0010P0-05 finished in 1038 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0) U X(p1)))], workingDir=/home/mcc/execution]
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 3 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 12:29:34] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 12:29:34] [INFO ] Implicit Places using invariants in 26 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 12:29:34] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 12:29:34] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Starting structural reductions, iteration 1 : 20/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 12:29:34] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 12:29:34] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0010P0-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GT s1 s3), p1:(LEQ 1 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0010P0-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0010P0-06 finished in 248 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0||F(G((p0 U p1)))) U p2))], workingDir=/home/mcc/execution]
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 21 transition count 14
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 17 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 16 transition count 13
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 20 place count 13 transition count 10
Applied a total of 20 rules in 7 ms. Remains 13 /25 variables (removed 12) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 13 cols
[2021-05-09 12:29:34] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 12:29:34] [INFO ] Implicit Places using invariants in 158 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 159 ms to find 1 implicit places.
[2021-05-09 12:29:35] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-09 12:29:35] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 12:29:35] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Starting structural reductions, iteration 1 : 12/25 places, 10/18 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 12 transition count 9
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 11 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 10 transition count 8
Applied a total of 4 rules in 1 ms. Remains 10 /12 variables (removed 2) and now considering 8/10 (removed 2) transitions.
// Phase 1: matrix 8 rows 10 cols
[2021-05-09 12:29:35] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 12:29:35] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 8 rows 10 cols
[2021-05-09 12:29:35] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 12:29:35] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 10/25 places, 8/18 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p2), (NOT p1), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0010P0-07 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(OR p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(LEQ 3 s5), p0:(LEQ 2 s9), p1:(LEQ s2 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1840 reset in 74 ms.
Stack based approach found an accepted trace after 23 steps with 0 reset with depth 24 and stack size 24 in 1 ms.
FORMULA ClientsAndServers-PT-N0010P0-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0010P0-07 finished in 442 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G((p0||X(F(p1)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 1 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 12:29:35] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 12:29:35] [INFO ] Implicit Places using invariants in 14 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 14 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 12:29:35] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 12:29:35] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Starting structural reductions, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 12:29:35] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 12:29:35] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0010P0-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT 1 s9), p1:(GT s19 s18)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 12690 steps with 7 reset in 14 ms.
FORMULA ClientsAndServers-PT-N0010P0-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0010P0-11 finished in 192 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(G((p0||X((p1||(p2&&X(p2))))))) U p3))], workingDir=/home/mcc/execution]
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 2 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 12:29:35] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 12:29:35] [INFO ] Implicit Places using invariants in 12 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 13 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 12:29:35] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 12:29:35] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Starting structural reductions, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 12:29:35] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 12:29:35] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 163 ms :[(NOT p3), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : ClientsAndServers-PT-N0010P0-12 automaton TGBA [mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=(NOT p3), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 2}]], initial=0, aps=[p3:(GT s17 s14), p0:(LEQ 1 s19), p1:(LEQ s13 s18), p2:(LEQ s18 s17)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 28344 reset in 80 ms.
Product exploration explored 100000 steps with 28164 reset in 95 ms.
Knowledge obtained : [(NOT p3), (NOT p0), p1, p2]
Stuttering acceptance computed with spot in 247 ms :[(NOT p3), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 28223 reset in 65 ms.
Product exploration explored 100000 steps with 28459 reset in 69 ms.
[2021-05-09 12:29:36] [INFO ] Flatten gal took : 1 ms
[2021-05-09 12:29:36] [INFO ] Flatten gal took : 1 ms
[2021-05-09 12:29:36] [INFO ] Time to serialize gal into /tmp/LTL1143194608634056115.gal : 16 ms
[2021-05-09 12:29:36] [INFO ] Time to serialize properties into /tmp/LTL15836490763769212889.ltl : 3 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL1143194608634056115.gal, -t, CGAL, -LTL, /tmp/LTL15836490763769212889.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1143194608634056115.gal -t CGAL -LTL /tmp/LTL15836490763769212889.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F(G(("(Cb>=1)")||(X(("(MwU<=SpA)")||(("(SpA<=SwA)")&&(X("(SpA<=SwA)"))))))))U("(SwA>Si)")))
Formula 0 simplified : !(FG("(Cb>=1)" | X("(MwU<=SpA)" | ("(SpA<=SwA)" & X"(SpA<=SwA)"))) U "(SwA>Si)")
Detected timeout of ITS tools.
[2021-05-09 12:29:51] [INFO ] Flatten gal took : 8 ms
[2021-05-09 12:29:51] [INFO ] Applying decomposition
[2021-05-09 12:29:51] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph1727177582635048471.txt, -o, /tmp/graph1727177582635048471.bin, -w, /tmp/graph1727177582635048471.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph1727177582635048471.bin, -l, -1, -v, -w, /tmp/graph1727177582635048471.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 12:29:51] [INFO ] Decomposing Gal with order
[2021-05-09 12:29:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 12:29:51] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-09 12:29:51] [INFO ] Flatten gal took : 3 ms
[2021-05-09 12:29:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-09 12:29:51] [INFO ] Time to serialize gal into /tmp/LTL12233797720876896167.gal : 0 ms
[2021-05-09 12:29:51] [INFO ] Time to serialize properties into /tmp/LTL5677630194876432672.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL12233797720876896167.gal, -t, CGAL, -LTL, /tmp/LTL5677630194876432672.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL12233797720876896167.gal -t CGAL -LTL /tmp/LTL5677630194876432672.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F(G(("(gi0.gi1.gu1.Cb>=1)")||(X(("(gu5.MwU<=gu5.SpA)")||(("(gu5.SpA<=gu5.SwA)")&&(X("(gu5.SpA<=gu5.SwA)"))))))))U("(gu5.SwA>gu5.Si)")))
Formula 0 simplified : !(FG("(gi0.gi1.gu1.Cb>=1)" | X("(gu5.MwU<=gu5.SpA)" | ("(gu5.SpA<=gu5.SwA)" & X"(gu5.SpA<=gu5.SwA)"))) U "(gu5.SwA>gu5.Si)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6159474311308530587
[2021-05-09 12:30:06] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6159474311308530587
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin6159474311308530587]
Compilation finished in 117 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin6159474311308530587]
Link finished in 42 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, (<>([](((LTLAPp0==true)||X(((LTLAPp1==true)||((LTLAPp2==true)&&X((LTLAPp2==true)))))))) U (LTLAPp3==true)), --buchi-type=spotba], workingDir=/tmp/ltsmin6159474311308530587]
LTSmin run took 481 ms.
FORMULA ClientsAndServers-PT-N0010P0-12 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0010P0-12 finished in 31865 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(F(p0)) U (p1||G(F(p2))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 1 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 12:30:07] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 12:30:07] [INFO ] Implicit Places using invariants in 29 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 12:30:07] [INFO ] Computed 3 place invariants in 3 ms
[2021-05-09 12:30:07] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Starting structural reductions, iteration 1 : 20/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 12:30:07] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 12:30:07] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0010P0-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ s7 s2), p2:(LEQ s17 s5), p0:(LEQ 1 s13)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 58 ms.
Product exploration explored 100000 steps with 50000 reset in 56 ms.
Knowledge obtained : [p1, p2, (NOT p0)]
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 50000 reset in 56 ms.
Product exploration explored 100000 steps with 50000 reset in 55 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
Support contains 5 out of 20 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 20/20 places, 18/18 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 20 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 4 place count 20 transition count 18
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 20 transition count 18
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 19 transition count 17
Deduced a syphon composed of 5 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 19 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 19 transition count 17
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 9 rules in 4 ms. Remains 19 /20 variables (removed 1) and now considering 17/18 (removed 1) transitions.
[2021-05-09 12:30:08] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 17 rows 19 cols
[2021-05-09 12:30:08] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-09 12:30:08] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 19/20 places, 17/18 transitions.
Product exploration explored 100000 steps with 50000 reset in 116 ms.
Product exploration explored 100000 steps with 50000 reset in 124 ms.
[2021-05-09 12:30:08] [INFO ] Flatten gal took : 1 ms
[2021-05-09 12:30:08] [INFO ] Flatten gal took : 3 ms
[2021-05-09 12:30:08] [INFO ] Time to serialize gal into /tmp/LTL11395172008523339097.gal : 2 ms
[2021-05-09 12:30:08] [INFO ] Time to serialize properties into /tmp/LTL1565824043874298794.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL11395172008523339097.gal, -t, CGAL, -LTL, /tmp/LTL1565824043874298794.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL11395172008523339097.gal -t CGAL -LTL /tmp/LTL1565824043874298794.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((X(F("(MwU>=1)")))U(("(CG<=SF)")||(G(F("(SpA<=CF)")))))))
Formula 0 simplified : !X(XF"(MwU>=1)" U ("(CG<=SF)" | GF"(SpA<=CF)"))
Detected timeout of ITS tools.
[2021-05-09 12:30:23] [INFO ] Flatten gal took : 1 ms
[2021-05-09 12:30:23] [INFO ] Applying decomposition
[2021-05-09 12:30:23] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph13886727136519748871.txt, -o, /tmp/graph13886727136519748871.bin, -w, /tmp/graph13886727136519748871.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph13886727136519748871.bin, -l, -1, -v, -w, /tmp/graph13886727136519748871.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 12:30:23] [INFO ] Decomposing Gal with order
[2021-05-09 12:30:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 12:30:23] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-09 12:30:23] [INFO ] Flatten gal took : 2 ms
[2021-05-09 12:30:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-09 12:30:23] [INFO ] Time to serialize gal into /tmp/LTL8218834874947117616.gal : 1 ms
[2021-05-09 12:30:23] [INFO ] Time to serialize properties into /tmp/LTL987980952597377953.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL8218834874947117616.gal, -t, CGAL, -LTL, /tmp/LTL987980952597377953.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8218834874947117616.gal -t CGAL -LTL /tmp/LTL987980952597377953.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((X(F("(gi0.gu2.MwU>=1)")))U(("(gu5.CG<=gu5.SF)")||(G(F("(gu4.SpA<=gu4.CF)")))))))
Formula 0 simplified : !X(XF"(gi0.gu2.MwU>=1)" U ("(gu5.CG<=gu5.SF)" | GF"(gu4.SpA<=gu4.CF)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15230809178669950746
[2021-05-09 12:30:38] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15230809178669950746
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin15230809178669950746]
Compilation finished in 108 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin15230809178669950746]
Link finished in 40 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X((X(<>((LTLAPp0==true))) U ((LTLAPp1==true)||[](<>((LTLAPp2==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin15230809178669950746]
LTSmin run took 248 ms.
FORMULA ClientsAndServers-PT-N0010P0-15 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0010P0-15 finished in 31696 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620563439159

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ClientsAndServers-PT-N0010P0"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ClientsAndServers-PT-N0010P0, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r045-oct2-162038291500148"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ClientsAndServers-PT-N0010P0.tgz
mv ClientsAndServers-PT-N0010P0 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;