Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 7.6K Feb 26 15:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 26 15:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 15:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 15:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 15:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Feb 26 15:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 15:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 15:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 91K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678268323869

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-20b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-08 09:38:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-08 09:38:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 09:38:45] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2023-03-08 09:38:45] [INFO ] Transformed 360 places.
[2023-03-08 09:38:45] [INFO ] Transformed 311 transitions.
[2023-03-08 09:38:45] [INFO ] Found NUPN structural information;
[2023-03-08 09:38:45] [INFO ] Parsed PT model containing 360 places and 311 transitions and 987 arcs in 129 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA DES-PT-20b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20b-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20b-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20b-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 out of 360 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 360/360 places, 311/311 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 357 transition count 311
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 23 place count 337 transition count 291
Iterating global reduction 1 with 20 rules applied. Total rules applied 43 place count 337 transition count 291
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 55 place count 325 transition count 279
Iterating global reduction 1 with 12 rules applied. Total rules applied 67 place count 325 transition count 279
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 76 place count 325 transition count 270
Applied a total of 76 rules in 69 ms. Remains 325 /360 variables (removed 35) and now considering 270/311 (removed 41) transitions.
// Phase 1: matrix 270 rows 325 cols
[2023-03-08 09:38:45] [INFO ] Computed 62 place invariants in 29 ms
[2023-03-08 09:38:46] [INFO ] Implicit Places using invariants in 462 ms returned []
[2023-03-08 09:38:46] [INFO ] Invariant cache hit.
[2023-03-08 09:38:46] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 810 ms to find 0 implicit places.
[2023-03-08 09:38:46] [INFO ] Invariant cache hit.
[2023-03-08 09:38:46] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 325/360 places, 270/311 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1030 ms. Remains : 325/360 places, 270/311 transitions.
Support contains 49 out of 325 places after structural reductions.
[2023-03-08 09:38:46] [INFO ] Flatten gal took : 46 ms
[2023-03-08 09:38:46] [INFO ] Flatten gal took : 25 ms
[2023-03-08 09:38:46] [INFO ] Input system was already deterministic with 270 transitions.
Support contains 46 out of 325 places (down from 49) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 87 resets, run finished after 408 ms. (steps per millisecond=24 ) properties (out of 28) seen :22
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-08 09:38:47] [INFO ] Invariant cache hit.
[2023-03-08 09:38:47] [INFO ] [Real]Absence check using 32 positive place invariants in 11 ms returned sat
[2023-03-08 09:38:47] [INFO ] [Real]Absence check using 32 positive and 30 generalized place invariants in 16 ms returned sat
[2023-03-08 09:38:48] [INFO ] After 502ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-08 09:38:48] [INFO ] [Nat]Absence check using 32 positive place invariants in 8 ms returned sat
[2023-03-08 09:38:48] [INFO ] [Nat]Absence check using 32 positive and 30 generalized place invariants in 17 ms returned sat
[2023-03-08 09:38:48] [INFO ] After 251ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-08 09:38:48] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 5 ms to minimize.
[2023-03-08 09:38:48] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 1 ms to minimize.
[2023-03-08 09:38:48] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2023-03-08 09:38:48] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2023-03-08 09:38:48] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2023-03-08 09:38:48] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
[2023-03-08 09:38:48] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2023-03-08 09:38:49] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2023-03-08 09:38:49] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 600 ms
[2023-03-08 09:38:49] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2023-03-08 09:38:49] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 0 ms to minimize.
[2023-03-08 09:38:49] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 0 ms to minimize.
[2023-03-08 09:38:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 195 ms
[2023-03-08 09:38:49] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 1 ms to minimize.
[2023-03-08 09:38:49] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
[2023-03-08 09:38:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 197 ms
[2023-03-08 09:38:49] [INFO ] After 1393ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 159 ms.
[2023-03-08 09:38:49] [INFO ] After 1716ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 1 properties in 289 ms.
Support contains 9 out of 325 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 325/325 places, 270/270 transitions.
Graph (complete) has 672 edges and 325 vertex of which 323 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 323 transition count 248
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 39 place count 305 transition count 248
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 39 place count 305 transition count 237
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 61 place count 294 transition count 237
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 67 place count 288 transition count 231
Iterating global reduction 2 with 6 rules applied. Total rules applied 73 place count 288 transition count 231
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 76 place count 288 transition count 228
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 78 place count 287 transition count 227
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 80 place count 285 transition count 225
Iterating global reduction 4 with 2 rules applied. Total rules applied 82 place count 285 transition count 225
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 84 place count 285 transition count 223
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 84 place count 285 transition count 222
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 86 place count 284 transition count 222
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 5 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 5 with 152 rules applied. Total rules applied 238 place count 208 transition count 146
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 242 place count 206 transition count 148
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 243 place count 206 transition count 147
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 244 place count 205 transition count 147
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 245 place count 204 transition count 146
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 246 place count 203 transition count 146
Applied a total of 246 rules in 110 ms. Remains 203 /325 variables (removed 122) and now considering 146/270 (removed 124) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 203/325 places, 146/270 transitions.
Incomplete random walk after 10000 steps, including 463 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 78 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 92 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 879006 steps, run timeout after 3001 ms. (steps per millisecond=292 ) properties seen :{}
Probabilistic random walk after 879006 steps, saw 123433 distinct states, run finished after 3002 ms. (steps per millisecond=292 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 146 rows 203 cols
[2023-03-08 09:38:53] [INFO ] Computed 63 place invariants in 6 ms
[2023-03-08 09:38:53] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 09:38:53] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 10 ms returned sat
[2023-03-08 09:38:53] [INFO ] After 219ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-08 09:38:53] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 09:38:53] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 11 ms returned sat
[2023-03-08 09:38:53] [INFO ] After 144ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-08 09:38:53] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2023-03-08 09:38:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2023-03-08 09:38:54] [INFO ] After 281ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 58 ms.
[2023-03-08 09:38:54] [INFO ] After 445ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 94 ms.
Support contains 9 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 146/146 transitions.
Applied a total of 0 rules in 6 ms. Remains 203 /203 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 203/203 places, 146/146 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 146/146 transitions.
Applied a total of 0 rules in 6 ms. Remains 203 /203 variables (removed 0) and now considering 146/146 (removed 0) transitions.
[2023-03-08 09:38:54] [INFO ] Invariant cache hit.
[2023-03-08 09:38:54] [INFO ] Implicit Places using invariants in 121 ms returned []
[2023-03-08 09:38:54] [INFO ] Invariant cache hit.
[2023-03-08 09:38:54] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
[2023-03-08 09:38:54] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-08 09:38:54] [INFO ] Invariant cache hit.
[2023-03-08 09:38:54] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 447 ms. Remains : 203/203 places, 146/146 transitions.
Applied a total of 0 rules in 6 ms. Remains 203 /203 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Running SMT prover for 5 properties.
[2023-03-08 09:38:54] [INFO ] Invariant cache hit.
[2023-03-08 09:38:54] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 09:38:54] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 11 ms returned sat
[2023-03-08 09:38:54] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-08 09:38:54] [INFO ] [Nat]Absence check using 35 positive place invariants in 7 ms returned sat
[2023-03-08 09:38:54] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 10 ms returned sat
[2023-03-08 09:38:54] [INFO ] After 119ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-08 09:38:55] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 0 ms to minimize.
[2023-03-08 09:38:55] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 2 ms to minimize.
[2023-03-08 09:38:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 107 ms
[2023-03-08 09:38:55] [INFO ] After 317ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 67 ms.
[2023-03-08 09:38:55] [INFO ] After 477ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Computed a total of 139 stabilizing places and 131 stable transitions
Graph (complete) has 672 edges and 325 vertex of which 319 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.12 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G((F(p1) U p2)))))'
Support contains 4 out of 325 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 325/325 places, 270/270 transitions.
Graph (complete) has 672 edges and 325 vertex of which 319 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 318 transition count 250
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 302 transition count 250
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 33 place count 302 transition count 238
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 57 place count 290 transition count 238
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 63 place count 284 transition count 232
Iterating global reduction 2 with 6 rules applied. Total rules applied 69 place count 284 transition count 232
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 71 place count 284 transition count 230
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 73 place count 282 transition count 228
Iterating global reduction 3 with 2 rules applied. Total rules applied 75 place count 282 transition count 228
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 77 place count 282 transition count 226
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 77 place count 282 transition count 225
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 79 place count 281 transition count 225
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 1 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 225 place count 208 transition count 152
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 227 place count 207 transition count 152
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 229 place count 207 transition count 152
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 231 place count 205 transition count 150
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 232 place count 204 transition count 150
Applied a total of 232 rules in 62 ms. Remains 204 /325 variables (removed 121) and now considering 150/270 (removed 120) transitions.
// Phase 1: matrix 150 rows 204 cols
[2023-03-08 09:38:55] [INFO ] Computed 58 place invariants in 7 ms
[2023-03-08 09:38:55] [INFO ] Implicit Places using invariants in 122 ms returned []
[2023-03-08 09:38:55] [INFO ] Invariant cache hit.
[2023-03-08 09:38:55] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
[2023-03-08 09:38:55] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-08 09:38:55] [INFO ] Invariant cache hit.
[2023-03-08 09:38:56] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 204/325 places, 150/270 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 485 ms. Remains : 204/325 places, 150/270 transitions.
Stuttering acceptance computed with spot in 235 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DES-PT-20b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s115 1), p2:(AND (EQ s182 1) (EQ s200 1)), p1:(EQ s87 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 25247 reset in 364 ms.
Product exploration explored 100000 steps with 25344 reset in 229 ms.
Computed a total of 98 stabilizing places and 93 stable transitions
Computed a total of 98 stabilizing places and 93 stable transitions
Detected a total of 98/204 stabilizing places and 93/150 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT p0)), (X p0), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 4 factoid took 475 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 126 steps, including 6 resets, run visited all 4 properties in 1 ms. (steps per millisecond=126 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT p0)), (X p0), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (AND (NOT p1) (NOT p0) p2)), (F p0), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2))))]
Knowledge based reduction with 4 factoid took 635 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
[2023-03-08 09:38:58] [INFO ] Invariant cache hit.
[2023-03-08 09:38:58] [INFO ] [Real]Absence check using 33 positive place invariants in 7 ms returned sat
[2023-03-08 09:38:58] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 18 ms returned sat
[2023-03-08 09:38:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 09:38:58] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2023-03-08 09:38:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 09:38:58] [INFO ] [Nat]Absence check using 33 positive place invariants in 8 ms returned sat
[2023-03-08 09:38:58] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 09:38:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 09:38:59] [INFO ] [Nat]Absence check using state equation in 266 ms returned sat
[2023-03-08 09:38:59] [INFO ] Computed and/alt/rep : 138/346/138 causal constraints (skipped 9 transitions) in 10 ms.
[2023-03-08 09:38:59] [INFO ] Added : 103 causal constraints over 21 iterations in 358 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 4 out of 204 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 204/204 places, 150/150 transitions.
Applied a total of 0 rules in 7 ms. Remains 204 /204 variables (removed 0) and now considering 150/150 (removed 0) transitions.
[2023-03-08 09:38:59] [INFO ] Invariant cache hit.
[2023-03-08 09:38:59] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-08 09:38:59] [INFO ] Invariant cache hit.
[2023-03-08 09:38:59] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2023-03-08 09:38:59] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 09:38:59] [INFO ] Invariant cache hit.
[2023-03-08 09:38:59] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 462 ms. Remains : 204/204 places, 150/150 transitions.
Computed a total of 98 stabilizing places and 93 stable transitions
Computed a total of 98 stabilizing places and 93 stable transitions
Detected a total of 98/204 stabilizing places and 93/150 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT p0)), (X p0), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 4 factoid took 415 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 33 steps, including 1 resets, run visited all 4 properties in 2 ms. (steps per millisecond=16 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT p0)), (X p0), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (AND (NOT p1) (NOT p0) p2)), (F p0), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2))))]
Knowledge based reduction with 4 factoid took 480 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
[2023-03-08 09:39:01] [INFO ] Invariant cache hit.
[2023-03-08 09:39:01] [INFO ] [Real]Absence check using 33 positive place invariants in 9 ms returned sat
[2023-03-08 09:39:01] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 19 ms returned sat
[2023-03-08 09:39:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 09:39:01] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2023-03-08 09:39:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 09:39:01] [INFO ] [Nat]Absence check using 33 positive place invariants in 9 ms returned sat
[2023-03-08 09:39:01] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 09:39:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 09:39:01] [INFO ] [Nat]Absence check using state equation in 290 ms returned sat
[2023-03-08 09:39:01] [INFO ] Computed and/alt/rep : 138/346/138 causal constraints (skipped 9 transitions) in 10 ms.
[2023-03-08 09:39:02] [INFO ] Added : 103 causal constraints over 21 iterations in 376 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 25209 reset in 192 ms.
Product exploration explored 100000 steps with 25290 reset in 204 ms.
Built C files in :
/tmp/ltsmin16346736907066754726
[2023-03-08 09:39:02] [INFO ] Computing symmetric may disable matrix : 150 transitions.
[2023-03-08 09:39:02] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 09:39:02] [INFO ] Computing symmetric may enable matrix : 150 transitions.
[2023-03-08 09:39:02] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 09:39:02] [INFO ] Computing Do-Not-Accords matrix : 150 transitions.
[2023-03-08 09:39:02] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 09:39:02] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16346736907066754726
Running compilation step : cd /tmp/ltsmin16346736907066754726;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 405 ms.
Running link step : cd /tmp/ltsmin16346736907066754726;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin16346736907066754726;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased375399736127472502.hoa' '--buchi-type=spotba'
LTSmin run took 252 ms.
FORMULA DES-PT-20b-LTLFireability-01 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-20b-LTLFireability-01 finished in 8142 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(F((p0&&X(X(p1))))))))'
Support contains 4 out of 325 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 325/325 places, 270/270 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 319 transition count 264
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 319 transition count 264
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 319 transition count 262
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 317 transition count 260
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 317 transition count 260
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 20 place count 317 transition count 258
Applied a total of 20 rules in 18 ms. Remains 317 /325 variables (removed 8) and now considering 258/270 (removed 12) transitions.
// Phase 1: matrix 258 rows 317 cols
[2023-03-08 09:39:03] [INFO ] Computed 62 place invariants in 9 ms
[2023-03-08 09:39:03] [INFO ] Implicit Places using invariants in 127 ms returned []
[2023-03-08 09:39:03] [INFO ] Invariant cache hit.
[2023-03-08 09:39:04] [INFO ] Implicit Places using invariants and state equation in 302 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 434 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 316/325 places, 258/270 transitions.
Applied a total of 0 rules in 10 ms. Remains 316 /316 variables (removed 0) and now considering 258/258 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 463 ms. Remains : 316/325 places, 258/270 transitions.
Stuttering acceptance computed with spot in 226 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-20b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 1}, { cond=(NOT p0), acceptance={0} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}, { cond=p0, acceptance={0} source=3 dest: 4}], [{ cond=p0, acceptance={0} source=4 dest: 0}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(EQ s101 1), p1:(AND (OR (EQ s22 0) (EQ s172 0)) (EQ s95 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 101 steps with 0 reset in 1 ms.
FORMULA DES-PT-20b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20b-LTLFireability-02 finished in 705 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(p1)))))'
Support contains 4 out of 325 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 325/325 places, 270/270 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 317 transition count 262
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 317 transition count 262
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 317 transition count 260
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 314 transition count 257
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 314 transition count 257
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 27 place count 314 transition count 254
Applied a total of 27 rules in 19 ms. Remains 314 /325 variables (removed 11) and now considering 254/270 (removed 16) transitions.
// Phase 1: matrix 254 rows 314 cols
[2023-03-08 09:39:04] [INFO ] Computed 62 place invariants in 7 ms
[2023-03-08 09:39:04] [INFO ] Implicit Places using invariants in 123 ms returned []
[2023-03-08 09:39:04] [INFO ] Invariant cache hit.
[2023-03-08 09:39:04] [INFO ] Implicit Places using invariants and state equation in 336 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 462 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 313/325 places, 254/270 transitions.
Applied a total of 0 rules in 7 ms. Remains 313 /313 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 489 ms. Remains : 313/325 places, 254/270 transitions.
Stuttering acceptance computed with spot in 138 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-20b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(AND (EQ s17 1) (EQ s169 1)), p0:(AND (EQ s208 1) (EQ s239 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DES-PT-20b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20b-LTLFireability-03 finished in 649 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 325 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 325/325 places, 270/270 transitions.
Graph (complete) has 672 edges and 325 vertex of which 319 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 318 transition count 249
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 35 place count 301 transition count 249
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 301 transition count 238
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 290 transition count 238
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 63 place count 284 transition count 232
Iterating global reduction 2 with 6 rules applied. Total rules applied 69 place count 284 transition count 232
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 72 place count 284 transition count 229
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 74 place count 283 transition count 228
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 76 place count 281 transition count 226
Iterating global reduction 4 with 2 rules applied. Total rules applied 78 place count 281 transition count 226
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 80 place count 281 transition count 224
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 80 place count 281 transition count 223
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 82 place count 280 transition count 223
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 5 with 150 rules applied. Total rules applied 232 place count 205 transition count 148
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 203 transition count 150
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 238 place count 201 transition count 148
Applied a total of 238 rules in 50 ms. Remains 201 /325 variables (removed 124) and now considering 148/270 (removed 122) transitions.
// Phase 1: matrix 148 rows 201 cols
[2023-03-08 09:39:05] [INFO ] Computed 59 place invariants in 6 ms
[2023-03-08 09:39:05] [INFO ] Implicit Places using invariants in 112 ms returned [92]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 113 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 200/325 places, 148/270 transitions.
Applied a total of 0 rules in 5 ms. Remains 200 /200 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 168 ms. Remains : 200/325 places, 148/270 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-20b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s92 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 40055 reset in 276 ms.
Product exploration explored 100000 steps with 39997 reset in 284 ms.
Computed a total of 97 stabilizing places and 92 stable transitions
Computed a total of 97 stabilizing places and 92 stable transitions
Detected a total of 97/200 stabilizing places and 92/148 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 161 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 152 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
// Phase 1: matrix 148 rows 200 cols
[2023-03-08 09:39:06] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-08 09:39:06] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 09:39:06] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 12 ms returned sat
[2023-03-08 09:39:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 09:39:06] [INFO ] [Real]Absence check using state equation in 188 ms returned sat
[2023-03-08 09:39:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 09:39:06] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2023-03-08 09:39:06] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 94 ms returned sat
[2023-03-08 09:39:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 09:39:06] [INFO ] [Nat]Absence check using state equation in 231 ms returned sat
[2023-03-08 09:39:06] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 09:39:06] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2023-03-08 09:39:06] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 0 ms to minimize.
[2023-03-08 09:39:07] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2023-03-08 09:39:07] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2023-03-08 09:39:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 197 ms
[2023-03-08 09:39:07] [INFO ] Computed and/alt/rep : 135/429/135 causal constraints (skipped 11 transitions) in 12 ms.
[2023-03-08 09:39:07] [INFO ] Added : 25 causal constraints over 5 iterations in 104 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 148/148 transitions.
Applied a total of 0 rules in 5 ms. Remains 200 /200 variables (removed 0) and now considering 148/148 (removed 0) transitions.
[2023-03-08 09:39:07] [INFO ] Invariant cache hit.
[2023-03-08 09:39:07] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-03-08 09:39:07] [INFO ] Invariant cache hit.
[2023-03-08 09:39:07] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 09:39:07] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2023-03-08 09:39:07] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 09:39:07] [INFO ] Invariant cache hit.
[2023-03-08 09:39:07] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 416 ms. Remains : 200/200 places, 148/148 transitions.
Computed a total of 97 stabilizing places and 92 stable transitions
Computed a total of 97 stabilizing places and 92 stable transitions
Detected a total of 97/200 stabilizing places and 92/148 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 267 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 158 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
[2023-03-08 09:39:08] [INFO ] Invariant cache hit.
[2023-03-08 09:39:08] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 09:39:08] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 13 ms returned sat
[2023-03-08 09:39:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 09:39:08] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2023-03-08 09:39:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 09:39:08] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 09:39:08] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 59 ms returned sat
[2023-03-08 09:39:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 09:39:08] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2023-03-08 09:39:08] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 09:39:08] [INFO ] [Nat]Added 6 Read/Feed constraints in 4 ms returned sat
[2023-03-08 09:39:08] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2023-03-08 09:39:09] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2023-03-08 09:39:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 152 ms
[2023-03-08 09:39:09] [INFO ] Computed and/alt/rep : 135/429/135 causal constraints (skipped 11 transitions) in 9 ms.
[2023-03-08 09:39:09] [INFO ] Added : 25 causal constraints over 5 iterations in 114 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 39982 reset in 279 ms.
Product exploration explored 100000 steps with 40006 reset in 315 ms.
Built C files in :
/tmp/ltsmin2220400921698446297
[2023-03-08 09:39:09] [INFO ] Computing symmetric may disable matrix : 148 transitions.
[2023-03-08 09:39:09] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 09:39:09] [INFO ] Computing symmetric may enable matrix : 148 transitions.
[2023-03-08 09:39:09] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 09:39:09] [INFO ] Computing Do-Not-Accords matrix : 148 transitions.
[2023-03-08 09:39:09] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 09:39:09] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2220400921698446297
Running compilation step : cd /tmp/ltsmin2220400921698446297;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 303 ms.
Running link step : cd /tmp/ltsmin2220400921698446297;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin2220400921698446297;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15000792684979228775.hoa' '--buchi-type=spotba'
LTSmin run took 233 ms.
FORMULA DES-PT-20b-LTLFireability-04 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-20b-LTLFireability-04 finished in 5413 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (G(p2)&&p1))))'
Support contains 4 out of 325 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 325/325 places, 270/270 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 318 transition count 263
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 318 transition count 263
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 318 transition count 262
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 316 transition count 260
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 316 transition count 260
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 21 place count 316 transition count 258
Applied a total of 21 rules in 16 ms. Remains 316 /325 variables (removed 9) and now considering 258/270 (removed 12) transitions.
// Phase 1: matrix 258 rows 316 cols
[2023-03-08 09:39:10] [INFO ] Computed 62 place invariants in 5 ms
[2023-03-08 09:39:10] [INFO ] Implicit Places using invariants in 121 ms returned []
[2023-03-08 09:39:10] [INFO ] Invariant cache hit.
[2023-03-08 09:39:10] [INFO ] Implicit Places using invariants and state equation in 283 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 405 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 315/325 places, 258/270 transitions.
Applied a total of 0 rules in 6 ms. Remains 315 /315 variables (removed 0) and now considering 258/258 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 427 ms. Remains : 315/325 places, 258/270 transitions.
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : DES-PT-20b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p1) p0) (AND (NOT p2) p0)), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={} source=1 dest: 2}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p1 p2 p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND p2 p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s137 1) (EQ s166 1)), p0:(AND (EQ s106 1) (EQ s162 1)), p2:(AND (EQ s137 1) (EQ s166 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-20b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20b-LTLFireability-05 finished in 625 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(G(p1)))))'
Support contains 2 out of 325 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 325/325 places, 270/270 transitions.
Graph (complete) has 672 edges and 325 vertex of which 319 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 318 transition count 250
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 34 place count 302 transition count 249
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 35 place count 301 transition count 249
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 35 place count 301 transition count 238
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 57 place count 290 transition count 238
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 63 place count 284 transition count 232
Iterating global reduction 3 with 6 rules applied. Total rules applied 69 place count 284 transition count 232
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 3 rules applied. Total rules applied 72 place count 284 transition count 229
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 283 transition count 228
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 76 place count 281 transition count 226
Iterating global reduction 5 with 2 rules applied. Total rules applied 78 place count 281 transition count 226
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 80 place count 281 transition count 224
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 80 place count 281 transition count 223
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 82 place count 280 transition count 223
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 6 with 148 rules applied. Total rules applied 230 place count 206 transition count 149
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 234 place count 204 transition count 151
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 236 place count 202 transition count 149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 237 place count 201 transition count 149
Applied a total of 237 rules in 49 ms. Remains 201 /325 variables (removed 124) and now considering 149/270 (removed 121) transitions.
// Phase 1: matrix 149 rows 201 cols
[2023-03-08 09:39:11] [INFO ] Computed 58 place invariants in 1 ms
[2023-03-08 09:39:11] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-08 09:39:11] [INFO ] Invariant cache hit.
[2023-03-08 09:39:11] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
[2023-03-08 09:39:11] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 09:39:11] [INFO ] Invariant cache hit.
[2023-03-08 09:39:11] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 201/325 places, 149/270 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 431 ms. Remains : 201/325 places, 149/270 transitions.
Stuttering acceptance computed with spot in 89 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : DES-PT-20b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s196 0), p1:(EQ s137 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 4636 reset in 284 ms.
Product exploration explored 100000 steps with 4665 reset in 287 ms.
Computed a total of 98 stabilizing places and 93 stable transitions
Computed a total of 98 stabilizing places and 93 stable transitions
Detected a total of 98/201 stabilizing places and 93/149 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 274 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p1)]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND p0 p1), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 288 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 38 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p1)]
Support contains 1 out of 201 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 : 201/201 places, 149/149 transitions.
Applied a total of 0 rules in 11 ms. Remains 201 /201 variables (removed 0) and now considering 149/149 (removed 0) transitions.
[2023-03-08 09:39:13] [INFO ] Invariant cache hit.
[2023-03-08 09:39:13] [INFO ] Implicit Places using invariants in 114 ms returned []
[2023-03-08 09:39:13] [INFO ] Invariant cache hit.
[2023-03-08 09:39:13] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
[2023-03-08 09:39:13] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 09:39:13] [INFO ] Invariant cache hit.
[2023-03-08 09:39:13] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 396 ms. Remains : 201/201 places, 149/149 transitions.
Computed a total of 98 stabilizing places and 93 stable transitions
Computed a total of 98 stabilizing places and 93 stable transitions
Detected a total of 98/201 stabilizing places and 93/149 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p1, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 129 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 p1)]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [p1, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 179 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 p1)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p1)]
Product exploration explored 100000 steps with 4635 reset in 201 ms.
Product exploration explored 100000 steps with 4578 reset in 219 ms.
Built C files in :
/tmp/ltsmin6140942027731330465
[2023-03-08 09:39:14] [INFO ] Computing symmetric may disable matrix : 149 transitions.
[2023-03-08 09:39:14] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 09:39:14] [INFO ] Computing symmetric may enable matrix : 149 transitions.
[2023-03-08 09:39:14] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 09:39:14] [INFO ] Computing Do-Not-Accords matrix : 149 transitions.
[2023-03-08 09:39:14] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 09:39:14] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6140942027731330465
Running compilation step : cd /tmp/ltsmin6140942027731330465;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 330 ms.
Running link step : cd /tmp/ltsmin6140942027731330465;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin6140942027731330465;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13647485376509234782.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 201/201 places, 149/149 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 200 transition count 148
Applied a total of 2 rules in 13 ms. Remains 200 /201 variables (removed 1) and now considering 148/149 (removed 1) transitions.
// Phase 1: matrix 148 rows 200 cols
[2023-03-08 09:39:29] [INFO ] Computed 58 place invariants in 1 ms
[2023-03-08 09:39:29] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-03-08 09:39:29] [INFO ] Invariant cache hit.
[2023-03-08 09:39:29] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
[2023-03-08 09:39:29] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 09:39:29] [INFO ] Invariant cache hit.
[2023-03-08 09:39:29] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 200/201 places, 148/149 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 412 ms. Remains : 200/201 places, 148/149 transitions.
Built C files in :
/tmp/ltsmin2082353782848097775
[2023-03-08 09:39:29] [INFO ] Computing symmetric may disable matrix : 148 transitions.
[2023-03-08 09:39:29] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 09:39:29] [INFO ] Computing symmetric may enable matrix : 148 transitions.
[2023-03-08 09:39:29] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 09:39:29] [INFO ] Computing Do-Not-Accords matrix : 148 transitions.
[2023-03-08 09:39:29] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 09:39:29] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2082353782848097775
Running compilation step : cd /tmp/ltsmin2082353782848097775;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 312 ms.
Running link step : cd /tmp/ltsmin2082353782848097775;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin2082353782848097775;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5418398985985822151.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-08 09:39:45] [INFO ] Flatten gal took : 13 ms
[2023-03-08 09:39:45] [INFO ] Flatten gal took : 12 ms
[2023-03-08 09:39:45] [INFO ] Time to serialize gal into /tmp/LTL11019841307704377901.gal : 3 ms
[2023-03-08 09:39:45] [INFO ] Time to serialize properties into /tmp/LTL7715618256931713713.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11019841307704377901.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10367972451655150628.hoa' '-atoms' '/tmp/LTL7715618256931713713.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL7715618256931713713.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10367972451655150628.hoa
Detected timeout of ITS tools.
[2023-03-08 09:40:00] [INFO ] Flatten gal took : 11 ms
[2023-03-08 09:40:00] [INFO ] Flatten gal took : 11 ms
[2023-03-08 09:40:00] [INFO ] Time to serialize gal into /tmp/LTL4375451732948708341.gal : 2 ms
[2023-03-08 09:40:00] [INFO ] Time to serialize properties into /tmp/LTL856903036770549727.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4375451732948708341.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL856903036770549727.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((F(("(p355==0)")&&(F(G("(p255==0)"))))))
Formula 0 simplified : GF!"(p255==0)" | G!"(p355==0)"
Detected timeout of ITS tools.
[2023-03-08 09:40:15] [INFO ] Flatten gal took : 11 ms
[2023-03-08 09:40:15] [INFO ] Applying decomposition
[2023-03-08 09:40:15] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph2281221698151777335.txt' '-o' '/tmp/graph2281221698151777335.bin' '-w' '/tmp/graph2281221698151777335.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph2281221698151777335.bin' '-l' '-1' '-v' '-w' '/tmp/graph2281221698151777335.weights' '-q' '0' '-e' '0.001'
[2023-03-08 09:40:15] [INFO ] Decomposing Gal with order
[2023-03-08 09:40:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 09:40:15] [INFO ] Removed a total of 59 redundant transitions.
[2023-03-08 09:40:15] [INFO ] Flatten gal took : 39 ms
[2023-03-08 09:40:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 31 labels/synchronizations in 6 ms.
[2023-03-08 09:40:15] [INFO ] Time to serialize gal into /tmp/LTL12503346284492994623.gal : 4 ms
[2023-03-08 09:40:15] [INFO ] Time to serialize properties into /tmp/LTL18059849589800450799.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12503346284492994623.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18059849589800450799.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F(("(u45.p355==0)")&&(F(G("(i6.i0.u29.p255==0)"))))))
Formula 0 simplified : GF!"(i6.i0.u29.p255==0)" | G!"(u45.p355==0)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13517620893907454085
[2023-03-08 09:40:30] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13517620893907454085
Running compilation step : cd /tmp/ltsmin13517620893907454085;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 275 ms.
Running link step : cd /tmp/ltsmin13517620893907454085;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin13517620893907454085;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(((LTLAPp0==true)&&<>([]((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-20b-LTLFireability-07 finished in 94574 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&F(p1))))))'
Support contains 5 out of 325 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 325/325 places, 270/270 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 318 transition count 263
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 318 transition count 263
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 318 transition count 261
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 316 transition count 259
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 316 transition count 259
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 22 place count 316 transition count 257
Applied a total of 22 rules in 20 ms. Remains 316 /325 variables (removed 9) and now considering 257/270 (removed 13) transitions.
// Phase 1: matrix 257 rows 316 cols
[2023-03-08 09:40:45] [INFO ] Computed 62 place invariants in 3 ms
[2023-03-08 09:40:45] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-08 09:40:45] [INFO ] Invariant cache hit.
[2023-03-08 09:40:46] [INFO ] Implicit Places using invariants and state equation in 352 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 503 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 315/325 places, 257/270 transitions.
Applied a total of 0 rules in 6 ms. Remains 315 /315 variables (removed 0) and now considering 257/257 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 531 ms. Remains : 315/325 places, 257/270 transitions.
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : DES-PT-20b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s247 0), p1:(AND (EQ s141 1) (OR (EQ s112 1) (AND (EQ s275 1) (EQ s293 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 86 steps with 0 reset in 1 ms.
FORMULA DES-PT-20b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20b-LTLFireability-08 finished in 742 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!(G(p0)||!p0) U (G(p1)||p2))))'
Support contains 5 out of 325 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 325/325 places, 270/270 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 318 transition count 263
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 318 transition count 263
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 318 transition count 262
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 316 transition count 260
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 316 transition count 260
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 21 place count 316 transition count 258
Applied a total of 21 rules in 20 ms. Remains 316 /325 variables (removed 9) and now considering 258/270 (removed 12) transitions.
// Phase 1: matrix 258 rows 316 cols
[2023-03-08 09:40:46] [INFO ] Computed 62 place invariants in 5 ms
[2023-03-08 09:40:46] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-03-08 09:40:46] [INFO ] Invariant cache hit.
[2023-03-08 09:40:46] [INFO ] Implicit Places using invariants and state equation in 340 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 471 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 315/325 places, 258/270 transitions.
Applied a total of 0 rules in 5 ms. Remains 315 /315 variables (removed 0) and now considering 258/258 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 497 ms. Remains : 315/325 places, 258/270 transitions.
Stuttering acceptance computed with spot in 327 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true, p0, (NOT p1), (AND p0 (NOT p1))]
Running random walk in product with property : DES-PT-20b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 3}, { cond=(AND p1 p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(EQ s308 1), p1:(AND (EQ s291 1) (EQ s300 1)), p0:(AND (EQ s106 1) (EQ s162 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-20b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20b-LTLFireability-09 finished in 851 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U ((p1||F(p2)||G(p3)) U X(G(!p4)))))'
Support contains 12 out of 325 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 325/325 places, 270/270 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 319 transition count 264
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 319 transition count 264
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 319 transition count 263
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 316 transition count 260
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 316 transition count 260
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 22 place count 316 transition count 257
Applied a total of 22 rules in 21 ms. Remains 316 /325 variables (removed 9) and now considering 257/270 (removed 13) transitions.
// Phase 1: matrix 257 rows 316 cols
[2023-03-08 09:40:47] [INFO ] Computed 62 place invariants in 4 ms
[2023-03-08 09:40:47] [INFO ] Implicit Places using invariants in 122 ms returned []
[2023-03-08 09:40:47] [INFO ] Invariant cache hit.
[2023-03-08 09:40:47] [INFO ] Implicit Places using invariants and state equation in 300 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 424 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 315/325 places, 257/270 transitions.
Applied a total of 0 rules in 4 ms. Remains 315 /315 variables (removed 0) and now considering 257/257 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 449 ms. Remains : 315/325 places, 257/270 transitions.
Stuttering acceptance computed with spot in 233 ms :[(AND (NOT p0) (NOT p2) p4), p4, (AND (NOT p0) (NOT p2) (NOT p3) p4), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p3))]
Running random walk in product with property : DES-PT-20b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(OR (AND p1 (NOT p2) (NOT p0) (NOT p4)) (AND (NOT p2) p3 (NOT p0) (NOT p4))), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p4), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(NOT p4), acceptance={} source=1 dest: 1}, { cond=p4, acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p3 (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p2) (NOT p3) (NOT p0) (NOT p4)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p2) p3 (NOT p0) (NOT p4)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p3) (NOT p0) p4), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p3 (NOT p0) p4), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p3 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(AND (EQ s94 1) (EQ s98 1) (EQ s108 1) (EQ s109 1) (EQ s114 1) (EQ s120 1)), p2:(AND (EQ s19 1) (EQ s170 1)), p0:(EQ s93 1), p4:(AND (EQ s112 1) (EQ s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33405 reset in 195 ms.
Product exploration explored 100000 steps with 33239 reset in 197 ms.
Computed a total of 137 stabilizing places and 130 stable transitions
Graph (complete) has 651 edges and 315 vertex of which 310 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 137 stabilizing places and 130 stable transitions
Detected a total of 137/315 stabilizing places and 130/257 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/5 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0) (NOT p4) (NOT p3)), (X (NOT (AND (NOT p2) p3 (NOT p0) p4))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p0) p4))), (X (NOT (AND p1 (NOT p2) (NOT p3) (NOT p0) (NOT p4)))), (X (NOT (AND p1 (NOT p2) p3 (NOT p0) (NOT p4)))), (X (NOT (OR (AND p1 (NOT p2) (NOT p0) (NOT p4)) (AND (NOT p2) p3 (NOT p0) (NOT p4))))), (X (NOT (AND (NOT p2) (NOT p0) p4))), (X (NOT p4)), (X (NOT (AND (NOT p1) (NOT p2) p3 (NOT p0)))), (X (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0))), (X (X (NOT (AND (NOT p2) p3 (NOT p0) p4)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0) p4)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3) (NOT p0) (NOT p4))))), (X (X (NOT (AND p1 (NOT p2) p3 (NOT p0) (NOT p4))))), (X (X (NOT (OR (AND p1 (NOT p2) (NOT p0) (NOT p4)) (AND (NOT p2) p3 (NOT p0) (NOT p4)))))), (X (X (NOT (AND (NOT p2) (NOT p0) p4)))), (X (X (NOT p4))), (X (X (NOT (AND (NOT p1) (NOT p2) p3 (NOT p0))))), (X (X (AND (NOT p2) (NOT p3) (NOT p0)))), (X (X (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p2) p3 (NOT p0))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 1431 ms. Reduced automaton from 5 states, 13 edges and 5 AP (stutter sensitive) to 5 states, 13 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 242 ms :[(AND (NOT p0) (NOT p2) p4), p4, (AND (NOT p0) (NOT p2) (NOT p3) p4), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p3))]
Incomplete random walk after 10000 steps, including 88 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 12) seen :11
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 257 rows 315 cols
[2023-03-08 09:40:50] [INFO ] Computed 61 place invariants in 2 ms
[2023-03-08 09:40:50] [INFO ] [Real]Absence check using 32 positive place invariants in 5 ms returned sat
[2023-03-08 09:40:50] [INFO ] [Real]Absence check using 32 positive and 29 generalized place invariants in 17 ms returned sat
[2023-03-08 09:40:50] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0) (NOT p4) (NOT p3)), (X (NOT (AND (NOT p2) p3 (NOT p0) p4))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p0) p4))), (X (NOT (AND p1 (NOT p2) (NOT p3) (NOT p0) (NOT p4)))), (X (NOT (AND p1 (NOT p2) p3 (NOT p0) (NOT p4)))), (X (NOT (OR (AND p1 (NOT p2) (NOT p0) (NOT p4)) (AND (NOT p2) p3 (NOT p0) (NOT p4))))), (X (NOT (AND (NOT p2) (NOT p0) p4))), (X (NOT p4)), (X (NOT (AND (NOT p1) (NOT p2) p3 (NOT p0)))), (X (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0))), (X (X (NOT (AND (NOT p2) p3 (NOT p0) p4)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0) p4)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3) (NOT p0) (NOT p4))))), (X (X (NOT (AND p1 (NOT p2) p3 (NOT p0) (NOT p4))))), (X (X (NOT (OR (AND p1 (NOT p2) (NOT p0) (NOT p4)) (AND (NOT p2) p3 (NOT p0) (NOT p4)))))), (X (X (NOT (AND (NOT p2) (NOT p0) p4)))), (X (X (NOT p4))), (X (X (NOT (AND (NOT p1) (NOT p2) p3 (NOT p0))))), (X (X (AND (NOT p2) (NOT p3) (NOT p0)))), (X (X (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p2) p3 (NOT p0))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (G (NOT (AND (NOT p2) p3 (NOT p0) p4)))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p3) (NOT p0) p4)), (F (NOT (AND (NOT p2) (NOT p0)))), (F (AND (NOT p2) p3 (NOT p0) (NOT p1))), (F p4), (F (AND (NOT p2) p3 (NOT p0) (NOT p4) p1)), (F (AND (NOT p2) (NOT p3) (NOT p0) (NOT p4) p1)), (F (OR (AND (NOT p2) p3 (NOT p0) (NOT p4)) (AND (NOT p2) (NOT p0) (NOT p4) p1))), (F (NOT (AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)))), (F (AND (NOT p2) (NOT p0) p4)), (F (AND (NOT p2) p3 (NOT p0))), (F (NOT (AND (NOT p2) (NOT p3) (NOT p0))))]
Knowledge based reduction with 26 factoid took 1964 ms. Reduced automaton from 5 states, 13 edges and 5 AP (stutter sensitive) to 4 states, 10 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p0) (NOT p2) p4), p4, (AND (NOT p0) (NOT p2) p4), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p0) (NOT p2) p4), p4, (AND (NOT p0) (NOT p2) p4), (AND (NOT p2) (NOT p0))]
Support contains 12 out of 315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 315/315 places, 257/257 transitions.
Applied a total of 0 rules in 8 ms. Remains 315 /315 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2023-03-08 09:40:52] [INFO ] Invariant cache hit.
[2023-03-08 09:40:52] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-03-08 09:40:52] [INFO ] Invariant cache hit.
[2023-03-08 09:40:53] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 494 ms to find 0 implicit places.
[2023-03-08 09:40:53] [INFO ] Invariant cache hit.
[2023-03-08 09:40:53] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 654 ms. Remains : 315/315 places, 257/257 transitions.
Computed a total of 137 stabilizing places and 130 stable transitions
Graph (complete) has 651 edges and 315 vertex of which 310 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Computed a total of 137 stabilizing places and 130 stable transitions
Detected a total of 137/315 stabilizing places and 130/257 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/5 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p3) (NOT p4) (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p3) (NOT p4) p1))), (X (NOT (AND (NOT p2) (NOT p0) p3 (NOT p4) p1))), (X (NOT (OR (AND (NOT p2) (NOT p0) p3 (NOT p4)) (AND (NOT p2) (NOT p0) (NOT p4) p1)))), (X (AND (NOT p2) (NOT p0) (NOT p3) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) p4))), (X (NOT p4)), (X (NOT (AND (NOT p2) (NOT p0) p3 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p3) (NOT p4) p1)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0) p3 (NOT p4) p1)))), (X (X (NOT (OR (AND (NOT p2) (NOT p0) p3 (NOT p4)) (AND (NOT p2) (NOT p0) (NOT p4) p1))))), (X (X (AND (NOT p2) (NOT p0) (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p4)))), (X (X (NOT p4))), (X (X (NOT (AND (NOT p2) (NOT p0) p3 (NOT p1))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 1115 ms. Reduced automaton from 4 states, 10 edges and 5 AP (stutter sensitive) to 4 states, 10 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) (NOT p2) p4), p4, (AND (NOT p0) (NOT p2) p4), (AND (NOT p0) (NOT p2))]
Finished random walk after 6153 steps, including 54 resets, run visited all 8 properties in 20 ms. (steps per millisecond=307 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p3) (NOT p4) (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p3) (NOT p4) p1))), (X (NOT (AND (NOT p2) (NOT p0) p3 (NOT p4) p1))), (X (NOT (OR (AND (NOT p2) (NOT p0) p3 (NOT p4)) (AND (NOT p2) (NOT p0) (NOT p4) p1)))), (X (AND (NOT p2) (NOT p0) (NOT p3) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) p4))), (X (NOT p4)), (X (NOT (AND (NOT p2) (NOT p0) p3 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p3) (NOT p4) p1)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0) p3 (NOT p4) p1)))), (X (X (NOT (OR (AND (NOT p2) (NOT p0) p3 (NOT p4)) (AND (NOT p2) (NOT p0) (NOT p4) p1))))), (X (X (AND (NOT p2) (NOT p0) (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p4)))), (X (X (NOT p4))), (X (X (NOT (AND (NOT p2) (NOT p0) p3 (NOT p1))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (AND (NOT p1) p3 (NOT p0) (NOT p2))), (F p4), (F (AND p1 p3 (NOT p0) (NOT p2) (NOT p4))), (F (AND p1 (NOT p3) (NOT p0) (NOT p2) (NOT p4))), (F (OR (AND p1 (NOT p0) (NOT p2) (NOT p4)) (AND p3 (NOT p0) (NOT p2) (NOT p4)))), (F (NOT (AND (NOT p1) (NOT p3) (NOT p0) (NOT p2)))), (F (AND (NOT p0) (NOT p2) p4)), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 19 factoid took 1223 ms. Reduced automaton from 4 states, 10 edges and 5 AP (stutter sensitive) to 4 states, 10 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p0) (NOT p2) p4), p4, (AND (NOT p0) (NOT p2) p4), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p2) p4), p4, (AND (NOT p0) (NOT p2) p4), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p0) (NOT p2) p4), p4, (AND (NOT p0) (NOT p2) p4), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 33258 reset in 196 ms.
Product exploration explored 100000 steps with 33411 reset in 192 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 327 ms :[(AND (NOT p0) (NOT p2) p4), p4, (AND (NOT p0) (NOT p2) p4), (AND (NOT p0) (NOT p2))]
Support contains 12 out of 315 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 315/315 places, 257/257 transitions.
Graph (complete) has 651 edges and 315 vertex of which 310 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
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 310 transition count 254
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 7 Pre rules applied. Total rules applied 15 place count 310 transition count 256
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 22 place count 310 transition count 256
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 27 place count 305 transition count 251
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 32 place count 305 transition count 251
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 84 places in 0 ms
Iterating global reduction 1 with 68 rules applied. Total rules applied 100 place count 305 transition count 255
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 109 place count 296 transition count 246
Deduced a syphon composed of 75 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 118 place count 296 transition count 246
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 123 place count 296 transition count 266
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 125 place count 294 transition count 260
Deduced a syphon composed of 78 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 127 place count 294 transition count 260
Deduced a syphon composed of 78 places in 0 ms
Applied a total of 127 rules in 47 ms. Remains 294 /315 variables (removed 21) and now considering 260/257 (removed -3) transitions.
[2023-03-08 09:40:57] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 260 rows 294 cols
[2023-03-08 09:40:57] [INFO ] Computed 59 place invariants in 3 ms
[2023-03-08 09:40:57] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 294/315 places, 260/257 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 200 ms. Remains : 294/315 places, 260/257 transitions.
Built C files in :
/tmp/ltsmin11198218430359590833
[2023-03-08 09:40:57] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11198218430359590833
Running compilation step : cd /tmp/ltsmin11198218430359590833;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 396 ms.
Running link step : cd /tmp/ltsmin11198218430359590833;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin11198218430359590833;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7281578639182495255.hoa' '--buchi-type=spotba'
LTSmin run took 109 ms.
FORMULA DES-PT-20b-LTLFireability-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-20b-LTLFireability-10 finished in 10700 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U X(p1)))))'
Support contains 2 out of 325 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 325/325 places, 270/270 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 318 transition count 263
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 318 transition count 263
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 318 transition count 261
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 19 place count 315 transition count 258
Iterating global reduction 1 with 3 rules applied. Total rules applied 22 place count 315 transition count 258
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 25 place count 315 transition count 255
Applied a total of 25 rules in 23 ms. Remains 315 /325 variables (removed 10) and now considering 255/270 (removed 15) transitions.
// Phase 1: matrix 255 rows 315 cols
[2023-03-08 09:40:57] [INFO ] Computed 62 place invariants in 7 ms
[2023-03-08 09:40:58] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-03-08 09:40:58] [INFO ] Invariant cache hit.
[2023-03-08 09:40:58] [INFO ] Implicit Places using invariants and state equation in 349 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 486 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 314/325 places, 255/270 transitions.
Applied a total of 0 rules in 4 ms. Remains 314 /314 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 513 ms. Remains : 314/325 places, 255/270 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : DES-PT-20b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s217 1), p1:(EQ s296 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 90 steps with 0 reset in 1 ms.
FORMULA DES-PT-20b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20b-LTLFireability-11 finished in 663 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p1)&&p0))))'
Support contains 4 out of 325 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 325/325 places, 270/270 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 317 transition count 262
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 317 transition count 262
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 317 transition count 260
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 314 transition count 257
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 314 transition count 257
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 27 place count 314 transition count 254
Applied a total of 27 rules in 14 ms. Remains 314 /325 variables (removed 11) and now considering 254/270 (removed 16) transitions.
// Phase 1: matrix 254 rows 314 cols
[2023-03-08 09:40:58] [INFO ] Computed 62 place invariants in 7 ms
[2023-03-08 09:40:58] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-03-08 09:40:58] [INFO ] Invariant cache hit.
[2023-03-08 09:40:59] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
[2023-03-08 09:40:59] [INFO ] Invariant cache hit.
[2023-03-08 09:40:59] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 314/325 places, 254/270 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 559 ms. Remains : 314/325 places, 254/270 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : DES-PT-20b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s5 1) (EQ s26 1) (EQ s47 1) (EQ s68 1)), p1:(AND (EQ s5 1) (EQ s26 1) (EQ s47 1) (EQ s68 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-20b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20b-LTLFireability-13 finished in 703 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 325 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 325/325 places, 270/270 transitions.
Graph (complete) has 672 edges and 325 vertex of which 319 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 318 transition count 250
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 302 transition count 250
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 33 place count 302 transition count 238
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 57 place count 290 transition count 238
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 63 place count 284 transition count 232
Iterating global reduction 2 with 6 rules applied. Total rules applied 69 place count 284 transition count 232
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 72 place count 284 transition count 229
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 74 place count 283 transition count 228
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 76 place count 281 transition count 226
Iterating global reduction 4 with 2 rules applied. Total rules applied 78 place count 281 transition count 226
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 80 place count 281 transition count 224
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 80 place count 281 transition count 223
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 82 place count 280 transition count 223
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 234 place count 204 transition count 147
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 238 place count 202 transition count 149
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 240 place count 200 transition count 147
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 241 place count 199 transition count 147
Applied a total of 241 rules in 35 ms. Remains 199 /325 variables (removed 126) and now considering 147/270 (removed 123) transitions.
// Phase 1: matrix 147 rows 199 cols
[2023-03-08 09:40:59] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 09:40:59] [INFO ] Implicit Places using invariants in 115 ms returned []
[2023-03-08 09:40:59] [INFO ] Invariant cache hit.
[2023-03-08 09:40:59] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
[2023-03-08 09:40:59] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 09:40:59] [INFO ] Invariant cache hit.
[2023-03-08 09:40:59] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 199/325 places, 147/270 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 424 ms. Remains : 199/325 places, 147/270 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-20b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s27 1) (EQ s194 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 1 ms.
FORMULA DES-PT-20b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20b-LTLFireability-15 finished in 482 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(G(p1)))))'
[2023-03-08 09:40:59] [INFO ] Flatten gal took : 16 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin579127542914707471
[2023-03-08 09:40:59] [INFO ] Computing symmetric may disable matrix : 270 transitions.
[2023-03-08 09:40:59] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 09:40:59] [INFO ] Applying decomposition
[2023-03-08 09:40:59] [INFO ] Computing symmetric may enable matrix : 270 transitions.
[2023-03-08 09:40:59] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 09:40:59] [INFO ] Flatten gal took : 13 ms
[2023-03-08 09:40:59] [INFO ] Computing Do-Not-Accords matrix : 270 transitions.
[2023-03-08 09:40:59] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 09:40:59] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin579127542914707471
Running compilation step : cd /tmp/ltsmin579127542914707471;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph16562368716467073349.txt' '-o' '/tmp/graph16562368716467073349.bin' '-w' '/tmp/graph16562368716467073349.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph16562368716467073349.bin' '-l' '-1' '-v' '-w' '/tmp/graph16562368716467073349.weights' '-q' '0' '-e' '0.001'
[2023-03-08 09:40:59] [INFO ] Decomposing Gal with order
[2023-03-08 09:40:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 09:41:00] [INFO ] Removed a total of 20 redundant transitions.
[2023-03-08 09:41:00] [INFO ] Flatten gal took : 39 ms
[2023-03-08 09:41:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 11 ms.
[2023-03-08 09:41:00] [INFO ] Time to serialize gal into /tmp/LTLFireability13951978877882977789.gal : 12 ms
[2023-03-08 09:41:00] [INFO ] Time to serialize properties into /tmp/LTLFireability15694830260248557560.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13951978877882977789.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15694830260248557560.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((F(("(u77.p355==0)")&&(F(G("(i9.i2.u47.p255==0)"))))))
Formula 0 simplified : GF!"(i9.i2.u47.p255==0)" | G!"(u77.p355==0)"
Compilation finished in 525 ms.
Running link step : cd /tmp/ltsmin579127542914707471;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin579127542914707471;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(((LTLAPp0==true)&&<>([]((LTLAPp1==true)))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t0, t60, t127, t199, t232, t264, u34.t81, u35.t78, u77.t17, i2.u7.t134, i2.u7.t136, i2.u15.t1...1017
Computing Next relation with stutter on 1.41451e+08 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.018: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.018: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.018: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.049: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.049: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.047: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.047: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.048: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.048: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.047: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.047: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.048: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.047: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.079: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.128: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.128: Initializing POR dependencies: labels 272, guards 270
pins2lts-mc-linux64( 4/ 8), 0.198: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.240: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.266: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.312: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.335: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 1.046: LTL layer: formula: <>(((LTLAPp0==true)&&<>([]((LTLAPp1==true)))))
pins2lts-mc-linux64( 5/ 8), 1.046: "<>(((LTLAPp0==true)&&<>([]((LTLAPp1==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 1.046: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 1.313: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 1.354: There are 273 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 1.354: State length is 326, there are 277 groups
pins2lts-mc-linux64( 0/ 8), 1.354: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 1.354: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 1.354: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 1.354: Visible groups: 0 / 277, labels: 2 / 273
pins2lts-mc-linux64( 0/ 8), 1.354: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 1.354: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 4/ 8), 1.395: [Blue] ~88 levels ~960 states ~1264 transitions
pins2lts-mc-linux64( 7/ 8), 1.421: [Blue] ~88 levels ~1920 states ~2424 transitions
pins2lts-mc-linux64( 7/ 8), 1.455: [Blue] ~111 levels ~3840 states ~5008 transitions
pins2lts-mc-linux64( 7/ 8), 1.573: [Blue] ~111 levels ~7680 states ~10496 transitions
pins2lts-mc-linux64( 7/ 8), 1.700: [Blue] ~111 levels ~15360 states ~21448 transitions
pins2lts-mc-linux64( 7/ 8), 2.416: [Blue] ~111 levels ~30720 states ~43936 transitions
pins2lts-mc-linux64( 4/ 8), 4.098: [Blue] ~334 levels ~61440 states ~75352 transitions
pins2lts-mc-linux64( 4/ 8), 6.067: [Blue] ~514 levels ~122880 states ~150800 transitions
pins2lts-mc-linux64( 7/ 8), 10.034: [Blue] ~190 levels ~245760 states ~304408 transitions
pins2lts-mc-linux64( 7/ 8), 15.050: [Blue] ~190 levels ~491520 states ~562200 transitions
pins2lts-mc-linux64( 1/ 8), 18.653: [Blue] ~1020 levels ~983040 states ~1170120 transitions
pins2lts-mc-linux64( 7/ 8), 25.453: [Blue] ~592 levels ~1966080 states ~2147216 transitions
pins2lts-mc-linux64( 4/ 8), 37.584: [Blue] ~7829 levels ~3932160 states ~4355648 transitions
pins2lts-mc-linux64( 4/ 8), 63.216: [Blue] ~8888 levels ~7864320 states ~8750056 transitions
pins2lts-mc-linux64( 1/ 8), 120.093: [Blue] ~2295 levels ~15728640 states ~19966496 transitions
pins2lts-mc-linux64( 1/ 8), 229.277: [Blue] ~2559 levels ~31457280 states ~38785480 transitions
pins2lts-mc-linux64( 1/ 8), 445.291: [Blue] ~3029 levels ~62914560 states ~75198192 transitions
pins2lts-mc-linux64( 1/ 8), 888.920: [Blue] ~3379 levels ~125829120 states ~148656768 transitions
pins2lts-mc-linux64( 2/ 8), 1173.759: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1173.782:
pins2lts-mc-linux64( 0/ 8), 1173.783: Explored 127791684 states 143127247 transitions, fanout: 1.120
pins2lts-mc-linux64( 0/ 8), 1173.783: Total exploration time 1172.390 sec (1172.370 sec minimum, 1172.385 sec on average)
pins2lts-mc-linux64( 0/ 8), 1173.783: States per second: 109001, Transitions per second: 122082
pins2lts-mc-linux64( 0/ 8), 1173.783:
pins2lts-mc-linux64( 0/ 8), 1173.783: State space has 134215420 states, 328676 are accepting
pins2lts-mc-linux64( 0/ 8), 1173.783: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1173.783: blue states: 127791684 (95.21%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1173.783: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1173.783: all-red states: 363442 (0.27%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1173.783:
pins2lts-mc-linux64( 0/ 8), 1173.783: Total memory used for local state coloring: 250.5MB
pins2lts-mc-linux64( 0/ 8), 1173.783:
pins2lts-mc-linux64( 0/ 8), 1173.783: Queue width: 8B, total height: 16417649, memory: 125.26MB
pins2lts-mc-linux64( 0/ 8), 1173.783: Tree memory: 1082.5MB, 8.5 B/state, compr.: 0.6%
pins2lts-mc-linux64( 0/ 8), 1173.783: Tree fill ratio (roots/leafs): 99.0%/22.0%
pins2lts-mc-linux64( 0/ 8), 1173.783: Stored 271 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1173.783: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1173.783: Est. total memory use: 1207.8MB (~1149.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin579127542914707471;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(((LTLAPp0==true)&&<>([]((LTLAPp1==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin579127542914707471;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(((LTLAPp0==true)&&<>([]((LTLAPp1==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-08 10:01:44] [INFO ] Applying decomposition
[2023-03-08 10:01:44] [INFO ] Flatten gal took : 11 ms
[2023-03-08 10:01:44] [INFO ] Decomposing Gal with order
[2023-03-08 10:01:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 10:01:44] [INFO ] Removed a total of 88 redundant transitions.
[2023-03-08 10:01:44] [INFO ] Flatten gal took : 20 ms
[2023-03-08 10:01:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 320 labels/synchronizations in 11 ms.
[2023-03-08 10:01:44] [INFO ] Time to serialize gal into /tmp/LTLFireability15895248684909595170.gal : 4 ms
[2023-03-08 10:01:44] [INFO ] Time to serialize properties into /tmp/LTLFireability2710248419425542615.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15895248684909595170.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2710248419425542615.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(("(i1.i1.i1.u118.p355==0)")&&(F(G("(i1.i1.i0.i1.i0.i0.i1.i0.i0.i1.i0.u152.p255==0)"))))))
Formula 0 simplified : GF!"(i1.i1.i0.i1.i0.i0.i1.i0.i0.i1.i0.u152.p255==0)" | G!"(i1.i1.i1.u118.p355==0)"
Detected timeout of ITS tools.
[2023-03-08 10:22:28] [INFO ] Flatten gal took : 9 ms
[2023-03-08 10:22:28] [INFO ] Input system was already deterministic with 270 transitions.
[2023-03-08 10:22:28] [INFO ] Transformed 325 places.
[2023-03-08 10:22:28] [INFO ] Transformed 270 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-08 10:22:28] [INFO ] Time to serialize gal into /tmp/LTLFireability3540881742596535011.gal : 5 ms
[2023-03-08 10:22:28] [INFO ] Time to serialize properties into /tmp/LTLFireability7010165252178387738.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3540881742596535011.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7010165252178387738.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(("(p355==0)")&&(F(G("(p255==0)"))))))
Formula 0 simplified : GF!"(p255==0)" | G!"(p355==0)"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 8178548 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15634984 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is DES-PT-20b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r101-tall-167814475400436"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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