Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r101-tall-167814475300420.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is DES-PT-10b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r101-tall-167814475300420
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 6.9K Feb 26 15:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 15:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 15:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 15:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 15:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 166K Feb 26 15:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 15:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Feb 26 15:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 79K Mar 5 18:22 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 DES-PT-10b-LTLFireability-00
FORMULA_NAME DES-PT-10b-LTLFireability-01
FORMULA_NAME DES-PT-10b-LTLFireability-02
FORMULA_NAME DES-PT-10b-LTLFireability-03
FORMULA_NAME DES-PT-10b-LTLFireability-04
FORMULA_NAME DES-PT-10b-LTLFireability-05
FORMULA_NAME DES-PT-10b-LTLFireability-06
FORMULA_NAME DES-PT-10b-LTLFireability-07
FORMULA_NAME DES-PT-10b-LTLFireability-08
FORMULA_NAME DES-PT-10b-LTLFireability-09
FORMULA_NAME DES-PT-10b-LTLFireability-10
FORMULA_NAME DES-PT-10b-LTLFireability-11
FORMULA_NAME DES-PT-10b-LTLFireability-12
FORMULA_NAME DES-PT-10b-LTLFireability-13
FORMULA_NAME DES-PT-10b-LTLFireability-14
FORMULA_NAME DES-PT-10b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678265073801

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-10b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-08 08:44:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-08 08:44:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 08:44:35] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2023-03-08 08:44:35] [INFO ] Transformed 320 places.
[2023-03-08 08:44:35] [INFO ] Transformed 271 transitions.
[2023-03-08 08:44:35] [INFO ] Found NUPN structural information;
[2023-03-08 08:44:35] [INFO ] Parsed PT model containing 320 places and 271 transitions and 827 arcs in 127 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA DES-PT-10b-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10b-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10b-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 271/271 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 317 transition count 271
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 27 place count 293 transition count 247
Iterating global reduction 1 with 24 rules applied. Total rules applied 51 place count 293 transition count 247
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 62 place count 282 transition count 236
Iterating global reduction 1 with 11 rules applied. Total rules applied 73 place count 282 transition count 236
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 81 place count 282 transition count 228
Applied a total of 81 rules in 58 ms. Remains 282 /320 variables (removed 38) and now considering 228/271 (removed 43) transitions.
// Phase 1: matrix 228 rows 282 cols
[2023-03-08 08:44:35] [INFO ] Computed 62 place invariants in 25 ms
[2023-03-08 08:44:36] [INFO ] Implicit Places using invariants in 449 ms returned []
[2023-03-08 08:44:36] [INFO ] Invariant cache hit.
[2023-03-08 08:44:36] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 795 ms to find 0 implicit places.
[2023-03-08 08:44:36] [INFO ] Invariant cache hit.
[2023-03-08 08:44:36] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 282/320 places, 228/271 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 996 ms. Remains : 282/320 places, 228/271 transitions.
Support contains 44 out of 282 places after structural reductions.
[2023-03-08 08:44:36] [INFO ] Flatten gal took : 41 ms
[2023-03-08 08:44:36] [INFO ] Flatten gal took : 18 ms
[2023-03-08 08:44:36] [INFO ] Input system was already deterministic with 228 transitions.
Incomplete random walk after 10000 steps, including 92 resets, run finished after 439 ms. (steps per millisecond=22 ) properties (out of 27) seen :20
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :1
Running SMT prover for 6 properties.
[2023-03-08 08:44:37] [INFO ] Invariant cache hit.
[2023-03-08 08:44:37] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 08:44:37] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 11 ms returned sat
[2023-03-08 08:44:37] [INFO ] After 129ms SMT Verify possible using state equation in real domain returned unsat :2 sat :2 real:2
[2023-03-08 08:44:38] [INFO ] Deduced a trap composed of 32 places in 177 ms of which 5 ms to minimize.
[2023-03-08 08:44:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 207 ms
[2023-03-08 08:44:38] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2023-03-08 08:44:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2023-03-08 08:44:38] [INFO ] After 446ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :0 real:4
[2023-03-08 08:44:38] [INFO ] After 609ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:4
[2023-03-08 08:44:38] [INFO ] [Nat]Absence check using 33 positive place invariants in 8 ms returned sat
[2023-03-08 08:44:38] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 11 ms returned sat
[2023-03-08 08:44:38] [INFO ] After 151ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :4
[2023-03-08 08:44:38] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2023-03-08 08:44:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2023-03-08 08:44:38] [INFO ] After 332ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 79 ms.
[2023-03-08 08:44:38] [INFO ] After 535ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 1 properties in 151 ms.
Support contains 8 out of 282 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 282/282 places, 228/228 transitions.
Graph (complete) has 549 edges and 282 vertex of which 279 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 279 transition count 207
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 35 place count 263 transition count 207
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 35 place count 263 transition count 197
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 55 place count 253 transition count 197
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 60 place count 248 transition count 192
Iterating global reduction 2 with 5 rules applied. Total rules applied 65 place count 248 transition count 192
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 2 with 5 rules applied. Total rules applied 70 place count 248 transition count 187
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 72 place count 247 transition count 186
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 72 place count 247 transition count 184
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 76 place count 245 transition count 184
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 77 place count 244 transition count 183
Iterating global reduction 4 with 1 rules applied. Total rules applied 78 place count 244 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 79 place count 244 transition count 182
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 79 place count 244 transition count 181
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 81 place count 243 transition count 181
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 1 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 5 with 146 rules applied. Total rules applied 227 place count 170 transition count 108
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 231 place count 168 transition count 110
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 233 place count 168 transition count 108
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 235 place count 166 transition count 108
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 236 place count 166 transition count 107
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 237 place count 165 transition count 107
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 238 place count 164 transition count 106
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 239 place count 163 transition count 106
Applied a total of 239 rules in 92 ms. Remains 163 /282 variables (removed 119) and now considering 106/228 (removed 122) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 163/282 places, 106/228 transitions.
Incomplete random walk after 10000 steps, including 382 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 106 rows 163 cols
[2023-03-08 08:44:39] [INFO ] Computed 63 place invariants in 6 ms
[2023-03-08 08:44:39] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 08:44:39] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 8 ms returned sat
[2023-03-08 08:44:39] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 08:44:39] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 08:44:39] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 7 ms returned sat
[2023-03-08 08:44:39] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 08:44:39] [INFO ] After 81ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-08 08:44:39] [INFO ] After 187ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 27 ms.
Support contains 6 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 106/106 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 162 transition count 105
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 162 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 161 transition count 104
Applied a total of 4 rules in 28 ms. Remains 161 /163 variables (removed 2) and now considering 104/106 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 161/163 places, 104/106 transitions.
Incomplete random walk after 10000 steps, including 399 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Finished probabilistic random walk after 305818 steps, run visited all 2 properties in 988 ms. (steps per millisecond=309 )
Probabilistic random walk after 305818 steps, saw 73803 distinct states, run finished after 989 ms. (steps per millisecond=309 ) properties seen :2
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA DES-PT-10b-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10b-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 97 stabilizing places and 89 stable transitions
Graph (complete) has 549 edges and 282 vertex of which 275 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.5 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(p1)&&p0))&&X(X((!X(p2) U p3)))))'
Support contains 7 out of 282 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 282/282 places, 228/228 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 276 transition count 222
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 276 transition count 222
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 16 place count 276 transition count 218
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 274 transition count 216
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 274 transition count 216
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 22 place count 274 transition count 214
Applied a total of 22 rules in 12 ms. Remains 274 /282 variables (removed 8) and now considering 214/228 (removed 14) transitions.
// Phase 1: matrix 214 rows 274 cols
[2023-03-08 08:44:41] [INFO ] Computed 62 place invariants in 8 ms
[2023-03-08 08:44:41] [INFO ] Implicit Places using invariants in 123 ms returned []
[2023-03-08 08:44:41] [INFO ] Invariant cache hit.
[2023-03-08 08:44:41] [INFO ] Implicit Places using invariants and state equation in 245 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 372 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 273/282 places, 214/228 transitions.
Applied a total of 0 rules in 4 ms. Remains 273 /273 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 388 ms. Remains : 273/282 places, 214/228 transitions.
Stuttering acceptance computed with spot in 404 ms :[(OR (NOT p3) (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p3), (NOT p1), (NOT p3), (OR (NOT p3) p2), true]
Running random walk in product with property : DES-PT-10b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=5 dest: 5}, { cond=p2, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s166 1) (EQ s196 1)), p1:(EQ s138 1), p3:(OR (EQ s138 1) (AND (EQ s243 1) (EQ s269 1))), p2:(AND (EQ s249 1) (EQ s258 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 125 steps with 0 reset in 9 ms.
FORMULA DES-PT-10b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-LTLFireability-00 finished in 868 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(X(G((p1&&F(G(p1))))))))'
Support contains 3 out of 282 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 282/282 places, 228/228 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 276 transition count 222
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 276 transition count 222
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 16 place count 276 transition count 218
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 274 transition count 216
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 274 transition count 216
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 22 place count 274 transition count 214
Applied a total of 22 rules in 31 ms. Remains 274 /282 variables (removed 8) and now considering 214/228 (removed 14) transitions.
[2023-03-08 08:44:41] [INFO ] Invariant cache hit.
[2023-03-08 08:44:41] [INFO ] Implicit Places using invariants in 115 ms returned []
[2023-03-08 08:44:41] [INFO ] Invariant cache hit.
[2023-03-08 08:44:42] [INFO ] Implicit Places using invariants and state equation in 265 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 399 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 273/282 places, 214/228 transitions.
Applied a total of 0 rules in 14 ms. Remains 273 /273 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 446 ms. Remains : 273/282 places, 214/228 transitions.
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-10b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (EQ s105 1) (EQ s107 1)), p1:(EQ s264 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 106 steps with 0 reset in 2 ms.
FORMULA DES-PT-10b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-LTLFireability-02 finished in 639 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 282 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 282/282 places, 228/228 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 276 transition count 222
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 276 transition count 222
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 16 place count 276 transition count 218
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 274 transition count 216
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 274 transition count 216
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 22 place count 274 transition count 214
Applied a total of 22 rules in 18 ms. Remains 274 /282 variables (removed 8) and now considering 214/228 (removed 14) transitions.
[2023-03-08 08:44:42] [INFO ] Invariant cache hit.
[2023-03-08 08:44:42] [INFO ] Implicit Places using invariants in 121 ms returned []
[2023-03-08 08:44:42] [INFO ] Invariant cache hit.
[2023-03-08 08:44:42] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
[2023-03-08 08:44:42] [INFO ] Invariant cache hit.
[2023-03-08 08:44:42] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 274/282 places, 214/228 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 512 ms. Remains : 274/282 places, 214/228 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-10b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s5 1) (EQ s16 1) (EQ s27 1) (EQ s38 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-10b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-LTLFireability-03 finished in 610 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||((F(p1)&&F(!p2)) U X(X(X(p1))))))'
Support contains 4 out of 282 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 282/282 places, 228/228 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 277 transition count 223
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 277 transition count 223
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 277 transition count 220
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 275 transition count 218
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 275 transition count 218
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 19 place count 275 transition count 216
Applied a total of 19 rules in 14 ms. Remains 275 /282 variables (removed 7) and now considering 216/228 (removed 12) transitions.
// Phase 1: matrix 216 rows 275 cols
[2023-03-08 08:44:43] [INFO ] Computed 62 place invariants in 7 ms
[2023-03-08 08:44:43] [INFO ] Implicit Places using invariants in 122 ms returned []
[2023-03-08 08:44:43] [INFO ] Invariant cache hit.
[2023-03-08 08:44:43] [INFO ] Implicit Places using invariants and state equation in 245 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 378 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 274/282 places, 216/228 transitions.
Applied a total of 0 rules in 4 ms. Remains 274 /274 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 396 ms. Remains : 274/282 places, 216/228 transitions.
Stuttering acceptance computed with spot in 852 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND p2 (NOT p1)), (AND (NOT p0) (NOT p1)), (AND p2 (NOT p1) (NOT p0)), (NOT p1), (AND p2 (NOT p1)), (AND p2 (NOT p1)), (AND (NOT p0) (NOT p1)), (AND p2 (NOT p0) (NOT p1)), (AND p2 (NOT p1) (NOT p0)), (NOT p1), (AND p2 (NOT p1)), (AND p2 (NOT p1)), (AND p2 (NOT p1)), (AND (NOT p0) (NOT p1)), (AND p2 (NOT p0) (NOT p1)), (AND p2 (NOT p1) (NOT p0)), (AND p2 (NOT p0) (NOT p1)), p2, (AND p2 (NOT p0))]
Running random walk in product with property : DES-PT-10b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}, { cond=(AND p0 p2), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 5}, { cond=p2, acceptance={} source=1 dest: 6}], [{ cond=p2, acceptance={} source=2 dest: 7}], [{ cond=(NOT p0), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 6}, { cond=p0, acceptance={} source=3 dest: 8}, { cond=(AND p0 p2), acceptance={} source=3 dest: 9}], [{ cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 7}, { cond=(AND p0 p2), acceptance={} source=4 dest: 10}], [{ cond=true, acceptance={} source=5 dest: 11}, { cond=p2, acceptance={} source=5 dest: 12}], [{ cond=p2, acceptance={} source=6 dest: 13}], [{ cond=p2, acceptance={} source=7 dest: 14}], [{ cond=(NOT p0), acceptance={} source=8 dest: 11}, { cond=(AND (NOT p0) p2), acceptance={} source=8 dest: 12}, { cond=p0, acceptance={} source=8 dest: 15}, { cond=(AND p0 p2), acceptance={} source=8 dest: 16}], [{ cond=(AND (NOT p0) p2), acceptance={} source=9 dest: 13}, { cond=(AND p0 p2), acceptance={} source=9 dest: 17}], [{ cond=(AND (NOT p0) p2), acceptance={} source=10 dest: 14}, { cond=(AND p0 p2), acceptance={} source=10 dest: 18}], [{ cond=(NOT p1), acceptance={0} source=11 dest: 11}, { cond=(AND (NOT p1) p2), acceptance={0} source=11 dest: 12}], [{ cond=(AND (NOT p1) p2), acceptance={} source=12 dest: 13}], [{ cond=(AND (NOT p1) p2), acceptance={} source=13 dest: 14}], [{ cond=(AND (NOT p1) p2), acceptance={} source=14 dest: 19}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=15 dest: 11}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=15 dest: 12}, { cond=(AND p0 (NOT p1)), acceptance={} source=15 dest: 15}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=15 dest: 16}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=16 dest: 13}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=16 dest: 17}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=17 dest: 14}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=17 dest: 18}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=18 dest: 19}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=18 dest: 20}], [{ cond=p2, acceptance={0} source=19 dest: 19}], [{ cond=(AND (NOT p0) p2), acceptance={} source=20 dest: 19}, { cond=(AND p0 p2), acceptance={} source=20 dest: 20}]], initial=0, aps=[p0:(EQ s100 1), p2:(AND (EQ s60 1) (EQ s111 1)), p1:(NEQ s124 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 254 ms.
Product exploration explored 100000 steps with 25000 reset in 176 ms.
Computed a total of 96 stabilizing places and 89 stable transitions
Graph (complete) has 530 edges and 274 vertex of which 269 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Computed a total of 96 stabilizing places and 89 stable transitions
Detected a total of 96/274 stabilizing places and 89/216 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X (NOT (AND p0 p2))), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 529 ms. Reduced automaton from 21 states, 43 edges and 3 AP (stutter sensitive) to 8 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 336 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p2 (NOT p1)), (AND p2 (NOT p1)), (AND p2 (NOT p1)), p2]
Finished random walk after 620 steps, including 6 resets, run visited all 3 properties in 9 ms. (steps per millisecond=68 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X (NOT (AND p0 p2))), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F p2), (F (AND p2 (NOT p1)))]
Knowledge based reduction with 11 factoid took 610 ms. Reduced automaton from 8 states, 9 edges and 2 AP (stutter sensitive) to 8 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 354 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p2 (NOT p1)), (AND p2 (NOT p1)), (AND p2 (NOT p1)), p2]
Stuttering acceptance computed with spot in 305 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p2 (NOT p1)), (AND p2 (NOT p1)), (AND p2 (NOT p1)), p2]
Support contains 3 out of 274 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 274 /274 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 274 cols
[2023-03-08 08:44:46] [INFO ] Computed 61 place invariants in 5 ms
[2023-03-08 08:44:47] [INFO ] Implicit Places using invariants in 196 ms returned []
[2023-03-08 08:44:47] [INFO ] Invariant cache hit.
[2023-03-08 08:44:47] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 458 ms to find 0 implicit places.
[2023-03-08 08:44:47] [INFO ] Invariant cache hit.
[2023-03-08 08:44:47] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 593 ms. Remains : 274/274 places, 216/216 transitions.
Computed a total of 96 stabilizing places and 89 stable transitions
Graph (complete) has 530 edges and 274 vertex of which 269 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Computed a total of 96 stabilizing places and 89 stable transitions
Detected a total of 96/274 stabilizing places and 89/216 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p2)), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 138 ms. Reduced automaton from 8 states, 9 edges and 2 AP (stutter sensitive) to 8 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 416 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p2 (NOT p1)), (AND p2 (NOT p1)), (AND p2 (NOT p1)), p2]
Incomplete random walk after 10000 steps, including 89 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :2
Finished Best-First random walk after 588 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=294 )
Knowledge obtained : [(AND p1 (NOT p2)), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F p2), (F (AND p2 (NOT p1)))]
Knowledge based reduction with 3 factoid took 241 ms. Reduced automaton from 8 states, 9 edges and 2 AP (stutter sensitive) to 8 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 331 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p2 (NOT p1)), (AND p2 (NOT p1)), (AND p2 (NOT p1)), p2]
Stuttering acceptance computed with spot in 315 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p2 (NOT p1)), (AND p2 (NOT p1)), (AND p2 (NOT p1)), p2]
Stuttering acceptance computed with spot in 320 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p2 (NOT p1)), (AND p2 (NOT p1)), (AND p2 (NOT p1)), p2]
Product exploration explored 100000 steps with 25000 reset in 128 ms.
Product exploration explored 100000 steps with 25000 reset in 128 ms.
Applying partial POR strategy [false, false, false, false, false, false, true, true]
Stuttering acceptance computed with spot in 353 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p2 (NOT p1)), (AND p2 (NOT p1)), (AND p2 (NOT p1)), p2]
Support contains 3 out of 274 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 274/274 places, 216/216 transitions.
Graph (complete) has 530 edges and 274 vertex of which 269 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 269 transition count 213
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 16 place count 269 transition count 215
Deduced a syphon composed of 23 places in 1 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 24 place count 269 transition count 215
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 29 place count 264 transition count 210
Deduced a syphon composed of 18 places in 1 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 34 place count 264 transition count 210
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 94 places in 0 ms
Iterating global reduction 1 with 76 rules applied. Total rules applied 110 place count 264 transition count 213
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 119 place count 255 transition count 204
Deduced a syphon composed of 85 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 128 place count 255 transition count 204
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 90 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 133 place count 255 transition count 224
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 135 place count 253 transition count 218
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 137 place count 253 transition count 218
Deduced a syphon composed of 88 places in 0 ms
Applied a total of 137 rules in 87 ms. Remains 253 /274 variables (removed 21) and now considering 218/216 (removed -2) transitions.
[2023-03-08 08:44:50] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 218 rows 253 cols
[2023-03-08 08:44:50] [INFO ] Computed 59 place invariants in 5 ms
[2023-03-08 08:44:50] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 253/274 places, 218/216 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 227 ms. Remains : 253/274 places, 218/216 transitions.
Built C files in :
/tmp/ltsmin5214262159878946330
[2023-03-08 08:44:50] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5214262159878946330
Running compilation step : cd /tmp/ltsmin5214262159878946330;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 420 ms.
Running link step : cd /tmp/ltsmin5214262159878946330;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin5214262159878946330;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16462700030665362355.hoa' '--buchi-type=spotba'
LTSmin run took 392 ms.
FORMULA DES-PT-10b-LTLFireability-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-10b-LTLFireability-04 finished in 8223 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 3 out of 282 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 282/282 places, 228/228 transitions.
Graph (complete) has 549 edges and 282 vertex of which 275 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 274 transition count 209
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 260 transition count 209
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 29 place count 260 transition count 199
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 49 place count 250 transition count 199
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 53 place count 246 transition count 195
Iterating global reduction 2 with 4 rules applied. Total rules applied 57 place count 246 transition count 195
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 2 with 4 rules applied. Total rules applied 61 place count 246 transition count 191
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 63 place count 245 transition count 190
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 63 place count 245 transition count 189
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 65 place count 244 transition count 189
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 66 place count 243 transition count 188
Iterating global reduction 4 with 1 rules applied. Total rules applied 67 place count 243 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 68 place count 243 transition count 187
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 68 place count 243 transition count 186
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 70 place count 242 transition count 186
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 5 with 148 rules applied. Total rules applied 218 place count 168 transition count 112
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 222 place count 166 transition count 114
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 224 place count 164 transition count 112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 225 place count 163 transition count 112
Applied a total of 225 rules in 53 ms. Remains 163 /282 variables (removed 119) and now considering 112/228 (removed 116) transitions.
// Phase 1: matrix 112 rows 163 cols
[2023-03-08 08:44:51] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-08 08:44:51] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-08 08:44:51] [INFO ] Invariant cache hit.
[2023-03-08 08:44:51] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
[2023-03-08 08:44:51] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 08:44:51] [INFO ] Invariant cache hit.
[2023-03-08 08:44:51] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 163/282 places, 112/228 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 374 ms. Remains : 163/282 places, 112/228 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DES-PT-10b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s63 0) (EQ s68 0)), p1:(EQ s84 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 20 steps with 2 reset in 0 ms.
FORMULA DES-PT-10b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-LTLFireability-05 finished in 503 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U G(p1)) U X(!p2)))'
Support contains 6 out of 282 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 282/282 places, 228/228 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 277 transition count 223
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 277 transition count 223
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 277 transition count 220
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 275 transition count 218
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 275 transition count 218
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 19 place count 275 transition count 216
Applied a total of 19 rules in 19 ms. Remains 275 /282 variables (removed 7) and now considering 216/228 (removed 12) transitions.
// Phase 1: matrix 216 rows 275 cols
[2023-03-08 08:44:51] [INFO ] Computed 62 place invariants in 5 ms
[2023-03-08 08:44:51] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-08 08:44:51] [INFO ] Invariant cache hit.
[2023-03-08 08:44:52] [INFO ] Implicit Places using invariants and state equation in 206 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 319 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 274/282 places, 216/228 transitions.
Applied a total of 0 rules in 4 ms. Remains 274 /274 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 342 ms. Remains : 274/282 places, 216/228 transitions.
Stuttering acceptance computed with spot in 362 ms :[p2, p2, (AND p1 (NOT p0) p2), (AND (NOT p1) p2), p2, (AND (NOT p1) p2), true, (AND p1 (NOT p0)), (NOT p1), (NOT p1)]
Running random walk in product with property : DES-PT-10b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}, { cond=(OR p1 p0), acceptance={} source=0 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 5}], [{ cond=p2, acceptance={} source=1 dest: 6}], [{ cond=(AND p1 (NOT p0) p2), acceptance={} source=2 dest: 6}, { cond=(AND p1 p0 p2), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=3 dest: 7}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=3 dest: 8}, { cond=(AND p0 p2), acceptance={} source=3 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=4 dest: 2}, { cond=(AND p0 p2), acceptance={} source=4 dest: 3}, { cond=(OR (AND p1 p2) (AND p0 p2)), acceptance={0} source=4 dest: 4}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 6}, { cond=(AND p1 p2), acceptance={} source=5 dest: 8}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=7 dest: 6}, { cond=(AND p1 p0), acceptance={} source=7 dest: 7}], [{ cond=(NOT p1), acceptance={} source=8 dest: 6}, { cond=p1, acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={} source=9 dest: 7}, { cond=(AND p1 (NOT p0)), acceptance={} source=9 dest: 8}, { cond=(AND p1 p0), acceptance={} source=9 dest: 9}, { cond=(AND (NOT p1) p0), acceptance={0} source=9 dest: 9}]], initial=0, aps=[p1:(AND (EQ s85 1) (EQ s230 1)), p0:(AND (EQ s76 1) (EQ s256 1)), p2:(AND (EQ s36 1) (EQ s62 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 198 ms.
Product exploration explored 100000 steps with 50000 reset in 189 ms.
Computed a total of 96 stabilizing places and 89 stable transitions
Graph (complete) has 530 edges and 274 vertex of which 269 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Computed a total of 96 stabilizing places and 89 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 p2))), (X (NOT (AND p0 p2))), (X (NOT (OR (AND p1 p2) (AND p0 p2)))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p1) p0 p2))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p1))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), true, (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (OR (AND p1 p2) (AND p0 p2))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p2))
Knowledge based reduction with 25 factoid took 401 ms. Reduced automaton from 10 states, 29 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-10b-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-10b-LTLFireability-06 finished in 1520 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(!p0)) U p1))'
Support contains 3 out of 282 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 282/282 places, 228/228 transitions.
Graph (complete) has 549 edges and 282 vertex of which 276 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 275 transition count 210
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 261 transition count 210
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 29 place count 261 transition count 200
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 49 place count 251 transition count 200
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 54 place count 246 transition count 195
Iterating global reduction 2 with 5 rules applied. Total rules applied 59 place count 246 transition count 195
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 2 with 5 rules applied. Total rules applied 64 place count 246 transition count 190
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 66 place count 245 transition count 189
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 66 place count 245 transition count 187
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 70 place count 243 transition count 187
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 71 place count 242 transition count 186
Iterating global reduction 4 with 1 rules applied. Total rules applied 72 place count 242 transition count 186
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 73 place count 242 transition count 185
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 73 place count 242 transition count 184
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 75 place count 241 transition count 184
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 5 with 148 rules applied. Total rules applied 223 place count 167 transition count 110
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 227 place count 165 transition count 112
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 228 place count 165 transition count 112
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 230 place count 163 transition count 110
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 231 place count 162 transition count 110
Applied a total of 231 rules in 46 ms. Remains 162 /282 variables (removed 120) and now considering 110/228 (removed 118) transitions.
// Phase 1: matrix 110 rows 162 cols
[2023-03-08 08:44:53] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 08:44:53] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-08 08:44:53] [INFO ] Invariant cache hit.
[2023-03-08 08:44:53] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
[2023-03-08 08:44:53] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 08:44:53] [INFO ] Invariant cache hit.
[2023-03-08 08:44:53] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 162/282 places, 110/228 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 365 ms. Remains : 162/282 places, 110/228 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), p0, p0]
Running random walk in product with property : DES-PT-10b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=(NOT p1), acceptance={0} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s58 1), p0:(AND (EQ s22 1) (EQ s73 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 5907 steps with 304 reset in 19 ms.
FORMULA DES-PT-10b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-LTLFireability-07 finished in 508 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0)) U (!p1&&G(!p2))))'
Support contains 5 out of 282 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 282/282 places, 228/228 transitions.
Graph (complete) has 549 edges and 282 vertex of which 275 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 274 transition count 211
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 262 transition count 210
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 261 transition count 210
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 27 place count 261 transition count 201
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 45 place count 252 transition count 201
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 50 place count 247 transition count 196
Iterating global reduction 3 with 5 rules applied. Total rules applied 55 place count 247 transition count 196
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 3 with 5 rules applied. Total rules applied 60 place count 247 transition count 191
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 62 place count 246 transition count 190
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 62 place count 246 transition count 188
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 66 place count 244 transition count 188
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 67 place count 243 transition count 187
Iterating global reduction 5 with 1 rules applied. Total rules applied 68 place count 243 transition count 187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 69 place count 243 transition count 186
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 69 place count 243 transition count 185
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 71 place count 242 transition count 185
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 6 with 148 rules applied. Total rules applied 219 place count 168 transition count 111
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 221 place count 167 transition count 111
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 223 place count 165 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 224 place count 164 transition count 109
Applied a total of 224 rules in 42 ms. Remains 164 /282 variables (removed 118) and now considering 109/228 (removed 119) transitions.
// Phase 1: matrix 109 rows 164 cols
[2023-03-08 08:44:53] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 08:44:53] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-03-08 08:44:53] [INFO ] Invariant cache hit.
[2023-03-08 08:44:54] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
[2023-03-08 08:44:54] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 08:44:54] [INFO ] Invariant cache hit.
[2023-03-08 08:44:54] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 164/282 places, 109/228 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 396 ms. Remains : 164/282 places, 109/228 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR p1 p2), (NOT p0), p2]
Running random walk in product with property : DES-PT-10b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(OR p1 p2), acceptance={0} source=0 dest: 0}, { cond=(OR p1 p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={0} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s54 1) (EQ s133 1) (EQ s47 1)), p2:(EQ s158 1), p0:(NEQ s83 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 3866 reset in 226 ms.
Product exploration explored 100000 steps with 3773 reset in 263 ms.
Computed a total of 57 stabilizing places and 52 stable transitions
Computed a total of 57 stabilizing places and 52 stable transitions
Detected a total of 57/164 stabilizing places and 52/109 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (OR p1 p2))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (OR p1 p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 8 factoid took 361 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(OR p1 p2), (NOT p0), p2]
Finished random walk after 11 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (OR p1 p2))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (OR p1 p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F p2), (F (OR p1 p2)), (F (NOT p0)), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 8 factoid took 474 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 128 ms :[(OR p1 p2), (NOT p0), p2]
Stuttering acceptance computed with spot in 128 ms :[(OR p1 p2), (NOT p0), p2]
Support contains 5 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 109/109 transitions.
Applied a total of 0 rules in 5 ms. Remains 164 /164 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2023-03-08 08:44:56] [INFO ] Invariant cache hit.
[2023-03-08 08:44:56] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-08 08:44:56] [INFO ] Invariant cache hit.
[2023-03-08 08:44:56] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
[2023-03-08 08:44:56] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 08:44:56] [INFO ] Invariant cache hit.
[2023-03-08 08:44:56] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 320 ms. Remains : 164/164 places, 109/109 transitions.
Computed a total of 57 stabilizing places and 52 stable transitions
Computed a total of 57 stabilizing places and 52 stable transitions
Detected a total of 57/164 stabilizing places and 52/109 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (OR p1 p2))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (OR p1 p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 8 factoid took 387 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(OR p1 p2), (NOT p0), p2]
Finished random walk after 5 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (OR p1 p2))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (OR p1 p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F p2), (F (OR p1 p2)), (F (NOT p0)), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 8 factoid took 469 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 141 ms :[(OR p1 p2), (NOT p0), p2]
Stuttering acceptance computed with spot in 119 ms :[(OR p1 p2), (NOT p0), p2]
Stuttering acceptance computed with spot in 121 ms :[(OR p1 p2), (NOT p0), p2]
Product exploration explored 100000 steps with 3817 reset in 207 ms.
Product exploration explored 100000 steps with 3775 reset in 208 ms.
Built C files in :
/tmp/ltsmin12029844079371374364
[2023-03-08 08:44:58] [INFO ] Computing symmetric may disable matrix : 109 transitions.
[2023-03-08 08:44:58] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 08:44:58] [INFO ] Computing symmetric may enable matrix : 109 transitions.
[2023-03-08 08:44:58] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 08:44:58] [INFO ] Computing Do-Not-Accords matrix : 109 transitions.
[2023-03-08 08:44:58] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 08:44:58] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12029844079371374364
Running compilation step : cd /tmp/ltsmin12029844079371374364;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 229 ms.
Running link step : cd /tmp/ltsmin12029844079371374364;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin12029844079371374364;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6417279993495579932.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 109/109 transitions.
Applied a total of 0 rules in 5 ms. Remains 164 /164 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2023-03-08 08:45:13] [INFO ] Invariant cache hit.
[2023-03-08 08:45:13] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-08 08:45:13] [INFO ] Invariant cache hit.
[2023-03-08 08:45:13] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
[2023-03-08 08:45:13] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 08:45:13] [INFO ] Invariant cache hit.
[2023-03-08 08:45:13] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 340 ms. Remains : 164/164 places, 109/109 transitions.
Built C files in :
/tmp/ltsmin4393527004108223787
[2023-03-08 08:45:13] [INFO ] Computing symmetric may disable matrix : 109 transitions.
[2023-03-08 08:45:13] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 08:45:13] [INFO ] Computing symmetric may enable matrix : 109 transitions.
[2023-03-08 08:45:13] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 08:45:13] [INFO ] Computing Do-Not-Accords matrix : 109 transitions.
[2023-03-08 08:45:13] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 08:45:13] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4393527004108223787
Running compilation step : cd /tmp/ltsmin4393527004108223787;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 246 ms.
Running link step : cd /tmp/ltsmin4393527004108223787;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin4393527004108223787;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6382128018556089091.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-08 08:45:28] [INFO ] Flatten gal took : 10 ms
[2023-03-08 08:45:28] [INFO ] Flatten gal took : 9 ms
[2023-03-08 08:45:28] [INFO ] Time to serialize gal into /tmp/LTL3877423879830745471.gal : 2 ms
[2023-03-08 08:45:28] [INFO ] Time to serialize properties into /tmp/LTL11785487167312577785.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3877423879830745471.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3164784542881584690.hoa' '-atoms' '/tmp/LTL11785487167312577785.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL11785487167312577785.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3164784542881584690.hoa
Detected timeout of ITS tools.
[2023-03-08 08:45:43] [INFO ] Flatten gal took : 9 ms
[2023-03-08 08:45:43] [INFO ] Flatten gal took : 8 ms
[2023-03-08 08:45:43] [INFO ] Time to serialize gal into /tmp/LTL12216068348314335747.gal : 2 ms
[2023-03-08 08:45:43] [INFO ] Time to serialize properties into /tmp/LTL10468600877126615116.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12216068348314335747.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10468600877126615116.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((F(G("(p186!=1)")))U((!("(((p112==1)&&(p271==1))&&(p83==1))"))&&(G("(p311!=1)")))))
Formula 0 simplified : GF!"(p186!=1)" R ("(((p112==1)&&(p271==1))&&(p83==1))" | F!"(p311!=1)")
Detected timeout of ITS tools.
[2023-03-08 08:45:59] [INFO ] Flatten gal took : 8 ms
[2023-03-08 08:45:59] [INFO ] Applying decomposition
[2023-03-08 08:45:59] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph8632362947125756699.txt' '-o' '/tmp/graph8632362947125756699.bin' '-w' '/tmp/graph8632362947125756699.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph8632362947125756699.bin' '-l' '-1' '-v' '-w' '/tmp/graph8632362947125756699.weights' '-q' '0' '-e' '0.001'
[2023-03-08 08:45:59] [INFO ] Decomposing Gal with order
[2023-03-08 08:45:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 08:45:59] [INFO ] Removed a total of 31 redundant transitions.
[2023-03-08 08:45:59] [INFO ] Flatten gal took : 45 ms
[2023-03-08 08:45:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 23 labels/synchronizations in 5 ms.
[2023-03-08 08:45:59] [INFO ] Time to serialize gal into /tmp/LTL4581476517515514830.gal : 3 ms
[2023-03-08 08:45:59] [INFO ] Time to serialize properties into /tmp/LTL17084417936365763764.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4581476517515514830.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17084417936365763764.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((F(G("(i1.u13.p186!=1)")))U((!("(((i2.u6.p112==1)&&(i2.u30.p271==1))&&(i0.u3.p83==1))"))&&(G("(i14.u42.p311!=1)")))))
Formula 0 simplified : GF!"(i1.u13.p186!=1)" R ("(((i2.u6.p112==1)&&(i2.u30.p271==1))&&(i0.u3.p83==1))" | F!"(i14.u42.p311!=1)")
Reverse transition relation is NOT exact ! Due to transitions t7_t48, t221_t79, t36_t38_t49_t65_t66_t67_t68_t69_t70_t71_t50_t52_t54_t56_t58_t60_t62, t9_t34...559
Computing Next relation with stutter on 6.47736e+06 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16205907970095845896
[2023-03-08 08:46:14] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16205907970095845896
Running compilation step : cd /tmp/ltsmin16205907970095845896;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 208 ms.
Running link step : cd /tmp/ltsmin16205907970095845896;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin16205907970095845896;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>([]((LTLAPp0==true))) U (!(LTLAPp1==true)&&[](!(LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-10b-LTLFireability-10 finished in 95630 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p1&&G(p2))||p0)))'
Support contains 4 out of 282 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 282/282 places, 228/228 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 277 transition count 223
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 277 transition count 223
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 14 place count 277 transition count 219
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 276 transition count 218
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 276 transition count 218
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 17 place count 276 transition count 217
Applied a total of 17 rules in 10 ms. Remains 276 /282 variables (removed 6) and now considering 217/228 (removed 11) transitions.
// Phase 1: matrix 217 rows 276 cols
[2023-03-08 08:46:29] [INFO ] Computed 62 place invariants in 5 ms
[2023-03-08 08:46:29] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-03-08 08:46:29] [INFO ] Invariant cache hit.
[2023-03-08 08:46:29] [INFO ] Implicit Places using invariants and state equation in 254 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 386 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 275/282 places, 217/228 transitions.
Applied a total of 0 rules in 2 ms. Remains 275 /275 variables (removed 0) and now considering 217/217 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 399 ms. Remains : 275/282 places, 217/228 transitions.
Stuttering acceptance computed with spot in 135 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : DES-PT-10b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 2}]], initial=1, aps=[p2:(EQ s185 0), p0:(OR (EQ s193 0) (EQ s223 0)), p1:(EQ s70 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 194 ms.
Product exploration explored 100000 steps with 50000 reset in 194 ms.
Computed a total of 96 stabilizing places and 89 stable transitions
Graph (complete) has 532 edges and 275 vertex of which 270 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 96 stabilizing places and 89 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND (NOT p0) p1 p2))), true, (X (X p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1 p2)))
Knowledge based reduction with 5 factoid took 102 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-10b-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-10b-LTLFireability-12 finished in 1063 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 282 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 282/282 places, 228/228 transitions.
Graph (complete) has 549 edges and 282 vertex of which 275 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 274 transition count 209
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 260 transition count 209
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 29 place count 260 transition count 199
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 49 place count 250 transition count 199
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 54 place count 245 transition count 194
Iterating global reduction 2 with 5 rules applied. Total rules applied 59 place count 245 transition count 194
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 2 with 5 rules applied. Total rules applied 64 place count 245 transition count 189
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 66 place count 244 transition count 188
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 66 place count 244 transition count 186
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 70 place count 242 transition count 186
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 71 place count 241 transition count 185
Iterating global reduction 4 with 1 rules applied. Total rules applied 72 place count 241 transition count 185
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 73 place count 241 transition count 184
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 73 place count 241 transition count 183
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 75 place count 240 transition count 183
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 1 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 5 with 150 rules applied. Total rules applied 225 place count 165 transition count 108
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 229 place count 163 transition count 110
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 231 place count 163 transition count 110
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 233 place count 161 transition count 108
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 234 place count 160 transition count 108
Applied a total of 234 rules in 34 ms. Remains 160 /282 variables (removed 122) and now considering 108/228 (removed 120) transitions.
// Phase 1: matrix 108 rows 160 cols
[2023-03-08 08:46:30] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-08 08:46:30] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-08 08:46:30] [INFO ] Invariant cache hit.
[2023-03-08 08:46:30] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
[2023-03-08 08:46:30] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 08:46:30] [INFO ] Invariant cache hit.
[2023-03-08 08:46:30] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 160/282 places, 108/228 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 361 ms. Remains : 160/282 places, 108/228 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-10b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s146 1) (EQ s150 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA DES-PT-10b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-LTLFireability-13 finished in 412 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0)) U (!p1&&G(!p2))))'
[2023-03-08 08:46:31] [INFO ] Flatten gal took : 16 ms
Using solver Z3 to compute partial order matrices.
[2023-03-08 08:46:31] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin14921661450286264556
[2023-03-08 08:46:31] [INFO ] Computing symmetric may disable matrix : 228 transitions.
[2023-03-08 08:46:31] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 08:46:31] [INFO ] Computing symmetric may enable matrix : 228 transitions.
[2023-03-08 08:46:31] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 08:46:31] [INFO ] Flatten gal took : 23 ms
[2023-03-08 08:46:31] [INFO ] Computing Do-Not-Accords matrix : 228 transitions.
[2023-03-08 08:46:31] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 08:46:31] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14921661450286264556
Running compilation step : cd /tmp/ltsmin14921661450286264556;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph18229950269282638402.txt' '-o' '/tmp/graph18229950269282638402.bin' '-w' '/tmp/graph18229950269282638402.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph18229950269282638402.bin' '-l' '-1' '-v' '-w' '/tmp/graph18229950269282638402.weights' '-q' '0' '-e' '0.001'
[2023-03-08 08:46:31] [INFO ] Decomposing Gal with order
[2023-03-08 08:46:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 08:46:31] [INFO ] Removed a total of 22 redundant transitions.
[2023-03-08 08:46:31] [INFO ] Flatten gal took : 39 ms
[2023-03-08 08:46:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 10 ms.
[2023-03-08 08:46:31] [INFO ] Time to serialize gal into /tmp/LTLFireability15650308087451908966.gal : 14 ms
[2023-03-08 08:46:31] [INFO ] Time to serialize properties into /tmp/LTLFireability2750383168818759544.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15650308087451908966.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2750383168818759544.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((F(G("(i12.i0.u38.p186!=1)")))U((!("(((i5.i1.u18.p112==1)&&(i9.i0.u60.p271==1))&&(i2.u11.p83==1))"))&&(G("(i12.i1.u78.p311!=1)"))))...156
Formula 0 simplified : GF!"(i12.i0.u38.p186!=1)" R ("(((i5.i1.u18.p112==1)&&(i9.i0.u60.p271==1))&&(i2.u11.p83==1))" | F!"(i12.i1.u78.p311!=1)")
Compilation finished in 414 ms.
Running link step : cd /tmp/ltsmin14921661450286264556;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin14921661450286264556;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '(<>([]((LTLAPp0==true))) U (!(LTLAPp1==true)&&[](!(LTLAPp2==true))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t0, t54, t88, t127, t167, t188, t189, t221, u36.t76, i1.i0.u6.t133, i1.i0.u6.t134, i1.i1.u12....841
Computing Next relation with stutter on 3.85942e+07 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.016: Initializing POR dependencies: labels 231, guards 228
pins2lts-mc-linux64( 2/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.034: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.333: LTL layer: formula: (<>([]((LTLAPp0==true))) U (!(LTLAPp1==true)&&[](!(LTLAPp2==true))))
pins2lts-mc-linux64( 5/ 8), 0.333: "(<>([]((LTLAPp0==true))) U (!(LTLAPp1==true)&&[](!(LTLAPp2==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.333: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.536: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.561: There are 232 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.561: State length is 283, there are 240 groups
pins2lts-mc-linux64( 0/ 8), 0.561: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.561: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.561: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.561: Visible groups: 0 / 240, labels: 3 / 232
pins2lts-mc-linux64( 0/ 8), 0.561: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.561: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.590: [Blue] ~118 levels ~960 states ~1552 transitions
pins2lts-mc-linux64( 1/ 8), 0.599: [Blue] ~105 levels ~1920 states ~2632 transitions
pins2lts-mc-linux64( 1/ 8), 0.624: [Blue] ~113 levels ~3840 states ~5072 transitions
pins2lts-mc-linux64( 7/ 8), 0.670: [Blue] ~132 levels ~7680 states ~10760 transitions
pins2lts-mc-linux64( 1/ 8), 0.762: [Blue] ~113 levels ~15360 states ~19608 transitions
pins2lts-mc-linux64( 2/ 8), 0.944: [Blue] ~143 levels ~30720 states ~41912 transitions
pins2lts-mc-linux64( 2/ 8), 1.281: [Blue] ~143 levels ~61440 states ~91464 transitions
pins2lts-mc-linux64( 7/ 8), 1.899: [Blue] ~135 levels ~122880 states ~176192 transitions
pins2lts-mc-linux64( 4/ 8), 3.028: [Blue] ~190 levels ~245760 states ~285384 transitions
pins2lts-mc-linux64( 4/ 8), 4.881: [Blue] ~234 levels ~491520 states ~569024 transitions
pins2lts-mc-linux64( 7/ 8), 7.836: [Blue] ~135 levels ~983040 states ~1278016 transitions
pins2lts-mc-linux64( 7/ 8), 13.239: [Blue] ~135 levels ~1966080 states ~2646344 transitions
pins2lts-mc-linux64( 3/ 8), 23.428: [Blue] ~1541 levels ~3932160 states ~4812800 transitions
pins2lts-mc-linux64( 7/ 8), 46.647: [Blue] ~143 levels ~7864320 states ~10450376 transitions
pins2lts-mc-linux64( 6/ 8), 93.737: [Blue] ~2553 levels ~15728640 states ~22289792 transitions
pins2lts-mc-linux64( 7/ 8), 182.191: [Blue] ~298 levels ~31457280 states ~45672760 transitions
pins2lts-mc-linux64( 7/ 8), 358.329: [Blue] ~1351 levels ~62914560 states ~89449976 transitions
pins2lts-mc-linux64( 7/ 8), 729.027: [Blue] ~1476 levels ~125829120 states ~171632264 transitions
pins2lts-mc-linux64( 3/ 8), 926.935: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 926.959:
pins2lts-mc-linux64( 0/ 8), 926.959: Explored 131937497 states 165564947 transitions, fanout: 1.255
pins2lts-mc-linux64( 0/ 8), 926.959: Total exploration time 926.390 sec (926.360 sec minimum, 926.375 sec on average)
pins2lts-mc-linux64( 0/ 8), 926.959: States per second: 142421, Transitions per second: 178721
pins2lts-mc-linux64( 0/ 8), 926.959:
pins2lts-mc-linux64( 0/ 8), 926.959: State space has 134215499 states, 1575141 are accepting
pins2lts-mc-linux64( 0/ 8), 926.959: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 926.959: blue states: 131937497 (98.30%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 926.959: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 926.959: all-red states: 2285187 (1.70%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 926.959:
pins2lts-mc-linux64( 0/ 8), 926.959: Total memory used for local state coloring: 76.2MB
pins2lts-mc-linux64( 0/ 8), 926.959:
pins2lts-mc-linux64( 0/ 8), 926.959: Queue width: 8B, total height: 4996113, memory: 38.12MB
pins2lts-mc-linux64( 0/ 8), 926.959: Tree memory: 1231.5MB, 9.6 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 926.959: Tree fill ratio (roots/leafs): 99.0%/81.0%
pins2lts-mc-linux64( 0/ 8), 926.959: Stored 273 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 926.959: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 926.959: Est. total memory use: 1269.6MB (~1062.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14921661450286264556;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '(<>([]((LTLAPp0==true))) U (!(LTLAPp1==true)&&[](!(LTLAPp2==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14921661450286264556;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '(<>([]((LTLAPp0==true))) U (!(LTLAPp1==true)&&[](!(LTLAPp2==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-08 09:07:09] [INFO ] Applying decomposition
[2023-03-08 09:07:09] [INFO ] Flatten gal took : 9 ms
[2023-03-08 09:07:09] [INFO ] Decomposing Gal with order
[2023-03-08 09:07:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 09:07:09] [INFO ] Removed a total of 49 redundant transitions.
[2023-03-08 09:07:09] [INFO ] Flatten gal took : 44 ms
[2023-03-08 09:07:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 192 labels/synchronizations in 12 ms.
[2023-03-08 09:07:09] [INFO ] Time to serialize gal into /tmp/LTLFireability15661847555128962086.gal : 9 ms
[2023-03-08 09:07:09] [INFO ] Time to serialize properties into /tmp/LTLFireability9565146899280102662.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15661847555128962086.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9565146899280102662.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((F(G("(i1.i1.i0.i1.i0.i0.i1.u143.p186!=1)")))U((!("(((i1.i0.i1.i0.u23.p112==1)&&(i1.i1.i0.i1.i0.i0.i1.i0.i1.u95.p271==1))&&(i1.i0.i...219
Formula 0 simplified : GF!"(i1.i1.i0.i1.i0.i0.i1.u143.p186!=1)" R ("(((i1.i0.i1.i0.u23.p112==1)&&(i1.i1.i0.i1.i0.i0.i1.i0.i1.u95.p271==1))&&(i1.i0.i0.i0.i0...206
Detected timeout of ITS tools.
[2023-03-08 09:27:50] [INFO ] Flatten gal took : 182 ms
[2023-03-08 09:27:51] [INFO ] Input system was already deterministic with 228 transitions.
[2023-03-08 09:27:51] [INFO ] Transformed 282 places.
[2023-03-08 09:27:51] [INFO ] Transformed 228 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-08 09:27:51] [INFO ] Time to serialize gal into /tmp/LTLFireability16542181780782966463.gal : 5 ms
[2023-03-08 09:27:51] [INFO ] Time to serialize properties into /tmp/LTLFireability15511925759797809128.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16542181780782966463.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15511925759797809128.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((F(G("(p186!=1)")))U((!("(((p112==1)&&(p271==1))&&(p83==1))"))&&(G("(p311!=1)")))))
Formula 0 simplified : GF!"(p186!=1)" R ("(((p112==1)&&(p271==1))&&(p83==1))" | F!"(p311!=1)")
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t9, t10, t17, t25, t34, t37, t48, t50, t51, t52, t53, t54, t55, t56, t57, t58, t59, t...462
Computing Next relation with stutter on 3.85942e+07 deadlock states
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 2714760 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16001912 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="DES-PT-10b"
export BK_EXAMINATION="LTLFireability"
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-5348"
echo " Executing tool itstools"
echo " Input is DES-PT-10b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r101-tall-167814475300420"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-10b.tgz
mv DES-PT-10b execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;