Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r109-tall-171624208500423.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
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 r109-tall-171624208500423
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Apr 12 08:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 12 08:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 08:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Apr 12 08:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 79K May 18 16:42 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 1716333604927

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=gold2023
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 202304061127
[2024-05-21 23:20:06] [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]
[2024-05-21 23:20:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:20:06] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2024-05-21 23:20:06] [INFO ] Transformed 320 places.
[2024-05-21 23:20:06] [INFO ] Transformed 271 transitions.
[2024-05-21 23:20:06] [INFO ] Found NUPN structural information;
[2024-05-21 23:20:06] [INFO ] Parsed PT model containing 320 places and 271 transitions and 827 arcs in 133 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA DES-PT-10b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10b-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10b-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10b-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 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 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 24 place count 296 transition count 250
Iterating global reduction 1 with 21 rules applied. Total rules applied 45 place count 296 transition count 250
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 55 place count 286 transition count 240
Iterating global reduction 1 with 10 rules applied. Total rules applied 65 place count 286 transition count 240
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 72 place count 286 transition count 233
Applied a total of 72 rules in 61 ms. Remains 286 /320 variables (removed 34) and now considering 233/271 (removed 38) transitions.
// Phase 1: matrix 233 rows 286 cols
[2024-05-21 23:20:06] [INFO ] Computed 62 invariants in 26 ms
[2024-05-21 23:20:07] [INFO ] Implicit Places using invariants in 478 ms returned []
[2024-05-21 23:20:07] [INFO ] Invariant cache hit.
[2024-05-21 23:20:07] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 738 ms to find 0 implicit places.
[2024-05-21 23:20:07] [INFO ] Invariant cache hit.
[2024-05-21 23:20:07] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 286/320 places, 233/271 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 942 ms. Remains : 286/320 places, 233/271 transitions.
Support contains 42 out of 286 places after structural reductions.
[2024-05-21 23:20:07] [INFO ] Flatten gal took : 41 ms
[2024-05-21 23:20:07] [INFO ] Flatten gal took : 18 ms
[2024-05-21 23:20:07] [INFO ] Input system was already deterministic with 233 transitions.
Support contains 41 out of 286 places (down from 42) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 89 resets, run finished after 356 ms. (steps per millisecond=28 ) properties (out of 31) seen :26
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :1
Running SMT prover for 4 properties.
[2024-05-21 23:20:08] [INFO ] Invariant cache hit.
[2024-05-21 23:20:08] [INFO ] [Real]Absence check using 34 positive place invariants in 7 ms returned sat
[2024-05-21 23:20:08] [INFO ] [Real]Absence check using 34 positive and 28 generalized place invariants in 17 ms returned sat
[2024-05-21 23:20:08] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-21 23:20:08] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2024-05-21 23:20:08] [INFO ] [Nat]Absence check using 34 positive and 28 generalized place invariants in 14 ms returned sat
[2024-05-21 23:20:08] [INFO ] After 158ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-21 23:20:08] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 4 ms to minimize.
[2024-05-21 23:20:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2024-05-21 23:20:09] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:20:09] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:20:09] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:20:09] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:20:09] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 219 ms
[2024-05-21 23:20:09] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:20:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2024-05-21 23:20:09] [INFO ] After 669ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 71 ms.
[2024-05-21 23:20:09] [INFO ] After 858ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 191 ms.
Support contains 8 out of 286 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 286/286 places, 233/233 transitions.
Graph (complete) has 555 edges and 286 vertex of which 282 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 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 282 transition count 211
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 35 place count 266 transition count 211
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 35 place count 266 transition count 199
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 59 place count 254 transition count 199
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 65 place count 248 transition count 193
Iterating global reduction 2 with 6 rules applied. Total rules applied 71 place count 248 transition count 193
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 76 place count 248 transition count 188
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 78 place count 247 transition count 187
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 78 place count 247 transition count 186
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 80 place count 246 transition count 186
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 82 place count 244 transition count 184
Iterating global reduction 4 with 2 rules applied. Total rules applied 84 place count 244 transition count 184
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 86 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 86 place count 244 transition count 181
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 88 place count 243 transition count 181
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 1 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 5 with 148 rules applied. Total rules applied 236 place count 169 transition count 107
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 240 place count 167 transition count 109
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 241 place count 167 transition count 108
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 242 place count 166 transition count 108
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 243 place count 165 transition count 107
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 244 place count 164 transition count 107
Applied a total of 244 rules in 72 ms. Remains 164 /286 variables (removed 122) and now considering 107/233 (removed 126) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 164/286 places, 107/233 transitions.
Incomplete random walk after 10000 steps, including 416 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 81 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 898631 steps, run timeout after 3001 ms. (steps per millisecond=299 ) properties seen :{}
Probabilistic random walk after 898631 steps, saw 135528 distinct states, run finished after 3002 ms. (steps per millisecond=299 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 107 rows 164 cols
[2024-05-21 23:20:12] [INFO ] Computed 63 invariants in 6 ms
[2024-05-21 23:20:12] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-21 23:20:12] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 7 ms returned sat
[2024-05-21 23:20:12] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-21 23:20:13] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 23:20:13] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 24 ms returned sat
[2024-05-21 23:20:13] [INFO ] After 88ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-21 23:20:13] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:20:13] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-21 23:20:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 97 ms
[2024-05-21 23:20:13] [INFO ] After 231ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 36 ms.
[2024-05-21 23:20:13] [INFO ] After 363ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 79 ms.
Support contains 8 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 107/107 transitions.
Applied a total of 0 rules in 6 ms. Remains 164 /164 variables (removed 0) and now considering 107/107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 164/164 places, 107/107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 107/107 transitions.
Applied a total of 0 rules in 5 ms. Remains 164 /164 variables (removed 0) and now considering 107/107 (removed 0) transitions.
[2024-05-21 23:20:13] [INFO ] Invariant cache hit.
[2024-05-21 23:20:13] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-21 23:20:13] [INFO ] Invariant cache hit.
[2024-05-21 23:20:13] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
[2024-05-21 23:20:13] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 23:20:13] [INFO ] Invariant cache hit.
[2024-05-21 23:20:13] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 332 ms. Remains : 164/164 places, 107/107 transitions.
Applied a total of 0 rules in 7 ms. Remains 164 /164 variables (removed 0) and now considering 107/107 (removed 0) transitions.
Running SMT prover for 4 properties.
[2024-05-21 23:20:13] [INFO ] Invariant cache hit.
[2024-05-21 23:20:13] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 23:20:13] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 7 ms returned sat
[2024-05-21 23:20:13] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-21 23:20:13] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-21 23:20:13] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 34 ms returned sat
[2024-05-21 23:20:13] [INFO ] After 78ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-21 23:20:14] [INFO ] After 134ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 41 ms.
[2024-05-21 23:20:14] [INFO ] After 260ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
FORMULA DES-PT-10b-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA DES-PT-10b-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 97 stabilizing places and 89 stable transitions
Graph (complete) has 555 edges and 286 vertex of which 278 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.7 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0||X(F(p1))))&&X(p2)))'
Support contains 4 out of 286 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 233/233 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 278 transition count 225
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 278 transition count 225
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 278 transition count 221
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 24 place count 274 transition count 217
Iterating global reduction 1 with 4 rules applied. Total rules applied 28 place count 274 transition count 217
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 31 place count 274 transition count 214
Applied a total of 31 rules in 37 ms. Remains 274 /286 variables (removed 12) and now considering 214/233 (removed 19) transitions.
// Phase 1: matrix 214 rows 274 cols
[2024-05-21 23:20:14] [INFO ] Computed 62 invariants in 6 ms
[2024-05-21 23:20:14] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-21 23:20:14] [INFO ] Invariant cache hit.
[2024-05-21 23:20:14] [INFO ] Implicit Places using invariants and state equation in 244 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 359 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 273/286 places, 214/233 transitions.
Applied a total of 0 rules in 7 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 403 ms. Remains : 273/286 places, 214/233 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 242 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1)), true]
Running random walk in product with property : DES-PT-10b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s178 0), p2:(EQ s115 1), p1:(OR (EQ s16 0) (EQ s265 0))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA DES-PT-10b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-LTLFireability-01 finished in 697 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(G(p1))&&(G(p3)||p2))))'
Support contains 6 out of 286 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 233/233 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 278 transition count 225
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 278 transition count 225
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 278 transition count 221
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 24 place count 274 transition count 217
Iterating global reduction 1 with 4 rules applied. Total rules applied 28 place count 274 transition count 217
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 31 place count 274 transition count 214
Applied a total of 31 rules in 10 ms. Remains 274 /286 variables (removed 12) and now considering 214/233 (removed 19) transitions.
[2024-05-21 23:20:15] [INFO ] Invariant cache hit.
[2024-05-21 23:20:15] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-21 23:20:15] [INFO ] Invariant cache hit.
[2024-05-21 23:20:15] [INFO ] Implicit Places using invariants and state equation in 243 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 355 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 273/286 places, 214/233 transitions.
Applied a total of 0 rules in 3 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 369 ms. Remains : 273/286 places, 214/233 transitions.
Stuttering acceptance computed with spot in 247 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p0), (NOT p1), (NOT p3)]
Running random walk in product with property : DES-PT-10b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p3)), acceptance={} source=1 dest: 3}, { cond=(OR p2 p3), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p2) p3), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={} source=5 dest: 2}, { cond=p3, acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(OR (EQ s264 1) (AND (EQ s179 1) (EQ s213 1))), p3:(EQ s1 1), p0:(AND (EQ s179 1) (EQ s213 1)), p1:(AND (EQ s105 1) (EQ s107 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][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA DES-PT-10b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-LTLFireability-02 finished in 636 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(p0) U p1))))'
Support contains 3 out of 286 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 286/286 places, 233/233 transitions.
Graph (complete) has 555 edges and 286 vertex of which 278 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 277 transition count 212
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 262 transition count 212
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 31 place count 262 transition count 201
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 53 place count 251 transition count 201
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 58 place count 246 transition count 196
Iterating global reduction 2 with 5 rules applied. Total rules applied 63 place count 246 transition count 196
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 67 place count 246 transition count 192
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 69 place count 245 transition count 191
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 69 place count 245 transition count 190
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 71 place count 244 transition count 190
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 73 place count 242 transition count 188
Iterating global reduction 4 with 2 rules applied. Total rules applied 75 place count 242 transition count 188
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 77 place count 242 transition count 186
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 5 with 150 rules applied. Total rules applied 227 place count 167 transition count 111
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 165 transition count 113
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 233 place count 163 transition count 111
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 234 place count 162 transition count 111
Applied a total of 234 rules in 49 ms. Remains 162 /286 variables (removed 124) and now considering 111/233 (removed 122) transitions.
// Phase 1: matrix 111 rows 162 cols
[2024-05-21 23:20:15] [INFO ] Computed 58 invariants in 2 ms
[2024-05-21 23:20:15] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-21 23:20:15] [INFO ] Invariant cache hit.
[2024-05-21 23:20:15] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
[2024-05-21 23:20:15] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-21 23:20:15] [INFO ] Invariant cache hit.
[2024-05-21 23:20:16] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 162/286 places, 111/233 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 361 ms. Remains : 162/286 places, 111/233 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DES-PT-10b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={1} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s63 1) (EQ s68 1)), p0:(NEQ s110 1)], nbAcceptance=2, 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 3449 steps with 169 reset in 32 ms.
FORMULA DES-PT-10b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-LTLFireability-05 finished in 531 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 286 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 286/286 places, 233/233 transitions.
Graph (complete) has 555 edges and 286 vertex of which 278 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions removed 5 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 277 transition count 213
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 263 transition count 213
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 29 place count 263 transition count 202
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 51 place count 252 transition count 202
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 57 place count 246 transition count 196
Iterating global reduction 2 with 6 rules applied. Total rules applied 63 place count 246 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 2 with 5 rules applied. Total rules applied 68 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 70 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 70 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 72 place count 244 transition count 189
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 74 place count 242 transition count 187
Iterating global reduction 4 with 2 rules applied. Total rules applied 76 place count 242 transition count 187
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 78 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 78 place count 242 transition count 184
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 80 place count 241 transition count 184
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 5 with 152 rules applied. Total rules applied 232 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 236 place count 163 transition count 110
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 237 place count 162 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 238 place count 161 transition count 109
Applied a total of 238 rules in 45 ms. Remains 161 /286 variables (removed 125) and now considering 109/233 (removed 124) transitions.
// Phase 1: matrix 109 rows 161 cols
[2024-05-21 23:20:16] [INFO ] Computed 58 invariants in 3 ms
[2024-05-21 23:20:16] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-21 23:20:16] [INFO ] Invariant cache hit.
[2024-05-21 23:20:16] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 23:20:16] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
[2024-05-21 23:20:16] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-21 23:20:16] [INFO ] Invariant cache hit.
[2024-05-21 23:20:16] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 161/286 places, 109/233 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 368 ms. Remains : 161/286 places, 109/233 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-10b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s31 1) (EQ s46 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 1 ms.
FORMULA DES-PT-10b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-LTLFireability-06 finished in 416 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(F((F(G(F(p0)))||p1)))) U p2))'
Support contains 4 out of 286 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 286/286 places, 233/233 transitions.
Graph (complete) has 555 edges and 286 vertex of which 279 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 278 transition count 214
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 264 transition count 214
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 29 place count 264 transition count 203
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 51 place count 253 transition count 203
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 57 place count 247 transition count 197
Iterating global reduction 2 with 6 rules applied. Total rules applied 63 place count 247 transition count 197
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 68 place count 247 transition count 192
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 70 place count 246 transition count 191
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 70 place count 246 transition count 190
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 72 place count 245 transition count 190
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 74 place count 243 transition count 188
Iterating global reduction 4 with 2 rules applied. Total rules applied 76 place count 243 transition count 188
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 78 place count 243 transition count 186
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 78 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 5 with 2 rules applied. Total rules applied 80 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 1 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 5 with 148 rules applied. Total rules applied 228 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 5 with 2 rules applied. Total rules applied 230 place count 167 transition count 111
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 231 place count 167 transition count 111
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 233 place count 165 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 234 place count 164 transition count 109
Applied a total of 234 rules in 42 ms. Remains 164 /286 variables (removed 122) and now considering 109/233 (removed 124) transitions.
// Phase 1: matrix 109 rows 164 cols
[2024-05-21 23:20:16] [INFO ] Computed 58 invariants in 5 ms
[2024-05-21 23:20:16] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-21 23:20:16] [INFO ] Invariant cache hit.
[2024-05-21 23:20:16] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
[2024-05-21 23:20:16] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-21 23:20:16] [INFO ] Invariant cache hit.
[2024-05-21 23:20:16] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 164/286 places, 109/233 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 344 ms. Remains : 164/286 places, 109/233 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-10b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s22 1) (EQ s75 1)), p1:(NEQ s60 1), p0:(EQ s41 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 23 steps with 0 reset in 1 ms.
FORMULA DES-PT-10b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-LTLFireability-07 finished in 521 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 286 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 286/286 places, 233/233 transitions.
Graph (complete) has 555 edges and 286 vertex of which 278 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 277 transition count 212
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 262 transition count 212
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 31 place count 262 transition count 201
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 53 place count 251 transition count 201
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 58 place count 246 transition count 196
Iterating global reduction 2 with 5 rules applied. Total rules applied 63 place count 246 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 2 with 5 rules applied. Total rules applied 68 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 70 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 70 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 72 place count 244 transition count 189
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 73 place count 243 transition count 188
Iterating global reduction 4 with 1 rules applied. Total rules applied 74 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 75 place count 243 transition count 187
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 5 with 154 rules applied. Total rules applied 229 place count 166 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 233 place count 164 transition count 112
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 235 place count 162 transition count 110
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 236 place count 161 transition count 110
Applied a total of 236 rules in 36 ms. Remains 161 /286 variables (removed 125) and now considering 110/233 (removed 123) transitions.
// Phase 1: matrix 110 rows 161 cols
[2024-05-21 23:20:17] [INFO ] Computed 58 invariants in 1 ms
[2024-05-21 23:20:17] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-21 23:20:17] [INFO ] Invariant cache hit.
[2024-05-21 23:20:17] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
[2024-05-21 23:20:17] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-21 23:20:17] [INFO ] Invariant cache hit.
[2024-05-21 23:20:17] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 161/286 places, 110/233 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 350 ms. Remains : 161/286 places, 110/233 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-10b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s66 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 1 ms.
FORMULA DES-PT-10b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-LTLFireability-08 finished in 434 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)||G(p2)))))'
Support contains 3 out of 286 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 233/233 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 280 transition count 227
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 280 transition count 227
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 280 transition count 224
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 277 transition count 221
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 277 transition count 221
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 23 place count 277 transition count 219
Applied a total of 23 rules in 15 ms. Remains 277 /286 variables (removed 9) and now considering 219/233 (removed 14) transitions.
// Phase 1: matrix 219 rows 277 cols
[2024-05-21 23:20:17] [INFO ] Computed 62 invariants in 6 ms
[2024-05-21 23:20:17] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-21 23:20:17] [INFO ] Invariant cache hit.
[2024-05-21 23:20:17] [INFO ] Implicit Places using invariants and state equation in 225 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 337 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 276/286 places, 219/233 transitions.
Applied a total of 0 rules in 3 ms. Remains 276 /276 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 355 ms. Remains : 276/286 places, 219/233 transitions.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : DES-PT-10b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(AND (EQ s108 1) (EQ s117 1)), p0:(EQ s115 1), p2:(OR (EQ s108 0) (EQ s117 0))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 914 reset in 317 ms.
Product exploration explored 100000 steps with 918 reset in 323 ms.
Computed a total of 96 stabilizing places and 89 stable transitions
Graph (complete) has 535 edges and 276 vertex of which 271 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
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) p2))), (X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 120 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter sensitive) to 6 states, 17 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 386 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, false, false]
Incomplete random walk after 10000 steps, including 86 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 8) seen :3
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 219 rows 276 cols
[2024-05-21 23:20:19] [INFO ] Computed 61 invariants in 3 ms
[2024-05-21 23:20:19] [INFO ] [Real]Absence check using 34 positive place invariants in 6 ms returned sat
[2024-05-21 23:20:19] [INFO ] [Real]Absence check using 34 positive and 27 generalized place invariants in 12 ms returned sat
[2024-05-21 23:20:19] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:2
[2024-05-21 23:20:19] [INFO ] [Nat]Absence check using 34 positive place invariants in 6 ms returned sat
[2024-05-21 23:20:19] [INFO ] [Nat]Absence check using 34 positive and 27 generalized place invariants in 18 ms returned sat
[2024-05-21 23:20:19] [INFO ] After 139ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) p2))), (X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (G (NOT (AND p0 (NOT p1) (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (G (NOT (AND p0 p1 (NOT p2)))), (G (NOT (AND (NOT p0) p1 p2))), (G (NOT (AND p0 p1 p2)))]
False Knowledge obtained : [(F (AND p0 (NOT p1) p2)), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1) p2)))]
Knowledge based reduction with 14 factoid took 295 ms. Reduced automaton from 6 states, 17 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[false, false, false]
Stuttering acceptance computed with spot in 97 ms :[false, false, false]
Support contains 3 out of 276 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 276/276 places, 219/219 transitions.
Graph (complete) has 535 edges and 276 vertex of which 271 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 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 270 transition count 201
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 256 transition count 201
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 29 place count 256 transition count 189
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 53 place count 244 transition count 189
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 205 place count 168 transition count 113
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 2 with 4 rules applied. Total rules applied 209 place count 166 transition count 115
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 211 place count 164 transition count 113
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 212 place count 163 transition count 113
Applied a total of 212 rules in 26 ms. Remains 163 /276 variables (removed 113) and now considering 113/219 (removed 106) transitions.
// Phase 1: matrix 113 rows 163 cols
[2024-05-21 23:20:20] [INFO ] Computed 58 invariants in 2 ms
[2024-05-21 23:20:20] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-21 23:20:20] [INFO ] Invariant cache hit.
[2024-05-21 23:20:20] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2024-05-21 23:20:20] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-21 23:20:20] [INFO ] Invariant cache hit.
[2024-05-21 23:20:20] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 163/276 places, 113/219 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 336 ms. Remains : 163/276 places, 113/219 transitions.
Computed a total of 55 stabilizing places and 50 stable transitions
Computed a total of 55 stabilizing places and 50 stable transitions
Knowledge obtained : [(AND (NOT p0) p2), (X p2), (X (NOT (AND p0 p2))), (X (AND (NOT p0) p2)), (X (X p2)), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) p2)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 94 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[false, false, false]
Finished random walk after 438 steps, including 22 resets, run visited all 3 properties in 7 ms. (steps per millisecond=62 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p2), (X p2), (X (NOT (AND p0 p2))), (X (AND (NOT p0) p2)), (X (X p2)), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p2))), (F (AND p0 p2)), (F (NOT p2))]
Knowledge based reduction with 7 factoid took 202 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[false, false, false]
Stuttering acceptance computed with spot in 108 ms :[false, false, false]
Stuttering acceptance computed with spot in 114 ms :[false, false, false]
Product exploration explored 100000 steps with 5286 reset in 277 ms.
Product exploration explored 100000 steps with 5310 reset in 227 ms.
Built C files in :
/tmp/ltsmin1875390722961416458
[2024-05-21 23:20:21] [INFO ] Computing symmetric may disable matrix : 113 transitions.
[2024-05-21 23:20:21] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:20:21] [INFO ] Computing symmetric may enable matrix : 113 transitions.
[2024-05-21 23:20:21] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:20:21] [INFO ] Computing Do-Not-Accords matrix : 113 transitions.
[2024-05-21 23:20:21] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:20:21] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1875390722961416458
Running compilation step : cd /tmp/ltsmin1875390722961416458;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 338 ms.
Running link step : cd /tmp/ltsmin1875390722961416458;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin1875390722961416458;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11421791534258528642.hoa' '--buchi-type=spotba'
LTSmin run took 784 ms.
FORMULA DES-PT-10b-LTLFireability-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-10b-LTLFireability-09 finished in 5485 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0)) U (!p1&&G(p2))))'
Support contains 5 out of 286 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 286/286 places, 233/233 transitions.
Graph (complete) has 555 edges and 286 vertex of which 278 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 277 transition count 214
Reduce places removed 13 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 264 transition count 213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 29 place count 263 transition count 213
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 29 place count 263 transition count 203
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 49 place count 253 transition count 203
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 55 place count 247 transition count 197
Iterating global reduction 3 with 6 rules applied. Total rules applied 61 place count 247 transition count 197
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 66 place count 247 transition count 192
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 68 place count 246 transition count 191
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 246 transition count 190
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 245 transition count 190
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 72 place count 243 transition count 188
Iterating global reduction 5 with 2 rules applied. Total rules applied 74 place count 243 transition count 188
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 76 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 76 place count 243 transition count 185
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 78 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 226 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 228 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 230 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 231 place count 164 transition count 109
Applied a total of 231 rules in 29 ms. Remains 164 /286 variables (removed 122) and now considering 109/233 (removed 124) transitions.
// Phase 1: matrix 109 rows 164 cols
[2024-05-21 23:20:23] [INFO ] Computed 58 invariants in 2 ms
[2024-05-21 23:20:23] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-21 23:20:23] [INFO ] Invariant cache hit.
[2024-05-21 23:20:23] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
[2024-05-21 23:20:23] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 23:20:23] [INFO ] Invariant cache hit.
[2024-05-21 23:20:23] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 164/286 places, 109/233 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 350 ms. Remains : 164/286 places, 109/233 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p2) p1), (NOT p0), (NOT p2)]
Running random walk in product with property : DES-PT-10b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(OR p1 (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(OR p1 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 0}, { cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s54 1) (EQ s133 1) (EQ s47 1)), p2:(NEQ 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 3852 reset in 209 ms.
Product exploration explored 100000 steps with 3824 reset in 211 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) p2 p0), (X p2), (X (AND (NOT p1) p2)), (X (NOT (OR p1 (NOT p2)))), (X (X p2)), (X (X (AND (NOT p1) p2))), (X (X (NOT (OR p1 (NOT 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 230 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 (NOT p2) p1), (NOT p0), (NOT p2)]
Finished random walk after 9 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=4 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p2), (X (AND (NOT p1) p2)), (X (NOT (OR p1 (NOT p2)))), (X (X p2)), (X (X (AND (NOT p1) p2))), (X (X (NOT (OR p1 (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p2)), (F (OR p1 (NOT p2))), (F (NOT p0)), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 8 factoid took 370 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 139 ms :[(OR (NOT p2) p1), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p2) p1), (NOT p0), (NOT 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 3 ms. Remains 164 /164 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2024-05-21 23:20:24] [INFO ] Invariant cache hit.
[2024-05-21 23:20:25] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-21 23:20:25] [INFO ] Invariant cache hit.
[2024-05-21 23:20:25] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
[2024-05-21 23:20:25] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 23:20:25] [INFO ] Invariant cache hit.
[2024-05-21 23:20:25] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 294 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) p2 p0), (X p2), (X (AND (NOT p1) p2)), (X (NOT (OR p1 (NOT p2)))), (X (X p2)), (X (X (AND (NOT p1) p2))), (X (X (NOT (OR p1 (NOT 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 207 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 105 ms :[(OR (NOT p2) p1), (NOT p0), (NOT p2)]
Finished random walk after 8 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=4 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p2), (X (AND (NOT p1) p2)), (X (NOT (OR p1 (NOT p2)))), (X (X p2)), (X (X (AND (NOT p1) p2))), (X (X (NOT (OR p1 (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p2)), (F (OR p1 (NOT p2))), (F (NOT p0)), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 8 factoid took 321 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 110 ms :[(OR (NOT p2) p1), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p2) p1), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p2) p1), (NOT p0), (NOT p2)]
Product exploration explored 100000 steps with 3822 reset in 180 ms.
Product exploration explored 100000 steps with 3828 reset in 199 ms.
Built C files in :
/tmp/ltsmin15194718645757619231
[2024-05-21 23:20:26] [INFO ] Computing symmetric may disable matrix : 109 transitions.
[2024-05-21 23:20:26] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:20:26] [INFO ] Computing symmetric may enable matrix : 109 transitions.
[2024-05-21 23:20:26] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:20:26] [INFO ] Computing Do-Not-Accords matrix : 109 transitions.
[2024-05-21 23:20:26] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:20:26] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15194718645757619231
Running compilation step : cd /tmp/ltsmin15194718645757619231;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 232 ms.
Running link step : cd /tmp/ltsmin15194718645757619231;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin15194718645757619231;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13081534157625022044.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 6 ms. Remains 164 /164 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2024-05-21 23:20:41] [INFO ] Invariant cache hit.
[2024-05-21 23:20:41] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-21 23:20:41] [INFO ] Invariant cache hit.
[2024-05-21 23:20:42] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
[2024-05-21 23:20:42] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 23:20:42] [INFO ] Invariant cache hit.
[2024-05-21 23:20:42] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 319 ms. Remains : 164/164 places, 109/109 transitions.
Built C files in :
/tmp/ltsmin6879958687952984833
[2024-05-21 23:20:42] [INFO ] Computing symmetric may disable matrix : 109 transitions.
[2024-05-21 23:20:42] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:20:42] [INFO ] Computing symmetric may enable matrix : 109 transitions.
[2024-05-21 23:20:42] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:20:42] [INFO ] Computing Do-Not-Accords matrix : 109 transitions.
[2024-05-21 23:20:42] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:20:42] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6879958687952984833
Running compilation step : cd /tmp/ltsmin6879958687952984833;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 236 ms.
Running link step : cd /tmp/ltsmin6879958687952984833;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin6879958687952984833;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8376433800113153682.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 23:20:57] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:20:57] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:20:57] [INFO ] Time to serialize gal into /tmp/LTL14441391094836249839.gal : 3 ms
[2024-05-21 23:20:57] [INFO ] Time to serialize properties into /tmp/LTL4038168292670021335.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14441391094836249839.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10568223640273147225.hoa' '-atoms' '/tmp/LTL4038168292670021335.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL4038168292670021335.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10568223640273147225.hoa
Detected timeout of ITS tools.
[2024-05-21 23:21:12] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:21:12] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:21:12] [INFO ] Time to serialize gal into /tmp/LTL13661432669274864923.gal : 3 ms
[2024-05-21 23:21:12] [INFO ] Time to serialize properties into /tmp/LTL6301533576181933848.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13661432669274864923.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6301533576181933848.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
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.
[2024-05-21 23:21:27] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:21:27] [INFO ] Applying decomposition
[2024-05-21 23:21:27] [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.202304061127/bin/convert-linux64' '-i' '/tmp/graph17841514567217896682.txt' '-o' '/tmp/graph17841514567217896682.bin' '-w' '/tmp/graph17841514567217896682.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17841514567217896682.bin' '-l' '-1' '-v' '-w' '/tmp/graph17841514567217896682.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:21:27] [INFO ] Decomposing Gal with order
[2024-05-21 23:21:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:21:27] [INFO ] Removed a total of 30 redundant transitions.
[2024-05-21 23:21:27] [INFO ] Flatten gal took : 36 ms
[2024-05-21 23:21:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 21 labels/synchronizations in 5 ms.
[2024-05-21 23:21:27] [INFO ] Time to serialize gal into /tmp/LTL4247698503066092810.gal : 3 ms
[2024-05-21 23:21:27] [INFO ] Time to serialize properties into /tmp/LTL725876097206058370.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4247698503066092810.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL725876097206058370.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !(((F(G("(i1.u13.p186!=1)")))U((!("(((i2.u6.p112==1)&&(i2.u6.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.u6.p271==1))&&(i0.u3.p83==1))" | F!"(i14.u42.p311!=1)")
Reverse transition relation is NOT exact ! Due to transitions t7_t48, t222_t79, t36_t38_t49_t65_t66_t67_t68_t69_t70_t71_t50_t52_t54_t56_t58_t60_t62, t9_t34...557
Computing Next relation with stutter on 6.47736e+06 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin467755850615460477
[2024-05-21 23:21:42] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin467755850615460477
Running compilation step : cd /tmp/ltsmin467755850615460477;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 225 ms.
Running link step : cd /tmp/ltsmin467755850615460477;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin467755850615460477;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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 94645 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&G(p1)))))'
Support contains 3 out of 286 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 233/233 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 278 transition count 225
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 278 transition count 225
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 278 transition count 221
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 24 place count 274 transition count 217
Iterating global reduction 1 with 4 rules applied. Total rules applied 28 place count 274 transition count 217
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 31 place count 274 transition count 214
Applied a total of 31 rules in 16 ms. Remains 274 /286 variables (removed 12) and now considering 214/233 (removed 19) transitions.
// Phase 1: matrix 214 rows 274 cols
[2024-05-21 23:21:57] [INFO ] Computed 62 invariants in 4 ms
[2024-05-21 23:21:57] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-05-21 23:21:57] [INFO ] Invariant cache hit.
[2024-05-21 23:21:58] [INFO ] Implicit Places using invariants and state equation in 244 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 368 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 273/286 places, 214/233 transitions.
Applied a total of 0 rules in 2 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 387 ms. Remains : 273/286 places, 214/233 transitions.
Stuttering acceptance computed with spot in 165 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (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=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(OR (NEQ s191 1) (NEQ s221 1)), p0:(NEQ s183 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, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2233 steps with 20 reset in 9 ms.
FORMULA DES-PT-10b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-LTLFireability-12 finished in 577 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((p0 U p1))||G((p2&&X(p3))))))'
Support contains 7 out of 286 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 286/286 places, 233/233 transitions.
Graph (complete) has 555 edges and 286 vertex of which 278 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions removed 5 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 277 transition count 213
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 263 transition count 212
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 262 transition count 212
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 31 place count 262 transition count 201
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 53 place count 251 transition count 201
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 57 place count 247 transition count 197
Iterating global reduction 3 with 4 rules applied. Total rules applied 61 place count 247 transition count 197
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 63 place count 247 transition count 195
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 65 place count 245 transition count 193
Iterating global reduction 4 with 2 rules applied. Total rules applied 67 place count 245 transition count 193
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 69 place count 245 transition count 191
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 69 place count 245 transition count 190
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 71 place count 244 transition count 190
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 5 with 140 rules applied. Total rules applied 211 place count 174 transition count 120
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 217 place count 171 transition count 126
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 221 place count 171 transition count 122
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 223 place count 169 transition count 120
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 224 place count 168 transition count 120
Applied a total of 224 rules in 30 ms. Remains 168 /286 variables (removed 118) and now considering 120/233 (removed 113) transitions.
// Phase 1: matrix 120 rows 168 cols
[2024-05-21 23:21:58] [INFO ] Computed 58 invariants in 1 ms
[2024-05-21 23:21:58] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-21 23:21:58] [INFO ] Invariant cache hit.
[2024-05-21 23:21:58] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2024-05-21 23:21:58] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 23:21:58] [INFO ] Invariant cache hit.
[2024-05-21 23:21:58] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 168/286 places, 120/233 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 313 ms. Remains : 168/286 places, 120/233 transitions.
Stuttering acceptance computed with spot in 69 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))]
Running random walk in product with property : DES-PT-10b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(OR (AND p2 p1 p3) (AND p2 p0 p3)), acceptance={} source=0 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p0) p3), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0) (AND p1 (NOT p3)) (AND p0 (NOT p3))), acceptance={1} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p0) (NOT p3))), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p2 (NOT p1) p0 p3), acceptance={0} source=0 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p1) p0) (AND (NOT p1) p0 (NOT p3))), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND p2 (NOT p1) (NOT p0) p3), acceptance={0} source=1 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p0) (NOT p3))), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p2 (NOT p1) p0 p3), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p1) p0) (AND (NOT p1) p0 (NOT p3))), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p2:(OR (EQ s52 0) (EQ s155 0)), p1:(EQ s163 1), p3:(AND (EQ s22 1) (EQ s76 1)), p0:(AND (EQ s47 1) (EQ s74 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 0 ms.
FORMULA DES-PT-10b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10b-LTLFireability-14 finished in 399 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0)) U (!p1&&G(p2))))'
[2024-05-21 23:21:58] [INFO ] Flatten gal took : 14 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17067605756726433480
[2024-05-21 23:21:58] [INFO ] Applying decomposition
[2024-05-21 23:21:58] [INFO ] Computing symmetric may disable matrix : 233 transitions.
[2024-05-21 23:21:58] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:21:58] [INFO ] Computing symmetric may enable matrix : 233 transitions.
[2024-05-21 23:21:58] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:21:58] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:21:58] [INFO ] Computing Do-Not-Accords matrix : 233 transitions.
[2024-05-21 23:21:58] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:21:58] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17067605756726433480
Running compilation step : cd /tmp/ltsmin17067605756726433480;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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.202304061127/bin/convert-linux64' '-i' '/tmp/graph9759420912474729448.txt' '-o' '/tmp/graph9759420912474729448.bin' '-w' '/tmp/graph9759420912474729448.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9759420912474729448.bin' '-l' '-1' '-v' '-w' '/tmp/graph9759420912474729448.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:21:58] [INFO ] Decomposing Gal with order
[2024-05-21 23:21:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:21:58] [INFO ] Removed a total of 22 redundant transitions.
[2024-05-21 23:21:58] [INFO ] Flatten gal took : 19 ms
[2024-05-21 23:21:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 11 labels/synchronizations in 5 ms.
[2024-05-21 23:21:58] [INFO ] Time to serialize gal into /tmp/LTLFireability14311531467474366237.gal : 4 ms
[2024-05-21 23:21:58] [INFO ] Time to serialize properties into /tmp/LTLFireability11416203609400714379.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14311531467474366237.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11416203609400714379.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !(((F(G("(i11.i0.u41.p186!=1)")))U((!("(((i5.i1.u19.p112==1)&&(i9.u59.p271==1))&&(i2.u12.p83==1))"))&&(G("(i7.i1.u77.p311!=1)")))))
Formula 0 simplified : GF!"(i11.i0.u41.p186!=1)" R ("(((i5.i1.u19.p112==1)&&(i9.u59.p271==1))&&(i2.u12.p83==1))" | F!"(i7.i1.u77.p311!=1)")
Compilation finished in 419 ms.
Running link step : cd /tmp/ltsmin17067605756726433480;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin17067605756726433480;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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, t56, t170, t189, t190, t222, u37.t76, i0.u35.t79, i1.t130, i1.u7.t135, i1.u7.t137, i1.u8....881
Computing Next relation with stutter on 2.90648e+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.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.017: Initializing POR dependencies: labels 236, guards 233
pins2lts-mc-linux64( 4/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.039: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.039: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.042: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.463: LTL layer: formula: (<>([]((LTLAPp0==true))) U (!(LTLAPp1==true)&&[]((LTLAPp2==true))))
pins2lts-mc-linux64( 3/ 8), 0.464: "(<>([]((LTLAPp0==true))) U (!(LTLAPp1==true)&&[]((LTLAPp2==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.464: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.565: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.578: There are 237 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.578: State length is 287, there are 245 groups
pins2lts-mc-linux64( 0/ 8), 0.578: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.578: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.578: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.578: Visible groups: 0 / 245, labels: 3 / 237
pins2lts-mc-linux64( 0/ 8), 0.578: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.578: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 7/ 8), 0.595: [Blue] ~92 levels ~960 states ~1248 transitions
pins2lts-mc-linux64( 0/ 8), 0.619: [Blue] ~99 levels ~1920 states ~2712 transitions
pins2lts-mc-linux64( 0/ 8), 0.643: [Blue] ~100 levels ~3840 states ~5416 transitions
pins2lts-mc-linux64( 0/ 8), 0.689: [Blue] ~101 levels ~7680 states ~11064 transitions
pins2lts-mc-linux64( 0/ 8), 0.783: [Blue] ~101 levels ~15360 states ~24224 transitions
pins2lts-mc-linux64( 6/ 8), 0.939: [Blue] ~122 levels ~30720 states ~37072 transitions
pins2lts-mc-linux64( 6/ 8), 1.283: [Blue] ~122 levels ~61440 states ~75424 transitions
pins2lts-mc-linux64( 6/ 8), 1.849: [Blue] ~122 levels ~122880 states ~156544 transitions
pins2lts-mc-linux64( 6/ 8), 2.918: [Blue] ~122 levels ~245760 states ~315680 transitions
pins2lts-mc-linux64( 7/ 8), 4.832: [Blue] ~1752 levels ~491520 states ~787552 transitions
pins2lts-mc-linux64( 3/ 8), 7.936: [Blue] ~99 levels ~983040 states ~1372952 transitions
pins2lts-mc-linux64( 7/ 8), 13.432: [Blue] ~4376 levels ~1966080 states ~2834176 transitions
pins2lts-mc-linux64( 5/ 8), 24.186: [Blue] ~550 levels ~3932160 states ~4846288 transitions
pins2lts-mc-linux64( 5/ 8), 46.038: [Blue] ~875 levels ~7864320 states ~9659280 transitions
pins2lts-mc-linux64( 5/ 8), 92.468: [Blue] ~1222 levels ~15728640 states ~19984976 transitions
pins2lts-mc-linux64( 5/ 8), 186.916: [Blue] ~1355 levels ~31457280 states ~40778688 transitions
pins2lts-mc-linux64( 5/ 8), 365.526: [Blue] ~1368 levels ~62914560 states ~81506776 transitions
pins2lts-mc-linux64( 5/ 8), 726.265: [Blue] ~1622 levels ~125829120 states ~163522352 transitions
pins2lts-mc-linux64( 0/ 8), 911.951: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 912.002:
pins2lts-mc-linux64( 0/ 8), 912.002: Explored 131696953 states 168522176 transitions, fanout: 1.280
pins2lts-mc-linux64( 0/ 8), 912.002: Total exploration time 911.410 sec (911.340 sec minimum, 911.369 sec on average)
pins2lts-mc-linux64( 0/ 8), 912.002: States per second: 144498, Transitions per second: 184903
pins2lts-mc-linux64( 0/ 8), 912.002:
pins2lts-mc-linux64( 0/ 8), 912.002: State space has 134217211 states, 1115798 are accepting
pins2lts-mc-linux64( 0/ 8), 912.002: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 912.002: blue states: 131696953 (98.12%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 912.002: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 912.002: all-red states: 1776101 (1.32%), bogus 541 (0.00%)
pins2lts-mc-linux64( 0/ 8), 912.002:
pins2lts-mc-linux64( 0/ 8), 912.002: Total memory used for local state coloring: 146.0MB
pins2lts-mc-linux64( 0/ 8), 912.002:
pins2lts-mc-linux64( 0/ 8), 912.002: Queue width: 8B, total height: 9570823, memory: 73.02MB
pins2lts-mc-linux64( 0/ 8), 912.002: Tree memory: 1240.5MB, 9.7 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 912.002: Tree fill ratio (roots/leafs): 99.0%/84.0%
pins2lts-mc-linux64( 0/ 8), 912.002: Stored 233 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 912.002: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 912.002: Est. total memory use: 1313.5MB (~1097.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17067605756726433480;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin17067605756726433480;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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.
[2024-05-21 23:42:36] [INFO ] Applying decomposition
[2024-05-21 23:42:36] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:42:36] [INFO ] Decomposing Gal with order
[2024-05-21 23:42:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:42:36] [INFO ] Removed a total of 50 redundant transitions.
[2024-05-21 23:42:36] [INFO ] Flatten gal took : 17 ms
[2024-05-21 23:42:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 176 labels/synchronizations in 9 ms.
[2024-05-21 23:42:36] [INFO ] Time to serialize gal into /tmp/LTLFireability10772593777593020997.gal : 4 ms
[2024-05-21 23:42:36] [INFO ] Time to serialize properties into /tmp/LTLFireability17349735288251778203.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10772593777593020997.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17349735288251778203.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
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.
[2024-05-22 00:03:13] [INFO ] Flatten gal took : 18 ms
[2024-05-22 00:03:13] [INFO ] Input system was already deterministic with 233 transitions.
[2024-05-22 00:03:13] [INFO ] Transformed 286 places.
[2024-05-22 00:03:13] [INFO ] Transformed 233 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
[2024-05-22 00:03:13] [INFO ] Time to serialize gal into /tmp/LTLFireability14462827120462942592.gal : 1 ms
[2024-05-22 00:03:13] [INFO ] Time to serialize properties into /tmp/LTLFireability3725901704709953551.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14462827120462942592.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3725901704709953551.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
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...487
Computing Next relation with stutter on 2.90648e+07 deadlock states
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 8044632 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16037024 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.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="gold2023"
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-5568"
echo " Executing tool gold2023"
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 r109-tall-171624208500423"
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 ;