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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Mar 23 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 13K Mar 23 15:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Mar 23 15:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Mar 23 15:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Mar 23 15:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 753K 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-06-LTLFireability-00
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-01
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-02
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-03
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-04
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-05
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-06
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-07
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-08
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-09
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-10
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-11
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-12
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-13
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-14
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1680841753605

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-06
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 04:29:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 04:29:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 04:29:15] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2023-04-07 04:29:15] [INFO ] Transformed 414 places.
[2023-04-07 04:29:15] [INFO ] Transformed 1296 transitions.
[2023-04-07 04:29:15] [INFO ] Found NUPN structural information;
[2023-04-07 04:29:15] [INFO ] Parsed PT model containing 414 places and 1296 transitions and 5976 arcs in 185 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-06-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-06-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 414 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 414/414 places, 1296/1296 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 387 transition count 1134
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 387 transition count 1134
Applied a total of 54 rules in 68 ms. Remains 387 /414 variables (removed 27) and now considering 1134/1296 (removed 162) transitions.
[2023-04-07 04:29:15] [INFO ] Flow matrix only has 540 transitions (discarded 594 similar events)
// Phase 1: matrix 540 rows 387 cols
[2023-04-07 04:29:15] [INFO ] Computed 19 invariants in 29 ms
[2023-04-07 04:29:16] [INFO ] Implicit Places using invariants in 377 ms returned []
[2023-04-07 04:29:16] [INFO ] Flow matrix only has 540 transitions (discarded 594 similar events)
[2023-04-07 04:29:16] [INFO ] Invariant cache hit.
[2023-04-07 04:29:16] [INFO ] State equation strengthened by 179 read => feed constraints.
[2023-04-07 04:29:17] [INFO ] Implicit Places using invariants and state equation in 862 ms returned []
Implicit Place search using SMT with State Equation took 1263 ms to find 0 implicit places.
[2023-04-07 04:29:17] [INFO ] Flow matrix only has 540 transitions (discarded 594 similar events)
[2023-04-07 04:29:17] [INFO ] Invariant cache hit.
[2023-04-07 04:29:17] [INFO ] Dead Transitions using invariants and state equation in 472 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 387/414 places, 1134/1296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1805 ms. Remains : 387/414 places, 1134/1296 transitions.
Support contains 47 out of 387 places after structural reductions.
[2023-04-07 04:29:17] [INFO ] Flatten gal took : 101 ms
[2023-04-07 04:29:17] [INFO ] Flatten gal took : 61 ms
[2023-04-07 04:29:18] [INFO ] Input system was already deterministic with 1134 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 472 ms. (steps per millisecond=21 ) properties (out of 29) seen :11
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) 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 18) 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 18) 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 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) seen :0
Running SMT prover for 18 properties.
[2023-04-07 04:29:18] [INFO ] Flow matrix only has 540 transitions (discarded 594 similar events)
[2023-04-07 04:29:18] [INFO ] Invariant cache hit.
[2023-04-07 04:29:19] [INFO ] [Real]Absence check using 13 positive place invariants in 14 ms returned sat
[2023-04-07 04:29:19] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-07 04:29:19] [INFO ] After 386ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2023-04-07 04:29:19] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-04-07 04:29:19] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-07 04:29:20] [INFO ] After 589ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2023-04-07 04:29:20] [INFO ] State equation strengthened by 179 read => feed constraints.
[2023-04-07 04:29:20] [INFO ] After 626ms SMT Verify possible using 179 Read/Feed constraints in natural domain returned unsat :0 sat :18
[2023-04-07 04:29:20] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 5 ms to minimize.
[2023-04-07 04:29:21] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 1 ms to minimize.
[2023-04-07 04:29:21] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 10 ms to minimize.
[2023-04-07 04:29:21] [INFO ] Deduced a trap composed of 3 places in 148 ms of which 2 ms to minimize.
[2023-04-07 04:29:21] [INFO ] Deduced a trap composed of 3 places in 117 ms of which 1 ms to minimize.
[2023-04-07 04:29:21] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 767 ms
[2023-04-07 04:29:21] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 0 ms to minimize.
[2023-04-07 04:29:21] [INFO ] Deduced a trap composed of 3 places in 114 ms of which 0 ms to minimize.
[2023-04-07 04:29:21] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2023-04-07 04:29:22] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2023-04-07 04:29:22] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 453 ms
[2023-04-07 04:29:22] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 0 ms to minimize.
[2023-04-07 04:29:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2023-04-07 04:29:22] [INFO ] Deduced a trap composed of 64 places in 128 ms of which 1 ms to minimize.
[2023-04-07 04:29:22] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2023-04-07 04:29:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 251 ms
[2023-04-07 04:29:22] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2023-04-07 04:29:22] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 6 ms to minimize.
[2023-04-07 04:29:22] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 0 ms to minimize.
[2023-04-07 04:29:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 337 ms
[2023-04-07 04:29:23] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 1 ms to minimize.
[2023-04-07 04:29:23] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 0 ms to minimize.
[2023-04-07 04:29:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 225 ms
[2023-04-07 04:29:23] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 0 ms to minimize.
[2023-04-07 04:29:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2023-04-07 04:29:23] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 1 ms to minimize.
[2023-04-07 04:29:23] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 0 ms to minimize.
[2023-04-07 04:29:23] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 1 ms to minimize.
[2023-04-07 04:29:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 320 ms
[2023-04-07 04:29:24] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 7 ms to minimize.
[2023-04-07 04:29:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2023-04-07 04:29:24] [INFO ] After 4066ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :18
Attempting to minimize the solution found.
Minimization took 673 ms.
[2023-04-07 04:29:24] [INFO ] After 5675ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :18
Fused 18 Parikh solutions to 17 different solutions.
Parikh walk visited 0 properties in 718 ms.
Support contains 31 out of 387 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 387/387 places, 1134/1134 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 387 transition count 1128
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 381 transition count 1128
Performed 109 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 109 Pre rules applied. Total rules applied 12 place count 381 transition count 1019
Deduced a syphon composed of 109 places in 3 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 2 with 218 rules applied. Total rules applied 230 place count 272 transition count 1019
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 290 place count 242 transition count 989
Applied a total of 290 rules in 168 ms. Remains 242 /387 variables (removed 145) and now considering 989/1134 (removed 145) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 242/387 places, 989/1134 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 463 ms. (steps per millisecond=21 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) 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 17) 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 17) seen :0
Interrupted probabilistic random walk after 359807 steps, run timeout after 3001 ms. (steps per millisecond=119 ) properties seen :{0=1, 3=1, 4=1, 6=1, 8=1, 9=1, 10=1, 11=1, 13=1, 15=1, 16=1}
Probabilistic random walk after 359807 steps, saw 113153 distinct states, run finished after 3002 ms. (steps per millisecond=119 ) properties seen :11
Running SMT prover for 6 properties.
[2023-04-07 04:29:29] [INFO ] Flow matrix only has 395 transitions (discarded 594 similar events)
// Phase 1: matrix 395 rows 242 cols
[2023-04-07 04:29:29] [INFO ] Computed 19 invariants in 16 ms
[2023-04-07 04:29:29] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-04-07 04:29:29] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-07 04:29:29] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-04-07 04:29:29] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-04-07 04:29:29] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-07 04:29:29] [INFO ] After 188ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-04-07 04:29:29] [INFO ] State equation strengthened by 179 read => feed constraints.
[2023-04-07 04:29:29] [INFO ] After 196ms SMT Verify possible using 179 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-04-07 04:29:30] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 0 ms to minimize.
[2023-04-07 04:29:30] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 1 ms to minimize.
[2023-04-07 04:29:30] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 0 ms to minimize.
[2023-04-07 04:29:30] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2023-04-07 04:29:30] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 0 ms to minimize.
[2023-04-07 04:29:30] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
[2023-04-07 04:29:30] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 1 ms to minimize.
[2023-04-07 04:29:30] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 0 ms to minimize.
[2023-04-07 04:29:30] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2023-04-07 04:29:30] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 0 ms to minimize.
[2023-04-07 04:29:30] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 953 ms
[2023-04-07 04:29:31] [INFO ] Deduced a trap composed of 32 places in 139 ms of which 1 ms to minimize.
[2023-04-07 04:29:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
[2023-04-07 04:29:31] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 3 ms to minimize.
[2023-04-07 04:29:31] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 0 ms to minimize.
[2023-04-07 04:29:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 163 ms
[2023-04-07 04:29:31] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
[2023-04-07 04:29:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2023-04-07 04:29:31] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2023-04-07 04:29:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2023-04-07 04:29:31] [INFO ] After 1770ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 122 ms.
[2023-04-07 04:29:31] [INFO ] After 2192ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 11 ms.
Support contains 12 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 989/989 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 242 transition count 985
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 238 transition count 985
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 236 transition count 973
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 236 transition count 973
Applied a total of 12 rules in 44 ms. Remains 236 /242 variables (removed 6) and now considering 973/989 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 236/242 places, 973/989 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) 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 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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 6) 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 6) seen :0
Interrupted probabilistic random walk after 340872 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :{}
Probabilistic random walk after 340872 steps, saw 103477 distinct states, run finished after 3005 ms. (steps per millisecond=113 ) properties seen :0
Running SMT prover for 6 properties.
[2023-04-07 04:29:34] [INFO ] Flow matrix only has 379 transitions (discarded 594 similar events)
// Phase 1: matrix 379 rows 236 cols
[2023-04-07 04:29:34] [INFO ] Computed 19 invariants in 2 ms
[2023-04-07 04:29:34] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-07 04:29:34] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-07 04:29:34] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-04-07 04:29:35] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-04-07 04:29:35] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-07 04:29:35] [INFO ] After 149ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-04-07 04:29:35] [INFO ] State equation strengthened by 169 read => feed constraints.
[2023-04-07 04:29:35] [INFO ] After 137ms SMT Verify possible using 169 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-04-07 04:29:35] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 1 ms to minimize.
[2023-04-07 04:29:35] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 0 ms to minimize.
[2023-04-07 04:29:35] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2023-04-07 04:29:35] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 0 ms to minimize.
[2023-04-07 04:29:35] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 0 ms to minimize.
[2023-04-07 04:29:35] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2023-04-07 04:29:35] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 0 ms to minimize.
[2023-04-07 04:29:35] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 593 ms
[2023-04-07 04:29:36] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 0 ms to minimize.
[2023-04-07 04:29:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2023-04-07 04:29:36] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2023-04-07 04:29:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2023-04-07 04:29:36] [INFO ] After 1017ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 107 ms.
[2023-04-07 04:29:36] [INFO ] After 1380ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 32 ms.
Support contains 12 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 973/973 transitions.
Applied a total of 0 rules in 24 ms. Remains 236 /236 variables (removed 0) and now considering 973/973 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 236/236 places, 973/973 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 973/973 transitions.
Applied a total of 0 rules in 24 ms. Remains 236 /236 variables (removed 0) and now considering 973/973 (removed 0) transitions.
[2023-04-07 04:29:36] [INFO ] Flow matrix only has 379 transitions (discarded 594 similar events)
[2023-04-07 04:29:36] [INFO ] Invariant cache hit.
[2023-04-07 04:29:36] [INFO ] Implicit Places using invariants in 345 ms returned []
[2023-04-07 04:29:36] [INFO ] Flow matrix only has 379 transitions (discarded 594 similar events)
[2023-04-07 04:29:36] [INFO ] Invariant cache hit.
[2023-04-07 04:29:36] [INFO ] State equation strengthened by 169 read => feed constraints.
[2023-04-07 04:29:37] [INFO ] Implicit Places using invariants and state equation in 583 ms returned []
Implicit Place search using SMT with State Equation took 933 ms to find 0 implicit places.
[2023-04-07 04:29:37] [INFO ] Redundant transitions in 58 ms returned []
[2023-04-07 04:29:37] [INFO ] Flow matrix only has 379 transitions (discarded 594 similar events)
[2023-04-07 04:29:37] [INFO ] Invariant cache hit.
[2023-04-07 04:29:37] [INFO ] Dead Transitions using invariants and state equation in 312 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1336 ms. Remains : 236/236 places, 973/973 transitions.
Graph (trivial) has 813 edges and 236 vertex of which 36 / 236 are part of one of the 6 SCC in 3 ms
Free SCC test removed 30 places
Drop transitions removed 112 transitions
Ensure Unique test removed 575 transitions
Reduce isomorphic transitions removed 687 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 206 transition count 244
Reduce places removed 42 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 43 rules applied. Total rules applied 86 place count 164 transition count 243
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 87 place count 163 transition count 243
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 87 place count 163 transition count 231
Deduced a syphon composed of 12 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 29 rules applied. Total rules applied 116 place count 146 transition count 231
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 226 place count 91 transition count 176
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 249 place count 91 transition count 153
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 257 place count 87 transition count 172
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 260 place count 87 transition count 169
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 270 place count 87 transition count 159
Free-agglomeration rule applied 30 times.
Iterating global reduction 5 with 30 rules applied. Total rules applied 300 place count 87 transition count 129
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 5 with 30 rules applied. Total rules applied 330 place count 57 transition count 129
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 6 with 12 rules applied. Total rules applied 342 place count 57 transition count 129
Applied a total of 342 rules in 42 ms. Remains 57 /236 variables (removed 179) and now considering 129/973 (removed 844) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 129 rows 57 cols
[2023-04-07 04:29:37] [INFO ] Computed 14 invariants in 2 ms
[2023-04-07 04:29:37] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-04-07 04:29:37] [INFO ] [Real]Absence check using 13 positive and 1 generalized place invariants in 1 ms returned sat
[2023-04-07 04:29:37] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-04-07 04:29:37] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-04-07 04:29:37] [INFO ] [Nat]Absence check using 13 positive and 1 generalized place invariants in 0 ms returned sat
[2023-04-07 04:29:37] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-04-07 04:29:37] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-07 04:29:37] [INFO ] After 32ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-04-07 04:29:38] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 0 ms to minimize.
[2023-04-07 04:29:38] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2023-04-07 04:29:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 108 ms
[2023-04-07 04:29:38] [INFO ] After 189ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-04-07 04:29:38] [INFO ] After 330ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
FORMULA EisenbergMcGuire-PT-06-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(F(X(F(((X(p0) U p1)&&X(p2)))))))))'
Support contains 6 out of 387 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 387/387 places, 1134/1134 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 384 transition count 1116
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 384 transition count 1116
Applied a total of 6 rules in 11 ms. Remains 384 /387 variables (removed 3) and now considering 1116/1134 (removed 18) transitions.
[2023-04-07 04:29:38] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
// Phase 1: matrix 522 rows 384 cols
[2023-04-07 04:29:38] [INFO ] Computed 19 invariants in 2 ms
[2023-04-07 04:29:38] [INFO ] Implicit Places using invariants in 180 ms returned []
[2023-04-07 04:29:38] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-07 04:29:38] [INFO ] Invariant cache hit.
[2023-04-07 04:29:39] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-07 04:29:39] [INFO ] Implicit Places using invariants and state equation in 919 ms returned []
Implicit Place search using SMT with State Equation took 1101 ms to find 0 implicit places.
[2023-04-07 04:29:39] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-07 04:29:39] [INFO ] Invariant cache hit.
[2023-04-07 04:29:40] [INFO ] Dead Transitions using invariants and state equation in 374 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 384/387 places, 1116/1134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1487 ms. Remains : 384/387 places, 1116/1134 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 395 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p2), (OR (NOT p1) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-00 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=true, acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=(NOT p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s19 1) (EQ s80 1)), p2:(EQ s121 1), p0:(AND (EQ s0 1) (EQ s8 1) (EQ s254 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 13 reset in 357 ms.
Stack based approach found an accepted trace after 28 steps with 0 reset with depth 29 and stack size 29 in 0 ms.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-00 finished in 2426 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)||G(p1)||(X(X(p0))&&X(p0)))))'
Support contains 4 out of 387 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 387/387 places, 1134/1134 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 384 transition count 1116
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 384 transition count 1116
Applied a total of 6 rules in 17 ms. Remains 384 /387 variables (removed 3) and now considering 1116/1134 (removed 18) transitions.
[2023-04-07 04:29:40] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-07 04:29:40] [INFO ] Invariant cache hit.
[2023-04-07 04:29:41] [INFO ] Implicit Places using invariants in 360 ms returned []
[2023-04-07 04:29:41] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-07 04:29:41] [INFO ] Invariant cache hit.
[2023-04-07 04:29:41] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-07 04:29:42] [INFO ] Implicit Places using invariants and state equation in 1191 ms returned []
Implicit Place search using SMT with State Equation took 1556 ms to find 0 implicit places.
[2023-04-07 04:29:42] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-07 04:29:42] [INFO ] Invariant cache hit.
[2023-04-07 04:29:42] [INFO ] Dead Transitions using invariants and state equation in 441 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 384/387 places, 1116/1134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2017 ms. Remains : 384/387 places, 1116/1134 transitions.
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}]], initial=0, aps=[p1:(OR (EQ s5 0) (EQ s23 0) (EQ s277 0)), p0:(AND (EQ s5 1) (EQ s23 1) (EQ s265 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 234 ms.
Product exploration explored 100000 steps with 0 reset in 294 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 146 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 4) 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 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 228837 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :{}
Probabilistic random walk after 228837 steps, saw 141832 distinct states, run finished after 3002 ms. (steps per millisecond=76 ) properties seen :0
Running SMT prover for 4 properties.
[2023-04-07 04:29:47] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-07 04:29:47] [INFO ] Invariant cache hit.
[2023-04-07 04:29:47] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-04-07 04:29:47] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 4 ms returned sat
[2023-04-07 04:29:47] [INFO ] After 250ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-07 04:29:47] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-04-07 04:29:47] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-07 04:29:47] [INFO ] After 254ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-07 04:29:47] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-07 04:29:48] [INFO ] After 142ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-07 04:29:48] [INFO ] Deduced a trap composed of 6 places in 208 ms of which 1 ms to minimize.
[2023-04-07 04:29:48] [INFO ] Deduced a trap composed of 3 places in 145 ms of which 1 ms to minimize.
[2023-04-07 04:29:48] [INFO ] Deduced a trap composed of 3 places in 117 ms of which 1 ms to minimize.
[2023-04-07 04:29:48] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 1 ms to minimize.
[2023-04-07 04:29:48] [INFO ] Deduced a trap composed of 3 places in 132 ms of which 32 ms to minimize.
[2023-04-07 04:29:49] [INFO ] Deduced a trap composed of 47 places in 579 ms of which 24 ms to minimize.
[2023-04-07 04:29:49] [INFO ] Deduced a trap composed of 46 places in 130 ms of which 0 ms to minimize.
[2023-04-07 04:29:49] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 1 ms to minimize.
[2023-04-07 04:29:49] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 0 ms to minimize.
[2023-04-07 04:29:49] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1915 ms
[2023-04-07 04:29:50] [INFO ] Deduced a trap composed of 44 places in 128 ms of which 0 ms to minimize.
[2023-04-07 04:29:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
[2023-04-07 04:29:50] [INFO ] After 2371ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 108 ms.
[2023-04-07 04:29:50] [INFO ] After 2864ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 94 ms.
Support contains 4 out of 384 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 384 transition count 1110
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 378 transition count 1110
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 12 place count 378 transition count 996
Deduced a syphon composed of 114 places in 2 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 240 place count 264 transition count 996
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 300 place count 234 transition count 966
Applied a total of 300 rules in 92 ms. Remains 234 /384 variables (removed 150) and now considering 966/1116 (removed 150) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 234/384 places, 966/1116 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 283 ms. (steps per millisecond=35 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) 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 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 522844 steps, run timeout after 3001 ms. (steps per millisecond=174 ) properties seen :{}
Probabilistic random walk after 522844 steps, saw 134546 distinct states, run finished after 3001 ms. (steps per millisecond=174 ) properties seen :0
Running SMT prover for 4 properties.
[2023-04-07 04:29:53] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
// Phase 1: matrix 372 rows 234 cols
[2023-04-07 04:29:53] [INFO ] Computed 19 invariants in 6 ms
[2023-04-07 04:29:54] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-04-07 04:29:54] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-07 04:29:54] [INFO ] After 168ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-07 04:29:54] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-07 04:29:54] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-07 04:29:54] [INFO ] After 138ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-07 04:29:54] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-07 04:29:54] [INFO ] After 101ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-07 04:29:54] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 1 ms to minimize.
[2023-04-07 04:29:54] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 0 ms to minimize.
[2023-04-07 04:29:54] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 2 ms to minimize.
[2023-04-07 04:29:54] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
[2023-04-07 04:29:54] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2023-04-07 04:29:54] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 4 ms to minimize.
[2023-04-07 04:29:54] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 505 ms
[2023-04-07 04:29:55] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 3 ms to minimize.
[2023-04-07 04:29:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2023-04-07 04:29:55] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 0 ms to minimize.
[2023-04-07 04:29:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2023-04-07 04:29:55] [INFO ] After 844ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 61 ms.
[2023-04-07 04:29:55] [INFO ] After 1129ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 15 ms.
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 19 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 234/234 places, 966/966 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 29 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2023-04-07 04:29:55] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-07 04:29:55] [INFO ] Invariant cache hit.
[2023-04-07 04:29:55] [INFO ] Implicit Places using invariants in 296 ms returned []
[2023-04-07 04:29:55] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-07 04:29:55] [INFO ] Invariant cache hit.
[2023-04-07 04:29:55] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-07 04:29:56] [INFO ] Implicit Places using invariants and state equation in 593 ms returned []
Implicit Place search using SMT with State Equation took 892 ms to find 0 implicit places.
[2023-04-07 04:29:56] [INFO ] Redundant transitions in 14 ms returned []
[2023-04-07 04:29:56] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-07 04:29:56] [INFO ] Invariant cache hit.
[2023-04-07 04:29:56] [INFO ] Dead Transitions using invariants and state equation in 307 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1269 ms. Remains : 234/234 places, 966/966 transitions.
Graph (trivial) has 850 edges and 234 vertex of which 36 / 234 are part of one of the 6 SCC in 1 ms
Free SCC test removed 30 places
Drop transitions removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 204 transition count 237
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 91 place count 159 transition count 237
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 91 place count 159 transition count 224
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 123 place count 140 transition count 224
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 2 with 116 rules applied. Total rules applied 239 place count 82 transition count 166
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 265 place count 82 transition count 140
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 275 place count 77 transition count 140
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 280 place count 77 transition count 135
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 287 place count 77 transition count 128
Free-agglomeration rule applied 32 times.
Iterating global reduction 4 with 32 rules applied. Total rules applied 319 place count 77 transition count 96
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 4 with 32 rules applied. Total rules applied 351 place count 45 transition count 96
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 357 place count 45 transition count 96
Applied a total of 357 rules in 16 ms. Remains 45 /234 variables (removed 189) and now considering 96/966 (removed 870) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 96 rows 45 cols
[2023-04-07 04:29:56] [INFO ] Computed 13 invariants in 2 ms
[2023-04-07 04:29:56] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-04-07 04:29:56] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-07 04:29:56] [INFO ] [Nat]Absence check using 13 positive place invariants in 1 ms returned sat
[2023-04-07 04:29:56] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-07 04:29:56] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 04:29:56] [INFO ] After 19ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-07 04:29:56] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
[2023-04-07 04:29:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2023-04-07 04:29:56] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
[2023-04-07 04:29:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2023-04-07 04:29:56] [INFO ] After 99ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-04-07 04:29:56] [INFO ] After 192ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 158 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Applied a total of 0 rules in 8 ms. Remains 384 /384 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
[2023-04-07 04:29:57] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
// Phase 1: matrix 522 rows 384 cols
[2023-04-07 04:29:57] [INFO ] Computed 19 invariants in 10 ms
[2023-04-07 04:29:57] [INFO ] Implicit Places using invariants in 306 ms returned []
[2023-04-07 04:29:57] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-07 04:29:57] [INFO ] Invariant cache hit.
[2023-04-07 04:29:57] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-07 04:29:58] [INFO ] Implicit Places using invariants and state equation in 978 ms returned []
Implicit Place search using SMT with State Equation took 1295 ms to find 0 implicit places.
[2023-04-07 04:29:58] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-07 04:29:58] [INFO ] Invariant cache hit.
[2023-04-07 04:29:59] [INFO ] Dead Transitions using invariants and state equation in 700 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2006 ms. Remains : 384/384 places, 1116/1116 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 p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 151 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 4) 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 4) 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 4) 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 4) 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 4) seen :0
Interrupted probabilistic random walk after 246148 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :{}
Probabilistic random walk after 246148 steps, saw 151776 distinct states, run finished after 3001 ms. (steps per millisecond=82 ) properties seen :0
Running SMT prover for 4 properties.
[2023-04-07 04:30:02] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-07 04:30:02] [INFO ] Invariant cache hit.
[2023-04-07 04:30:02] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-04-07 04:30:02] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-07 04:30:03] [INFO ] After 326ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-07 04:30:03] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-04-07 04:30:03] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-07 04:30:03] [INFO ] After 244ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-07 04:30:03] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-07 04:30:03] [INFO ] After 161ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-07 04:30:04] [INFO ] Deduced a trap composed of 6 places in 216 ms of which 1 ms to minimize.
[2023-04-07 04:30:04] [INFO ] Deduced a trap composed of 3 places in 169 ms of which 1 ms to minimize.
[2023-04-07 04:30:04] [INFO ] Deduced a trap composed of 3 places in 174 ms of which 1 ms to minimize.
[2023-04-07 04:30:04] [INFO ] Deduced a trap composed of 3 places in 166 ms of which 0 ms to minimize.
[2023-04-07 04:30:04] [INFO ] Deduced a trap composed of 3 places in 168 ms of which 0 ms to minimize.
[2023-04-07 04:30:04] [INFO ] Deduced a trap composed of 47 places in 68 ms of which 1 ms to minimize.
[2023-04-07 04:30:05] [INFO ] Deduced a trap composed of 46 places in 110 ms of which 0 ms to minimize.
[2023-04-07 04:30:05] [INFO ] Deduced a trap composed of 35 places in 754 ms of which 1 ms to minimize.
[2023-04-07 04:30:06] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 0 ms to minimize.
[2023-04-07 04:30:06] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2322 ms
[2023-04-07 04:30:06] [INFO ] Deduced a trap composed of 44 places in 101 ms of which 0 ms to minimize.
[2023-04-07 04:30:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 182 ms
[2023-04-07 04:30:06] [INFO ] After 2798ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 138 ms.
[2023-04-07 04:30:06] [INFO ] After 3401ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 43 ms.
Support contains 4 out of 384 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 384 transition count 1110
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 378 transition count 1110
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 12 place count 378 transition count 996
Deduced a syphon composed of 114 places in 0 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 240 place count 264 transition count 996
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 300 place count 234 transition count 966
Applied a total of 300 rules in 65 ms. Remains 234 /384 variables (removed 150) and now considering 966/1116 (removed 150) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 234/384 places, 966/1116 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) 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 4) 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 4) seen :0
Interrupted probabilistic random walk after 251622 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :{}
Probabilistic random walk after 251622 steps, saw 76740 distinct states, run finished after 3001 ms. (steps per millisecond=83 ) properties seen :0
Running SMT prover for 4 properties.
[2023-04-07 04:30:09] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
// Phase 1: matrix 372 rows 234 cols
[2023-04-07 04:30:09] [INFO ] Computed 19 invariants in 1 ms
[2023-04-07 04:30:10] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-04-07 04:30:10] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-07 04:30:10] [INFO ] After 341ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-07 04:30:10] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-07 04:30:10] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-07 04:30:10] [INFO ] After 140ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-07 04:30:10] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-07 04:30:10] [INFO ] After 184ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-07 04:30:10] [INFO ] Deduced a trap composed of 9 places in 185 ms of which 1 ms to minimize.
[2023-04-07 04:30:11] [INFO ] Deduced a trap composed of 18 places in 130 ms of which 1 ms to minimize.
[2023-04-07 04:30:11] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 0 ms to minimize.
[2023-04-07 04:30:11] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 0 ms to minimize.
[2023-04-07 04:30:11] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2023-04-07 04:30:11] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 0 ms to minimize.
[2023-04-07 04:30:11] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 723 ms
[2023-04-07 04:30:11] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 0 ms to minimize.
[2023-04-07 04:30:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2023-04-07 04:30:11] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 0 ms to minimize.
[2023-04-07 04:30:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2023-04-07 04:30:11] [INFO ] After 1213ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 97 ms.
[2023-04-07 04:30:11] [INFO ] After 1547ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 15 ms.
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 19 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 234/234 places, 966/966 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 18 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2023-04-07 04:30:11] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-07 04:30:11] [INFO ] Invariant cache hit.
[2023-04-07 04:30:12] [INFO ] Implicit Places using invariants in 386 ms returned []
[2023-04-07 04:30:12] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-07 04:30:12] [INFO ] Invariant cache hit.
[2023-04-07 04:30:12] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-07 04:30:12] [INFO ] Implicit Places using invariants and state equation in 591 ms returned []
Implicit Place search using SMT with State Equation took 988 ms to find 0 implicit places.
[2023-04-07 04:30:12] [INFO ] Redundant transitions in 12 ms returned []
[2023-04-07 04:30:12] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-07 04:30:12] [INFO ] Invariant cache hit.
[2023-04-07 04:30:13] [INFO ] Dead Transitions using invariants and state equation in 495 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1542 ms. Remains : 234/234 places, 966/966 transitions.
Graph (trivial) has 850 edges and 234 vertex of which 36 / 234 are part of one of the 6 SCC in 1 ms
Free SCC test removed 30 places
Drop transitions removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 204 transition count 237
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 91 place count 159 transition count 237
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 91 place count 159 transition count 224
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 123 place count 140 transition count 224
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 2 with 116 rules applied. Total rules applied 239 place count 82 transition count 166
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 265 place count 82 transition count 140
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 275 place count 77 transition count 140
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 280 place count 77 transition count 135
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 287 place count 77 transition count 128
Free-agglomeration rule applied 32 times.
Iterating global reduction 4 with 32 rules applied. Total rules applied 319 place count 77 transition count 96
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 4 with 32 rules applied. Total rules applied 351 place count 45 transition count 96
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 357 place count 45 transition count 96
Applied a total of 357 rules in 33 ms. Remains 45 /234 variables (removed 189) and now considering 96/966 (removed 870) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 96 rows 45 cols
[2023-04-07 04:30:13] [INFO ] Computed 13 invariants in 0 ms
[2023-04-07 04:30:13] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-04-07 04:30:13] [INFO ] After 397ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-07 04:30:13] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-04-07 04:30:13] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-07 04:30:13] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 04:30:13] [INFO ] After 22ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-07 04:30:14] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 0 ms to minimize.
[2023-04-07 04:30:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2023-04-07 04:30:14] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 0 ms to minimize.
[2023-04-07 04:30:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2023-04-07 04:30:14] [INFO ] After 156ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 118 ms.
[2023-04-07 04:30:14] [INFO ] After 407ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 147 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 213 ms.
Product exploration explored 100000 steps with 0 reset in 240 ms.
Support contains 4 out of 384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Applied a total of 0 rules in 7 ms. Remains 384 /384 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
[2023-04-07 04:30:15] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
// Phase 1: matrix 522 rows 384 cols
[2023-04-07 04:30:15] [INFO ] Computed 19 invariants in 2 ms
[2023-04-07 04:30:15] [INFO ] Implicit Places using invariants in 335 ms returned []
[2023-04-07 04:30:15] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-07 04:30:15] [INFO ] Invariant cache hit.
[2023-04-07 04:30:16] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-07 04:30:17] [INFO ] Implicit Places using invariants and state equation in 1500 ms returned []
Implicit Place search using SMT with State Equation took 1868 ms to find 0 implicit places.
[2023-04-07 04:30:17] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-07 04:30:17] [INFO ] Invariant cache hit.
[2023-04-07 04:30:18] [INFO ] Dead Transitions using invariants and state equation in 741 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2624 ms. Remains : 384/384 places, 1116/1116 transitions.
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-01 finished in 37474 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p1)&&F(p2)&&p0))))'
Support contains 7 out of 387 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 387/387 places, 1134/1134 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 384 transition count 1116
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 384 transition count 1116
Applied a total of 6 rules in 9 ms. Remains 384 /387 variables (removed 3) and now considering 1116/1134 (removed 18) transitions.
[2023-04-07 04:30:18] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-07 04:30:18] [INFO ] Invariant cache hit.
[2023-04-07 04:30:18] [INFO ] Implicit Places using invariants in 395 ms returned []
[2023-04-07 04:30:18] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-07 04:30:18] [INFO ] Invariant cache hit.
[2023-04-07 04:30:19] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-07 04:30:20] [INFO ] Implicit Places using invariants and state equation in 1831 ms returned []
Implicit Place search using SMT with State Equation took 2232 ms to find 0 implicit places.
[2023-04-07 04:30:20] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-07 04:30:20] [INFO ] Invariant cache hit.
[2023-04-07 04:30:21] [INFO ] Dead Transitions using invariants and state equation in 740 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 384/387 places, 1116/1134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2983 ms. Remains : 384/387 places, 1116/1134 transitions.
Stuttering acceptance computed with spot in 322 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s3 1) (EQ s357 1)), p1:(AND (EQ s0 1) (EQ s340 1)), p2:(AND (EQ s4 1) (EQ s18 1) (EQ s282 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-02 finished in 3344 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 387 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 387/387 places, 1134/1134 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 387 transition count 1128
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 381 transition count 1128
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 113 Pre rules applied. Total rules applied 12 place count 381 transition count 1015
Deduced a syphon composed of 113 places in 1 ms
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 226 rules applied. Total rules applied 238 place count 268 transition count 1015
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 241 place count 265 transition count 997
Iterating global reduction 2 with 3 rules applied. Total rules applied 244 place count 265 transition count 997
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 304 place count 235 transition count 967
Applied a total of 304 rules in 118 ms. Remains 235 /387 variables (removed 152) and now considering 967/1134 (removed 167) transitions.
[2023-04-07 04:30:21] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
// Phase 1: matrix 373 rows 235 cols
[2023-04-07 04:30:21] [INFO ] Computed 19 invariants in 1 ms
[2023-04-07 04:30:22] [INFO ] Implicit Places using invariants in 332 ms returned []
[2023-04-07 04:30:22] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2023-04-07 04:30:22] [INFO ] Invariant cache hit.
[2023-04-07 04:30:22] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-07 04:30:22] [INFO ] Implicit Places using invariants and state equation in 694 ms returned []
Implicit Place search using SMT with State Equation took 1050 ms to find 0 implicit places.
[2023-04-07 04:30:23] [INFO ] Redundant transitions in 9 ms returned []
[2023-04-07 04:30:23] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2023-04-07 04:30:23] [INFO ] Invariant cache hit.
[2023-04-07 04:30:23] [INFO ] Dead Transitions using invariants and state equation in 472 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 235/387 places, 967/1134 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1684 ms. Remains : 235/387 places, 967/1134 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s13 0) (EQ s72 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 177 ms.
Stack based approach found an accepted trace after 238 steps with 0 reset with depth 239 and stack size 203 in 1 ms.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-03 finished in 1998 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 4 out of 387 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 387/387 places, 1134/1134 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 387 transition count 1128
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 381 transition count 1128
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 12 place count 381 transition count 1014
Deduced a syphon composed of 114 places in 17 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 240 place count 267 transition count 1014
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 242 place count 265 transition count 1002
Iterating global reduction 2 with 2 rules applied. Total rules applied 244 place count 265 transition count 1002
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 304 place count 235 transition count 972
Applied a total of 304 rules in 77 ms. Remains 235 /387 variables (removed 152) and now considering 972/1134 (removed 162) transitions.
[2023-04-07 04:30:23] [INFO ] Flow matrix only has 378 transitions (discarded 594 similar events)
// Phase 1: matrix 378 rows 235 cols
[2023-04-07 04:30:23] [INFO ] Computed 19 invariants in 4 ms
[2023-04-07 04:30:24] [INFO ] Implicit Places using invariants in 311 ms returned []
[2023-04-07 04:30:24] [INFO ] Flow matrix only has 378 transitions (discarded 594 similar events)
[2023-04-07 04:30:24] [INFO ] Invariant cache hit.
[2023-04-07 04:30:24] [INFO ] State equation strengthened by 169 read => feed constraints.
[2023-04-07 04:30:25] [INFO ] Implicit Places using invariants and state equation in 947 ms returned []
Implicit Place search using SMT with State Equation took 1266 ms to find 0 implicit places.
[2023-04-07 04:30:25] [INFO ] Redundant transitions in 8 ms returned []
[2023-04-07 04:30:25] [INFO ] Flow matrix only has 378 transitions (discarded 594 similar events)
[2023-04-07 04:30:25] [INFO ] Invariant cache hit.
[2023-04-07 04:30:25] [INFO ] Dead Transitions using invariants and state equation in 600 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 235/387 places, 972/1134 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1960 ms. Remains : 235/387 places, 972/1134 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (EQ s6 1) (EQ s186 1)), p1:(AND (EQ s2 1) (EQ s72 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 195 ms.
Stack based approach found an accepted trace after 17 steps with 0 reset with depth 18 and stack size 18 in 0 ms.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-04 finished in 2296 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' '!(((!p0 U ((p2 U p3)&&p1))||G(p4)))'
Support contains 10 out of 387 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 387/387 places, 1134/1134 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 387 transition count 1129
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 382 transition count 1129
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 111 Pre rules applied. Total rules applied 10 place count 382 transition count 1018
Deduced a syphon composed of 111 places in 1 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 232 place count 271 transition count 1018
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 234 place count 269 transition count 1006
Iterating global reduction 2 with 2 rules applied. Total rules applied 236 place count 269 transition count 1006
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 294 place count 240 transition count 977
Applied a total of 294 rules in 56 ms. Remains 240 /387 variables (removed 147) and now considering 977/1134 (removed 157) transitions.
[2023-04-07 04:30:26] [INFO ] Flow matrix only has 383 transitions (discarded 594 similar events)
// Phase 1: matrix 383 rows 240 cols
[2023-04-07 04:30:26] [INFO ] Computed 19 invariants in 1 ms
[2023-04-07 04:30:26] [INFO ] Implicit Places using invariants in 351 ms returned []
[2023-04-07 04:30:26] [INFO ] Flow matrix only has 383 transitions (discarded 594 similar events)
[2023-04-07 04:30:26] [INFO ] Invariant cache hit.
[2023-04-07 04:30:26] [INFO ] State equation strengthened by 169 read => feed constraints.
[2023-04-07 04:30:27] [INFO ] Implicit Places using invariants and state equation in 645 ms returned []
Implicit Place search using SMT with State Equation took 1016 ms to find 0 implicit places.
[2023-04-07 04:30:27] [INFO ] Redundant transitions in 12 ms returned []
[2023-04-07 04:30:27] [INFO ] Flow matrix only has 383 transitions (discarded 594 similar events)
[2023-04-07 04:30:27] [INFO ] Invariant cache hit.
[2023-04-07 04:30:27] [INFO ] Dead Transitions using invariants and state equation in 594 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 240/387 places, 977/1134 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1691 ms. Remains : 240/387 places, 977/1134 transitions.
Stuttering acceptance computed with spot in 619 ms :[true, (OR (NOT p1) (NOT p3)), (NOT p4), (AND (NOT p3) (NOT p4)), (OR (AND (NOT p1) (NOT p4)) (AND (NOT p3) (NOT p4))), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3)]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (AND (NOT p1) p0) (AND (NOT p3) (NOT p2) p0)), acceptance={0} source=1 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p0))), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p3) p2 p0), acceptance={0} source=1 dest: 6}, { cond=(AND p1 (NOT p3) p2 (NOT p0)), acceptance={0} source=1 dest: 7}], [{ cond=(NOT p4), acceptance={} source=2 dest: 0}, { cond=p4, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2) p0 (NOT p4)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p4)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p3) (NOT p2) p0 p4), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p3) p2 (NOT p0) p4), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) p4), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p3) p2 p0 p4), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p3) p2 p0 (NOT p4)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p3) p2 (NOT p0) (NOT p4)), acceptance={} source=3 dest: 7}], [{ cond=(OR (AND (NOT p1) p0 (NOT p4)) (AND (NOT p3) (NOT p2) p0 (NOT p4))), acceptance={} source=4 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0) (NOT p4)) (AND (NOT p3) (NOT p2) (NOT p0) (NOT p4))), acceptance={} source=4 dest: 1}, { cond=(OR (AND (NOT p1) p0 p4) (AND (NOT p3) (NOT p2) p0 p4)), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p3) p2 (NOT p0) p4), acceptance={} source=4 dest: 3}, { cond=(OR (AND (NOT p1) (NOT p0) p4) (AND (NOT p3) (NOT p2) (NOT p0) p4)), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p3) p2 p0 p4), acceptance={} source=4 dest: 5}, { cond=(AND p1 (NOT p3) p2 p0 (NOT p4)), acceptance={} source=4 dest: 6}, { cond=(AND p1 (NOT p3) p2 (NOT p0) (NOT p4)), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p4)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p3) (NOT p2) p4), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p3) p2 p4), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p3) p2 (NOT p4)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=6 dest: 0}, { cond=(AND (NOT p3) p2), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2) p0), acceptance={0} source=7 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={0} source=7 dest: 1}, { cond=(AND (NOT p3) p2 p0), acceptance={0} source=7 dest: 6}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={0} source=7 dest: 7}]], initial=4, aps=[p1:(AND (NOT (AND (EQ s5 1) (EQ s22 1) (EQ s174 1))) (EQ s9 1) (EQ s73 1)), p0:(AND (EQ s20 1) (EQ s112 1)), p3:(AND (EQ s9 1) (EQ s73 1)), p2:(AND (EQ s0...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 308 steps with 0 reset in 1 ms.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-05 finished in 2348 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 387 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 387/387 places, 1134/1134 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 384 transition count 1116
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 384 transition count 1116
Applied a total of 6 rules in 8 ms. Remains 384 /387 variables (removed 3) and now considering 1116/1134 (removed 18) transitions.
[2023-04-07 04:30:28] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
// Phase 1: matrix 522 rows 384 cols
[2023-04-07 04:30:28] [INFO ] Computed 19 invariants in 2 ms
[2023-04-07 04:30:29] [INFO ] Implicit Places using invariants in 1185 ms returned []
[2023-04-07 04:30:29] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-07 04:30:29] [INFO ] Invariant cache hit.
[2023-04-07 04:30:29] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-07 04:30:31] [INFO ] Implicit Places using invariants and state equation in 2008 ms returned []
Implicit Place search using SMT with State Equation took 3213 ms to find 0 implicit places.
[2023-04-07 04:30:31] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-07 04:30:31] [INFO ] Invariant cache hit.
[2023-04-07 04:30:32] [INFO ] Dead Transitions using invariants and state equation in 409 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 384/387 places, 1116/1134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3654 ms. Remains : 384/387 places, 1116/1134 transitions.
Stuttering acceptance computed with spot in 175 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(NEQ s38 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 273 steps with 0 reset in 1 ms.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-07 finished in 3884 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((F(G(p0)) U p1))))))'
Support contains 5 out of 387 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 387/387 places, 1134/1134 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 385 transition count 1122
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 385 transition count 1122
Applied a total of 4 rules in 10 ms. Remains 385 /387 variables (removed 2) and now considering 1122/1134 (removed 12) transitions.
[2023-04-07 04:30:32] [INFO ] Flow matrix only has 528 transitions (discarded 594 similar events)
// Phase 1: matrix 528 rows 385 cols
[2023-04-07 04:30:32] [INFO ] Computed 19 invariants in 12 ms
[2023-04-07 04:30:32] [INFO ] Implicit Places using invariants in 285 ms returned []
[2023-04-07 04:30:32] [INFO ] Flow matrix only has 528 transitions (discarded 594 similar events)
[2023-04-07 04:30:32] [INFO ] Invariant cache hit.
[2023-04-07 04:30:32] [INFO ] State equation strengthened by 169 read => feed constraints.
[2023-04-07 04:30:33] [INFO ] Implicit Places using invariants and state equation in 932 ms returned []
Implicit Place search using SMT with State Equation took 1252 ms to find 0 implicit places.
[2023-04-07 04:30:33] [INFO ] Flow matrix only has 528 transitions (discarded 594 similar events)
[2023-04-07 04:30:33] [INFO ] Invariant cache hit.
[2023-04-07 04:30:33] [INFO ] Dead Transitions using invariants and state equation in 375 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 385/387 places, 1122/1134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1651 ms. Remains : 385/387 places, 1122/1134 transitions.
Stuttering acceptance computed with spot in 463 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-08 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=true, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s2 1) (EQ s14 1) (EQ s260 1)), p0:(AND (EQ s1 1) (EQ s102 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 207 ms.
Stack based approach found an accepted trace after 23 steps with 0 reset with depth 24 and stack size 24 in 0 ms.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-08 finished in 2356 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||G(p1)))))'
Support contains 4 out of 387 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 387/387 places, 1134/1134 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 384 transition count 1116
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 384 transition count 1116
Applied a total of 6 rules in 10 ms. Remains 384 /387 variables (removed 3) and now considering 1116/1134 (removed 18) transitions.
[2023-04-07 04:30:34] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
// Phase 1: matrix 522 rows 384 cols
[2023-04-07 04:30:34] [INFO ] Computed 19 invariants in 2 ms
[2023-04-07 04:30:34] [INFO ] Implicit Places using invariants in 288 ms returned []
[2023-04-07 04:30:34] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-07 04:30:34] [INFO ] Invariant cache hit.
[2023-04-07 04:30:35] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-07 04:30:36] [INFO ] Implicit Places using invariants and state equation in 1078 ms returned []
Implicit Place search using SMT with State Equation took 1390 ms to find 0 implicit places.
[2023-04-07 04:30:36] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-07 04:30:36] [INFO ] Invariant cache hit.
[2023-04-07 04:30:36] [INFO ] Dead Transitions using invariants and state equation in 769 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 384/387 places, 1116/1134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2195 ms. Remains : 384/387 places, 1116/1134 transitions.
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(OR (EQ s9 0) (EQ s203 0)), p0:(AND (EQ s23 1) (EQ s305 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 234 ms.
Product exploration explored 100000 steps with 0 reset in 272 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 234 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 300 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 4) 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 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) 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 2) seen :0
Running SMT prover for 2 properties.
[2023-04-07 04:30:38] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-07 04:30:38] [INFO ] Invariant cache hit.
[2023-04-07 04:30:38] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 04:30:38] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-04-07 04:30:38] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 5 ms returned sat
[2023-04-07 04:30:38] [INFO ] After 145ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 04:30:38] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-07 04:30:38] [INFO ] After 64ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 04:30:38] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 1 ms to minimize.
[2023-04-07 04:30:38] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 0 ms to minimize.
[2023-04-07 04:30:39] [INFO ] Deduced a trap composed of 3 places in 116 ms of which 1 ms to minimize.
[2023-04-07 04:30:39] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 0 ms to minimize.
[2023-04-07 04:30:39] [INFO ] Deduced a trap composed of 3 places in 103 ms of which 0 ms to minimize.
[2023-04-07 04:30:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 674 ms
[2023-04-07 04:30:39] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 1 ms to minimize.
[2023-04-07 04:30:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2023-04-07 04:30:39] [INFO ] After 909ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2023-04-07 04:30:39] [INFO ] After 1215ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 384 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 384 transition count 1110
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 378 transition count 1110
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 112 Pre rules applied. Total rules applied 12 place count 378 transition count 998
Deduced a syphon composed of 112 places in 1 ms
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 224 rules applied. Total rules applied 236 place count 266 transition count 998
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 296 place count 236 transition count 968
Applied a total of 296 rules in 48 ms. Remains 236 /384 variables (removed 148) and now considering 968/1116 (removed 148) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 236/384 places, 968/1116 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 744436 steps, run timeout after 3001 ms. (steps per millisecond=248 ) properties seen :{}
Probabilistic random walk after 744436 steps, saw 176541 distinct states, run finished after 3001 ms. (steps per millisecond=248 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 04:30:42] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
// Phase 1: matrix 374 rows 236 cols
[2023-04-07 04:30:42] [INFO ] Computed 19 invariants in 11 ms
[2023-04-07 04:30:42] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 04:30:42] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-04-07 04:30:42] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-07 04:30:43] [INFO ] After 141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 04:30:43] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-07 04:30:43] [INFO ] After 62ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 04:30:43] [INFO ] Deduced a trap composed of 3 places in 103 ms of which 1 ms to minimize.
[2023-04-07 04:30:43] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 1 ms to minimize.
[2023-04-07 04:30:43] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 0 ms to minimize.
[2023-04-07 04:30:43] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 0 ms to minimize.
[2023-04-07 04:30:43] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-04-07 04:30:43] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 572 ms
[2023-04-07 04:30:43] [INFO ] After 646ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-04-07 04:30:43] [INFO ] After 922ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 18 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 236/236 places, 968/968 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 17 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2023-04-07 04:30:43] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-07 04:30:43] [INFO ] Invariant cache hit.
[2023-04-07 04:30:44] [INFO ] Implicit Places using invariants in 391 ms returned []
[2023-04-07 04:30:44] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-07 04:30:44] [INFO ] Invariant cache hit.
[2023-04-07 04:30:44] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-07 04:30:44] [INFO ] Implicit Places using invariants and state equation in 828 ms returned []
Implicit Place search using SMT with State Equation took 1251 ms to find 0 implicit places.
[2023-04-07 04:30:45] [INFO ] Redundant transitions in 8 ms returned []
[2023-04-07 04:30:45] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-07 04:30:45] [INFO ] Invariant cache hit.
[2023-04-07 04:30:45] [INFO ] Dead Transitions using invariants and state equation in 400 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1697 ms. Remains : 236/236 places, 968/968 transitions.
Graph (trivial) has 876 edges and 236 vertex of which 36 / 236 are part of one of the 6 SCC in 1 ms
Free SCC test removed 30 places
Drop transitions removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 206 transition count 239
Reduce places removed 45 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 47 rules applied. Total rules applied 93 place count 161 transition count 237
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 95 place count 159 transition count 237
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 95 place count 159 transition count 224
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 127 place count 140 transition count 224
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 243 place count 82 transition count 166
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 3 with 29 rules applied. Total rules applied 272 place count 82 transition count 137
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -19
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 284 place count 76 transition count 156
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 289 place count 76 transition count 151
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 294 place count 76 transition count 146
Free-agglomeration rule applied 25 times.
Iterating global reduction 5 with 25 rules applied. Total rules applied 319 place count 76 transition count 121
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 5 with 25 rules applied. Total rules applied 344 place count 51 transition count 121
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 354 place count 51 transition count 121
Applied a total of 354 rules in 15 ms. Remains 51 /236 variables (removed 185) and now considering 121/968 (removed 847) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 121 rows 51 cols
[2023-04-07 04:30:45] [INFO ] Computed 13 invariants in 0 ms
[2023-04-07 04:30:45] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 04:30:45] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-04-07 04:30:45] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 04:30:45] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 04:30:45] [INFO ] After 5ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 04:30:45] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2023-04-07 04:30:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2023-04-07 04:30:45] [INFO ] After 62ms 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:30:45] [INFO ] After 136ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 221 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 179 ms :[(NOT p1), (NOT p1), false]
Stuttering acceptance computed with spot in 196 ms :[(NOT p1), (NOT p1), false]
Support contains 4 out of 384 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 384 transition count 1110
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 378 transition count 1110
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 112 Pre rules applied. Total rules applied 12 place count 378 transition count 998
Deduced a syphon composed of 112 places in 1 ms
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 224 rules applied. Total rules applied 236 place count 266 transition count 998
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 296 place count 236 transition count 968
Applied a total of 296 rules in 50 ms. Remains 236 /384 variables (removed 148) and now considering 968/1116 (removed 148) transitions.
[2023-04-07 04:30:46] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
// Phase 1: matrix 374 rows 236 cols
[2023-04-07 04:30:46] [INFO ] Computed 19 invariants in 3 ms
[2023-04-07 04:30:46] [INFO ] Implicit Places using invariants in 294 ms returned []
[2023-04-07 04:30:46] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-07 04:30:46] [INFO ] Invariant cache hit.
[2023-04-07 04:30:46] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-07 04:30:47] [INFO ] Implicit Places using invariants and state equation in 1055 ms returned []
Implicit Place search using SMT with State Equation took 1353 ms to find 0 implicit places.
[2023-04-07 04:30:47] [INFO ] Redundant transitions in 9 ms returned []
[2023-04-07 04:30:47] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-07 04:30:47] [INFO ] Invariant cache hit.
[2023-04-07 04:30:48] [INFO ] Dead Transitions using invariants and state equation in 430 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 236/384 places, 968/1116 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1871 ms. Remains : 236/384 places, 968/1116 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 p0) p1), (X p1), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (X p1)), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 136 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (NOT p1), false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) 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 :2
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
Running SMT prover for 1 properties.
[2023-04-07 04:30:48] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-07 04:30:48] [INFO ] Invariant cache hit.
[2023-04-07 04:30:48] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 04:30:48] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-04-07 04:30:48] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-07 04:30:48] [INFO ] After 83ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 04:30:48] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-07 04:30:48] [INFO ] After 34ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 04:30:48] [INFO ] Deduced a trap composed of 3 places in 117 ms of which 1 ms to minimize.
[2023-04-07 04:30:49] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2023-04-07 04:30:49] [INFO ] Deduced a trap composed of 3 places in 545 ms of which 1 ms to minimize.
[2023-04-07 04:30:49] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 0 ms to minimize.
[2023-04-07 04:30:49] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 0 ms to minimize.
[2023-04-07 04:30:49] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2023-04-07 04:30:49] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1086 ms
[2023-04-07 04:30:49] [INFO ] After 1140ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-04-07 04:30:49] [INFO ] After 1310ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 21 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 236/236 places, 968/968 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 844718 steps, run timeout after 3001 ms. (steps per millisecond=281 ) properties seen :{}
Probabilistic random walk after 844718 steps, saw 199364 distinct states, run finished after 3001 ms. (steps per millisecond=281 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 04:30:53] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-07 04:30:53] [INFO ] Invariant cache hit.
[2023-04-07 04:30:53] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 04:30:53] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-07 04:30:53] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-07 04:30:53] [INFO ] After 136ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 04:30:53] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-07 04:30:53] [INFO ] After 75ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 04:30:53] [INFO ] Deduced a trap composed of 3 places in 157 ms of which 1 ms to minimize.
[2023-04-07 04:30:53] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 0 ms to minimize.
[2023-04-07 04:30:53] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 0 ms to minimize.
[2023-04-07 04:30:54] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 0 ms to minimize.
[2023-04-07 04:30:54] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 0 ms to minimize.
[2023-04-07 04:30:54] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 0 ms to minimize.
[2023-04-07 04:30:54] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 788 ms
[2023-04-07 04:30:54] [INFO ] After 887ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-04-07 04:30:54] [INFO ] After 1201ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 38 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 236/236 places, 968/968 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 29 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2023-04-07 04:30:54] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-07 04:30:54] [INFO ] Invariant cache hit.
[2023-04-07 04:30:55] [INFO ] Implicit Places using invariants in 1003 ms returned []
[2023-04-07 04:30:55] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-07 04:30:55] [INFO ] Invariant cache hit.
[2023-04-07 04:30:55] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-07 04:30:56] [INFO ] Implicit Places using invariants and state equation in 1011 ms returned []
Implicit Place search using SMT with State Equation took 2033 ms to find 0 implicit places.
[2023-04-07 04:30:56] [INFO ] Redundant transitions in 14 ms returned []
[2023-04-07 04:30:56] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-07 04:30:56] [INFO ] Invariant cache hit.
[2023-04-07 04:30:57] [INFO ] Dead Transitions using invariants and state equation in 814 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2927 ms. Remains : 236/236 places, 968/968 transitions.
Graph (trivial) has 876 edges and 236 vertex of which 36 / 236 are part of one of the 6 SCC in 1 ms
Free SCC test removed 30 places
Drop transitions removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 206 transition count 239
Reduce places removed 45 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 47 rules applied. Total rules applied 93 place count 161 transition count 237
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 95 place count 159 transition count 237
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 95 place count 159 transition count 224
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 127 place count 140 transition count 224
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 243 place count 82 transition count 166
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 3 with 29 rules applied. Total rules applied 272 place count 82 transition count 137
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -19
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 284 place count 76 transition count 156
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 289 place count 76 transition count 151
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 294 place count 76 transition count 146
Free-agglomeration rule applied 25 times.
Iterating global reduction 5 with 25 rules applied. Total rules applied 319 place count 76 transition count 121
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 5 with 25 rules applied. Total rules applied 344 place count 51 transition count 121
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 354 place count 51 transition count 121
Applied a total of 354 rules in 23 ms. Remains 51 /236 variables (removed 185) and now considering 121/968 (removed 847) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 121 rows 51 cols
[2023-04-07 04:30:57] [INFO ] Computed 13 invariants in 1 ms
[2023-04-07 04:30:57] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 04:30:57] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-04-07 04:30:57] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 04:30:57] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 04:30:57] [INFO ] After 4ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 04:30:57] [INFO ] Deduced a trap composed of 2 places in 58 ms of which 1 ms to minimize.
[2023-04-07 04:30:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2023-04-07 04:30:57] [INFO ] After 80ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-04-07 04:30:57] [INFO ] After 218ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (X p1)), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 253 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 263 ms :[(NOT p1), (NOT p1), false]
Stuttering acceptance computed with spot in 221 ms :[(NOT p1), (NOT p1), false]
Stuttering acceptance computed with spot in 269 ms :[(NOT p1), (NOT p1), false]
Product exploration explored 100000 steps with 0 reset in 198 ms.
Product exploration explored 100000 steps with 0 reset in 204 ms.
Support contains 4 out of 236 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 17 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2023-04-07 04:30:59] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
// Phase 1: matrix 374 rows 236 cols
[2023-04-07 04:30:59] [INFO ] Computed 19 invariants in 2 ms
[2023-04-07 04:30:59] [INFO ] Implicit Places using invariants in 256 ms returned []
[2023-04-07 04:30:59] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-07 04:30:59] [INFO ] Invariant cache hit.
[2023-04-07 04:30:59] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-07 04:31:00] [INFO ] Implicit Places using invariants and state equation in 622 ms returned []
Implicit Place search using SMT with State Equation took 902 ms to find 0 implicit places.
[2023-04-07 04:31:00] [INFO ] Redundant transitions in 10 ms returned []
[2023-04-07 04:31:00] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-07 04:31:00] [INFO ] Invariant cache hit.
[2023-04-07 04:31:00] [INFO ] Dead Transitions using invariants and state equation in 650 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1612 ms. Remains : 236/236 places, 968/968 transitions.
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-12 finished in 26165 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)))))'
Support contains 3 out of 387 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 387/387 places, 1134/1134 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 384 transition count 1116
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 384 transition count 1116
Applied a total of 6 rules in 8 ms. Remains 384 /387 variables (removed 3) and now considering 1116/1134 (removed 18) transitions.
[2023-04-07 04:31:00] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
// Phase 1: matrix 522 rows 384 cols
[2023-04-07 04:31:00] [INFO ] Computed 19 invariants in 2 ms
[2023-04-07 04:31:01] [INFO ] Implicit Places using invariants in 363 ms returned []
[2023-04-07 04:31:01] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-07 04:31:01] [INFO ] Invariant cache hit.
[2023-04-07 04:31:01] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-07 04:31:02] [INFO ] Implicit Places using invariants and state equation in 1461 ms returned []
Implicit Place search using SMT with State Equation took 1855 ms to find 0 implicit places.
[2023-04-07 04:31:02] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-07 04:31:02] [INFO ] Invariant cache hit.
[2023-04-07 04:31:03] [INFO ] Dead Transitions using invariants and state equation in 677 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 384/387 places, 1116/1134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2541 ms. Remains : 384/387 places, 1116/1134 transitions.
Stuttering acceptance computed with spot in 275 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(OR (EQ s2 0) (EQ s14 0) (EQ s256 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 403 ms.
Product exploration explored 100000 steps with 25000 reset in 362 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, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 103 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) 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 726929 steps, run timeout after 3001 ms. (steps per millisecond=242 ) properties seen :{}
Probabilistic random walk after 726929 steps, saw 356505 distinct states, run finished after 3001 ms. (steps per millisecond=242 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 04:31:07] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-07 04:31:07] [INFO ] Invariant cache hit.
[2023-04-07 04:31:07] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 04:31:08] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-04-07 04:31:08] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-07 04:31:08] [INFO ] After 155ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 04:31:08] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-07 04:31:08] [INFO ] After 54ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 04:31:08] [INFO ] Deduced a trap composed of 20 places in 185 ms of which 0 ms to minimize.
[2023-04-07 04:31:08] [INFO ] Deduced a trap composed of 3 places in 149 ms of which 1 ms to minimize.
[2023-04-07 04:31:08] [INFO ] Deduced a trap composed of 3 places in 166 ms of which 0 ms to minimize.
[2023-04-07 04:31:09] [INFO ] Deduced a trap composed of 3 places in 157 ms of which 1 ms to minimize.
[2023-04-07 04:31:09] [INFO ] Deduced a trap composed of 61 places in 147 ms of which 1 ms to minimize.
[2023-04-07 04:31:09] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 1 ms to minimize.
[2023-04-07 04:31:09] [INFO ] Deduced a trap composed of 29 places in 160 ms of which 0 ms to minimize.
[2023-04-07 04:31:09] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 1 ms to minimize.
[2023-04-07 04:31:09] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 0 ms to minimize.
[2023-04-07 04:31:10] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 0 ms to minimize.
[2023-04-07 04:31:10] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1822 ms
[2023-04-07 04:31:10] [INFO ] After 1896ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 54 ms.
[2023-04-07 04:31:10] [INFO ] After 2244ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 384 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 384 transition count 1110
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 378 transition count 1110
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 12 place count 378 transition count 996
Deduced a syphon composed of 114 places in 1 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 240 place count 264 transition count 996
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 300 place count 234 transition count 966
Applied a total of 300 rules in 35 ms. Remains 234 /384 variables (removed 150) and now considering 966/1116 (removed 150) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 234/384 places, 966/1116 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 851998 steps, run timeout after 3001 ms. (steps per millisecond=283 ) properties seen :{}
Probabilistic random walk after 851998 steps, saw 205180 distinct states, run finished after 3001 ms. (steps per millisecond=283 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 04:31:13] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
// Phase 1: matrix 372 rows 234 cols
[2023-04-07 04:31:13] [INFO ] Computed 19 invariants in 4 ms
[2023-04-07 04:31:13] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 04:31:13] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-04-07 04:31:13] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-07 04:31:13] [INFO ] After 93ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 04:31:13] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-07 04:31:13] [INFO ] After 37ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 04:31:13] [INFO ] Deduced a trap composed of 3 places in 146 ms of which 0 ms to minimize.
[2023-04-07 04:31:13] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 0 ms to minimize.
[2023-04-07 04:31:14] [INFO ] Deduced a trap composed of 3 places in 113 ms of which 1 ms to minimize.
[2023-04-07 04:31:14] [INFO ] Deduced a trap composed of 3 places in 114 ms of which 0 ms to minimize.
[2023-04-07 04:31:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 583 ms
[2023-04-07 04:31:14] [INFO ] After 633ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 74 ms.
[2023-04-07 04:31:14] [INFO ] After 902ms 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 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 40 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 234/234 places, 966/966 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 17 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2023-04-07 04:31:14] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-07 04:31:14] [INFO ] Invariant cache hit.
[2023-04-07 04:31:14] [INFO ] Implicit Places using invariants in 369 ms returned []
[2023-04-07 04:31:14] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-07 04:31:14] [INFO ] Invariant cache hit.
[2023-04-07 04:31:15] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-07 04:31:15] [INFO ] Implicit Places using invariants and state equation in 1207 ms returned []
Implicit Place search using SMT with State Equation took 1578 ms to find 0 implicit places.
[2023-04-07 04:31:15] [INFO ] Redundant transitions in 9 ms returned []
[2023-04-07 04:31:15] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-07 04:31:15] [INFO ] Invariant cache hit.
[2023-04-07 04:31:16] [INFO ] Dead Transitions using invariants and state equation in 339 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1969 ms. Remains : 234/234 places, 966/966 transitions.
Graph (trivial) has 866 edges and 234 vertex of which 36 / 234 are part of one of the 6 SCC in 0 ms
Free SCC test removed 30 places
Drop transitions removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 204 transition count 236
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 93 place count 158 transition count 236
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 93 place count 158 transition count 223
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 125 place count 139 transition count 223
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 243 place count 80 transition count 164
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 271 place count 80 transition count 136
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 281 place count 75 transition count 136
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 286 place count 75 transition count 131
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 292 place count 75 transition count 125
Free-agglomeration rule applied 31 times.
Iterating global reduction 4 with 31 rules applied. Total rules applied 323 place count 75 transition count 94
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 4 with 31 rules applied. Total rules applied 354 place count 44 transition count 94
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 360 place count 44 transition count 94
Applied a total of 360 rules in 35 ms. Remains 44 /234 variables (removed 190) and now considering 94/966 (removed 872) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 44 cols
[2023-04-07 04:31:16] [INFO ] Computed 13 invariants in 1 ms
[2023-04-07 04:31:16] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 04:31:16] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-04-07 04:31:16] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 04:31:16] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 04:31:16] [INFO ] After 6ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 04:31:16] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 0 ms to minimize.
[2023-04-07 04:31:16] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 0 ms to minimize.
[2023-04-07 04:31:16] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 0 ms to minimize.
[2023-04-07 04:31:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 214 ms
[2023-04-07 04:31:16] [INFO ] After 224ms 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:31:16] [INFO ] After 319ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 75 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 207 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Applied a total of 0 rules in 4 ms. Remains 384 /384 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
[2023-04-07 04:31:17] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
// Phase 1: matrix 522 rows 384 cols
[2023-04-07 04:31:17] [INFO ] Computed 19 invariants in 4 ms
[2023-04-07 04:31:17] [INFO ] Implicit Places using invariants in 365 ms returned []
[2023-04-07 04:31:17] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-07 04:31:17] [INFO ] Invariant cache hit.
[2023-04-07 04:31:17] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-07 04:31:18] [INFO ] Implicit Places using invariants and state equation in 966 ms returned []
Implicit Place search using SMT with State Equation took 1352 ms to find 0 implicit places.
[2023-04-07 04:31:18] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-07 04:31:18] [INFO ] Invariant cache hit.
[2023-04-07 04:31:19] [INFO ] Dead Transitions using invariants and state equation in 665 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2022 ms. Remains : 384/384 places, 1116/1116 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) 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 727776 steps, run timeout after 3001 ms. (steps per millisecond=242 ) properties seen :{}
Probabilistic random walk after 727776 steps, saw 357005 distinct states, run finished after 3001 ms. (steps per millisecond=242 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 04:31:22] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-07 04:31:22] [INFO ] Invariant cache hit.
[2023-04-07 04:31:22] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 04:31:22] [INFO ] [Nat]Absence check using 13 positive place invariants in 17 ms returned sat
[2023-04-07 04:31:22] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-07 04:31:22] [INFO ] After 163ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 04:31:22] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-07 04:31:23] [INFO ] After 47ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 04:31:23] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 0 ms to minimize.
[2023-04-07 04:31:23] [INFO ] Deduced a trap composed of 3 places in 106 ms of which 1 ms to minimize.
[2023-04-07 04:31:23] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 1 ms to minimize.
[2023-04-07 04:31:23] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 0 ms to minimize.
[2023-04-07 04:31:23] [INFO ] Deduced a trap composed of 61 places in 96 ms of which 0 ms to minimize.
[2023-04-07 04:31:23] [INFO ] Deduced a trap composed of 26 places in 132 ms of which 0 ms to minimize.
[2023-04-07 04:31:23] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 1 ms to minimize.
[2023-04-07 04:31:24] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 0 ms to minimize.
[2023-04-07 04:31:24] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 0 ms to minimize.
[2023-04-07 04:31:24] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 0 ms to minimize.
[2023-04-07 04:31:24] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1297 ms
[2023-04-07 04:31:24] [INFO ] After 1365ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-04-07 04:31:24] [INFO ] After 1674ms 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 384 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 384 transition count 1110
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 378 transition count 1110
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 12 place count 378 transition count 996
Deduced a syphon composed of 114 places in 1 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 240 place count 264 transition count 996
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 300 place count 234 transition count 966
Applied a total of 300 rules in 31 ms. Remains 234 /384 variables (removed 150) and now considering 966/1116 (removed 150) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 234/384 places, 966/1116 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 860419 steps, run timeout after 3017 ms. (steps per millisecond=285 ) properties seen :{}
Probabilistic random walk after 860419 steps, saw 206416 distinct states, run finished after 3025 ms. (steps per millisecond=284 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 04:31:27] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
// Phase 1: matrix 372 rows 234 cols
[2023-04-07 04:31:27] [INFO ] Computed 19 invariants in 4 ms
[2023-04-07 04:31:27] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 04:31:27] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-07 04:31:27] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-07 04:31:27] [INFO ] After 129ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 04:31:27] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-07 04:31:27] [INFO ] After 38ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 04:31:27] [INFO ] Deduced a trap composed of 3 places in 96 ms of which 1 ms to minimize.
[2023-04-07 04:31:28] [INFO ] Deduced a trap composed of 3 places in 128 ms of which 1 ms to minimize.
[2023-04-07 04:31:28] [INFO ] Deduced a trap composed of 3 places in 102 ms of which 1 ms to minimize.
[2023-04-07 04:31:28] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 0 ms to minimize.
[2023-04-07 04:31:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 522 ms
[2023-04-07 04:31:28] [INFO ] After 575ms 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:31:28] [INFO ] After 857ms 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 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 47 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 234/234 places, 966/966 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 33 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2023-04-07 04:31:28] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-07 04:31:28] [INFO ] Invariant cache hit.
[2023-04-07 04:31:28] [INFO ] Implicit Places using invariants in 315 ms returned []
[2023-04-07 04:31:28] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-07 04:31:28] [INFO ] Invariant cache hit.
[2023-04-07 04:31:29] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-07 04:31:29] [INFO ] Implicit Places using invariants and state equation in 1060 ms returned []
Implicit Place search using SMT with State Equation took 1388 ms to find 0 implicit places.
[2023-04-07 04:31:29] [INFO ] Redundant transitions in 10 ms returned []
[2023-04-07 04:31:29] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-07 04:31:29] [INFO ] Invariant cache hit.
[2023-04-07 04:31:30] [INFO ] Dead Transitions using invariants and state equation in 449 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1904 ms. Remains : 234/234 places, 966/966 transitions.
Graph (trivial) has 866 edges and 234 vertex of which 36 / 234 are part of one of the 6 SCC in 0 ms
Free SCC test removed 30 places
Drop transitions removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 204 transition count 236
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 93 place count 158 transition count 236
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 93 place count 158 transition count 223
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 125 place count 139 transition count 223
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 243 place count 80 transition count 164
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 271 place count 80 transition count 136
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 281 place count 75 transition count 136
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 286 place count 75 transition count 131
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 292 place count 75 transition count 125
Free-agglomeration rule applied 31 times.
Iterating global reduction 4 with 31 rules applied. Total rules applied 323 place count 75 transition count 94
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 4 with 31 rules applied. Total rules applied 354 place count 44 transition count 94
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 360 place count 44 transition count 94
Applied a total of 360 rules in 11 ms. Remains 44 /234 variables (removed 190) and now considering 94/966 (removed 872) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 44 cols
[2023-04-07 04:31:30] [INFO ] Computed 13 invariants in 1 ms
[2023-04-07 04:31:30] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 04:31:30] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-04-07 04:31:30] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 04:31:30] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 04:31:30] [INFO ] After 5ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 04:31:30] [INFO ] Deduced a trap composed of 2 places in 233 ms of which 33 ms to minimize.
[2023-04-07 04:31:30] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
[2023-04-07 04:31:30] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2023-04-07 04:31:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 360 ms
[2023-04-07 04:31:30] [INFO ] After 370ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-04-07 04:31:30] [INFO ] After 496ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 119 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 215 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 193 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 370 ms.
Product exploration explored 100000 steps with 25000 reset in 335 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 384 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 384 transition count 1116
Performed 108 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 108 Pre rules applied. Total rules applied 6 place count 384 transition count 1284
Deduced a syphon composed of 114 places in 1 ms
Iterating global reduction 1 with 108 rules applied. Total rules applied 114 place count 384 transition count 1284
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 150 places in 1 ms
Iterating global reduction 1 with 36 rules applied. Total rules applied 150 place count 384 transition count 1284
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 156 place count 378 transition count 1278
Deduced a syphon composed of 144 places in 3 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 162 place count 378 transition count 1278
Deduced a syphon composed of 144 places in 0 ms
Applied a total of 162 rules in 95 ms. Remains 378 /384 variables (removed 6) and now considering 1278/1116 (removed -162) transitions.
[2023-04-07 04:31:32] [INFO ] Redundant transitions in 15 ms returned []
[2023-04-07 04:31:32] [INFO ] Flow matrix only has 600 transitions (discarded 678 similar events)
// Phase 1: matrix 600 rows 378 cols
[2023-04-07 04:31:32] [INFO ] Computed 19 invariants in 2 ms
[2023-04-07 04:31:33] [INFO ] Dead Transitions using invariants and state equation in 577 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 378/384 places, 1278/1116 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 730 ms. Remains : 378/384 places, 1278/1116 transitions.
Support contains 3 out of 384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Applied a total of 0 rules in 8 ms. Remains 384 /384 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
[2023-04-07 04:31:33] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
// Phase 1: matrix 522 rows 384 cols
[2023-04-07 04:31:33] [INFO ] Computed 19 invariants in 2 ms
[2023-04-07 04:31:33] [INFO ] Implicit Places using invariants in 360 ms returned []
[2023-04-07 04:31:33] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-07 04:31:33] [INFO ] Invariant cache hit.
[2023-04-07 04:31:34] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-07 04:31:34] [INFO ] Implicit Places using invariants and state equation in 1090 ms returned []
Implicit Place search using SMT with State Equation took 1462 ms to find 0 implicit places.
[2023-04-07 04:31:34] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-07 04:31:34] [INFO ] Invariant cache hit.
[2023-04-07 04:31:35] [INFO ] Dead Transitions using invariants and state equation in 715 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2200 ms. Remains : 384/384 places, 1116/1116 transitions.
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-13 finished in 34773 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)))))'
Support contains 1 out of 387 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 387/387 places, 1134/1134 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 384 transition count 1116
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 384 transition count 1116
Applied a total of 6 rules in 26 ms. Remains 384 /387 variables (removed 3) and now considering 1116/1134 (removed 18) transitions.
[2023-04-07 04:31:35] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-07 04:31:35] [INFO ] Invariant cache hit.
[2023-04-07 04:31:35] [INFO ] Implicit Places using invariants in 344 ms returned []
[2023-04-07 04:31:35] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-07 04:31:35] [INFO ] Invariant cache hit.
[2023-04-07 04:31:36] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-07 04:31:37] [INFO ] Implicit Places using invariants and state equation in 1344 ms returned []
Implicit Place search using SMT with State Equation took 1689 ms to find 0 implicit places.
[2023-04-07 04:31:37] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-07 04:31:37] [INFO ] Invariant cache hit.
[2023-04-07 04:31:37] [INFO ] Dead Transitions using invariants and state equation in 517 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 384/387 places, 1116/1134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2236 ms. Remains : 384/387 places, 1116/1134 transitions.
Stuttering acceptance computed with spot in 215 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(EQ s180 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 347 ms.
Product exploration explored 100000 steps with 25000 reset in 346 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, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 107 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 239 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 100 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=50 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 173 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 216 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Applied a total of 0 rules in 4 ms. Remains 384 /384 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
[2023-04-07 04:31:39] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-07 04:31:39] [INFO ] Invariant cache hit.
[2023-04-07 04:31:40] [INFO ] Implicit Places using invariants in 291 ms returned []
[2023-04-07 04:31:40] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-07 04:31:40] [INFO ] Invariant cache hit.
[2023-04-07 04:31:40] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-07 04:31:41] [INFO ] Implicit Places using invariants and state equation in 1132 ms returned []
Implicit Place search using SMT with State Equation took 1444 ms to find 0 implicit places.
[2023-04-07 04:31:41] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-07 04:31:41] [INFO ] Invariant cache hit.
[2023-04-07 04:31:41] [INFO ] Dead Transitions using invariants and state equation in 406 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1872 ms. Remains : 384/384 places, 1116/1116 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 165 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 236 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 100 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=100 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 131 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 228 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 233 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 358 ms.
Product exploration explored 100000 steps with 25000 reset in 380 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 384 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 384 transition count 1116
Performed 108 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 108 Pre rules applied. Total rules applied 5 place count 384 transition count 1284
Deduced a syphon composed of 113 places in 1 ms
Iterating global reduction 1 with 108 rules applied. Total rules applied 113 place count 384 transition count 1284
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 148 places in 1 ms
Iterating global reduction 1 with 35 rules applied. Total rules applied 148 place count 384 transition count 1284
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 153 place count 379 transition count 1279
Deduced a syphon composed of 143 places in 1 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 158 place count 379 transition count 1279
Deduced a syphon composed of 143 places in 1 ms
Applied a total of 158 rules in 47 ms. Remains 379 /384 variables (removed 5) and now considering 1279/1116 (removed -163) transitions.
[2023-04-07 04:31:43] [INFO ] Redundant transitions in 14 ms returned []
[2023-04-07 04:31:43] [INFO ] Flow matrix only has 601 transitions (discarded 678 similar events)
// Phase 1: matrix 601 rows 379 cols
[2023-04-07 04:31:43] [INFO ] Computed 19 invariants in 2 ms
[2023-04-07 04:31:44] [INFO ] Dead Transitions using invariants and state equation in 824 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 379/384 places, 1279/1116 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 943 ms. Remains : 379/384 places, 1279/1116 transitions.
Support contains 1 out of 384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Applied a total of 0 rules in 18 ms. Remains 384 /384 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
[2023-04-07 04:31:44] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
// Phase 1: matrix 522 rows 384 cols
[2023-04-07 04:31:44] [INFO ] Computed 19 invariants in 2 ms
[2023-04-07 04:31:45] [INFO ] Implicit Places using invariants in 314 ms returned []
[2023-04-07 04:31:45] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-07 04:31:45] [INFO ] Invariant cache hit.
[2023-04-07 04:31:45] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-07 04:31:46] [INFO ] Implicit Places using invariants and state equation in 1236 ms returned []
Implicit Place search using SMT with State Equation took 1582 ms to find 0 implicit places.
[2023-04-07 04:31:46] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-07 04:31:46] [INFO ] Invariant cache hit.
[2023-04-07 04:31:46] [INFO ] Dead Transitions using invariants and state equation in 398 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2013 ms. Remains : 384/384 places, 1116/1116 transitions.
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-14 finished in 11261 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G((p0||(F(p0)&&p1)))||(p2&&X(p3))))))'
Support contains 5 out of 387 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 387/387 places, 1134/1134 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 384 transition count 1116
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 384 transition count 1116
Applied a total of 6 rules in 14 ms. Remains 384 /387 variables (removed 3) and now considering 1116/1134 (removed 18) transitions.
[2023-04-07 04:31:46] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-07 04:31:46] [INFO ] Invariant cache hit.
[2023-04-07 04:31:47] [INFO ] Implicit Places using invariants in 203 ms returned []
[2023-04-07 04:31:47] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-07 04:31:47] [INFO ] Invariant cache hit.
[2023-04-07 04:31:47] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-07 04:31:48] [INFO ] Implicit Places using invariants and state equation in 1261 ms returned []
Implicit Place search using SMT with State Equation took 1503 ms to find 0 implicit places.
[2023-04-07 04:31:48] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2023-04-07 04:31:48] [INFO ] Invariant cache hit.
[2023-04-07 04:31:49] [INFO ] Dead Transitions using invariants and state equation in 621 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 384/387 places, 1116/1134 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2145 ms. Remains : 384/387 places, 1116/1134 transitions.
Stuttering acceptance computed with spot in 483 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), true, (NOT p0), (NOT p0), (OR (AND p0 (NOT p3)) (AND p2 (NOT p3)) (AND p1 (NOT p3))), (AND (NOT p0) p2 (NOT p3))]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 5}, { cond=(OR (AND p0 p2) (AND p1 p2)), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(OR p0 p1), acceptance={} source=4 dest: 4}], [{ cond=(OR (AND p0 (NOT p3)) (AND p1 (NOT p3)) (AND p2 (NOT p3))), acceptance={} source=5 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) p2 (NOT p3)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p0) p1 p2 (NOT p3)), acceptance={} source=6 dest: 3}, { cond=(OR (AND p0 p2 (NOT p3)) (AND p1 p2 (NOT p3))), acceptance={} source=6 dest: 4}]], initial=0, aps=[p2:(EQ s132 1), p0:(AND (EQ s10 1) (EQ s319 1)), p1:(AND (EQ s10 1) (EQ s319 1)), p3:(AND (EQ s21 1) (EQ s96 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-15 finished in 2653 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)||G(p1)||(X(X(p0))&&X(p0)))))'
Found a Shortening insensitive property : EisenbergMcGuire-PT-06-LTLFireability-01
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 387 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 387/387 places, 1134/1134 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 387 transition count 1128
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 381 transition count 1128
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 12 place count 381 transition count 1014
Deduced a syphon composed of 114 places in 1 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 240 place count 267 transition count 1014
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 243 place count 264 transition count 996
Iterating global reduction 2 with 3 rules applied. Total rules applied 246 place count 264 transition count 996
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 306 place count 234 transition count 966
Applied a total of 306 rules in 71 ms. Remains 234 /387 variables (removed 153) and now considering 966/1134 (removed 168) transitions.
[2023-04-07 04:31:49] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
// Phase 1: matrix 372 rows 234 cols
[2023-04-07 04:31:49] [INFO ] Computed 19 invariants in 1 ms
[2023-04-07 04:31:50] [INFO ] Implicit Places using invariants in 306 ms returned []
[2023-04-07 04:31:50] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-07 04:31:50] [INFO ] Invariant cache hit.
[2023-04-07 04:31:50] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-07 04:31:51] [INFO ] Implicit Places using invariants and state equation in 863 ms returned []
Implicit Place search using SMT with State Equation took 1187 ms to find 0 implicit places.
[2023-04-07 04:31:51] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-07 04:31:51] [INFO ] Invariant cache hit.
[2023-04-07 04:31:51] [INFO ] Dead Transitions using invariants and state equation in 636 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 234/387 places, 966/1134 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1914 ms. Remains : 234/387 places, 966/1134 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}]], initial=0, aps=[p1:(OR (EQ s5 0) (EQ s23 0) (EQ s165 0)), p0:(AND (EQ s5 1) (EQ s23 1) (EQ s155 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 207 ms.
Product exploration explored 100000 steps with 0 reset in 201 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 132 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 435064 steps, run timeout after 3001 ms. (steps per millisecond=144 ) properties seen :{}
Probabilistic random walk after 435064 steps, saw 117352 distinct states, run finished after 3001 ms. (steps per millisecond=144 ) properties seen :0
Running SMT prover for 4 properties.
[2023-04-07 04:31:55] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-07 04:31:55] [INFO ] Invariant cache hit.
[2023-04-07 04:31:55] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-04-07 04:31:55] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-07 04:31:55] [INFO ] After 202ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-07 04:31:55] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-04-07 04:31:55] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-07 04:31:56] [INFO ] After 135ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-07 04:31:56] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-07 04:31:56] [INFO ] After 85ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-07 04:31:56] [INFO ] Deduced a trap composed of 3 places in 142 ms of which 0 ms to minimize.
[2023-04-07 04:31:56] [INFO ] Deduced a trap composed of 3 places in 125 ms of which 1 ms to minimize.
[2023-04-07 04:31:56] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 1 ms to minimize.
[2023-04-07 04:31:56] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 1 ms to minimize.
[2023-04-07 04:31:56] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2023-04-07 04:31:56] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 612 ms
[2023-04-07 04:31:56] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 1 ms to minimize.
[2023-04-07 04:31:57] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 0 ms to minimize.
[2023-04-07 04:31:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 197 ms
[2023-04-07 04:31:57] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 0 ms to minimize.
[2023-04-07 04:31:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2023-04-07 04:31:57] [INFO ] After 1067ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 61 ms.
[2023-04-07 04:31:57] [INFO ] After 1369ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 28 ms.
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 16 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 234/234 places, 966/966 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 294742 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :{}
Probabilistic random walk after 294742 steps, saw 88699 distinct states, run finished after 3002 ms. (steps per millisecond=98 ) properties seen :0
Running SMT prover for 4 properties.
[2023-04-07 04:32:00] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-07 04:32:00] [INFO ] Invariant cache hit.
[2023-04-07 04:32:00] [INFO ] [Real]Absence check using 13 positive place invariants in 19 ms returned sat
[2023-04-07 04:32:00] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-07 04:32:00] [INFO ] After 211ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-07 04:32:00] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-07 04:32:00] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-07 04:32:01] [INFO ] After 195ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-07 04:32:01] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-07 04:32:01] [INFO ] After 89ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-07 04:32:01] [INFO ] Deduced a trap composed of 3 places in 144 ms of which 0 ms to minimize.
[2023-04-07 04:32:01] [INFO ] Deduced a trap composed of 3 places in 114 ms of which 0 ms to minimize.
[2023-04-07 04:32:01] [INFO ] Deduced a trap composed of 3 places in 102 ms of which 0 ms to minimize.
[2023-04-07 04:32:01] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2023-04-07 04:32:01] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 0 ms to minimize.
[2023-04-07 04:32:01] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 643 ms
[2023-04-07 04:32:02] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 0 ms to minimize.
[2023-04-07 04:32:02] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2023-04-07 04:32:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 231 ms
[2023-04-07 04:32:02] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 0 ms to minimize.
[2023-04-07 04:32:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2023-04-07 04:32:02] [INFO ] After 1170ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 59 ms.
[2023-04-07 04:32:02] [INFO ] After 1563ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 18 ms.
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 22 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 234/234 places, 966/966 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 29 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2023-04-07 04:32:02] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-07 04:32:02] [INFO ] Invariant cache hit.
[2023-04-07 04:32:02] [INFO ] Implicit Places using invariants in 327 ms returned []
[2023-04-07 04:32:02] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-07 04:32:02] [INFO ] Invariant cache hit.
[2023-04-07 04:32:03] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-07 04:32:03] [INFO ] Implicit Places using invariants and state equation in 773 ms returned []
Implicit Place search using SMT with State Equation took 1119 ms to find 0 implicit places.
[2023-04-07 04:32:03] [INFO ] Redundant transitions in 10 ms returned []
[2023-04-07 04:32:03] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-07 04:32:03] [INFO ] Invariant cache hit.
[2023-04-07 04:32:04] [INFO ] Dead Transitions using invariants and state equation in 448 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1661 ms. Remains : 234/234 places, 966/966 transitions.
Graph (trivial) has 850 edges and 234 vertex of which 36 / 234 are part of one of the 6 SCC in 0 ms
Free SCC test removed 30 places
Drop transitions removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 204 transition count 237
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 91 place count 159 transition count 237
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 91 place count 159 transition count 224
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 123 place count 140 transition count 224
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 2 with 116 rules applied. Total rules applied 239 place count 82 transition count 166
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 265 place count 82 transition count 140
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 275 place count 77 transition count 140
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 280 place count 77 transition count 135
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 287 place count 77 transition count 128
Free-agglomeration rule applied 32 times.
Iterating global reduction 4 with 32 rules applied. Total rules applied 319 place count 77 transition count 96
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 4 with 32 rules applied. Total rules applied 351 place count 45 transition count 96
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 357 place count 45 transition count 96
Applied a total of 357 rules in 9 ms. Remains 45 /234 variables (removed 189) and now considering 96/966 (removed 870) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 96 rows 45 cols
[2023-04-07 04:32:04] [INFO ] Computed 13 invariants in 0 ms
[2023-04-07 04:32:04] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-04-07 04:32:04] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-07 04:32:04] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-04-07 04:32:04] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-07 04:32:04] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 04:32:04] [INFO ] After 41ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-07 04:32:04] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2023-04-07 04:32:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2023-04-07 04:32:04] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
[2023-04-07 04:32:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2023-04-07 04:32:04] [INFO ] After 142ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-04-07 04:32:04] [INFO ] After 254ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 131 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 5 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2023-04-07 04:32:04] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
// Phase 1: matrix 372 rows 234 cols
[2023-04-07 04:32:04] [INFO ] Computed 19 invariants in 2 ms
[2023-04-07 04:32:05] [INFO ] Implicit Places using invariants in 242 ms returned []
[2023-04-07 04:32:05] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-07 04:32:05] [INFO ] Invariant cache hit.
[2023-04-07 04:32:05] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-07 04:32:06] [INFO ] Implicit Places using invariants and state equation in 807 ms returned []
Implicit Place search using SMT with State Equation took 1063 ms to find 0 implicit places.
[2023-04-07 04:32:06] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-07 04:32:06] [INFO ] Invariant cache hit.
[2023-04-07 04:32:06] [INFO ] Dead Transitions using invariants and state equation in 539 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1627 ms. Remains : 234/234 places, 966/966 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 p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 182 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 381199 steps, run timeout after 3001 ms. (steps per millisecond=127 ) properties seen :{}
Probabilistic random walk after 381199 steps, saw 105287 distinct states, run finished after 3001 ms. (steps per millisecond=127 ) properties seen :0
Running SMT prover for 4 properties.
[2023-04-07 04:32:10] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-07 04:32:10] [INFO ] Invariant cache hit.
[2023-04-07 04:32:10] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-07 04:32:10] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-07 04:32:10] [INFO ] After 220ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-07 04:32:10] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-04-07 04:32:10] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 4 ms returned sat
[2023-04-07 04:32:10] [INFO ] After 197ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-07 04:32:10] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-07 04:32:10] [INFO ] After 106ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-07 04:32:11] [INFO ] Deduced a trap composed of 3 places in 117 ms of which 0 ms to minimize.
[2023-04-07 04:32:11] [INFO ] Deduced a trap composed of 3 places in 94 ms of which 0 ms to minimize.
[2023-04-07 04:32:11] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 0 ms to minimize.
[2023-04-07 04:32:11] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 0 ms to minimize.
[2023-04-07 04:32:11] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 0 ms to minimize.
[2023-04-07 04:32:11] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 530 ms
[2023-04-07 04:32:11] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 1 ms to minimize.
[2023-04-07 04:32:11] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 0 ms to minimize.
[2023-04-07 04:32:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 249 ms
[2023-04-07 04:32:11] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2023-04-07 04:32:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2023-04-07 04:32:11] [INFO ] After 1125ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 285 ms.
[2023-04-07 04:32:12] [INFO ] After 1747ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 30 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 234/234 places, 966/966 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 4) 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 4) 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 4) 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 4) 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 4) seen :0
Interrupted probabilistic random walk after 232834 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :{}
Probabilistic random walk after 232834 steps, saw 72950 distinct states, run finished after 3001 ms. (steps per millisecond=77 ) properties seen :0
Running SMT prover for 4 properties.
[2023-04-07 04:32:15] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-07 04:32:15] [INFO ] Invariant cache hit.
[2023-04-07 04:32:15] [INFO ] [Real]Absence check using 13 positive place invariants in 14 ms returned sat
[2023-04-07 04:32:15] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-07 04:32:15] [INFO ] After 230ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-07 04:32:15] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-07 04:32:15] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-07 04:32:15] [INFO ] After 141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-07 04:32:15] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-07 04:32:16] [INFO ] After 127ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-07 04:32:17] [INFO ] Deduced a trap composed of 3 places in 1221 ms of which 1 ms to minimize.
[2023-04-07 04:32:17] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 0 ms to minimize.
[2023-04-07 04:32:17] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 0 ms to minimize.
[2023-04-07 04:32:17] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 0 ms to minimize.
[2023-04-07 04:32:17] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2023-04-07 04:32:17] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1652 ms
[2023-04-07 04:32:17] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 0 ms to minimize.
[2023-04-07 04:32:17] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 0 ms to minimize.
[2023-04-07 04:32:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 233 ms
[2023-04-07 04:32:18] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 0 ms to minimize.
[2023-04-07 04:32:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2023-04-07 04:32:18] [INFO ] After 2218ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 63 ms.
[2023-04-07 04:32:18] [INFO ] After 2531ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 15 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 234/234 places, 966/966 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 15 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2023-04-07 04:32:18] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-07 04:32:18] [INFO ] Invariant cache hit.
[2023-04-07 04:32:18] [INFO ] Implicit Places using invariants in 315 ms returned []
[2023-04-07 04:32:18] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-07 04:32:18] [INFO ] Invariant cache hit.
[2023-04-07 04:32:18] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-07 04:32:19] [INFO ] Implicit Places using invariants and state equation in 652 ms returned []
Implicit Place search using SMT with State Equation took 996 ms to find 0 implicit places.
[2023-04-07 04:32:19] [INFO ] Redundant transitions in 8 ms returned []
[2023-04-07 04:32:19] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-07 04:32:19] [INFO ] Invariant cache hit.
[2023-04-07 04:32:19] [INFO ] Dead Transitions using invariants and state equation in 417 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1460 ms. Remains : 234/234 places, 966/966 transitions.
Graph (trivial) has 850 edges and 234 vertex of which 36 / 234 are part of one of the 6 SCC in 0 ms
Free SCC test removed 30 places
Drop transitions removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 204 transition count 237
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 91 place count 159 transition count 237
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 91 place count 159 transition count 224
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 123 place count 140 transition count 224
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 2 with 116 rules applied. Total rules applied 239 place count 82 transition count 166
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 265 place count 82 transition count 140
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 275 place count 77 transition count 140
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 280 place count 77 transition count 135
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 287 place count 77 transition count 128
Free-agglomeration rule applied 32 times.
Iterating global reduction 4 with 32 rules applied. Total rules applied 319 place count 77 transition count 96
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 4 with 32 rules applied. Total rules applied 351 place count 45 transition count 96
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 357 place count 45 transition count 96
Applied a total of 357 rules in 11 ms. Remains 45 /234 variables (removed 189) and now considering 96/966 (removed 870) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 96 rows 45 cols
[2023-04-07 04:32:19] [INFO ] Computed 13 invariants in 1 ms
[2023-04-07 04:32:19] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-04-07 04:32:19] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-07 04:32:19] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-04-07 04:32:19] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-07 04:32:19] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 04:32:19] [INFO ] After 20ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-07 04:32:19] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 0 ms to minimize.
[2023-04-07 04:32:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2023-04-07 04:32:20] [INFO ] Deduced a trap composed of 2 places in 54 ms of which 0 ms to minimize.
[2023-04-07 04:32:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2023-04-07 04:32:20] [INFO ] After 208ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 49 ms.
[2023-04-07 04:32:20] [INFO ] After 369ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 138 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 225 ms.
Product exploration explored 100000 steps with 0 reset in 201 ms.
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 5 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2023-04-07 04:32:21] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
// Phase 1: matrix 372 rows 234 cols
[2023-04-07 04:32:21] [INFO ] Computed 19 invariants in 1 ms
[2023-04-07 04:32:21] [INFO ] Implicit Places using invariants in 205 ms returned []
[2023-04-07 04:32:21] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-07 04:32:21] [INFO ] Invariant cache hit.
[2023-04-07 04:32:21] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-07 04:32:22] [INFO ] Implicit Places using invariants and state equation in 1018 ms returned []
Implicit Place search using SMT with State Equation took 1237 ms to find 0 implicit places.
[2023-04-07 04:32:22] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-07 04:32:22] [INFO ] Invariant cache hit.
[2023-04-07 04:32:22] [INFO ] Dead Transitions using invariants and state equation in 324 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1583 ms. Remains : 234/234 places, 966/966 transitions.
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-01 finished in 33459 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||G(p1)))))'
Found a Shortening insensitive property : EisenbergMcGuire-PT-06-LTLFireability-12
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 387 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 387/387 places, 1134/1134 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 387 transition count 1128
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 381 transition count 1128
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 112 Pre rules applied. Total rules applied 12 place count 381 transition count 1016
Deduced a syphon composed of 112 places in 0 ms
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 224 rules applied. Total rules applied 236 place count 269 transition count 1016
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 239 place count 266 transition count 998
Iterating global reduction 2 with 3 rules applied. Total rules applied 242 place count 266 transition count 998
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 302 place count 236 transition count 968
Applied a total of 302 rules in 25 ms. Remains 236 /387 variables (removed 151) and now considering 968/1134 (removed 166) transitions.
[2023-04-07 04:32:23] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
// Phase 1: matrix 374 rows 236 cols
[2023-04-07 04:32:23] [INFO ] Computed 19 invariants in 1 ms
[2023-04-07 04:32:25] [INFO ] Implicit Places using invariants in 2575 ms returned []
[2023-04-07 04:32:25] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-07 04:32:25] [INFO ] Invariant cache hit.
[2023-04-07 04:32:26] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-07 04:32:26] [INFO ] Implicit Places using invariants and state equation in 964 ms returned []
Implicit Place search using SMT with State Equation took 3597 ms to find 0 implicit places.
[2023-04-07 04:32:26] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-07 04:32:26] [INFO ] Invariant cache hit.
[2023-04-07 04:32:27] [INFO ] Dead Transitions using invariants and state equation in 741 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 236/387 places, 968/1134 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 4377 ms. Remains : 236/387 places, 968/1134 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(OR (EQ s9 0) (EQ s108 0)), p0:(AND (EQ s23 1) (EQ s182 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 195 ms.
Product exploration explored 100000 steps with 0 reset in 179 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 249 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 302 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 4) 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 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-04-07 04:32:28] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-07 04:32:28] [INFO ] Invariant cache hit.
[2023-04-07 04:32:28] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 04:32:29] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-04-07 04:32:29] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 41 ms returned sat
[2023-04-07 04:32:29] [INFO ] After 146ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 04:32:29] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-07 04:32:29] [INFO ] After 65ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 04:32:29] [INFO ] Deduced a trap composed of 3 places in 154 ms of which 0 ms to minimize.
[2023-04-07 04:32:29] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 0 ms to minimize.
[2023-04-07 04:32:29] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 0 ms to minimize.
[2023-04-07 04:32:29] [INFO ] Deduced a trap composed of 37 places in 125 ms of which 0 ms to minimize.
[2023-04-07 04:32:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 577 ms
[2023-04-07 04:32:30] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 1 ms to minimize.
[2023-04-07 04:32:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2023-04-07 04:32:30] [INFO ] After 823ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-04-07 04:32:30] [INFO ] After 1191ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 26 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 236/236 places, 968/968 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) 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 841351 steps, run timeout after 3001 ms. (steps per millisecond=280 ) properties seen :{}
Probabilistic random walk after 841351 steps, saw 198842 distinct states, run finished after 3001 ms. (steps per millisecond=280 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 04:32:33] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-07 04:32:33] [INFO ] Invariant cache hit.
[2023-04-07 04:32:33] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 04:32:33] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-07 04:32:33] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 4 ms returned sat
[2023-04-07 04:32:33] [INFO ] After 94ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 04:32:33] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-07 04:32:33] [INFO ] After 42ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 04:32:33] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 0 ms to minimize.
[2023-04-07 04:32:33] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2023-04-07 04:32:33] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-04-07 04:32:33] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 0 ms to minimize.
[2023-04-07 04:32:34] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 1 ms to minimize.
[2023-04-07 04:32:34] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2023-04-07 04:32:34] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 584 ms
[2023-04-07 04:32:34] [INFO ] After 639ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-04-07 04:32:34] [INFO ] After 878ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 18 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 236/236 places, 968/968 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 17 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2023-04-07 04:32:34] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-07 04:32:34] [INFO ] Invariant cache hit.
[2023-04-07 04:32:34] [INFO ] Implicit Places using invariants in 208 ms returned []
[2023-04-07 04:32:34] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-07 04:32:34] [INFO ] Invariant cache hit.
[2023-04-07 04:32:34] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-07 04:32:35] [INFO ] Implicit Places using invariants and state equation in 614 ms returned []
Implicit Place search using SMT with State Equation took 832 ms to find 0 implicit places.
[2023-04-07 04:32:35] [INFO ] Redundant transitions in 10 ms returned []
[2023-04-07 04:32:35] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-07 04:32:35] [INFO ] Invariant cache hit.
[2023-04-07 04:32:35] [INFO ] Dead Transitions using invariants and state equation in 391 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1261 ms. Remains : 236/236 places, 968/968 transitions.
Graph (trivial) has 876 edges and 236 vertex of which 36 / 236 are part of one of the 6 SCC in 1 ms
Free SCC test removed 30 places
Drop transitions removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 206 transition count 239
Reduce places removed 45 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 47 rules applied. Total rules applied 93 place count 161 transition count 237
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 95 place count 159 transition count 237
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 95 place count 159 transition count 224
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 127 place count 140 transition count 224
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 243 place count 82 transition count 166
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 3 with 29 rules applied. Total rules applied 272 place count 82 transition count 137
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -19
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 284 place count 76 transition count 156
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 289 place count 76 transition count 151
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 294 place count 76 transition count 146
Free-agglomeration rule applied 25 times.
Iterating global reduction 5 with 25 rules applied. Total rules applied 319 place count 76 transition count 121
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 5 with 25 rules applied. Total rules applied 344 place count 51 transition count 121
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 354 place count 51 transition count 121
Applied a total of 354 rules in 11 ms. Remains 51 /236 variables (removed 185) and now considering 121/968 (removed 847) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 121 rows 51 cols
[2023-04-07 04:32:35] [INFO ] Computed 13 invariants in 0 ms
[2023-04-07 04:32:35] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 04:32:35] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-04-07 04:32:35] [INFO ] After 133ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 04:32:35] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 04:32:35] [INFO ] After 12ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 04:32:35] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 0 ms to minimize.
[2023-04-07 04:32:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2023-04-07 04:32:35] [INFO ] After 74ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-04-07 04:32:35] [INFO ] After 322ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 332 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), (NOT p1), false]
Stuttering acceptance computed with spot in 199 ms :[(NOT p1), (NOT p1), false]
Support contains 4 out of 236 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 16 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2023-04-07 04:32:36] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
// Phase 1: matrix 374 rows 236 cols
[2023-04-07 04:32:36] [INFO ] Computed 19 invariants in 14 ms
[2023-04-07 04:32:36] [INFO ] Implicit Places using invariants in 355 ms returned []
[2023-04-07 04:32:36] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-07 04:32:36] [INFO ] Invariant cache hit.
[2023-04-07 04:32:37] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-07 04:32:37] [INFO ] Implicit Places using invariants and state equation in 969 ms returned []
Implicit Place search using SMT with State Equation took 1328 ms to find 0 implicit places.
[2023-04-07 04:32:37] [INFO ] Redundant transitions in 8 ms returned []
[2023-04-07 04:32:37] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-07 04:32:37] [INFO ] Invariant cache hit.
[2023-04-07 04:32:38] [INFO ] Dead Transitions using invariants and state equation in 546 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1933 ms. Remains : 236/236 places, 968/968 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 p0) p1), (X p1), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (X p1)), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 107 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), (NOT p1), false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) 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 :2
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
Running SMT prover for 1 properties.
[2023-04-07 04:32:38] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-07 04:32:38] [INFO ] Invariant cache hit.
[2023-04-07 04:32:38] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 04:32:39] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-07 04:32:39] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-07 04:32:39] [INFO ] After 109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 04:32:39] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-07 04:32:39] [INFO ] After 35ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 04:32:39] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 1 ms to minimize.
[2023-04-07 04:32:39] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2023-04-07 04:32:39] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2023-04-07 04:32:39] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 1 ms to minimize.
[2023-04-07 04:32:39] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2023-04-07 04:32:39] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 2 ms to minimize.
[2023-04-07 04:32:39] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 560 ms
[2023-04-07 04:32:39] [INFO ] After 620ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2023-04-07 04:32:39] [INFO ] After 861ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 17 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 236/236 places, 968/968 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 872466 steps, run timeout after 3001 ms. (steps per millisecond=290 ) properties seen :{}
Probabilistic random walk after 872466 steps, saw 204893 distinct states, run finished after 3001 ms. (steps per millisecond=290 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 04:32:42] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-07 04:32:42] [INFO ] Invariant cache hit.
[2023-04-07 04:32:42] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 04:32:42] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-07 04:32:42] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-07 04:32:43] [INFO ] After 80ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 04:32:43] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-07 04:32:43] [INFO ] After 32ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 04:32:43] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2023-04-07 04:32:43] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2023-04-07 04:32:43] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-04-07 04:32:43] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 0 ms to minimize.
[2023-04-07 04:32:43] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 0 ms to minimize.
[2023-04-07 04:32:43] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2023-04-07 04:32:43] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 542 ms
[2023-04-07 04:32:43] [INFO ] After 583ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-04-07 04:32:43] [INFO ] After 743ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 17 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 236/236 places, 968/968 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 15 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2023-04-07 04:32:43] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-07 04:32:43] [INFO ] Invariant cache hit.
[2023-04-07 04:32:43] [INFO ] Implicit Places using invariants in 252 ms returned []
[2023-04-07 04:32:43] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-07 04:32:44] [INFO ] Invariant cache hit.
[2023-04-07 04:32:44] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-07 04:32:44] [INFO ] Implicit Places using invariants and state equation in 1001 ms returned []
Implicit Place search using SMT with State Equation took 1278 ms to find 0 implicit places.
[2023-04-07 04:32:45] [INFO ] Redundant transitions in 8 ms returned []
[2023-04-07 04:32:45] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-07 04:32:45] [INFO ] Invariant cache hit.
[2023-04-07 04:32:45] [INFO ] Dead Transitions using invariants and state equation in 296 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1629 ms. Remains : 236/236 places, 968/968 transitions.
Graph (trivial) has 876 edges and 236 vertex of which 36 / 236 are part of one of the 6 SCC in 0 ms
Free SCC test removed 30 places
Drop transitions removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 206 transition count 239
Reduce places removed 45 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 47 rules applied. Total rules applied 93 place count 161 transition count 237
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 95 place count 159 transition count 237
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 95 place count 159 transition count 224
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 127 place count 140 transition count 224
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 243 place count 82 transition count 166
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 3 with 29 rules applied. Total rules applied 272 place count 82 transition count 137
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -19
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 284 place count 76 transition count 156
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 289 place count 76 transition count 151
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 294 place count 76 transition count 146
Free-agglomeration rule applied 25 times.
Iterating global reduction 5 with 25 rules applied. Total rules applied 319 place count 76 transition count 121
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 5 with 25 rules applied. Total rules applied 344 place count 51 transition count 121
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 354 place count 51 transition count 121
Applied a total of 354 rules in 9 ms. Remains 51 /236 variables (removed 185) and now considering 121/968 (removed 847) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 121 rows 51 cols
[2023-04-07 04:32:45] [INFO ] Computed 13 invariants in 1 ms
[2023-04-07 04:32:45] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 04:32:45] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-04-07 04:32:45] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 04:32:45] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 04:32:45] [INFO ] After 5ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 04:32:45] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2023-04-07 04:32:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2023-04-07 04:32:45] [INFO ] After 40ms 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:32:45] [INFO ] After 100ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (X p1)), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 110 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), (NOT p1), false]
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (NOT p1), false]
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (NOT p1), false]
Product exploration explored 100000 steps with 0 reset in 168 ms.
Product exploration explored 100000 steps with 0 reset in 180 ms.
Support contains 4 out of 236 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 16 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2023-04-07 04:32:46] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
// Phase 1: matrix 374 rows 236 cols
[2023-04-07 04:32:46] [INFO ] Computed 19 invariants in 4 ms
[2023-04-07 04:32:46] [INFO ] Implicit Places using invariants in 171 ms returned []
[2023-04-07 04:32:46] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-07 04:32:46] [INFO ] Invariant cache hit.
[2023-04-07 04:32:46] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-07 04:32:46] [INFO ] Implicit Places using invariants and state equation in 564 ms returned []
Implicit Place search using SMT with State Equation took 736 ms to find 0 implicit places.
[2023-04-07 04:32:47] [INFO ] Redundant transitions in 13 ms returned []
[2023-04-07 04:32:47] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-07 04:32:47] [INFO ] Invariant cache hit.
[2023-04-07 04:32:47] [INFO ] Dead Transitions using invariants and state equation in 297 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1076 ms. Remains : 236/236 places, 968/968 transitions.
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-12 finished in 24357 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)))))'
Found a Shortening insensitive property : EisenbergMcGuire-PT-06-LTLFireability-13
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 387 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 387/387 places, 1134/1134 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 387 transition count 1128
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 381 transition count 1128
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 12 place count 381 transition count 1014
Deduced a syphon composed of 114 places in 1 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 240 place count 267 transition count 1014
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 243 place count 264 transition count 996
Iterating global reduction 2 with 3 rules applied. Total rules applied 246 place count 264 transition count 996
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 306 place count 234 transition count 966
Applied a total of 306 rules in 43 ms. Remains 234 /387 variables (removed 153) and now considering 966/1134 (removed 168) transitions.
[2023-04-07 04:32:47] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
// Phase 1: matrix 372 rows 234 cols
[2023-04-07 04:32:47] [INFO ] Computed 19 invariants in 1 ms
[2023-04-07 04:32:47] [INFO ] Implicit Places using invariants in 191 ms returned []
[2023-04-07 04:32:47] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-07 04:32:47] [INFO ] Invariant cache hit.
[2023-04-07 04:32:47] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-07 04:32:48] [INFO ] Implicit Places using invariants and state equation in 613 ms returned []
Implicit Place search using SMT with State Equation took 815 ms to find 0 implicit places.
[2023-04-07 04:32:48] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-07 04:32:48] [INFO ] Invariant cache hit.
[2023-04-07 04:32:48] [INFO ] Dead Transitions using invariants and state equation in 269 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 234/387 places, 966/1134 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1128 ms. Remains : 234/387 places, 966/1134 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(OR (EQ s2 0) (EQ s14 0) (EQ s148 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 272 ms.
Product exploration explored 100000 steps with 25000 reset in 287 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, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 118 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
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 870107 steps, run timeout after 3001 ms. (steps per millisecond=289 ) properties seen :{}
Probabilistic random walk after 870107 steps, saw 208070 distinct states, run finished after 3001 ms. (steps per millisecond=289 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 04:32:52] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-07 04:32:52] [INFO ] Invariant cache hit.
[2023-04-07 04:32:52] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 04:32:52] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-04-07 04:32:52] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-07 04:32:52] [INFO ] After 75ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 04:32:52] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-07 04:32:52] [INFO ] After 36ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 04:32:52] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2023-04-07 04:32:52] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 1 ms to minimize.
[2023-04-07 04:32:53] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
[2023-04-07 04:32:53] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2023-04-07 04:32:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 354 ms
[2023-04-07 04:32:53] [INFO ] After 407ms 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:32:53] [INFO ] After 559ms 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 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 22 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 234/234 places, 966/966 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 876918 steps, run timeout after 3001 ms. (steps per millisecond=292 ) properties seen :{}
Probabilistic random walk after 876918 steps, saw 209737 distinct states, run finished after 3001 ms. (steps per millisecond=292 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 04:32:56] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-07 04:32:56] [INFO ] Invariant cache hit.
[2023-04-07 04:32:56] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 04:32:56] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-07 04:32:56] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2023-04-07 04:32:56] [INFO ] After 84ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 04:32:56] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-07 04:32:56] [INFO ] After 38ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 04:32:56] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2023-04-07 04:32:56] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 2 ms to minimize.
[2023-04-07 04:32:56] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 0 ms to minimize.
[2023-04-07 04:32:56] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 0 ms to minimize.
[2023-04-07 04:32:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 350 ms
[2023-04-07 04:32:56] [INFO ] After 402ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-04-07 04:32:56] [INFO ] After 576ms 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 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 18 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 234/234 places, 966/966 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 16 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2023-04-07 04:32:56] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-07 04:32:56] [INFO ] Invariant cache hit.
[2023-04-07 04:32:57] [INFO ] Implicit Places using invariants in 180 ms returned []
[2023-04-07 04:32:57] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-07 04:32:57] [INFO ] Invariant cache hit.
[2023-04-07 04:32:57] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-07 04:32:57] [INFO ] Implicit Places using invariants and state equation in 600 ms returned []
Implicit Place search using SMT with State Equation took 782 ms to find 0 implicit places.
[2023-04-07 04:32:57] [INFO ] Redundant transitions in 12 ms returned []
[2023-04-07 04:32:57] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-07 04:32:57] [INFO ] Invariant cache hit.
[2023-04-07 04:32:57] [INFO ] Dead Transitions using invariants and state equation in 289 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1108 ms. Remains : 234/234 places, 966/966 transitions.
Graph (trivial) has 866 edges and 234 vertex of which 36 / 234 are part of one of the 6 SCC in 0 ms
Free SCC test removed 30 places
Drop transitions removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 204 transition count 236
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 93 place count 158 transition count 236
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 93 place count 158 transition count 223
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 125 place count 139 transition count 223
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 243 place count 80 transition count 164
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 271 place count 80 transition count 136
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 281 place count 75 transition count 136
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 286 place count 75 transition count 131
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 292 place count 75 transition count 125
Free-agglomeration rule applied 31 times.
Iterating global reduction 4 with 31 rules applied. Total rules applied 323 place count 75 transition count 94
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 4 with 31 rules applied. Total rules applied 354 place count 44 transition count 94
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 360 place count 44 transition count 94
Applied a total of 360 rules in 12 ms. Remains 44 /234 variables (removed 190) and now considering 94/966 (removed 872) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 44 cols
[2023-04-07 04:32:57] [INFO ] Computed 13 invariants in 0 ms
[2023-04-07 04:32:57] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 04:32:58] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-04-07 04:32:58] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 04:32:58] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 04:32:58] [INFO ] After 4ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 04:32:58] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
[2023-04-07 04:32:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2023-04-07 04:32:58] [INFO ] After 37ms 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:32:58] [INFO ] After 98ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 61 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 5 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2023-04-07 04:32:58] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
// Phase 1: matrix 372 rows 234 cols
[2023-04-07 04:32:58] [INFO ] Computed 19 invariants in 2 ms
[2023-04-07 04:32:58] [INFO ] Implicit Places using invariants in 176 ms returned []
[2023-04-07 04:32:58] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-07 04:32:58] [INFO ] Invariant cache hit.
[2023-04-07 04:32:58] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-07 04:32:59] [INFO ] Implicit Places using invariants and state equation in 588 ms returned []
Implicit Place search using SMT with State Equation took 766 ms to find 0 implicit places.
[2023-04-07 04:32:59] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-07 04:32:59] [INFO ] Invariant cache hit.
[2023-04-07 04:32:59] [INFO ] Dead Transitions using invariants and state equation in 306 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1079 ms. Remains : 234/234 places, 966/966 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 59 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
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 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 861994 steps, run timeout after 3001 ms. (steps per millisecond=287 ) properties seen :{}
Probabilistic random walk after 861994 steps, saw 206643 distinct states, run finished after 3001 ms. (steps per millisecond=287 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 04:33:02] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-07 04:33:02] [INFO ] Invariant cache hit.
[2023-04-07 04:33:02] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 04:33:02] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-07 04:33:02] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-07 04:33:02] [INFO ] After 83ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 04:33:02] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-07 04:33:02] [INFO ] After 39ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 04:33:03] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2023-04-07 04:33:03] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 3 ms to minimize.
[2023-04-07 04:33:03] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 0 ms to minimize.
[2023-04-07 04:33:03] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 0 ms to minimize.
[2023-04-07 04:33:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 351 ms
[2023-04-07 04:33:03] [INFO ] After 406ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-04-07 04:33:03] [INFO ] After 572ms 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 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 27 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 234/234 places, 966/966 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 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 875525 steps, run timeout after 3001 ms. (steps per millisecond=291 ) properties seen :{}
Probabilistic random walk after 875525 steps, saw 209535 distinct states, run finished after 3001 ms. (steps per millisecond=291 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 04:33:06] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-07 04:33:06] [INFO ] Invariant cache hit.
[2023-04-07 04:33:06] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 04:33:06] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-04-07 04:33:06] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-07 04:33:06] [INFO ] After 86ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 04:33:06] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-07 04:33:06] [INFO ] After 40ms SMT Verify possible using 164 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 04:33:06] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2023-04-07 04:33:06] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 1 ms to minimize.
[2023-04-07 04:33:06] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2023-04-07 04:33:07] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2023-04-07 04:33:07] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 356 ms
[2023-04-07 04:33:07] [INFO ] After 412ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-04-07 04:33:07] [INFO ] After 588ms 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 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 17 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 234/234 places, 966/966 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 16 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2023-04-07 04:33:07] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-07 04:33:07] [INFO ] Invariant cache hit.
[2023-04-07 04:33:07] [INFO ] Implicit Places using invariants in 182 ms returned []
[2023-04-07 04:33:07] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-07 04:33:07] [INFO ] Invariant cache hit.
[2023-04-07 04:33:07] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-07 04:33:07] [INFO ] Implicit Places using invariants and state equation in 615 ms returned []
Implicit Place search using SMT with State Equation took 799 ms to find 0 implicit places.
[2023-04-07 04:33:07] [INFO ] Redundant transitions in 13 ms returned []
[2023-04-07 04:33:07] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-07 04:33:07] [INFO ] Invariant cache hit.
[2023-04-07 04:33:08] [INFO ] Dead Transitions using invariants and state equation in 298 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1136 ms. Remains : 234/234 places, 966/966 transitions.
Graph (trivial) has 866 edges and 234 vertex of which 36 / 234 are part of one of the 6 SCC in 0 ms
Free SCC test removed 30 places
Drop transitions removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 204 transition count 236
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 93 place count 158 transition count 236
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 93 place count 158 transition count 223
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 125 place count 139 transition count 223
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 243 place count 80 transition count 164
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 271 place count 80 transition count 136
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 281 place count 75 transition count 136
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 286 place count 75 transition count 131
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 292 place count 75 transition count 125
Free-agglomeration rule applied 31 times.
Iterating global reduction 4 with 31 rules applied. Total rules applied 323 place count 75 transition count 94
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 4 with 31 rules applied. Total rules applied 354 place count 44 transition count 94
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 360 place count 44 transition count 94
Applied a total of 360 rules in 8 ms. Remains 44 /234 variables (removed 190) and now considering 94/966 (removed 872) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 44 cols
[2023-04-07 04:33:08] [INFO ] Computed 13 invariants in 6 ms
[2023-04-07 04:33:08] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 04:33:08] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-07 04:33:08] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 04:33:08] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-07 04:33:08] [INFO ] After 9ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 04:33:08] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
[2023-04-07 04:33:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2023-04-07 04:33:08] [INFO ] After 44ms 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:33:08] [INFO ] After 140ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 64 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 306 ms.
Product exploration explored 100000 steps with 25000 reset in 309 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 234 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 23 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2023-04-07 04:33:09] [INFO ] Redundant transitions in 9 ms returned []
[2023-04-07 04:33:09] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
// Phase 1: matrix 372 rows 234 cols
[2023-04-07 04:33:09] [INFO ] Computed 19 invariants in 2 ms
[2023-04-07 04:33:10] [INFO ] Dead Transitions using invariants and state equation in 295 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 336 ms. Remains : 234/234 places, 966/966 transitions.
Support contains 3 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 2 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2023-04-07 04:33:10] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-07 04:33:10] [INFO ] Invariant cache hit.
[2023-04-07 04:33:10] [INFO ] Implicit Places using invariants in 166 ms returned []
[2023-04-07 04:33:10] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-07 04:33:10] [INFO ] Invariant cache hit.
[2023-04-07 04:33:10] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-07 04:33:10] [INFO ] Implicit Places using invariants and state equation in 583 ms returned []
Implicit Place search using SMT with State Equation took 752 ms to find 0 implicit places.
[2023-04-07 04:33:10] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2023-04-07 04:33:10] [INFO ] Invariant cache hit.
[2023-04-07 04:33:11] [INFO ] Dead Transitions using invariants and state equation in 278 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1032 ms. Remains : 234/234 places, 966/966 transitions.
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-13 finished in 23814 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)))))'
Found a Shortening insensitive property : EisenbergMcGuire-PT-06-LTLFireability-14
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 387 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 387/387 places, 1134/1134 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 387 transition count 1129
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 382 transition count 1129
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 113 Pre rules applied. Total rules applied 10 place count 382 transition count 1016
Deduced a syphon composed of 113 places in 1 ms
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 226 rules applied. Total rules applied 236 place count 269 transition count 1016
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 239 place count 266 transition count 998
Iterating global reduction 2 with 3 rules applied. Total rules applied 242 place count 266 transition count 998
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 302 place count 236 transition count 968
Applied a total of 302 rules in 32 ms. Remains 236 /387 variables (removed 151) and now considering 968/1134 (removed 166) transitions.
[2023-04-07 04:33:11] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
// Phase 1: matrix 374 rows 236 cols
[2023-04-07 04:33:11] [INFO ] Computed 19 invariants in 3 ms
[2023-04-07 04:33:11] [INFO ] Implicit Places using invariants in 195 ms returned []
[2023-04-07 04:33:11] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-07 04:33:11] [INFO ] Invariant cache hit.
[2023-04-07 04:33:11] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-07 04:33:12] [INFO ] Implicit Places using invariants and state equation in 539 ms returned []
Implicit Place search using SMT with State Equation took 736 ms to find 0 implicit places.
[2023-04-07 04:33:12] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-07 04:33:12] [INFO ] Invariant cache hit.
[2023-04-07 04:33:12] [INFO ] Dead Transitions using invariants and state equation in 297 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 236/387 places, 968/1134 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1066 ms. Remains : 236/387 places, 968/1134 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(EQ s108 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 290 ms.
Product exploration explored 100000 steps with 25000 reset in 303 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, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 46 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=23 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 67 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 236 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 5 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2023-04-07 04:33:13] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-07 04:33:13] [INFO ] Invariant cache hit.
[2023-04-07 04:33:13] [INFO ] Implicit Places using invariants in 177 ms returned []
[2023-04-07 04:33:13] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-07 04:33:13] [INFO ] Invariant cache hit.
[2023-04-07 04:33:13] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-07 04:33:14] [INFO ] Implicit Places using invariants and state equation in 595 ms returned []
Implicit Place search using SMT with State Equation took 773 ms to find 0 implicit places.
[2023-04-07 04:33:14] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-07 04:33:14] [INFO ] Invariant cache hit.
[2023-04-07 04:33:14] [INFO ] Dead Transitions using invariants and state equation in 282 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1077 ms. Remains : 236/236 places, 968/968 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 68 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 58 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=29 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 71 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 306 ms.
Product exploration explored 100000 steps with 25000 reset in 313 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 236 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 20 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2023-04-07 04:33:16] [INFO ] Redundant transitions in 9 ms returned []
[2023-04-07 04:33:16] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-07 04:33:16] [INFO ] Invariant cache hit.
[2023-04-07 04:33:16] [INFO ] Dead Transitions using invariants and state equation in 291 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 328 ms. Remains : 236/236 places, 968/968 transitions.
Support contains 1 out of 236 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 3 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2023-04-07 04:33:16] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-07 04:33:16] [INFO ] Invariant cache hit.
[2023-04-07 04:33:16] [INFO ] Implicit Places using invariants in 185 ms returned []
[2023-04-07 04:33:16] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-07 04:33:16] [INFO ] Invariant cache hit.
[2023-04-07 04:33:16] [INFO ] State equation strengthened by 164 read => feed constraints.
[2023-04-07 04:33:17] [INFO ] Implicit Places using invariants and state equation in 557 ms returned []
Implicit Place search using SMT with State Equation took 744 ms to find 0 implicit places.
[2023-04-07 04:33:17] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2023-04-07 04:33:17] [INFO ] Invariant cache hit.
[2023-04-07 04:33:17] [INFO ] Dead Transitions using invariants and state equation in 305 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1052 ms. Remains : 236/236 places, 968/968 transitions.
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-14 finished in 6560 ms.
[2023-04-07 04:33:17] [INFO ] Flatten gal took : 46 ms
[2023-04-07 04:33:17] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-04-07 04:33:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 387 places, 1134 transitions and 5328 arcs took 10 ms.
Total runtime 242455 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3443/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3443/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3443/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3443/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : EisenbergMcGuire-PT-06-LTLFireability-01
Could not compute solution for formula : EisenbergMcGuire-PT-06-LTLFireability-12
Could not compute solution for formula : EisenbergMcGuire-PT-06-LTLFireability-13
Could not compute solution for formula : EisenbergMcGuire-PT-06-LTLFireability-14

BK_STOP 1680842000338

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name EisenbergMcGuire-PT-06-LTLFireability-01
ltl formula formula --ltl=/tmp/3443/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 387 places, 1134 transitions and 5328 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.210 real 0.030 user 0.050 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3443/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3443/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3443/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3443/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
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:
ltl formula name EisenbergMcGuire-PT-06-LTLFireability-12
ltl formula formula --ltl=/tmp/3443/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: =============================================================================
Warning: program compiled against libxml 210 using older 209
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 387 places, 1134 transitions and 5328 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.220 real 0.060 user 0.040 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3443/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3443/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3443/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3443/ltl_1_
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:
ltl formula name EisenbergMcGuire-PT-06-LTLFireability-13
ltl formula formula --ltl=/tmp/3443/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
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 387 places, 1134 transitions and 5328 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3443/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3443/ltl_2_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.190 real 0.040 user 0.030 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3443/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3443/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 4 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-06-LTLFireability-14
ltl formula formula --ltl=/tmp/3443/ltl_3_
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 387 places, 1134 transitions and 5328 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.230 real 0.040 user 0.060 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3443/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3443/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3443/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3443/ltl_3_
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) [0x5578b728b3f4]
1: pnml2lts-mc(+0xa2496) [0x5578b728b496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f4c22006140]
3: pnml2lts-mc(+0x405b30) [0x5578b75eeb30]
4: pnml2lts-mc(+0x16b3f9) [0x5578b73543f9]
5: pnml2lts-mc(+0x164ac4) [0x5578b734dac4]
6: pnml2lts-mc(+0x272e0a) [0x5578b745be0a]
7: pnml2lts-mc(+0xb61f0) [0x5578b729f1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f4c21e594d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f4c21e5967a]
10: pnml2lts-mc(+0xa1581) [0x5578b728a581]
11: pnml2lts-mc(+0xa1910) [0x5578b728a910]
12: pnml2lts-mc(+0xa32a2) [0x5578b728c2a2]
13: pnml2lts-mc(+0xa50f4) [0x5578b728e0f4]
14: pnml2lts-mc(+0xa516b) [0x5578b728e16b]
15: pnml2lts-mc(+0x3f34b3) [0x5578b75dc4b3]
16: pnml2lts-mc(+0x7c63d) [0x5578b726563d]
17: pnml2lts-mc(+0x67d86) [0x5578b7250d86]
18: pnml2lts-mc(+0x60a8a) [0x5578b7249a8a]
19: pnml2lts-mc(+0x5eb15) [0x5578b7247b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f4c21e41d0a]
21: pnml2lts-mc(+0x6075e) [0x5578b724975e]

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-06"
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-06, 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-167987246400244"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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