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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 6.5K Mar 23 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Mar 23 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 17K Mar 23 15:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 176K Mar 23 15:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Mar 23 15:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 23 15:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 1.2M 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-07-LTLFireability-00
FORMULA_NAME EisenbergMcGuire-PT-07-LTLFireability-01
FORMULA_NAME EisenbergMcGuire-PT-07-LTLFireability-02
FORMULA_NAME EisenbergMcGuire-PT-07-LTLFireability-03
FORMULA_NAME EisenbergMcGuire-PT-07-LTLFireability-04
FORMULA_NAME EisenbergMcGuire-PT-07-LTLFireability-05
FORMULA_NAME EisenbergMcGuire-PT-07-LTLFireability-06
FORMULA_NAME EisenbergMcGuire-PT-07-LTLFireability-07
FORMULA_NAME EisenbergMcGuire-PT-07-LTLFireability-08
FORMULA_NAME EisenbergMcGuire-PT-07-LTLFireability-09
FORMULA_NAME EisenbergMcGuire-PT-07-LTLFireability-10
FORMULA_NAME EisenbergMcGuire-PT-07-LTLFireability-11
FORMULA_NAME EisenbergMcGuire-PT-07-LTLFireability-12
FORMULA_NAME EisenbergMcGuire-PT-07-LTLFireability-13
FORMULA_NAME EisenbergMcGuire-PT-07-LTLFireability-14
FORMULA_NAME EisenbergMcGuire-PT-07-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1680819245774

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-07
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2023-04-06 22:14:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-06 22:14:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 22:14:07] [INFO ] Load time of PNML (sax parser for PT used): 120 ms
[2023-04-06 22:14:07] [INFO ] Transformed 553 places.
[2023-04-06 22:14:07] [INFO ] Transformed 1960 transitions.
[2023-04-06 22:14:07] [INFO ] Found NUPN structural information;
[2023-04-06 22:14:07] [INFO ] Parsed PT model containing 553 places and 1960 transitions and 9212 arcs in 193 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA EisenbergMcGuire-PT-07-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-07-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-07-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 553/553 places, 1960/1960 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 515 transition count 1694
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 515 transition count 1694
Applied a total of 76 rules in 89 ms. Remains 515 /553 variables (removed 38) and now considering 1694/1960 (removed 266) transitions.
[2023-04-06 22:14:07] [INFO ] Flow matrix only has 735 transitions (discarded 959 similar events)
// Phase 1: matrix 735 rows 515 cols
[2023-04-06 22:14:07] [INFO ] Computed 22 invariants in 24 ms
[2023-04-06 22:14:08] [INFO ] Implicit Places using invariants in 464 ms returned []
[2023-04-06 22:14:08] [INFO ] Flow matrix only has 735 transitions (discarded 959 similar events)
[2023-04-06 22:14:08] [INFO ] Invariant cache hit.
[2023-04-06 22:14:08] [INFO ] State equation strengthened by 244 read => feed constraints.
[2023-04-06 22:14:09] [INFO ] Implicit Places using invariants and state equation in 1427 ms returned []
Implicit Place search using SMT with State Equation took 1919 ms to find 0 implicit places.
[2023-04-06 22:14:09] [INFO ] Flow matrix only has 735 transitions (discarded 959 similar events)
[2023-04-06 22:14:09] [INFO ] Invariant cache hit.
[2023-04-06 22:14:10] [INFO ] Dead Transitions using invariants and state equation in 570 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 515/553 places, 1694/1960 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2580 ms. Remains : 515/553 places, 1694/1960 transitions.
Support contains 47 out of 515 places after structural reductions.
[2023-04-06 22:14:10] [INFO ] Flatten gal took : 127 ms
[2023-04-06 22:14:10] [INFO ] Flatten gal took : 93 ms
[2023-04-06 22:14:10] [INFO ] Input system was already deterministic with 1694 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 484 ms. (steps per millisecond=20 ) properties (out of 31) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) seen :0
Running SMT prover for 26 properties.
[2023-04-06 22:14:11] [INFO ] Flow matrix only has 735 transitions (discarded 959 similar events)
[2023-04-06 22:14:11] [INFO ] Invariant cache hit.
[2023-04-06 22:14:11] [INFO ] [Real]Absence check using 15 positive place invariants in 12 ms returned sat
[2023-04-06 22:14:11] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 4 ms returned sat
[2023-04-06 22:14:11] [INFO ] After 392ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:26
[2023-04-06 22:14:12] [INFO ] [Nat]Absence check using 15 positive place invariants in 12 ms returned sat
[2023-04-06 22:14:12] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 4 ms returned sat
[2023-04-06 22:14:13] [INFO ] After 973ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :26
[2023-04-06 22:14:13] [INFO ] State equation strengthened by 244 read => feed constraints.
[2023-04-06 22:14:14] [INFO ] After 1068ms SMT Verify possible using 244 Read/Feed constraints in natural domain returned unsat :0 sat :26
[2023-04-06 22:14:14] [INFO ] Deduced a trap composed of 3 places in 142 ms of which 4 ms to minimize.
[2023-04-06 22:14:14] [INFO ] Deduced a trap composed of 3 places in 173 ms of which 0 ms to minimize.
[2023-04-06 22:14:15] [INFO ] Deduced a trap composed of 64 places in 168 ms of which 1 ms to minimize.
[2023-04-06 22:14:15] [INFO ] Deduced a trap composed of 38 places in 94 ms of which 1 ms to minimize.
[2023-04-06 22:14:15] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 1 ms to minimize.
[2023-04-06 22:14:15] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 0 ms to minimize.
[2023-04-06 22:14:15] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 0 ms to minimize.
[2023-04-06 22:14:15] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 0 ms to minimize.
[2023-04-06 22:14:15] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 1 ms to minimize.
[2023-04-06 22:14:15] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 0 ms to minimize.
[2023-04-06 22:14:15] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 1 ms to minimize.
[2023-04-06 22:14:15] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 0 ms to minimize.
[2023-04-06 22:14:16] [INFO ] Deduced a trap composed of 46 places in 87 ms of which 1 ms to minimize.
[2023-04-06 22:14:16] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1730 ms
[2023-04-06 22:14:16] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 0 ms to minimize.
[2023-04-06 22:14:16] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 0 ms to minimize.
[2023-04-06 22:14:16] [INFO ] Deduced a trap composed of 66 places in 63 ms of which 0 ms to minimize.
[2023-04-06 22:14:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 388 ms
[2023-04-06 22:14:16] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2023-04-06 22:14:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2023-04-06 22:14:17] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 1 ms to minimize.
[2023-04-06 22:14:17] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 0 ms to minimize.
[2023-04-06 22:14:17] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 0 ms to minimize.
[2023-04-06 22:14:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 343 ms
[2023-04-06 22:14:17] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 1 ms to minimize.
[2023-04-06 22:14:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2023-04-06 22:14:17] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 1 ms to minimize.
[2023-04-06 22:14:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2023-04-06 22:14:18] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 1 ms to minimize.
[2023-04-06 22:14:18] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 1 ms to minimize.
[2023-04-06 22:14:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 260 ms
[2023-04-06 22:14:18] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 0 ms to minimize.
[2023-04-06 22:14:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2023-04-06 22:14:19] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 0 ms to minimize.
[2023-04-06 22:14:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2023-04-06 22:14:19] [INFO ] After 6036ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :26
Attempting to minimize the solution found.
Minimization took 1423 ms.
[2023-04-06 22:14:20] [INFO ] After 8944ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :26
Parikh walk visited 0 properties in 597 ms.
Support contains 42 out of 515 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 515/515 places, 1694/1694 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 515 transition count 1691
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 512 transition count 1691
Performed 148 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 148 Pre rules applied. Total rules applied 6 place count 512 transition count 1543
Deduced a syphon composed of 148 places in 1 ms
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 2 with 296 rules applied. Total rules applied 302 place count 364 transition count 1543
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 303 place count 363 transition count 1536
Iterating global reduction 2 with 1 rules applied. Total rules applied 304 place count 363 transition count 1536
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 388 place count 321 transition count 1494
Applied a total of 388 rules in 158 ms. Remains 321 /515 variables (removed 194) and now considering 1494/1694 (removed 200) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 158 ms. Remains : 321/515 places, 1494/1694 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 242 ms. (steps per millisecond=41 ) properties (out of 26) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 25) 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 25) 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 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 25) 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 25) 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 25) 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 25) 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 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 25) 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 25) 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 25) 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 25) 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 25) seen :0
Interrupted probabilistic random walk after 220360 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :{0=1, 1=1, 2=1, 8=1, 11=1, 12=1, 14=1, 16=1, 19=1, 20=1, 21=1, 22=1, 23=1}
Probabilistic random walk after 220360 steps, saw 112945 distinct states, run finished after 3002 ms. (steps per millisecond=73 ) properties seen :13
Running SMT prover for 12 properties.
[2023-04-06 22:14:24] [INFO ] Flow matrix only has 535 transitions (discarded 959 similar events)
// Phase 1: matrix 535 rows 321 cols
[2023-04-06 22:14:24] [INFO ] Computed 22 invariants in 3 ms
[2023-04-06 22:14:25] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-04-06 22:14:25] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 4 ms returned sat
[2023-04-06 22:14:25] [INFO ] After 132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-04-06 22:14:25] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-06 22:14:25] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 22:14:25] [INFO ] After 351ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-04-06 22:14:25] [INFO ] State equation strengthened by 238 read => feed constraints.
[2023-04-06 22:14:25] [INFO ] After 357ms SMT Verify possible using 238 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2023-04-06 22:14:26] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 0 ms to minimize.
[2023-04-06 22:14:26] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 1 ms to minimize.
[2023-04-06 22:14:26] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 0 ms to minimize.
[2023-04-06 22:14:26] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 0 ms to minimize.
[2023-04-06 22:14:26] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-04-06 22:14:26] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 473 ms
[2023-04-06 22:14:26] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 0 ms to minimize.
[2023-04-06 22:14:26] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2023-04-06 22:14:26] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 0 ms to minimize.
[2023-04-06 22:14:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 252 ms
[2023-04-06 22:14:26] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 0 ms to minimize.
[2023-04-06 22:14:26] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-04-06 22:14:26] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 0 ms to minimize.
[2023-04-06 22:14:27] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2023-04-06 22:14:27] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2023-04-06 22:14:27] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-04-06 22:14:27] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 0 ms to minimize.
[2023-04-06 22:14:27] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 527 ms
[2023-04-06 22:14:27] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 0 ms to minimize.
[2023-04-06 22:14:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2023-04-06 22:14:27] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2023-04-06 22:14:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2023-04-06 22:14:27] [INFO ] After 2239ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 362 ms.
[2023-04-06 22:14:28] [INFO ] After 3122ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Parikh walk visited 0 properties in 86 ms.
Support contains 24 out of 321 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 321/321 places, 1494/1494 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 321 transition count 1487
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 314 transition count 1487
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 311 transition count 1466
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 311 transition count 1466
Applied a total of 20 rules in 76 ms. Remains 311 /321 variables (removed 10) and now considering 1466/1494 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 311/321 places, 1466/1494 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 216648 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :{}
Probabilistic random walk after 216648 steps, saw 106738 distinct states, run finished after 3002 ms. (steps per millisecond=72 ) properties seen :0
Running SMT prover for 12 properties.
[2023-04-06 22:14:31] [INFO ] Flow matrix only has 507 transitions (discarded 959 similar events)
// Phase 1: matrix 507 rows 311 cols
[2023-04-06 22:14:31] [INFO ] Computed 22 invariants in 2 ms
[2023-04-06 22:14:32] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-06 22:14:32] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 4 ms returned sat
[2023-04-06 22:14:32] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-04-06 22:14:32] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-06 22:14:32] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 22:14:32] [INFO ] After 337ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-04-06 22:14:32] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 22:14:33] [INFO ] After 375ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2023-04-06 22:14:33] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 0 ms to minimize.
[2023-04-06 22:14:33] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 0 ms to minimize.
[2023-04-06 22:14:33] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 0 ms to minimize.
[2023-04-06 22:14:33] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 1 ms to minimize.
[2023-04-06 22:14:33] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 0 ms to minimize.
[2023-04-06 22:14:33] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-04-06 22:14:33] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 583 ms
[2023-04-06 22:14:33] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-04-06 22:14:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2023-04-06 22:14:33] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2023-04-06 22:14:33] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 0 ms to minimize.
[2023-04-06 22:14:33] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2023-04-06 22:14:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 237 ms
[2023-04-06 22:14:34] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 0 ms to minimize.
[2023-04-06 22:14:34] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 6 ms to minimize.
[2023-04-06 22:14:34] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 0 ms to minimize.
[2023-04-06 22:14:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 278 ms
[2023-04-06 22:14:34] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2023-04-06 22:14:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2023-04-06 22:14:34] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 0 ms to minimize.
[2023-04-06 22:14:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2023-04-06 22:14:34] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 0 ms to minimize.
[2023-04-06 22:14:34] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 0 ms to minimize.
[2023-04-06 22:14:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 166 ms
[2023-04-06 22:14:34] [INFO ] After 2265ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 342 ms.
[2023-04-06 22:14:35] [INFO ] After 3126ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Parikh walk visited 0 properties in 75 ms.
Support contains 24 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 1466/1466 transitions.
Applied a total of 0 rules in 36 ms. Remains 311 /311 variables (removed 0) and now considering 1466/1466 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 311/311 places, 1466/1466 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 1466/1466 transitions.
Applied a total of 0 rules in 36 ms. Remains 311 /311 variables (removed 0) and now considering 1466/1466 (removed 0) transitions.
[2023-04-06 22:14:35] [INFO ] Flow matrix only has 507 transitions (discarded 959 similar events)
[2023-04-06 22:14:35] [INFO ] Invariant cache hit.
[2023-04-06 22:14:35] [INFO ] Implicit Places using invariants in 396 ms returned []
[2023-04-06 22:14:35] [INFO ] Flow matrix only has 507 transitions (discarded 959 similar events)
[2023-04-06 22:14:35] [INFO ] Invariant cache hit.
[2023-04-06 22:14:35] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 22:14:36] [INFO ] Implicit Places using invariants and state equation in 869 ms returned []
Implicit Place search using SMT with State Equation took 1272 ms to find 0 implicit places.
[2023-04-06 22:14:36] [INFO ] Redundant transitions in 90 ms returned []
[2023-04-06 22:14:36] [INFO ] Flow matrix only has 507 transitions (discarded 959 similar events)
[2023-04-06 22:14:36] [INFO ] Invariant cache hit.
[2023-04-06 22:14:37] [INFO ] Dead Transitions using invariants and state equation in 423 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1836 ms. Remains : 311/311 places, 1466/1466 transitions.
Graph (trivial) has 1179 edges and 311 vertex of which 49 / 311 are part of one of the 7 SCC in 3 ms
Free SCC test removed 42 places
Drop transitions removed 161 transitions
Ensure Unique test removed 924 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 269 transition count 325
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 113 place count 213 transition count 325
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 113 place count 213 transition count 310
Deduced a syphon composed of 15 places in 1 ms
Ensure Unique test removed 7 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 150 place count 191 transition count 310
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 150 rules applied. Total rules applied 300 place count 116 transition count 235
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 2 with 27 rules applied. Total rules applied 327 place count 116 transition count 208
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 333 place count 113 transition count 208
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 336 place count 113 transition count 205
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 347 place count 113 transition count 194
Free-agglomeration rule applied 48 times.
Iterating global reduction 4 with 48 rules applied. Total rules applied 395 place count 113 transition count 146
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 4 with 48 rules applied. Total rules applied 443 place count 65 transition count 146
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 451 place count 65 transition count 146
Applied a total of 451 rules in 31 ms. Remains 65 /311 variables (removed 246) and now considering 146/1466 (removed 1320) transitions.
Running SMT prover for 12 properties.
// Phase 1: matrix 146 rows 65 cols
[2023-04-06 22:14:37] [INFO ] Computed 15 invariants in 1 ms
[2023-04-06 22:14:37] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-04-06 22:14:37] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-04-06 22:14:37] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-04-06 22:14:37] [INFO ] After 88ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-04-06 22:14:37] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-06 22:14:37] [INFO ] After 71ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2023-04-06 22:14:37] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
[2023-04-06 22:14:37] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
[2023-04-06 22:14:37] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 3 ms to minimize.
[2023-04-06 22:14:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 89 ms
[2023-04-06 22:14:37] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2023-04-06 22:14:37] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2023-04-06 22:14:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 54 ms
[2023-04-06 22:14:37] [INFO ] After 303ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 75 ms.
[2023-04-06 22:14:37] [INFO ] After 521ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 4 out of 515 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 1694/1694 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 512 transition count 1673
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 512 transition count 1673
Applied a total of 6 rules in 30 ms. Remains 512 /515 variables (removed 3) and now considering 1673/1694 (removed 21) transitions.
[2023-04-06 22:14:38] [INFO ] Flow matrix only has 714 transitions (discarded 959 similar events)
// Phase 1: matrix 714 rows 512 cols
[2023-04-06 22:14:38] [INFO ] Computed 22 invariants in 9 ms
[2023-04-06 22:14:38] [INFO ] Implicit Places using invariants in 289 ms returned []
[2023-04-06 22:14:38] [INFO ] Flow matrix only has 714 transitions (discarded 959 similar events)
[2023-04-06 22:14:38] [INFO ] Invariant cache hit.
[2023-04-06 22:14:38] [INFO ] State equation strengthened by 226 read => feed constraints.
[2023-04-06 22:14:40] [INFO ] Implicit Places using invariants and state equation in 1675 ms returned []
Implicit Place search using SMT with State Equation took 1966 ms to find 0 implicit places.
[2023-04-06 22:14:40] [INFO ] Flow matrix only has 714 transitions (discarded 959 similar events)
[2023-04-06 22:14:40] [INFO ] Invariant cache hit.
[2023-04-06 22:14:40] [INFO ] Dead Transitions using invariants and state equation in 558 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 512/515 places, 1673/1694 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2559 ms. Remains : 512/515 places, 1673/1694 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 331 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s5 1) (EQ s133 1) (OR (NEQ s8 1) (NEQ s103 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA EisenbergMcGuire-PT-07-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-07-LTLFireability-01 finished in 2952 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((((F(p2) U p3)&&p1)||p0)))||G(p3)))'
Support contains 6 out of 515 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 515/515 places, 1694/1694 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 515 transition count 1687
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 508 transition count 1687
Performed 153 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 153 Pre rules applied. Total rules applied 14 place count 508 transition count 1534
Deduced a syphon composed of 153 places in 1 ms
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 2 with 306 rules applied. Total rules applied 320 place count 355 transition count 1534
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 324 place count 351 transition count 1506
Iterating global reduction 2 with 4 rules applied. Total rules applied 328 place count 351 transition count 1506
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 412 place count 309 transition count 1464
Applied a total of 412 rules in 104 ms. Remains 309 /515 variables (removed 206) and now considering 1464/1694 (removed 230) transitions.
[2023-04-06 22:14:41] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
// Phase 1: matrix 505 rows 309 cols
[2023-04-06 22:14:41] [INFO ] Computed 22 invariants in 2 ms
[2023-04-06 22:14:41] [INFO ] Implicit Places using invariants in 348 ms returned []
[2023-04-06 22:14:41] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-06 22:14:41] [INFO ] Invariant cache hit.
[2023-04-06 22:14:41] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 22:14:42] [INFO ] Implicit Places using invariants and state equation in 887 ms returned []
Implicit Place search using SMT with State Equation took 1236 ms to find 0 implicit places.
[2023-04-06 22:14:42] [INFO ] Redundant transitions in 72 ms returned []
[2023-04-06 22:14:42] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-06 22:14:42] [INFO ] Invariant cache hit.
[2023-04-06 22:14:42] [INFO ] Dead Transitions using invariants and state equation in 420 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 309/515 places, 1464/1694 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1838 ms. Remains : 309/515 places, 1464/1694 transitions.
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p3, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p3), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p1 (NOT p0) (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p3) p1 (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p3) p1 (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p3) p1 (NOT p0)), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) p1 (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(OR (AND (NOT p3) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0) (NOT p2))), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p3:(AND (EQ s4 1) (EQ s21 1) (EQ s223 1)), p1:(AND (EQ s13 1) (EQ s140 1)), p0:(OR (EQ s4 0) (EQ s21 0) (EQ s214 0)), p2:(AND (EQ s4 1) (EQ s21 1) (EQ s21...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 391 ms.
Product exploration explored 100000 steps with 0 reset in 313 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 p3) (NOT p1) p0 (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p3) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p3) p1 (NOT p0)))), (X (NOT (OR (AND (NOT p3) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0) (NOT p2))))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p3) p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p3))), true, (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p3) p1 (NOT p0))))), (X (X (NOT (OR (AND (NOT p3) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p3) p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 129 ms. Reduced automaton from 5 states, 15 edges and 4 AP (stutter insensitive) to 4 states, 10 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 186 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 382416 steps, run timeout after 3001 ms. (steps per millisecond=127 ) properties seen :{0=1, 5=1}
Probabilistic random walk after 382416 steps, saw 158316 distinct states, run finished after 3001 ms. (steps per millisecond=127 ) properties seen :2
Running SMT prover for 4 properties.
[2023-04-06 22:14:47] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-06 22:14:47] [INFO ] Invariant cache hit.
[2023-04-06 22:14:47] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-06 22:14:47] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-06 22:14:47] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 22:14:47] [INFO ] After 119ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :1
[2023-04-06 22:14:47] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 22:14:47] [INFO ] After 47ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :3 sat :1
[2023-04-06 22:14:47] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 0 ms to minimize.
[2023-04-06 22:14:48] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 0 ms to minimize.
[2023-04-06 22:14:48] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2023-04-06 22:14:48] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 0 ms to minimize.
[2023-04-06 22:14:48] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 0 ms to minimize.
[2023-04-06 22:14:48] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-04-06 22:14:48] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 466 ms
[2023-04-06 22:14:48] [INFO ] After 540ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-04-06 22:14:48] [INFO ] After 772ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :1
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 309 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 309/309 places, 1464/1464 transitions.
Applied a total of 0 rules in 39 ms. Remains 309 /309 variables (removed 0) and now considering 1464/1464 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 309/309 places, 1464/1464 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 706016 steps, run timeout after 3001 ms. (steps per millisecond=235 ) properties seen :{}
Probabilistic random walk after 706016 steps, saw 244184 distinct states, run finished after 3001 ms. (steps per millisecond=235 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 22:14:51] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-06 22:14:51] [INFO ] Invariant cache hit.
[2023-04-06 22:14:51] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:14:51] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-06 22:14:51] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 22:14:51] [INFO ] After 116ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:14:51] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 22:14:51] [INFO ] After 48ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:14:51] [INFO ] Deduced a trap composed of 3 places in 94 ms of which 0 ms to minimize.
[2023-04-06 22:14:51] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 1 ms to minimize.
[2023-04-06 22:14:52] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 0 ms to minimize.
[2023-04-06 22:14:52] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 1 ms to minimize.
[2023-04-06 22:14:52] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 1 ms to minimize.
[2023-04-06 22:14:52] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 0 ms to minimize.
[2023-04-06 22:14:52] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 0 ms to minimize.
[2023-04-06 22:14:52] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 0 ms to minimize.
[2023-04-06 22:14:52] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2023-04-06 22:14:52] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 869 ms
[2023-04-06 22:14:52] [INFO ] After 942ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-04-06 22:14:52] [INFO ] After 1149ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 6 out of 309 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 309/309 places, 1464/1464 transitions.
Applied a total of 0 rules in 33 ms. Remains 309 /309 variables (removed 0) and now considering 1464/1464 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 309/309 places, 1464/1464 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 309/309 places, 1464/1464 transitions.
Applied a total of 0 rules in 30 ms. Remains 309 /309 variables (removed 0) and now considering 1464/1464 (removed 0) transitions.
[2023-04-06 22:14:52] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-06 22:14:52] [INFO ] Invariant cache hit.
[2023-04-06 22:14:52] [INFO ] Implicit Places using invariants in 233 ms returned []
[2023-04-06 22:14:52] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-06 22:14:52] [INFO ] Invariant cache hit.
[2023-04-06 22:14:53] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 22:14:53] [INFO ] Implicit Places using invariants and state equation in 907 ms returned []
Implicit Place search using SMT with State Equation took 1157 ms to find 0 implicit places.
[2023-04-06 22:14:53] [INFO ] Redundant transitions in 26 ms returned []
[2023-04-06 22:14:53] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-06 22:14:53] [INFO ] Invariant cache hit.
[2023-04-06 22:14:54] [INFO ] Dead Transitions using invariants and state equation in 407 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1626 ms. Remains : 309/309 places, 1464/1464 transitions.
Graph (trivial) has 1310 edges and 309 vertex of which 49 / 309 are part of one of the 7 SCC in 1 ms
Free SCC test removed 42 places
Drop transitions removed 161 transitions
Ensure Unique test removed 924 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 59 place count 267 transition count 321
Reduce places removed 58 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 60 rules applied. Total rules applied 119 place count 209 transition count 319
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 121 place count 207 transition count 319
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 121 place count 207 transition count 304
Deduced a syphon composed of 15 places in 1 ms
Ensure Unique test removed 7 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 37 rules applied. Total rules applied 158 place count 185 transition count 304
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Deduced a syphon composed of 81 places in 0 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 3 with 162 rules applied. Total rules applied 320 place count 104 transition count 223
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 3 with 38 rules applied. Total rules applied 358 place count 104 transition count 185
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 370 place count 98 transition count 185
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 376 place count 98 transition count 179
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 384 place count 98 transition count 171
Free-agglomeration rule applied 44 times.
Iterating global reduction 5 with 44 rules applied. Total rules applied 428 place count 98 transition count 127
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 5 with 44 rules applied. Total rules applied 472 place count 54 transition count 127
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 480 place count 54 transition count 127
Applied a total of 480 rules in 22 ms. Remains 54 /309 variables (removed 255) and now considering 127/1464 (removed 1337) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 127 rows 54 cols
[2023-04-06 22:14:54] [INFO ] Computed 15 invariants in 1 ms
[2023-04-06 22:14:54] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:14:54] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-04-06 22:14:54] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:14:54] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-06 22:14:54] [INFO ] After 6ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:14:54] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
[2023-04-06 22:14:54] [INFO ] Deduced a trap composed of 2 places in 12 ms of which 0 ms to minimize.
[2023-04-06 22:14:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 44 ms
[2023-04-06 22:14:54] [INFO ] After 57ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-04-06 22:14:54] [INFO ] After 164ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) (NOT p1) p0 (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p3) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p3) p1 (NOT p0)))), (X (NOT (OR (AND (NOT p3) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0) (NOT p2))))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p3) p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p3))), true, (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p3) p1 (NOT p0))))), (X (X (NOT (OR (AND (NOT p3) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p3) p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (G (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2))))), (G (NOT (AND (NOT p0) p1 (NOT p3) (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p3))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 21 factoid took 216 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 120 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Support contains 6 out of 309 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 309/309 places, 1464/1464 transitions.
Applied a total of 0 rules in 39 ms. Remains 309 /309 variables (removed 0) and now considering 1464/1464 (removed 0) transitions.
[2023-04-06 22:14:55] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
// Phase 1: matrix 505 rows 309 cols
[2023-04-06 22:14:55] [INFO ] Computed 22 invariants in 6 ms
[2023-04-06 22:14:55] [INFO ] Implicit Places using invariants in 455 ms returned []
[2023-04-06 22:14:55] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-06 22:14:55] [INFO ] Invariant cache hit.
[2023-04-06 22:14:55] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 22:14:56] [INFO ] Implicit Places using invariants and state equation in 871 ms returned []
Implicit Place search using SMT with State Equation took 1328 ms to find 0 implicit places.
[2023-04-06 22:14:56] [INFO ] Redundant transitions in 20 ms returned []
[2023-04-06 22:14:56] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-06 22:14:56] [INFO ] Invariant cache hit.
[2023-04-06 22:14:56] [INFO ] Dead Transitions using invariants and state equation in 413 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1809 ms. Remains : 309/309 places, 1464/1464 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 p0 (NOT p1) (NOT p3)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p3) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 97 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 615496 steps, run timeout after 3001 ms. (steps per millisecond=205 ) properties seen :{0=1, 2=1}
Probabilistic random walk after 615496 steps, saw 219407 distinct states, run finished after 3001 ms. (steps per millisecond=205 ) properties seen :2
Running SMT prover for 1 properties.
[2023-04-06 22:15:00] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-06 22:15:00] [INFO ] Invariant cache hit.
[2023-04-06 22:15:00] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:15:00] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-06 22:15:00] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-06 22:15:00] [INFO ] After 113ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:15:00] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 22:15:00] [INFO ] After 44ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:15:00] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 0 ms to minimize.
[2023-04-06 22:15:00] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 1 ms to minimize.
[2023-04-06 22:15:00] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 0 ms to minimize.
[2023-04-06 22:15:00] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 0 ms to minimize.
[2023-04-06 22:15:01] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 0 ms to minimize.
[2023-04-06 22:15:01] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 0 ms to minimize.
[2023-04-06 22:15:01] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2023-04-06 22:15:01] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 0 ms to minimize.
[2023-04-06 22:15:01] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 0 ms to minimize.
[2023-04-06 22:15:01] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 838 ms
[2023-04-06 22:15:01] [INFO ] After 904ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-04-06 22:15:01] [INFO ] After 1100ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 309 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 309/309 places, 1464/1464 transitions.
Applied a total of 0 rules in 28 ms. Remains 309 /309 variables (removed 0) and now considering 1464/1464 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 309/309 places, 1464/1464 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 725184 steps, run timeout after 3001 ms. (steps per millisecond=241 ) properties seen :{}
Probabilistic random walk after 725184 steps, saw 249299 distinct states, run finished after 3002 ms. (steps per millisecond=241 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 22:15:04] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-06 22:15:04] [INFO ] Invariant cache hit.
[2023-04-06 22:15:04] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:15:04] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-06 22:15:04] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-06 22:15:04] [INFO ] After 113ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:15:04] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 22:15:04] [INFO ] After 57ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:15:04] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 0 ms to minimize.
[2023-04-06 22:15:05] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 1 ms to minimize.
[2023-04-06 22:15:05] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 1 ms to minimize.
[2023-04-06 22:15:05] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 0 ms to minimize.
[2023-04-06 22:15:05] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 1 ms to minimize.
[2023-04-06 22:15:05] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 0 ms to minimize.
[2023-04-06 22:15:05] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2023-04-06 22:15:05] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2023-04-06 22:15:05] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 0 ms to minimize.
[2023-04-06 22:15:05] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 886 ms
[2023-04-06 22:15:05] [INFO ] After 966ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-04-06 22:15:05] [INFO ] After 1167ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 309 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 309/309 places, 1464/1464 transitions.
Applied a total of 0 rules in 38 ms. Remains 309 /309 variables (removed 0) and now considering 1464/1464 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 309/309 places, 1464/1464 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 309/309 places, 1464/1464 transitions.
Applied a total of 0 rules in 28 ms. Remains 309 /309 variables (removed 0) and now considering 1464/1464 (removed 0) transitions.
[2023-04-06 22:15:05] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-06 22:15:05] [INFO ] Invariant cache hit.
[2023-04-06 22:15:06] [INFO ] Implicit Places using invariants in 226 ms returned []
[2023-04-06 22:15:06] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-06 22:15:06] [INFO ] Invariant cache hit.
[2023-04-06 22:15:06] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 22:15:06] [INFO ] Implicit Places using invariants and state equation in 901 ms returned []
Implicit Place search using SMT with State Equation took 1129 ms to find 0 implicit places.
[2023-04-06 22:15:06] [INFO ] Redundant transitions in 24 ms returned []
[2023-04-06 22:15:06] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-06 22:15:06] [INFO ] Invariant cache hit.
[2023-04-06 22:15:07] [INFO ] Dead Transitions using invariants and state equation in 403 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1591 ms. Remains : 309/309 places, 1464/1464 transitions.
Graph (trivial) has 1310 edges and 309 vertex of which 49 / 309 are part of one of the 7 SCC in 1 ms
Free SCC test removed 42 places
Drop transitions removed 161 transitions
Ensure Unique test removed 924 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 59 place count 267 transition count 321
Reduce places removed 58 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 60 rules applied. Total rules applied 119 place count 209 transition count 319
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 121 place count 207 transition count 319
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 121 place count 207 transition count 304
Deduced a syphon composed of 15 places in 1 ms
Ensure Unique test removed 7 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 37 rules applied. Total rules applied 158 place count 185 transition count 304
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Deduced a syphon composed of 81 places in 0 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 3 with 162 rules applied. Total rules applied 320 place count 104 transition count 223
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 3 with 38 rules applied. Total rules applied 358 place count 104 transition count 185
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 370 place count 98 transition count 185
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 376 place count 98 transition count 179
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 384 place count 98 transition count 171
Free-agglomeration rule applied 44 times.
Iterating global reduction 5 with 44 rules applied. Total rules applied 428 place count 98 transition count 127
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 5 with 44 rules applied. Total rules applied 472 place count 54 transition count 127
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 480 place count 54 transition count 127
Applied a total of 480 rules in 19 ms. Remains 54 /309 variables (removed 255) and now considering 127/1464 (removed 1337) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 127 rows 54 cols
[2023-04-06 22:15:07] [INFO ] Computed 15 invariants in 1 ms
[2023-04-06 22:15:07] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 22:15:07] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-04-06 22:15:07] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 22:15:07] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-06 22:15:07] [INFO ] After 7ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 22:15:07] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
[2023-04-06 22:15:07] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 0 ms to minimize.
[2023-04-06 22:15:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 57 ms
[2023-04-06 22:15:07] [INFO ] After 70ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-04-06 22:15:07] [INFO ] After 125ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p3) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3) p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) (NOT p3)))]
Knowledge based reduction with 7 factoid took 144 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 163 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 99 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 106 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 0 reset in 198 ms.
Product exploration explored 100000 steps with 0 reset in 227 ms.
Support contains 6 out of 309 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 309/309 places, 1464/1464 transitions.
Applied a total of 0 rules in 28 ms. Remains 309 /309 variables (removed 0) and now considering 1464/1464 (removed 0) transitions.
[2023-04-06 22:15:08] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
// Phase 1: matrix 505 rows 309 cols
[2023-04-06 22:15:08] [INFO ] Computed 22 invariants in 6 ms
[2023-04-06 22:15:08] [INFO ] Implicit Places using invariants in 239 ms returned []
[2023-04-06 22:15:08] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-06 22:15:08] [INFO ] Invariant cache hit.
[2023-04-06 22:15:08] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 22:15:09] [INFO ] Implicit Places using invariants and state equation in 904 ms returned []
Implicit Place search using SMT with State Equation took 1144 ms to find 0 implicit places.
[2023-04-06 22:15:09] [INFO ] Redundant transitions in 26 ms returned []
[2023-04-06 22:15:09] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-06 22:15:09] [INFO ] Invariant cache hit.
[2023-04-06 22:15:10] [INFO ] Dead Transitions using invariants and state equation in 423 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1627 ms. Remains : 309/309 places, 1464/1464 transitions.
Treatment of property EisenbergMcGuire-PT-07-LTLFireability-02 finished in 29261 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(p0)||G((X(p2)||p1)))))))'
Support contains 5 out of 515 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 1694/1694 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 511 transition count 1666
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 511 transition count 1666
Applied a total of 8 rules in 13 ms. Remains 511 /515 variables (removed 4) and now considering 1666/1694 (removed 28) transitions.
[2023-04-06 22:15:10] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
// Phase 1: matrix 707 rows 511 cols
[2023-04-06 22:15:10] [INFO ] Computed 22 invariants in 4 ms
[2023-04-06 22:15:10] [INFO ] Implicit Places using invariants in 277 ms returned []
[2023-04-06 22:15:10] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-06 22:15:10] [INFO ] Invariant cache hit.
[2023-04-06 22:15:10] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 22:15:12] [INFO ] Implicit Places using invariants and state equation in 1499 ms returned []
Implicit Place search using SMT with State Equation took 1778 ms to find 0 implicit places.
[2023-04-06 22:15:12] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-06 22:15:12] [INFO ] Invariant cache hit.
[2023-04-06 22:15:12] [INFO ] Dead Transitions using invariants and state equation in 491 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 511/515 places, 1666/1694 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2283 ms. Remains : 511/515 places, 1666/1694 transitions.
Stuttering acceptance computed with spot in 396 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND p1 p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 8}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={} source=7 dest: 5}], [{ cond=(NOT p0), acceptance={} source=8 dest: 0}, { cond=p0, acceptance={} source=8 dest: 8}]], initial=6, aps=[p2:(AND (EQ s0 1) (EQ s8 1) (EQ s351 1)), p1:(OR (EQ s4 0) (EQ s388 0)), p0:(OR (EQ s0 0) (EQ s8 0) (EQ s351 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, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 197 ms.
Product exploration explored 100000 steps with 0 reset in 222 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 p2) p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 90 ms. Reduced automaton from 9 states, 21 edges and 3 AP (stutter sensitive) to 9 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 281 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) seen :0
Interrupted probabilistic random walk after 226752 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :{}
Probabilistic random walk after 226752 steps, saw 154290 distinct states, run finished after 3001 ms. (steps per millisecond=75 ) properties seen :0
Running SMT prover for 15 properties.
[2023-04-06 22:15:16] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-06 22:15:16] [INFO ] Invariant cache hit.
[2023-04-06 22:15:17] [INFO ] [Real]Absence check using 15 positive place invariants in 12 ms returned sat
[2023-04-06 22:15:17] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 22:15:17] [INFO ] After 170ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:13
[2023-04-06 22:15:17] [INFO ] [Nat]Absence check using 15 positive place invariants in 9 ms returned sat
[2023-04-06 22:15:17] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 22:15:17] [INFO ] After 488ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :9
[2023-04-06 22:15:17] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 22:15:18] [INFO ] After 438ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :6 sat :9
[2023-04-06 22:15:18] [INFO ] Deduced a trap composed of 3 places in 110 ms of which 1 ms to minimize.
[2023-04-06 22:15:18] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 0 ms to minimize.
[2023-04-06 22:15:18] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 0 ms to minimize.
[2023-04-06 22:15:18] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2023-04-06 22:15:18] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2023-04-06 22:15:18] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 1 ms to minimize.
[2023-04-06 22:15:18] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 627 ms
[2023-04-06 22:15:19] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 0 ms to minimize.
[2023-04-06 22:15:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2023-04-06 22:15:19] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2023-04-06 22:15:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2023-04-06 22:15:19] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 0 ms to minimize.
[2023-04-06 22:15:19] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 0 ms to minimize.
[2023-04-06 22:15:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 230 ms
[2023-04-06 22:15:19] [INFO ] After 2031ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :9
Attempting to minimize the solution found.
Minimization took 464 ms.
[2023-04-06 22:15:20] [INFO ] After 3227ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :9
Fused 15 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 60 ms.
Support contains 5 out of 511 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 511/511 places, 1666/1666 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 511 transition count 1659
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 504 transition count 1659
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 154 Pre rules applied. Total rules applied 14 place count 504 transition count 1505
Deduced a syphon composed of 154 places in 1 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 2 with 308 rules applied. Total rules applied 322 place count 350 transition count 1505
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 406 place count 308 transition count 1463
Applied a total of 406 rules in 50 ms. Remains 308 /511 variables (removed 203) and now considering 1463/1666 (removed 203) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 308/511 places, 1463/1666 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 325296 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :{}
Probabilistic random walk after 325296 steps, saw 142937 distinct states, run finished after 3001 ms. (steps per millisecond=108 ) properties seen :0
Running SMT prover for 9 properties.
[2023-04-06 22:15:23] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
// Phase 1: matrix 504 rows 308 cols
[2023-04-06 22:15:23] [INFO ] Computed 22 invariants in 2 ms
[2023-04-06 22:15:23] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-06 22:15:23] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 22:15:23] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-04-06 22:15:23] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-06 22:15:23] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 22:15:24] [INFO ] After 281ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-04-06 22:15:24] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 22:15:24] [INFO ] After 260ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-04-06 22:15:24] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 1 ms to minimize.
[2023-04-06 22:15:24] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 1 ms to minimize.
[2023-04-06 22:15:24] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 1 ms to minimize.
[2023-04-06 22:15:24] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 0 ms to minimize.
[2023-04-06 22:15:25] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 1 ms to minimize.
[2023-04-06 22:15:25] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2023-04-06 22:15:25] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 0 ms to minimize.
[2023-04-06 22:15:25] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 0 ms to minimize.
[2023-04-06 22:15:25] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 0 ms to minimize.
[2023-04-06 22:15:25] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2023-04-06 22:15:25] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 919 ms
[2023-04-06 22:15:25] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 0 ms to minimize.
[2023-04-06 22:15:25] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 0 ms to minimize.
[2023-04-06 22:15:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 159 ms
[2023-04-06 22:15:25] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2023-04-06 22:15:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2023-04-06 22:15:25] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2023-04-06 22:15:26] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 0 ms to minimize.
[2023-04-06 22:15:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 142 ms
[2023-04-06 22:15:26] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 0 ms to minimize.
[2023-04-06 22:15:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2023-04-06 22:15:26] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2023-04-06 22:15:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2023-04-06 22:15:26] [INFO ] After 2078ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 290 ms.
[2023-04-06 22:15:26] [INFO ] After 2783ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 40 ms.
Support contains 5 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 28 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 308/308 places, 1463/1463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 28 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2023-04-06 22:15:26] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 22:15:26] [INFO ] Invariant cache hit.
[2023-04-06 22:15:26] [INFO ] Implicit Places using invariants in 224 ms returned []
[2023-04-06 22:15:26] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 22:15:26] [INFO ] Invariant cache hit.
[2023-04-06 22:15:27] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 22:15:27] [INFO ] Implicit Places using invariants and state equation in 949 ms returned []
Implicit Place search using SMT with State Equation took 1176 ms to find 0 implicit places.
[2023-04-06 22:15:27] [INFO ] Redundant transitions in 27 ms returned []
[2023-04-06 22:15:27] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 22:15:27] [INFO ] Invariant cache hit.
[2023-04-06 22:15:28] [INFO ] Dead Transitions using invariants and state equation in 400 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1643 ms. Remains : 308/308 places, 1463/1463 transitions.
Graph (trivial) has 1324 edges and 308 vertex of which 49 / 308 are part of one of the 7 SCC in 1 ms
Free SCC test removed 42 places
Drop transitions removed 161 transitions
Ensure Unique test removed 924 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 266 transition count 317
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 1 with 61 rules applied. Total rules applied 123 place count 205 transition count 317
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 123 place count 205 transition count 302
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 160 place count 183 transition count 302
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 0 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 2 with 164 rules applied. Total rules applied 324 place count 101 transition count 220
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 2 with 39 rules applied. Total rules applied 363 place count 101 transition count 181
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 375 place count 95 transition count 181
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 381 place count 95 transition count 175
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 388 place count 95 transition count 168
Free-agglomeration rule applied 43 times.
Iterating global reduction 4 with 43 rules applied. Total rules applied 431 place count 95 transition count 125
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 4 with 43 rules applied. Total rules applied 474 place count 52 transition count 125
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 481 place count 52 transition count 125
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 482 place count 52 transition count 125
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 483 place count 52 transition count 124
Applied a total of 483 rules in 19 ms. Remains 52 /308 variables (removed 256) and now considering 124/1463 (removed 1339) transitions.
Running SMT prover for 9 properties.
// Phase 1: matrix 124 rows 52 cols
[2023-04-06 22:15:28] [INFO ] Computed 15 invariants in 0 ms
[2023-04-06 22:15:28] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-04-06 22:15:28] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-04-06 22:15:28] [INFO ] [Nat]Absence check using 15 positive place invariants in 1 ms returned sat
[2023-04-06 22:15:28] [INFO ] After 71ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-04-06 22:15:28] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-06 22:15:28] [INFO ] After 56ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-04-06 22:15:28] [INFO ] Deduced a trap composed of 2 places in 12 ms of which 1 ms to minimize.
[2023-04-06 22:15:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2023-04-06 22:15:28] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2023-04-06 22:15:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2023-04-06 22:15:28] [INFO ] After 179ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 56 ms.
[2023-04-06 22:15:28] [INFO ] After 360ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Found 6 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 p0), true, (G (NOT (AND (NOT p0) (NOT p1) p2))), (G (NOT (AND (NOT p0) (NOT p2)))), (G (NOT (AND p0 (NOT p1) p2))), (G (NOT (AND (NOT p1) p2))), (G (NOT (AND (NOT p0) (NOT p1)))), (G (NOT (AND p0 p1 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 93 ms. Reduced automaton from 9 states, 21 edges and 3 AP (stutter sensitive) to 9 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 275 ms :[true, (NOT p2), p2, false, false, (AND (NOT p1) (NOT p2)), false, false, false]
Stuttering acceptance computed with spot in 291 ms :[true, (NOT p2), p2, false, false, (AND (NOT p1) (NOT p2)), false, false, false]
Support contains 5 out of 511 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 511/511 places, 1666/1666 transitions.
Applied a total of 0 rules in 11 ms. Remains 511 /511 variables (removed 0) and now considering 1666/1666 (removed 0) transitions.
[2023-04-06 22:15:29] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
// Phase 1: matrix 707 rows 511 cols
[2023-04-06 22:15:29] [INFO ] Computed 22 invariants in 6 ms
[2023-04-06 22:15:29] [INFO ] Implicit Places using invariants in 260 ms returned []
[2023-04-06 22:15:29] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-06 22:15:29] [INFO ] Invariant cache hit.
[2023-04-06 22:15:29] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 22:15:31] [INFO ] Implicit Places using invariants and state equation in 1467 ms returned []
Implicit Place search using SMT with State Equation took 1740 ms to find 0 implicit places.
[2023-04-06 22:15:31] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-06 22:15:31] [INFO ] Invariant cache hit.
[2023-04-06 22:15:31] [INFO ] Dead Transitions using invariants and state equation in 479 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2235 ms. Remains : 511/511 places, 1666/1666 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 (NOT p2) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 9 states, 15 edges and 2 AP (stutter sensitive) to 9 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 304 ms :[true, (NOT p2), p2, false, false, (AND (NOT p1) (NOT p2)), false, false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 281864 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :{}
Probabilistic random walk after 281864 steps, saw 189256 distinct states, run finished after 3003 ms. (steps per millisecond=93 ) properties seen :0
Running SMT prover for 3 properties.
[2023-04-06 22:15:35] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-06 22:15:35] [INFO ] Invariant cache hit.
[2023-04-06 22:15:35] [INFO ] [Real]Absence check using 15 positive place invariants in 12 ms returned sat
[2023-04-06 22:15:35] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 6 ms returned sat
[2023-04-06 22:15:35] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-06 22:15:35] [INFO ] [Nat]Absence check using 15 positive place invariants in 10 ms returned sat
[2023-04-06 22:15:35] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 22:15:35] [INFO ] After 264ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-06 22:15:35] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 22:15:36] [INFO ] After 179ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-06 22:15:36] [INFO ] Deduced a trap composed of 3 places in 111 ms of which 0 ms to minimize.
[2023-04-06 22:15:36] [INFO ] Deduced a trap composed of 3 places in 118 ms of which 1 ms to minimize.
[2023-04-06 22:15:36] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 0 ms to minimize.
[2023-04-06 22:15:36] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 0 ms to minimize.
[2023-04-06 22:15:36] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 0 ms to minimize.
[2023-04-06 22:15:36] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2023-04-06 22:15:36] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 0 ms to minimize.
[2023-04-06 22:15:36] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 841 ms
[2023-04-06 22:15:37] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 1 ms to minimize.
[2023-04-06 22:15:37] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2023-04-06 22:15:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 206 ms
[2023-04-06 22:15:37] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 0 ms to minimize.
[2023-04-06 22:15:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2023-04-06 22:15:37] [INFO ] After 1481ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 131 ms.
[2023-04-06 22:15:37] [INFO ] After 1995ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 38 ms.
Support contains 5 out of 511 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 511/511 places, 1666/1666 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 511 transition count 1659
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 504 transition count 1659
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 154 Pre rules applied. Total rules applied 14 place count 504 transition count 1505
Deduced a syphon composed of 154 places in 1 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 2 with 308 rules applied. Total rules applied 322 place count 350 transition count 1505
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 406 place count 308 transition count 1463
Applied a total of 406 rules in 59 ms. Remains 308 /511 variables (removed 203) and now considering 1463/1666 (removed 203) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 308/511 places, 1463/1666 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) 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 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 358456 steps, run timeout after 3001 ms. (steps per millisecond=119 ) properties seen :{}
Probabilistic random walk after 358456 steps, saw 153884 distinct states, run finished after 3001 ms. (steps per millisecond=119 ) properties seen :0
Running SMT prover for 3 properties.
[2023-04-06 22:15:40] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
// Phase 1: matrix 504 rows 308 cols
[2023-04-06 22:15:40] [INFO ] Computed 22 invariants in 2 ms
[2023-04-06 22:15:40] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-06 22:15:40] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 22:15:40] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-06 22:15:40] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-06 22:15:40] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 22:15:41] [INFO ] After 154ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-06 22:15:41] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 22:15:41] [INFO ] After 111ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-06 22:15:41] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 0 ms to minimize.
[2023-04-06 22:15:41] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 0 ms to minimize.
[2023-04-06 22:15:41] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 0 ms to minimize.
[2023-04-06 22:15:41] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 0 ms to minimize.
[2023-04-06 22:15:41] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-04-06 22:15:41] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2023-04-06 22:15:41] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 487 ms
[2023-04-06 22:15:41] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 0 ms to minimize.
[2023-04-06 22:15:41] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 0 ms to minimize.
[2023-04-06 22:15:42] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 0 ms to minimize.
[2023-04-06 22:15:42] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 0 ms to minimize.
[2023-04-06 22:15:42] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 0 ms to minimize.
[2023-04-06 22:15:42] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 0 ms to minimize.
[2023-04-06 22:15:42] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 0 ms to minimize.
[2023-04-06 22:15:42] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 3 ms to minimize.
[2023-04-06 22:15:42] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2023-04-06 22:15:42] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 2 ms to minimize.
[2023-04-06 22:15:42] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2023-04-06 22:15:42] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 953 ms
[2023-04-06 22:15:42] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 0 ms to minimize.
[2023-04-06 22:15:42] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-04-06 22:15:42] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2023-04-06 22:15:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 192 ms
[2023-04-06 22:15:42] [INFO ] After 1816ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 72 ms.
[2023-04-06 22:15:43] [INFO ] After 2124ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 14 ms.
Support contains 5 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 27 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 308/308 places, 1463/1463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 28 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2023-04-06 22:15:43] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 22:15:43] [INFO ] Invariant cache hit.
[2023-04-06 22:15:43] [INFO ] Implicit Places using invariants in 219 ms returned []
[2023-04-06 22:15:43] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 22:15:43] [INFO ] Invariant cache hit.
[2023-04-06 22:15:43] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 22:15:44] [INFO ] Implicit Places using invariants and state equation in 913 ms returned []
Implicit Place search using SMT with State Equation took 1133 ms to find 0 implicit places.
[2023-04-06 22:15:44] [INFO ] Redundant transitions in 25 ms returned []
[2023-04-06 22:15:44] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 22:15:44] [INFO ] Invariant cache hit.
[2023-04-06 22:15:44] [INFO ] Dead Transitions using invariants and state equation in 418 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1613 ms. Remains : 308/308 places, 1463/1463 transitions.
Graph (trivial) has 1324 edges and 308 vertex of which 49 / 308 are part of one of the 7 SCC in 0 ms
Free SCC test removed 42 places
Drop transitions removed 161 transitions
Ensure Unique test removed 924 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 266 transition count 317
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 1 with 61 rules applied. Total rules applied 123 place count 205 transition count 317
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 123 place count 205 transition count 302
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 160 place count 183 transition count 302
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 0 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 2 with 164 rules applied. Total rules applied 324 place count 101 transition count 220
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 2 with 39 rules applied. Total rules applied 363 place count 101 transition count 181
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 375 place count 95 transition count 181
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 381 place count 95 transition count 175
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 388 place count 95 transition count 168
Free-agglomeration rule applied 43 times.
Iterating global reduction 4 with 43 rules applied. Total rules applied 431 place count 95 transition count 125
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 4 with 43 rules applied. Total rules applied 474 place count 52 transition count 125
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 481 place count 52 transition count 125
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 482 place count 52 transition count 125
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 483 place count 52 transition count 124
Applied a total of 483 rules in 16 ms. Remains 52 /308 variables (removed 256) and now considering 124/1463 (removed 1339) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 124 rows 52 cols
[2023-04-06 22:15:44] [INFO ] Computed 15 invariants in 0 ms
[2023-04-06 22:15:44] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-04-06 22:15:44] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-06 22:15:44] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-04-06 22:15:44] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-06 22:15:44] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-06 22:15:44] [INFO ] After 17ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-06 22:15:44] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
[2023-04-06 22:15:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2023-04-06 22:15:44] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
[2023-04-06 22:15:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2023-04-06 22:15:44] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2023-04-06 22:15:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2023-04-06 22:15:44] [INFO ] After 117ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-04-06 22:15:44] [INFO ] After 197ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND (NOT p2) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 79 ms. Reduced automaton from 9 states, 15 edges and 2 AP (stutter sensitive) to 9 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 290 ms :[true, (NOT p2), p2, false, false, (AND (NOT p1) (NOT p2)), false, false, false]
Stuttering acceptance computed with spot in 300 ms :[true, (NOT p2), p2, false, false, (AND (NOT p1) (NOT p2)), false, false, false]
Stuttering acceptance computed with spot in 293 ms :[true, (NOT p2), p2, false, false, (AND (NOT p1) (NOT p2)), false, false, false]
Product exploration explored 100000 steps with 0 reset in 200 ms.
Product exploration explored 100000 steps with 0 reset in 251 ms.
Applying partial POR strategy [true, false, true, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 318 ms :[true, (NOT p2), p2, false, false, (AND (NOT p1) (NOT p2)), false, false, false]
Support contains 5 out of 511 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 511/511 places, 1666/1666 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 511 transition count 1666
Performed 147 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 147 Pre rules applied. Total rules applied 7 place count 511 transition count 1904
Deduced a syphon composed of 154 places in 1 ms
Iterating global reduction 1 with 147 rules applied. Total rules applied 154 place count 511 transition count 1904
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 203 places in 1 ms
Iterating global reduction 1 with 49 rules applied. Total rules applied 203 place count 511 transition count 1904
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 210 place count 504 transition count 1897
Deduced a syphon composed of 196 places in 1 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 217 place count 504 transition count 1897
Deduced a syphon composed of 196 places in 1 ms
Applied a total of 217 rules in 108 ms. Remains 504 /511 variables (removed 7) and now considering 1897/1666 (removed -231) transitions.
[2023-04-06 22:15:46] [INFO ] Redundant transitions in 39 ms returned []
[2023-04-06 22:15:46] [INFO ] Flow matrix only has 819 transitions (discarded 1078 similar events)
// Phase 1: matrix 819 rows 504 cols
[2023-04-06 22:15:46] [INFO ] Computed 22 invariants in 3 ms
[2023-04-06 22:15:47] [INFO ] Dead Transitions using invariants and state equation in 596 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 504/511 places, 1897/1666 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 750 ms. Remains : 504/511 places, 1897/1666 transitions.
Support contains 5 out of 511 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 511/511 places, 1666/1666 transitions.
Applied a total of 0 rules in 11 ms. Remains 511 /511 variables (removed 0) and now considering 1666/1666 (removed 0) transitions.
[2023-04-06 22:15:47] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
// Phase 1: matrix 707 rows 511 cols
[2023-04-06 22:15:47] [INFO ] Computed 22 invariants in 3 ms
[2023-04-06 22:15:47] [INFO ] Implicit Places using invariants in 289 ms returned []
[2023-04-06 22:15:47] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-06 22:15:47] [INFO ] Invariant cache hit.
[2023-04-06 22:15:48] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 22:15:49] [INFO ] Implicit Places using invariants and state equation in 1452 ms returned []
Implicit Place search using SMT with State Equation took 1743 ms to find 0 implicit places.
[2023-04-06 22:15:49] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-06 22:15:49] [INFO ] Invariant cache hit.
[2023-04-06 22:15:49] [INFO ] Dead Transitions using invariants and state equation in 481 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2236 ms. Remains : 511/511 places, 1666/1666 transitions.
Treatment of property EisenbergMcGuire-PT-07-LTLFireability-04 finished in 39626 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 515 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 1694/1694 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 511 transition count 1666
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 511 transition count 1666
Applied a total of 8 rules in 14 ms. Remains 511 /515 variables (removed 4) and now considering 1666/1694 (removed 28) transitions.
[2023-04-06 22:15:49] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-06 22:15:49] [INFO ] Invariant cache hit.
[2023-04-06 22:15:50] [INFO ] Implicit Places using invariants in 268 ms returned []
[2023-04-06 22:15:50] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-06 22:15:50] [INFO ] Invariant cache hit.
[2023-04-06 22:15:50] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 22:15:51] [INFO ] Implicit Places using invariants and state equation in 1532 ms returned []
Implicit Place search using SMT with State Equation took 1804 ms to find 0 implicit places.
[2023-04-06 22:15:51] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-06 22:15:51] [INFO ] Invariant cache hit.
[2023-04-06 22:15:52] [INFO ] Dead Transitions using invariants and state equation in 499 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 511/515 places, 1666/1694 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2318 ms. Remains : 511/515 places, 1666/1694 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s1 0) (EQ s11 0) (EQ s377 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 617 ms.
Product exploration explored 100000 steps with 50000 reset in 571 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 17 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-07-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-07-LTLFireability-05 finished in 3600 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&&X((G(p1)||G(F(p2)))))))'
Support contains 7 out of 515 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 515/515 places, 1694/1694 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 515 transition count 1687
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 508 transition count 1687
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 154 Pre rules applied. Total rules applied 14 place count 508 transition count 1533
Deduced a syphon composed of 154 places in 0 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 2 with 308 rules applied. Total rules applied 322 place count 354 transition count 1533
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 326 place count 350 transition count 1505
Iterating global reduction 2 with 4 rules applied. Total rules applied 330 place count 350 transition count 1505
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 414 place count 308 transition count 1463
Applied a total of 414 rules in 64 ms. Remains 308 /515 variables (removed 207) and now considering 1463/1694 (removed 231) transitions.
[2023-04-06 22:15:53] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
// Phase 1: matrix 504 rows 308 cols
[2023-04-06 22:15:53] [INFO ] Computed 22 invariants in 4 ms
[2023-04-06 22:15:53] [INFO ] Implicit Places using invariants in 240 ms returned []
[2023-04-06 22:15:53] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 22:15:53] [INFO ] Invariant cache hit.
[2023-04-06 22:15:53] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 22:15:54] [INFO ] Implicit Places using invariants and state equation in 927 ms returned []
Implicit Place search using SMT with State Equation took 1169 ms to find 0 implicit places.
[2023-04-06 22:15:54] [INFO ] Redundant transitions in 26 ms returned []
[2023-04-06 22:15:54] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 22:15:54] [INFO ] Invariant cache hit.
[2023-04-06 22:15:55] [INFO ] Dead Transitions using invariants and state equation in 409 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 308/515 places, 1463/1694 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1675 ms. Remains : 308/515 places, 1463/1694 transitions.
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(OR p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s0 0) (EQ s7 0) (EQ s196 0)), p1:(OR (EQ s3 0) (EQ s269 0)), p2:(AND (EQ s3 1) (EQ s18 1) (EQ s204 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 215 ms.
Product exploration explored 100000 steps with 0 reset in 248 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 (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (OR p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 141 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter insensitive) to 4 states, 13 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-04-06 22:15:56] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 22:15:56] [INFO ] Invariant cache hit.
[2023-04-06 22:15:56] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-04-06 22:15:56] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-06 22:15:56] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 22:15:56] [INFO ] After 134ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :2
[2023-04-06 22:15:56] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 22:15:56] [INFO ] After 86ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :3 sat :2
[2023-04-06 22:15:56] [INFO ] Deduced a trap composed of 3 places in 128 ms of which 0 ms to minimize.
[2023-04-06 22:15:57] [INFO ] Deduced a trap composed of 3 places in 113 ms of which 1 ms to minimize.
[2023-04-06 22:15:57] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 1 ms to minimize.
[2023-04-06 22:15:57] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 1 ms to minimize.
[2023-04-06 22:15:57] [INFO ] Deduced a trap composed of 44 places in 111 ms of which 1 ms to minimize.
[2023-04-06 22:15:57] [INFO ] Deduced a trap composed of 3 places in 114 ms of which 1 ms to minimize.
[2023-04-06 22:15:57] [INFO ] Deduced a trap composed of 52 places in 104 ms of which 0 ms to minimize.
[2023-04-06 22:15:57] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 1 ms to minimize.
[2023-04-06 22:15:57] [INFO ] Deduced a trap composed of 51 places in 94 ms of which 0 ms to minimize.
[2023-04-06 22:15:58] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 0 ms to minimize.
[2023-04-06 22:15:58] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 0 ms to minimize.
[2023-04-06 22:15:58] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 0 ms to minimize.
[2023-04-06 22:15:58] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 0 ms to minimize.
[2023-04-06 22:15:58] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 0 ms to minimize.
[2023-04-06 22:15:58] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1606 ms
[2023-04-06 22:15:58] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 1 ms to minimize.
[2023-04-06 22:15:58] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 0 ms to minimize.
[2023-04-06 22:15:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 170 ms
[2023-04-06 22:15:58] [INFO ] After 1925ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :2
Attempting to minimize the solution found.
Minimization took 78 ms.
[2023-04-06 22:15:58] [INFO ] After 2222ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :2
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 7 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 37 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 308/308 places, 1463/1463 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 2) 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 2) 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 2) seen :0
Finished probabilistic random walk after 3654 steps, run visited all 2 properties in 42 ms. (steps per millisecond=87 )
Probabilistic random walk after 3654 steps, saw 2922 distinct states, run finished after 42 ms. (steps per millisecond=87 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (OR p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (G (OR p0 p1)), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND p0 (NOT p2)))), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 17 factoid took 408 ms. Reduced automaton from 4 states, 13 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 308 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 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 28 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2023-04-06 22:15:59] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 22:15:59] [INFO ] Invariant cache hit.
[2023-04-06 22:15:59] [INFO ] Implicit Places using invariants in 220 ms returned []
[2023-04-06 22:15:59] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 22:15:59] [INFO ] Invariant cache hit.
[2023-04-06 22:15:59] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 22:16:00] [INFO ] Implicit Places using invariants and state equation in 920 ms returned []
Implicit Place search using SMT with State Equation took 1141 ms to find 0 implicit places.
[2023-04-06 22:16:00] [INFO ] Redundant transitions in 24 ms returned []
[2023-04-06 22:16:00] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 22:16:00] [INFO ] Invariant cache hit.
[2023-04-06 22:16:01] [INFO ] Dead Transitions using invariants and state equation in 399 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1599 ms. Remains : 308/308 places, 1463/1463 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 (NOT p2)), (X (AND p1 (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 72 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Finished probabilistic random walk after 3654 steps, run visited all 2 properties in 36 ms. (steps per millisecond=101 )
Probabilistic random walk after 3654 steps, saw 2922 distinct states, run finished after 37 ms. (steps per millisecond=98 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p2)), (X (AND p1 (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 5 factoid took 135 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 55 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 186 ms.
Product exploration explored 100000 steps with 0 reset in 217 ms.
Support contains 4 out of 308 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 29 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2023-04-06 22:16:02] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 22:16:02] [INFO ] Invariant cache hit.
[2023-04-06 22:16:02] [INFO ] Implicit Places using invariants in 233 ms returned []
[2023-04-06 22:16:02] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 22:16:02] [INFO ] Invariant cache hit.
[2023-04-06 22:16:02] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 22:16:03] [INFO ] Implicit Places using invariants and state equation in 978 ms returned []
Implicit Place search using SMT with State Equation took 1213 ms to find 0 implicit places.
[2023-04-06 22:16:03] [INFO ] Redundant transitions in 23 ms returned []
[2023-04-06 22:16:03] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 22:16:03] [INFO ] Invariant cache hit.
[2023-04-06 22:16:03] [INFO ] Dead Transitions using invariants and state equation in 405 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1675 ms. Remains : 308/308 places, 1463/1463 transitions.
Treatment of property EisenbergMcGuire-PT-07-LTLFireability-06 finished in 10335 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 515 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 1694/1694 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 511 transition count 1666
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 511 transition count 1666
Applied a total of 8 rules in 20 ms. Remains 511 /515 variables (removed 4) and now considering 1666/1694 (removed 28) transitions.
[2023-04-06 22:16:03] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
// Phase 1: matrix 707 rows 511 cols
[2023-04-06 22:16:03] [INFO ] Computed 22 invariants in 5 ms
[2023-04-06 22:16:04] [INFO ] Implicit Places using invariants in 292 ms returned []
[2023-04-06 22:16:04] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-06 22:16:04] [INFO ] Invariant cache hit.
[2023-04-06 22:16:04] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 22:16:05] [INFO ] Implicit Places using invariants and state equation in 1814 ms returned []
Implicit Place search using SMT with State Equation took 2108 ms to find 0 implicit places.
[2023-04-06 22:16:05] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-06 22:16:05] [INFO ] Invariant cache hit.
[2023-04-06 22:16:06] [INFO ] Dead Transitions using invariants and state equation in 522 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 511/515 places, 1666/1694 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2650 ms. Remains : 511/515 places, 1666/1694 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s21 1) (EQ s131 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 129 reset in 172 ms.
Stack based approach found an accepted trace after 27 steps with 0 reset with depth 28 and stack size 28 in 0 ms.
FORMULA EisenbergMcGuire-PT-07-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-07-LTLFireability-07 finished in 2911 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1)||X(p0)||G(p2))))'
Support contains 5 out of 515 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 515/515 places, 1694/1694 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 515 transition count 1687
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 508 transition count 1687
Performed 153 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 153 Pre rules applied. Total rules applied 14 place count 508 transition count 1534
Deduced a syphon composed of 153 places in 1 ms
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 2 with 306 rules applied. Total rules applied 320 place count 355 transition count 1534
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 323 place count 352 transition count 1513
Iterating global reduction 2 with 3 rules applied. Total rules applied 326 place count 352 transition count 1513
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 410 place count 310 transition count 1471
Applied a total of 410 rules in 68 ms. Remains 310 /515 variables (removed 205) and now considering 1471/1694 (removed 223) transitions.
[2023-04-06 22:16:06] [INFO ] Flow matrix only has 512 transitions (discarded 959 similar events)
// Phase 1: matrix 512 rows 310 cols
[2023-04-06 22:16:06] [INFO ] Computed 22 invariants in 1 ms
[2023-04-06 22:16:07] [INFO ] Implicit Places using invariants in 238 ms returned []
[2023-04-06 22:16:07] [INFO ] Flow matrix only has 512 transitions (discarded 959 similar events)
[2023-04-06 22:16:07] [INFO ] Invariant cache hit.
[2023-04-06 22:16:07] [INFO ] State equation strengthened by 226 read => feed constraints.
[2023-04-06 22:16:08] [INFO ] Implicit Places using invariants and state equation in 952 ms returned []
Implicit Place search using SMT with State Equation took 1201 ms to find 0 implicit places.
[2023-04-06 22:16:08] [INFO ] Redundant transitions in 27 ms returned []
[2023-04-06 22:16:08] [INFO ] Flow matrix only has 512 transitions (discarded 959 similar events)
[2023-04-06 22:16:08] [INFO ] Invariant cache hit.
[2023-04-06 22:16:08] [INFO ] Dead Transitions using invariants and state equation in 419 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 310/515 places, 1471/1694 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1734 ms. Remains : 310/515 places, 1471/1694 transitions.
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p1:(AND (EQ s0 1) (EQ s91 1)), p0:(AND (EQ s5 1) (EQ s286 1)), p2:(EQ s145 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 313 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 0 ms.
FORMULA EisenbergMcGuire-PT-07-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-07-LTLFireability-08 finished in 2114 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p1)||G(F(p2))||p0))))'
Support contains 6 out of 515 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 1694/1694 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 512 transition count 1673
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 512 transition count 1673
Applied a total of 6 rules in 19 ms. Remains 512 /515 variables (removed 3) and now considering 1673/1694 (removed 21) transitions.
[2023-04-06 22:16:08] [INFO ] Flow matrix only has 714 transitions (discarded 959 similar events)
// Phase 1: matrix 714 rows 512 cols
[2023-04-06 22:16:08] [INFO ] Computed 22 invariants in 4 ms
[2023-04-06 22:16:09] [INFO ] Implicit Places using invariants in 271 ms returned []
[2023-04-06 22:16:09] [INFO ] Flow matrix only has 714 transitions (discarded 959 similar events)
[2023-04-06 22:16:09] [INFO ] Invariant cache hit.
[2023-04-06 22:16:09] [INFO ] State equation strengthened by 226 read => feed constraints.
[2023-04-06 22:16:10] [INFO ] Implicit Places using invariants and state equation in 1366 ms returned []
Implicit Place search using SMT with State Equation took 1638 ms to find 0 implicit places.
[2023-04-06 22:16:10] [INFO ] Flow matrix only has 714 transitions (discarded 959 similar events)
[2023-04-06 22:16:10] [INFO ] Invariant cache hit.
[2023-04-06 22:16:11] [INFO ] Dead Transitions using invariants and state equation in 493 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 512/515 places, 1673/1694 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2151 ms. Remains : 512/515 places, 1673/1694 transitions.
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(OR (EQ s208 1) (AND (EQ s5 1) (EQ s22 1) (EQ s364 1))), p1:(AND (EQ s5 1) (EQ s22 1) (EQ s364 1)), p2:(AND (EQ s1 1) (EQ s133 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 197 ms.
Stack based approach found an accepted trace after 14 steps with 0 reset with depth 15 and stack size 15 in 0 ms.
FORMULA EisenbergMcGuire-PT-07-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-07-LTLFireability-10 finished in 2565 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((p0||X((p0||G(p1)))))))))'
Support contains 4 out of 515 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 1694/1694 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 511 transition count 1666
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 511 transition count 1666
Applied a total of 8 rules in 26 ms. Remains 511 /515 variables (removed 4) and now considering 1666/1694 (removed 28) transitions.
[2023-04-06 22:16:11] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
// Phase 1: matrix 707 rows 511 cols
[2023-04-06 22:16:11] [INFO ] Computed 22 invariants in 4 ms
[2023-04-06 22:16:11] [INFO ] Implicit Places using invariants in 262 ms returned []
[2023-04-06 22:16:11] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-06 22:16:11] [INFO ] Invariant cache hit.
[2023-04-06 22:16:11] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 22:16:13] [INFO ] Implicit Places using invariants and state equation in 1481 ms returned []
Implicit Place search using SMT with State Equation took 1746 ms to find 0 implicit places.
[2023-04-06 22:16:13] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-06 22:16:13] [INFO ] Invariant cache hit.
[2023-04-06 22:16:13] [INFO ] Dead Transitions using invariants and state equation in 479 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 511/515 places, 1666/1694 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2253 ms. Remains : 511/515 places, 1666/1694 transitions.
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s0 1) (EQ s8 1) (EQ s383 1)), p1:(EQ s193 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 200 ms.
Stack based approach found an accepted trace after 30 steps with 0 reset with depth 31 and stack size 31 in 0 ms.
FORMULA EisenbergMcGuire-PT-07-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-07-LTLFireability-11 finished in 2613 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 515 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 515/515 places, 1694/1694 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 515 transition count 1687
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 508 transition count 1687
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 154 Pre rules applied. Total rules applied 14 place count 508 transition count 1533
Deduced a syphon composed of 154 places in 1 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 2 with 308 rules applied. Total rules applied 322 place count 354 transition count 1533
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 326 place count 350 transition count 1505
Iterating global reduction 2 with 4 rules applied. Total rules applied 330 place count 350 transition count 1505
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 412 place count 309 transition count 1464
Applied a total of 412 rules in 58 ms. Remains 309 /515 variables (removed 206) and now considering 1464/1694 (removed 230) transitions.
[2023-04-06 22:16:14] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
// Phase 1: matrix 505 rows 309 cols
[2023-04-06 22:16:14] [INFO ] Computed 22 invariants in 5 ms
[2023-04-06 22:16:14] [INFO ] Implicit Places using invariants in 260 ms returned []
[2023-04-06 22:16:14] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-06 22:16:14] [INFO ] Invariant cache hit.
[2023-04-06 22:16:14] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 22:16:15] [INFO ] Implicit Places using invariants and state equation in 1056 ms returned []
Implicit Place search using SMT with State Equation took 1328 ms to find 0 implicit places.
[2023-04-06 22:16:15] [INFO ] Redundant transitions in 25 ms returned []
[2023-04-06 22:16:15] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-06 22:16:15] [INFO ] Invariant cache hit.
[2023-04-06 22:16:15] [INFO ] Dead Transitions using invariants and state equation in 407 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 309/515 places, 1464/1694 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1824 ms. Remains : 309/515 places, 1464/1694 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s91 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 191 ms.
Stack based approach found an accepted trace after 28 steps with 0 reset with depth 29 and stack size 29 in 0 ms.
FORMULA EisenbergMcGuire-PT-07-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-07-LTLFireability-12 finished in 2061 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U (G(p1) U p2))||X(X(F(p3)))))'
Support contains 11 out of 515 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 1694/1694 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 512 transition count 1673
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 512 transition count 1673
Applied a total of 6 rules in 14 ms. Remains 512 /515 variables (removed 3) and now considering 1673/1694 (removed 21) transitions.
[2023-04-06 22:16:16] [INFO ] Flow matrix only has 714 transitions (discarded 959 similar events)
// Phase 1: matrix 714 rows 512 cols
[2023-04-06 22:16:16] [INFO ] Computed 22 invariants in 6 ms
[2023-04-06 22:16:16] [INFO ] Implicit Places using invariants in 248 ms returned []
[2023-04-06 22:16:16] [INFO ] Flow matrix only has 714 transitions (discarded 959 similar events)
[2023-04-06 22:16:16] [INFO ] Invariant cache hit.
[2023-04-06 22:16:16] [INFO ] State equation strengthened by 226 read => feed constraints.
[2023-04-06 22:16:17] [INFO ] Implicit Places using invariants and state equation in 1502 ms returned []
Implicit Place search using SMT with State Equation took 1753 ms to find 0 implicit places.
[2023-04-06 22:16:17] [INFO ] Flow matrix only has 714 transitions (discarded 959 similar events)
[2023-04-06 22:16:17] [INFO ] Invariant cache hit.
[2023-04-06 22:16:18] [INFO ] Dead Transitions using invariants and state equation in 479 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 512/515 places, 1673/1694 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2247 ms. Remains : 512/515 places, 1673/1694 transitions.
Stuttering acceptance computed with spot in 409 ms :[(NOT p3), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1) (NOT p0)), (NOT p3), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p0))]
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 9}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 9}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 10}, { cond=(AND p2 p0), acceptance={} source=2 dest: 11}], [{ cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 5}, { cond=(AND p2 p1), acceptance={} source=3 dest: 7}, { cond=(NOT p1), acceptance={} source=3 dest: 9}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=4 dest: 6}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=4 dest: 7}, { cond=(AND p2 p1 p0), acceptance={} source=4 dest: 8}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 9}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=4 dest: 10}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=4 dest: 11}], [{ cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=5 dest: 5}, { cond=(AND p2 p1 (NOT p3)), acceptance={0} source=5 dest: 7}, { cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=5 dest: 9}], [{ cond=(AND (NOT p2) p1 (NOT p0) (NOT p3)), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p2) p1 p0 (NOT p3)), acceptance={0} source=6 dest: 6}, { cond=(AND p2 p1 (NOT p0) (NOT p3)), acceptance={0} source=6 dest: 7}, { cond=(AND p2 p1 p0 (NOT p3)), acceptance={0} source=6 dest: 8}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={0} source=6 dest: 9}, { cond=(AND (NOT p2) (NOT p1) p0 (NOT p3)), acceptance={0} source=6 dest: 10}, { cond=(AND p2 (NOT p1) p0 (NOT p3)), acceptance={0} source=6 dest: 11}], [{ cond=(AND p1 (NOT p3)), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=7 dest: 9}], [{ cond=(AND p1 (NOT p0) (NOT p3)), acceptance={} source=8 dest: 7}, { cond=(AND p1 p0 (NOT p3)), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=8 dest: 9}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=8 dest: 11}], [{ cond=(NOT p3), acceptance={0} source=9 dest: 9}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=10 dest: 9}, { cond=(AND (NOT p2) p0 (NOT p3)), acceptance={0} source=10 dest: 10}, { cond=(AND p2 p0 (NOT p3)), acceptance={0} source=10 dest: 11}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=11 dest: 9}, { cond=(AND p0 (NOT p3)), acceptance={} source=11 dest: 11}]], initial=1, aps=[p2:(AND (EQ s6 1) (EQ s27 1) (EQ s383 1)), p1:(AND (EQ s1 1) (EQ s12 1) (EQ s357 1)), p0:(AND (EQ s2 1) (EQ s13 1) (EQ s361 1)), p3:(OR (EQ s5 0) (EQ s133...], 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, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 502 ms.
Product exploration explored 100000 steps with 33333 reset in 507 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 p2) (NOT p1) (NOT p0) p3), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p2 p1))), (X (NOT p1)), (X (NOT (AND p2 p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND p2 p1 (NOT p3))))), (X (X (NOT (AND p2 (NOT p1) p0 (NOT p3))))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (X (X (NOT (AND p2 p1 p0 (NOT p3))))), (X (X (NOT (AND p1 p0 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND p2 p0 (NOT p3))))), (X (X (NOT (AND p2 p1 (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND (NOT p2) p1 p0 (NOT p3))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) p0 (NOT p3))))), (X (X (NOT (AND (NOT p2) p1 (NOT p3)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 33 factoid took 20 ms. Reduced automaton from 12 states, 40 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-07-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-07-LTLFireability-13 finished in 3718 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1))))'
Support contains 5 out of 515 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 1694/1694 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 511 transition count 1666
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 511 transition count 1666
Applied a total of 8 rules in 13 ms. Remains 511 /515 variables (removed 4) and now considering 1666/1694 (removed 28) transitions.
[2023-04-06 22:16:19] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
// Phase 1: matrix 707 rows 511 cols
[2023-04-06 22:16:19] [INFO ] Computed 22 invariants in 2 ms
[2023-04-06 22:16:20] [INFO ] Implicit Places using invariants in 261 ms returned []
[2023-04-06 22:16:20] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-06 22:16:20] [INFO ] Invariant cache hit.
[2023-04-06 22:16:20] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 22:16:21] [INFO ] Implicit Places using invariants and state equation in 1557 ms returned []
Implicit Place search using SMT with State Equation took 1819 ms to find 0 implicit places.
[2023-04-06 22:16:21] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-06 22:16:21] [INFO ] Invariant cache hit.
[2023-04-06 22:16:22] [INFO ] Dead Transitions using invariants and state equation in 502 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 511/515 places, 1666/1694 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2335 ms. Remains : 511/515 places, 1666/1694 transitions.
Stuttering acceptance computed with spot in 103 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (EQ s20 1) (EQ s417 1) (OR (EQ s207 1) (AND (EQ s10 1) (EQ s414 1)) (AND (EQ s20 1) (EQ s417 1)))), p0:(AND (EQ s10 1) (EQ s414 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA EisenbergMcGuire-PT-07-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-07-LTLFireability-14 finished in 2454 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)&&X(G((p1||X(p0))))) U p2))'
Support contains 6 out of 515 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 1694/1694 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 511 transition count 1666
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 511 transition count 1666
Applied a total of 8 rules in 19 ms. Remains 511 /515 variables (removed 4) and now considering 1666/1694 (removed 28) transitions.
[2023-04-06 22:16:22] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-06 22:16:22] [INFO ] Invariant cache hit.
[2023-04-06 22:16:22] [INFO ] Implicit Places using invariants in 270 ms returned []
[2023-04-06 22:16:22] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-06 22:16:22] [INFO ] Invariant cache hit.
[2023-04-06 22:16:22] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 22:16:24] [INFO ] Implicit Places using invariants and state equation in 1720 ms returned []
Implicit Place search using SMT with State Equation took 1993 ms to find 0 implicit places.
[2023-04-06 22:16:24] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-06 22:16:24] [INFO ] Invariant cache hit.
[2023-04-06 22:16:24] [INFO ] Dead Transitions using invariants and state equation in 482 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 511/515 places, 1666/1694 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2496 ms. Remains : 511/515 places, 1666/1694 transitions.
Stuttering acceptance computed with spot in 133 ms :[(NOT p2), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), true]
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(NOT p2), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s1 1) (EQ s12 1) (EQ s363 1)), p0:(NEQ s270 1), p1:(AND (EQ s1 1) (EQ s10 1) (EQ s384 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 19981 reset in 408 ms.
Stack based approach found an accepted trace after 21618 steps with 4349 reset with depth 10 and stack size 10 in 106 ms.
FORMULA EisenbergMcGuire-PT-07-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-07-LTLFireability-15 finished in 3166 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((((F(p2) U p3)&&p1)||p0)))||G(p3)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(p0)||G((X(p2)||p1)))))))'
Found a Lengthening insensitive property : EisenbergMcGuire-PT-07-LTLFireability-04
Stuttering acceptance computed with spot in 258 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0)]
Support contains 5 out of 515 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 515/515 places, 1694/1694 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 515 transition count 1687
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 508 transition count 1687
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 154 Pre rules applied. Total rules applied 14 place count 508 transition count 1533
Deduced a syphon composed of 154 places in 0 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 2 with 308 rules applied. Total rules applied 322 place count 354 transition count 1533
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 326 place count 350 transition count 1505
Iterating global reduction 2 with 4 rules applied. Total rules applied 330 place count 350 transition count 1505
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 414 place count 308 transition count 1463
Applied a total of 414 rules in 48 ms. Remains 308 /515 variables (removed 207) and now considering 1463/1694 (removed 231) transitions.
[2023-04-06 22:16:25] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
// Phase 1: matrix 504 rows 308 cols
[2023-04-06 22:16:25] [INFO ] Computed 22 invariants in 3 ms
[2023-04-06 22:16:26] [INFO ] Implicit Places using invariants in 233 ms returned []
[2023-04-06 22:16:26] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 22:16:26] [INFO ] Invariant cache hit.
[2023-04-06 22:16:26] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 22:16:27] [INFO ] Implicit Places using invariants and state equation in 900 ms returned []
Implicit Place search using SMT with State Equation took 1151 ms to find 0 implicit places.
[2023-04-06 22:16:27] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 22:16:27] [INFO ] Invariant cache hit.
[2023-04-06 22:16:27] [INFO ] Dead Transitions using invariants and state equation in 406 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 308/515 places, 1463/1694 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1606 ms. Remains : 308/515 places, 1463/1694 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND p1 p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 8}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={} source=7 dest: 5}], [{ cond=(NOT p0), acceptance={} source=8 dest: 0}, { cond=p0, acceptance={} source=8 dest: 8}]], initial=6, aps=[p2:(AND (EQ s0 1) (EQ s8 1) (EQ s202 1)), p1:(OR (EQ s4 0) (EQ s234 0)), p0:(OR (EQ s0 0) (EQ s8 0) (EQ s202 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, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 250 ms.
Product exploration explored 100000 steps with 0 reset in 261 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 p2) p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 71 ms. Reduced automaton from 9 states, 21 edges and 3 AP (stutter sensitive) to 9 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 261 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) seen :0
Interrupted probabilistic random walk after 279656 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :{}
Probabilistic random walk after 279656 steps, saw 129654 distinct states, run finished after 3001 ms. (steps per millisecond=93 ) properties seen :0
Running SMT prover for 15 properties.
[2023-04-06 22:16:31] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 22:16:31] [INFO ] Invariant cache hit.
[2023-04-06 22:16:31] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-06 22:16:31] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 22:16:31] [INFO ] After 119ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:13
[2023-04-06 22:16:31] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-06 22:16:31] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 6 ms returned sat
[2023-04-06 22:16:32] [INFO ] After 270ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :9
[2023-04-06 22:16:32] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 22:16:32] [INFO ] After 296ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :6 sat :9
[2023-04-06 22:16:32] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 0 ms to minimize.
[2023-04-06 22:16:32] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2023-04-06 22:16:32] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 0 ms to minimize.
[2023-04-06 22:16:32] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2023-04-06 22:16:32] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 0 ms to minimize.
[2023-04-06 22:16:32] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-04-06 22:16:32] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 461 ms
[2023-04-06 22:16:32] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2023-04-06 22:16:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2023-04-06 22:16:33] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 0 ms to minimize.
[2023-04-06 22:16:33] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 0 ms to minimize.
[2023-04-06 22:16:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 161 ms
[2023-04-06 22:16:33] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 0 ms to minimize.
[2023-04-06 22:16:33] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 0 ms to minimize.
[2023-04-06 22:16:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 161 ms
[2023-04-06 22:16:33] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 0 ms to minimize.
[2023-04-06 22:16:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2023-04-06 22:16:33] [INFO ] After 1543ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :9
Attempting to minimize the solution found.
Minimization took 293 ms.
[2023-04-06 22:16:33] [INFO ] After 2261ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :9
Fused 15 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 34 ms.
Support contains 5 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 29 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 308/308 places, 1463/1463 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 313976 steps, run timeout after 3001 ms. (steps per millisecond=104 ) properties seen :{}
Probabilistic random walk after 313976 steps, saw 139891 distinct states, run finished after 3001 ms. (steps per millisecond=104 ) properties seen :0
Running SMT prover for 9 properties.
[2023-04-06 22:16:37] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 22:16:37] [INFO ] Invariant cache hit.
[2023-04-06 22:16:37] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-06 22:16:37] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 22:16:37] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-04-06 22:16:37] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-06 22:16:37] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 22:16:37] [INFO ] After 278ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-04-06 22:16:37] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 22:16:38] [INFO ] After 270ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-04-06 22:16:38] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 0 ms to minimize.
[2023-04-06 22:16:38] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 1 ms to minimize.
[2023-04-06 22:16:38] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 0 ms to minimize.
[2023-04-06 22:16:38] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2023-04-06 22:16:38] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 0 ms to minimize.
[2023-04-06 22:16:38] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2023-04-06 22:16:38] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-04-06 22:16:38] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 585 ms
[2023-04-06 22:16:38] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
[2023-04-06 22:16:38] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2023-04-06 22:16:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 165 ms
[2023-04-06 22:16:39] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 0 ms to minimize.
[2023-04-06 22:16:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2023-04-06 22:16:39] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 0 ms to minimize.
[2023-04-06 22:16:39] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 0 ms to minimize.
[2023-04-06 22:16:39] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 0 ms to minimize.
[2023-04-06 22:16:39] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 0 ms to minimize.
[2023-04-06 22:16:39] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 0 ms to minimize.
[2023-04-06 22:16:39] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
[2023-04-06 22:16:39] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-04-06 22:16:39] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 0 ms to minimize.
[2023-04-06 22:16:39] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 612 ms
[2023-04-06 22:16:39] [INFO ] After 2033ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 362 ms.
[2023-04-06 22:16:40] [INFO ] After 2804ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 20 ms.
Support contains 5 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 30 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 308/308 places, 1463/1463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 40 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2023-04-06 22:16:40] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 22:16:40] [INFO ] Invariant cache hit.
[2023-04-06 22:16:40] [INFO ] Implicit Places using invariants in 218 ms returned []
[2023-04-06 22:16:40] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 22:16:40] [INFO ] Invariant cache hit.
[2023-04-06 22:16:40] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 22:16:41] [INFO ] Implicit Places using invariants and state equation in 837 ms returned []
Implicit Place search using SMT with State Equation took 1068 ms to find 0 implicit places.
[2023-04-06 22:16:41] [INFO ] Redundant transitions in 24 ms returned []
[2023-04-06 22:16:41] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 22:16:41] [INFO ] Invariant cache hit.
[2023-04-06 22:16:41] [INFO ] Dead Transitions using invariants and state equation in 409 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1547 ms. Remains : 308/308 places, 1463/1463 transitions.
Graph (trivial) has 1324 edges and 308 vertex of which 49 / 308 are part of one of the 7 SCC in 0 ms
Free SCC test removed 42 places
Drop transitions removed 161 transitions
Ensure Unique test removed 924 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 266 transition count 317
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 1 with 61 rules applied. Total rules applied 123 place count 205 transition count 317
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 123 place count 205 transition count 302
Deduced a syphon composed of 15 places in 1 ms
Ensure Unique test removed 7 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 160 place count 183 transition count 302
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 0 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 2 with 164 rules applied. Total rules applied 324 place count 101 transition count 220
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 2 with 39 rules applied. Total rules applied 363 place count 101 transition count 181
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 375 place count 95 transition count 181
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 381 place count 95 transition count 175
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 388 place count 95 transition count 168
Free-agglomeration rule applied 43 times.
Iterating global reduction 4 with 43 rules applied. Total rules applied 431 place count 95 transition count 125
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 4 with 43 rules applied. Total rules applied 474 place count 52 transition count 125
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 481 place count 52 transition count 125
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 482 place count 52 transition count 125
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 483 place count 52 transition count 124
Applied a total of 483 rules in 17 ms. Remains 52 /308 variables (removed 256) and now considering 124/1463 (removed 1339) transitions.
Running SMT prover for 9 properties.
// Phase 1: matrix 124 rows 52 cols
[2023-04-06 22:16:41] [INFO ] Computed 15 invariants in 0 ms
[2023-04-06 22:16:41] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-04-06 22:16:41] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-04-06 22:16:41] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-04-06 22:16:42] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-04-06 22:16:42] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-06 22:16:42] [INFO ] After 57ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-04-06 22:16:42] [INFO ] Deduced a trap composed of 2 places in 12 ms of which 0 ms to minimize.
[2023-04-06 22:16:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
[2023-04-06 22:16:42] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2023-04-06 22:16:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2023-04-06 22:16:42] [INFO ] After 195ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-04-06 22:16:42] [INFO ] After 363ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Found 6 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 p0), true, (G (NOT (AND (NOT p0) (NOT p1) p2))), (G (NOT (AND (NOT p0) (NOT p2)))), (G (NOT (AND p0 (NOT p1) p2))), (G (NOT (AND (NOT p1) p2))), (G (NOT (AND (NOT p0) (NOT p1)))), (G (NOT (AND p0 p1 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 117 ms. Reduced automaton from 9 states, 21 edges and 3 AP (stutter sensitive) to 9 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 280 ms :[true, (NOT p2), p2, false, false, (AND (NOT p1) (NOT p2)), false, false, false]
Stuttering acceptance computed with spot in 268 ms :[true, (NOT p2), p2, false, false, (AND (NOT p1) (NOT p2)), false, false, false]
Support contains 5 out of 308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 4 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2023-04-06 22:16:42] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
// Phase 1: matrix 504 rows 308 cols
[2023-04-06 22:16:42] [INFO ] Computed 22 invariants in 7 ms
[2023-04-06 22:16:43] [INFO ] Implicit Places using invariants in 233 ms returned []
[2023-04-06 22:16:43] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 22:16:43] [INFO ] Invariant cache hit.
[2023-04-06 22:16:43] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 22:16:44] [INFO ] Implicit Places using invariants and state equation in 878 ms returned []
Implicit Place search using SMT with State Equation took 1112 ms to find 0 implicit places.
[2023-04-06 22:16:44] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 22:16:44] [INFO ] Invariant cache hit.
[2023-04-06 22:16:44] [INFO ] Dead Transitions using invariants and state equation in 401 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1517 ms. Remains : 308/308 places, 1463/1463 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 (NOT p2) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 74 ms. Reduced automaton from 9 states, 15 edges and 2 AP (stutter sensitive) to 9 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 364 ms :[true, (NOT p2), p2, false, false, (AND (NOT p1) (NOT p2)), false, false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 447424 steps, run timeout after 3001 ms. (steps per millisecond=149 ) properties seen :{}
Probabilistic random walk after 447424 steps, saw 180476 distinct states, run finished after 3001 ms. (steps per millisecond=149 ) properties seen :0
Running SMT prover for 3 properties.
[2023-04-06 22:16:48] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 22:16:48] [INFO ] Invariant cache hit.
[2023-04-06 22:16:48] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-06 22:16:48] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 6 ms returned sat
[2023-04-06 22:16:48] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-06 22:16:48] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-06 22:16:48] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 22:16:48] [INFO ] After 154ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-06 22:16:48] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 22:16:48] [INFO ] After 100ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-06 22:16:48] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 1 ms to minimize.
[2023-04-06 22:16:48] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2023-04-06 22:16:48] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2023-04-06 22:16:48] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-04-06 22:16:48] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 322 ms
[2023-04-06 22:16:48] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 1 ms to minimize.
[2023-04-06 22:16:49] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 0 ms to minimize.
[2023-04-06 22:16:49] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 0 ms to minimize.
[2023-04-06 22:16:49] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 0 ms to minimize.
[2023-04-06 22:16:49] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 0 ms to minimize.
[2023-04-06 22:16:49] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 0 ms to minimize.
[2023-04-06 22:16:49] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 0 ms to minimize.
[2023-04-06 22:16:49] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 576 ms
[2023-04-06 22:16:49] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 0 ms to minimize.
[2023-04-06 22:16:49] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2023-04-06 22:16:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 150 ms
[2023-04-06 22:16:49] [INFO ] After 1209ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 71 ms.
[2023-04-06 22:16:49] [INFO ] After 1517ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 12 ms.
Support contains 5 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 30 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 308/308 places, 1463/1463 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 457736 steps, run timeout after 3001 ms. (steps per millisecond=152 ) properties seen :{}
Probabilistic random walk after 457736 steps, saw 183759 distinct states, run finished after 3001 ms. (steps per millisecond=152 ) properties seen :0
Running SMT prover for 3 properties.
[2023-04-06 22:16:52] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 22:16:52] [INFO ] Invariant cache hit.
[2023-04-06 22:16:52] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-06 22:16:52] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 4 ms returned sat
[2023-04-06 22:16:52] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-06 22:16:52] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-06 22:16:52] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-06 22:16:53] [INFO ] After 163ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-06 22:16:53] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 22:16:53] [INFO ] After 105ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-06 22:16:53] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 0 ms to minimize.
[2023-04-06 22:16:53] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 0 ms to minimize.
[2023-04-06 22:16:53] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 2 ms to minimize.
[2023-04-06 22:16:53] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-04-06 22:16:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 310 ms
[2023-04-06 22:16:53] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 0 ms to minimize.
[2023-04-06 22:16:53] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 0 ms to minimize.
[2023-04-06 22:16:53] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 0 ms to minimize.
[2023-04-06 22:16:53] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 0 ms to minimize.
[2023-04-06 22:16:54] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
[2023-04-06 22:16:54] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 3 ms to minimize.
[2023-04-06 22:16:54] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2023-04-06 22:16:54] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 571 ms
[2023-04-06 22:16:54] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 0 ms to minimize.
[2023-04-06 22:16:54] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
[2023-04-06 22:16:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 144 ms
[2023-04-06 22:16:54] [INFO ] After 1199ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 72 ms.
[2023-04-06 22:16:54] [INFO ] After 1510ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 6 ms.
Support contains 5 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 35 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 308/308 places, 1463/1463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 28 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2023-04-06 22:16:54] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 22:16:54] [INFO ] Invariant cache hit.
[2023-04-06 22:16:54] [INFO ] Implicit Places using invariants in 235 ms returned []
[2023-04-06 22:16:54] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 22:16:54] [INFO ] Invariant cache hit.
[2023-04-06 22:16:54] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 22:16:55] [INFO ] Implicit Places using invariants and state equation in 893 ms returned []
Implicit Place search using SMT with State Equation took 1131 ms to find 0 implicit places.
[2023-04-06 22:16:55] [INFO ] Redundant transitions in 24 ms returned []
[2023-04-06 22:16:55] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 22:16:55] [INFO ] Invariant cache hit.
[2023-04-06 22:16:56] [INFO ] Dead Transitions using invariants and state equation in 402 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1593 ms. Remains : 308/308 places, 1463/1463 transitions.
Graph (trivial) has 1324 edges and 308 vertex of which 49 / 308 are part of one of the 7 SCC in 1 ms
Free SCC test removed 42 places
Drop transitions removed 161 transitions
Ensure Unique test removed 924 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 266 transition count 317
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 1 with 61 rules applied. Total rules applied 123 place count 205 transition count 317
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 123 place count 205 transition count 302
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 160 place count 183 transition count 302
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 0 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 2 with 164 rules applied. Total rules applied 324 place count 101 transition count 220
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 2 with 39 rules applied. Total rules applied 363 place count 101 transition count 181
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 375 place count 95 transition count 181
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 381 place count 95 transition count 175
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 388 place count 95 transition count 168
Free-agglomeration rule applied 43 times.
Iterating global reduction 4 with 43 rules applied. Total rules applied 431 place count 95 transition count 125
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 4 with 43 rules applied. Total rules applied 474 place count 52 transition count 125
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 481 place count 52 transition count 125
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 482 place count 52 transition count 125
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 483 place count 52 transition count 124
Applied a total of 483 rules in 16 ms. Remains 52 /308 variables (removed 256) and now considering 124/1463 (removed 1339) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 124 rows 52 cols
[2023-04-06 22:16:56] [INFO ] Computed 15 invariants in 0 ms
[2023-04-06 22:16:56] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-04-06 22:16:56] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-06 22:16:56] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-04-06 22:16:56] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-06 22:16:56] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-06 22:16:56] [INFO ] After 17ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-06 22:16:56] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 1 ms to minimize.
[2023-04-06 22:16:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2023-04-06 22:16:56] [INFO ] Deduced a trap composed of 2 places in 12 ms of which 1 ms to minimize.
[2023-04-06 22:16:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2023-04-06 22:16:56] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2023-04-06 22:16:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2023-04-06 22:16:56] [INFO ] After 128ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-04-06 22:16:56] [INFO ] After 223ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND (NOT p2) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 9 states, 15 edges and 2 AP (stutter sensitive) to 9 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 264 ms :[true, (NOT p2), p2, false, false, (AND (NOT p1) (NOT p2)), false, false, false]
Stuttering acceptance computed with spot in 266 ms :[true, (NOT p2), p2, false, false, (AND (NOT p1) (NOT p2)), false, false, false]
Stuttering acceptance computed with spot in 259 ms :[true, (NOT p2), p2, false, false, (AND (NOT p1) (NOT p2)), false, false, false]
Product exploration explored 100000 steps with 0 reset in 206 ms.
Product exploration explored 100000 steps with 0 reset in 225 ms.
Applying partial POR strategy [true, false, true, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 283 ms :[true, (NOT p2), p2, false, false, (AND (NOT p1) (NOT p2)), false, false, false]
Support contains 5 out of 308 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 33 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2023-04-06 22:16:58] [INFO ] Redundant transitions in 23 ms returned []
[2023-04-06 22:16:58] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
// Phase 1: matrix 504 rows 308 cols
[2023-04-06 22:16:58] [INFO ] Computed 22 invariants in 3 ms
[2023-04-06 22:16:58] [INFO ] Dead Transitions using invariants and state equation in 400 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 466 ms. Remains : 308/308 places, 1463/1463 transitions.
Support contains 5 out of 308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 4 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2023-04-06 22:16:58] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 22:16:58] [INFO ] Invariant cache hit.
[2023-04-06 22:16:58] [INFO ] Implicit Places using invariants in 223 ms returned []
[2023-04-06 22:16:58] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 22:16:58] [INFO ] Invariant cache hit.
[2023-04-06 22:16:58] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 22:16:59] [INFO ] Implicit Places using invariants and state equation in 856 ms returned []
Implicit Place search using SMT with State Equation took 1080 ms to find 0 implicit places.
[2023-04-06 22:16:59] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 22:16:59] [INFO ] Invariant cache hit.
[2023-04-06 22:16:59] [INFO ] Dead Transitions using invariants and state equation in 393 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1478 ms. Remains : 308/308 places, 1463/1463 transitions.
Treatment of property EisenbergMcGuire-PT-07-LTLFireability-04 finished in 34490 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&&X((G(p1)||G(F(p2)))))))'
[2023-04-06 22:17:00] [INFO ] Flatten gal took : 51 ms
[2023-04-06 22:17:00] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-04-06 22:17:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 515 places, 1694 transitions and 8148 arcs took 11 ms.
Total runtime 172926 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT EisenbergMcGuire-PT-07
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLFireability

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

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

BK_STOP 1680819491517

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLFireability.xml
lola: 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 # 1 (type EXCL) for 0 EisenbergMcGuire-PT-07-LTLFireability-02
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-07-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
EisenbergMcGuire-PT-07-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-07-LTLFireability-06: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/1200 2/32 EisenbergMcGuire-PT-07-LTLFireability-02 170814 m, 34162 m/sec, 400631 t fired, .

Time elapsed: 5 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 3
lola: FINISHED task # 1 (type EXCL) for EisenbergMcGuire-PT-07-LTLFireability-02
lola: result : false
lola: markings : 180724
lola: fired transitions : 426737
lola: time used : 5.000000
lola: memory pages used : 2
lola: LAUNCH task # 7 (type EXCL) for 6 EisenbergMcGuire-PT-07-LTLFireability-06
lola: time limit : 1797 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
EisenbergMcGuire-PT-07-LTLFireability-02: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-07-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
EisenbergMcGuire-PT-07-LTLFireability-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 5/1797 4/32 EisenbergMcGuire-PT-07-LTLFireability-06 475006 m, 95001 m/sec, 1161090 t fired, .

Time elapsed: 10 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 3
lola: FINISHED task # 7 (type EXCL) for EisenbergMcGuire-PT-07-LTLFireability-06
lola: result : false
lola: markings : 496911
lola: fired transitions : 1224389
lola: time used : 5.000000
lola: memory pages used : 4
lola: LAUNCH task # 4 (type EXCL) for 3 EisenbergMcGuire-PT-07-LTLFireability-04
lola: time limit : 3590 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
EisenbergMcGuire-PT-07-LTLFireability-02: LTL false LTL model checker
EisenbergMcGuire-PT-07-LTLFireability-06: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-07-LTLFireability-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/3590 4/32 EisenbergMcGuire-PT-07-LTLFireability-04 483420 m, 96684 m/sec, 1182974 t fired, .

Time elapsed: 15 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
EisenbergMcGuire-PT-07-LTLFireability-02: LTL false LTL model checker
EisenbergMcGuire-PT-07-LTLFireability-06: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-07-LTLFireability-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/3590 8/32 EisenbergMcGuire-PT-07-LTLFireability-04 926710 m, 88658 m/sec, 2409769 t fired, .

Time elapsed: 20 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
EisenbergMcGuire-PT-07-LTLFireability-02: LTL false LTL model checker
EisenbergMcGuire-PT-07-LTLFireability-06: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-07-LTLFireability-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/3590 11/32 EisenbergMcGuire-PT-07-LTLFireability-04 1326079 m, 79873 m/sec, 3644137 t fired, .

Time elapsed: 25 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
EisenbergMcGuire-PT-07-LTLFireability-02: LTL false LTL model checker
EisenbergMcGuire-PT-07-LTLFireability-06: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-07-LTLFireability-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/3590 13/32 EisenbergMcGuire-PT-07-LTLFireability-04 1704340 m, 75652 m/sec, 4894827 t fired, .

Time elapsed: 30 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
EisenbergMcGuire-PT-07-LTLFireability-02: LTL false LTL model checker
EisenbergMcGuire-PT-07-LTLFireability-06: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-07-LTLFireability-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 25/3590 16/32 EisenbergMcGuire-PT-07-LTLFireability-04 2067600 m, 72652 m/sec, 6148661 t fired, .

Time elapsed: 35 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
EisenbergMcGuire-PT-07-LTLFireability-02: LTL false LTL model checker
EisenbergMcGuire-PT-07-LTLFireability-06: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-07-LTLFireability-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 30/3590 19/32 EisenbergMcGuire-PT-07-LTLFireability-04 2429742 m, 72428 m/sec, 7399451 t fired, .

Time elapsed: 40 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
EisenbergMcGuire-PT-07-LTLFireability-02: LTL false LTL model checker
EisenbergMcGuire-PT-07-LTLFireability-06: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-07-LTLFireability-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 35/3590 21/32 EisenbergMcGuire-PT-07-LTLFireability-04 2785138 m, 71079 m/sec, 8653830 t fired, .

Time elapsed: 45 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
EisenbergMcGuire-PT-07-LTLFireability-02: LTL false LTL model checker
EisenbergMcGuire-PT-07-LTLFireability-06: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-07-LTLFireability-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 40/3590 24/32 EisenbergMcGuire-PT-07-LTLFireability-04 3134630 m, 69898 m/sec, 9895095 t fired, .

Time elapsed: 50 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
EisenbergMcGuire-PT-07-LTLFireability-02: LTL false LTL model checker
EisenbergMcGuire-PT-07-LTLFireability-06: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-07-LTLFireability-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 45/3590 26/32 EisenbergMcGuire-PT-07-LTLFireability-04 3477789 m, 68631 m/sec, 11143683 t fired, .

Time elapsed: 55 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
EisenbergMcGuire-PT-07-LTLFireability-02: LTL false LTL model checker
EisenbergMcGuire-PT-07-LTLFireability-06: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-07-LTLFireability-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 50/3590 29/32 EisenbergMcGuire-PT-07-LTLFireability-04 3816763 m, 67794 m/sec, 12385345 t fired, .

Time elapsed: 60 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
EisenbergMcGuire-PT-07-LTLFireability-02: LTL false LTL model checker
EisenbergMcGuire-PT-07-LTLFireability-06: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-07-LTLFireability-04: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 55/3590 31/32 EisenbergMcGuire-PT-07-LTLFireability-04 4164476 m, 69542 m/sec, 13607273 t fired, .

Time elapsed: 65 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 4 (type EXCL) for EisenbergMcGuire-PT-07-LTLFireability-04 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
EisenbergMcGuire-PT-07-LTLFireability-02: LTL false LTL model checker
EisenbergMcGuire-PT-07-LTLFireability-06: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
EisenbergMcGuire-PT-07-LTLFireability-04: LTL 0 0 0 0 1 0 1 0

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

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

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
EisenbergMcGuire-PT-07-LTLFireability-02: LTL false LTL model checker
EisenbergMcGuire-PT-07-LTLFireability-04: LTL unknown AGGR
EisenbergMcGuire-PT-07-LTLFireability-06: LTL false LTL model checker


Time elapsed: 70 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-07"
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-07, 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-167987245000252"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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