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.r521-tall-167987246400252.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 ltsminxred
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 r521-tall-167987246400252
=====================================================================

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

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-07
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 04:35:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 04:35:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 04:35:59] [INFO ] Load time of PNML (sax parser for PT used): 183 ms
[2023-04-07 04:35:59] [INFO ] Transformed 553 places.
[2023-04-07 04:35:59] [INFO ] Transformed 1960 transitions.
[2023-04-07 04:35:59] [INFO ] Found NUPN structural information;
[2023-04-07 04:35:59] [INFO ] Parsed PT model containing 553 places and 1960 transitions and 9212 arcs in 269 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 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 119 ms. Remains 515 /553 variables (removed 38) and now considering 1694/1960 (removed 266) transitions.
[2023-04-07 04:35:59] [INFO ] Flow matrix only has 735 transitions (discarded 959 similar events)
// Phase 1: matrix 735 rows 515 cols
[2023-04-07 04:35:59] [INFO ] Computed 22 invariants in 22 ms
[2023-04-07 04:36:00] [INFO ] Implicit Places using invariants in 602 ms returned []
[2023-04-07 04:36:00] [INFO ] Flow matrix only has 735 transitions (discarded 959 similar events)
[2023-04-07 04:36:00] [INFO ] Invariant cache hit.
[2023-04-07 04:36:00] [INFO ] State equation strengthened by 244 read => feed constraints.
[2023-04-07 04:36:01] [INFO ] Implicit Places using invariants and state equation in 1295 ms returned []
Implicit Place search using SMT with State Equation took 1940 ms to find 0 implicit places.
[2023-04-07 04:36:01] [INFO ] Flow matrix only has 735 transitions (discarded 959 similar events)
[2023-04-07 04:36:01] [INFO ] Invariant cache hit.
[2023-04-07 04:36:02] [INFO ] Dead Transitions using invariants and state equation in 610 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 2671 ms. Remains : 515/553 places, 1694/1960 transitions.
Support contains 47 out of 515 places after structural reductions.
[2023-04-07 04:36:02] [INFO ] Flatten gal took : 122 ms
[2023-04-07 04:36:02] [INFO ] Flatten gal took : 98 ms
[2023-04-07 04:36:03] [INFO ] Input system was already deterministic with 1694 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 625 ms. (steps per millisecond=16 ) properties (out of 31) seen :5
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 8 ms. (steps per millisecond=125 ) 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 15 ms. (steps per millisecond=66 ) 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 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 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 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 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 3 ms. (steps per millisecond=333 ) 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 15 ms. (steps per millisecond=66 ) 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 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 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 3 ms. (steps per millisecond=333 ) 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
Running SMT prover for 26 properties.
[2023-04-07 04:36:03] [INFO ] Flow matrix only has 735 transitions (discarded 959 similar events)
[2023-04-07 04:36:03] [INFO ] Invariant cache hit.
[2023-04-07 04:36:04] [INFO ] [Real]Absence check using 15 positive place invariants in 10 ms returned sat
[2023-04-07 04:36:04] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 7 ms returned sat
[2023-04-07 04:36:04] [INFO ] After 404ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:26
[2023-04-07 04:36:04] [INFO ] [Nat]Absence check using 15 positive place invariants in 19 ms returned sat
[2023-04-07 04:36:04] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 4 ms returned sat
[2023-04-07 04:36:06] [INFO ] After 1049ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :26
[2023-04-07 04:36:06] [INFO ] State equation strengthened by 244 read => feed constraints.
[2023-04-07 04:36:07] [INFO ] After 1098ms SMT Verify possible using 244 Read/Feed constraints in natural domain returned unsat :0 sat :26
[2023-04-07 04:36:07] [INFO ] Deduced a trap composed of 3 places in 175 ms of which 5 ms to minimize.
[2023-04-07 04:36:07] [INFO ] Deduced a trap composed of 3 places in 171 ms of which 1 ms to minimize.
[2023-04-07 04:36:08] [INFO ] Deduced a trap composed of 64 places in 340 ms of which 2 ms to minimize.
[2023-04-07 04:36:08] [INFO ] Deduced a trap composed of 38 places in 153 ms of which 2 ms to minimize.
[2023-04-07 04:36:08] [INFO ] Deduced a trap composed of 36 places in 121 ms of which 0 ms to minimize.
[2023-04-07 04:36:08] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 1 ms to minimize.
[2023-04-07 04:36:08] [INFO ] Deduced a trap composed of 3 places in 94 ms of which 1 ms to minimize.
[2023-04-07 04:36:08] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 1 ms to minimize.
[2023-04-07 04:36:08] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 1 ms to minimize.
[2023-04-07 04:36:08] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2023-04-07 04:36:09] [INFO ] Deduced a trap composed of 39 places in 111 ms of which 0 ms to minimize.
[2023-04-07 04:36:09] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 0 ms to minimize.
[2023-04-07 04:36:09] [INFO ] Deduced a trap composed of 46 places in 222 ms of which 0 ms to minimize.
[2023-04-07 04:36:09] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2348 ms
[2023-04-07 04:36:09] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 0 ms to minimize.
[2023-04-07 04:36:10] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 0 ms to minimize.
[2023-04-07 04:36:10] [INFO ] Deduced a trap composed of 66 places in 74 ms of which 1 ms to minimize.
[2023-04-07 04:36:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 411 ms
[2023-04-07 04:36:10] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2023-04-07 04:36:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2023-04-07 04:36:10] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 1 ms to minimize.
[2023-04-07 04:36:10] [INFO ] Deduced a trap composed of 64 places in 84 ms of which 1 ms to minimize.
[2023-04-07 04:36:10] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 0 ms to minimize.
[2023-04-07 04:36:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 369 ms
[2023-04-07 04:36:11] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 0 ms to minimize.
[2023-04-07 04:36:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2023-04-07 04:36:11] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 0 ms to minimize.
[2023-04-07 04:36:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2023-04-07 04:36:12] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 0 ms to minimize.
[2023-04-07 04:36:12] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 1 ms to minimize.
[2023-04-07 04:36:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 231 ms
[2023-04-07 04:36:12] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
[2023-04-07 04:36:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2023-04-07 04:36:12] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2023-04-07 04:36:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2023-04-07 04:36:12] [INFO ] After 6711ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :26
Attempting to minimize the solution found.
Minimization took 1475 ms.
[2023-04-07 04:36:14] [INFO ] After 9988ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :26
Parikh walk visited 0 properties in 775 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 2 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 4 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 191 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 192 ms. Remains : 321/515 places, 1494/1694 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 313 ms. (steps per millisecond=31 ) properties (out of 26) seen :1
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 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 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 3 ms. (steps per millisecond=333 ) 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 9 ms. (steps per millisecond=111 ) properties (out of 25) 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 25) 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 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 3 ms. (steps per millisecond=333 ) properties (out of 25) 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 25) 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 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 13 ms. (steps per millisecond=77 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) 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 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 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
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 222944 steps, run timeout after 3001 ms. (steps per millisecond=74 ) 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 222944 steps, saw 114216 distinct states, run finished after 3002 ms. (steps per millisecond=74 ) properties seen :13
Running SMT prover for 12 properties.
[2023-04-07 04:36:18] [INFO ] Flow matrix only has 535 transitions (discarded 959 similar events)
// Phase 1: matrix 535 rows 321 cols
[2023-04-07 04:36:18] [INFO ] Computed 22 invariants in 3 ms
[2023-04-07 04:36:18] [INFO ] [Real]Absence check using 15 positive place invariants in 10 ms returned sat
[2023-04-07 04:36:18] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-07 04:36:18] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-04-07 04:36:18] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-07 04:36:18] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-07 04:36:19] [INFO ] After 350ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-04-07 04:36:19] [INFO ] State equation strengthened by 238 read => feed constraints.
[2023-04-07 04:36:19] [INFO ] After 360ms SMT Verify possible using 238 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2023-04-07 04:36:19] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 1 ms to minimize.
[2023-04-07 04:36:19] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 0 ms to minimize.
[2023-04-07 04:36:20] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 0 ms to minimize.
[2023-04-07 04:36:20] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 0 ms to minimize.
[2023-04-07 04:36:20] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2023-04-07 04:36:20] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 463 ms
[2023-04-07 04:36:20] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 0 ms to minimize.
[2023-04-07 04:36:20] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2023-04-07 04:36:20] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 4 ms to minimize.
[2023-04-07 04:36:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 274 ms
[2023-04-07 04:36:20] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 0 ms to minimize.
[2023-04-07 04:36:20] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-04-07 04:36:20] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2023-04-07 04:36:20] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2023-04-07 04:36:20] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2023-04-07 04:36:20] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 0 ms to minimize.
[2023-04-07 04:36:21] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 0 ms to minimize.
[2023-04-07 04:36:21] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 566 ms
[2023-04-07 04:36:21] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 0 ms to minimize.
[2023-04-07 04:36:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2023-04-07 04:36:21] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 0 ms to minimize.
[2023-04-07 04:36:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2023-04-07 04:36:21] [INFO ] After 2291ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 351 ms.
[2023-04-07 04:36:22] [INFO ] After 3167ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Parikh walk visited 0 properties in 98 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 1 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 65 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 65 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 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 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 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 27 ms. (steps per millisecond=370 ) 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 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 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 31 ms. (steps per millisecond=322 ) 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 22 ms. (steps per millisecond=454 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 298544 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :{}
Probabilistic random walk after 298544 steps, saw 133235 distinct states, run finished after 3003 ms. (steps per millisecond=99 ) properties seen :0
Running SMT prover for 12 properties.
[2023-04-07 04:36:25] [INFO ] Flow matrix only has 507 transitions (discarded 959 similar events)
// Phase 1: matrix 507 rows 311 cols
[2023-04-07 04:36:25] [INFO ] Computed 22 invariants in 7 ms
[2023-04-07 04:36:25] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-07 04:36:25] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-07 04:36:25] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-04-07 04:36:25] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-07 04:36:25] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 4 ms returned sat
[2023-04-07 04:36:26] [INFO ] After 317ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-04-07 04:36:26] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 04:36:26] [INFO ] After 362ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2023-04-07 04:36:26] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 0 ms to minimize.
[2023-04-07 04:36:26] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 1 ms to minimize.
[2023-04-07 04:36:27] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 0 ms to minimize.
[2023-04-07 04:36:27] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 1 ms to minimize.
[2023-04-07 04:36:27] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 0 ms to minimize.
[2023-04-07 04:36:27] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2023-04-07 04:36:27] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 638 ms
[2023-04-07 04:36:27] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2023-04-07 04:36:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2023-04-07 04:36:27] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 0 ms to minimize.
[2023-04-07 04:36:27] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 0 ms to minimize.
[2023-04-07 04:36:27] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2023-04-07 04:36:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 305 ms
[2023-04-07 04:36:28] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 2 ms to minimize.
[2023-04-07 04:36:28] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 0 ms to minimize.
[2023-04-07 04:36:28] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 0 ms to minimize.
[2023-04-07 04:36:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 287 ms
[2023-04-07 04:36:28] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 0 ms to minimize.
[2023-04-07 04:36:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2023-04-07 04:36:28] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 1 ms to minimize.
[2023-04-07 04:36:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2023-04-07 04:36:28] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2023-04-07 04:36:28] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 0 ms to minimize.
[2023-04-07 04:36:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 188 ms
[2023-04-07 04:36:28] [INFO ] After 2412ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 333 ms.
[2023-04-07 04:36:29] [INFO ] After 3261ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Parikh walk visited 0 properties in 76 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 41 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 42 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 44 ms. Remains 311 /311 variables (removed 0) and now considering 1466/1466 (removed 0) transitions.
[2023-04-07 04:36:29] [INFO ] Flow matrix only has 507 transitions (discarded 959 similar events)
[2023-04-07 04:36:29] [INFO ] Invariant cache hit.
[2023-04-07 04:36:29] [INFO ] Implicit Places using invariants in 606 ms returned []
[2023-04-07 04:36:29] [INFO ] Flow matrix only has 507 transitions (discarded 959 similar events)
[2023-04-07 04:36:29] [INFO ] Invariant cache hit.
[2023-04-07 04:36:30] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 04:36:30] [INFO ] Implicit Places using invariants and state equation in 903 ms returned []
Implicit Place search using SMT with State Equation took 1521 ms to find 0 implicit places.
[2023-04-07 04:36:30] [INFO ] Redundant transitions in 83 ms returned []
[2023-04-07 04:36:30] [INFO ] Flow matrix only has 507 transitions (discarded 959 similar events)
[2023-04-07 04:36:30] [INFO ] Invariant cache hit.
[2023-04-07 04:36:31] [INFO ] Dead Transitions using invariants and state equation in 461 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2116 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 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 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 1 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 33 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-07 04:36:31] [INFO ] Computed 15 invariants in 1 ms
[2023-04-07 04:36:31] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-04-07 04:36:31] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-04-07 04:36:31] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-04-07 04:36:31] [INFO ] After 90ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-04-07 04:36:31] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 04:36:31] [INFO ] After 57ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2023-04-07 04:36:31] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
[2023-04-07 04:36:31] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
[2023-04-07 04:36:31] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 1 ms to minimize.
[2023-04-07 04:36:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 80 ms
[2023-04-07 04:36:31] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2023-04-07 04:36:31] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2023-04-07 04:36:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 52 ms
[2023-04-07 04:36:31] [INFO ] After 284ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 56 ms.
[2023-04-07 04:36:31] [INFO ] After 486ms 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 29 ms. Remains 512 /515 variables (removed 3) and now considering 1673/1694 (removed 21) transitions.
[2023-04-07 04:36:32] [INFO ] Flow matrix only has 714 transitions (discarded 959 similar events)
// Phase 1: matrix 714 rows 512 cols
[2023-04-07 04:36:32] [INFO ] Computed 22 invariants in 7 ms
[2023-04-07 04:36:32] [INFO ] Implicit Places using invariants in 306 ms returned []
[2023-04-07 04:36:32] [INFO ] Flow matrix only has 714 transitions (discarded 959 similar events)
[2023-04-07 04:36:32] [INFO ] Invariant cache hit.
[2023-04-07 04:36:32] [INFO ] State equation strengthened by 226 read => feed constraints.
[2023-04-07 04:36:34] [INFO ] Implicit Places using invariants and state equation in 1705 ms returned []
Implicit Place search using SMT with State Equation took 2023 ms to find 0 implicit places.
[2023-04-07 04:36:34] [INFO ] Flow matrix only has 714 transitions (discarded 959 similar events)
[2023-04-07 04:36:34] [INFO ] Invariant cache hit.
[2023-04-07 04:36:34] [INFO ] Dead Transitions using invariants and state equation in 590 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 2644 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 227 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 1 ms.
FORMULA EisenbergMcGuire-PT-07-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-07-LTLFireability-01 finished in 2924 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 184 ms. Remains 309 /515 variables (removed 206) and now considering 1464/1694 (removed 230) transitions.
[2023-04-07 04:36:35] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
// Phase 1: matrix 505 rows 309 cols
[2023-04-07 04:36:35] [INFO ] Computed 22 invariants in 6 ms
[2023-04-07 04:36:35] [INFO ] Implicit Places using invariants in 468 ms returned []
[2023-04-07 04:36:35] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-07 04:36:35] [INFO ] Invariant cache hit.
[2023-04-07 04:36:35] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 04:36:36] [INFO ] Implicit Places using invariants and state equation in 954 ms returned []
Implicit Place search using SMT with State Equation took 1436 ms to find 0 implicit places.
[2023-04-07 04:36:36] [INFO ] Redundant transitions in 72 ms returned []
[2023-04-07 04:36:36] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-07 04:36:36] [INFO ] Invariant cache hit.
[2023-04-07 04:36:37] [INFO ] Dead Transitions using invariants and state equation in 492 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 2213 ms. Remains : 309/515 places, 1464/1694 transitions.
Stuttering acceptance computed with spot in 279 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 378 ms.
Product exploration explored 100000 steps with 0 reset in 291 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 153 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 294 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 117 ms. (steps per millisecond=85 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) 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 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) 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 6) seen :0
Interrupted probabilistic random walk after 312992 steps, run timeout after 3001 ms. (steps per millisecond=104 ) properties seen :{0=1, 5=1}
Probabilistic random walk after 312992 steps, saw 142113 distinct states, run finished after 3003 ms. (steps per millisecond=104 ) properties seen :2
Running SMT prover for 4 properties.
[2023-04-07 04:36:42] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-07 04:36:42] [INFO ] Invariant cache hit.
[2023-04-07 04:36:42] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-07 04:36:42] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-07 04:36:42] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-07 04:36:42] [INFO ] After 129ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :1
[2023-04-07 04:36:42] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 04:36:42] [INFO ] After 47ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :3 sat :1
[2023-04-07 04:36:42] [INFO ] Deduced a trap composed of 3 places in 125 ms of which 1 ms to minimize.
[2023-04-07 04:36:42] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 0 ms to minimize.
[2023-04-07 04:36:42] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
[2023-04-07 04:36:42] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 0 ms to minimize.
[2023-04-07 04:36:43] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 0 ms to minimize.
[2023-04-07 04:36:43] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2023-04-07 04:36:43] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 624 ms
[2023-04-07 04:36:43] [INFO ] After 690ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-04-07 04:36:43] [INFO ] After 960ms 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 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.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) 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 721336 steps, run timeout after 3001 ms. (steps per millisecond=240 ) properties seen :{}
Probabilistic random walk after 721336 steps, saw 248150 distinct states, run finished after 3001 ms. (steps per millisecond=240 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 04:36:46] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-07 04:36:46] [INFO ] Invariant cache hit.
[2023-04-07 04:36:46] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 04:36:46] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-07 04:36:46] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-07 04:36:46] [INFO ] After 110ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 04:36:46] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 04:36:46] [INFO ] After 46ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 04:36:46] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 0 ms to minimize.
[2023-04-07 04:36:46] [INFO ] Deduced a trap composed of 3 places in 96 ms of which 1 ms to minimize.
[2023-04-07 04:36:46] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 1 ms to minimize.
[2023-04-07 04:36:46] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 0 ms to minimize.
[2023-04-07 04:36:47] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 1 ms to minimize.
[2023-04-07 04:36:47] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 1 ms to minimize.
[2023-04-07 04:36:47] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 0 ms to minimize.
[2023-04-07 04:36:47] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 0 ms to minimize.
[2023-04-07 04:36:47] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 1 ms to minimize.
[2023-04-07 04:36:47] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1022 ms
[2023-04-07 04:36:47] [INFO ] After 1095ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-04-07 04:36:47] [INFO ] After 1295ms 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 34 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 35 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 47 ms. Remains 309 /309 variables (removed 0) and now considering 1464/1464 (removed 0) transitions.
[2023-04-07 04:36:47] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-07 04:36:47] [INFO ] Invariant cache hit.
[2023-04-07 04:36:47] [INFO ] Implicit Places using invariants in 338 ms returned []
[2023-04-07 04:36:48] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-07 04:36:48] [INFO ] Invariant cache hit.
[2023-04-07 04:36:48] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 04:36:49] [INFO ] Implicit Places using invariants and state equation in 1039 ms returned []
Implicit Place search using SMT with State Equation took 1397 ms to find 0 implicit places.
[2023-04-07 04:36:49] [INFO ] Redundant transitions in 20 ms returned []
[2023-04-07 04:36:49] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-07 04:36:49] [INFO ] Invariant cache hit.
[2023-04-07 04:36:49] [INFO ] Dead Transitions using invariants and state equation in 495 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1964 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 0 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 53 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-07 04:36:49] [INFO ] Computed 15 invariants in 1 ms
[2023-04-07 04:36:49] [INFO ] After 119ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 04:36:49] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-04-07 04:36:49] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 04:36:49] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 04:36:49] [INFO ] After 6ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 04:36:50] [INFO ] Deduced a trap composed of 2 places in 219 ms of which 32 ms to minimize.
[2023-04-07 04:36:50] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 0 ms to minimize.
[2023-04-07 04:36:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 271 ms
[2023-04-07 04:36:50] [INFO ] After 283ms 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-07 04:36:50] [INFO ] After 374ms 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 204 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 124 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 38 ms. Remains 309 /309 variables (removed 0) and now considering 1464/1464 (removed 0) transitions.
[2023-04-07 04:36:50] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
// Phase 1: matrix 505 rows 309 cols
[2023-04-07 04:36:50] [INFO ] Computed 22 invariants in 2 ms
[2023-04-07 04:36:51] [INFO ] Implicit Places using invariants in 465 ms returned []
[2023-04-07 04:36:51] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-07 04:36:51] [INFO ] Invariant cache hit.
[2023-04-07 04:36:51] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 04:36:52] [INFO ] Implicit Places using invariants and state equation in 926 ms returned []
Implicit Place search using SMT with State Equation took 1408 ms to find 0 implicit places.
[2023-04-07 04:36:52] [INFO ] Redundant transitions in 19 ms returned []
[2023-04-07 04:36:52] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-07 04:36:52] [INFO ] Invariant cache hit.
[2023-04-07 04:36:52] [INFO ] Dead Transitions using invariants and state equation in 483 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1974 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 105 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 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))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) 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 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 564376 steps, run timeout after 3001 ms. (steps per millisecond=188 ) properties seen :{0=1, 2=1}
Probabilistic random walk after 564376 steps, saw 205654 distinct states, run finished after 3001 ms. (steps per millisecond=188 ) properties seen :2
Running SMT prover for 1 properties.
[2023-04-07 04:36:55] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-07 04:36:55] [INFO ] Invariant cache hit.
[2023-04-07 04:36:55] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 04:36:56] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-07 04:36:56] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-07 04:36:56] [INFO ] After 116ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 04:36:56] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 04:36:56] [INFO ] After 60ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 04:36:56] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 1 ms to minimize.
[2023-04-07 04:36:56] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 1 ms to minimize.
[2023-04-07 04:36:56] [INFO ] Deduced a trap composed of 3 places in 111 ms of which 0 ms to minimize.
[2023-04-07 04:36:56] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 1 ms to minimize.
[2023-04-07 04:36:56] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 0 ms to minimize.
[2023-04-07 04:36:56] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 0 ms to minimize.
[2023-04-07 04:36:57] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 0 ms to minimize.
[2023-04-07 04:36:57] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 1 ms to minimize.
[2023-04-07 04:36:57] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 0 ms to minimize.
[2023-04-07 04:36:57] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1001 ms
[2023-04-07 04:36:57] [INFO ] After 1083ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-04-07 04:36:57] [INFO ] After 1326ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 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 32 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 41 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 681496 steps, run timeout after 3001 ms. (steps per millisecond=227 ) properties seen :{}
Probabilistic random walk after 681496 steps, saw 236726 distinct states, run finished after 3001 ms. (steps per millisecond=227 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 04:37:00] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-07 04:37:00] [INFO ] Invariant cache hit.
[2023-04-07 04:37:00] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 04:37:00] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-07 04:37:00] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-07 04:37:00] [INFO ] After 118ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 04:37:00] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 04:37:00] [INFO ] After 46ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 04:37:00] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 0 ms to minimize.
[2023-04-07 04:37:00] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 0 ms to minimize.
[2023-04-07 04:37:01] [INFO ] Deduced a trap composed of 3 places in 112 ms of which 1 ms to minimize.
[2023-04-07 04:37:01] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 1 ms to minimize.
[2023-04-07 04:37:01] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 0 ms to minimize.
[2023-04-07 04:37:01] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 0 ms to minimize.
[2023-04-07 04:37:01] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2023-04-07 04:37:01] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 1 ms to minimize.
[2023-04-07 04:37:01] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 0 ms to minimize.
[2023-04-07 04:37:01] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1038 ms
[2023-04-07 04:37:01] [INFO ] After 1108ms 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-07 04:37:01] [INFO ] After 1323ms 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 29 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.
Starting structural reductions in REACHABILITY mode, iteration 0 : 309/309 places, 1464/1464 transitions.
Applied a total of 0 rules in 29 ms. Remains 309 /309 variables (removed 0) and now considering 1464/1464 (removed 0) transitions.
[2023-04-07 04:37:01] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-07 04:37:01] [INFO ] Invariant cache hit.
[2023-04-07 04:37:02] [INFO ] Implicit Places using invariants in 332 ms returned []
[2023-04-07 04:37:02] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-07 04:37:02] [INFO ] Invariant cache hit.
[2023-04-07 04:37:02] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 04:37:03] [INFO ] Implicit Places using invariants and state equation in 895 ms returned []
Implicit Place search using SMT with State Equation took 1245 ms to find 0 implicit places.
[2023-04-07 04:37:03] [INFO ] Redundant transitions in 20 ms returned []
[2023-04-07 04:37:03] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-07 04:37:03] [INFO ] Invariant cache hit.
[2023-04-07 04:37:03] [INFO ] Dead Transitions using invariants and state equation in 439 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1751 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 0 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-07 04:37:03] [INFO ] Computed 15 invariants in 0 ms
[2023-04-07 04:37:03] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 04:37:03] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-04-07 04:37:03] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 04:37:03] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 04:37:03] [INFO ] After 9ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 04:37:03] [INFO ] Deduced a trap composed of 2 places in 60 ms of which 1 ms to minimize.
[2023-04-07 04:37:03] [INFO ] Deduced a trap composed of 2 places in 94 ms of which 36 ms to minimize.
[2023-04-07 04:37:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 174 ms
[2023-04-07 04:37:03] [INFO ] After 190ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-04-07 04:37:03] [INFO ] After 277ms 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 209 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 95 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 102 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 116 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 213 ms.
Product exploration explored 100000 steps with 0 reset in 226 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 29 ms. Remains 309 /309 variables (removed 0) and now considering 1464/1464 (removed 0) transitions.
[2023-04-07 04:37:04] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
// Phase 1: matrix 505 rows 309 cols
[2023-04-07 04:37:04] [INFO ] Computed 22 invariants in 2 ms
[2023-04-07 04:37:05] [INFO ] Implicit Places using invariants in 278 ms returned []
[2023-04-07 04:37:05] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-07 04:37:05] [INFO ] Invariant cache hit.
[2023-04-07 04:37:05] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 04:37:06] [INFO ] Implicit Places using invariants and state equation in 883 ms returned []
Implicit Place search using SMT with State Equation took 1176 ms to find 0 implicit places.
[2023-04-07 04:37:06] [INFO ] Redundant transitions in 20 ms returned []
[2023-04-07 04:37:06] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-07 04:37:06] [INFO ] Invariant cache hit.
[2023-04-07 04:37:06] [INFO ] Dead Transitions using invariants and state equation in 468 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1728 ms. Remains : 309/309 places, 1464/1464 transitions.
Treatment of property EisenbergMcGuire-PT-07-LTLFireability-02 finished in 31736 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 78 ms. Remains 511 /515 variables (removed 4) and now considering 1666/1694 (removed 28) transitions.
[2023-04-07 04:37:07] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
// Phase 1: matrix 707 rows 511 cols
[2023-04-07 04:37:07] [INFO ] Computed 22 invariants in 2 ms
[2023-04-07 04:37:07] [INFO ] Implicit Places using invariants in 334 ms returned []
[2023-04-07 04:37:07] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-07 04:37:07] [INFO ] Invariant cache hit.
[2023-04-07 04:37:07] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 04:37:08] [INFO ] Implicit Places using invariants and state equation in 1598 ms returned []
Implicit Place search using SMT with State Equation took 1957 ms to find 0 implicit places.
[2023-04-07 04:37:08] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-07 04:37:08] [INFO ] Invariant cache hit.
[2023-04-07 04:37:09] [INFO ] Dead Transitions using invariants and state equation in 632 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 2689 ms. Remains : 511/515 places, 1666/1694 transitions.
Stuttering acceptance computed with spot in 452 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 240 ms.
Product exploration explored 100000 steps with 0 reset in 283 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 195 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 289 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 316 ms. (steps per millisecond=31 ) 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 2 ms. (steps per millisecond=500 ) 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 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 2 ms. (steps per millisecond=500 ) 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 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 2 ms. (steps per millisecond=500 ) 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 2 ms. (steps per millisecond=500 ) 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 135768 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 135768 steps, saw 94811 distinct states, run finished after 3001 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 15 properties.
[2023-04-07 04:37:14] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-07 04:37:14] [INFO ] Invariant cache hit.
[2023-04-07 04:37:14] [INFO ] [Real]Absence check using 15 positive place invariants in 10 ms returned sat
[2023-04-07 04:37:14] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 4 ms returned sat
[2023-04-07 04:37:14] [INFO ] After 228ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:13
[2023-04-07 04:37:14] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned sat
[2023-04-07 04:37:14] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 4 ms returned sat
[2023-04-07 04:37:15] [INFO ] After 495ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :9
[2023-04-07 04:37:15] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 04:37:15] [INFO ] After 460ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :6 sat :9
[2023-04-07 04:37:16] [INFO ] Deduced a trap composed of 3 places in 122 ms of which 1 ms to minimize.
[2023-04-07 04:37:16] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 0 ms to minimize.
[2023-04-07 04:37:16] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 0 ms to minimize.
[2023-04-07 04:37:16] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 0 ms to minimize.
[2023-04-07 04:37:16] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 0 ms to minimize.
[2023-04-07 04:37:16] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 1 ms to minimize.
[2023-04-07 04:37:16] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 718 ms
[2023-04-07 04:37:16] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 0 ms to minimize.
[2023-04-07 04:37:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2023-04-07 04:37:17] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2023-04-07 04:37:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
[2023-04-07 04:37:17] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 1 ms to minimize.
[2023-04-07 04:37:17] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 1 ms to minimize.
[2023-04-07 04:37:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 246 ms
[2023-04-07 04:37:17] [INFO ] After 2186ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :9
Attempting to minimize the solution found.
Minimization took 438 ms.
[2023-04-07 04:37:18] [INFO ] After 3359ms 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 69 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 64 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 64 ms. Remains : 308/511 places, 1463/1666 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 9) 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 9) 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 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 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 9) 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 9) 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 9) 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 9) 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 9) seen :0
Interrupted probabilistic random walk after 245904 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :{}
Probabilistic random walk after 245904 steps, saw 118179 distinct states, run finished after 3001 ms. (steps per millisecond=81 ) properties seen :0
Running SMT prover for 9 properties.
[2023-04-07 04:37:21] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
// Phase 1: matrix 504 rows 308 cols
[2023-04-07 04:37:21] [INFO ] Computed 22 invariants in 2 ms
[2023-04-07 04:37:21] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-07 04:37:21] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-07 04:37:21] [INFO ] After 172ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-04-07 04:37:21] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-07 04:37:21] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-07 04:37:22] [INFO ] After 268ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-04-07 04:37:22] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 04:37:22] [INFO ] After 252ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-04-07 04:37:22] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 0 ms to minimize.
[2023-04-07 04:37:22] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 0 ms to minimize.
[2023-04-07 04:37:22] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 0 ms to minimize.
[2023-04-07 04:37:22] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 0 ms to minimize.
[2023-04-07 04:37:22] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 0 ms to minimize.
[2023-04-07 04:37:22] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 1 ms to minimize.
[2023-04-07 04:37:23] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 0 ms to minimize.
[2023-04-07 04:37:23] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2023-04-07 04:37:23] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 0 ms to minimize.
[2023-04-07 04:37:23] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-04-07 04:37:23] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1004 ms
[2023-04-07 04:37:23] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2023-04-07 04:37:23] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2023-04-07 04:37:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 196 ms
[2023-04-07 04:37:23] [INFO ] Deduced a trap composed of 3 places in 110 ms of which 1 ms to minimize.
[2023-04-07 04:37:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2023-04-07 04:37:23] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 0 ms to minimize.
[2023-04-07 04:37:23] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2023-04-07 04:37:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 146 ms
[2023-04-07 04:37:24] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2023-04-07 04:37:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2023-04-07 04:37:24] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2023-04-07 04:37:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2023-04-07 04:37:24] [INFO ] After 2222ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 272 ms.
[2023-04-07 04:37:24] [INFO ] After 2900ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
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 40 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 40 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 29 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2023-04-07 04:37:24] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 04:37:24] [INFO ] Invariant cache hit.
[2023-04-07 04:37:24] [INFO ] Implicit Places using invariants in 286 ms returned []
[2023-04-07 04:37:24] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 04:37:24] [INFO ] Invariant cache hit.
[2023-04-07 04:37:25] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 04:37:25] [INFO ] Implicit Places using invariants and state equation in 929 ms returned []
Implicit Place search using SMT with State Equation took 1240 ms to find 0 implicit places.
[2023-04-07 04:37:25] [INFO ] Redundant transitions in 20 ms returned []
[2023-04-07 04:37:25] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 04:37:25] [INFO ] Invariant cache hit.
[2023-04-07 04:37:26] [INFO ] Dead Transitions using invariants and state equation in 431 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1760 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 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 21 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-07 04:37:26] [INFO ] Computed 15 invariants in 1 ms
[2023-04-07 04:37:26] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-04-07 04:37:26] [INFO ] After 141ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-04-07 04:37:26] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-04-07 04:37:26] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-04-07 04:37:26] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 04:37:26] [INFO ] After 56ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-04-07 04:37:26] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
[2023-04-07 04:37:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2023-04-07 04:37:26] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2023-04-07 04:37:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2023-04-07 04:37:26] [INFO ] After 169ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 54 ms.
[2023-04-07 04:37:26] [INFO ] After 346ms 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 95 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 255 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]
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 8 ms. Remains 511 /511 variables (removed 0) and now considering 1666/1666 (removed 0) transitions.
[2023-04-07 04:37:27] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
// Phase 1: matrix 707 rows 511 cols
[2023-04-07 04:37:27] [INFO ] Computed 22 invariants in 3 ms
[2023-04-07 04:37:27] [INFO ] Implicit Places using invariants in 278 ms returned []
[2023-04-07 04:37:27] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-07 04:37:27] [INFO ] Invariant cache hit.
[2023-04-07 04:37:28] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 04:37:29] [INFO ] Implicit Places using invariants and state equation in 1480 ms returned []
Implicit Place search using SMT with State Equation took 1778 ms to find 0 implicit places.
[2023-04-07 04:37:29] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-07 04:37:29] [INFO ] Invariant cache hit.
[2023-04-07 04:37:29] [INFO ] Dead Transitions using invariants and state equation in 585 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2383 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 91 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]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) 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 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 354712 steps, run timeout after 3001 ms. (steps per millisecond=118 ) properties seen :{}
Probabilistic random walk after 354712 steps, saw 235509 distinct states, run finished after 3001 ms. (steps per millisecond=118 ) properties seen :0
Running SMT prover for 3 properties.
[2023-04-07 04:37:33] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-07 04:37:33] [INFO ] Invariant cache hit.
[2023-04-07 04:37:33] [INFO ] [Real]Absence check using 15 positive place invariants in 12 ms returned sat
[2023-04-07 04:37:33] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 4 ms returned sat
[2023-04-07 04:37:33] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 04:37:33] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned sat
[2023-04-07 04:37:33] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 6 ms returned sat
[2023-04-07 04:37:33] [INFO ] After 251ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-07 04:37:33] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 04:37:34] [INFO ] After 185ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-07 04:37:34] [INFO ] Deduced a trap composed of 3 places in 131 ms of which 0 ms to minimize.
[2023-04-07 04:37:34] [INFO ] Deduced a trap composed of 3 places in 146 ms of which 0 ms to minimize.
[2023-04-07 04:37:34] [INFO ] Deduced a trap composed of 3 places in 106 ms of which 0 ms to minimize.
[2023-04-07 04:37:34] [INFO ] Deduced a trap composed of 3 places in 102 ms of which 0 ms to minimize.
[2023-04-07 04:37:34] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 0 ms to minimize.
[2023-04-07 04:37:34] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 1 ms to minimize.
[2023-04-07 04:37:35] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 0 ms to minimize.
[2023-04-07 04:37:35] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 952 ms
[2023-04-07 04:37:35] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 0 ms to minimize.
[2023-04-07 04:37:35] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 0 ms to minimize.
[2023-04-07 04:37:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 246 ms
[2023-04-07 04:37:35] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 1 ms to minimize.
[2023-04-07 04:37:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 160 ms
[2023-04-07 04:37:35] [INFO ] After 1666ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 136 ms.
[2023-04-07 04:37:35] [INFO ] After 2180ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 30 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 0 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 54 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 54 ms. Remains : 308/511 places, 1463/1666 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) 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 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 437728 steps, run timeout after 3001 ms. (steps per millisecond=145 ) properties seen :{}
Probabilistic random walk after 437728 steps, saw 177632 distinct states, run finished after 3001 ms. (steps per millisecond=145 ) properties seen :0
Running SMT prover for 3 properties.
[2023-04-07 04:37:38] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
// Phase 1: matrix 504 rows 308 cols
[2023-04-07 04:37:38] [INFO ] Computed 22 invariants in 2 ms
[2023-04-07 04:37:39] [INFO ] [Real]Absence check using 15 positive place invariants in 4 ms returned sat
[2023-04-07 04:37:39] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-07 04:37:39] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 04:37:39] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-07 04:37:39] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-07 04:37:39] [INFO ] After 150ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-07 04:37:39] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 04:37:39] [INFO ] After 105ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-07 04:37:39] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 1 ms to minimize.
[2023-04-07 04:37:39] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 0 ms to minimize.
[2023-04-07 04:37:39] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 0 ms to minimize.
[2023-04-07 04:37:39] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 0 ms to minimize.
[2023-04-07 04:37:39] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 0 ms to minimize.
[2023-04-07 04:37:39] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 0 ms to minimize.
[2023-04-07 04:37:39] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 489 ms
[2023-04-07 04:37:40] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 0 ms to minimize.
[2023-04-07 04:37:40] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 0 ms to minimize.
[2023-04-07 04:37:40] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 0 ms to minimize.
[2023-04-07 04:37:40] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 2 ms to minimize.
[2023-04-07 04:37:40] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 7 ms to minimize.
[2023-04-07 04:37:40] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 0 ms to minimize.
[2023-04-07 04:37:40] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 0 ms to minimize.
[2023-04-07 04:37:40] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 0 ms to minimize.
[2023-04-07 04:37:40] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 0 ms to minimize.
[2023-04-07 04:37:40] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 1 ms to minimize.
[2023-04-07 04:37:41] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 0 ms to minimize.
[2023-04-07 04:37:41] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1112 ms
[2023-04-07 04:37:41] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 0 ms to minimize.
[2023-04-07 04:37:41] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2023-04-07 04:37:41] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 0 ms to minimize.
[2023-04-07 04:37:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 235 ms
[2023-04-07 04:37:41] [INFO ] After 2006ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 82 ms.
[2023-04-07 04:37:41] [INFO ] After 2358ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 11 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 44 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 29 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2023-04-07 04:37:41] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 04:37:41] [INFO ] Invariant cache hit.
[2023-04-07 04:37:41] [INFO ] Implicit Places using invariants in 234 ms returned []
[2023-04-07 04:37:41] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 04:37:41] [INFO ] Invariant cache hit.
[2023-04-07 04:37:41] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 04:37:42] [INFO ] Implicit Places using invariants and state equation in 941 ms returned []
Implicit Place search using SMT with State Equation took 1221 ms to find 0 implicit places.
[2023-04-07 04:37:42] [INFO ] Redundant transitions in 19 ms returned []
[2023-04-07 04:37:42] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 04:37:42] [INFO ] Invariant cache hit.
[2023-04-07 04:37:43] [INFO ] Dead Transitions using invariants and state equation in 489 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1768 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-07 04:37:43] [INFO ] Computed 15 invariants in 1 ms
[2023-04-07 04:37:43] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-04-07 04:37:43] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 04:37:43] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-04-07 04:37:43] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-07 04:37:43] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 04:37:43] [INFO ] After 17ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-07 04:37:43] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
[2023-04-07 04:37:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2023-04-07 04:37:43] [INFO ] Deduced a trap composed of 2 places in 11 ms of which 1 ms to minimize.
[2023-04-07 04:37:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 20 ms
[2023-04-07 04:37:43] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2023-04-07 04:37:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2023-04-07 04:37:43] [INFO ] After 115ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-04-07 04:37:43] [INFO ] After 209ms 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 267 ms :[true, (NOT p2), p2, false, false, (AND (NOT p1) (NOT p2)), false, false, false]
Stuttering acceptance computed with spot in 248 ms :[true, (NOT p2), p2, false, false, (AND (NOT p1) (NOT p2)), false, false, false]
Stuttering acceptance computed with spot in 227 ms :[true, (NOT p2), p2, false, false, (AND (NOT p1) (NOT p2)), false, false, false]
Product exploration explored 100000 steps with 0 reset in 193 ms.
Product exploration explored 100000 steps with 0 reset in 245 ms.
Applying partial POR strategy [true, false, true, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 343 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 122 ms. Remains 504 /511 variables (removed 7) and now considering 1897/1666 (removed -231) transitions.
[2023-04-07 04:37:45] [INFO ] Redundant transitions in 40 ms returned []
[2023-04-07 04:37:45] [INFO ] Flow matrix only has 819 transitions (discarded 1078 similar events)
// Phase 1: matrix 819 rows 504 cols
[2023-04-07 04:37:45] [INFO ] Computed 22 invariants in 2 ms
[2023-04-07 04:37:46] [INFO ] Dead Transitions using invariants and state equation in 649 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 847 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 8 ms. Remains 511 /511 variables (removed 0) and now considering 1666/1666 (removed 0) transitions.
[2023-04-07 04:37:46] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
// Phase 1: matrix 707 rows 511 cols
[2023-04-07 04:37:46] [INFO ] Computed 22 invariants in 3 ms
[2023-04-07 04:37:46] [INFO ] Implicit Places using invariants in 402 ms returned []
[2023-04-07 04:37:46] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-07 04:37:46] [INFO ] Invariant cache hit.
[2023-04-07 04:37:46] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 04:37:47] [INFO ] Implicit Places using invariants and state equation in 1426 ms returned []
Implicit Place search using SMT with State Equation took 1837 ms to find 0 implicit places.
[2023-04-07 04:37:47] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-07 04:37:47] [INFO ] Invariant cache hit.
[2023-04-07 04:37:48] [INFO ] Dead Transitions using invariants and state equation in 526 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2388 ms. Remains : 511/511 places, 1666/1666 transitions.
Treatment of property EisenbergMcGuire-PT-07-LTLFireability-04 finished in 41739 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 22 ms. Remains 511 /515 variables (removed 4) and now considering 1666/1694 (removed 28) transitions.
[2023-04-07 04:37:48] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-07 04:37:48] [INFO ] Invariant cache hit.
[2023-04-07 04:37:49] [INFO ] Implicit Places using invariants in 386 ms returned []
[2023-04-07 04:37:49] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-07 04:37:49] [INFO ] Invariant cache hit.
[2023-04-07 04:37:49] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 04:37:50] [INFO ] Implicit Places using invariants and state equation in 1572 ms returned []
Implicit Place search using SMT with State Equation took 1960 ms to find 0 implicit places.
[2023-04-07 04:37:50] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-07 04:37:50] [INFO ] Invariant cache hit.
[2023-04-07 04:37:51] [INFO ] Dead Transitions using invariants and state equation in 538 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 2523 ms. Remains : 511/515 places, 1666/1694 transitions.
Stuttering acceptance computed with spot in 60 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 615 ms.
Product exploration explored 100000 steps with 50000 reset in 603 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 16 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 3844 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 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 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 72 ms. Remains 308 /515 variables (removed 207) and now considering 1463/1694 (removed 231) transitions.
[2023-04-07 04:37:52] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
// Phase 1: matrix 504 rows 308 cols
[2023-04-07 04:37:52] [INFO ] Computed 22 invariants in 4 ms
[2023-04-07 04:37:52] [INFO ] Implicit Places using invariants in 268 ms returned []
[2023-04-07 04:37:52] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 04:37:52] [INFO ] Invariant cache hit.
[2023-04-07 04:37:52] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 04:37:53] [INFO ] Implicit Places using invariants and state equation in 1001 ms returned []
Implicit Place search using SMT with State Equation took 1270 ms to find 0 implicit places.
[2023-04-07 04:37:53] [INFO ] Redundant transitions in 19 ms returned []
[2023-04-07 04:37:53] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 04:37:53] [INFO ] Invariant cache hit.
[2023-04-07 04:37:54] [INFO ] Dead Transitions using invariants and state equation in 491 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 1870 ms. Remains : 308/515 places, 1463/1694 transitions.
Stuttering acceptance computed with spot in 232 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 208 ms.
Product exploration explored 100000 steps with 0 reset in 237 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 139 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 184 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 133 ms. (steps per millisecond=75 ) properties (out of 8) 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 8) 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 8) 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 8) 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 8) 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 8) 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 8) 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 8) 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 8) seen :0
Interrupted probabilistic random walk after 347616 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :{3=1, 7=1}
Probabilistic random walk after 347616 steps, saw 150277 distinct states, run finished after 3001 ms. (steps per millisecond=115 ) properties seen :2
Running SMT prover for 6 properties.
[2023-04-07 04:37:58] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 04:37:58] [INFO ] Invariant cache hit.
[2023-04-07 04:37:58] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-04-07 04:37:58] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-07 04:37:58] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-07 04:37:59] [INFO ] After 166ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :3
[2023-04-07 04:37:59] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 04:37:59] [INFO ] After 121ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :3 sat :3
[2023-04-07 04:37:59] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 0 ms to minimize.
[2023-04-07 04:37:59] [INFO ] Deduced a trap composed of 3 places in 142 ms of which 0 ms to minimize.
[2023-04-07 04:37:59] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 0 ms to minimize.
[2023-04-07 04:37:59] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 1 ms to minimize.
[2023-04-07 04:37:59] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 0 ms to minimize.
[2023-04-07 04:37:59] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 0 ms to minimize.
[2023-04-07 04:37:59] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2023-04-07 04:37:59] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 778 ms
[2023-04-07 04:38:00] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 0 ms to minimize.
[2023-04-07 04:38:00] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 0 ms to minimize.
[2023-04-07 04:38:00] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 0 ms to minimize.
[2023-04-07 04:38:00] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
[2023-04-07 04:38:00] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 0 ms to minimize.
[2023-04-07 04:38:00] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 507 ms
[2023-04-07 04:38:00] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 0 ms to minimize.
[2023-04-07 04:38:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2023-04-07 04:38:00] [INFO ] After 1564ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :3
Attempting to minimize the solution found.
Minimization took 79 ms.
[2023-04-07 04:38:00] [INFO ] After 1916ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :3
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 6 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.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 3) seen :0
Finished Best-First random walk after 392 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=392 )
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 342 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 61 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 54 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 33 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2023-04-07 04:38:01] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 04:38:01] [INFO ] Invariant cache hit.
[2023-04-07 04:38:01] [INFO ] Implicit Places using invariants in 228 ms returned []
[2023-04-07 04:38:01] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 04:38:01] [INFO ] Invariant cache hit.
[2023-04-07 04:38:01] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 04:38:02] [INFO ] Implicit Places using invariants and state equation in 909 ms returned []
Implicit Place search using SMT with State Equation took 1183 ms to find 0 implicit places.
[2023-04-07 04:38:02] [INFO ] Redundant transitions in 19 ms returned []
[2023-04-07 04:38:02] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 04:38:02] [INFO ] Invariant cache hit.
[2023-04-07 04:38:02] [INFO ] Dead Transitions using invariants and state equation in 432 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1689 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 118 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 60 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 2) 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 2) 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 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.
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 122 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 64 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 188 ms.
Product exploration explored 100000 steps with 0 reset in 218 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 28 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2023-04-07 04:38:04] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 04:38:04] [INFO ] Invariant cache hit.
[2023-04-07 04:38:04] [INFO ] Implicit Places using invariants in 261 ms returned []
[2023-04-07 04:38:04] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 04:38:04] [INFO ] Invariant cache hit.
[2023-04-07 04:38:04] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 04:38:05] [INFO ] Implicit Places using invariants and state equation in 968 ms returned []
Implicit Place search using SMT with State Equation took 1264 ms to find 0 implicit places.
[2023-04-07 04:38:05] [INFO ] Redundant transitions in 18 ms returned []
[2023-04-07 04:38:05] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 04:38:05] [INFO ] Invariant cache hit.
[2023-04-07 04:38:05] [INFO ] Dead Transitions using invariants and state equation in 443 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1779 ms. Remains : 308/308 places, 1463/1463 transitions.
Treatment of property EisenbergMcGuire-PT-07-LTLFireability-06 finished in 13458 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 13 ms. Remains 511 /515 variables (removed 4) and now considering 1666/1694 (removed 28) transitions.
[2023-04-07 04:38:05] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
// Phase 1: matrix 707 rows 511 cols
[2023-04-07 04:38:05] [INFO ] Computed 22 invariants in 11 ms
[2023-04-07 04:38:06] [INFO ] Implicit Places using invariants in 332 ms returned []
[2023-04-07 04:38:06] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-07 04:38:06] [INFO ] Invariant cache hit.
[2023-04-07 04:38:06] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 04:38:08] [INFO ] Implicit Places using invariants and state equation in 1854 ms returned []
Implicit Place search using SMT with State Equation took 2214 ms to find 0 implicit places.
[2023-04-07 04:38:08] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-07 04:38:08] [INFO ] Invariant cache hit.
[2023-04-07 04:38:08] [INFO ] Dead Transitions using invariants and state equation in 812 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 3054 ms. Remains : 511/515 places, 1666/1694 transitions.
Stuttering acceptance computed with spot in 62 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 191 ms.
Stack based approach found an accepted trace after 41 steps with 0 reset with depth 42 and stack size 42 in 0 ms.
FORMULA EisenbergMcGuire-PT-07-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-07-LTLFireability-07 finished in 3334 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 59 ms. Remains 310 /515 variables (removed 205) and now considering 1471/1694 (removed 223) transitions.
[2023-04-07 04:38:09] [INFO ] Flow matrix only has 512 transitions (discarded 959 similar events)
// Phase 1: matrix 512 rows 310 cols
[2023-04-07 04:38:09] [INFO ] Computed 22 invariants in 1 ms
[2023-04-07 04:38:09] [INFO ] Implicit Places using invariants in 494 ms returned []
[2023-04-07 04:38:09] [INFO ] Flow matrix only has 512 transitions (discarded 959 similar events)
[2023-04-07 04:38:09] [INFO ] Invariant cache hit.
[2023-04-07 04:38:09] [INFO ] State equation strengthened by 226 read => feed constraints.
[2023-04-07 04:38:10] [INFO ] Implicit Places using invariants and state equation in 960 ms returned []
Implicit Place search using SMT with State Equation took 1479 ms to find 0 implicit places.
[2023-04-07 04:38:10] [INFO ] Redundant transitions in 21 ms returned []
[2023-04-07 04:38:10] [INFO ] Flow matrix only has 512 transitions (discarded 959 similar events)
[2023-04-07 04:38:10] [INFO ] Invariant cache hit.
[2023-04-07 04:38:11] [INFO ] Dead Transitions using invariants and state equation in 827 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 2409 ms. Remains : 310/515 places, 1471/1694 transitions.
Stuttering acceptance computed with spot in 34 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 233 ms.
Stack based approach found an accepted trace after 18 steps with 0 reset with depth 19 and stack size 19 in 1 ms.
FORMULA EisenbergMcGuire-PT-07-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-07-LTLFireability-08 finished in 2701 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 12 ms. Remains 512 /515 variables (removed 3) and now considering 1673/1694 (removed 21) transitions.
[2023-04-07 04:38:11] [INFO ] Flow matrix only has 714 transitions (discarded 959 similar events)
// Phase 1: matrix 714 rows 512 cols
[2023-04-07 04:38:11] [INFO ] Computed 22 invariants in 1 ms
[2023-04-07 04:38:12] [INFO ] Implicit Places using invariants in 312 ms returned []
[2023-04-07 04:38:12] [INFO ] Flow matrix only has 714 transitions (discarded 959 similar events)
[2023-04-07 04:38:12] [INFO ] Invariant cache hit.
[2023-04-07 04:38:12] [INFO ] State equation strengthened by 226 read => feed constraints.
[2023-04-07 04:38:13] [INFO ] Implicit Places using invariants and state equation in 1336 ms returned []
Implicit Place search using SMT with State Equation took 1682 ms to find 0 implicit places.
[2023-04-07 04:38:13] [INFO ] Flow matrix only has 714 transitions (discarded 959 similar events)
[2023-04-07 04:38:13] [INFO ] Invariant cache hit.
[2023-04-07 04:38:14] [INFO ] Dead Transitions using invariants and state equation in 520 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 2241 ms. Remains : 512/515 places, 1673/1694 transitions.
Stuttering acceptance computed with spot in 89 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 70 steps with 0 reset with depth 71 and stack size 71 in 0 ms.
FORMULA EisenbergMcGuire-PT-07-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-07-LTLFireability-10 finished in 2552 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 12 ms. Remains 511 /515 variables (removed 4) and now considering 1666/1694 (removed 28) transitions.
[2023-04-07 04:38:14] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
// Phase 1: matrix 707 rows 511 cols
[2023-04-07 04:38:14] [INFO ] Computed 22 invariants in 2 ms
[2023-04-07 04:38:14] [INFO ] Implicit Places using invariants in 288 ms returned []
[2023-04-07 04:38:14] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-07 04:38:14] [INFO ] Invariant cache hit.
[2023-04-07 04:38:15] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 04:38:16] [INFO ] Implicit Places using invariants and state equation in 1405 ms returned []
Implicit Place search using SMT with State Equation took 1727 ms to find 0 implicit places.
[2023-04-07 04:38:16] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-07 04:38:16] [INFO ] Invariant cache hit.
[2023-04-07 04:38:16] [INFO ] Dead Transitions using invariants and state equation in 526 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 2275 ms. Remains : 511/515 places, 1666/1694 transitions.
Stuttering acceptance computed with spot in 128 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 188 ms.
Stack based approach found an accepted trace after 80 steps with 0 reset with depth 81 and stack size 81 in 1 ms.
FORMULA EisenbergMcGuire-PT-07-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-07-LTLFireability-11 finished in 2614 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 0 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 60 ms. Remains 309 /515 variables (removed 206) and now considering 1464/1694 (removed 230) transitions.
[2023-04-07 04:38:17] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
// Phase 1: matrix 505 rows 309 cols
[2023-04-07 04:38:17] [INFO ] Computed 22 invariants in 4 ms
[2023-04-07 04:38:17] [INFO ] Implicit Places using invariants in 265 ms returned []
[2023-04-07 04:38:17] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-07 04:38:17] [INFO ] Invariant cache hit.
[2023-04-07 04:38:17] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 04:38:18] [INFO ] Implicit Places using invariants and state equation in 974 ms returned []
Implicit Place search using SMT with State Equation took 1258 ms to find 0 implicit places.
[2023-04-07 04:38:18] [INFO ] Redundant transitions in 19 ms returned []
[2023-04-07 04:38:18] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-07 04:38:18] [INFO ] Invariant cache hit.
[2023-04-07 04:38:18] [INFO ] Dead Transitions using invariants and state equation in 441 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 1796 ms. Remains : 309/515 places, 1464/1694 transitions.
Stuttering acceptance computed with spot in 28 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 186 ms.
Stack based approach found an accepted trace after 11 steps with 0 reset with depth 12 and stack size 12 in 0 ms.
FORMULA EisenbergMcGuire-PT-07-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-07-LTLFireability-12 finished in 2031 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 13 ms. Remains 512 /515 variables (removed 3) and now considering 1673/1694 (removed 21) transitions.
[2023-04-07 04:38:19] [INFO ] Flow matrix only has 714 transitions (discarded 959 similar events)
// Phase 1: matrix 714 rows 512 cols
[2023-04-07 04:38:19] [INFO ] Computed 22 invariants in 4 ms
[2023-04-07 04:38:19] [INFO ] Implicit Places using invariants in 241 ms returned []
[2023-04-07 04:38:19] [INFO ] Flow matrix only has 714 transitions (discarded 959 similar events)
[2023-04-07 04:38:19] [INFO ] Invariant cache hit.
[2023-04-07 04:38:19] [INFO ] State equation strengthened by 226 read => feed constraints.
[2023-04-07 04:38:20] [INFO ] Implicit Places using invariants and state equation in 1437 ms returned []
Implicit Place search using SMT with State Equation took 1699 ms to find 0 implicit places.
[2023-04-07 04:38:20] [INFO ] Flow matrix only has 714 transitions (discarded 959 similar events)
[2023-04-07 04:38:20] [INFO ] Invariant cache hit.
[2023-04-07 04:38:21] [INFO ] Dead Transitions using invariants and state equation in 653 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 2374 ms. Remains : 512/515 places, 1673/1694 transitions.
Stuttering acceptance computed with spot in 510 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 506 ms.
Product exploration explored 100000 steps with 33333 reset in 521 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 36 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 3986 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-07 04:38:23] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
// Phase 1: matrix 707 rows 511 cols
[2023-04-07 04:38:23] [INFO ] Computed 22 invariants in 2 ms
[2023-04-07 04:38:23] [INFO ] Implicit Places using invariants in 377 ms returned []
[2023-04-07 04:38:23] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-07 04:38:23] [INFO ] Invariant cache hit.
[2023-04-07 04:38:23] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 04:38:25] [INFO ] Implicit Places using invariants and state equation in 1527 ms returned []
Implicit Place search using SMT with State Equation took 1924 ms to find 0 implicit places.
[2023-04-07 04:38:25] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-07 04:38:25] [INFO ] Invariant cache hit.
[2023-04-07 04:38:25] [INFO ] Dead Transitions using invariants and state equation in 543 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 2494 ms. Remains : 511/515 places, 1666/1694 transitions.
Stuttering acceptance computed with spot in 94 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 2631 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 13 ms. Remains 511 /515 variables (removed 4) and now considering 1666/1694 (removed 28) transitions.
[2023-04-07 04:38:25] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-07 04:38:25] [INFO ] Invariant cache hit.
[2023-04-07 04:38:26] [INFO ] Implicit Places using invariants in 255 ms returned []
[2023-04-07 04:38:26] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-07 04:38:26] [INFO ] Invariant cache hit.
[2023-04-07 04:38:26] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 04:38:27] [INFO ] Implicit Places using invariants and state equation in 1689 ms returned []
Implicit Place search using SMT with State Equation took 1958 ms to find 0 implicit places.
[2023-04-07 04:38:27] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-07 04:38:27] [INFO ] Invariant cache hit.
[2023-04-07 04:38:28] [INFO ] Dead Transitions using invariants and state equation in 527 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 2501 ms. Remains : 511/515 places, 1666/1694 transitions.
Stuttering acceptance computed with spot in 141 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 20035 reset in 404 ms.
Product exploration explored 100000 steps with 19967 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) p0 (NOT p1)), (X (NOT p2)), (X (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), true, (X (X (NOT p2))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 126 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(NOT p2), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 4) seen :2
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
Running SMT prover for 2 properties.
[2023-04-07 04:38:29] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2023-04-07 04:38:29] [INFO ] Invariant cache hit.
[2023-04-07 04:38:29] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2023-04-07 04:38:29] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 4 ms returned sat
[2023-04-07 04:38:30] [INFO ] After 416ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 04:38:30] [INFO ] [Nat]Absence check using 15 positive place invariants in 9 ms returned sat
[2023-04-07 04:38:30] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 4 ms returned sat
[2023-04-07 04:38:30] [INFO ] After 235ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 04:38:30] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 04:38:30] [INFO ] After 95ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 04:38:30] [INFO ] Deduced a trap composed of 5 places in 123 ms of which 0 ms to minimize.
[2023-04-07 04:38:30] [INFO ] Deduced a trap composed of 3 places in 129 ms of which 1 ms to minimize.
[2023-04-07 04:38:31] [INFO ] Deduced a trap composed of 33 places in 139 ms of which 1 ms to minimize.
[2023-04-07 04:38:31] [INFO ] Deduced a trap composed of 67 places in 138 ms of which 1 ms to minimize.
[2023-04-07 04:38:31] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 0 ms to minimize.
[2023-04-07 04:38:31] [INFO ] Deduced a trap composed of 35 places in 101 ms of which 1 ms to minimize.
[2023-04-07 04:38:31] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 1 ms to minimize.
[2023-04-07 04:38:31] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 0 ms to minimize.
[2023-04-07 04:38:32] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 0 ms to minimize.
[2023-04-07 04:38:32] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 0 ms to minimize.
[2023-04-07 04:38:32] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 0 ms to minimize.
[2023-04-07 04:38:32] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 1 ms to minimize.
[2023-04-07 04:38:32] [INFO ] Deduced a trap composed of 3 places in 105 ms of which 0 ms to minimize.
[2023-04-07 04:38:32] [INFO ] Deduced a trap composed of 30 places in 149 ms of which 0 ms to minimize.
[2023-04-07 04:38:32] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 0 ms to minimize.
[2023-04-07 04:38:32] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 0 ms to minimize.
[2023-04-07 04:38:33] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 0 ms to minimize.
[2023-04-07 04:38:33] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 0 ms to minimize.
[2023-04-07 04:38:33] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2538 ms
[2023-04-07 04:38:33] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2023-04-07 04:38:33] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 1 ms to minimize.
[2023-04-07 04:38:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 207 ms
[2023-04-07 04:38:33] [INFO ] After 2927ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 91 ms.
[2023-04-07 04:38:33] [INFO ] After 3364ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 17 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 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 511 transition count 1661
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 506 transition count 1661
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 154 Pre rules applied. Total rules applied 10 place count 506 transition count 1507
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 318 place count 352 transition count 1507
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 402 place count 310 transition count 1465
Applied a total of 402 rules in 63 ms. Remains 310 /511 variables (removed 201) and now considering 1465/1666 (removed 201) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 310/511 places, 1465/1666 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 2) 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 2) 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 2) seen :0
Interrupted probabilistic random walk after 703848 steps, run timeout after 3001 ms. (steps per millisecond=234 ) properties seen :{1=1}
Probabilistic random walk after 703848 steps, saw 259919 distinct states, run finished after 3001 ms. (steps per millisecond=234 ) properties seen :1
Running SMT prover for 1 properties.
[2023-04-07 04:38:36] [INFO ] Flow matrix only has 506 transitions (discarded 959 similar events)
// Phase 1: matrix 506 rows 310 cols
[2023-04-07 04:38:36] [INFO ] Computed 22 invariants in 3 ms
[2023-04-07 04:38:36] [INFO ] [Real]Absence check using 15 positive place invariants in 4 ms returned sat
[2023-04-07 04:38:36] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-07 04:38:36] [INFO ] After 162ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 04:38:36] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-07 04:38:36] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-07 04:38:37] [INFO ] After 104ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 04:38:37] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 04:38:37] [INFO ] After 43ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 04:38:37] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 0 ms to minimize.
[2023-04-07 04:38:37] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 1 ms to minimize.
[2023-04-07 04:38:37] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 0 ms to minimize.
[2023-04-07 04:38:37] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 0 ms to minimize.
[2023-04-07 04:38:37] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2023-04-07 04:38:37] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-04-07 04:38:37] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 559 ms
[2023-04-07 04:38:37] [INFO ] After 652ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-04-07 04:38:37] [INFO ] After 856ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 310 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 310/310 places, 1465/1465 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 310 transition count 1464
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 309 transition count 1464
Applied a total of 2 rules in 32 ms. Remains 309 /310 variables (removed 1) and now considering 1464/1465 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 309/310 places, 1464/1465 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 741288 steps, run timeout after 3001 ms. (steps per millisecond=247 ) properties seen :{}
Probabilistic random walk after 741288 steps, saw 263947 distinct states, run finished after 3003 ms. (steps per millisecond=246 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 04:38:40] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
// Phase 1: matrix 505 rows 309 cols
[2023-04-07 04:38:40] [INFO ] Computed 22 invariants in 3 ms
[2023-04-07 04:38:40] [INFO ] [Real]Absence check using 15 positive place invariants in 15 ms returned sat
[2023-04-07 04:38:40] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-07 04:38:41] [INFO ] After 223ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 04:38:41] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-07 04:38:41] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-07 04:38:41] [INFO ] After 107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 04:38:41] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 04:38:41] [INFO ] After 60ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 04:38:41] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-04-07 04:38:41] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2023-04-07 04:38:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 140 ms
[2023-04-07 04:38:41] [INFO ] After 221ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-04-07 04:38:41] [INFO ] After 434ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 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 31 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 31 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-07 04:38:41] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-07 04:38:41] [INFO ] Invariant cache hit.
[2023-04-07 04:38:41] [INFO ] Implicit Places using invariants in 233 ms returned []
[2023-04-07 04:38:41] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-07 04:38:41] [INFO ] Invariant cache hit.
[2023-04-07 04:38:41] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 04:38:42] [INFO ] Implicit Places using invariants and state equation in 909 ms returned []
Implicit Place search using SMT with State Equation took 1182 ms to find 0 implicit places.
[2023-04-07 04:38:42] [INFO ] Redundant transitions in 19 ms returned []
[2023-04-07 04:38:42] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2023-04-07 04:38:42] [INFO ] Invariant cache hit.
[2023-04-07 04:38:43] [INFO ] Dead Transitions using invariants and state equation in 462 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1702 ms. Remains : 309/309 places, 1464/1464 transitions.
Graph (trivial) has 1332 edges and 309 vertex of which 49 / 309 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 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 267 transition count 317
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 125 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 125 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 162 place count 183 transition count 302
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 328 place count 100 transition count 219
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 2 with 41 rules applied. Total rules applied 369 place count 100 transition count 178
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 381 place count 94 transition count 178
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 387 place count 94 transition count 172
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 393 place count 94 transition count 166
Free-agglomeration rule applied 42 times.
Iterating global reduction 4 with 42 rules applied. Total rules applied 435 place count 94 transition count 124
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 4 with 42 rules applied. Total rules applied 477 place count 52 transition count 124
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 484 place count 52 transition count 124
Applied a total of 484 rules in 12 ms. Remains 52 /309 variables (removed 257) and now considering 124/1464 (removed 1340) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 124 rows 52 cols
[2023-04-07 04:38:43] [INFO ] Computed 15 invariants in 0 ms
[2023-04-07 04:38:43] [INFO ] [Real]Absence check using 15 positive place invariants in 68 ms returned sat
[2023-04-07 04:38:43] [INFO ] After 290ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 04:38:43] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-04-07 04:38:43] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 04:38:43] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 04:38:43] [INFO ] After 7ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 04:38:43] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-04-07 04:38:43] [INFO ] After 83ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), true, (X (X (NOT p2))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (AND (NOT p2) (NOT p0)))]
Knowledge based reduction with 10 factoid took 212 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(NOT p2), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), true]
Stuttering acceptance computed with spot in 127 ms :[(NOT p2), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), true]
[2023-04-07 04:38:44] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
// Phase 1: matrix 707 rows 511 cols
[2023-04-07 04:38:44] [INFO ] Computed 22 invariants in 2 ms
[2023-04-07 04:38:44] [INFO ] [Real]Absence check using 15 positive place invariants in 126 ms returned sat
[2023-04-07 04:38:44] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 12 ms returned sat
[2023-04-07 04:38:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 04:38:45] [INFO ] [Real]Absence check using state equation in 381 ms returned sat
[2023-04-07 04:38:45] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 04:38:45] [INFO ] [Nat]Absence check using 15 positive place invariants in 9 ms returned sat
[2023-04-07 04:38:45] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 7 ms returned sat
[2023-04-07 04:38:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 04:38:46] [INFO ] [Nat]Absence check using state equation in 436 ms returned sat
[2023-04-07 04:38:46] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 04:38:46] [INFO ] [Nat]Added 220 Read/Feed constraints in 46 ms returned sat
[2023-04-07 04:38:46] [INFO ] Deduced a trap composed of 3 places in 404 ms of which 0 ms to minimize.
[2023-04-07 04:38:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 438 ms
Proved EG (NOT p2)
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), true, (X (X (NOT p2))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (AND (NOT p2) (NOT p0))), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 10 factoid took 187 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-07-LTLFireability-15 FALSE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-07-LTLFireability-15 finished in 21123 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 236 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 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 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 52 ms. Remains 308 /515 variables (removed 207) and now considering 1463/1694 (removed 231) transitions.
[2023-04-07 04:38:47] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
// Phase 1: matrix 504 rows 308 cols
[2023-04-07 04:38:47] [INFO ] Computed 22 invariants in 1 ms
[2023-04-07 04:38:47] [INFO ] Implicit Places using invariants in 239 ms returned []
[2023-04-07 04:38:47] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 04:38:47] [INFO ] Invariant cache hit.
[2023-04-07 04:38:47] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 04:38:48] [INFO ] Implicit Places using invariants and state equation in 854 ms returned []
Implicit Place search using SMT with State Equation took 1134 ms to find 0 implicit places.
[2023-04-07 04:38:48] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 04:38:48] [INFO ] Invariant cache hit.
[2023-04-07 04:38:48] [INFO ] Dead Transitions using invariants and state equation in 442 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 1642 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 213 ms.
Product exploration explored 100000 steps with 0 reset in 246 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 174 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 254 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 122 ms. (steps per millisecond=81 ) 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 2 ms. (steps per millisecond=500 ) properties (out of 15) 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 15) 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 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 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 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 2 ms. (steps per millisecond=500 ) 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 2 ms. (steps per millisecond=500 ) 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 176416 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :{}
Probabilistic random walk after 176416 steps, saw 90633 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
Running SMT prover for 15 properties.
[2023-04-07 04:38:52] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 04:38:52] [INFO ] Invariant cache hit.
[2023-04-07 04:38:53] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2023-04-07 04:38:53] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 5 ms returned sat
[2023-04-07 04:38:53] [INFO ] After 223ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:13
[2023-04-07 04:38:53] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-07 04:38:53] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-07 04:38:53] [INFO ] After 271ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :9
[2023-04-07 04:38:53] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 04:38:53] [INFO ] After 293ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :6 sat :9
[2023-04-07 04:38:54] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 0 ms to minimize.
[2023-04-07 04:38:54] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 0 ms to minimize.
[2023-04-07 04:38:54] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 0 ms to minimize.
[2023-04-07 04:38:54] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 0 ms to minimize.
[2023-04-07 04:38:54] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 5 ms to minimize.
[2023-04-07 04:38:54] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2023-04-07 04:38:54] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 496 ms
[2023-04-07 04:38:54] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-04-07 04:38:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2023-04-07 04:38:54] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 0 ms to minimize.
[2023-04-07 04:38:54] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 0 ms to minimize.
[2023-04-07 04:38:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 179 ms
[2023-04-07 04:38:54] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 0 ms to minimize.
[2023-04-07 04:38:54] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 0 ms to minimize.
[2023-04-07 04:38:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 204 ms
[2023-04-07 04:38:55] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 0 ms to minimize.
[2023-04-07 04:38:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2023-04-07 04:38:55] [INFO ] After 1633ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :9
Attempting to minimize the solution found.
Minimization took 291 ms.
[2023-04-07 04:38:55] [INFO ] After 2357ms 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 39 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.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 9) 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 9) 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 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) 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 9) seen :0
Interrupted probabilistic random walk after 399640 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :{}
Probabilistic random walk after 399640 steps, saw 165988 distinct states, run finished after 3001 ms. (steps per millisecond=133 ) properties seen :0
Running SMT prover for 9 properties.
[2023-04-07 04:38:58] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 04:38:59] [INFO ] Invariant cache hit.
[2023-04-07 04:38:59] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-07 04:38:59] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-07 04:38:59] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-04-07 04:38:59] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-07 04:38:59] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-07 04:38:59] [INFO ] After 265ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-04-07 04:38:59] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 04:38:59] [INFO ] After 244ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-04-07 04:38:59] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 0 ms to minimize.
[2023-04-07 04:39:00] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 0 ms to minimize.
[2023-04-07 04:39:00] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 0 ms to minimize.
[2023-04-07 04:39:00] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2023-04-07 04:39:00] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 1 ms to minimize.
[2023-04-07 04:39:00] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 0 ms to minimize.
[2023-04-07 04:39:00] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2023-04-07 04:39:00] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 698 ms
[2023-04-07 04:39:00] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 0 ms to minimize.
[2023-04-07 04:39:00] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2023-04-07 04:39:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 177 ms
[2023-04-07 04:39:00] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 0 ms to minimize.
[2023-04-07 04:39:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2023-04-07 04:39:00] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 0 ms to minimize.
[2023-04-07 04:39:01] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 0 ms to minimize.
[2023-04-07 04:39:01] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 0 ms to minimize.
[2023-04-07 04:39:01] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 0 ms to minimize.
[2023-04-07 04:39:01] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2023-04-07 04:39:01] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 2 ms to minimize.
[2023-04-07 04:39:01] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-04-07 04:39:01] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 0 ms to minimize.
[2023-04-07 04:39:01] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 725 ms
[2023-04-07 04:39:01] [INFO ] After 2246ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 344 ms.
[2023-04-07 04:39:02] [INFO ] After 2996ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 33 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 27 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2023-04-07 04:39:02] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 04:39:02] [INFO ] Invariant cache hit.
[2023-04-07 04:39:02] [INFO ] Implicit Places using invariants in 232 ms returned []
[2023-04-07 04:39:02] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 04:39:02] [INFO ] Invariant cache hit.
[2023-04-07 04:39:02] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 04:39:03] [INFO ] Implicit Places using invariants and state equation in 862 ms returned []
Implicit Place search using SMT with State Equation took 1118 ms to find 0 implicit places.
[2023-04-07 04:39:03] [INFO ] Redundant transitions in 19 ms returned []
[2023-04-07 04:39:03] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 04:39:03] [INFO ] Invariant cache hit.
[2023-04-07 04:39:03] [INFO ] Dead Transitions using invariants and state equation in 463 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1648 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 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-07 04:39:03] [INFO ] Computed 15 invariants in 0 ms
[2023-04-07 04:39:03] [INFO ] [Real]Absence check using 15 positive place invariants in 1 ms returned sat
[2023-04-07 04:39:03] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-04-07 04:39:03] [INFO ] [Nat]Absence check using 15 positive place invariants in 1 ms returned sat
[2023-04-07 04:39:04] [INFO ] After 68ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-04-07 04:39:04] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 04:39:04] [INFO ] After 56ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-04-07 04:39:04] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 0 ms to minimize.
[2023-04-07 04:39:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
[2023-04-07 04:39:04] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-04-07 04:39:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2023-04-07 04:39:04] [INFO ] After 182ms 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-07 04:39:04] [INFO ] After 361ms 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 96 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 248 ms :[true, (NOT p2), p2, false, false, (AND (NOT p1) (NOT p2)), false, false, false]
Stuttering acceptance computed with spot in 237 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 8 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2023-04-07 04:39:04] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
// Phase 1: matrix 504 rows 308 cols
[2023-04-07 04:39:04] [INFO ] Computed 22 invariants in 1 ms
[2023-04-07 04:39:05] [INFO ] Implicit Places using invariants in 225 ms returned []
[2023-04-07 04:39:05] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 04:39:05] [INFO ] Invariant cache hit.
[2023-04-07 04:39:05] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 04:39:05] [INFO ] Implicit Places using invariants and state equation in 845 ms returned []
Implicit Place search using SMT with State Equation took 1094 ms to find 0 implicit places.
[2023-04-07 04:39:05] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 04:39:05] [INFO ] Invariant cache hit.
[2023-04-07 04:39:06] [INFO ] Dead Transitions using invariants and state equation in 443 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1572 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 68 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 309 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 185 ms. (steps per millisecond=54 ) 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 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 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 422160 steps, run timeout after 3001 ms. (steps per millisecond=140 ) properties seen :{}
Probabilistic random walk after 422160 steps, saw 173179 distinct states, run finished after 3001 ms. (steps per millisecond=140 ) properties seen :0
Running SMT prover for 3 properties.
[2023-04-07 04:39:10] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 04:39:10] [INFO ] Invariant cache hit.
[2023-04-07 04:39:10] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-07 04:39:10] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-07 04:39:10] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 04:39:10] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-07 04:39:10] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-07 04:39:10] [INFO ] After 147ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-07 04:39:10] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 04:39:10] [INFO ] After 103ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-07 04:39:10] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 0 ms to minimize.
[2023-04-07 04:39:10] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 0 ms to minimize.
[2023-04-07 04:39:10] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 0 ms to minimize.
[2023-04-07 04:39:10] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 0 ms to minimize.
[2023-04-07 04:39:10] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 360 ms
[2023-04-07 04:39:10] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 1 ms to minimize.
[2023-04-07 04:39:11] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 0 ms to minimize.
[2023-04-07 04:39:11] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 1 ms to minimize.
[2023-04-07 04:39:11] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 0 ms to minimize.
[2023-04-07 04:39:11] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 1 ms to minimize.
[2023-04-07 04:39:11] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2023-04-07 04:39:11] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 0 ms to minimize.
[2023-04-07 04:39:11] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 692 ms
[2023-04-07 04:39:11] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 0 ms to minimize.
[2023-04-07 04:39:11] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 0 ms to minimize.
[2023-04-07 04:39:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 170 ms
[2023-04-07 04:39:11] [INFO ] After 1379ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 70 ms.
[2023-04-07 04:39:11] [INFO ] After 1685ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 5 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.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 438808 steps, run timeout after 3001 ms. (steps per millisecond=146 ) properties seen :{}
Probabilistic random walk after 438808 steps, saw 178007 distinct states, run finished after 3001 ms. (steps per millisecond=146 ) properties seen :0
Running SMT prover for 3 properties.
[2023-04-07 04:39:14] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 04:39:14] [INFO ] Invariant cache hit.
[2023-04-07 04:39:15] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-07 04:39:15] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-07 04:39:15] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 04:39:15] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-07 04:39:15] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-07 04:39:15] [INFO ] After 148ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-07 04:39:15] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 04:39:15] [INFO ] After 102ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-07 04:39:15] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 0 ms to minimize.
[2023-04-07 04:39:15] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 0 ms to minimize.
[2023-04-07 04:39:15] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2023-04-07 04:39:15] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 0 ms to minimize.
[2023-04-07 04:39:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 342 ms
[2023-04-07 04:39:15] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 0 ms to minimize.
[2023-04-07 04:39:15] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 0 ms to minimize.
[2023-04-07 04:39:16] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 0 ms to minimize.
[2023-04-07 04:39:16] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 0 ms to minimize.
[2023-04-07 04:39:16] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 0 ms to minimize.
[2023-04-07 04:39:16] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2023-04-07 04:39:16] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 0 ms to minimize.
[2023-04-07 04:39:16] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 701 ms
[2023-04-07 04:39:16] [INFO ] Deduced a trap composed of 46 places in 63 ms of which 0 ms to minimize.
[2023-04-07 04:39:16] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 0 ms to minimize.
[2023-04-07 04:39:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 193 ms
[2023-04-07 04:39:16] [INFO ] After 1391ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 77 ms.
[2023-04-07 04:39:16] [INFO ] After 1699ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 7 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 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.
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.
[2023-04-07 04:39:16] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 04:39:16] [INFO ] Invariant cache hit.
[2023-04-07 04:39:17] [INFO ] Implicit Places using invariants in 267 ms returned []
[2023-04-07 04:39:17] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 04:39:17] [INFO ] Invariant cache hit.
[2023-04-07 04:39:17] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 04:39:17] [INFO ] Implicit Places using invariants and state equation in 884 ms returned []
Implicit Place search using SMT with State Equation took 1194 ms to find 0 implicit places.
[2023-04-07 04:39:18] [INFO ] Redundant transitions in 18 ms returned []
[2023-04-07 04:39:18] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 04:39:18] [INFO ] Invariant cache hit.
[2023-04-07 04:39:18] [INFO ] Dead Transitions using invariants and state equation in 432 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1706 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 11 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-07 04:39:18] [INFO ] Computed 15 invariants in 0 ms
[2023-04-07 04:39:18] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-04-07 04:39:18] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 04:39:18] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-04-07 04:39:18] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-07 04:39:18] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-07 04:39:18] [INFO ] After 19ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-07 04:39:18] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 0 ms to minimize.
[2023-04-07 04:39:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2023-04-07 04:39:18] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 0 ms to minimize.
[2023-04-07 04:39:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
[2023-04-07 04:39:18] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-04-07 04:39:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2023-04-07 04:39:18] [INFO ] After 116ms 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-07 04:39:18] [INFO ] After 209ms 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 76 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 249 ms :[true, (NOT p2), p2, false, false, (AND (NOT p1) (NOT p2)), false, false, false]
Stuttering acceptance computed with spot in 234 ms :[true, (NOT p2), p2, false, false, (AND (NOT p1) (NOT p2)), false, false, false]
Stuttering acceptance computed with spot in 241 ms :[true, (NOT p2), p2, false, false, (AND (NOT p1) (NOT p2)), false, false, false]
Product exploration explored 100000 steps with 0 reset in 195 ms.
Product exploration explored 100000 steps with 0 reset in 228 ms.
Applying partial POR strategy [true, false, true, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 237 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 34 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2023-04-07 04:39:20] [INFO ] Redundant transitions in 20 ms returned []
[2023-04-07 04:39:20] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
// Phase 1: matrix 504 rows 308 cols
[2023-04-07 04:39:20] [INFO ] Computed 22 invariants in 2 ms
[2023-04-07 04:39:20] [INFO ] Dead Transitions using invariants and state equation in 438 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 530 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-07 04:39:20] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 04:39:20] [INFO ] Invariant cache hit.
[2023-04-07 04:39:21] [INFO ] Implicit Places using invariants in 249 ms returned []
[2023-04-07 04:39:21] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 04:39:21] [INFO ] Invariant cache hit.
[2023-04-07 04:39:21] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-07 04:39:21] [INFO ] Implicit Places using invariants and state equation in 916 ms returned []
Implicit Place search using SMT with State Equation took 1178 ms to find 0 implicit places.
[2023-04-07 04:39:21] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-07 04:39:22] [INFO ] Invariant cache hit.
[2023-04-07 04:39:22] [INFO ] Dead Transitions using invariants and state equation in 458 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1654 ms. Remains : 308/308 places, 1463/1463 transitions.
Treatment of property EisenbergMcGuire-PT-07-LTLFireability-04 finished in 35554 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-07 04:39:22] [INFO ] Flatten gal took : 109 ms
[2023-04-07 04:39:22] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-04-07 04:39:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 515 places, 1694 transitions and 8148 arcs took 14 ms.
Total runtime 203567 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3079/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3079/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3079/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : EisenbergMcGuire-PT-07-LTLFireability-02
Could not compute solution for formula : EisenbergMcGuire-PT-07-LTLFireability-04
Could not compute solution for formula : EisenbergMcGuire-PT-07-LTLFireability-06

BK_STOP 1680842365832

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.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
mcc2023
ltl formula name EisenbergMcGuire-PT-07-LTLFireability-02
ltl formula formula --ltl=/tmp/3079/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 515 places, 1694 transitions and 8148 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3079/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3079/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.200 real 0.040 user 0.030 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3079/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3079/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x563267bd03f4]
1: pnml2lts-mc(+0xa2496) [0x563267bd0496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7fa920c12140]
3: pnml2lts-mc(+0x405be5) [0x563267f33be5]
4: pnml2lts-mc(+0x16b3f9) [0x563267c993f9]
5: pnml2lts-mc(+0x164ac4) [0x563267c92ac4]
6: pnml2lts-mc(+0x272e0a) [0x563267da0e0a]
7: pnml2lts-mc(+0xb61f0) [0x563267be41f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7fa920a654d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7fa920a6567a]
10: pnml2lts-mc(+0xa1581) [0x563267bcf581]
11: pnml2lts-mc(+0xa1910) [0x563267bcf910]
12: pnml2lts-mc(+0xa32a2) [0x563267bd12a2]
13: pnml2lts-mc(+0xa50f4) [0x563267bd30f4]
14: pnml2lts-mc(+0x3f34b3) [0x563267f214b3]
15: pnml2lts-mc(+0x7c63d) [0x563267baa63d]
16: pnml2lts-mc(+0x67d86) [0x563267b95d86]
17: pnml2lts-mc(+0x60a8a) [0x563267b8ea8a]
18: pnml2lts-mc(+0x5eb15) [0x563267b8cb15]
19: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7fa920a4dd0a]
20: pnml2lts-mc(+0x6075e) [0x563267b8e75e]
ltl formula name EisenbergMcGuire-PT-07-LTLFireability-04
ltl formula formula --ltl=/tmp/3079/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 515 places, 1694 transitions and 8148 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3079/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3079/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.230 real 0.040 user 0.030 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3079/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3079/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 9 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name EisenbergMcGuire-PT-07-LTLFireability-06
ltl formula formula --ltl=/tmp/3079/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 515 places, 1694 transitions and 8148 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.220 real 0.050 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3079/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3079/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3079/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3079/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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="ltsminxred"
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 ltsminxred"
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 r521-tall-167987246400252"
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 ;