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.r103-tall-167814478300436.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 lolaxred
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 r103-tall-167814478300436
=====================================================================

--------------------
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 1678251761032

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-20b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 05:02:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 05:02:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 05:02:42] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2023-03-08 05:02:42] [INFO ] Transformed 360 places.
[2023-03-08 05:02:42] [INFO ] Transformed 311 transitions.
[2023-03-08 05:02:42] [INFO ] Found NUPN structural information;
[2023-03-08 05:02:42] [INFO ] Parsed PT model containing 360 places and 311 transitions and 987 arcs in 120 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 66 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 05:02:42] [INFO ] Computed 62 place invariants in 30 ms
[2023-03-08 05:02:43] [INFO ] Implicit Places using invariants in 471 ms returned []
[2023-03-08 05:02:43] [INFO ] Invariant cache hit.
[2023-03-08 05:02:43] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 779 ms to find 0 implicit places.
[2023-03-08 05:02:43] [INFO ] Invariant cache hit.
[2023-03-08 05:02:43] [INFO ] Dead Transitions using invariants and state equation in 139 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 985 ms. Remains : 325/360 places, 270/311 transitions.
Support contains 49 out of 325 places after structural reductions.
[2023-03-08 05:02:43] [INFO ] Flatten gal took : 43 ms
[2023-03-08 05:02:43] [INFO ] Flatten gal took : 22 ms
[2023-03-08 05:02:43] [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 84 resets, run finished after 450 ms. (steps per millisecond=22 ) properties (out of 28) seen :22
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 11 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 30 ms. (steps per millisecond=333 ) 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 13 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-08 05:02:44] [INFO ] Invariant cache hit.
[2023-03-08 05:02:44] [INFO ] [Real]Absence check using 32 positive place invariants in 7 ms returned sat
[2023-03-08 05:02:44] [INFO ] [Real]Absence check using 32 positive and 30 generalized place invariants in 17 ms returned sat
[2023-03-08 05:02:45] [INFO ] After 415ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-08 05:02:45] [INFO ] [Nat]Absence check using 32 positive place invariants in 13 ms returned sat
[2023-03-08 05:02:45] [INFO ] [Nat]Absence check using 32 positive and 30 generalized place invariants in 16 ms returned sat
[2023-03-08 05:02:45] [INFO ] After 209ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-08 05:02:45] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 4 ms to minimize.
[2023-03-08 05:02:45] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2023-03-08 05:02:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 144 ms
[2023-03-08 05:02:45] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2023-03-08 05:02:45] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2023-03-08 05:02:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 170 ms
[2023-03-08 05:02:45] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2023-03-08 05:02:45] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 0 ms to minimize.
[2023-03-08 05:02:45] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2023-03-08 05:02:46] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 0 ms to minimize.
[2023-03-08 05:02:46] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 344 ms
[2023-03-08 05:02:46] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 0 ms to minimize.
[2023-03-08 05:02:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2023-03-08 05:02:46] [INFO ] After 1113ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 131 ms.
[2023-03-08 05:02:46] [INFO ] After 1402ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 1 properties in 430 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.1 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 0 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 6 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 0 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 109 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 109 ms. Remains : 203/325 places, 146/270 transitions.
Incomplete random walk after 10000 steps, including 452 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 84 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 87 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 838953 steps, run timeout after 3001 ms. (steps per millisecond=279 ) properties seen :{}
Probabilistic random walk after 838953 steps, saw 118258 distinct states, run finished after 3002 ms. (steps per millisecond=279 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 146 rows 203 cols
[2023-03-08 05:02:50] [INFO ] Computed 63 place invariants in 8 ms
[2023-03-08 05:02:50] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 05:02:50] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 10 ms returned sat
[2023-03-08 05:02:50] [INFO ] After 208ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-08 05:02:50] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 05:02:50] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 11 ms returned sat
[2023-03-08 05:02:50] [INFO ] After 141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-08 05:02:50] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2023-03-08 05:02:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2023-03-08 05:02:50] [INFO ] After 288ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-03-08 05:02:50] [INFO ] After 426ms 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 77 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 6 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 5 ms. Remains 203 /203 variables (removed 0) and now considering 146/146 (removed 0) transitions.
[2023-03-08 05:02:51] [INFO ] Invariant cache hit.
[2023-03-08 05:02:51] [INFO ] Implicit Places using invariants in 107 ms returned []
[2023-03-08 05:02:51] [INFO ] Invariant cache hit.
[2023-03-08 05:02:51] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
[2023-03-08 05:02:51] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 05:02:51] [INFO ] Invariant cache hit.
[2023-03-08 05:02:51] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 391 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 05:02:51] [INFO ] Invariant cache hit.
[2023-03-08 05:02:51] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 05:02:51] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 11 ms returned sat
[2023-03-08 05:02:51] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-08 05:02:51] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:02:51] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 10 ms returned sat
[2023-03-08 05:02:51] [INFO ] After 111ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-08 05:02:51] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2023-03-08 05:02:51] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2023-03-08 05:02:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 95 ms
[2023-03-08 05:02:51] [INFO ] After 292ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 69 ms.
[2023-03-08 05:02:51] [INFO ] After 441ms 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 1 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 0 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 0 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 58 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 05:02:52] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-08 05:02:52] [INFO ] Implicit Places using invariants in 116 ms returned []
[2023-03-08 05:02:52] [INFO ] Invariant cache hit.
[2023-03-08 05:02:52] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2023-03-08 05:02:52] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-08 05:02:52] [INFO ] Invariant cache hit.
[2023-03-08 05:02:52] [INFO ] Dead Transitions using invariants and state equation in 87 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 481 ms. Remains : 204/325 places, 150/270 transitions.
Stuttering acceptance computed with spot in 258 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 25371 reset in 315 ms.
Product exploration explored 100000 steps with 25367 reset in 260 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 369 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 109 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 68 steps, including 2 resets, run visited all 4 properties in 2 ms. (steps per millisecond=34 )
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 419 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 107 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
[2023-03-08 05:02:54] [INFO ] Invariant cache hit.
[2023-03-08 05:02:54] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 05:02:54] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 18 ms returned sat
[2023-03-08 05:02:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 05:02:55] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2023-03-08 05:02:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 05:02:55] [INFO ] [Nat]Absence check using 33 positive place invariants in 9 ms returned sat
[2023-03-08 05:02:55] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 05:02:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 05:02:55] [INFO ] [Nat]Absence check using state equation in 285 ms returned sat
[2023-03-08 05:02:55] [INFO ] Computed and/alt/rep : 138/346/138 causal constraints (skipped 9 transitions) in 12 ms.
[2023-03-08 05:02:55] [INFO ] Added : 103 causal constraints over 21 iterations in 339 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 15 ms. Remains 204 /204 variables (removed 0) and now considering 150/150 (removed 0) transitions.
[2023-03-08 05:02:55] [INFO ] Invariant cache hit.
[2023-03-08 05:02:55] [INFO ] Implicit Places using invariants in 116 ms returned []
[2023-03-08 05:02:55] [INFO ] Invariant cache hit.
[2023-03-08 05:02:56] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
[2023-03-08 05:02:56] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-08 05:02:56] [INFO ] Invariant cache hit.
[2023-03-08 05:02:56] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 444 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 387 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 116 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 47 steps, including 1 resets, run visited all 4 properties in 2 ms. (steps per millisecond=23 )
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 435 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 120 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
[2023-03-08 05:02:57] [INFO ] Invariant cache hit.
[2023-03-08 05:02:57] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 05:02:57] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 18 ms returned sat
[2023-03-08 05:02:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 05:02:57] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2023-03-08 05:02:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 05:02:57] [INFO ] [Nat]Absence check using 33 positive place invariants in 8 ms returned sat
[2023-03-08 05:02:57] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 05:02:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 05:02:58] [INFO ] [Nat]Absence check using state equation in 290 ms returned sat
[2023-03-08 05:02:58] [INFO ] Computed and/alt/rep : 138/346/138 causal constraints (skipped 9 transitions) in 10 ms.
[2023-03-08 05:02:58] [INFO ] Added : 103 causal constraints over 21 iterations in 330 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 25393 reset in 201 ms.
Product exploration explored 100000 steps with 25410 reset in 206 ms.
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 5 ms. Remains 204 /204 variables (removed 0) and now considering 150/150 (removed 0) transitions.
[2023-03-08 05:02:58] [INFO ] Invariant cache hit.
[2023-03-08 05:02:59] [INFO ] Implicit Places using invariants in 118 ms returned []
[2023-03-08 05:02:59] [INFO ] Invariant cache hit.
[2023-03-08 05:02:59] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
[2023-03-08 05:02:59] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 05:02:59] [INFO ] Invariant cache hit.
[2023-03-08 05:02:59] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 427 ms. Remains : 204/204 places, 150/150 transitions.
Treatment of property DES-PT-20b-LTLFireability-01 finished in 7239 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 16 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 05:02:59] [INFO ] Computed 62 place invariants in 9 ms
[2023-03-08 05:02:59] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-03-08 05:02:59] [INFO ] Invariant cache hit.
[2023-03-08 05:02:59] [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 440 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 5 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 462 ms. Remains : 316/325 places, 258/270 transitions.
Stuttering acceptance computed with spot in 207 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 223 steps with 0 reset in 3 ms.
FORMULA DES-PT-20b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20b-LTLFireability-02 finished in 689 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 18 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 05:03:00] [INFO ] Computed 62 place invariants in 7 ms
[2023-03-08 05:03:00] [INFO ] Implicit Places using invariants in 131 ms returned []
[2023-03-08 05:03:00] [INFO ] Invariant cache hit.
[2023-03-08 05:03:00] [INFO ] Implicit Places using invariants and state equation in 305 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 438 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 5 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 461 ms. Remains : 313/325 places, 254/270 transitions.
Stuttering acceptance computed with spot in 111 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 593 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.3 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 1 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 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 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 48 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 05:03:00] [INFO ] Computed 59 place invariants in 5 ms
[2023-03-08 05:03:00] [INFO ] Implicit Places using invariants in 119 ms returned [92]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 120 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 173 ms. Remains : 200/325 places, 148/270 transitions.
Stuttering acceptance computed with spot in 36 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 39989 reset in 303 ms.
Product exploration explored 100000 steps with 40042 reset in 316 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 126 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 25 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 146 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 25 ms :[(NOT p0)]
// Phase 1: matrix 148 rows 200 cols
[2023-03-08 05:03:01] [INFO ] Computed 58 place invariants in 8 ms
[2023-03-08 05:03:02] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-08 05:03:02] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 13 ms returned sat
[2023-03-08 05:03:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 05:03:02] [INFO ] [Real]Absence check using state equation in 188 ms returned sat
[2023-03-08 05:03:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 05:03:02] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 05:03:02] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 92 ms returned sat
[2023-03-08 05:03:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 05:03:02] [INFO ] [Nat]Absence check using state equation in 230 ms returned sat
[2023-03-08 05:03:02] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 05:03:02] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2023-03-08 05:03:02] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2023-03-08 05:03:02] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2023-03-08 05:03:02] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2023-03-08 05:03:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 201 ms
[2023-03-08 05:03:02] [INFO ] Computed and/alt/rep : 135/429/135 causal constraints (skipped 11 transitions) in 11 ms.
[2023-03-08 05:03:03] [INFO ] Added : 25 causal constraints over 5 iterations in 109 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 05:03:03] [INFO ] Invariant cache hit.
[2023-03-08 05:03:03] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-08 05:03:03] [INFO ] Invariant cache hit.
[2023-03-08 05:03:03] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 05:03:03] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
[2023-03-08 05:03:03] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:03:03] [INFO ] Invariant cache hit.
[2023-03-08 05:03:03] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 408 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 141 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 29 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 123 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 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
[2023-03-08 05:03:03] [INFO ] Invariant cache hit.
[2023-03-08 05:03:03] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 05:03:03] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 12 ms returned sat
[2023-03-08 05:03:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 05:03:04] [INFO ] [Real]Absence check using state equation in 192 ms returned sat
[2023-03-08 05:03:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 05:03:04] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 05:03:04] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 40 ms returned sat
[2023-03-08 05:03:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 05:03:04] [INFO ] [Nat]Absence check using state equation in 260 ms returned sat
[2023-03-08 05:03:04] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 05:03:04] [INFO ] [Nat]Added 6 Read/Feed constraints in 4 ms returned sat
[2023-03-08 05:03:04] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2023-03-08 05:03:04] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2023-03-08 05:03:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 132 ms
[2023-03-08 05:03:04] [INFO ] Computed and/alt/rep : 135/429/135 causal constraints (skipped 11 transitions) in 9 ms.
[2023-03-08 05:03:04] [INFO ] Added : 25 causal constraints over 5 iterations in 109 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Product exploration explored 100000 steps with 39972 reset in 299 ms.
Product exploration explored 100000 steps with 39953 reset in 316 ms.
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 05:03:05] [INFO ] Invariant cache hit.
[2023-03-08 05:03:05] [INFO ] Implicit Places using invariants in 111 ms returned []
[2023-03-08 05:03:05] [INFO ] Invariant cache hit.
[2023-03-08 05:03:05] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 05:03:05] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
[2023-03-08 05:03:05] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 05:03:05] [INFO ] Invariant cache hit.
[2023-03-08 05:03:05] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 443 ms. Remains : 200/200 places, 148/148 transitions.
Treatment of property DES-PT-20b-LTLFireability-04 finished in 5111 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 17 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 05:03:05] [INFO ] Computed 62 place invariants in 3 ms
[2023-03-08 05:03:06] [INFO ] Implicit Places using invariants in 133 ms returned []
[2023-03-08 05:03:06] [INFO ] Invariant cache hit.
[2023-03-08 05:03:06] [INFO ] Implicit Places using invariants and state equation in 289 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, 258/270 transitions.
Applied a total of 0 rules in 4 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 445 ms. Remains : 315/325 places, 258/270 transitions.
Stuttering acceptance computed with spot in 156 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 621 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.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.
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 50 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 05:03:06] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-08 05:03:06] [INFO ] Implicit Places using invariants in 118 ms returned []
[2023-03-08 05:03:06] [INFO ] Invariant cache hit.
[2023-03-08 05:03:06] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
[2023-03-08 05:03:06] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:03:06] [INFO ] Invariant cache hit.
[2023-03-08 05:03:06] [INFO ] Dead Transitions using invariants and state equation in 91 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 456 ms. Remains : 201/325 places, 149/270 transitions.
Stuttering acceptance computed with spot in 103 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 4643 reset in 283 ms.
Product exploration explored 100000 steps with 4636 reset in 256 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 209 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 22 ms :[(NOT p1)]
Finished random walk after 9 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
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 251 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 27 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 9 ms. Remains 201 /201 variables (removed 0) and now considering 149/149 (removed 0) transitions.
[2023-03-08 05:03:08] [INFO ] Invariant cache hit.
[2023-03-08 05:03:08] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-08 05:03:08] [INFO ] Invariant cache hit.
[2023-03-08 05:03:08] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
[2023-03-08 05:03:08] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:03:08] [INFO ] Invariant cache hit.
[2023-03-08 05:03:08] [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 381 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 117 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 22 ms :[(NOT p1)]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
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 148 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
Product exploration explored 100000 steps with 4624 reset in 196 ms.
Product exploration explored 100000 steps with 4595 reset in 219 ms.
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 7 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 05:03:09] [INFO ] Computed 58 place invariants in 4 ms
[2023-03-08 05:03:09] [INFO ] Implicit Places using invariants in 119 ms returned []
[2023-03-08 05:03:09] [INFO ] Invariant cache hit.
[2023-03-08 05:03:09] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
[2023-03-08 05:03:09] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 05:03:09] [INFO ] Invariant cache hit.
[2023-03-08 05:03:09] [INFO ] Dead Transitions using invariants and state equation in 95 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 413 ms. Remains : 200/201 places, 148/149 transitions.
Treatment of property DES-PT-20b-LTLFireability-07 finished in 3328 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 14 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 05:03:09] [INFO ] Computed 62 place invariants in 3 ms
[2023-03-08 05:03:09] [INFO ] Implicit Places using invariants in 128 ms returned []
[2023-03-08 05:03:09] [INFO ] Invariant cache hit.
[2023-03-08 05:03:10] [INFO ] Implicit Places using invariants and state equation in 361 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 491 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 5 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 510 ms. Remains : 315/325 places, 257/270 transitions.
Stuttering acceptance computed with spot in 221 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 191 steps with 0 reset in 0 ms.
FORMULA DES-PT-20b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20b-LTLFireability-08 finished in 746 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 25 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 05:03:10] [INFO ] Computed 62 place invariants in 6 ms
[2023-03-08 05:03:10] [INFO ] Implicit Places using invariants in 127 ms returned []
[2023-03-08 05:03:10] [INFO ] Invariant cache hit.
[2023-03-08 05:03:11] [INFO ] Implicit Places using invariants and state equation in 299 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 429 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 7 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 461 ms. Remains : 315/325 places, 258/270 transitions.
Stuttering acceptance computed with spot in 250 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 1 ms.
FORMULA DES-PT-20b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20b-LTLFireability-09 finished in 735 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 26 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 05:03:11] [INFO ] Computed 62 place invariants in 6 ms
[2023-03-08 05:03:11] [INFO ] Implicit Places using invariants in 138 ms returned []
[2023-03-08 05:03:11] [INFO ] Invariant cache hit.
[2023-03-08 05:03:11] [INFO ] Implicit Places using invariants and state equation in 306 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 451 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 482 ms. Remains : 315/325 places, 257/270 transitions.
Stuttering acceptance computed with spot in 211 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 33317 reset in 248 ms.
Product exploration explored 100000 steps with 33239 reset in 248 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 1297 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 187 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 87 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 12) seen :11
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 257 rows 315 cols
[2023-03-08 05:03:14] [INFO ] Computed 61 place invariants in 4 ms
[2023-03-08 05:03:14] [INFO ] [Real]Absence check using 32 positive place invariants in 7 ms returned sat
[2023-03-08 05:03:14] [INFO ] [Real]Absence check using 32 positive and 29 generalized place invariants in 20 ms returned sat
[2023-03-08 05:03:14] [INFO ] After 119ms 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 1 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 1610 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 294 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 177 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 11 ms. Remains 315 /315 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2023-03-08 05:03:16] [INFO ] Invariant cache hit.
[2023-03-08 05:03:16] [INFO ] Implicit Places using invariants in 125 ms returned []
[2023-03-08 05:03:16] [INFO ] Invariant cache hit.
[2023-03-08 05:03:16] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
[2023-03-08 05:03:16] [INFO ] Invariant cache hit.
[2023-03-08 05:03:16] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 606 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.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 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 995 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 178 ms :[(AND (NOT p0) (NOT p2) p4), p4, (AND (NOT p0) (NOT p2) p4), (AND (NOT p0) (NOT p2))]
Finished random walk after 987 steps, including 7 resets, run visited all 8 properties in 9 ms. (steps per millisecond=109 )
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 1066 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 189 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 203 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 175 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 33200 reset in 231 ms.
Product exploration explored 100000 steps with 33328 reset in 233 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 168 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 1 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 50 ms. Remains 294 /315 variables (removed 21) and now considering 260/257 (removed -3) transitions.
[2023-03-08 05:03:20] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 260 rows 294 cols
[2023-03-08 05:03:20] [INFO ] Computed 59 place invariants in 2 ms
[2023-03-08 05:03:20] [INFO ] Dead Transitions using invariants and state equation in 135 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 198 ms. Remains : 294/315 places, 260/257 transitions.
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 6 ms. Remains 315 /315 variables (removed 0) and now considering 257/257 (removed 0) transitions.
// Phase 1: matrix 257 rows 315 cols
[2023-03-08 05:03:20] [INFO ] Computed 61 place invariants in 5 ms
[2023-03-08 05:03:20] [INFO ] Implicit Places using invariants in 132 ms returned []
[2023-03-08 05:03:20] [INFO ] Invariant cache hit.
[2023-03-08 05:03:21] [INFO ] Implicit Places using invariants and state equation in 347 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
[2023-03-08 05:03:21] [INFO ] Invariant cache hit.
[2023-03-08 05:03:21] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 637 ms. Remains : 315/315 places, 257/257 transitions.
Treatment of property DES-PT-20b-LTLFireability-10 finished in 10125 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 05:03:21] [INFO ] Computed 62 place invariants in 4 ms
[2023-03-08 05:03:21] [INFO ] Implicit Places using invariants in 136 ms returned []
[2023-03-08 05:03:21] [INFO ] Invariant cache hit.
[2023-03-08 05:03:21] [INFO ] Implicit Places using invariants and state equation in 321 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 459 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 8 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 491 ms. Remains : 314/325 places, 255/270 transitions.
Stuttering acceptance computed with spot in 117 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 92 steps with 0 reset in 0 ms.
FORMULA DES-PT-20b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20b-LTLFireability-11 finished in 631 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 20 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 05:03:22] [INFO ] Computed 62 place invariants in 7 ms
[2023-03-08 05:03:22] [INFO ] Implicit Places using invariants in 140 ms returned []
[2023-03-08 05:03:22] [INFO ] Invariant cache hit.
[2023-03-08 05:03:22] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
[2023-03-08 05:03:22] [INFO ] Invariant cache hit.
[2023-03-08 05:03:22] [INFO ] Dead Transitions using invariants and state equation in 127 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 566 ms. Remains : 314/325 places, 254/270 transitions.
Stuttering acceptance computed with spot in 159 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 746 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 37 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 05:03:22] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 05:03:22] [INFO ] Implicit Places using invariants in 107 ms returned []
[2023-03-08 05:03:22] [INFO ] Invariant cache hit.
[2023-03-08 05:03:23] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
[2023-03-08 05:03:23] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:03:23] [INFO ] Invariant cache hit.
[2023-03-08 05:03:23] [INFO ] Dead Transitions using invariants and state equation in 89 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 403 ms. Remains : 199/325 places, 147/270 transitions.
Stuttering acceptance computed with spot in 36 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 16 steps with 0 reset in 0 ms.
FORMULA DES-PT-20b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20b-LTLFireability-15 finished in 455 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)))))'
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))'
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)))))'
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)))))'
Found a Lengthening insensitive property : DES-PT-20b-LTLFireability-10
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))]
Support contains 12 out of 325 places. Attempting structural reductions.
Starting structural reductions in LI_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 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 318 transition count 252
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 304 transition count 252
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 29 place count 304 transition count 243
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 47 place count 295 transition count 243
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 53 place count 289 transition count 237
Iterating global reduction 2 with 6 rules applied. Total rules applied 59 place count 289 transition count 237
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 61 place count 289 transition count 235
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 63 place count 288 transition count 234
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 65 place count 286 transition count 232
Iterating global reduction 4 with 2 rules applied. Total rules applied 67 place count 286 transition count 232
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 69 place count 286 transition count 230
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 5 with 132 rules applied. Total rules applied 201 place count 220 transition count 164
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 207 place count 217 transition count 167
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 209 place count 215 transition count 165
Applied a total of 209 rules in 31 ms. Remains 215 /325 variables (removed 110) and now considering 165/270 (removed 105) transitions.
// Phase 1: matrix 165 rows 215 cols
[2023-03-08 05:03:23] [INFO ] Computed 59 place invariants in 6 ms
[2023-03-08 05:03:23] [INFO ] Implicit Places using invariants in 115 ms returned []
[2023-03-08 05:03:23] [INFO ] Invariant cache hit.
[2023-03-08 05:03:24] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
[2023-03-08 05:03:24] [INFO ] Invariant cache hit.
[2023-03-08 05:03:24] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 215/325 places, 165/270 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 417 ms. Remains : 215/325 places, 165/270 transitions.
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 s84 1) (EQ s87 1) (EQ s93 1) (EQ s94 1) (EQ s99 1) (EQ s103 1)), p2:(AND (EQ s14 1) (EQ s125 1)), p0:(EQ s83 1), p4:(AND (EQ s97 1) (EQ s189 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 8042 steps with 2662 reset in 20 ms.
Treatment of property DES-PT-20b-LTLFireability-10 finished in 785 ms.
FORMULA DES-PT-20b-LTLFireability-10 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2023-03-08 05:03:24] [INFO ] Flatten gal took : 15 ms
[2023-03-08 05:03:24] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-08 05:03:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 325 places, 270 transitions and 883 arcs took 3 ms.
Total runtime 41887 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DES-PT-20b
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/369
LTLFireability

FORMULA DES-PT-20b-LTLFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-20b-LTLFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678251905425

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/369/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/369/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/369/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:436
lola: rewrite Frontend/Parser/formula_rewrite.k:521
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 12 (type EXCL) for 3 DES-PT-20b-LTLFireability-04
lola: time limit : 900 sec
lola: memory limit: 32 pages
lola: FINISHED task # 12 (type EXCL) for DES-PT-20b-LTLFireability-04
lola: result : false
lola: markings : 2
lola: fired transitions : 1
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 DES-PT-20b-LTLFireability-01
lola: time limit : 1200 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for DES-PT-20b-LTLFireability-01
lola: result : true
lola: markings : 4124
lola: fired transitions : 9786
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 10 (type EXCL) for 9 DES-PT-20b-LTLFireability-10
lola: time limit : 1800 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-20b-LTLFireability-01: LTL true LTL model checker
DES-PT-20b-LTLFireability-04: F true state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-20b-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
DES-PT-20b-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 5/1800 4/32 DES-PT-20b-LTLFireability-10 449004 m, 89800 m/sec, 2432483 t fired, .

Time elapsed: 5 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-20b-LTLFireability-01: LTL true LTL model checker
DES-PT-20b-LTLFireability-04: F true state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-20b-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
DES-PT-20b-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 10/1800 7/32 DES-PT-20b-LTLFireability-10 817092 m, 73617 m/sec, 4902088 t fired, .

Time elapsed: 10 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-20b-LTLFireability-01: LTL true LTL model checker
DES-PT-20b-LTLFireability-04: F true state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-20b-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
DES-PT-20b-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 15/1800 8/32 DES-PT-20b-LTLFireability-10 994303 m, 35442 m/sec, 7445043 t fired, .

Time elapsed: 15 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-20b-LTLFireability-01: LTL true LTL model checker
DES-PT-20b-LTLFireability-04: F true state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-20b-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
DES-PT-20b-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 20/1800 9/32 DES-PT-20b-LTLFireability-10 1225624 m, 46264 m/sec, 10001518 t fired, .

Time elapsed: 20 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-20b-LTLFireability-01: LTL true LTL model checker
DES-PT-20b-LTLFireability-04: F true state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-20b-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
DES-PT-20b-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 25/1800 11/32 DES-PT-20b-LTLFireability-10 1472328 m, 49340 m/sec, 12503863 t fired, .

Time elapsed: 25 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-20b-LTLFireability-01: LTL true LTL model checker
DES-PT-20b-LTLFireability-04: F true state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-20b-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
DES-PT-20b-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 30/1800 12/32 DES-PT-20b-LTLFireability-10 1620951 m, 29724 m/sec, 15059605 t fired, .

Time elapsed: 30 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-20b-LTLFireability-01: LTL true LTL model checker
DES-PT-20b-LTLFireability-04: F true state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-20b-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
DES-PT-20b-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 35/1800 13/32 DES-PT-20b-LTLFireability-10 1740339 m, 23877 m/sec, 17650636 t fired, .

Time elapsed: 35 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-20b-LTLFireability-01: LTL true LTL model checker
DES-PT-20b-LTLFireability-04: F true state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-20b-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
DES-PT-20b-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 40/1800 14/32 DES-PT-20b-LTLFireability-10 1888748 m, 29681 m/sec, 20247756 t fired, .

Time elapsed: 40 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-20b-LTLFireability-01: LTL true LTL model checker
DES-PT-20b-LTLFireability-04: F true state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-20b-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
DES-PT-20b-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 45/1800 15/32 DES-PT-20b-LTLFireability-10 2115292 m, 45308 m/sec, 22877705 t fired, .

Time elapsed: 45 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-20b-LTLFireability-01: LTL true LTL model checker
DES-PT-20b-LTLFireability-04: F true state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-20b-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
DES-PT-20b-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 50/1800 17/32 DES-PT-20b-LTLFireability-10 2324330 m, 41807 m/sec, 25426586 t fired, .

Time elapsed: 50 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-20b-LTLFireability-01: LTL true LTL model checker
DES-PT-20b-LTLFireability-04: F true state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-20b-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
DES-PT-20b-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 55/1800 18/32 DES-PT-20b-LTLFireability-10 2470958 m, 29325 m/sec, 27984467 t fired, .

Time elapsed: 55 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-20b-LTLFireability-01: LTL true LTL model checker
DES-PT-20b-LTLFireability-04: F true state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-20b-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
DES-PT-20b-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 60/1800 19/32 DES-PT-20b-LTLFireability-10 2590205 m, 23849 m/sec, 30583623 t fired, .

Time elapsed: 60 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-20b-LTLFireability-01: LTL true LTL model checker
DES-PT-20b-LTLFireability-04: F true state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-20b-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
DES-PT-20b-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 65/1800 20/32 DES-PT-20b-LTLFireability-10 2739012 m, 29761 m/sec, 33184043 t fired, .

Time elapsed: 65 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-20b-LTLFireability-01: LTL true LTL model checker
DES-PT-20b-LTLFireability-04: F true state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-20b-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
DES-PT-20b-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 70/1800 23/32 DES-PT-20b-LTLFireability-10 3175603 m, 87318 m/sec, 35844974 t fired, .

Time elapsed: 70 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-20b-LTLFireability-01: LTL true LTL model checker
DES-PT-20b-LTLFireability-04: F true state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-20b-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
DES-PT-20b-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 75/1800 26/32 DES-PT-20b-LTLFireability-10 3613318 m, 87543 m/sec, 38477596 t fired, .

Time elapsed: 75 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-20b-LTLFireability-01: LTL true LTL model checker
DES-PT-20b-LTLFireability-04: F true state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-20b-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
DES-PT-20b-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 80/1800 29/32 DES-PT-20b-LTLFireability-10 4006780 m, 78692 m/sec, 41095426 t fired, .

Time elapsed: 80 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-20b-LTLFireability-01: LTL true LTL model checker
DES-PT-20b-LTLFireability-04: F true state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-20b-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
DES-PT-20b-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 85/1800 32/32 DES-PT-20b-LTLFireability-10 4418217 m, 82287 m/sec, 43751665 t fired, .

Time elapsed: 85 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 10 (type EXCL) for DES-PT-20b-LTLFireability-10 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-20b-LTLFireability-01: LTL true LTL model checker
DES-PT-20b-LTLFireability-04: F true state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-20b-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
DES-PT-20b-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 90 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 7 (type EXCL) for 6 DES-PT-20b-LTLFireability-07
lola: time limit : 3510 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-20b-LTLFireability-01: LTL true LTL model checker
DES-PT-20b-LTLFireability-04: F true state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-20b-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
DES-PT-20b-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 5/3510 18/32 DES-PT-20b-LTLFireability-07 2354670 m, 470934 m/sec, 2962393 t fired, .

Time elapsed: 95 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 7 (type EXCL) for DES-PT-20b-LTLFireability-07 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-20b-LTLFireability-01: LTL true LTL model checker
DES-PT-20b-LTLFireability-04: F true state space / EG

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-20b-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
DES-PT-20b-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 100 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: Portfolio finished: no open tasks 4

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-20b-LTLFireability-01: LTL true LTL model checker
DES-PT-20b-LTLFireability-04: F true state space / EG
DES-PT-20b-LTLFireability-07: LTL unknown AGGR
DES-PT-20b-LTLFireability-10: LTL unknown AGGR


Time elapsed: 100 secs. Pages in use: 32

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="lolaxred"
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 lolaxred"
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 r103-tall-167814478300436"
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 ;