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-171624208500413.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-05b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r109-tall-171624208500413
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K 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.2K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K 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 13K Apr 12 08:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Apr 12 08:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 12 08:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 12 08:17 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 73K 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-05b-LTLFireability-00
FORMULA_NAME DES-PT-05b-LTLFireability-01
FORMULA_NAME DES-PT-05b-LTLFireability-02
FORMULA_NAME DES-PT-05b-LTLFireability-03
FORMULA_NAME DES-PT-05b-LTLFireability-04
FORMULA_NAME DES-PT-05b-LTLFireability-05
FORMULA_NAME DES-PT-05b-LTLFireability-06
FORMULA_NAME DES-PT-05b-LTLFireability-07
FORMULA_NAME DES-PT-05b-LTLFireability-08
FORMULA_NAME DES-PT-05b-LTLFireability-09
FORMULA_NAME DES-PT-05b-LTLFireability-10
FORMULA_NAME DES-PT-05b-LTLFireability-11
FORMULA_NAME DES-PT-05b-LTLFireability-12
FORMULA_NAME DES-PT-05b-LTLFireability-13
FORMULA_NAME DES-PT-05b-LTLFireability-14
FORMULA_NAME DES-PT-05b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716333199974

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-05b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-21 23:13:21] [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:13:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:13:21] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2024-05-21 23:13:21] [INFO ] Transformed 300 places.
[2024-05-21 23:13:21] [INFO ] Transformed 251 transitions.
[2024-05-21 23:13:21] [INFO ] Found NUPN structural information;
[2024-05-21 23:13:21] [INFO ] Parsed PT model containing 300 places and 251 transitions and 747 arcs in 134 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 3 formulas.
FORMULA DES-PT-05b-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-05b-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-05b-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 251/251 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 297 transition count 251
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 25 place count 275 transition count 229
Iterating global reduction 1 with 22 rules applied. Total rules applied 47 place count 275 transition count 229
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 60 place count 262 transition count 216
Iterating global reduction 1 with 13 rules applied. Total rules applied 73 place count 262 transition count 216
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 84 place count 262 transition count 205
Applied a total of 84 rules in 248 ms. Remains 262 /300 variables (removed 38) and now considering 205/251 (removed 46) transitions.
// Phase 1: matrix 205 rows 262 cols
[2024-05-21 23:13:22] [INFO ] Computed 62 invariants in 27 ms
[2024-05-21 23:13:22] [INFO ] Implicit Places using invariants in 291 ms returned []
[2024-05-21 23:13:22] [INFO ] Invariant cache hit.
[2024-05-21 23:13:22] [INFO ] Implicit Places using invariants and state equation in 266 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 591 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 261/300 places, 205/251 transitions.
Applied a total of 0 rules in 4 ms. Remains 261 /261 variables (removed 0) and now considering 205/205 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 843 ms. Remains : 261/300 places, 205/251 transitions.
Support contains 38 out of 261 places after structural reductions.
[2024-05-21 23:13:22] [INFO ] Flatten gal took : 41 ms
[2024-05-21 23:13:22] [INFO ] Flatten gal took : 22 ms
[2024-05-21 23:13:22] [INFO ] Input system was already deterministic with 205 transitions.
Incomplete random walk after 10000 steps, including 85 resets, run finished after 308 ms. (steps per millisecond=32 ) properties (out of 25) seen :22
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 205 rows 261 cols
[2024-05-21 23:13:23] [INFO ] Computed 61 invariants in 6 ms
[2024-05-21 23:13:23] [INFO ] [Real]Absence check using 33 positive place invariants in 10 ms returned sat
[2024-05-21 23:13:23] [INFO ] [Real]Absence check using 33 positive and 28 generalized place invariants in 11 ms returned sat
[2024-05-21 23:13:23] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 23:13:23] [INFO ] [Nat]Absence check using 33 positive place invariants in 15 ms returned sat
[2024-05-21 23:13:23] [INFO ] [Nat]Absence check using 33 positive and 28 generalized place invariants in 12 ms returned sat
[2024-05-21 23:13:23] [INFO ] After 118ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 23:13:23] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 5 ms to minimize.
[2024-05-21 23:13:23] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:13:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 149 ms
[2024-05-21 23:13:23] [INFO ] After 315ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 28 ms.
[2024-05-21 23:13:23] [INFO ] After 442ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 10 ms.
Support contains 2 out of 261 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 261/261 places, 205/205 transitions.
Graph (complete) has 482 edges and 261 vertex of which 256 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 256 transition count 184
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 35 place count 240 transition count 184
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 35 place count 240 transition count 173
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 57 place count 229 transition count 173
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 62 place count 224 transition count 168
Iterating global reduction 2 with 5 rules applied. Total rules applied 67 place count 224 transition count 168
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 224 transition count 167
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 68 place count 224 transition count 165
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 72 place count 222 transition count 165
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 73 place count 221 transition count 164
Iterating global reduction 3 with 1 rules applied. Total rules applied 74 place count 221 transition count 164
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 2 rules applied. Total rules applied 76 place count 221 transition count 162
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 78 place count 220 transition count 161
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 232 place count 143 transition count 84
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 141 transition count 86
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 237 place count 141 transition count 85
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 238 place count 140 transition count 85
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 239 place count 140 transition count 85
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 240 place count 139 transition count 84
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 241 place count 138 transition count 84
Applied a total of 241 rules in 62 ms. Remains 138 /261 variables (removed 123) and now considering 84/205 (removed 121) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 138/261 places, 84/205 transitions.
Incomplete random walk after 10000 steps, including 477 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 87 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1880716 steps, run timeout after 3001 ms. (steps per millisecond=626 ) properties seen :{}
Probabilistic random walk after 1880716 steps, saw 269565 distinct states, run finished after 3002 ms. (steps per millisecond=626 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 84 rows 138 cols
[2024-05-21 23:13:27] [INFO ] Computed 60 invariants in 5 ms
[2024-05-21 23:13:27] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-21 23:13:27] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 6 ms returned sat
[2024-05-21 23:13:27] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 23:13:27] [INFO ] [Nat]Absence check using 36 positive place invariants in 13 ms returned sat
[2024-05-21 23:13:27] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 79 ms returned sat
[2024-05-21 23:13:27] [INFO ] After 84ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 23:13:27] [INFO ] After 95ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-21 23:13:27] [INFO ] After 238ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 84/84 transitions.
Applied a total of 0 rules in 5 ms. Remains 138 /138 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 138/138 places, 84/84 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 84/84 transitions.
Applied a total of 0 rules in 5 ms. Remains 138 /138 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-21 23:13:27] [INFO ] Invariant cache hit.
[2024-05-21 23:13:27] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-21 23:13:27] [INFO ] Invariant cache hit.
[2024-05-21 23:13:27] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
[2024-05-21 23:13:27] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 23:13:27] [INFO ] Invariant cache hit.
[2024-05-21 23:13:27] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 330 ms. Remains : 138/138 places, 84/84 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 138 transition count 84
Applied a total of 1 rules in 6 ms. Remains 138 /138 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 84 rows 138 cols
[2024-05-21 23:13:27] [INFO ] Computed 60 invariants in 3 ms
[2024-05-21 23:13:27] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-21 23:13:27] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 5 ms returned sat
[2024-05-21 23:13:27] [INFO ] After 43ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-21 23:13:27] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:13:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2024-05-21 23:13:27] [INFO ] After 107ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 23:13:27] [INFO ] After 156ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 23:13:27] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-21 23:13:27] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 77 ms returned sat
[2024-05-21 23:13:28] [INFO ] After 187ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 23:13:28] [INFO ] After 197ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-21 23:13:28] [INFO ] After 327ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Computed a total of 78 stabilizing places and 71 stable transitions
Graph (complete) has 482 edges and 261 vertex of which 256 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.5 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 4 out of 261 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 261/261 places, 205/205 transitions.
Graph (complete) has 482 edges and 261 vertex of which 256 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 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 255 transition count 188
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 242 transition count 187
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 29 place count 241 transition count 187
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 29 place count 241 transition count 176
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 51 place count 230 transition count 176
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 56 place count 225 transition count 171
Iterating global reduction 3 with 5 rules applied. Total rules applied 61 place count 225 transition count 171
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 62 place count 225 transition count 170
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 62 place count 225 transition count 168
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 66 place count 223 transition count 168
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 67 place count 222 transition count 167
Iterating global reduction 4 with 1 rules applied. Total rules applied 68 place count 222 transition count 167
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 4 with 2 rules applied. Total rules applied 70 place count 222 transition count 165
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 72 place count 221 transition count 164
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 6 with 152 rules applied. Total rules applied 224 place count 145 transition count 88
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 6 with 4 rules applied. Total rules applied 228 place count 143 transition count 90
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 230 place count 141 transition count 88
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 231 place count 140 transition count 88
Applied a total of 231 rules in 46 ms. Remains 140 /261 variables (removed 121) and now considering 88/205 (removed 117) transitions.
// Phase 1: matrix 88 rows 140 cols
[2024-05-21 23:13:28] [INFO ] Computed 58 invariants in 2 ms
[2024-05-21 23:13:28] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-21 23:13:28] [INFO ] Invariant cache hit.
[2024-05-21 23:13:28] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
[2024-05-21 23:13:28] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-21 23:13:28] [INFO ] Invariant cache hit.
[2024-05-21 23:13:28] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 140/261 places, 88/205 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 394 ms. Remains : 140/261 places, 88/205 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 200 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-05b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s40 1) (NEQ s42 1) (NEQ s36 1) (NEQ s48 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 5068 reset in 346 ms.
Product exploration explored 100000 steps with 5074 reset in 269 ms.
Computed a total of 35 stabilizing places and 30 stable transitions
Computed a total of 35 stabilizing places and 30 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Finished random walk after 2050 steps, including 108 resets, run visited all 1 properties in 16 ms. (steps per millisecond=128 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Support contains 4 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 88/88 transitions.
Applied a total of 0 rules in 8 ms. Remains 140 /140 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2024-05-21 23:13:30] [INFO ] Invariant cache hit.
[2024-05-21 23:13:30] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-21 23:13:30] [INFO ] Invariant cache hit.
[2024-05-21 23:13:30] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2024-05-21 23:13:30] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 23:13:30] [INFO ] Invariant cache hit.
[2024-05-21 23:13:30] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 312 ms. Remains : 140/140 places, 88/88 transitions.
Computed a total of 35 stabilizing places and 30 stable transitions
Computed a total of 35 stabilizing places and 30 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Finished random walk after 290 steps, including 11 resets, run visited all 1 properties in 3 ms. (steps per millisecond=96 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Product exploration explored 100000 steps with 5004 reset in 200 ms.
Product exploration explored 100000 steps with 5075 reset in 243 ms.
Built C files in :
/tmp/ltsmin16967150604007855207
[2024-05-21 23:13:31] [INFO ] Computing symmetric may disable matrix : 88 transitions.
[2024-05-21 23:13:31] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:13:31] [INFO ] Computing symmetric may enable matrix : 88 transitions.
[2024-05-21 23:13:31] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:13:31] [INFO ] Computing Do-Not-Accords matrix : 88 transitions.
[2024-05-21 23:13:31] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:13:31] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16967150604007855207
Running compilation step : cd /tmp/ltsmin16967150604007855207;'/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 316 ms.
Running link step : cd /tmp/ltsmin16967150604007855207;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin16967150604007855207;'/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/stateBased17990563365166702961.hoa' '--buchi-type=spotba'
LTSmin run took 2447 ms.
FORMULA DES-PT-05b-LTLFireability-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-05b-LTLFireability-00 finished in 5591 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)&&F(G(p1)))))'
Support contains 2 out of 261 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 261/261 places, 205/205 transitions.
Graph (complete) has 482 edges and 261 vertex of which 256 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 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 255 transition count 189
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 243 transition count 189
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 25 place count 243 transition count 176
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 51 place count 230 transition count 176
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 56 place count 225 transition count 171
Iterating global reduction 2 with 5 rules applied. Total rules applied 61 place count 225 transition count 171
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 225 transition count 170
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 62 place count 225 transition count 168
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 66 place count 223 transition count 168
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 67 place count 222 transition count 167
Iterating global reduction 3 with 1 rules applied. Total rules applied 68 place count 222 transition count 167
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 2 rules applied. Total rules applied 70 place count 222 transition count 165
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 72 place count 221 transition count 164
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 224 place count 145 transition count 88
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 228 place count 143 transition count 90
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 230 place count 141 transition count 88
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 231 place count 140 transition count 88
Applied a total of 231 rules in 46 ms. Remains 140 /261 variables (removed 121) and now considering 88/205 (removed 117) transitions.
// Phase 1: matrix 88 rows 140 cols
[2024-05-21 23:13:34] [INFO ] Computed 58 invariants in 2 ms
[2024-05-21 23:13:34] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-21 23:13:34] [INFO ] Invariant cache hit.
[2024-05-21 23:13:34] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
[2024-05-21 23:13:34] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-21 23:13:34] [INFO ] Invariant cache hit.
[2024-05-21 23:13:34] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 140/261 places, 88/205 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 421 ms. Remains : 140/261 places, 88/205 transitions.
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DES-PT-05b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s93 1), p1:(EQ s81 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 1 ms.
FORMULA DES-PT-05b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-05b-LTLFireability-01 finished in 564 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 2 out of 261 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 261/261 places, 205/205 transitions.
Graph (complete) has 482 edges and 261 vertex of which 256 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 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 255 transition count 187
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 241 transition count 187
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 241 transition count 175
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 53 place count 229 transition count 175
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 58 place count 224 transition count 170
Iterating global reduction 2 with 5 rules applied. Total rules applied 63 place count 224 transition count 170
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 224 transition count 169
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 64 place count 224 transition count 167
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 68 place count 222 transition count 167
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 69 place count 221 transition count 166
Iterating global reduction 3 with 1 rules applied. Total rules applied 70 place count 221 transition count 166
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 2 rules applied. Total rules applied 72 place count 221 transition count 164
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 74 place count 220 transition count 163
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 222 place count 146 transition count 89
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 226 place count 144 transition count 91
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 228 place count 142 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 229 place count 141 transition count 89
Applied a total of 229 rules in 43 ms. Remains 141 /261 variables (removed 120) and now considering 89/205 (removed 116) transitions.
// Phase 1: matrix 89 rows 141 cols
[2024-05-21 23:13:34] [INFO ] Computed 58 invariants in 1 ms
[2024-05-21 23:13:34] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-21 23:13:34] [INFO ] Invariant cache hit.
[2024-05-21 23:13:34] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
[2024-05-21 23:13:34] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 23:13:34] [INFO ] Invariant cache hit.
[2024-05-21 23:13:35] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 141/261 places, 89/205 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 369 ms. Remains : 141/261 places, 89/205 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-05b-LTLFireability-02 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:(OR (EQ s77 0) (EQ s95 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5241 reset in 247 ms.
Product exploration explored 100000 steps with 5228 reset in 245 ms.
Computed a total of 36 stabilizing places and 31 stable transitions
Computed a total of 36 stabilizing places and 31 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Finished random walk after 333 steps, including 17 resets, run visited all 1 properties in 4 ms. (steps per millisecond=83 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 89/89 transitions.
Applied a total of 0 rules in 8 ms. Remains 141 /141 variables (removed 0) and now considering 89/89 (removed 0) transitions.
[2024-05-21 23:13:36] [INFO ] Invariant cache hit.
[2024-05-21 23:13:36] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-21 23:13:36] [INFO ] Invariant cache hit.
[2024-05-21 23:13:36] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
[2024-05-21 23:13:36] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 23:13:36] [INFO ] Invariant cache hit.
[2024-05-21 23:13:36] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 324 ms. Remains : 141/141 places, 89/89 transitions.
Computed a total of 36 stabilizing places and 31 stable transitions
Computed a total of 36 stabilizing places and 31 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Finished random walk after 55 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=55 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5237 reset in 192 ms.
Product exploration explored 100000 steps with 5260 reset in 217 ms.
Built C files in :
/tmp/ltsmin4624793082161245364
[2024-05-21 23:13:37] [INFO ] Computing symmetric may disable matrix : 89 transitions.
[2024-05-21 23:13:37] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:13:37] [INFO ] Computing symmetric may enable matrix : 89 transitions.
[2024-05-21 23:13:37] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:13:37] [INFO ] Computing Do-Not-Accords matrix : 89 transitions.
[2024-05-21 23:13:37] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:13:37] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4624793082161245364
Running compilation step : cd /tmp/ltsmin4624793082161245364;'/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 235 ms.
Running link step : cd /tmp/ltsmin4624793082161245364;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin4624793082161245364;'/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/stateBased8944261564018408637.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 89/89 transitions.
Applied a total of 0 rules in 20 ms. Remains 141 /141 variables (removed 0) and now considering 89/89 (removed 0) transitions.
[2024-05-21 23:13:52] [INFO ] Invariant cache hit.
[2024-05-21 23:13:52] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-21 23:13:52] [INFO ] Invariant cache hit.
[2024-05-21 23:13:52] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
[2024-05-21 23:13:52] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 23:13:52] [INFO ] Invariant cache hit.
[2024-05-21 23:13:52] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 327 ms. Remains : 141/141 places, 89/89 transitions.
Built C files in :
/tmp/ltsmin17303878927006774249
[2024-05-21 23:13:52] [INFO ] Computing symmetric may disable matrix : 89 transitions.
[2024-05-21 23:13:52] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:13:52] [INFO ] Computing symmetric may enable matrix : 89 transitions.
[2024-05-21 23:13:52] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:13:52] [INFO ] Computing Do-Not-Accords matrix : 89 transitions.
[2024-05-21 23:13:52] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:13:52] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17303878927006774249
Running compilation step : cd /tmp/ltsmin17303878927006774249;'/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 214 ms.
Running link step : cd /tmp/ltsmin17303878927006774249;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin17303878927006774249;'/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/stateBased14672993108134614891.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 23:14:08] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:14:08] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:14:08] [INFO ] Time to serialize gal into /tmp/LTL12668437594255900515.gal : 2 ms
[2024-05-21 23:14:08] [INFO ] Time to serialize properties into /tmp/LTL11080997479200979898.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/LTL12668437594255900515.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9087985627169009218.hoa' '-atoms' '/tmp/LTL11080997479200979898.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/LTL11080997479200979898.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9087985627169009218.hoa
Detected timeout of ITS tools.
[2024-05-21 23:14:23] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:14:23] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:14:23] [INFO ] Time to serialize gal into /tmp/LTL16545540725498907770.gal : 2 ms
[2024-05-21 23:14:23] [INFO ] Time to serialize properties into /tmp/LTL5837960421487624450.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/LTL16545540725498907770.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5837960421487624450.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 : !((G(F("((p201==0)||(p235==0))"))))
Formula 0 simplified : FG!"((p201==0)||(p235==0))"
Detected timeout of ITS tools.
[2024-05-21 23:14:38] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:14:38] [INFO ] Applying decomposition
[2024-05-21 23:14:38] [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/graph6569412613403163180.txt' '-o' '/tmp/graph6569412613403163180.bin' '-w' '/tmp/graph6569412613403163180.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6569412613403163180.bin' '-l' '-1' '-v' '-w' '/tmp/graph6569412613403163180.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:14:38] [INFO ] Decomposing Gal with order
[2024-05-21 23:14:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:14:38] [INFO ] Removed a total of 44 redundant transitions.
[2024-05-21 23:14:38] [INFO ] Flatten gal took : 36 ms
[2024-05-21 23:14:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 5 ms.
[2024-05-21 23:14:38] [INFO ] Time to serialize gal into /tmp/LTL16791295920074063841.gal : 3 ms
[2024-05-21 23:14:38] [INFO ] Time to serialize properties into /tmp/LTL3610772785337113159.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/LTL16791295920074063841.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3610772785337113159.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...255
Read 1 LTL properties
Checking formula 0 : !((G(F("((i10.u23.p201==0)||(i10.u30.p235==0))"))))
Formula 0 simplified : FG!"((i10.u23.p201==0)||(i10.u30.p235==0))"
Reverse transition relation is NOT exact ! Due to transitions t198_t79, t7_t48_t39, t9_t34, t10_t34, t166_t34, t165_t25, t107_t109_t126_t204_t131_t128_t124...447
Computing Next relation with stutter on 1.20585e+06 deadlock states
110 unique states visited
0 strongly connected components in search stack
150 transitions explored
76 items max in DFS search stack
441 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,4.43996,147016,1,0,325472,2886,1477,309348,755,16374,437631
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DES-PT-05b-LTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property DES-PT-05b-LTLFireability-02 finished in 68834 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)) U (X(p1) U (p2 U G(!p2)))))'
Support contains 4 out of 261 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 205/205 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 257 transition count 201
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 257 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 257 transition count 200
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 256 transition count 199
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 256 transition count 199
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 256 transition count 198
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 255 transition count 197
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 255 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 255 transition count 196
Applied a total of 15 rules in 17 ms. Remains 255 /261 variables (removed 6) and now considering 196/205 (removed 9) transitions.
// Phase 1: matrix 196 rows 255 cols
[2024-05-21 23:14:43] [INFO ] Computed 61 invariants in 5 ms
[2024-05-21 23:14:43] [INFO ] Implicit Places using invariants in 440 ms returned []
[2024-05-21 23:14:43] [INFO ] Invariant cache hit.
[2024-05-21 23:14:44] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 708 ms to find 0 implicit places.
[2024-05-21 23:14:44] [INFO ] Invariant cache hit.
[2024-05-21 23:14:44] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 255/261 places, 196/205 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 838 ms. Remains : 255/261 places, 196/205 transitions.
Stuttering acceptance computed with spot in 269 ms :[p2, (AND p0 p2 (NOT p1)), (AND p2 (NOT p1) p0), p0, (AND p0 p2 p1), (AND p0 p2)]
Running random walk in product with property : DES-PT-05b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=p2, acceptance={0} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=(AND p2 (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 4}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=2 dest: 5}], [{ cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=(AND p2 p1 p0), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) p0), acceptance={} source=5 dest: 4}, { cond=(AND p2 p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(EQ s49 1), p1:(EQ s79 1), p0:(AND (EQ s101 1) (EQ s103 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33360 reset in 169 ms.
Product exploration explored 100000 steps with 33347 reset in 145 ms.
Computed a total of 77 stabilizing places and 70 stable transitions
Graph (complete) has 469 edges and 255 vertex of which 250 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 77 stabilizing places and 70 stable transitions
Detected a total of 77/255 stabilizing places and 70/196 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 304 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 208 ms :[p2, (AND p0 p2 (NOT p1)), p0, (AND p0 p2 p1), (AND p2 p1 p0)]
Incomplete random walk after 10000 steps, including 92 resets, run finished after 261 ms. (steps per millisecond=38 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-21 23:14:45] [INFO ] Invariant cache hit.
[2024-05-21 23:14:45] [INFO ] [Real]Absence check using 33 positive place invariants in 7 ms returned sat
[2024-05-21 23:14:45] [INFO ] [Real]Absence check using 33 positive and 28 generalized place invariants in 10 ms returned sat
[2024-05-21 23:14:45] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 23:14:45] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2024-05-21 23:14:45] [INFO ] [Nat]Absence check using 33 positive and 28 generalized place invariants in 11 ms returned sat
[2024-05-21 23:14:46] [INFO ] After 106ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 23:14:46] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:14:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2024-05-21 23:14:46] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:14:46] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:14:46] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 0 ms to minimize.
[2024-05-21 23:14:46] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 0 ms to minimize.
[2024-05-21 23:14:46] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 0 ms to minimize.
[2024-05-21 23:14:46] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 0 ms to minimize.
[2024-05-21 23:14:46] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 382 ms
[2024-05-21 23:14:46] [INFO ] After 576ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 41 ms.
[2024-05-21 23:14:46] [INFO ] After 692ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 1 properties in 12 ms.
Support contains 4 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 196/196 transitions.
Graph (complete) has 469 edges and 255 vertex of which 250 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 250 transition count 175
Reduce places removed 16 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 17 rules applied. Total rules applied 36 place count 234 transition count 174
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 37 place count 233 transition count 174
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 37 place count 233 transition count 164
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 57 place count 223 transition count 164
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 0 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 213 place count 145 transition count 86
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 3 with 4 rules applied. Total rules applied 217 place count 143 transition count 88
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 218 place count 143 transition count 87
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 219 place count 142 transition count 87
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 220 place count 142 transition count 87
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 221 place count 141 transition count 86
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 222 place count 140 transition count 86
Applied a total of 222 rules in 30 ms. Remains 140 /255 variables (removed 115) and now considering 86/196 (removed 110) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 140/255 places, 86/196 transitions.
Incomplete random walk after 10000 steps, including 428 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 93 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2005638 steps, run timeout after 3001 ms. (steps per millisecond=668 ) properties seen :{}
Probabilistic random walk after 2005638 steps, saw 271798 distinct states, run finished after 3001 ms. (steps per millisecond=668 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 86 rows 140 cols
[2024-05-21 23:14:49] [INFO ] Computed 60 invariants in 7 ms
[2024-05-21 23:14:49] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-21 23:14:49] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 5 ms returned sat
[2024-05-21 23:14:49] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 23:14:49] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-21 23:14:49] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 18 ms returned sat
[2024-05-21 23:14:49] [INFO ] After 77ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 23:14:49] [INFO ] After 86ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-21 23:14:49] [INFO ] After 162ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 86/86 transitions.
Applied a total of 0 rules in 3 ms. Remains 140 /140 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 140/140 places, 86/86 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 86/86 transitions.
Applied a total of 0 rules in 3 ms. Remains 140 /140 variables (removed 0) and now considering 86/86 (removed 0) transitions.
[2024-05-21 23:14:49] [INFO ] Invariant cache hit.
[2024-05-21 23:14:50] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-21 23:14:50] [INFO ] Invariant cache hit.
[2024-05-21 23:14:50] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2024-05-21 23:14:50] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 23:14:50] [INFO ] Invariant cache hit.
[2024-05-21 23:14:50] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 289 ms. Remains : 140/140 places, 86/86 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 140 transition count 86
Applied a total of 1 rules in 15 ms. Remains 140 /140 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 86 rows 140 cols
[2024-05-21 23:14:50] [INFO ] Computed 60 invariants in 2 ms
[2024-05-21 23:14:50] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-21 23:14:50] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 5 ms returned sat
[2024-05-21 23:14:50] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 23:14:50] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-21 23:14:50] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 18 ms returned sat
[2024-05-21 23:14:50] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 23:14:50] [INFO ] After 85ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2024-05-21 23:14:50] [INFO ] After 158ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p0), (F (AND p1 (NOT p2) p0)), (F p2), (F (AND (NOT p1) p2 p0)), (F (AND (NOT p1) (NOT p2) p0))]
Knowledge based reduction with 13 factoid took 604 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter insensitive) to 5 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 202 ms :[p2, (AND p0 p2 (NOT p1)), p0, (AND p0 p2 p1), (AND p2 p1 p0)]
Stuttering acceptance computed with spot in 199 ms :[p2, (AND p0 p2 (NOT p1)), p0, (AND p0 p2 p1), (AND p2 p1 p0)]
Support contains 4 out of 255 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 255/255 places, 196/196 transitions.
Graph (complete) has 469 edges and 255 vertex of which 250 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 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 249 transition count 178
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 235 transition count 177
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 234 transition count 177
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 31 place count 234 transition count 167
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 51 place count 224 transition count 167
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 0 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 207 place count 146 transition count 89
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 3 with 4 rules applied. Total rules applied 211 place count 144 transition count 91
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 213 place count 142 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 214 place count 141 transition count 89
Applied a total of 214 rules in 24 ms. Remains 141 /255 variables (removed 114) and now considering 89/196 (removed 107) transitions.
// Phase 1: matrix 89 rows 141 cols
[2024-05-21 23:14:51] [INFO ] Computed 58 invariants in 3 ms
[2024-05-21 23:14:51] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-21 23:14:51] [INFO ] Invariant cache hit.
[2024-05-21 23:14:51] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
[2024-05-21 23:14:51] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 23:14:51] [INFO ] Invariant cache hit.
[2024-05-21 23:14:51] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 141/255 places, 89/196 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 362 ms. Remains : 141/255 places, 89/196 transitions.
Computed a total of 36 stabilizing places and 31 stable transitions
Computed a total of 36 stabilizing places and 31 stable transitions
Detected a total of 36/141 stabilizing places and 31/89 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND p1 p2 p0))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 11 factoid took 331 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter insensitive) to 5 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 213 ms :[p2, (AND p2 p0 (NOT p1)), p0, (AND p0 p2 p1), (AND p2 p0 p1)]
Incomplete random walk after 10000 steps, including 487 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10000 steps, including 98 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 23:14:52] [INFO ] Invariant cache hit.
[2024-05-21 23:14:52] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-21 23:14:52] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 7 ms returned sat
[2024-05-21 23:14:52] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 23:14:52] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-21 23:14:52] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 6 ms returned sat
[2024-05-21 23:14:52] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 23:14:52] [INFO ] After 84ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-21 23:14:52] [INFO ] After 145ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 141 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 141/141 places, 89/89 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 141 transition count 88
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 141 transition count 87
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 140 transition count 87
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 140 transition count 87
Applied a total of 4 rules in 10 ms. Remains 140 /141 variables (removed 1) and now considering 87/89 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 140/141 places, 87/89 transitions.
Incomplete random walk after 10000 steps, including 469 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1976548 steps, run timeout after 3001 ms. (steps per millisecond=658 ) properties seen :{}
Probabilistic random walk after 1976548 steps, saw 268217 distinct states, run finished after 3001 ms. (steps per millisecond=658 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 87 rows 140 cols
[2024-05-21 23:14:55] [INFO ] Computed 59 invariants in 1 ms
[2024-05-21 23:14:55] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 23:14:55] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 8 ms returned sat
[2024-05-21 23:14:55] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 23:14:55] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-21 23:14:55] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 9 ms returned sat
[2024-05-21 23:14:55] [INFO ] After 90ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 23:14:55] [INFO ] After 99ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2024-05-21 23:14:55] [INFO ] After 163ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 87/87 transitions.
Applied a total of 0 rules in 3 ms. Remains 140 /140 variables (removed 0) and now considering 87/87 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 140/140 places, 87/87 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 87/87 transitions.
Applied a total of 0 rules in 3 ms. Remains 140 /140 variables (removed 0) and now considering 87/87 (removed 0) transitions.
[2024-05-21 23:14:55] [INFO ] Invariant cache hit.
[2024-05-21 23:14:56] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-21 23:14:56] [INFO ] Invariant cache hit.
[2024-05-21 23:14:56] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2024-05-21 23:14:56] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 23:14:56] [INFO ] Invariant cache hit.
[2024-05-21 23:14:56] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 296 ms. Remains : 140/140 places, 87/87 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 140 transition count 87
Applied a total of 1 rules in 4 ms. Remains 140 /140 variables (removed 0) and now considering 87/87 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 87 rows 140 cols
[2024-05-21 23:14:56] [INFO ] Computed 59 invariants in 1 ms
[2024-05-21 23:14:56] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 23:14:56] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 5 ms returned sat
[2024-05-21 23:14:56] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 23:14:56] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-21 23:14:56] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 7 ms returned sat
[2024-05-21 23:14:56] [INFO ] After 87ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 23:14:56] [INFO ] After 107ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-05-21 23:14:56] [INFO ] After 170ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND p1 p2 p0))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (F p0), (F (AND (NOT p2) p0 p1)), (F p2), (F (AND p2 p0 (NOT p1))), (F (AND (NOT p2) p0 (NOT p1)))]
Knowledge based reduction with 11 factoid took 492 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter insensitive) to 5 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 230 ms :[p2, (AND p2 p0 (NOT p1)), p0, (AND p0 p2 p1), (AND p2 p0 p1)]
Stuttering acceptance computed with spot in 219 ms :[p2, (AND p2 p0 (NOT p1)), p0, (AND p0 p2 p1), (AND p2 p0 p1)]
Stuttering acceptance computed with spot in 212 ms :[p2, (AND p2 p0 (NOT p1)), p0, (AND p0 p2 p1), (AND p2 p0 p1)]
Product exploration explored 100000 steps with 28396 reset in 256 ms.
Product exploration explored 100000 steps with 28277 reset in 221 ms.
Built C files in :
/tmp/ltsmin11362580386741482038
[2024-05-21 23:14:58] [INFO ] Computing symmetric may disable matrix : 89 transitions.
[2024-05-21 23:14:58] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:14:58] [INFO ] Computing symmetric may enable matrix : 89 transitions.
[2024-05-21 23:14:58] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:14:58] [INFO ] Computing Do-Not-Accords matrix : 89 transitions.
[2024-05-21 23:14:58] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:14:58] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11362580386741482038
Running compilation step : cd /tmp/ltsmin11362580386741482038;'/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 227 ms.
Running link step : cd /tmp/ltsmin11362580386741482038;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin11362580386741482038;'/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/stateBased7873589222908233249.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 89/89 transitions.
Applied a total of 0 rules in 10 ms. Remains 141 /141 variables (removed 0) and now considering 89/89 (removed 0) transitions.
// Phase 1: matrix 89 rows 141 cols
[2024-05-21 23:15:13] [INFO ] Computed 58 invariants in 2 ms
[2024-05-21 23:15:13] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-21 23:15:13] [INFO ] Invariant cache hit.
[2024-05-21 23:15:13] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
[2024-05-21 23:15:13] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 23:15:13] [INFO ] Invariant cache hit.
[2024-05-21 23:15:13] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 313 ms. Remains : 141/141 places, 89/89 transitions.
Built C files in :
/tmp/ltsmin15868305336037166942
[2024-05-21 23:15:13] [INFO ] Computing symmetric may disable matrix : 89 transitions.
[2024-05-21 23:15:13] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:15:13] [INFO ] Computing symmetric may enable matrix : 89 transitions.
[2024-05-21 23:15:13] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:15:13] [INFO ] Computing Do-Not-Accords matrix : 89 transitions.
[2024-05-21 23:15:13] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:15:13] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15868305336037166942
Running compilation step : cd /tmp/ltsmin15868305336037166942;'/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 224 ms.
Running link step : cd /tmp/ltsmin15868305336037166942;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin15868305336037166942;'/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/stateBased7966405949913536813.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 23:15:28] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:15:28] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:15:28] [INFO ] Time to serialize gal into /tmp/LTL15435369952747089845.gal : 1 ms
[2024-05-21 23:15:28] [INFO ] Time to serialize properties into /tmp/LTL11170349624868424161.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/LTL15435369952747089845.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5838152355598938409.hoa' '-atoms' '/tmp/LTL11170349624868424161.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/LTL11170349624868424161.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5838152355598938409.hoa
Detected timeout of ITS tools.
[2024-05-21 23:15:43] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:15:43] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:15:43] [INFO ] Time to serialize gal into /tmp/LTL17567181339323546245.gal : 1 ms
[2024-05-21 23:15:43] [INFO ] Time to serialize properties into /tmp/LTL1746552580178161952.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/LTL17567181339323546245.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1746552580178161952.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 : !(((X(F(!("((p141==1)&&(p143==1))"))))U((X("(p108==1)"))U(("(p66==1)")U(G("(p66!=1)"))))))
Formula 0 simplified : XG"((p141==1)&&(p143==1))" R (X!"(p108==1)" R (!"(p66==1)" R F!"(p66!=1)"))
Detected timeout of ITS tools.
[2024-05-21 23:15:58] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:15:58] [INFO ] Applying decomposition
[2024-05-21 23:15:58] [INFO ] Flatten gal took : 7 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/graph6075489321885552992.txt' '-o' '/tmp/graph6075489321885552992.bin' '-w' '/tmp/graph6075489321885552992.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6075489321885552992.bin' '-l' '-1' '-v' '-w' '/tmp/graph6075489321885552992.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:15:58] [INFO ] Decomposing Gal with order
[2024-05-21 23:15:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:15:58] [INFO ] Removed a total of 42 redundant transitions.
[2024-05-21 23:15:58] [INFO ] Flatten gal took : 25 ms
[2024-05-21 23:15:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 2 ms.
[2024-05-21 23:15:58] [INFO ] Time to serialize gal into /tmp/LTL16943500865216742356.gal : 5 ms
[2024-05-21 23:15:58] [INFO ] Time to serialize properties into /tmp/LTL3758060822096429749.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/LTL16943500865216742356.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3758060822096429749.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...255
Read 1 LTL properties
Checking formula 0 : !(((X(F(!("((i4.u8.p141==1)&&(i4.u8.p143==1))"))))U((X("(i3.u6.p108==1)"))U(("(i0.u2.p66==1)")U(G("(i0.u2.p66!=1)"))))))
Formula 0 simplified : XG"((i4.u8.p141==1)&&(i4.u8.p143==1))" R (X!"(i3.u6.p108==1)" R (!"(i0.u2.p66==1)" R F!"(i0.u2.p66!=1)"))
Reverse transition relation is NOT exact ! Due to transitions t198_t79, t7_t48_t39, t9_t34, t10_t34, t166_t34, t165_t25, t107_t109_t204_t131_t128_t118_t119...426
Computing Next relation with stutter on 1.20585e+06 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10808324325590950865
[2024-05-21 23:16:14] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10808324325590950865
Running compilation step : cd /tmp/ltsmin10808324325590950865;'/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 208 ms.
Running link step : cd /tmp/ltsmin10808324325590950865;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin10808324325590950865;'/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' '(X(<>(!(LTLAPp0==true))) U (X((LTLAPp1==true)) U ((LTLAPp2==true) U [](!(LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-05b-LTLFireability-03 finished in 105634 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(X(G(p0)))))'
Support contains 2 out of 261 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 205/205 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 255 transition count 199
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 255 transition count 199
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 255 transition count 198
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 254 transition count 197
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 254 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 254 transition count 196
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 253 transition count 195
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 253 transition count 195
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 253 transition count 194
Applied a total of 19 rules in 14 ms. Remains 253 /261 variables (removed 8) and now considering 194/205 (removed 11) transitions.
// Phase 1: matrix 194 rows 253 cols
[2024-05-21 23:16:29] [INFO ] Computed 61 invariants in 3 ms
[2024-05-21 23:16:29] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-21 23:16:29] [INFO ] Invariant cache hit.
[2024-05-21 23:16:29] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
[2024-05-21 23:16:29] [INFO ] Invariant cache hit.
[2024-05-21 23:16:29] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 253/261 places, 194/205 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 508 ms. Remains : 253/261 places, 194/205 transitions.
Stuttering acceptance computed with spot in 183 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-05b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (NEQ s18 1) (NEQ s102 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 1513 steps with 11 reset in 9 ms.
FORMULA DES-PT-05b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-05b-LTLFireability-04 finished in 726 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||F(p1)))))'
Support contains 2 out of 261 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 261/261 places, 205/205 transitions.
Graph (complete) has 482 edges and 261 vertex of which 256 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 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 255 transition count 188
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 242 transition count 188
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 27 place count 242 transition count 175
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 53 place count 229 transition count 175
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 58 place count 224 transition count 170
Iterating global reduction 2 with 5 rules applied. Total rules applied 63 place count 224 transition count 170
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 224 transition count 169
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 64 place count 224 transition count 167
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 68 place count 222 transition count 167
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 69 place count 221 transition count 166
Iterating global reduction 3 with 1 rules applied. Total rules applied 70 place count 221 transition count 166
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 2 rules applied. Total rules applied 72 place count 221 transition count 164
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 74 place count 220 transition count 163
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 5 with 146 rules applied. Total rules applied 220 place count 147 transition count 90
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 224 place count 145 transition count 92
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 226 place count 143 transition count 90
Applied a total of 226 rules in 31 ms. Remains 143 /261 variables (removed 118) and now considering 90/205 (removed 115) transitions.
// Phase 1: matrix 90 rows 143 cols
[2024-05-21 23:16:29] [INFO ] Computed 59 invariants in 2 ms
[2024-05-21 23:16:29] [INFO ] Implicit Places using invariants in 99 ms returned [32]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 101 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 142/261 places, 90/205 transitions.
Applied a total of 0 rules in 2 ms. Remains 142 /142 variables (removed 0) and now considering 90/90 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 135 ms. Remains : 142/261 places, 90/205 transitions.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-05b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s95 0), p1:(EQ s32 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5826 reset in 243 ms.
Product exploration explored 100000 steps with 5791 reset in 249 ms.
Computed a total of 38 stabilizing places and 33 stable transitions
Computed a total of 38 stabilizing places and 33 stable transitions
Detected a total of 38/142 stabilizing places and 33/90 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 274 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 2 factoid took 417 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 142 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 142/142 places, 90/90 transitions.
Applied a total of 0 rules in 6 ms. Remains 142 /142 variables (removed 0) and now considering 90/90 (removed 0) transitions.
// Phase 1: matrix 90 rows 142 cols
[2024-05-21 23:16:31] [INFO ] Computed 58 invariants in 2 ms
[2024-05-21 23:16:31] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-21 23:16:31] [INFO ] Invariant cache hit.
[2024-05-21 23:16:31] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 23:16:31] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
[2024-05-21 23:16:31] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 23:16:31] [INFO ] Invariant cache hit.
[2024-05-21 23:16:31] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 331 ms. Remains : 142/142 places, 90/90 transitions.
Computed a total of 38 stabilizing places and 33 stable transitions
Computed a total of 38 stabilizing places and 33 stable transitions
Detected a total of 38/142 stabilizing places and 33/90 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 259 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 2 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 2 factoid took 332 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 5694 reset in 211 ms.
Product exploration explored 100000 steps with 5852 reset in 237 ms.
Built C files in :
/tmp/ltsmin15750365773691068356
[2024-05-21 23:16:33] [INFO ] Computing symmetric may disable matrix : 90 transitions.
[2024-05-21 23:16:33] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:16:33] [INFO ] Computing symmetric may enable matrix : 90 transitions.
[2024-05-21 23:16:33] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:16:33] [INFO ] Computing Do-Not-Accords matrix : 90 transitions.
[2024-05-21 23:16:33] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:16:33] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15750365773691068356
Running compilation step : cd /tmp/ltsmin15750365773691068356;'/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 233 ms.
Running link step : cd /tmp/ltsmin15750365773691068356;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin15750365773691068356;'/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/stateBased16962214232965443094.hoa' '--buchi-type=spotba'
LTSmin run took 507 ms.
FORMULA DES-PT-05b-LTLFireability-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-05b-LTLFireability-05 finished in 4225 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(G(p0)))'
Support contains 2 out of 261 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 205/205 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 255 transition count 199
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 255 transition count 199
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 255 transition count 198
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 254 transition count 197
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 254 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 254 transition count 196
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 253 transition count 195
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 253 transition count 195
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 253 transition count 194
Applied a total of 19 rules in 13 ms. Remains 253 /261 variables (removed 8) and now considering 194/205 (removed 11) transitions.
// Phase 1: matrix 194 rows 253 cols
[2024-05-21 23:16:34] [INFO ] Computed 61 invariants in 2 ms
[2024-05-21 23:16:34] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-21 23:16:34] [INFO ] Invariant cache hit.
[2024-05-21 23:16:34] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
[2024-05-21 23:16:34] [INFO ] Invariant cache hit.
[2024-05-21 23:16:34] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 253/261 places, 194/205 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 479 ms. Remains : 253/261 places, 194/205 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-05b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (NEQ s18 1) (NEQ s102 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 3865 steps with 31 reset in 7 ms.
FORMULA DES-PT-05b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-05b-LTLFireability-07 finished in 588 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((G(p0)||(!p1 U (p2||G(!p1)))))))'
Support contains 4 out of 261 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 261/261 places, 205/205 transitions.
Graph (complete) has 482 edges and 261 vertex of which 256 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 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 255 transition count 187
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 241 transition count 187
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 29 place count 241 transition count 177
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 49 place count 231 transition count 177
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 54 place count 226 transition count 172
Iterating global reduction 2 with 5 rules applied. Total rules applied 59 place count 226 transition count 172
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 60 place count 226 transition count 171
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 60 place count 226 transition count 169
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 64 place count 224 transition count 169
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 65 place count 223 transition count 168
Iterating global reduction 3 with 1 rules applied. Total rules applied 66 place count 223 transition count 168
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 2 rules applied. Total rules applied 68 place count 223 transition count 166
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 70 place count 222 transition count 165
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 5 with 148 rules applied. Total rules applied 218 place count 148 transition count 91
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 222 place count 146 transition count 93
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 224 place count 144 transition count 91
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 225 place count 143 transition count 91
Applied a total of 225 rules in 37 ms. Remains 143 /261 variables (removed 118) and now considering 91/205 (removed 114) transitions.
// Phase 1: matrix 91 rows 143 cols
[2024-05-21 23:16:34] [INFO ] Computed 58 invariants in 1 ms
[2024-05-21 23:16:34] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-21 23:16:34] [INFO ] Invariant cache hit.
[2024-05-21 23:16:34] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2024-05-21 23:16:34] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 23:16:34] [INFO ] Invariant cache hit.
[2024-05-21 23:16:35] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 143/261 places, 91/205 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 335 ms. Remains : 143/261 places, 91/205 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Running random walk in product with property : DES-PT-05b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p2:(AND (NEQ s60 1) (NOT (AND (EQ s37 1) (EQ s49 1)))), p1:(AND (EQ s37 1) (EQ s49 1)), p0:(EQ s31 0)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4612 reset in 205 ms.
Product exploration explored 100000 steps with 4621 reset in 221 ms.
Computed a total of 37 stabilizing places and 32 stable transitions
Computed a total of 37 stabilizing places and 32 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1)))))]
Knowledge based reduction with 7 factoid took 249 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Finished random walk after 263 steps, including 11 resets, run visited all 5 properties in 3 ms. (steps per millisecond=87 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p1 (NOT p2))), (F (AND p0 p1 (NOT p2))), (F (AND p0 (NOT p1) (NOT p2)))]
Knowledge based reduction with 7 factoid took 451 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 73 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Support contains 4 out of 143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 91/91 transitions.
Applied a total of 0 rules in 5 ms. Remains 143 /143 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2024-05-21 23:16:36] [INFO ] Invariant cache hit.
[2024-05-21 23:16:36] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-21 23:16:36] [INFO ] Invariant cache hit.
[2024-05-21 23:16:36] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
[2024-05-21 23:16:36] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 23:16:36] [INFO ] Invariant cache hit.
[2024-05-21 23:16:36] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 350 ms. Remains : 143/143 places, 91/91 transitions.
Computed a total of 37 stabilizing places and 32 stable transitions
Computed a total of 37 stabilizing places and 32 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
Knowledge based reduction with 7 factoid took 204 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Finished random walk after 370 steps, including 16 resets, run visited all 5 properties in 6 ms. (steps per millisecond=61 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p1 (NOT p2))), (F (AND p0 p1 (NOT p2))), (F (AND p0 (NOT p1) (NOT p2)))]
Knowledge based reduction with 7 factoid took 320 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 77 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 90 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 4668 reset in 197 ms.
Product exploration explored 100000 steps with 4645 reset in 211 ms.
Built C files in :
/tmp/ltsmin11319758870270789681
[2024-05-21 23:16:38] [INFO ] Computing symmetric may disable matrix : 91 transitions.
[2024-05-21 23:16:38] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:16:38] [INFO ] Computing symmetric may enable matrix : 91 transitions.
[2024-05-21 23:16:38] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:16:38] [INFO ] Computing Do-Not-Accords matrix : 91 transitions.
[2024-05-21 23:16:38] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:16:38] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11319758870270789681
Running compilation step : cd /tmp/ltsmin11319758870270789681;'/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 229 ms.
Running link step : cd /tmp/ltsmin11319758870270789681;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin11319758870270789681;'/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/stateBased5812499120765104184.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 91/91 transitions.
Applied a total of 0 rules in 7 ms. Remains 143 /143 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2024-05-21 23:16:53] [INFO ] Invariant cache hit.
[2024-05-21 23:16:53] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-21 23:16:53] [INFO ] Invariant cache hit.
[2024-05-21 23:16:53] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2024-05-21 23:16:53] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 23:16:53] [INFO ] Invariant cache hit.
[2024-05-21 23:16:53] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 317 ms. Remains : 143/143 places, 91/91 transitions.
Built C files in :
/tmp/ltsmin17031666529761208550
[2024-05-21 23:16:53] [INFO ] Computing symmetric may disable matrix : 91 transitions.
[2024-05-21 23:16:53] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:16:53] [INFO ] Computing symmetric may enable matrix : 91 transitions.
[2024-05-21 23:16:53] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:16:53] [INFO ] Computing Do-Not-Accords matrix : 91 transitions.
[2024-05-21 23:16:53] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:16:53] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17031666529761208550
Running compilation step : cd /tmp/ltsmin17031666529761208550;'/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 227 ms.
Running link step : cd /tmp/ltsmin17031666529761208550;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin17031666529761208550;'/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/stateBased15195297793369841238.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 23:17:08] [INFO ] Flatten gal took : 17 ms
[2024-05-21 23:17:08] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:17:08] [INFO ] Time to serialize gal into /tmp/LTL12849058267207051350.gal : 1 ms
[2024-05-21 23:17:08] [INFO ] Time to serialize properties into /tmp/LTL18408753947794706820.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/LTL12849058267207051350.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11944712280183108033.hoa' '-atoms' '/tmp/LTL18408753947794706820.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...320
Loading property file /tmp/LTL18408753947794706820.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11944712280183108033.hoa
Detected timeout of ITS tools.
[2024-05-21 23:17:23] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:17:23] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:17:23] [INFO ] Time to serialize gal into /tmp/LTL14552889201676052796.gal : 8 ms
[2024-05-21 23:17:23] [INFO ] Time to serialize properties into /tmp/LTL5339977644734104432.ltl : 7 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/LTL14552889201676052796.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5339977644734104432.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 : !((G(F((G("(p82==0)"))||((!("((p103==1)&&(p140==1))"))U(("((p157!=1)&&(!((p103==1)&&(p140==1))))")||(G(!("((p103==1)&&(p140==1))")))))...159
Formula 0 simplified : G(F!"(p82==0)" & FG("((p103==1)&&(p140==1))" M !"((p157!=1)&&(!((p103==1)&&(p140==1))))"))
Detected timeout of ITS tools.
[2024-05-21 23:17:38] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:17:38] [INFO ] Applying decomposition
[2024-05-21 23:17:38] [INFO ] Flatten gal took : 5 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/graph7585768121212740051.txt' '-o' '/tmp/graph7585768121212740051.bin' '-w' '/tmp/graph7585768121212740051.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7585768121212740051.bin' '-l' '-1' '-v' '-w' '/tmp/graph7585768121212740051.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:17:38] [INFO ] Decomposing Gal with order
[2024-05-21 23:17:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:17:39] [INFO ] Removed a total of 49 redundant transitions.
[2024-05-21 23:17:39] [INFO ] Flatten gal took : 42 ms
[2024-05-21 23:17:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 3 ms.
[2024-05-21 23:17:39] [INFO ] Time to serialize gal into /tmp/LTL11165533489033972937.gal : 14 ms
[2024-05-21 23:17:39] [INFO ] Time to serialize properties into /tmp/LTL8741691693648554131.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/LTL11165533489033972937.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8741691693648554131.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...255
Read 1 LTL properties
Checking formula 0 : !((G(F((G("(i14.u4.p82==0)"))||((!("((i2.u6.p103==1)&&(i2.u8.p140==1))"))U(("((i14.u12.p157!=1)&&(!((i2.u6.p103==1)&&(i2.u8.p140==1)))...210
Formula 0 simplified : G(F!"(i14.u4.p82==0)" & FG("((i2.u6.p103==1)&&(i2.u8.p140==1))" M !"((i14.u12.p157!=1)&&(!((i2.u6.p103==1)&&(i2.u8.p140==1))))"))
Reverse transition relation is NOT exact ! Due to transitions t198_t79, t7_t48_t39, t26_t35_t73_t36_t38_t49_t65_t66_t67_t68_t69_t70_t71_t50_t52_t54_t56_t58...519
Computing Next relation with stutter on 1.20585e+06 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14002746459592574080
[2024-05-21 23:17:54] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14002746459592574080
Running compilation step : cd /tmp/ltsmin14002746459592574080;'/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 217 ms.
Running link step : cd /tmp/ltsmin14002746459592574080;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin14002746459592574080;'/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))||(!(LTLAPp1==true) U ((LTLAPp2==true)||[](!(LTLAPp1==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-05b-LTLFireability-08 finished in 94608 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 1 out of 261 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 261/261 places, 205/205 transitions.
Graph (complete) has 482 edges and 261 vertex of which 256 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 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 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 255 transition count 188
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 242 transition count 188
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 27 place count 242 transition count 176
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 51 place count 230 transition count 176
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 56 place count 225 transition count 171
Iterating global reduction 2 with 5 rules applied. Total rules applied 61 place count 225 transition count 171
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 225 transition count 170
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 62 place count 225 transition count 169
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 64 place count 224 transition count 169
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 65 place count 223 transition count 168
Iterating global reduction 3 with 1 rules applied. Total rules applied 66 place count 223 transition count 168
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 2 rules applied. Total rules applied 68 place count 223 transition count 166
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 70 place count 222 transition count 165
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 224 place count 145 transition count 88
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 228 place count 143 transition count 90
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 230 place count 141 transition count 88
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 231 place count 140 transition count 88
Applied a total of 231 rules in 44 ms. Remains 140 /261 variables (removed 121) and now considering 88/205 (removed 117) transitions.
// Phase 1: matrix 88 rows 140 cols
[2024-05-21 23:18:09] [INFO ] Computed 58 invariants in 1 ms
[2024-05-21 23:18:09] [INFO ] Implicit Places using invariants in 284 ms returned []
[2024-05-21 23:18:09] [INFO ] Invariant cache hit.
[2024-05-21 23:18:09] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
[2024-05-21 23:18:09] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-21 23:18:09] [INFO ] Invariant cache hit.
[2024-05-21 23:18:09] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 140/261 places, 88/205 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 692 ms. Remains : 140/261 places, 88/205 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-05b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s47 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 24 steps with 0 reset in 0 ms.
FORMULA DES-PT-05b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-05b-LTLFireability-10 finished in 764 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 U (X(p2)&&p1))||X(p3)))||G(p4)))'
Support contains 11 out of 261 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 205/205 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 257 transition count 201
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 257 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 257 transition count 200
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 256 transition count 199
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 256 transition count 199
Applied a total of 11 rules in 6 ms. Remains 256 /261 variables (removed 5) and now considering 199/205 (removed 6) transitions.
// Phase 1: matrix 199 rows 256 cols
[2024-05-21 23:18:10] [INFO ] Computed 61 invariants in 2 ms
[2024-05-21 23:18:10] [INFO ] Implicit Places using invariants in 205 ms returned []
[2024-05-21 23:18:10] [INFO ] Invariant cache hit.
[2024-05-21 23:18:10] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 626 ms to find 0 implicit places.
[2024-05-21 23:18:10] [INFO ] Invariant cache hit.
[2024-05-21 23:18:10] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 256/261 places, 199/205 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 776 ms. Remains : 256/261 places, 199/205 transitions.
Stuttering acceptance computed with spot in 221 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p3) (NOT p4))), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p3) (NOT p4))), (AND (NOT p2) (NOT p3) (NOT p4))]
Running random walk in product with property : DES-PT-05b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p3)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p4)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p4)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p4), acceptance={} source=2 dest: 3}, { cond=(AND p1 p4), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p4) (NOT p3)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p4) (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p4 (NOT p3)), acceptance={} source=3 dest: 3}, { cond=(AND p1 p4 (NOT p3)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p4) (NOT p3) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p1 (NOT p4) (NOT p3) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p4 (NOT p3) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p1 p4 (NOT p3) (NOT p2)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (EQ s123 1) (EQ s132 1)), p3:(OR (EQ s46 0) (EQ s103 0)), p2:(AND (EQ s34 1) (EQ s38 1) (EQ s50 1) (EQ s51 1) (EQ s55 1) (EQ s62 1)), p4:(EQ s59 0...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 224 ms.
Product exploration explored 100000 steps with 50000 reset in 219 ms.
Computed a total of 77 stabilizing places and 70 stable transitions
Graph (complete) has 473 edges and 256 vertex of which 251 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 77 stabilizing places and 70 stable transitions
Detected a total of 77/256 stabilizing places and 70/199 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p3 (NOT p2) p4), (X (NOT (AND p1 p4 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p4) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND p1 (NOT p4) (NOT p3) (NOT p2)))), (X (NOT (AND p1 p4 (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) p4 (NOT p3)))), (X (NOT (AND p1 (NOT p3)))), (X (NOT (AND p1 (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) p4 (NOT p3) (NOT p2)))), (X (NOT (AND p1 (NOT p4) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p4) (NOT p3) (NOT p2)))), (X (X (NOT (AND p1 p4 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p4) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND p1 (NOT p4) (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 p4 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) p4 (NOT p3))))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) p4 (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 (NOT p4) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p4) (NOT p3) (NOT p2))))), (F (OR (G p4) (G (NOT p4))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 26 factoid took 238 ms. Reduced automaton from 5 states, 16 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-05b-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-05b-LTLFireability-11 finished in 1700 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)&&F(p1))))'
Support contains 3 out of 261 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 261/261 places, 205/205 transitions.
Graph (complete) has 482 edges and 261 vertex of which 256 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 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 255 transition count 187
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 241 transition count 187
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 241 transition count 175
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 53 place count 229 transition count 175
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 55 place count 227 transition count 173
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 227 transition count 173
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 2 with 154 rules applied. Total rules applied 211 place count 150 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 212 place count 150 transition count 95
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 218 place count 147 transition count 110
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 220 place count 145 transition count 108
Applied a total of 220 rules in 52 ms. Remains 145 /261 variables (removed 116) and now considering 108/205 (removed 97) transitions.
// Phase 1: matrix 108 rows 145 cols
[2024-05-21 23:18:11] [INFO ] Computed 59 invariants in 1 ms
[2024-05-21 23:18:12] [INFO ] Implicit Places using invariants in 643 ms returned []
[2024-05-21 23:18:12] [INFO ] Invariant cache hit.
[2024-05-21 23:18:12] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-21 23:18:12] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 824 ms to find 0 implicit places.
[2024-05-21 23:18:12] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 23:18:12] [INFO ] Invariant cache hit.
[2024-05-21 23:18:12] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 145/261 places, 108/205 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 982 ms. Remains : 145/261 places, 108/205 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DES-PT-05b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s26 1), p1:(AND (EQ s47 1) (EQ s51 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 0 ms.
FORMULA DES-PT-05b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-05b-LTLFireability-12 finished in 1103 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(p0)&&F(p1)))'
Support contains 4 out of 261 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 205/205 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 255 transition count 199
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 255 transition count 199
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 255 transition count 198
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 254 transition count 197
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 254 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 254 transition count 196
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 253 transition count 195
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 253 transition count 195
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 253 transition count 194
Applied a total of 19 rules in 23 ms. Remains 253 /261 variables (removed 8) and now considering 194/205 (removed 11) transitions.
// Phase 1: matrix 194 rows 253 cols
[2024-05-21 23:18:12] [INFO ] Computed 61 invariants in 1 ms
[2024-05-21 23:18:13] [INFO ] Implicit Places using invariants in 270 ms returned []
[2024-05-21 23:18:13] [INFO ] Invariant cache hit.
[2024-05-21 23:18:13] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
[2024-05-21 23:18:13] [INFO ] Invariant cache hit.
[2024-05-21 23:18:13] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 253/261 places, 194/205 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 689 ms. Remains : 253/261 places, 194/205 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : DES-PT-05b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s8 1) (EQ s109 1)), p0:(AND (EQ s2 1) (EQ s107 1))], 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 0 ms.
FORMULA DES-PT-05b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-05b-LTLFireability-14 finished in 824 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(G(p0))&&F(p1))))'
Support contains 2 out of 261 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 205/205 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 255 transition count 199
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 255 transition count 199
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 255 transition count 198
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 254 transition count 197
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 254 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 254 transition count 196
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 253 transition count 195
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 253 transition count 195
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 253 transition count 194
Applied a total of 19 rules in 19 ms. Remains 253 /261 variables (removed 8) and now considering 194/205 (removed 11) transitions.
[2024-05-21 23:18:13] [INFO ] Invariant cache hit.
[2024-05-21 23:18:13] [INFO ] Implicit Places using invariants in 215 ms returned []
[2024-05-21 23:18:13] [INFO ] Invariant cache hit.
[2024-05-21 23:18:14] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 496 ms to find 0 implicit places.
[2024-05-21 23:18:14] [INFO ] Invariant cache hit.
[2024-05-21 23:18:14] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 253/261 places, 194/205 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 638 ms. Remains : 253/261 places, 194/205 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : DES-PT-05b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s60 0), p0:(EQ s155 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 865 reset in 164 ms.
Product exploration explored 100000 steps with 878 reset in 188 ms.
Computed a total of 76 stabilizing places and 69 stable transitions
Graph (complete) has 467 edges and 253 vertex of which 248 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Computed a total of 76 stabilizing places and 69 stable transitions
Detected a total of 76/253 stabilizing places and 69/194 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 198 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Finished random walk after 79 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=79 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 6 factoid took 158 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 1 out of 253 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 253/253 places, 194/194 transitions.
Graph (complete) has 467 edges and 253 vertex of which 248 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 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 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 247 transition count 175
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 232 transition count 175
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 31 place count 232 transition count 163
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 55 place count 220 transition count 163
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 201 place count 147 transition count 90
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 205 place count 145 transition count 92
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 207 place count 143 transition count 90
Applied a total of 207 rules in 16 ms. Remains 143 /253 variables (removed 110) and now considering 90/194 (removed 104) transitions.
// Phase 1: matrix 90 rows 143 cols
[2024-05-21 23:18:15] [INFO ] Computed 59 invariants in 1 ms
[2024-05-21 23:18:15] [INFO ] Implicit Places using invariants in 226 ms returned [32]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 248 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 142/253 places, 90/194 transitions.
Applied a total of 0 rules in 2 ms. Remains 142 /142 variables (removed 0) and now considering 90/90 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 269 ms. Remains : 142/253 places, 90/194 transitions.
Computed a total of 39 stabilizing places and 34 stable transitions
Computed a total of 39 stabilizing places and 34 stable transitions
Detected a total of 39/142 stabilizing places and 34/90 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (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 2 factoid took 174 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 197 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4457 reset in 202 ms.
Product exploration explored 100000 steps with 4491 reset in 225 ms.
Built C files in :
/tmp/ltsmin6314277042806088441
[2024-05-21 23:18:16] [INFO ] Computing symmetric may disable matrix : 90 transitions.
[2024-05-21 23:18:16] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:18:16] [INFO ] Computing symmetric may enable matrix : 90 transitions.
[2024-05-21 23:18:16] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:18:16] [INFO ] Computing Do-Not-Accords matrix : 90 transitions.
[2024-05-21 23:18:16] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:18:16] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6314277042806088441
Running compilation step : cd /tmp/ltsmin6314277042806088441;'/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 227 ms.
Running link step : cd /tmp/ltsmin6314277042806088441;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin6314277042806088441;'/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/stateBased14373361190388888307.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 142 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 142/142 places, 90/90 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 140 transition count 88
Applied a total of 1 rules in 12 ms. Remains 140 /142 variables (removed 2) and now considering 88/90 (removed 2) transitions.
// Phase 1: matrix 88 rows 140 cols
[2024-05-21 23:18:31] [INFO ] Computed 58 invariants in 1 ms
[2024-05-21 23:18:31] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-21 23:18:31] [INFO ] Invariant cache hit.
[2024-05-21 23:18:31] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
[2024-05-21 23:18:31] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 23:18:31] [INFO ] Invariant cache hit.
[2024-05-21 23:18:31] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 140/142 places, 88/90 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 331 ms. Remains : 140/142 places, 88/90 transitions.
Built C files in :
/tmp/ltsmin10870061815099466838
[2024-05-21 23:18:31] [INFO ] Computing symmetric may disable matrix : 88 transitions.
[2024-05-21 23:18:31] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:18:31] [INFO ] Computing symmetric may enable matrix : 88 transitions.
[2024-05-21 23:18:31] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:18:31] [INFO ] Computing Do-Not-Accords matrix : 88 transitions.
[2024-05-21 23:18:31] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:18:31] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10870061815099466838
Running compilation step : cd /tmp/ltsmin10870061815099466838;'/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 216 ms.
Running link step : cd /tmp/ltsmin10870061815099466838;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin10870061815099466838;'/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/stateBased887970082158000736.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 23:18:47] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:18:47] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:18:47] [INFO ] Time to serialize gal into /tmp/LTL7727803940541131610.gal : 17 ms
[2024-05-21 23:18:47] [INFO ] Time to serialize properties into /tmp/LTL7441021253123899662.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/LTL7727803940541131610.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6844635796729223936.hoa' '-atoms' '/tmp/LTL7441021253123899662.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...317
Loading property file /tmp/LTL7441021253123899662.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6844635796729223936.hoa
Detected timeout of ITS tools.
[2024-05-21 23:19:02] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:19:02] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:19:02] [INFO ] Time to serialize gal into /tmp/LTL14971566935574427673.gal : 1 ms
[2024-05-21 23:19:02] [INFO ] Time to serialize properties into /tmp/LTL16866149659143452137.ltl : 5 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/LTL14971566935574427673.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16866149659143452137.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...277
Read 1 LTL properties
Checking formula 0 : !((X((F(G("(p197==0)")))&&(F("(p88==0)")))))
Formula 0 simplified : X(GF!"(p197==0)" | G!"(p88==0)")
Detected timeout of ITS tools.
[2024-05-21 23:19:17] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:19:17] [INFO ] Applying decomposition
[2024-05-21 23:19:17] [INFO ] Flatten gal took : 5 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/graph12772869607297236386.txt' '-o' '/tmp/graph12772869607297236386.bin' '-w' '/tmp/graph12772869607297236386.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12772869607297236386.bin' '-l' '-1' '-v' '-w' '/tmp/graph12772869607297236386.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:19:17] [INFO ] Decomposing Gal with order
[2024-05-21 23:19:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:19:17] [INFO ] Removed a total of 42 redundant transitions.
[2024-05-21 23:19:17] [INFO ] Flatten gal took : 23 ms
[2024-05-21 23:19:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 3 ms.
[2024-05-21 23:19:17] [INFO ] Time to serialize gal into /tmp/LTL11933858085641890579.gal : 3 ms
[2024-05-21 23:19:17] [INFO ] Time to serialize properties into /tmp/LTL190717207564595389.ltl : 1 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/LTL11933858085641890579.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL190717207564595389.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...254
Read 1 LTL properties
Checking formula 0 : !((X((F(G("(i8.i1.u22.p197==0)")))&&(F("(i4.u7.p88==0)")))))
Formula 0 simplified : X(GF!"(i8.i1.u22.p197==0)" | G!"(i4.u7.p88==0)")
Reverse transition relation is NOT exact ! Due to transitions t77_t106_t110_t113_t116_t127, t78_t80_t81_t88_t89_t82, t198_t79, t56_t58_t60_t62, t7_t48_t39,...522
Computing Next relation with stutter on 1.20585e+06 deadlock states
4 unique states visited
0 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
308 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.1201,112616,1,0,228160,3724,1663,209898,865,17992,313033
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DES-PT-05b-LTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property DES-PT-05b-LTLFireability-15 finished in 67173 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)) U (X(p1) U (p2 U G(!p2)))))'
Found a Lengthening insensitive property : DES-PT-05b-LTLFireability-03
Stuttering acceptance computed with spot in 218 ms :[p2, (AND p0 p2 (NOT p1)), (AND p2 (NOT p1) p0), p0, (AND p0 p2 p1), (AND p0 p2)]
Support contains 4 out of 261 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 261/261 places, 205/205 transitions.
Graph (complete) has 482 edges and 261 vertex of which 256 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 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 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 255 transition count 189
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 243 transition count 188
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 242 transition count 188
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 27 place count 242 transition count 177
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 49 place count 231 transition count 177
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 52 place count 228 transition count 174
Iterating global reduction 3 with 3 rules applied. Total rules applied 55 place count 228 transition count 174
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 57 place count 228 transition count 172
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 58 place count 227 transition count 172
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 59 place count 226 transition count 171
Iterating global reduction 5 with 1 rules applied. Total rules applied 60 place count 226 transition count 171
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 5 with 2 rules applied. Total rules applied 62 place count 226 transition count 169
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 64 place count 225 transition count 168
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 7 with 154 rules applied. Total rules applied 218 place count 148 transition count 91
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 224 place count 145 transition count 99
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 226 place count 143 transition count 97
Applied a total of 226 rules in 22 ms. Remains 143 /261 variables (removed 118) and now considering 97/205 (removed 108) transitions.
// Phase 1: matrix 97 rows 143 cols
[2024-05-21 23:19:21] [INFO ] Computed 59 invariants in 1 ms
[2024-05-21 23:19:21] [INFO ] Implicit Places using invariants in 330 ms returned []
[2024-05-21 23:19:21] [INFO ] Invariant cache hit.
[2024-05-21 23:19:21] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-21 23:19:21] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
[2024-05-21 23:19:21] [INFO ] Invariant cache hit.
[2024-05-21 23:19:21] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 143/261 places, 97/205 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 640 ms. Remains : 143/261 places, 97/205 transitions.
Running random walk in product with property : DES-PT-05b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=p2, acceptance={0} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=(AND p2 (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 4}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=2 dest: 5}], [{ cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=(AND p2 p1 p0), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) p0), acceptance={} source=5 dest: 4}, { cond=(AND p2 p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(EQ s27 1), p1:(EQ s40 1), p0:(AND (EQ s52 1) (EQ s54 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33362 reset in 187 ms.
Product exploration explored 100000 steps with 33193 reset in 212 ms.
Computed a total of 38 stabilizing places and 39 stable transitions
Computed a total of 38 stabilizing places and 39 stable transitions
Detected a total of 38/143 stabilizing places and 39/97 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 372 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 167 ms :[p2, (AND p2 p0 (NOT p1)), p0, (AND p0 p2 p1), (AND p2 p0 p1)]
Incomplete random walk after 10000 steps, including 480 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 108 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 23:19:22] [INFO ] Invariant cache hit.
[2024-05-21 23:19:22] [INFO ] [Real]Absence check using 34 positive place invariants in 4 ms returned sat
[2024-05-21 23:19:22] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 5 ms returned sat
[2024-05-21 23:19:22] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 23:19:22] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2024-05-21 23:19:22] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 5 ms returned sat
[2024-05-21 23:19:23] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 23:19:23] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-21 23:19:23] [INFO ] After 5ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 23:19:23] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-21 23:19:23] [INFO ] After 118ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 97/97 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 143 transition count 96
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 143 transition count 95
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 142 transition count 95
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 142 transition count 95
Applied a total of 4 rules in 6 ms. Remains 142 /143 variables (removed 1) and now considering 95/97 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 142/143 places, 95/97 transitions.
Incomplete random walk after 10000 steps, including 475 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 92 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1961829 steps, run timeout after 3001 ms. (steps per millisecond=653 ) properties seen :{}
Probabilistic random walk after 1961829 steps, saw 266481 distinct states, run finished after 3001 ms. (steps per millisecond=653 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 95 rows 142 cols
[2024-05-21 23:19:26] [INFO ] Computed 60 invariants in 2 ms
[2024-05-21 23:19:26] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-21 23:19:26] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 6 ms returned sat
[2024-05-21 23:19:26] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 23:19:26] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-21 23:19:26] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 5 ms returned sat
[2024-05-21 23:19:26] [INFO ] After 98ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 23:19:26] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-21 23:19:26] [INFO ] After 23ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 23:19:26] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:19:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2024-05-21 23:19:26] [INFO ] After 87ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-05-21 23:19:26] [INFO ] After 239ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 142 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 142/142 places, 95/95 transitions.
Applied a total of 0 rules in 2 ms. Remains 142 /142 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 142/142 places, 95/95 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 142/142 places, 95/95 transitions.
Applied a total of 0 rules in 3 ms. Remains 142 /142 variables (removed 0) and now considering 95/95 (removed 0) transitions.
[2024-05-21 23:19:26] [INFO ] Invariant cache hit.
[2024-05-21 23:19:26] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-21 23:19:26] [INFO ] Invariant cache hit.
[2024-05-21 23:19:26] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-21 23:19:26] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
[2024-05-21 23:19:26] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 23:19:26] [INFO ] Invariant cache hit.
[2024-05-21 23:19:26] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 383 ms. Remains : 142/142 places, 95/95 transitions.
Graph (complete) has 436 edges and 142 vertex of which 141 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 141 transition count 95
Applied a total of 2 rules in 4 ms. Remains 141 /142 variables (removed 1) and now considering 95/95 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 95 rows 141 cols
[2024-05-21 23:19:26] [INFO ] Computed 59 invariants in 0 ms
[2024-05-21 23:19:26] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-21 23:19:26] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 5 ms returned sat
[2024-05-21 23:19:26] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 23:19:26] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-21 23:19:26] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 20 ms returned sat
[2024-05-21 23:19:27] [INFO ] After 80ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 23:19:27] [INFO ] After 90ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-21 23:19:27] [INFO ] After 181ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (F p0), (F (AND (NOT p2) p0 p1)), (F p2), (F (AND p2 p0 (NOT p1))), (F (AND (NOT p2) p0 (NOT p1)))]
Knowledge based reduction with 11 factoid took 640 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter insensitive) to 5 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 162 ms :[p2, (AND p2 p0 (NOT p1)), p0, (AND p0 p2 p1), (AND p2 p0 p1)]
Stuttering acceptance computed with spot in 210 ms :[p2, (AND p2 p0 (NOT p1)), p0, (AND p0 p2 p1), (AND p2 p0 p1)]
Support contains 4 out of 143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 97/97 transitions.
Applied a total of 0 rules in 6 ms. Remains 143 /143 variables (removed 0) and now considering 97/97 (removed 0) transitions.
// Phase 1: matrix 97 rows 143 cols
[2024-05-21 23:19:28] [INFO ] Computed 59 invariants in 1 ms
[2024-05-21 23:19:28] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-21 23:19:28] [INFO ] Invariant cache hit.
[2024-05-21 23:19:28] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-21 23:19:28] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
[2024-05-21 23:19:28] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 23:19:28] [INFO ] Invariant cache hit.
[2024-05-21 23:19:28] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 385 ms. Remains : 143/143 places, 97/97 transitions.
Computed a total of 38 stabilizing places and 39 stable transitions
Computed a total of 38 stabilizing places and 39 stable transitions
Detected a total of 38/143 stabilizing places and 39/97 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND p2 p0 p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND (NOT p2) p0 p1))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 11 factoid took 313 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter insensitive) to 5 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 185 ms :[p2, (AND p2 p0 (NOT p1)), p0, (AND p0 p2 p1), (AND p2 p0 p1)]
Incomplete random walk after 10000 steps, including 496 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10000 steps, including 104 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 23:19:29] [INFO ] Invariant cache hit.
[2024-05-21 23:19:29] [INFO ] [Real]Absence check using 34 positive place invariants in 4 ms returned sat
[2024-05-21 23:19:29] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 5 ms returned sat
[2024-05-21 23:19:29] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 23:19:29] [INFO ] [Nat]Absence check using 34 positive place invariants in 3 ms returned sat
[2024-05-21 23:19:29] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 5 ms returned sat
[2024-05-21 23:19:29] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 23:19:29] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-21 23:19:29] [INFO ] After 6ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 23:19:29] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-21 23:19:29] [INFO ] After 125ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 97/97 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 143 transition count 96
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 143 transition count 95
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 142 transition count 95
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 142 transition count 95
Applied a total of 4 rules in 8 ms. Remains 142 /143 variables (removed 1) and now considering 95/97 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 142/143 places, 95/97 transitions.
Incomplete random walk after 10000 steps, including 465 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1945850 steps, run timeout after 3001 ms. (steps per millisecond=648 ) properties seen :{}
Probabilistic random walk after 1945850 steps, saw 264363 distinct states, run finished after 3001 ms. (steps per millisecond=648 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 95 rows 142 cols
[2024-05-21 23:19:32] [INFO ] Computed 60 invariants in 2 ms
[2024-05-21 23:19:32] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-21 23:19:32] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 5 ms returned sat
[2024-05-21 23:19:32] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 23:19:32] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-21 23:19:32] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 6 ms returned sat
[2024-05-21 23:19:32] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 23:19:32] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-21 23:19:32] [INFO ] After 6ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 23:19:32] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:19:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2024-05-21 23:19:32] [INFO ] After 78ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2024-05-21 23:19:32] [INFO ] After 242ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 142 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 142/142 places, 95/95 transitions.
Applied a total of 0 rules in 1 ms. Remains 142 /142 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 142/142 places, 95/95 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 142/142 places, 95/95 transitions.
Applied a total of 0 rules in 2 ms. Remains 142 /142 variables (removed 0) and now considering 95/95 (removed 0) transitions.
[2024-05-21 23:19:32] [INFO ] Invariant cache hit.
[2024-05-21 23:19:32] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-05-21 23:19:32] [INFO ] Invariant cache hit.
[2024-05-21 23:19:32] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-21 23:19:33] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
[2024-05-21 23:19:33] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 23:19:33] [INFO ] Invariant cache hit.
[2024-05-21 23:19:33] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 566 ms. Remains : 142/142 places, 95/95 transitions.
Graph (complete) has 436 edges and 142 vertex of which 141 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 141 transition count 95
Applied a total of 2 rules in 5 ms. Remains 141 /142 variables (removed 1) and now considering 95/95 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 95 rows 141 cols
[2024-05-21 23:19:33] [INFO ] Computed 59 invariants in 1 ms
[2024-05-21 23:19:33] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-21 23:19:33] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 5 ms returned sat
[2024-05-21 23:19:33] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 23:19:33] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 23:19:33] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 19 ms returned sat
[2024-05-21 23:19:33] [INFO ] After 75ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 23:19:33] [INFO ] After 86ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-05-21 23:19:33] [INFO ] After 162ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND p2 p0 p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND (NOT p2) p0 p1))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (F p0), (F (AND (NOT p2) p0 p1)), (F p2), (F (AND p2 p0 (NOT p1))), (F (AND (NOT p2) p0 (NOT p1)))]
Knowledge based reduction with 11 factoid took 528 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter insensitive) to 5 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 264 ms :[p2, (AND p2 p0 (NOT p1)), p0, (AND p0 p2 p1), (AND p2 p0 p1)]
Stuttering acceptance computed with spot in 180 ms :[p2, (AND p2 p0 (NOT p1)), p0, (AND p0 p2 p1), (AND p2 p0 p1)]
Stuttering acceptance computed with spot in 166 ms :[p2, (AND p2 p0 (NOT p1)), p0, (AND p0 p2 p1), (AND p2 p0 p1)]
Product exploration explored 100000 steps with 28161 reset in 197 ms.
Product exploration explored 100000 steps with 28377 reset in 219 ms.
Built C files in :
/tmp/ltsmin16843273582369693662
[2024-05-21 23:19:35] [INFO ] Computing symmetric may disable matrix : 97 transitions.
[2024-05-21 23:19:35] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:19:35] [INFO ] Computing symmetric may enable matrix : 97 transitions.
[2024-05-21 23:19:35] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:19:35] [INFO ] Computing Do-Not-Accords matrix : 97 transitions.
[2024-05-21 23:19:35] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:19:35] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16843273582369693662
Running compilation step : cd /tmp/ltsmin16843273582369693662;'/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 247 ms.
Running link step : cd /tmp/ltsmin16843273582369693662;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin16843273582369693662;'/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/stateBased3685638533257323639.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 97/97 transitions.
Applied a total of 0 rules in 5 ms. Remains 143 /143 variables (removed 0) and now considering 97/97 (removed 0) transitions.
// Phase 1: matrix 97 rows 143 cols
[2024-05-21 23:19:50] [INFO ] Computed 59 invariants in 2 ms
[2024-05-21 23:19:50] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-21 23:19:50] [INFO ] Invariant cache hit.
[2024-05-21 23:19:50] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-21 23:19:50] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
[2024-05-21 23:19:50] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 23:19:50] [INFO ] Invariant cache hit.
[2024-05-21 23:19:50] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 348 ms. Remains : 143/143 places, 97/97 transitions.
Built C files in :
/tmp/ltsmin13147616552748390872
[2024-05-21 23:19:50] [INFO ] Computing symmetric may disable matrix : 97 transitions.
[2024-05-21 23:19:50] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:19:50] [INFO ] Computing symmetric may enable matrix : 97 transitions.
[2024-05-21 23:19:50] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:19:50] [INFO ] Computing Do-Not-Accords matrix : 97 transitions.
[2024-05-21 23:19:50] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:19:50] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13147616552748390872
Running compilation step : cd /tmp/ltsmin13147616552748390872;'/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 254 ms.
Running link step : cd /tmp/ltsmin13147616552748390872;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin13147616552748390872;'/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/stateBased12585419898201338512.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 23:20:05] [INFO ] Flatten gal took : 14 ms
[2024-05-21 23:20:05] [INFO ] Flatten gal took : 16 ms
[2024-05-21 23:20:05] [INFO ] Time to serialize gal into /tmp/LTL14326318713226962706.gal : 3 ms
[2024-05-21 23:20:05] [INFO ] Time to serialize properties into /tmp/LTL5449249969034398482.prop : 1 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/LTL14326318713226962706.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9000343915373059190.hoa' '-atoms' '/tmp/LTL5449249969034398482.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...318
Loading property file /tmp/LTL5449249969034398482.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9000343915373059190.hoa
Detected timeout of ITS tools.
[2024-05-21 23:20:20] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:20:20] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:20:20] [INFO ] Time to serialize gal into /tmp/LTL6541048623498624276.gal : 1 ms
[2024-05-21 23:20:20] [INFO ] Time to serialize properties into /tmp/LTL3333720535337615709.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/LTL6541048623498624276.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3333720535337615709.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...275
Read 1 LTL properties
Checking formula 0 : !(((X(F(!("((p141==1)&&(p143==1))"))))U((X("(p108==1)"))U(("(p66==1)")U(G("(p66!=1)"))))))
Formula 0 simplified : XG"((p141==1)&&(p143==1))" R (X!"(p108==1)" R (!"(p66==1)" R F!"(p66!=1)"))
Detected timeout of ITS tools.
[2024-05-21 23:20:35] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:20:35] [INFO ] Applying decomposition
[2024-05-21 23:20:35] [INFO ] Flatten gal took : 4 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/graph14455250949430917075.txt' '-o' '/tmp/graph14455250949430917075.bin' '-w' '/tmp/graph14455250949430917075.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14455250949430917075.bin' '-l' '-1' '-v' '-w' '/tmp/graph14455250949430917075.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:20:35] [INFO ] Decomposing Gal with order
[2024-05-21 23:20:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:20:35] [INFO ] Removed a total of 41 redundant transitions.
[2024-05-21 23:20:35] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:20:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 1 ms.
[2024-05-21 23:20:35] [INFO ] Time to serialize gal into /tmp/LTL9417153052326604797.gal : 1 ms
[2024-05-21 23:20:35] [INFO ] Time to serialize properties into /tmp/LTL9893373013245850214.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/LTL9417153052326604797.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9893373013245850214.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...254
Read 1 LTL properties
Checking formula 0 : !(((X(F(!("((i2.u6.p141==1)&&(i2.u6.p143==1))"))))U((X("(i2.u5.p108==1)"))U(("(u1.p66==1)")U(G("(u1.p66!=1)"))))))
Formula 0 simplified : XG"((i2.u6.p141==1)&&(i2.u6.p143==1))" R (X!"(i2.u5.p108==1)" R (!"(u1.p66==1)" R F!"(u1.p66!=1)"))
Reverse transition relation is NOT exact ! Due to transitions t117, t198_t79, t7_t48_t39, t166_t34, t165_t25, t108_t109_t204_t131_t129_t130_t118_t119, u1.t...474
Computing Next relation with stutter on 1.20585e+06 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12001011957472890290
[2024-05-21 23:20:50] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12001011957472890290
Running compilation step : cd /tmp/ltsmin12001011957472890290;'/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 219 ms.
Running link step : cd /tmp/ltsmin12001011957472890290;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin12001011957472890290;'/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' '(X(<>(!(LTLAPp0==true))) U (X((LTLAPp1==true)) U ((LTLAPp2==true) U [](!(LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-05b-LTLFireability-03 finished in 105087 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((G(p0)||(!p1 U (p2||G(!p1)))))))'
[2024-05-21 23:21:06] [INFO ] Flatten gal took : 8 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17948173018822041448
[2024-05-21 23:21:06] [INFO ] Computing symmetric may disable matrix : 205 transitions.
[2024-05-21 23:21:06] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:21:06] [INFO ] Applying decomposition
[2024-05-21 23:21:06] [INFO ] Computing symmetric may enable matrix : 205 transitions.
[2024-05-21 23:21:06] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:21:06] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:21:06] [INFO ] Computing Do-Not-Accords matrix : 205 transitions.
[2024-05-21 23:21:06] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:21:06] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17948173018822041448
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/graph483759716887804255.txt' '-o' '/tmp/graph483759716887804255.bin' '-w' '/tmp/graph483759716887804255.weights'
Running compilation step : cd /tmp/ltsmin17948173018822041448;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' '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'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph483759716887804255.bin' '-l' '-1' '-v' '-w' '/tmp/graph483759716887804255.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:21:06] [INFO ] Decomposing Gal with order
[2024-05-21 23:21:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:21:06] [INFO ] Removed a total of 18 redundant transitions.
[2024-05-21 23:21:06] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:21:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 3 ms.
[2024-05-21 23:21:06] [INFO ] Time to serialize gal into /tmp/LTLFireability13461798964312323667.gal : 3 ms
[2024-05-21 23:21:06] [INFO ] Time to serialize properties into /tmp/LTLFireability4615260626943367047.ltl : 1 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/LTLFireability13461798964312323667.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4615260626943367047.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...277
Read 2 LTL properties
Checking formula 0 : !(((X(F(!("((i3.u33.p141==1)&&(i2.u34.p143==1))"))))U((X("(i4.i0.u27.p108==1)"))U(("(i2.u9.p66==1)")U(G("(i2.u9.p66!=1)"))))))
Formula 0 simplified : XG"((i3.u33.p141==1)&&(i2.u34.p143==1))" R (X!"(i4.i0.u27.p108==1)" R (!"(i2.u9.p66==1)" R F!"(i2.u9.p66!=1)"))
Compilation finished in 399 ms.
Running link step : cd /tmp/ltsmin17948173018822041448;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin17948173018822041448;'/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' '(X(<>(!(LTLAPp0==true))) U (X((LTLAPp1==true)) U ((LTLAPp2==true) U [](!(LTLAPp2==true)))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t0, t52, t56, t127, t165, t166, t198, i0.i1.u35.t79, i1.u8.t129, i1.u8.t130, i1.u14.t115, i1....801
Computing Next relation with stutter on 2.58393e+06 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: LTL layer: formula: (X(<>(!(LTLAPp0==true))) U (X((LTLAPp1==true)) U ((LTLAPp2==true) U [](!(LTLAPp2==true)))))
pins2lts-mc-linux64( 7/ 8), 0.003: "(X(<>(!(LTLAPp0==true))) U (X((LTLAPp1==true)) U ((LTLAPp2==true) U [](!(LTLAPp2==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.010: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.050: There are 212 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.050: State length is 262, there are 221 groups
pins2lts-mc-linux64( 0/ 8), 0.050: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.050: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.050: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.050: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.082: [Blue] ~96 levels ~960 states ~4584 transitions
pins2lts-mc-linux64( 0/ 8), 0.101: [Blue] ~96 levels ~1920 states ~7560 transitions
pins2lts-mc-linux64( 0/ 8), 0.135: [Blue] ~96 levels ~3840 states ~14664 transitions
pins2lts-mc-linux64( 7/ 8), 0.176: [Blue] ~175 levels ~7680 states ~26848 transitions
pins2lts-mc-linux64( 2/ 8), 0.259: [Blue] ~142 levels ~15360 states ~52824 transitions
pins2lts-mc-linux64( 2/ 8), 0.428: [Blue] ~142 levels ~30720 states ~112040 transitions
pins2lts-mc-linux64( 2/ 8), 0.740: [Blue] ~142 levels ~61440 states ~247680 transitions
pins2lts-mc-linux64( 4/ 8), 1.296: [Blue] ~116 levels ~122880 states ~428232 transitions
pins2lts-mc-linux64( 2/ 8), 2.324: [Blue] ~182 levels ~245760 states ~1074712 transitions
pins2lts-mc-linux64( 4/ 8), 3.975: [Blue] ~129 levels ~491520 states ~2210544 transitions
pins2lts-mc-linux64( 7/ 8), 6.897: [Blue] ~241 levels ~983040 states ~5193456 transitions
pins2lts-mc-linux64( 4/ 8), 11.680: [Blue] ~221 levels ~1966080 states ~10526264 transitions
pins2lts-mc-linux64( 3/ 8), 21.304: [Blue] ~161 levels ~3932160 states ~21213552 transitions
pins2lts-mc-linux64( 3/ 8), 40.990: [Blue] ~161 levels ~7864320 states ~45830224 transitions
pins2lts-mc-linux64( 3/ 8), 82.248: [Blue] ~161 levels ~15728640 states ~99923272 transitions
pins2lts-mc-linux64( 6/ 8), 166.551: [Blue] ~132 levels ~31457280 states ~214160976 transitions
pins2lts-mc-linux64( 3/ 8), 332.627: [Blue] ~161 levels ~62914560 states ~430125752 transitions
pins2lts-mc-linux64( 3/ 8), 673.094: [Blue] ~162 levels ~125829120 states ~909253920 transitions
pins2lts-mc-linux64( 4/ 8), 799.230: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 799.256:
pins2lts-mc-linux64( 0/ 8), 799.256: Explored 134217343 states 1053811328 transitions, fanout: 7.852
pins2lts-mc-linux64( 0/ 8), 799.256: Total exploration time 799.180 sec (799.140 sec minimum, 799.164 sec on average)
pins2lts-mc-linux64( 0/ 8), 799.256: States per second: 167944, Transitions per second: 1318616
pins2lts-mc-linux64( 0/ 8), 799.256:
pins2lts-mc-linux64( 0/ 8), 799.256: State space has 134216946 states, 3596854 are accepting
pins2lts-mc-linux64( 0/ 8), 799.256: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 799.256: blue states: 134217343 (100.00%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 799.257: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 799.257: all-red states: 16135569 (12.02%), bogus 286 (0.00%)
pins2lts-mc-linux64( 0/ 8), 799.257:
pins2lts-mc-linux64( 0/ 8), 799.257: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 799.257:
pins2lts-mc-linux64( 0/ 8), 799.257: Queue width: 8B, total height: 1568, memory: 0.01MB
pins2lts-mc-linux64( 0/ 8), 799.257: Tree memory: 1086.3MB, 8.5 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 799.257: Tree fill ratio (roots/leafs): 99.0%/24.0%
pins2lts-mc-linux64( 0/ 8), 799.257: Stored 205 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 799.257: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 799.257: Est. total memory use: 1086.3MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17948173018822041448;'/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' '(X(<>(!(LTLAPp0==true))) U (X((LTLAPp1==true)) U ((LTLAPp2==true) U [](!(LTLAPp2==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17948173018822041448;'/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' '(X(<>(!(LTLAPp0==true))) U (X((LTLAPp1==true)) U ((LTLAPp2==true) U [](!(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:43:40] [INFO ] Applying decomposition
[2024-05-21 23:43:40] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:43:40] [INFO ] Decomposing Gal with order
[2024-05-21 23:43:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:43:40] [INFO ] Removed a total of 27 redundant transitions.
[2024-05-21 23:43:40] [INFO ] Flatten gal took : 40 ms
[2024-05-21 23:43:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 102 labels/synchronizations in 8 ms.
[2024-05-21 23:43:40] [INFO ] Time to serialize gal into /tmp/LTLFireability4993758428121212550.gal : 19 ms
[2024-05-21 23:43:40] [INFO ] Time to serialize properties into /tmp/LTLFireability9481539633664438398.ltl : 35 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/LTLFireability4993758428121212550.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9481539633664438398.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...276
Read 2 LTL properties
Checking formula 0 : !(((X(F(!("((i1.i0.i1.i0.i1.i1.u33.p141==1)&&(i1.i0.i1.i0.i1.i1.u34.p143==1))"))))U((X("(i1.i0.i1.i0.i1.i0.i1.u133.p108==1)"))U(("(i1....225
Formula 0 simplified : XG"((i1.i0.i1.i0.i1.i1.u33.p141==1)&&(i1.i0.i1.i0.i1.i1.u34.p143==1))" R (X!"(i1.i0.i1.i0.i1.i0.i1.u133.p108==1)" R (!"(i1.i0.i0.i0....212
Detected timeout of ITS tools.
[2024-05-22 00:06:16] [INFO ] Flatten gal took : 156 ms
[2024-05-22 00:06:17] [INFO ] Input system was already deterministic with 205 transitions.
[2024-05-22 00:06:24] [INFO ] Transformed 261 places.
[2024-05-22 00:06:24] [INFO ] Transformed 205 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:06:24] [INFO ] Time to serialize gal into /tmp/LTLFireability13404824002585271052.gal : 5 ms
[2024-05-22 00:06:24] [INFO ] Time to serialize properties into /tmp/LTLFireability3771669093793908819.ltl : 4 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/LTLFireability13404824002585271052.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3771669093793908819.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 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((X(F(!("((p141==1)&&(p143==1))"))))U((X("(p108==1)"))U(("(p66==1)")U(G("(p66!=1)"))))))
Formula 0 simplified : XG"((p141==1)&&(p143==1))" R (X!"(p108==1)" R (!"(p66==1)" R F!"(p66!=1)"))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 8594744 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16118916 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ 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-05b"
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-05b, 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-171624208500413"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-05b.tgz
mv DES-PT-05b 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 ;