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.r519-tall-167987245000228.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 EisenbergMcGuire-PT-04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r519-tall-167987245000228
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 7.3K Mar 23 15:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Mar 23 15:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 23 15:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Mar 23 15:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 11K Mar 23 15:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Mar 23 15:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Mar 23 15:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 23 15:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 255K Mar 31 16:48 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 EisenbergMcGuire-PT-04-LTLFireability-00
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-01
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-02
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-03
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-04
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-05
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-06
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-07
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-08
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-09
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-10
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-11
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-12
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-13
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-14
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1680818663840

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=EisenbergMcGuire-PT-04
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2023-04-06 22:04:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-06 22:04:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 22:04:25] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2023-04-06 22:04:25] [INFO ] Transformed 196 places.
[2023-04-06 22:04:25] [INFO ] Transformed 448 transitions.
[2023-04-06 22:04:25] [INFO ] Found NUPN structural information;
[2023-04-06 22:04:25] [INFO ] Parsed PT model containing 196 places and 448 transitions and 1952 arcs in 138 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA EisenbergMcGuire-PT-04-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-04-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-04-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 448/448 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 188 transition count 416
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 188 transition count 416
Applied a total of 16 rules in 30 ms. Remains 188 /196 variables (removed 8) and now considering 416/448 (removed 32) transitions.
[2023-04-06 22:04:25] [INFO ] Flow matrix only has 252 transitions (discarded 164 similar events)
// Phase 1: matrix 252 rows 188 cols
[2023-04-06 22:04:25] [INFO ] Computed 13 invariants in 13 ms
[2023-04-06 22:04:26] [INFO ] Implicit Places using invariants in 206 ms returned []
[2023-04-06 22:04:26] [INFO ] Flow matrix only has 252 transitions (discarded 164 similar events)
[2023-04-06 22:04:26] [INFO ] Invariant cache hit.
[2023-04-06 22:04:26] [INFO ] State equation strengthened by 88 read => feed constraints.
[2023-04-06 22:04:26] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 468 ms to find 0 implicit places.
[2023-04-06 22:04:26] [INFO ] Flow matrix only has 252 transitions (discarded 164 similar events)
[2023-04-06 22:04:26] [INFO ] Invariant cache hit.
[2023-04-06 22:04:26] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 188/196 places, 416/448 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 681 ms. Remains : 188/196 places, 416/448 transitions.
Support contains 41 out of 188 places after structural reductions.
[2023-04-06 22:04:26] [INFO ] Flatten gal took : 55 ms
[2023-04-06 22:04:26] [INFO ] Flatten gal took : 24 ms
[2023-04-06 22:04:26] [INFO ] Input system was already deterministic with 416 transitions.
Support contains 40 out of 188 places (down from 41) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 448 ms. (steps per millisecond=22 ) properties (out of 30) seen :8
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 21) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :1
Running SMT prover for 19 properties.
[2023-04-06 22:04:27] [INFO ] Flow matrix only has 252 transitions (discarded 164 similar events)
[2023-04-06 22:04:27] [INFO ] Invariant cache hit.
[2023-04-06 22:04:28] [INFO ] After 930ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2023-04-06 22:04:28] [INFO ] [Nat]Absence check using 9 positive place invariants in 19 ms returned sat
[2023-04-06 22:04:28] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-06 22:04:28] [INFO ] After 266ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2023-04-06 22:04:28] [INFO ] State equation strengthened by 88 read => feed constraints.
[2023-04-06 22:04:29] [INFO ] After 245ms SMT Verify possible using 88 Read/Feed constraints in natural domain returned unsat :0 sat :19
[2023-04-06 22:04:29] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 7 ms to minimize.
[2023-04-06 22:04:29] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 1 ms to minimize.
[2023-04-06 22:04:29] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 1 ms to minimize.
[2023-04-06 22:04:29] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 2 ms to minimize.
[2023-04-06 22:04:29] [INFO ] Deduced a trap composed of 53 places in 102 ms of which 1 ms to minimize.
[2023-04-06 22:04:29] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 1 ms to minimize.
[2023-04-06 22:04:29] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 708 ms
[2023-04-06 22:04:30] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 0 ms to minimize.
[2023-04-06 22:04:30] [INFO ] Deduced a trap composed of 53 places in 57 ms of which 0 ms to minimize.
[2023-04-06 22:04:30] [INFO ] Deduced a trap composed of 52 places in 66 ms of which 0 ms to minimize.
[2023-04-06 22:04:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 232 ms
[2023-04-06 22:04:30] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2023-04-06 22:04:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2023-04-06 22:04:30] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 0 ms to minimize.
[2023-04-06 22:04:30] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2023-04-06 22:04:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 132 ms
[2023-04-06 22:04:30] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-04-06 22:04:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2023-04-06 22:04:30] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2023-04-06 22:04:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2023-04-06 22:04:30] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2023-04-06 22:04:30] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 1 ms to minimize.
[2023-04-06 22:04:30] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 0 ms to minimize.
[2023-04-06 22:04:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 270 ms
[2023-04-06 22:04:31] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 0 ms to minimize.
[2023-04-06 22:04:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2023-04-06 22:04:31] [INFO ] After 2140ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :19
Attempting to minimize the solution found.
Minimization took 268 ms.
[2023-04-06 22:04:31] [INFO ] After 2989ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :19
Fused 19 Parikh solutions to 18 different solutions.
Parikh walk visited 0 properties in 298 ms.
Support contains 27 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 416/416 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 188 transition count 414
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 186 transition count 414
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 4 place count 186 transition count 367
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 98 place count 139 transition count 367
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 99 place count 138 transition count 363
Iterating global reduction 2 with 1 rules applied. Total rules applied 100 place count 138 transition count 363
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
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 124 place count 126 transition count 351
Applied a total of 124 rules in 45 ms. Remains 126 /188 variables (removed 62) and now considering 351/416 (removed 65) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 126/188 places, 351/416 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Interrupted probabilistic random walk after 710825 steps, run timeout after 3001 ms. (steps per millisecond=236 ) properties seen :{1=1, 2=1, 3=1, 4=1, 5=1, 6=1, 7=1, 8=1, 9=1, 10=1, 11=1, 12=1, 13=1, 14=1, 15=1, 16=1, 17=1, 18=1}
Probabilistic random walk after 710825 steps, saw 143843 distinct states, run finished after 3002 ms. (steps per millisecond=236 ) properties seen :18
Running SMT prover for 1 properties.
[2023-04-06 22:04:35] [INFO ] Flow matrix only has 187 transitions (discarded 164 similar events)
// Phase 1: matrix 187 rows 126 cols
[2023-04-06 22:04:35] [INFO ] Computed 13 invariants in 4 ms
[2023-04-06 22:04:35] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:04:35] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-04-06 22:04:35] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 2 ms returned sat
[2023-04-06 22:04:35] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:04:35] [INFO ] State equation strengthened by 85 read => feed constraints.
[2023-04-06 22:04:35] [INFO ] After 19ms SMT Verify possible using 85 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:04:35] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 0 ms to minimize.
[2023-04-06 22:04:35] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2023-04-06 22:04:35] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2023-04-06 22:04:35] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2023-04-06 22:04:35] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2023-04-06 22:04:35] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 260 ms
[2023-04-06 22:04:35] [INFO ] After 292ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-04-06 22:04:35] [INFO ] After 392ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 351/351 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 126 transition count 344
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 119 transition count 344
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 116 transition count 332
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 116 transition count 332
Applied a total of 20 rules in 24 ms. Remains 116 /126 variables (removed 10) and now considering 332/351 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 116/126 places, 332/351 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 669718 steps, run visited all 1 properties in 1346 ms. (steps per millisecond=497 )
Probabilistic random walk after 669718 steps, saw 135261 distinct states, run finished after 1346 ms. (steps per millisecond=497 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
FORMULA EisenbergMcGuire-PT-04-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA EisenbergMcGuire-PT-04-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)||G(p1)||G(!p0))))'
Support contains 4 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 416/416 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 184 transition count 400
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 184 transition count 400
Applied a total of 8 rules in 11 ms. Remains 184 /188 variables (removed 4) and now considering 400/416 (removed 16) transitions.
[2023-04-06 22:04:37] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
// Phase 1: matrix 236 rows 184 cols
[2023-04-06 22:04:37] [INFO ] Computed 13 invariants in 4 ms
[2023-04-06 22:04:37] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-04-06 22:04:37] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2023-04-06 22:04:37] [INFO ] Invariant cache hit.
[2023-04-06 22:04:37] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-04-06 22:04:37] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
[2023-04-06 22:04:37] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2023-04-06 22:04:37] [INFO ] Invariant cache hit.
[2023-04-06 22:04:37] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 184/188 places, 400/416 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 477 ms. Remains : 184/188 places, 400/416 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 558 ms :[true, (NOT p0), false, false, (AND (NOT p1) (NOT p0)), p0, (AND p0 (NOT p1)), (NOT p1), false, false]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 1}, { cond=(AND p1 p0), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 8}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 7}], [{ cond=p0, acceptance={} source=5 dest: 0}, { cond=(NOT p0), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=6 dest: 6}, { cond=(AND p1 p0), acceptance={} source=6 dest: 7}], [{ cond=(NOT p1), acceptance={} source=7 dest: 0}, { cond=p1, acceptance={} source=7 dest: 7}], [{ cond=(NOT p0), acceptance={} source=8 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=9 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=9 dest: 6}]], initial=2, aps=[p0:(AND (EQ s6 1) (EQ s84 1)), p1:(OR (EQ s0 0) (EQ s6 0) (EQ s134 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 224 ms.
Product exploration explored 100000 steps with 0 reset in 164 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0))), (X (X (NOT p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 115 ms. Reduced automaton from 10 states, 20 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p1), (AND (NOT p1) p0), p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-04-06 22:04:39] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2023-04-06 22:04:39] [INFO ] Invariant cache hit.
[2023-04-06 22:04:39] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-06 22:04:39] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-04-06 22:04:39] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-06 22:04:39] [INFO ] After 67ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-06 22:04:39] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-04-06 22:04:39] [INFO ] After 37ms SMT Verify possible using 76 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-06 22:04:39] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2023-04-06 22:04:39] [INFO ] Deduced a trap composed of 51 places in 57 ms of which 0 ms to minimize.
[2023-04-06 22:04:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 157 ms
[2023-04-06 22:04:39] [INFO ] After 245ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-04-06 22:04:39] [INFO ] After 407ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 4 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 400/400 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 184 transition count 396
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 180 transition count 396
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 8 place count 180 transition count 345
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 110 place count 129 transition count 345
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
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 134 place count 117 transition count 333
Applied a total of 134 rules in 38 ms. Remains 117 /184 variables (removed 67) and now considering 333/400 (removed 67) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 117/184 places, 333/400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Finished probabilistic random walk after 728431 steps, run visited all 3 properties in 2516 ms. (steps per millisecond=289 )
Probabilistic random walk after 728431 steps, saw 146957 distinct states, run finished after 2517 ms. (steps per millisecond=289 ) properties seen :3
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0))), (X (X (NOT p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT p1)), (F (AND p0 p1)), (F (AND p0 (NOT p1)))]
Property proved to be false thanks to negative knowledge :(F (AND p0 (NOT p1)))
Knowledge based reduction with 8 factoid took 247 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-04-LTLFireability-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-02 finished in 5598 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 416/416 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 188 transition count 412
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 184 transition count 412
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 52 Pre rules applied. Total rules applied 8 place count 184 transition count 360
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 112 place count 132 transition count 360
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 115 place count 129 transition count 348
Iterating global reduction 2 with 3 rules applied. Total rules applied 118 place count 129 transition count 348
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
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 142 place count 117 transition count 336
Applied a total of 142 rules in 27 ms. Remains 117 /188 variables (removed 71) and now considering 336/416 (removed 80) transitions.
[2023-04-06 22:04:42] [INFO ] Flow matrix only has 172 transitions (discarded 164 similar events)
// Phase 1: matrix 172 rows 117 cols
[2023-04-06 22:04:42] [INFO ] Computed 13 invariants in 1 ms
[2023-04-06 22:04:42] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-04-06 22:04:42] [INFO ] Flow matrix only has 172 transitions (discarded 164 similar events)
[2023-04-06 22:04:42] [INFO ] Invariant cache hit.
[2023-04-06 22:04:42] [INFO ] State equation strengthened by 79 read => feed constraints.
[2023-04-06 22:04:43] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
[2023-04-06 22:04:43] [INFO ] Redundant transitions in 18 ms returned []
[2023-04-06 22:04:43] [INFO ] Flow matrix only has 172 transitions (discarded 164 similar events)
[2023-04-06 22:04:43] [INFO ] Invariant cache hit.
[2023-04-06 22:04:43] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 117/188 places, 336/416 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 432 ms. Remains : 117/188 places, 336/416 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s2 0) (EQ s40 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 134 ms.
Product exploration explored 100000 steps with 0 reset in 130 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 64 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 246678 steps, run visited all 1 properties in 471 ms. (steps per millisecond=523 )
Probabilistic random walk after 246678 steps, saw 52317 distinct states, run finished after 471 ms. (steps per millisecond=523 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 102 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 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Support contains 2 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 336/336 transitions.
Applied a total of 0 rules in 14 ms. Remains 117 /117 variables (removed 0) and now considering 336/336 (removed 0) transitions.
[2023-04-06 22:04:44] [INFO ] Flow matrix only has 172 transitions (discarded 164 similar events)
[2023-04-06 22:04:44] [INFO ] Invariant cache hit.
[2023-04-06 22:04:44] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-04-06 22:04:44] [INFO ] Flow matrix only has 172 transitions (discarded 164 similar events)
[2023-04-06 22:04:44] [INFO ] Invariant cache hit.
[2023-04-06 22:04:44] [INFO ] State equation strengthened by 79 read => feed constraints.
[2023-04-06 22:04:44] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
[2023-04-06 22:04:44] [INFO ] Redundant transitions in 6 ms returned []
[2023-04-06 22:04:44] [INFO ] Flow matrix only has 172 transitions (discarded 164 similar events)
[2023-04-06 22:04:44] [INFO ] Invariant cache hit.
[2023-04-06 22:04:44] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 423 ms. Remains : 117/117 places, 336/336 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 246678 steps, run visited all 1 properties in 474 ms. (steps per millisecond=520 )
Probabilistic random walk after 246678 steps, saw 52317 distinct states, run finished after 474 ms. (steps per millisecond=520 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 112 ms.
Product exploration explored 100000 steps with 0 reset in 122 ms.
Support contains 2 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 336/336 transitions.
Applied a total of 0 rules in 18 ms. Remains 117 /117 variables (removed 0) and now considering 336/336 (removed 0) transitions.
[2023-04-06 22:04:45] [INFO ] Flow matrix only has 172 transitions (discarded 164 similar events)
[2023-04-06 22:04:45] [INFO ] Invariant cache hit.
[2023-04-06 22:04:45] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-04-06 22:04:45] [INFO ] Flow matrix only has 172 transitions (discarded 164 similar events)
[2023-04-06 22:04:45] [INFO ] Invariant cache hit.
[2023-04-06 22:04:45] [INFO ] State equation strengthened by 79 read => feed constraints.
[2023-04-06 22:04:46] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
[2023-04-06 22:04:46] [INFO ] Redundant transitions in 6 ms returned []
[2023-04-06 22:04:46] [INFO ] Flow matrix only has 172 transitions (discarded 164 similar events)
[2023-04-06 22:04:46] [INFO ] Invariant cache hit.
[2023-04-06 22:04:46] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 433 ms. Remains : 117/117 places, 336/336 transitions.
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-03 finished in 3525 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0) U G(p1)) U X((G((p3 U p4))&&p2))))'
Support contains 9 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 416/416 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 184 transition count 400
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 184 transition count 400
Applied a total of 8 rules in 10 ms. Remains 184 /188 variables (removed 4) and now considering 400/416 (removed 16) transitions.
[2023-04-06 22:04:46] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
// Phase 1: matrix 236 rows 184 cols
[2023-04-06 22:04:46] [INFO ] Computed 13 invariants in 2 ms
[2023-04-06 22:04:46] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-04-06 22:04:46] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2023-04-06 22:04:46] [INFO ] Invariant cache hit.
[2023-04-06 22:04:46] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-04-06 22:04:46] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
[2023-04-06 22:04:46] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2023-04-06 22:04:46] [INFO ] Invariant cache hit.
[2023-04-06 22:04:46] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 184/188 places, 400/416 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 498 ms. Remains : 184/188 places, 400/416 transitions.
Stuttering acceptance computed with spot in 959 ms :[(OR (NOT p4) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p4))), (OR (NOT p2) (NOT p4)), (OR (AND (NOT p0) (NOT p1) (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p2))), true, (NOT p4), (NOT p4), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p4)), (AND (NOT p0) (NOT p4)), (AND (NOT p1) (NOT p3) (NOT p4)), (NOT p4), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p4)), (AND (NOT p0) (NOT p1) (NOT p4)), (NOT p4), (AND (NOT p1) p0), (AND p0 (NOT p1) (NOT p4)), (AND p0 (NOT p1) (NOT p4))]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p4) (NOT p3))), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) p2 (NOT p4) p3), acceptance={} source=1 dest: 5}, { cond=(OR (AND (NOT p0) p2 p4) (AND (NOT p0) p2 p3)), acceptance={} source=1 dest: 6}], [{ cond=(OR (NOT p2) (AND (NOT p4) (NOT p3))), acceptance={0} source=2 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p4) (NOT p3))), acceptance={} source=2 dest: 7}, { cond=(OR (NOT p2) (AND (NOT p4) (NOT p3))), acceptance={} source=2 dest: 8}, { cond=(OR (AND (NOT p1) p2 p4) (AND (NOT p1) p2 p3)), acceptance={} source=2 dest: 10}, { cond=(OR (AND p2 p4) (AND p2 p3)), acceptance={} source=2 dest: 12}, { cond=(OR (AND p1 (NOT p2)) (AND p1 (NOT p4) (NOT p3))), acceptance={} source=2 dest: 13}, { cond=(OR (AND p1 p2 p4) (AND p1 p2 p3)), acceptance={} source=2 dest: 15}, { cond=(AND p2 (NOT p4) p3), acceptance={0} source=2 dest: 16}], [{ cond=(OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0) (NOT p4) (NOT p3))), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p0) p2 (NOT p4) p3), acceptance={} source=3 dest: 5}, { cond=(OR (AND (NOT p1) (NOT p0) p2 p4) (AND (NOT p1) (NOT p0) p2 p3)), acceptance={} source=3 dest: 6}, { cond=(OR (AND p1 (NOT p0) (NOT p2)) (AND p1 (NOT p0) (NOT p4) (NOT p3))), acceptance={} source=3 dest: 17}, { cond=(OR (AND p1 (NOT p0) p2 p4) (AND p1 (NOT p0) p2 p3)), acceptance={} source=3 dest: 19}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p4) (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p4) p3), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p4) (NOT p3)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p4) p3), acceptance={} source=6 dest: 5}, { cond=(OR p4 p3), acceptance={} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 4}], [{ cond=(NOT p1), acceptance={} source=8 dest: 7}, { cond=p1, acceptance={} source=8 dest: 8}, { cond=(NOT p1), acceptance={0} source=8 dest: 8}, { cond=p1, acceptance={} source=8 dest: 13}], [{ cond=(AND (NOT p0) (NOT p4) (NOT p3)), acceptance={} source=9 dest: 4}, { cond=(AND (NOT p0) (NOT p4) p3), acceptance={} source=9 dest: 5}], [{ cond=(AND (NOT p0) (NOT p4) (NOT p3)), acceptance={} source=10 dest: 4}, { cond=(AND (NOT p0) (NOT p4) p3), acceptance={} source=10 dest: 5}, { cond=(OR (AND (NOT p0) p4) (AND (NOT p0) p3)), acceptance={} source=10 dest: 6}], [{ cond=(AND (NOT p1) (NOT p4) (NOT p3)), acceptance={} source=11 dest: 7}, { cond=(AND (NOT p4) (NOT p3)), acceptance={} source=11 dest: 8}, { cond=(AND p1 (NOT p4) (NOT p3)), acceptance={} source=11 dest: 13}], [{ cond=(AND (NOT p4) (NOT p3)), acceptance={0} source=12 dest: 2}, { cond=(AND (NOT p1) (NOT p4) (NOT p3)), acceptance={} source=12 dest: 7}, { cond=(AND (NOT p4) (NOT p3)), acceptance={} source=12 dest: 8}, { cond=(OR (AND (NOT p1) p4) (AND (NOT p1) p3)), acceptance={} source=12 dest: 10}, { cond=(OR p4 p3), acceptance={} source=12 dest: 12}, { cond=(AND p1 (NOT p4) (NOT p3)), acceptance={} source=12 dest: 13}, { cond=(OR (AND p1 p4) (AND p1 p3)), acceptance={} source=12 dest: 15}, { cond=(AND (NOT p4) p3), acceptance={0} source=12 dest: 16}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=13 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=13 dest: 17}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p4) (NOT p3)), acceptance={} source=14 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p4) p3), acceptance={} source=14 dest: 5}, { cond=(AND p1 (NOT p0) (NOT p4) (NOT p3)), acceptance={} source=14 dest: 17}, { cond=(AND p1 (NOT p0) (NOT p4) p3), acceptance={} source=14 dest: 18}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p4) (NOT p3)), acceptance={} source=15 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p4) p3), acceptance={} source=15 dest: 5}, { cond=(OR (AND (NOT p1) (NOT p0) p4) (AND (NOT p1) (NOT p0) p3)), acceptance={} source=15 dest: 6}, { cond=(AND p1 (NOT p0) (NOT p4) (NOT p3)), acceptance={} source=15 dest: 17}, { cond=(OR (AND p1 (NOT p0) p4) (AND p1 (NOT p0) p3)), acceptance={} source=15 dest: 19}], [{ cond=(AND (NOT p1) (NOT p4) (NOT p3)), acceptance={} source=16 dest: 1}, { cond=(AND (NOT p4) (NOT p3)), acceptance={0} source=16 dest: 2}, { cond=(AND p1 (NOT p4) (NOT p3)), acceptance={} source=16 dest: 3}, { cond=(AND (NOT p1) (NOT p4) p3), acceptance={} source=16 dest: 9}, { cond=(AND (NOT p4) p3), acceptance={} source=16 dest: 11}, { cond=(AND p1 (NOT p4) p3), acceptance={} source=16 dest: 14}, { cond=(AND (NOT p4) p3), acceptance={0} source=16 dest: 16}], [{ cond=(AND (NOT p1) p0), acceptance={} source=17 dest: 4}, { cond=(AND p1 p0), acceptance={} source=17 dest: 17}], [{ cond=(AND (NOT p1) p0 (NOT p4) (NOT p3)), acceptance={} source=18 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p4) p3), acceptance={} source=18 dest: 5}, { cond=(AND p1 p0 (NOT p4) (NOT p3)), acceptance={} source=18 dest: 17}, { cond=(AND p1 p0 (NOT p4) p3), acceptance={} source=18 dest: 18}], [{ cond=(AND (NOT p1) p0 (NOT p4) (NOT p3)), acceptance={} source=19 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p4) p3), acceptance={} source=19 dest: 5}, { cond=(OR (AND (NOT p1) p0 p4) (AND (NOT p1) p0 p3)), acceptance={} source=19 dest: 6}, { cond=(AND p1 p0 (NOT p4) (NOT p3)), acceptance={} source=19 dest: 17}, { cond=(OR (AND p1 p0 p4) (AND p1 p0 p3)), acceptance={} source=19 dest: 19}]], initial=0, aps=[p1:(AND (EQ s3 1) (EQ s15 1) (EQ s124 1)), p0:(AND (EQ s13 1) (EQ s147 1)), p2:(AND (EQ s3 1) (EQ s15 1) (EQ s124 1)), p4:(AND (EQ s0 1) (EQ s6 1) (EQ s12...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA EisenbergMcGuire-PT-04-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-04 finished in 1503 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0 U (G(!p0) U (X(F(p2))&&p1))))))'
Support contains 5 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 416/416 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 184 transition count 400
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 184 transition count 400
Applied a total of 8 rules in 12 ms. Remains 184 /188 variables (removed 4) and now considering 400/416 (removed 16) transitions.
[2023-04-06 22:04:47] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2023-04-06 22:04:47] [INFO ] Invariant cache hit.
[2023-04-06 22:04:47] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-04-06 22:04:47] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2023-04-06 22:04:47] [INFO ] Invariant cache hit.
[2023-04-06 22:04:48] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-04-06 22:04:48] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
[2023-04-06 22:04:48] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2023-04-06 22:04:48] [INFO ] Invariant cache hit.
[2023-04-06 22:04:48] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 184/188 places, 400/416 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 506 ms. Remains : 184/188 places, 400/416 transitions.
Stuttering acceptance computed with spot in 241 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), p0, (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2), true]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}, { cond=p1, acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}, { cond=p1, acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(AND (EQ s0 1) (EQ s5 1) (EQ s129 1)), p0:(AND (EQ s0 1) (EQ s5 1) (EQ s129 1)), p2:(AND (EQ s11 1) (EQ s78 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 123 ms.
Product exploration explored 100000 steps with 0 reset in 148 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (X (NOT p0))), true, (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 116 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter sensitive) to 11 states, 35 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 416 ms :[(OR (NOT p1) (NOT p2) p0), (OR (NOT p1) (NOT p2)), p0, (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2), true, false, false, (AND (NOT p0) p1 (NOT p2)), false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-04-06 22:04:49] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2023-04-06 22:04:49] [INFO ] Invariant cache hit.
[2023-04-06 22:04:49] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-04-06 22:04:49] [INFO ] [Real]Absence check using 9 positive and 4 generalized place invariants in 2 ms returned sat
[2023-04-06 22:04:50] [INFO ] After 152ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:4
[2023-04-06 22:04:50] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-04-06 22:04:50] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-06 22:04:50] [INFO ] After 91ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :4
[2023-04-06 22:04:50] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-04-06 22:04:50] [INFO ] After 65ms SMT Verify possible using 76 Read/Feed constraints in natural domain returned unsat :4 sat :4
[2023-04-06 22:04:50] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2023-04-06 22:04:50] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-04-06 22:04:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 109 ms
[2023-04-06 22:04:50] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2023-04-06 22:04:50] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2023-04-06 22:04:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 117 ms
[2023-04-06 22:04:50] [INFO ] After 352ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :4
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-04-06 22:04:50] [INFO ] After 561ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :4
Fused 8 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 17 ms.
Support contains 5 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 400/400 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 184 transition count 396
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 180 transition count 396
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 8 place count 180 transition count 345
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 110 place count 129 transition count 345
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
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 134 place count 117 transition count 333
Applied a total of 134 rules in 18 ms. Remains 117 /184 variables (removed 67) and now considering 333/400 (removed 67) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 117/184 places, 333/400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Finished probabilistic random walk after 286415 steps, run visited all 4 properties in 1229 ms. (steps per millisecond=233 )
Probabilistic random walk after 286415 steps, saw 59455 distinct states, run finished after 1230 ms. (steps per millisecond=232 ) properties seen :4
Parikh walk visited 0 properties in 0 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (X (NOT p0))), true, (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (G (NOT (AND p0 (NOT p1)))), (G (NOT (AND (NOT p0) p1 p2))), (G (NOT (AND (NOT p0) p1 (NOT p2)))), (G (NOT (AND p0 p1 p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (AND p1 (NOT p2))), (F p0), (F p2)]
Property proved to be false thanks to knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 19 ms. Reduced automaton from 11 states, 35 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-04-LTLFireability-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-05 finished in 4370 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 416/416 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 184 transition count 400
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 184 transition count 400
Applied a total of 8 rules in 6 ms. Remains 184 /188 variables (removed 4) and now considering 400/416 (removed 16) transitions.
[2023-04-06 22:04:52] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2023-04-06 22:04:52] [INFO ] Invariant cache hit.
[2023-04-06 22:04:52] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-04-06 22:04:52] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2023-04-06 22:04:52] [INFO ] Invariant cache hit.
[2023-04-06 22:04:52] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-04-06 22:04:52] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
[2023-04-06 22:04:52] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2023-04-06 22:04:52] [INFO ] Invariant cache hit.
[2023-04-06 22:04:52] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 184/188 places, 400/416 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 517 ms. Remains : 184/188 places, 400/416 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s13 1) (EQ s87 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 120 ms.
Stack based approach found an accepted trace after 24 steps with 0 reset with depth 25 and stack size 25 in 0 ms.
FORMULA EisenbergMcGuire-PT-04-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-06 finished in 723 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 4 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 416/416 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 188 transition count 412
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 184 transition count 412
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 8 place count 184 transition count 361
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 110 place count 133 transition count 361
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 114 place count 129 transition count 345
Iterating global reduction 2 with 4 rules applied. Total rules applied 118 place count 129 transition count 345
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
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 142 place count 117 transition count 333
Applied a total of 142 rules in 25 ms. Remains 117 /188 variables (removed 71) and now considering 333/416 (removed 83) transitions.
[2023-04-06 22:04:52] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
// Phase 1: matrix 169 rows 117 cols
[2023-04-06 22:04:52] [INFO ] Computed 13 invariants in 3 ms
[2023-04-06 22:04:53] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-04-06 22:04:53] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
[2023-04-06 22:04:53] [INFO ] Invariant cache hit.
[2023-04-06 22:04:53] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-04-06 22:04:53] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
[2023-04-06 22:04:53] [INFO ] Redundant transitions in 2 ms returned []
[2023-04-06 22:04:53] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
[2023-04-06 22:04:53] [INFO ] Invariant cache hit.
[2023-04-06 22:04:53] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 117/188 places, 333/416 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 442 ms. Remains : 117/188 places, 333/416 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (EQ s1 1) (EQ s84 1)), p1:(AND (EQ s6 1) (EQ s89 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 117 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 0 ms.
FORMULA EisenbergMcGuire-PT-04-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-07 finished in 640 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U p1)&&(p1 U p2))))'
Support contains 6 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 416/416 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 188 transition count 412
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 184 transition count 412
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 52 Pre rules applied. Total rules applied 8 place count 184 transition count 360
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 112 place count 132 transition count 360
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 114 place count 130 transition count 352
Iterating global reduction 2 with 2 rules applied. Total rules applied 116 place count 130 transition count 352
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
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 140 place count 118 transition count 340
Applied a total of 140 rules in 21 ms. Remains 118 /188 variables (removed 70) and now considering 340/416 (removed 76) transitions.
[2023-04-06 22:04:53] [INFO ] Flow matrix only has 176 transitions (discarded 164 similar events)
// Phase 1: matrix 176 rows 118 cols
[2023-04-06 22:04:53] [INFO ] Computed 13 invariants in 3 ms
[2023-04-06 22:04:53] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-04-06 22:04:53] [INFO ] Flow matrix only has 176 transitions (discarded 164 similar events)
[2023-04-06 22:04:53] [INFO ] Invariant cache hit.
[2023-04-06 22:04:53] [INFO ] State equation strengthened by 82 read => feed constraints.
[2023-04-06 22:04:53] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
[2023-04-06 22:04:53] [INFO ] Redundant transitions in 2 ms returned []
[2023-04-06 22:04:53] [INFO ] Flow matrix only has 176 transitions (discarded 164 similar events)
[2023-04-06 22:04:53] [INFO ] Invariant cache hit.
[2023-04-06 22:04:53] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 118/188 places, 340/416 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 415 ms. Remains : 118/188 places, 340/416 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p2), (NOT p1), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=2 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2))), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(AND (EQ s1 1) (EQ s21 1)), p2:(AND (EQ s0 1) (EQ s41 1)), p0:(AND (EQ s10 1) (EQ s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 139 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 0 ms.
FORMULA EisenbergMcGuire-PT-04-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-08 finished in 696 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0) U (!p1&&F(p2)))))'
Support contains 5 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 416/416 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 185 transition count 404
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 185 transition count 404
Applied a total of 6 rules in 5 ms. Remains 185 /188 variables (removed 3) and now considering 404/416 (removed 12) transitions.
[2023-04-06 22:04:54] [INFO ] Flow matrix only has 240 transitions (discarded 164 similar events)
// Phase 1: matrix 240 rows 185 cols
[2023-04-06 22:04:54] [INFO ] Computed 13 invariants in 1 ms
[2023-04-06 22:04:54] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-04-06 22:04:54] [INFO ] Flow matrix only has 240 transitions (discarded 164 similar events)
[2023-04-06 22:04:54] [INFO ] Invariant cache hit.
[2023-04-06 22:04:54] [INFO ] State equation strengthened by 79 read => feed constraints.
[2023-04-06 22:04:54] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
[2023-04-06 22:04:54] [INFO ] Flow matrix only has 240 transitions (discarded 164 similar events)
[2023-04-06 22:04:54] [INFO ] Invariant cache hit.
[2023-04-06 22:04:54] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 185/188 places, 404/416 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 501 ms. Remains : 185/188 places, 404/416 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p2) p1), (OR (NOT p0) (NOT p2) p1), (NOT p2), true]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=1 dest: 2}, { cond=(NOT p0), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s11 1) (EQ s92 1)), p2:(OR (AND (EQ s2 1) (EQ s11 1) (EQ s136 1)) (AND (EQ s2 1) (EQ s52 1))), p0:(AND (EQ s2 1) (EQ s11 1) (EQ s136 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]]
Product exploration explored 100000 steps with 0 reset in 117 ms.
Stack based approach found an accepted trace after 18 steps with 0 reset with depth 19 and stack size 19 in 0 ms.
FORMULA EisenbergMcGuire-PT-04-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-09 finished in 783 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 416/416 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 188 transition count 412
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 184 transition count 412
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 8 place count 184 transition count 361
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 110 place count 133 transition count 361
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 114 place count 129 transition count 345
Iterating global reduction 2 with 4 rules applied. Total rules applied 118 place count 129 transition count 345
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
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 142 place count 117 transition count 333
Applied a total of 142 rules in 18 ms. Remains 117 /188 variables (removed 71) and now considering 333/416 (removed 83) transitions.
[2023-04-06 22:04:55] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
// Phase 1: matrix 169 rows 117 cols
[2023-04-06 22:04:55] [INFO ] Computed 13 invariants in 1 ms
[2023-04-06 22:04:55] [INFO ] Implicit Places using invariants in 150 ms returned []
[2023-04-06 22:04:55] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
[2023-04-06 22:04:55] [INFO ] Invariant cache hit.
[2023-04-06 22:04:55] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-04-06 22:04:55] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
[2023-04-06 22:04:55] [INFO ] Redundant transitions in 2 ms returned []
[2023-04-06 22:04:55] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
[2023-04-06 22:04:55] [INFO ] Invariant cache hit.
[2023-04-06 22:04:55] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 117/188 places, 333/416 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 523 ms. Remains : 117/188 places, 333/416 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s48 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 0 reset in 114 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA EisenbergMcGuire-PT-04-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-10 finished in 682 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G((p0||X(p1)))) U G(!p2)))'
Support contains 5 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 416/416 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 184 transition count 400
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 184 transition count 400
Applied a total of 8 rules in 4 ms. Remains 184 /188 variables (removed 4) and now considering 400/416 (removed 16) transitions.
[2023-04-06 22:04:55] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
// Phase 1: matrix 236 rows 184 cols
[2023-04-06 22:04:55] [INFO ] Computed 13 invariants in 1 ms
[2023-04-06 22:04:55] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-04-06 22:04:55] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2023-04-06 22:04:55] [INFO ] Invariant cache hit.
[2023-04-06 22:04:55] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-04-06 22:04:56] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
[2023-04-06 22:04:56] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2023-04-06 22:04:56] [INFO ] Invariant cache hit.
[2023-04-06 22:04:56] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 184/188 places, 400/416 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 545 ms. Remains : 184/188 places, 400/416 transitions.
Stuttering acceptance computed with spot in 251 ms :[p2, (AND (NOT p0) (NOT p1)), (AND (NOT p1) p2 (NOT p0)), (NOT p1), true, (AND p2 (NOT p1)), p2]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=p2, acceptance={0} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=p2, acceptance={} source=6 dest: 4}, { cond=(NOT p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(AND (EQ s9 1) (EQ s17 1)), p0:(AND (EQ s9 1) (EQ s153 1)), p1:(AND (EQ s15 1) (EQ s48 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 71701 steps with 0 reset in 87 ms.
FORMULA EisenbergMcGuire-PT-04-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-13 finished in 910 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 3 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 416/416 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 184 transition count 400
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 184 transition count 400
Applied a total of 8 rules in 7 ms. Remains 184 /188 variables (removed 4) and now considering 400/416 (removed 16) transitions.
[2023-04-06 22:04:56] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2023-04-06 22:04:56] [INFO ] Invariant cache hit.
[2023-04-06 22:04:56] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-04-06 22:04:56] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2023-04-06 22:04:56] [INFO ] Invariant cache hit.
[2023-04-06 22:04:56] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-04-06 22:04:56] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
[2023-04-06 22:04:56] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2023-04-06 22:04:56] [INFO ] Invariant cache hit.
[2023-04-06 22:04:57] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 184/188 places, 400/416 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 474 ms. Remains : 184/188 places, 400/416 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (EQ s2 0) (EQ s137 0)), p0:(EQ s57 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 297 ms.
Product exploration explored 100000 steps with 50000 reset in 250 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 18 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-04-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-14 finished in 1193 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2023-04-06 22:04:58] [INFO ] Flatten gal took : 21 ms
[2023-04-06 22:04:58] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-04-06 22:04:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 188 places, 416 transitions and 1824 arcs took 3 ms.
Total runtime 32745 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT EisenbergMcGuire-PT-04
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLFireability

FORMULA EisenbergMcGuire-PT-04-LTLFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1680818699601

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 EisenbergMcGuire-PT-04-LTLFireability-03
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for EisenbergMcGuire-PT-04-LTLFireability-03
lola: result : false
lola: markings : 46030
lola: fired transitions : 129231
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
EisenbergMcGuire-PT-04-LTLFireability-03: LTL false LTL model checker


Time elapsed: 0 secs. Pages in use: 1

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="EisenbergMcGuire-PT-04"
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 EisenbergMcGuire-PT-04, 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 r519-tall-167987245000228"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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