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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 968K
-rw-r--r-- 1 mcc users 9.1K Mar 23 15:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Mar 23 15:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Mar 23 15:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Mar 23 15:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K 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 14K Mar 23 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Mar 23 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 23 15:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Mar 23 15:21 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 460K 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-05-LTLFireability-00
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-01
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-02
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-03
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-04
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-05
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-06
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-07
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-08
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-09
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-10
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-11
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-12
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-13
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-14
FORMULA_NAME EisenbergMcGuire-PT-05-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1680818739881

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-05
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2023-04-06 22:05:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-06 22:05:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 22:05:41] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2023-04-06 22:05:41] [INFO ] Transformed 295 places.
[2023-04-06 22:05:41] [INFO ] Transformed 800 transitions.
[2023-04-06 22:05:41] [INFO ] Found NUPN structural information;
[2023-04-06 22:05:41] [INFO ] Parsed PT model containing 295 places and 800 transitions and 3600 arcs in 148 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-05-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-05-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-05-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 out of 295 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 295/295 places, 800/800 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 282 transition count 735
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 282 transition count 735
Applied a total of 26 rules in 46 ms. Remains 282 /295 variables (removed 13) and now considering 735/800 (removed 65) transitions.
[2023-04-06 22:05:41] [INFO ] Flow matrix only has 400 transitions (discarded 335 similar events)
// Phase 1: matrix 400 rows 282 cols
[2023-04-06 22:05:41] [INFO ] Computed 16 invariants in 17 ms
[2023-04-06 22:05:42] [INFO ] Implicit Places using invariants in 248 ms returned []
[2023-04-06 22:05:42] [INFO ] Flow matrix only has 400 transitions (discarded 335 similar events)
[2023-04-06 22:05:42] [INFO ] Invariant cache hit.
[2023-04-06 22:05:42] [INFO ] State equation strengthened by 144 read => feed constraints.
[2023-04-06 22:05:42] [INFO ] Implicit Places using invariants and state equation in 467 ms returned []
Implicit Place search using SMT with State Equation took 835 ms to find 0 implicit places.
[2023-04-06 22:05:42] [INFO ] Flow matrix only has 400 transitions (discarded 335 similar events)
[2023-04-06 22:05:42] [INFO ] Invariant cache hit.
[2023-04-06 22:05:42] [INFO ] Dead Transitions using invariants and state equation in 268 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 282/295 places, 735/800 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1153 ms. Remains : 282/295 places, 735/800 transitions.
Support contains 49 out of 282 places after structural reductions.
[2023-04-06 22:05:43] [INFO ] Flatten gal took : 70 ms
[2023-04-06 22:05:43] [INFO ] Flatten gal took : 38 ms
[2023-04-06 22:05:43] [INFO ] Input system was already deterministic with 735 transitions.
Support contains 48 out of 282 places (down from 49) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 476 ms. (steps per millisecond=21 ) properties (out of 35) seen :12
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) 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 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) 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 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) 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 23) 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 23) 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 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) 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 23) 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 23) 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 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) 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 23) 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 23) 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 23) 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 23) 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 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Running SMT prover for 23 properties.
[2023-04-06 22:05:43] [INFO ] Flow matrix only has 400 transitions (discarded 335 similar events)
[2023-04-06 22:05:43] [INFO ] Invariant cache hit.
[2023-04-06 22:05:44] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-04-06 22:05:44] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 4 ms returned sat
[2023-04-06 22:05:44] [INFO ] After 441ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:23
[2023-04-06 22:05:44] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-04-06 22:05:44] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 17 ms returned sat
[2023-04-06 22:05:45] [INFO ] After 511ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :22
[2023-04-06 22:05:45] [INFO ] State equation strengthened by 144 read => feed constraints.
[2023-04-06 22:05:45] [INFO ] After 434ms SMT Verify possible using 144 Read/Feed constraints in natural domain returned unsat :1 sat :22
[2023-04-06 22:05:45] [INFO ] Deduced a trap composed of 6 places in 105 ms of which 4 ms to minimize.
[2023-04-06 22:05:45] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 1 ms to minimize.
[2023-04-06 22:05:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 231 ms
[2023-04-06 22:05:46] [INFO ] Deduced a trap composed of 61 places in 82 ms of which 1 ms to minimize.
[2023-04-06 22:05:46] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2023-04-06 22:05:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 184 ms
[2023-04-06 22:05:46] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2023-04-06 22:05:46] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 0 ms to minimize.
[2023-04-06 22:05:46] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-04-06 22:05:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 228 ms
[2023-04-06 22:05:46] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 1 ms to minimize.
[2023-04-06 22:05:46] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 1 ms to minimize.
[2023-04-06 22:05:46] [INFO ] Deduced a trap composed of 72 places in 81 ms of which 1 ms to minimize.
[2023-04-06 22:05:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 307 ms
[2023-04-06 22:05:46] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 0 ms to minimize.
[2023-04-06 22:05:46] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-04-06 22:05:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 129 ms
[2023-04-06 22:05:47] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 1 ms to minimize.
[2023-04-06 22:05:47] [INFO ] Deduced a trap composed of 56 places in 82 ms of which 0 ms to minimize.
[2023-04-06 22:05:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 231 ms
[2023-04-06 22:05:47] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 0 ms to minimize.
[2023-04-06 22:05:47] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 0 ms to minimize.
[2023-04-06 22:05:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 153 ms
[2023-04-06 22:05:47] [INFO ] Deduced a trap composed of 51 places in 84 ms of which 1 ms to minimize.
[2023-04-06 22:05:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2023-04-06 22:05:47] [INFO ] After 2631ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :22
Attempting to minimize the solution found.
Minimization took 504 ms.
[2023-04-06 22:05:48] [INFO ] After 4075ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :22
Fused 23 Parikh solutions to 21 different solutions.
Parikh walk visited 0 properties in 373 ms.
Support contains 31 out of 282 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 282/282 places, 735/735 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 282 transition count 731
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 278 transition count 731
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 8 place count 278 transition count 652
Deduced a syphon composed of 79 places in 1 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 166 place count 199 transition count 652
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 168 place count 197 transition count 642
Iterating global reduction 2 with 2 rules applied. Total rules applied 170 place count 197 transition count 642
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 210 place count 177 transition count 622
Applied a total of 210 rules in 80 ms. Remains 177 /282 variables (removed 105) and now considering 622/735 (removed 113) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 177/282 places, 622/735 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 332 ms. (steps per millisecond=30 ) properties (out of 22) 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 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) 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 :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) 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 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) 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 :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 :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Interrupted probabilistic random walk after 390696 steps, run timeout after 3001 ms. (steps per millisecond=130 ) properties seen :{0=1, 2=1, 5=1, 6=1, 7=1, 8=1, 9=1, 11=1, 20=1}
Probabilistic random walk after 390696 steps, saw 90655 distinct states, run finished after 3008 ms. (steps per millisecond=129 ) properties seen :9
Running SMT prover for 13 properties.
[2023-04-06 22:05:52] [INFO ] Flow matrix only has 287 transitions (discarded 335 similar events)
// Phase 1: matrix 287 rows 177 cols
[2023-04-06 22:05:52] [INFO ] Computed 16 invariants in 5 ms
[2023-04-06 22:05:52] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-04-06 22:05:52] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 3 ms returned sat
[2023-04-06 22:05:52] [INFO ] After 162ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-04-06 22:05:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-04-06 22:05:52] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 6 ms returned sat
[2023-04-06 22:05:52] [INFO ] After 193ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-04-06 22:05:52] [INFO ] State equation strengthened by 136 read => feed constraints.
[2023-04-06 22:05:53] [INFO ] After 190ms SMT Verify possible using 136 Read/Feed constraints in natural domain returned unsat :0 sat :13
[2023-04-06 22:05:53] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 0 ms to minimize.
[2023-04-06 22:05:53] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-04-06 22:05:53] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2023-04-06 22:05:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 183 ms
[2023-04-06 22:05:53] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-04-06 22:05:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2023-04-06 22:05:53] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 0 ms to minimize.
[2023-04-06 22:05:53] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
[2023-04-06 22:05:53] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2023-04-06 22:05:53] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-04-06 22:05:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 250 ms
[2023-04-06 22:05:53] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2023-04-06 22:05:53] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 0 ms to minimize.
[2023-04-06 22:05:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 128 ms
[2023-04-06 22:05:53] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 0 ms to minimize.
[2023-04-06 22:05:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2023-04-06 22:05:53] [INFO ] After 1125ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 191 ms.
[2023-04-06 22:05:54] [INFO ] After 1631ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Parikh walk visited 0 properties in 88 ms.
Support contains 20 out of 177 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 622/622 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 177 transition count 621
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 176 transition count 621
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 6 place count 172 transition count 601
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 172 transition count 601
Applied a total of 10 rules in 49 ms. Remains 172 /177 variables (removed 5) and now considering 601/622 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 172/177 places, 601/622 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 303 ms. (steps per millisecond=33 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 13) seen :0
Interrupted probabilistic random walk after 405726 steps, run timeout after 3001 ms. (steps per millisecond=135 ) properties seen :{}
Probabilistic random walk after 405726 steps, saw 85337 distinct states, run finished after 3002 ms. (steps per millisecond=135 ) properties seen :0
Running SMT prover for 13 properties.
[2023-04-06 22:05:58] [INFO ] Flow matrix only has 266 transitions (discarded 335 similar events)
// Phase 1: matrix 266 rows 172 cols
[2023-04-06 22:05:58] [INFO ] Computed 16 invariants in 6 ms
[2023-04-06 22:05:58] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-04-06 22:05:58] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2023-04-06 22:05:58] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-04-06 22:05:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-04-06 22:05:58] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2023-04-06 22:05:58] [INFO ] After 177ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-04-06 22:05:58] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-04-06 22:05:58] [INFO ] After 176ms SMT Verify possible using 120 Read/Feed constraints in natural domain returned unsat :0 sat :13
[2023-04-06 22:05:58] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2023-04-06 22:05:59] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2023-04-06 22:05:59] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-04-06 22:05:59] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2023-04-06 22:05:59] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 2 ms to minimize.
[2023-04-06 22:05:59] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 262 ms
[2023-04-06 22:05:59] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 0 ms to minimize.
[2023-04-06 22:05:59] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2023-04-06 22:05:59] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2023-04-06 22:05:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 181 ms
[2023-04-06 22:05:59] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2023-04-06 22:05:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2023-04-06 22:05:59] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-04-06 22:05:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2023-04-06 22:05:59] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 0 ms to minimize.
[2023-04-06 22:05:59] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2023-04-06 22:05:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 126 ms
[2023-04-06 22:05:59] [INFO ] After 1095ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 182 ms.
[2023-04-06 22:05:59] [INFO ] After 1577ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Fused 13 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 57 ms.
Support contains 20 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 601/601 transitions.
Applied a total of 0 rules in 14 ms. Remains 172 /172 variables (removed 0) and now considering 601/601 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 172/172 places, 601/601 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 601/601 transitions.
Applied a total of 0 rules in 13 ms. Remains 172 /172 variables (removed 0) and now considering 601/601 (removed 0) transitions.
[2023-04-06 22:06:00] [INFO ] Flow matrix only has 266 transitions (discarded 335 similar events)
[2023-04-06 22:06:00] [INFO ] Invariant cache hit.
[2023-04-06 22:06:00] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-04-06 22:06:00] [INFO ] Flow matrix only has 266 transitions (discarded 335 similar events)
[2023-04-06 22:06:00] [INFO ] Invariant cache hit.
[2023-04-06 22:06:00] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-04-06 22:06:00] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
[2023-04-06 22:06:00] [INFO ] Redundant transitions in 38 ms returned []
[2023-04-06 22:06:00] [INFO ] Flow matrix only has 266 transitions (discarded 335 similar events)
[2023-04-06 22:06:00] [INFO ] Invariant cache hit.
[2023-04-06 22:06:00] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 650 ms. Remains : 172/172 places, 601/601 transitions.
Graph (trivial) has 428 edges and 172 vertex of which 24 / 172 are part of one of the 5 SCC in 3 ms
Free SCC test removed 19 places
Drop transitions removed 71 transitions
Ensure Unique test removed 323 transitions
Reduce isomorphic transitions removed 394 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 153 transition count 180
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 55 place count 126 transition count 180
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 55 place count 126 transition count 170
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 79 place count 112 transition count 170
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 143 place count 80 transition count 138
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 153 place count 80 transition count 128
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -76
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 167 place count 73 transition count 204
Drop transitions removed 1 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 170 place count 73 transition count 201
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 178 place count 73 transition count 193
Free-agglomeration rule applied 7 times.
Iterating global reduction 4 with 7 rules applied. Total rules applied 185 place count 73 transition count 186
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 192 place count 66 transition count 186
Partial Free-agglomeration rule applied 20 times.
Drop transitions removed 20 transitions
Iterating global reduction 5 with 20 rules applied. Total rules applied 212 place count 66 transition count 186
Applied a total of 212 rules in 28 ms. Remains 66 /172 variables (removed 106) and now considering 186/601 (removed 415) transitions.
Running SMT prover for 13 properties.
// Phase 1: matrix 186 rows 66 cols
[2023-04-06 22:06:00] [INFO ] Computed 12 invariants in 3 ms
[2023-04-06 22:06:00] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-04-06 22:06:00] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2023-04-06 22:06:00] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-04-06 22:06:00] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-04-06 22:06:00] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 0 ms returned sat
[2023-04-06 22:06:01] [INFO ] After 134ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-04-06 22:06:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-04-06 22:06:01] [INFO ] After 106ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :13
[2023-04-06 22:06:01] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-04-06 22:06:01] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2023-04-06 22:06:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 63 ms
[2023-04-06 22:06:01] [INFO ] After 332ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 108 ms.
[2023-04-06 22:06:01] [INFO ] After 630ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA EisenbergMcGuire-PT-05-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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' '!((F(p0)&&(X((F(p2)&&p1)) U G(!p3))))'
Support contains 4 out of 282 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 282/282 places, 735/735 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 276 transition count 705
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 276 transition count 705
Applied a total of 12 rules in 9 ms. Remains 276 /282 variables (removed 6) and now considering 705/735 (removed 30) transitions.
[2023-04-06 22:06:01] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
// Phase 1: matrix 370 rows 276 cols
[2023-04-06 22:06:01] [INFO ] Computed 16 invariants in 2 ms
[2023-04-06 22:06:01] [INFO ] Implicit Places using invariants in 143 ms returned []
[2023-04-06 22:06:01] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
[2023-04-06 22:06:01] [INFO ] Invariant cache hit.
[2023-04-06 22:06:02] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-04-06 22:06:02] [INFO ] Implicit Places using invariants and state equation in 517 ms returned []
Implicit Place search using SMT with State Equation took 679 ms to find 0 implicit places.
[2023-04-06 22:06:02] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
[2023-04-06 22:06:02] [INFO ] Invariant cache hit.
[2023-04-06 22:06:02] [INFO ] Dead Transitions using invariants and state equation in 215 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 276/282 places, 705/735 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 905 ms. Remains : 276/282 places, 705/735 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 421 ms :[(OR (NOT p0) p3), (NOT p0), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p1) p3) (AND (NOT p2) p3)), p3, true, (NOT p2), (AND p3 p1), (AND (NOT p2) p3 (NOT p1))]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p3, acceptance={} source=0 dest: 2}, { cond=(NOT p3), acceptance={} source=0 dest: 3}, { cond=true, acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=(AND p3 (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND p3 p1 (NOT p2)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=3 dest: 7}, { cond=(AND (NOT p3) p1 (NOT p2)), acceptance={} source=3 dest: 8}], [{ cond=p3, acceptance={} source=4 dest: 2}, { cond=(NOT p3), acceptance={} source=4 dest: 3}, { cond=(NOT p3), acceptance={} source=4 dest: 4}, { cond=p3, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 6}], [{ cond=(AND p3 p1), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p3) p1), acceptance={} source=7 dest: 7}], [{ cond=(AND p3 (NOT p1) (NOT p2)), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p3) (NOT p1) (NOT p2)), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(EQ s37 1), p3:(AND (EQ s3 1) (EQ s75 1)), p1:(AND (EQ s3 1) (EQ s75 1)), p2:(EQ s33 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1227 reset in 271 ms.
Stack based approach found an accepted trace after 50 steps with 0 reset with depth 51 and stack size 51 in 1 ms.
FORMULA EisenbergMcGuire-PT-05-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-00 finished in 1661 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(((X(X(p1))||F(p2))&&p0))))'
Support contains 6 out of 282 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 282/282 places, 735/735 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 282 transition count 731
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 278 transition count 731
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 8 place count 278 transition count 651
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 168 place count 198 transition count 651
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 174 place count 192 transition count 621
Iterating global reduction 2 with 6 rules applied. Total rules applied 180 place count 192 transition count 621
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 220 place count 172 transition count 601
Applied a total of 220 rules in 63 ms. Remains 172 /282 variables (removed 110) and now considering 601/735 (removed 134) transitions.
[2023-04-06 22:06:03] [INFO ] Flow matrix only has 266 transitions (discarded 335 similar events)
// Phase 1: matrix 266 rows 172 cols
[2023-04-06 22:06:03] [INFO ] Computed 16 invariants in 2 ms
[2023-04-06 22:06:03] [INFO ] Implicit Places using invariants in 339 ms returned []
[2023-04-06 22:06:03] [INFO ] Flow matrix only has 266 transitions (discarded 335 similar events)
[2023-04-06 22:06:03] [INFO ] Invariant cache hit.
[2023-04-06 22:06:03] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-04-06 22:06:04] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 660 ms to find 0 implicit places.
[2023-04-06 22:06:04] [INFO ] Redundant transitions in 8 ms returned []
[2023-04-06 22:06:04] [INFO ] Flow matrix only has 266 transitions (discarded 335 similar events)
[2023-04-06 22:06:04] [INFO ] Invariant cache hit.
[2023-04-06 22:06:04] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 172/282 places, 601/735 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 924 ms. Remains : 172/282 places, 601/735 transitions.
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 3}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s2 1) (EQ s29 1)), p2:(AND (EQ s4 1) (EQ s18 1) (EQ s122 1)), p1:(AND (EQ s4 1) (EQ s17 1) (EQ s122 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 173 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-05-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-01 finished in 1315 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&G(p1)&&F(p2))))'
Support contains 7 out of 282 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 282/282 places, 735/735 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 276 transition count 705
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 276 transition count 705
Applied a total of 12 rules in 11 ms. Remains 276 /282 variables (removed 6) and now considering 705/735 (removed 30) transitions.
[2023-04-06 22:06:04] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
// Phase 1: matrix 370 rows 276 cols
[2023-04-06 22:06:04] [INFO ] Computed 16 invariants in 2 ms
[2023-04-06 22:06:04] [INFO ] Implicit Places using invariants in 120 ms returned []
[2023-04-06 22:06:04] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
[2023-04-06 22:06:04] [INFO ] Invariant cache hit.
[2023-04-06 22:06:05] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-04-06 22:06:05] [INFO ] Implicit Places using invariants and state equation in 573 ms returned []
Implicit Place search using SMT with State Equation took 695 ms to find 0 implicit places.
[2023-04-06 22:06:05] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
[2023-04-06 22:06:05] [INFO ] Invariant cache hit.
[2023-04-06 22:06:05] [INFO ] Dead Transitions using invariants and state equation in 251 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 276/282 places, 705/735 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 959 ms. Remains : 276/282 places, 705/735 transitions.
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2) (NOT p0)), true, (AND p1 (NOT p0)), (NOT p1), (NOT p2)]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s1 1) (EQ s26 1)), p2:(AND (EQ s6 1) (EQ s63 1)), p0:(AND (EQ s3 1) (EQ s16 1) (EQ s194 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA EisenbergMcGuire-PT-05-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-02 finished in 1191 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 282 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 282/282 places, 735/735 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 276 transition count 705
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 276 transition count 705
Applied a total of 12 rules in 8 ms. Remains 276 /282 variables (removed 6) and now considering 705/735 (removed 30) transitions.
[2023-04-06 22:06:05] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
// Phase 1: matrix 370 rows 276 cols
[2023-04-06 22:06:05] [INFO ] Computed 16 invariants in 2 ms
[2023-04-06 22:06:06] [INFO ] Implicit Places using invariants in 167 ms returned []
[2023-04-06 22:06:06] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
[2023-04-06 22:06:06] [INFO ] Invariant cache hit.
[2023-04-06 22:06:06] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-04-06 22:06:06] [INFO ] Implicit Places using invariants and state equation in 533 ms returned []
Implicit Place search using SMT with State Equation took 702 ms to find 0 implicit places.
[2023-04-06 22:06:06] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
[2023-04-06 22:06:06] [INFO ] Invariant cache hit.
[2023-04-06 22:06:06] [INFO ] Dead Transitions using invariants and state equation in 226 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 276/282 places, 705/735 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 938 ms. Remains : 276/282 places, 705/735 transitions.
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (NEQ s3 1) (NEQ s75 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 142 ms.
Product exploration explored 100000 steps with 0 reset in 184 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), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 78 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) 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
Interrupted probabilistic random walk after 1023318 steps, run timeout after 3001 ms. (steps per millisecond=340 ) properties seen :{}
Probabilistic random walk after 1023318 steps, saw 325262 distinct states, run finished after 3002 ms. (steps per millisecond=340 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 22:06:10] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
[2023-04-06 22:06:10] [INFO ] Invariant cache hit.
[2023-04-06 22:06:10] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-04-06 22:06:10] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 3 ms returned sat
[2023-04-06 22:06:10] [INFO ] After 144ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:06:10] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-04-06 22:06:10] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2023-04-06 22:06:10] [INFO ] After 91ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:06:10] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-04-06 22:06:10] [INFO ] After 36ms SMT Verify possible using 120 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:06:10] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2023-04-06 22:06:10] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 0 ms to minimize.
[2023-04-06 22:06:11] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2023-04-06 22:06:11] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-04-06 22:06:11] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 2 ms to minimize.
[2023-04-06 22:06:11] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 300 ms
[2023-04-06 22:06:11] [INFO ] After 354ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-04-06 22:06:11] [INFO ] After 534ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 276 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 276/276 places, 705/705 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 276 transition count 700
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 271 transition count 700
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 10 place count 271 transition count 620
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 170 place count 191 transition count 620
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 210 place count 171 transition count 600
Applied a total of 210 rules in 25 ms. Remains 171 /276 variables (removed 105) and now considering 600/705 (removed 105) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 171/276 places, 600/705 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) 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 326782 steps, run visited all 1 properties in 784 ms. (steps per millisecond=416 )
Probabilistic random walk after 326782 steps, saw 71640 distinct states, run finished after 787 ms. (steps per millisecond=415 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 4 factoid took 95 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-05-LTLFireability-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-03 finished in 6154 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 282 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 282/282 places, 735/735 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 276 transition count 705
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 276 transition count 705
Applied a total of 12 rules in 5 ms. Remains 276 /282 variables (removed 6) and now considering 705/735 (removed 30) transitions.
[2023-04-06 22:06:12] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
// Phase 1: matrix 370 rows 276 cols
[2023-04-06 22:06:12] [INFO ] Computed 16 invariants in 2 ms
[2023-04-06 22:06:12] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-04-06 22:06:12] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
[2023-04-06 22:06:12] [INFO ] Invariant cache hit.
[2023-04-06 22:06:12] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-04-06 22:06:12] [INFO ] Implicit Places using invariants and state equation in 523 ms returned []
Implicit Place search using SMT with State Equation took 661 ms to find 0 implicit places.
[2023-04-06 22:06:12] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
[2023-04-06 22:06:12] [INFO ] Invariant cache hit.
[2023-04-06 22:06:12] [INFO ] Dead Transitions using invariants and state equation in 225 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 276/282 places, 705/735 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 893 ms. Remains : 276/282 places, 705/735 transitions.
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s0 1) (EQ s75 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA EisenbergMcGuire-PT-05-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-04 finished in 983 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((!p1 U (p2||G(!p1)))))))'
Support contains 5 out of 282 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 282/282 places, 735/735 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 282 transition count 730
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 277 transition count 730
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 78 Pre rules applied. Total rules applied 10 place count 277 transition count 652
Deduced a syphon composed of 78 places in 0 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 156 rules applied. Total rules applied 166 place count 199 transition count 652
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 172 place count 193 transition count 622
Iterating global reduction 2 with 6 rules applied. Total rules applied 178 place count 193 transition count 622
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 218 place count 173 transition count 602
Applied a total of 218 rules in 30 ms. Remains 173 /282 variables (removed 109) and now considering 602/735 (removed 133) transitions.
[2023-04-06 22:06:13] [INFO ] Flow matrix only has 267 transitions (discarded 335 similar events)
// Phase 1: matrix 267 rows 173 cols
[2023-04-06 22:06:13] [INFO ] Computed 16 invariants in 3 ms
[2023-04-06 22:06:13] [INFO ] Implicit Places using invariants in 122 ms returned []
[2023-04-06 22:06:13] [INFO ] Flow matrix only has 267 transitions (discarded 335 similar events)
[2023-04-06 22:06:13] [INFO ] Invariant cache hit.
[2023-04-06 22:06:13] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-04-06 22:06:13] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 466 ms to find 0 implicit places.
[2023-04-06 22:06:13] [INFO ] Redundant transitions in 6 ms returned []
[2023-04-06 22:06:13] [INFO ] Flow matrix only has 267 transitions (discarded 335 similar events)
[2023-04-06 22:06:13] [INFO ] Invariant cache hit.
[2023-04-06 22:06:13] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 173/282 places, 602/735 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 690 ms. Remains : 173/282 places, 602/735 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND (NOT p2) p1)]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s3 1) (EQ s55 1)), p2:(AND (NEQ s56 1) (NOT (AND (EQ s9 1) (EQ s76 1)))), p1:(AND (EQ s9 1) (EQ s76 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 139 ms.
Stack based approach found an accepted trace after 10 steps with 0 reset with depth 11 and stack size 11 in 0 ms.
FORMULA EisenbergMcGuire-PT-05-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-05 finished in 971 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((p1&&G(p2)))&&p0)))'
Support contains 7 out of 282 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 282/282 places, 735/735 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 275 transition count 700
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 275 transition count 700
Applied a total of 14 rules in 8 ms. Remains 275 /282 variables (removed 7) and now considering 700/735 (removed 35) transitions.
[2023-04-06 22:06:14] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
// Phase 1: matrix 365 rows 275 cols
[2023-04-06 22:06:14] [INFO ] Computed 16 invariants in 3 ms
[2023-04-06 22:06:14] [INFO ] Implicit Places using invariants in 128 ms returned []
[2023-04-06 22:06:14] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2023-04-06 22:06:14] [INFO ] Invariant cache hit.
[2023-04-06 22:06:14] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 22:06:14] [INFO ] Implicit Places using invariants and state equation in 479 ms returned []
Implicit Place search using SMT with State Equation took 609 ms to find 0 implicit places.
[2023-04-06 22:06:14] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2023-04-06 22:06:14] [INFO ] Invariant cache hit.
[2023-04-06 22:06:14] [INFO ] Dead Transitions using invariants and state equation in 216 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 275/282 places, 700/735 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 834 ms. Remains : 275/282 places, 700/735 transitions.
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 p2), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (OR (EQ s14 0) (EQ s134 0)) (OR (EQ s0 0) (EQ s7 0) (EQ s201 0))), p1:(OR (EQ s14 0) (EQ s134 0)), p2:(OR (EQ s2 0) (EQ s250 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 137 ms.
Product exploration explored 100000 steps with 0 reset in 168 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 p0 p1 p2), (X (AND p0 p1 p2)), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X p0), true, (X (X (AND p1 p2))), (X (X (NOT (OR (NOT p1) (NOT p2))))), (X (X p2))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 101 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p2), (OR (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2023-04-06 22:06:15] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2023-04-06 22:06:15] [INFO ] Invariant cache hit.
[2023-04-06 22:06:15] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:06:15] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-04-06 22:06:15] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 1 ms returned sat
[2023-04-06 22:06:15] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:06:15] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 22:06:15] [INFO ] After 43ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:06:16] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 1 ms to minimize.
[2023-04-06 22:06:16] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 0 ms to minimize.
[2023-04-06 22:06:16] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2023-04-06 22:06:16] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2023-04-06 22:06:16] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 7 ms to minimize.
[2023-04-06 22:06:16] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 0 ms to minimize.
[2023-04-06 22:06:16] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2023-04-06 22:06:16] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
[2023-04-06 22:06:16] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2023-04-06 22:06:16] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2023-04-06 22:06:16] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 718 ms
[2023-04-06 22:06:16] [INFO ] After 775ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-04-06 22:06:16] [INFO ] After 938ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 275 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 275/275 places, 700/700 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 275 transition count 695
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 270 transition count 695
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 10 place count 270 transition count 615
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 170 place count 190 transition count 615
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 210 place count 170 transition count 595
Applied a total of 210 rules in 33 ms. Remains 170 /275 variables (removed 105) and now considering 595/700 (removed 105) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 170/275 places, 595/700 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 17290 steps, run visited all 1 properties in 73 ms. (steps per millisecond=236 )
Probabilistic random walk after 17290 steps, saw 8407 distinct states, run finished after 73 ms. (steps per millisecond=236 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p1 p2)), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X p0), true, (X (X (AND p1 p2))), (X (X (NOT (OR (NOT p1) (NOT p2))))), (X (X p2))]
False Knowledge obtained : [(F (NOT p2)), (F (OR (NOT p1) (NOT p2))), (F (NOT (AND p1 p2)))]
Knowledge based reduction with 8 factoid took 164 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p2), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 68 ms :[(NOT p2), (OR (NOT p1) (NOT p2))]
Support contains 4 out of 275 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 275/275 places, 700/700 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 275 transition count 695
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 270 transition count 695
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 10 place count 270 transition count 616
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 168 place count 191 transition count 616
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 208 place count 171 transition count 596
Applied a total of 208 rules in 25 ms. Remains 171 /275 variables (removed 104) and now considering 596/700 (removed 104) transitions.
[2023-04-06 22:06:17] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
// Phase 1: matrix 261 rows 171 cols
[2023-04-06 22:06:17] [INFO ] Computed 16 invariants in 2 ms
[2023-04-06 22:06:17] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-04-06 22:06:17] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2023-04-06 22:06:17] [INFO ] Invariant cache hit.
[2023-04-06 22:06:17] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 22:06:17] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
[2023-04-06 22:06:17] [INFO ] Redundant transitions in 6 ms returned []
[2023-04-06 22:06:17] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2023-04-06 22:06:17] [INFO ] Invariant cache hit.
[2023-04-06 22:06:17] [INFO ] Dead Transitions using invariants and state equation in 172 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 171/275 places, 596/700 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 637 ms. Remains : 171/275 places, 596/700 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 : [(AND p2 p1), (X p2), (X (AND p1 p2)), (X (NOT (OR (NOT p1) (NOT p2)))), (X (X p2)), (X (X (AND p1 p2))), (X (X (NOT (OR (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 64 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p2), (OR (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) 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 3) seen :2
Running SMT prover for 1 properties.
[2023-04-06 22:06:18] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2023-04-06 22:06:18] [INFO ] Invariant cache hit.
[2023-04-06 22:06:18] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:06:18] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-04-06 22:06:18] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 1 ms returned sat
[2023-04-06 22:06:18] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:06:18] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 22:06:18] [INFO ] After 23ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:06:18] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 0 ms to minimize.
[2023-04-06 22:06:18] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 0 ms to minimize.
[2023-04-06 22:06:18] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 2 ms to minimize.
[2023-04-06 22:06:18] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 0 ms to minimize.
[2023-04-06 22:06:18] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 2 ms to minimize.
[2023-04-06 22:06:18] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 4 ms to minimize.
[2023-04-06 22:06:18] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2023-04-06 22:06:18] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2023-04-06 22:06:18] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2023-04-06 22:06:18] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 545 ms
[2023-04-06 22:06:18] [INFO ] After 578ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-04-06 22:06:18] [INFO ] After 694ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 171 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 596/596 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 171 transition count 595
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 170 transition count 595
Applied a total of 2 rules in 13 ms. Remains 170 /171 variables (removed 1) and now considering 595/596 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 170/171 places, 595/596 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) 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 17290 steps, run visited all 1 properties in 48 ms. (steps per millisecond=360 )
Probabilistic random walk after 17290 steps, saw 8407 distinct states, run finished after 48 ms. (steps per millisecond=360 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 p1), (X p2), (X (AND p1 p2)), (X (NOT (OR (NOT p1) (NOT p2)))), (X (X p2)), (X (X (AND p1 p2))), (X (X (NOT (OR (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (NOT p2)), (F (OR (NOT p1) (NOT p2))), (F (NOT (AND p1 p2)))]
Knowledge based reduction with 7 factoid took 139 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p2), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 62 ms :[(NOT p2), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 65 ms :[(NOT p2), (OR (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 133 ms.
Product exploration explored 100000 steps with 0 reset in 153 ms.
Support contains 4 out of 171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 171/171 places, 596/596 transitions.
Applied a total of 0 rules in 9 ms. Remains 171 /171 variables (removed 0) and now considering 596/596 (removed 0) transitions.
[2023-04-06 22:06:19] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2023-04-06 22:06:19] [INFO ] Invariant cache hit.
[2023-04-06 22:06:19] [INFO ] Implicit Places using invariants in 116 ms returned []
[2023-04-06 22:06:19] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2023-04-06 22:06:19] [INFO ] Invariant cache hit.
[2023-04-06 22:06:19] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 22:06:19] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
[2023-04-06 22:06:19] [INFO ] Redundant transitions in 5 ms returned []
[2023-04-06 22:06:19] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2023-04-06 22:06:19] [INFO ] Invariant cache hit.
[2023-04-06 22:06:20] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 649 ms. Remains : 171/171 places, 596/596 transitions.
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-07 finished in 6198 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((G(p0)||X(p1))))'
Support contains 4 out of 282 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 282/282 places, 735/735 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 275 transition count 700
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 275 transition count 700
Applied a total of 14 rules in 5 ms. Remains 275 /282 variables (removed 7) and now considering 700/735 (removed 35) transitions.
[2023-04-06 22:06:20] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
// Phase 1: matrix 365 rows 275 cols
[2023-04-06 22:06:20] [INFO ] Computed 16 invariants in 1 ms
[2023-04-06 22:06:20] [INFO ] Implicit Places using invariants in 313 ms returned []
[2023-04-06 22:06:20] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2023-04-06 22:06:20] [INFO ] Invariant cache hit.
[2023-04-06 22:06:20] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 22:06:21] [INFO ] Implicit Places using invariants and state equation in 506 ms returned []
Implicit Place search using SMT with State Equation took 821 ms to find 0 implicit places.
[2023-04-06 22:06:21] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2023-04-06 22:06:21] [INFO ] Invariant cache hit.
[2023-04-06 22:06:21] [INFO ] Dead Transitions using invariants and state equation in 211 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 275/282 places, 700/735 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1039 ms. Remains : 275/282 places, 700/735 transitions.
Stuttering acceptance computed with spot in 192 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(EQ s36 0), p1:(OR (EQ s3 0) (EQ s15 0) (EQ s190 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 141 ms.
Product exploration explored 100000 steps with 0 reset in 192 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 p0 p1), (X (NOT (AND (NOT p0) p1))), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (AND p0 p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 116 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 6) seen :3
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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) 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 3) seen :0
Running SMT prover for 3 properties.
[2023-04-06 22:06:22] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2023-04-06 22:06:22] [INFO ] Invariant cache hit.
[2023-04-06 22:06:22] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-06 22:06:22] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-04-06 22:06:22] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2023-04-06 22:06:22] [INFO ] After 108ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-06 22:06:22] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 22:06:22] [INFO ] After 66ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-06 22:06:22] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2023-04-06 22:06:22] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2023-04-06 22:06:22] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-04-06 22:06:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 183 ms
[2023-04-06 22:06:22] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 0 ms to minimize.
[2023-04-06 22:06:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2023-04-06 22:06:22] [INFO ] After 392ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 59 ms.
[2023-04-06 22:06:23] [INFO ] After 622ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 16 ms.
Support contains 4 out of 275 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 275/275 places, 700/700 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 275 transition count 695
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 270 transition count 695
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 10 place count 270 transition count 616
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 168 place count 191 transition count 616
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 206 place count 172 transition count 597
Applied a total of 206 rules in 19 ms. Remains 172 /275 variables (removed 103) and now considering 597/700 (removed 103) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 172/275 places, 597/700 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) 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 3) 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 3) seen :0
Interrupted probabilistic random walk after 565692 steps, run timeout after 3001 ms. (steps per millisecond=188 ) properties seen :{}
Probabilistic random walk after 565692 steps, saw 113003 distinct states, run finished after 3001 ms. (steps per millisecond=188 ) properties seen :0
Running SMT prover for 3 properties.
[2023-04-06 22:06:26] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
// Phase 1: matrix 262 rows 172 cols
[2023-04-06 22:06:26] [INFO ] Computed 16 invariants in 4 ms
[2023-04-06 22:06:26] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-06 22:06:26] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-04-06 22:06:26] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 1 ms returned sat
[2023-04-06 22:06:26] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-06 22:06:26] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 22:06:26] [INFO ] After 50ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-06 22:06:26] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2023-04-06 22:06:26] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2023-04-06 22:06:26] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2023-04-06 22:06:26] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2023-04-06 22:06:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 224 ms
[2023-04-06 22:06:26] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 0 ms to minimize.
[2023-04-06 22:06:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2023-04-06 22:06:26] [INFO ] After 366ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-04-06 22:06:26] [INFO ] After 530ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 11 ms.
Support contains 4 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 597/597 transitions.
Applied a total of 0 rules in 9 ms. Remains 172 /172 variables (removed 0) and now considering 597/597 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 172/172 places, 597/597 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 597/597 transitions.
Applied a total of 0 rules in 8 ms. Remains 172 /172 variables (removed 0) and now considering 597/597 (removed 0) transitions.
[2023-04-06 22:06:26] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2023-04-06 22:06:26] [INFO ] Invariant cache hit.
[2023-04-06 22:06:27] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-04-06 22:06:27] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2023-04-06 22:06:27] [INFO ] Invariant cache hit.
[2023-04-06 22:06:27] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 22:06:27] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
[2023-04-06 22:06:27] [INFO ] Redundant transitions in 6 ms returned []
[2023-04-06 22:06:27] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2023-04-06 22:06:27] [INFO ] Invariant cache hit.
[2023-04-06 22:06:27] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 644 ms. Remains : 172/172 places, 597/597 transitions.
Graph (trivial) has 521 edges and 172 vertex of which 25 / 172 are part of one of the 5 SCC in 1 ms
Free SCC test removed 20 places
Drop transitions removed 75 transitions
Ensure Unique test removed 319 transitions
Reduce isomorphic transitions removed 394 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 152 transition count 170
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 119 transition count 170
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 67 place count 119 transition count 160
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 91 place count 105 transition count 160
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 171 place count 65 transition count 120
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 190 place count 65 transition count 101
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -75
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 204 place count 58 transition count 176
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 206 place count 58 transition count 174
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 210 place count 58 transition count 170
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 210 place count 58 transition count 169
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 212 place count 57 transition count 169
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 213 place count 57 transition count 168
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 214 place count 56 transition count 168
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 5 with 25 rules applied. Total rules applied 239 place count 56 transition count 168
Applied a total of 239 rules in 17 ms. Remains 56 /172 variables (removed 116) and now considering 168/597 (removed 429) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 168 rows 56 cols
[2023-04-06 22:06:27] [INFO ] Computed 12 invariants in 1 ms
[2023-04-06 22:06:27] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-06 22:06:27] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-04-06 22:06:27] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2023-04-06 22:06:27] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-06 22:06:27] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-06 22:06:27] [INFO ] After 26ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-06 22:06:27] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
[2023-04-06 22:06:27] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2023-04-06 22:06:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 49 ms
[2023-04-06 22:06:27] [INFO ] After 103ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-04-06 22:06:27] [INFO ] After 211ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (AND p0 p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 13 factoid took 235 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 4 out of 275 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 275/275 places, 700/700 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 275 transition count 695
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 270 transition count 695
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 10 place count 270 transition count 616
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 168 place count 191 transition count 616
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 206 place count 172 transition count 597
Applied a total of 206 rules in 22 ms. Remains 172 /275 variables (removed 103) and now considering 597/700 (removed 103) transitions.
[2023-04-06 22:06:28] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
// Phase 1: matrix 262 rows 172 cols
[2023-04-06 22:06:28] [INFO ] Computed 16 invariants in 2 ms
[2023-04-06 22:06:28] [INFO ] Implicit Places using invariants in 118 ms returned []
[2023-04-06 22:06:28] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2023-04-06 22:06:28] [INFO ] Invariant cache hit.
[2023-04-06 22:06:28] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 22:06:28] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
[2023-04-06 22:06:28] [INFO ] Redundant transitions in 4 ms returned []
[2023-04-06 22:06:28] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2023-04-06 22:06:28] [INFO ] Invariant cache hit.
[2023-04-06 22:06:28] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 172/275 places, 597/700 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 680 ms. Remains : 172/275 places, 597/700 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 : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (AND p0 p1)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (AND p0 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 119 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) 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 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-04-06 22:06:29] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2023-04-06 22:06:29] [INFO ] Invariant cache hit.
[2023-04-06 22:06:29] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-06 22:06:29] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-04-06 22:06:29] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 1 ms returned sat
[2023-04-06 22:06:29] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-06 22:06:29] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 22:06:29] [INFO ] After 49ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-06 22:06:29] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2023-04-06 22:06:29] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-04-06 22:06:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 83 ms
[2023-04-06 22:06:29] [INFO ] After 178ms 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:06:29] [INFO ] After 334ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 597/597 transitions.
Applied a total of 0 rules in 7 ms. Remains 172 /172 variables (removed 0) and now considering 597/597 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 172/172 places, 597/597 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 3) 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 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 850266 steps, run timeout after 3001 ms. (steps per millisecond=283 ) properties seen :{}
Probabilistic random walk after 850266 steps, saw 162371 distinct states, run finished after 3001 ms. (steps per millisecond=283 ) properties seen :0
Running SMT prover for 3 properties.
[2023-04-06 22:06:33] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2023-04-06 22:06:33] [INFO ] Invariant cache hit.
[2023-04-06 22:06:33] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-06 22:06:33] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-04-06 22:06:33] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 1 ms returned sat
[2023-04-06 22:06:33] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-06 22:06:33] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 22:06:33] [INFO ] After 46ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-06 22:06:33] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 0 ms to minimize.
[2023-04-06 22:06:33] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-04-06 22:06:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 104 ms
[2023-04-06 22:06:33] [INFO ] After 199ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-04-06 22:06:33] [INFO ] After 361ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 597/597 transitions.
Applied a total of 0 rules in 8 ms. Remains 172 /172 variables (removed 0) and now considering 597/597 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 172/172 places, 597/597 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 597/597 transitions.
Applied a total of 0 rules in 7 ms. Remains 172 /172 variables (removed 0) and now considering 597/597 (removed 0) transitions.
[2023-04-06 22:06:33] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2023-04-06 22:06:33] [INFO ] Invariant cache hit.
[2023-04-06 22:06:33] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-04-06 22:06:33] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2023-04-06 22:06:33] [INFO ] Invariant cache hit.
[2023-04-06 22:06:33] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 22:06:33] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
[2023-04-06 22:06:33] [INFO ] Redundant transitions in 4 ms returned []
[2023-04-06 22:06:33] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2023-04-06 22:06:33] [INFO ] Invariant cache hit.
[2023-04-06 22:06:34] [INFO ] Dead Transitions using invariants and state equation in 177 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 616 ms. Remains : 172/172 places, 597/597 transitions.
Graph (trivial) has 521 edges and 172 vertex of which 25 / 172 are part of one of the 5 SCC in 0 ms
Free SCC test removed 20 places
Drop transitions removed 75 transitions
Ensure Unique test removed 319 transitions
Reduce isomorphic transitions removed 394 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 152 transition count 170
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 119 transition count 170
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 67 place count 119 transition count 160
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 91 place count 105 transition count 160
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 171 place count 65 transition count 120
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 190 place count 65 transition count 101
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -75
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 204 place count 58 transition count 176
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 206 place count 58 transition count 174
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 210 place count 58 transition count 170
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 210 place count 58 transition count 169
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 212 place count 57 transition count 169
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 213 place count 57 transition count 168
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 214 place count 56 transition count 168
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 5 with 25 rules applied. Total rules applied 239 place count 56 transition count 168
Applied a total of 239 rules in 12 ms. Remains 56 /172 variables (removed 116) and now considering 168/597 (removed 429) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 168 rows 56 cols
[2023-04-06 22:06:34] [INFO ] Computed 12 invariants in 1 ms
[2023-04-06 22:06:34] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-06 22:06:34] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-04-06 22:06:34] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 0 ms returned sat
[2023-04-06 22:06:34] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-06 22:06:34] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-06 22:06:34] [INFO ] After 29ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-06 22:06:34] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
[2023-04-06 22:06:34] [INFO ] Deduced a trap composed of 2 places in 12 ms of which 1 ms to minimize.
[2023-04-06 22:06:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 47 ms
[2023-04-06 22:06:34] [INFO ] After 105ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-04-06 22:06:34] [INFO ] After 204ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (AND p0 p1)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (AND p0 p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p1 p0))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 14 factoid took 192 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 171 ms.
Product exploration explored 100000 steps with 0 reset in 171 ms.
Support contains 4 out of 172 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 172/172 places, 597/597 transitions.
Applied a total of 0 rules in 8 ms. Remains 172 /172 variables (removed 0) and now considering 597/597 (removed 0) transitions.
[2023-04-06 22:06:35] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
// Phase 1: matrix 262 rows 172 cols
[2023-04-06 22:06:35] [INFO ] Computed 16 invariants in 3 ms
[2023-04-06 22:06:35] [INFO ] Implicit Places using invariants in 124 ms returned []
[2023-04-06 22:06:35] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2023-04-06 22:06:35] [INFO ] Invariant cache hit.
[2023-04-06 22:06:35] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 22:06:35] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 452 ms to find 0 implicit places.
[2023-04-06 22:06:35] [INFO ] Redundant transitions in 6 ms returned []
[2023-04-06 22:06:35] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2023-04-06 22:06:35] [INFO ] Invariant cache hit.
[2023-04-06 22:06:35] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 655 ms. Remains : 172/172 places, 597/597 transitions.
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-08 finished in 15731 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((X(p1)&&p0))||G(p2))))'
Support contains 9 out of 282 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 282/282 places, 735/735 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 282 transition count 730
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 277 transition count 730
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 78 Pre rules applied. Total rules applied 10 place count 277 transition count 652
Deduced a syphon composed of 78 places in 0 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 156 rules applied. Total rules applied 166 place count 199 transition count 652
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 173 place count 192 transition count 617
Iterating global reduction 2 with 7 rules applied. Total rules applied 180 place count 192 transition count 617
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 220 place count 172 transition count 597
Applied a total of 220 rules in 19 ms. Remains 172 /282 variables (removed 110) and now considering 597/735 (removed 138) transitions.
[2023-04-06 22:06:35] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
// Phase 1: matrix 262 rows 172 cols
[2023-04-06 22:06:36] [INFO ] Computed 16 invariants in 6 ms
[2023-04-06 22:06:36] [INFO ] Implicit Places using invariants in 119 ms returned []
[2023-04-06 22:06:36] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2023-04-06 22:06:36] [INFO ] Invariant cache hit.
[2023-04-06 22:06:36] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 22:06:36] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
[2023-04-06 22:06:36] [INFO ] Redundant transitions in 4 ms returned []
[2023-04-06 22:06:36] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2023-04-06 22:06:36] [INFO ] Invariant cache hit.
[2023-04-06 22:06:36] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 172/282 places, 597/735 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 626 ms. Remains : 172/282 places, 597/735 transitions.
Stuttering acceptance computed with spot in 36 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1 p2), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (EQ s13 0) (EQ s81 0) (EQ s2 0) (EQ s11 0) (EQ s123 0)) (OR (EQ s15 0) (EQ s80 0))), p1:(AND (EQ s1 1) (EQ s130 1)), p2:(AND (EQ s15 1) (EQ s8...], nbAcceptance=2, 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 219 ms.
Stack based approach found an accepted trace after 23 steps with 0 reset with depth 24 and stack size 24 in 0 ms.
FORMULA EisenbergMcGuire-PT-05-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-12 finished in 896 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(p0)&&(F(p2)||p1)))||X(p3)))'
Support contains 9 out of 282 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 282/282 places, 735/735 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 275 transition count 700
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 275 transition count 700
Applied a total of 14 rules in 8 ms. Remains 275 /282 variables (removed 7) and now considering 700/735 (removed 35) transitions.
[2023-04-06 22:06:36] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
// Phase 1: matrix 365 rows 275 cols
[2023-04-06 22:06:36] [INFO ] Computed 16 invariants in 1 ms
[2023-04-06 22:06:37] [INFO ] Implicit Places using invariants in 121 ms returned []
[2023-04-06 22:06:37] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2023-04-06 22:06:37] [INFO ] Invariant cache hit.
[2023-04-06 22:06:37] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 22:06:37] [INFO ] Implicit Places using invariants and state equation in 502 ms returned []
Implicit Place search using SMT with State Equation took 626 ms to find 0 implicit places.
[2023-04-06 22:06:37] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2023-04-06 22:06:37] [INFO ] Invariant cache hit.
[2023-04-06 22:06:37] [INFO ] Dead Transitions using invariants and state equation in 208 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 275/282 places, 700/735 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 844 ms. Remains : 275/282 places, 700/735 transitions.
Stuttering acceptance computed with spot in 209 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND p1 (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p0), (NOT p2), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=2 dest: 4}, { cond=(NOT p3), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(OR (EQ s4 0) (EQ s18 0) (EQ s195 0)), p2:(OR (EQ s4 0) (EQ s18 0) (EQ s195 0)), p3:(OR (EQ s2 0) (EQ s13 0) (EQ s183 0)), p0:(OR (EQ s3 0) (EQ s16 0) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 327 ms.
Product exploration explored 100000 steps with 50000 reset in 338 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 p2 p3 p0), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X p3), (X (NOT (AND p1 (NOT p2) (NOT p3)))), true, (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 12 ms. Reduced automaton from 6 states, 11 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-05-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-13 finished in 1756 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((G(!p1) U (!p2&&G(!p1))))||p0)))'
Support contains 5 out of 282 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 282/282 places, 735/735 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 275 transition count 700
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 275 transition count 700
Applied a total of 14 rules in 9 ms. Remains 275 /282 variables (removed 7) and now considering 700/735 (removed 35) transitions.
[2023-04-06 22:06:38] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2023-04-06 22:06:38] [INFO ] Invariant cache hit.
[2023-04-06 22:06:38] [INFO ] Implicit Places using invariants in 133 ms returned []
[2023-04-06 22:06:38] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2023-04-06 22:06:38] [INFO ] Invariant cache hit.
[2023-04-06 22:06:38] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 22:06:39] [INFO ] Implicit Places using invariants and state equation in 461 ms returned []
Implicit Place search using SMT with State Equation took 597 ms to find 0 implicit places.
[2023-04-06 22:06:39] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2023-04-06 22:06:39] [INFO ] Invariant cache hit.
[2023-04-06 22:06:39] [INFO ] Dead Transitions using invariants and state equation in 213 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 275/282 places, 700/735 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 820 ms. Remains : 275/282 places, 700/735 transitions.
Stuttering acceptance computed with spot in 156 ms :[p1, (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), true, (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (OR p2 p1)]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 0}, { cond=p1, acceptance={0} source=4 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(AND (EQ s4 1) (EQ s19 1) (EQ s204 1)), p0:(OR (NEQ s4 1) (NEQ s17 1) (NEQ s191 1)), p2:(AND (EQ s4 1) (EQ s17 1) (EQ s191 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, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 328 ms.
Product exploration explored 100000 steps with 50000 reset in 324 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) p0 (NOT p2)), (X p0), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 12 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-05-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-14 finished in 1666 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 ((p0 U (p1 U p2)) U p2)))'
Support contains 3 out of 282 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 282/282 places, 735/735 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 282 transition count 731
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 278 transition count 731
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 8 place count 278 transition count 651
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 168 place count 198 transition count 651
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 174 place count 192 transition count 621
Iterating global reduction 2 with 6 rules applied. Total rules applied 180 place count 192 transition count 621
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 220 place count 172 transition count 601
Applied a total of 220 rules in 26 ms. Remains 172 /282 variables (removed 110) and now considering 601/735 (removed 134) transitions.
[2023-04-06 22:06:40] [INFO ] Flow matrix only has 266 transitions (discarded 335 similar events)
// Phase 1: matrix 266 rows 172 cols
[2023-04-06 22:06:40] [INFO ] Computed 16 invariants in 3 ms
[2023-04-06 22:06:40] [INFO ] Implicit Places using invariants in 116 ms returned []
[2023-04-06 22:06:40] [INFO ] Flow matrix only has 266 transitions (discarded 335 similar events)
[2023-04-06 22:06:40] [INFO ] Invariant cache hit.
[2023-04-06 22:06:40] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-04-06 22:06:40] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
[2023-04-06 22:06:40] [INFO ] Redundant transitions in 9 ms returned []
[2023-04-06 22:06:40] [INFO ] Flow matrix only has 266 transitions (discarded 335 similar events)
[2023-04-06 22:06:40] [INFO ] Invariant cache hit.
[2023-04-06 22:06:40] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 172/282 places, 601/735 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 645 ms. Remains : 172/282 places, 601/735 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p2)]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p2:(AND (EQ s2 1) (EQ s12 1) (EQ s122 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 132 ms.
Stack based approach found an accepted trace after 22 steps with 0 reset with depth 23 and stack size 23 in 0 ms.
FORMULA EisenbergMcGuire-PT-05-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-15 finished in 823 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((p1&&G(p2)))&&p0)))'
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((G(p0)||X(p1))))'
Found a Lengthening insensitive property : EisenbergMcGuire-PT-05-LTLFireability-08
Stuttering acceptance computed with spot in 137 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 4 out of 282 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 282/282 places, 735/735 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 282 transition count 730
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 277 transition count 730
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 10 place count 277 transition count 651
Deduced a syphon composed of 79 places in 1 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 168 place count 198 transition count 651
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 175 place count 191 transition count 616
Iterating global reduction 2 with 7 rules applied. Total rules applied 182 place count 191 transition count 616
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 220 place count 172 transition count 597
Applied a total of 220 rules in 23 ms. Remains 172 /282 variables (removed 110) and now considering 597/735 (removed 138) transitions.
[2023-04-06 22:06:41] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
// Phase 1: matrix 262 rows 172 cols
[2023-04-06 22:06:41] [INFO ] Computed 16 invariants in 2 ms
[2023-04-06 22:06:41] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-04-06 22:06:41] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2023-04-06 22:06:41] [INFO ] Invariant cache hit.
[2023-04-06 22:06:41] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 22:06:41] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
[2023-04-06 22:06:41] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2023-04-06 22:06:41] [INFO ] Invariant cache hit.
[2023-04-06 22:06:42] [INFO ] Dead Transitions using invariants and state equation in 172 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 172/282 places, 597/735 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 643 ms. Remains : 172/282 places, 597/735 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(EQ s36 0), p1:(OR (EQ s3 0) (EQ s15 0) (EQ s115 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 166 ms.
Product exploration explored 100000 steps with 0 reset in 171 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 p0 p1), (X (NOT (AND (NOT p0) p1))), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (AND p0 p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 161 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 6) seen :3
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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) 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 3) seen :0
Running SMT prover for 3 properties.
[2023-04-06 22:06:42] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2023-04-06 22:06:42] [INFO ] Invariant cache hit.
[2023-04-06 22:06:43] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-06 22:06:43] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-04-06 22:06:43] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 1 ms returned sat
[2023-04-06 22:06:43] [INFO ] After 69ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-06 22:06:43] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 22:06:43] [INFO ] After 43ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-06 22:06:43] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2023-04-06 22:06:43] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-04-06 22:06:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 81 ms
[2023-04-06 22:06:43] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2023-04-06 22:06:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2023-04-06 22:06:43] [INFO ] After 211ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-04-06 22:06:43] [INFO ] After 364ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 10 ms.
Support contains 4 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 597/597 transitions.
Applied a total of 0 rules in 8 ms. Remains 172 /172 variables (removed 0) and now considering 597/597 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 172/172 places, 597/597 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) 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 3) 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 3) seen :0
Interrupted probabilistic random walk after 679674 steps, run timeout after 3001 ms. (steps per millisecond=226 ) properties seen :{}
Probabilistic random walk after 679674 steps, saw 133621 distinct states, run finished after 3001 ms. (steps per millisecond=226 ) properties seen :0
Running SMT prover for 3 properties.
[2023-04-06 22:06:46] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2023-04-06 22:06:46] [INFO ] Invariant cache hit.
[2023-04-06 22:06:46] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-06 22:06:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-04-06 22:06:46] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 1 ms returned sat
[2023-04-06 22:06:46] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-06 22:06:46] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 22:06:46] [INFO ] After 44ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-06 22:06:46] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2023-04-06 22:06:47] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-04-06 22:06:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 96 ms
[2023-04-06 22:06:47] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2023-04-06 22:06:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2023-04-06 22:06:47] [INFO ] After 240ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-04-06 22:06:47] [INFO ] After 408ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 8 ms.
Support contains 4 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 597/597 transitions.
Applied a total of 0 rules in 8 ms. Remains 172 /172 variables (removed 0) and now considering 597/597 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 172/172 places, 597/597 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 597/597 transitions.
Applied a total of 0 rules in 7 ms. Remains 172 /172 variables (removed 0) and now considering 597/597 (removed 0) transitions.
[2023-04-06 22:06:47] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2023-04-06 22:06:47] [INFO ] Invariant cache hit.
[2023-04-06 22:06:47] [INFO ] Implicit Places using invariants in 120 ms returned []
[2023-04-06 22:06:47] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2023-04-06 22:06:47] [INFO ] Invariant cache hit.
[2023-04-06 22:06:47] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 22:06:47] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
[2023-04-06 22:06:47] [INFO ] Redundant transitions in 6 ms returned []
[2023-04-06 22:06:47] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2023-04-06 22:06:47] [INFO ] Invariant cache hit.
[2023-04-06 22:06:47] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 654 ms. Remains : 172/172 places, 597/597 transitions.
Graph (trivial) has 521 edges and 172 vertex of which 25 / 172 are part of one of the 5 SCC in 0 ms
Free SCC test removed 20 places
Drop transitions removed 75 transitions
Ensure Unique test removed 319 transitions
Reduce isomorphic transitions removed 394 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 152 transition count 170
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 119 transition count 170
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 67 place count 119 transition count 160
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 91 place count 105 transition count 160
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 171 place count 65 transition count 120
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 190 place count 65 transition count 101
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -75
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 204 place count 58 transition count 176
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 206 place count 58 transition count 174
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 210 place count 58 transition count 170
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 210 place count 58 transition count 169
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 212 place count 57 transition count 169
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 213 place count 57 transition count 168
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 214 place count 56 transition count 168
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 5 with 25 rules applied. Total rules applied 239 place count 56 transition count 168
Applied a total of 239 rules in 12 ms. Remains 56 /172 variables (removed 116) and now considering 168/597 (removed 429) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 168 rows 56 cols
[2023-04-06 22:06:47] [INFO ] Computed 12 invariants in 1 ms
[2023-04-06 22:06:47] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-06 22:06:47] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-04-06 22:06:47] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 0 ms returned sat
[2023-04-06 22:06:47] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-06 22:06:47] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-06 22:06:47] [INFO ] After 20ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-06 22:06:47] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
[2023-04-06 22:06:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2023-04-06 22:06:48] [INFO ] After 75ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-04-06 22:06:48] [INFO ] After 171ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (AND p0 p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 13 factoid took 213 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 4 out of 172 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 172/172 places, 597/597 transitions.
Applied a total of 0 rules in 12 ms. Remains 172 /172 variables (removed 0) and now considering 597/597 (removed 0) transitions.
[2023-04-06 22:06:48] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
// Phase 1: matrix 262 rows 172 cols
[2023-04-06 22:06:48] [INFO ] Computed 16 invariants in 1 ms
[2023-04-06 22:06:48] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-04-06 22:06:48] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2023-04-06 22:06:48] [INFO ] Invariant cache hit.
[2023-04-06 22:06:48] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 22:06:48] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
[2023-04-06 22:06:48] [INFO ] Redundant transitions in 6 ms returned []
[2023-04-06 22:06:48] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2023-04-06 22:06:48] [INFO ] Invariant cache hit.
[2023-04-06 22:06:49] [INFO ] Dead Transitions using invariants and state equation in 183 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 633 ms. Remains : 172/172 places, 597/597 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 : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (AND p0 p1)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (AND p0 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 112 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) 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 3) seen :0
Running SMT prover for 3 properties.
[2023-04-06 22:06:49] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2023-04-06 22:06:49] [INFO ] Invariant cache hit.
[2023-04-06 22:06:49] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-06 22:06:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-04-06 22:06:49] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 1 ms returned sat
[2023-04-06 22:06:49] [INFO ] After 77ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-06 22:06:49] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 22:06:49] [INFO ] After 54ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-06 22:06:49] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-04-06 22:06:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2023-04-06 22:06:49] [INFO ] After 156ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-04-06 22:06:50] [INFO ] After 323ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 11 ms.
Support contains 4 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 597/597 transitions.
Applied a total of 0 rules in 7 ms. Remains 172 /172 variables (removed 0) and now considering 597/597 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 172/172 places, 597/597 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 3) 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 3) 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 3) 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 3) seen :0
Interrupted probabilistic random walk after 555564 steps, run timeout after 3001 ms. (steps per millisecond=185 ) properties seen :{}
Probabilistic random walk after 555564 steps, saw 111278 distinct states, run finished after 3001 ms. (steps per millisecond=185 ) properties seen :0
Running SMT prover for 3 properties.
[2023-04-06 22:06:53] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2023-04-06 22:06:53] [INFO ] Invariant cache hit.
[2023-04-06 22:06:53] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-06 22:06:53] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-04-06 22:06:53] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 1 ms returned sat
[2023-04-06 22:06:53] [INFO ] After 78ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-06 22:06:53] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 22:06:53] [INFO ] After 54ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-06 22:06:53] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-04-06 22:06:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2023-04-06 22:06:53] [INFO ] After 167ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-04-06 22:06:53] [INFO ] After 352ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 10 ms.
Support contains 4 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 597/597 transitions.
Applied a total of 0 rules in 7 ms. Remains 172 /172 variables (removed 0) and now considering 597/597 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 172/172 places, 597/597 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 597/597 transitions.
Applied a total of 0 rules in 6 ms. Remains 172 /172 variables (removed 0) and now considering 597/597 (removed 0) transitions.
[2023-04-06 22:06:53] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2023-04-06 22:06:53] [INFO ] Invariant cache hit.
[2023-04-06 22:06:53] [INFO ] Implicit Places using invariants in 117 ms returned []
[2023-04-06 22:06:53] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2023-04-06 22:06:53] [INFO ] Invariant cache hit.
[2023-04-06 22:06:53] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 22:06:54] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 444 ms to find 0 implicit places.
[2023-04-06 22:06:54] [INFO ] Redundant transitions in 7 ms returned []
[2023-04-06 22:06:54] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2023-04-06 22:06:54] [INFO ] Invariant cache hit.
[2023-04-06 22:06:54] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 641 ms. Remains : 172/172 places, 597/597 transitions.
Graph (trivial) has 521 edges and 172 vertex of which 25 / 172 are part of one of the 5 SCC in 0 ms
Free SCC test removed 20 places
Drop transitions removed 75 transitions
Ensure Unique test removed 319 transitions
Reduce isomorphic transitions removed 394 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 152 transition count 170
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 119 transition count 170
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 67 place count 119 transition count 160
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 91 place count 105 transition count 160
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 171 place count 65 transition count 120
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 190 place count 65 transition count 101
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -75
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 204 place count 58 transition count 176
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 206 place count 58 transition count 174
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 210 place count 58 transition count 170
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 210 place count 58 transition count 169
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 212 place count 57 transition count 169
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 213 place count 57 transition count 168
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 214 place count 56 transition count 168
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 5 with 25 rules applied. Total rules applied 239 place count 56 transition count 168
Applied a total of 239 rules in 12 ms. Remains 56 /172 variables (removed 116) and now considering 168/597 (removed 429) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 168 rows 56 cols
[2023-04-06 22:06:54] [INFO ] Computed 12 invariants in 1 ms
[2023-04-06 22:06:54] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-06 22:06:54] [INFO ] [Nat]Absence check using 11 positive place invariants in 1 ms returned sat
[2023-04-06 22:06:54] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 0 ms returned sat
[2023-04-06 22:06:54] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-06 22:06:54] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-06 22:06:54] [INFO ] After 25ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-06 22:06:54] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-04-06 22:06:54] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 0 ms to minimize.
[2023-04-06 22:06:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 50 ms
[2023-04-06 22:06:54] [INFO ] After 106ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-04-06 22:06:54] [INFO ] After 205ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (AND p0 p1)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (AND p0 p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p1 p0))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 14 factoid took 200 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 166 ms.
Product exploration explored 100000 steps with 0 reset in 184 ms.
Support contains 4 out of 172 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 172/172 places, 597/597 transitions.
Applied a total of 0 rules in 7 ms. Remains 172 /172 variables (removed 0) and now considering 597/597 (removed 0) transitions.
[2023-04-06 22:06:55] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
// Phase 1: matrix 262 rows 172 cols
[2023-04-06 22:06:55] [INFO ] Computed 16 invariants in 1 ms
[2023-04-06 22:06:55] [INFO ] Implicit Places using invariants in 119 ms returned []
[2023-04-06 22:06:55] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2023-04-06 22:06:55] [INFO ] Invariant cache hit.
[2023-04-06 22:06:55] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 22:06:55] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 451 ms to find 0 implicit places.
[2023-04-06 22:06:55] [INFO ] Redundant transitions in 4 ms returned []
[2023-04-06 22:06:55] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2023-04-06 22:06:55] [INFO ] Invariant cache hit.
[2023-04-06 22:06:56] [INFO ] Dead Transitions using invariants and state equation in 172 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 643 ms. Remains : 172/172 places, 597/597 transitions.
Treatment of property EisenbergMcGuire-PT-05-LTLFireability-08 finished in 14898 ms.
[2023-04-06 22:06:56] [INFO ] Flatten gal took : 35 ms
[2023-04-06 22:06:56] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-04-06 22:06:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 282 places, 735 transitions and 3340 arcs took 9 ms.
Total runtime 74838 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT EisenbergMcGuire-PT-05
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLFireability

FORMULA EisenbergMcGuire-PT-05-LTLFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1680818867433

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../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/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:550
lola: rewrite Frontend/Parser/formula_rewrite.k:550
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 3 (type EXCL) for 0 EisenbergMcGuire-PT-05-LTLFireability-07
lola: time limit : 900 sec
lola: memory limit: 32 pages
lola: FINISHED task # 3 (type EXCL) for EisenbergMcGuire-PT-05-LTLFireability-07
lola: result : true
lola: markings : 6
lola: fired transitions : 5
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 12 (type EXCL) for 11 EisenbergMcGuire-PT-05-LTLFireability-08
lola: time limit : 1200 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-05-LTLFireability-07: CONJ 0 2 0 0 4 0 0 0
EisenbergMcGuire-PT-05-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
12 LTL EXCL 5/1200 6/32 EisenbergMcGuire-PT-05-LTLFireability-08 795649 m, 159129 m/sec, 2088497 t fired, .

Time elapsed: 5 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-05-LTLFireability-07: CONJ 0 2 0 0 4 0 0 0
EisenbergMcGuire-PT-05-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
12 LTL EXCL 10/1200 10/32 EisenbergMcGuire-PT-05-LTLFireability-08 1408477 m, 122565 m/sec, 4235729 t fired, .

Time elapsed: 10 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-05-LTLFireability-07: CONJ 0 2 0 0 4 0 0 0
EisenbergMcGuire-PT-05-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
12 LTL EXCL 15/1200 13/32 EisenbergMcGuire-PT-05-LTLFireability-08 1933199 m, 104944 m/sec, 6459829 t fired, .

Time elapsed: 15 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-05-LTLFireability-07: CONJ 0 2 0 0 4 0 0 0
EisenbergMcGuire-PT-05-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
12 LTL EXCL 20/1200 16/32 EisenbergMcGuire-PT-05-LTLFireability-08 2418165 m, 96993 m/sec, 8838631 t fired, .

Time elapsed: 20 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-05-LTLFireability-07: CONJ 0 2 0 0 4 0 0 0
EisenbergMcGuire-PT-05-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
12 LTL EXCL 25/1200 19/32 EisenbergMcGuire-PT-05-LTLFireability-08 2916381 m, 99643 m/sec, 11312337 t fired, .

Time elapsed: 25 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-05-LTLFireability-07: CONJ 0 2 0 0 4 0 0 0
EisenbergMcGuire-PT-05-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
12 LTL EXCL 30/1200 23/32 EisenbergMcGuire-PT-05-LTLFireability-08 3414404 m, 99604 m/sec, 13774179 t fired, .

Time elapsed: 30 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-05-LTLFireability-07: CONJ 0 2 0 0 4 0 0 0
EisenbergMcGuire-PT-05-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
12 LTL EXCL 35/1200 26/32 EisenbergMcGuire-PT-05-LTLFireability-08 3927972 m, 102713 m/sec, 16320339 t fired, .

Time elapsed: 35 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-05-LTLFireability-07: CONJ 0 2 0 0 4 0 0 0
EisenbergMcGuire-PT-05-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
12 LTL EXCL 40/1200 29/32 EisenbergMcGuire-PT-05-LTLFireability-08 4442000 m, 102805 m/sec, 18852390 t fired, .

Time elapsed: 40 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-05-LTLFireability-07: CONJ 0 2 0 0 4 0 0 0
EisenbergMcGuire-PT-05-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
12 LTL EXCL 45/1200 32/32 EisenbergMcGuire-PT-05-LTLFireability-08 4934263 m, 98452 m/sec, 21293754 t fired, .

Time elapsed: 45 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 12 (type EXCL) for EisenbergMcGuire-PT-05-LTLFireability-08 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-05-LTLFireability-07: CONJ 0 2 0 0 4 0 0 0
EisenbergMcGuire-PT-05-LTLFireability-08: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 50 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 9 (type EXCL) for 0 EisenbergMcGuire-PT-05-LTLFireability-07
lola: time limit : 1775 sec
lola: memory limit: 32 pages
lola: FINISHED task # 9 (type EXCL) for EisenbergMcGuire-PT-05-LTLFireability-07
lola: result : false
lola: markings : 24541
lola: fired transitions : 43650
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open tasks 2

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
EisenbergMcGuire-PT-05-LTLFireability-07: CONJ false LTL model checker
EisenbergMcGuire-PT-05-LTLFireability-08: LTL unknown AGGR


Time elapsed: 50 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="EisenbergMcGuire-PT-05"
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-05, 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-167987245000236"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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