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.r533-tall-167987253200163.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is EisenbergMcGuire-PT-08, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r533-tall-167987253200163
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Mar 23 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 23 15:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 83K Mar 23 15:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 9.0K Mar 23 15:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Mar 23 15:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Mar 23 15:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Mar 23 15:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 1.7M 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

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1680813588783

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=EisenbergMcGuire-PT-08
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2023-04-06 20:39:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-04-06 20:39:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 20:39:50] [INFO ] Load time of PNML (sax parser for PT used): 141 ms
[2023-04-06 20:39:50] [INFO ] Transformed 712 places.
[2023-04-06 20:39:50] [INFO ] Transformed 2816 transitions.
[2023-04-06 20:39:50] [INFO ] Found NUPN structural information;
[2023-04-06 20:39:50] [INFO ] Parsed PT model containing 712 places and 2816 transitions and 13440 arcs in 221 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 507 ms. (steps per millisecond=19 ) properties (out of 712) seen :471
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 241) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 241) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 241) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 241) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=10 ) properties (out of 241) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 241) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 241) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 241) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 241) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 241) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 241) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 241) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 241) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 241) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 241) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 241) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 241) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 241) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 241) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 241) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 241) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 241) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 241) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 241) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 241) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 241) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 241) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 241) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 241) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 241) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 241) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 241) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 241) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 241) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 241) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 241) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 241) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 241) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 241) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 241) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 241) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 241) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 241) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 241) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 241) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 241) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 241) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 241) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 241) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 241) seen :0
Running SMT prover for 241 properties.
[2023-04-06 20:39:51] [INFO ] Flow matrix only has 1368 transitions (discarded 1448 similar events)
// Phase 1: matrix 1368 rows 712 cols
[2023-04-06 20:39:51] [INFO ] Computed 25 invariants in 29 ms
[2023-04-06 20:39:54] [INFO ] After 3310ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:241
[2023-04-06 20:39:57] [INFO ] [Nat]Absence check using 17 positive place invariants in 25 ms returned sat
[2023-04-06 20:39:57] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 5 ms returned sat
[2023-04-06 20:40:08] [INFO ] After 9037ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :241
[2023-04-06 20:40:08] [INFO ] State equation strengthened by 676 read => feed constraints.
[2023-04-06 20:40:19] [INFO ] After 11100ms SMT Verify possible using 676 Read/Feed constraints in natural domain returned unsat :0 sat :241
[2023-04-06 20:40:19] [INFO ] After 11101ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :241
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-04-06 20:40:19] [INFO ] After 25019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :241
Fused 241 Parikh solutions to 173 different solutions.
Parikh walk visited 3 properties in 7099 ms.
Support contains 238 out of 712 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 712/712 places, 2816/2816 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 712 transition count 2808
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 704 transition count 2808
Performed 144 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 144 Pre rules applied. Total rules applied 16 place count 704 transition count 2664
Deduced a syphon composed of 144 places in 5 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 2 with 288 rules applied. Total rules applied 304 place count 560 transition count 2664
Discarding 56 places :
Symmetric choice reduction at 2 with 56 rule applications. Total rules 360 place count 504 transition count 2216
Iterating global reduction 2 with 56 rules applied. Total rules applied 416 place count 504 transition count 2216
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 4 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 498 place count 463 transition count 2175
Applied a total of 498 rules in 247 ms. Remains 463 /712 variables (removed 249) and now considering 2175/2816 (removed 641) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 248 ms. Remains : 463/712 places, 2175/2816 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 29479 ms. (steps per millisecond=33 ) properties (out of 238) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 215) 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 215) 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 215) 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 215) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 215) 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 215) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 215) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 215) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 214) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 214) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 214) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 214) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 214) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 214) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 214) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 214) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 214) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 214) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 214) 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 214) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 213) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 213) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 213) 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 213) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 213) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 213) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 213) 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 213) 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 213) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 213) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 213) 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 213) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 213) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 213) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 213) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 213) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 213) 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 213) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 213) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 213) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 213) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 213) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 213) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 213) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 213) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 213) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 213) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 213) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 213) 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 213) 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 213) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 213) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 213) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 213) 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 213) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 213) 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 213) 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 213) 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 213) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 213) 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 213) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 213) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 213) 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 213) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 213) 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 213) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 213) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 213) 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 213) seen :0
Running SMT prover for 213 properties.
[2023-04-06 20:40:59] [INFO ] Flow matrix only has 727 transitions (discarded 1448 similar events)
// Phase 1: matrix 727 rows 463 cols
[2023-04-06 20:40:59] [INFO ] Computed 25 invariants in 4 ms
[2023-04-06 20:41:01] [INFO ] After 1801ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:213
[2023-04-06 20:41:02] [INFO ] [Nat]Absence check using 17 positive place invariants in 14 ms returned sat
[2023-04-06 20:41:02] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2023-04-06 20:41:08] [INFO ] After 4639ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :213
[2023-04-06 20:41:08] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 20:41:14] [INFO ] After 5428ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :213
[2023-04-06 20:41:14] [INFO ] Deduced a trap composed of 3 places in 193 ms of which 4 ms to minimize.
[2023-04-06 20:41:14] [INFO ] Deduced a trap composed of 47 places in 168 ms of which 0 ms to minimize.
[2023-04-06 20:41:14] [INFO ] Deduced a trap composed of 31 places in 147 ms of which 1 ms to minimize.
[2023-04-06 20:41:14] [INFO ] Deduced a trap composed of 3 places in 150 ms of which 1 ms to minimize.
[2023-04-06 20:41:14] [INFO ] Deduced a trap composed of 47 places in 165 ms of which 1 ms to minimize.
[2023-04-06 20:41:15] [INFO ] Deduced a trap composed of 61 places in 125 ms of which 0 ms to minimize.
[2023-04-06 20:41:15] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 1 ms to minimize.
[2023-04-06 20:41:15] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 1 ms to minimize.
[2023-04-06 20:41:15] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 0 ms to minimize.
[2023-04-06 20:41:15] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 0 ms to minimize.
[2023-04-06 20:41:15] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 0 ms to minimize.
[2023-04-06 20:41:15] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 0 ms to minimize.
[2023-04-06 20:41:16] [INFO ] Deduced a trap composed of 51 places in 75 ms of which 0 ms to minimize.
[2023-04-06 20:41:16] [INFO ] Deduced a trap composed of 47 places in 121 ms of which 0 ms to minimize.
[2023-04-06 20:41:16] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 0 ms to minimize.
[2023-04-06 20:41:16] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 0 ms to minimize.
[2023-04-06 20:41:16] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 0 ms to minimize.
[2023-04-06 20:41:16] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 0 ms to minimize.
[2023-04-06 20:41:16] [INFO ] Deduced a trap composed of 51 places in 75 ms of which 1 ms to minimize.
[2023-04-06 20:41:16] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 0 ms to minimize.
[2023-04-06 20:41:17] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 0 ms to minimize.
[2023-04-06 20:41:17] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2023-04-06 20:41:17] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 0 ms to minimize.
[2023-04-06 20:41:17] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 0 ms to minimize.
[2023-04-06 20:41:17] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 0 ms to minimize.
[2023-04-06 20:41:17] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2023-04-06 20:41:17] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 3506 ms
[2023-04-06 20:41:18] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 0 ms to minimize.
[2023-04-06 20:41:19] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 0 ms to minimize.
[2023-04-06 20:41:19] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 0 ms to minimize.
[2023-04-06 20:41:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 326 ms
[2023-04-06 20:41:20] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 1 ms to minimize.
[2023-04-06 20:41:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2023-04-06 20:41:20] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 0 ms to minimize.
[2023-04-06 20:41:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
[2023-04-06 20:41:20] [INFO ] Deduced a trap composed of 49 places in 68 ms of which 1 ms to minimize.
[2023-04-06 20:41:20] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 0 ms to minimize.
[2023-04-06 20:41:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 221 ms
[2023-04-06 20:41:21] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 1 ms to minimize.
[2023-04-06 20:41:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2023-04-06 20:41:21] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 1 ms to minimize.
[2023-04-06 20:41:21] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 0 ms to minimize.
[2023-04-06 20:41:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 257 ms
[2023-04-06 20:41:21] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 1 ms to minimize.
[2023-04-06 20:41:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 152 ms
[2023-04-06 20:41:22] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 0 ms to minimize.
[2023-04-06 20:41:22] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 0 ms to minimize.
[2023-04-06 20:41:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 239 ms
[2023-04-06 20:41:22] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2023-04-06 20:41:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2023-04-06 20:41:22] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 0 ms to minimize.
[2023-04-06 20:41:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2023-04-06 20:41:23] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2023-04-06 20:41:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2023-04-06 20:41:23] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 0 ms to minimize.
[2023-04-06 20:41:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2023-04-06 20:41:23] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 0 ms to minimize.
[2023-04-06 20:41:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2023-04-06 20:41:24] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 1 ms to minimize.
[2023-04-06 20:41:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2023-04-06 20:41:24] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 1 ms to minimize.
[2023-04-06 20:41:24] [INFO ] Deduced a trap composed of 52 places in 55 ms of which 0 ms to minimize.
[2023-04-06 20:41:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 219 ms
[2023-04-06 20:41:24] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 0 ms to minimize.
[2023-04-06 20:41:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2023-04-06 20:41:25] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2023-04-06 20:41:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2023-04-06 20:41:25] [INFO ] Deduced a trap composed of 54 places in 65 ms of which 0 ms to minimize.
[2023-04-06 20:41:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2023-04-06 20:41:27] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2023-04-06 20:41:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2023-04-06 20:41:27] [INFO ] Deduced a trap composed of 55 places in 62 ms of which 1 ms to minimize.
[2023-04-06 20:41:27] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 0 ms to minimize.
[2023-04-06 20:41:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 198 ms
[2023-04-06 20:41:28] [INFO ] Deduced a trap composed of 76 places in 183 ms of which 1 ms to minimize.
[2023-04-06 20:41:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 239 ms
[2023-04-06 20:41:30] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 0 ms to minimize.
[2023-04-06 20:41:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2023-04-06 20:41:30] [INFO ] After 21783ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :213
Attempting to minimize the solution found.
Minimization took 5832 ms.
[2023-04-06 20:41:36] [INFO ] After 35127ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :213
Fused 213 Parikh solutions to 156 different solutions.
Parikh walk visited 0 properties in 1931 ms.
Support contains 213 out of 463 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 463/463 places, 2175/2175 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 30 place count 448 transition count 2160
Applied a total of 30 rules in 115 ms. Remains 448 /463 variables (removed 15) and now considering 2160/2175 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 448/463 places, 2160/2175 transitions.
Interrupted random walk after 986294 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=32 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 213) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 212) 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 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 212) 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 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 212) 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 212) 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 212) 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 212) 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 212) 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 212) 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 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 212) 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 212) 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 212) 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 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 212) 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 212) 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 212) 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 212) 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 212) 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 212) 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 212) 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 212) 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 212) 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 212) 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 212) 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 212) 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 212) 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 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 212) 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 212) 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 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 212) 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 212) 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 212) 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 212) 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 212) 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 212) 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 212) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 212) seen :0
Probabilistic random walk after 10000001 steps, saw 2343167 distinct states, run finished after 90632 ms. (steps per millisecond=110 ) properties seen :204
Running SMT prover for 8 properties.
[2023-04-06 20:43:40] [INFO ] Flow matrix only has 712 transitions (discarded 1448 similar events)
// Phase 1: matrix 712 rows 448 cols
[2023-04-06 20:43:40] [INFO ] Computed 25 invariants in 5 ms
[2023-04-06 20:43:40] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-04-06 20:43:41] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2023-04-06 20:43:41] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2023-04-06 20:43:41] [INFO ] After 300ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-04-06 20:43:41] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 20:43:41] [INFO ] After 244ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-04-06 20:43:41] [INFO ] Deduced a trap composed of 3 places in 115 ms of which 2 ms to minimize.
[2023-04-06 20:43:41] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 0 ms to minimize.
[2023-04-06 20:43:42] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 0 ms to minimize.
[2023-04-06 20:43:42] [INFO ] Deduced a trap composed of 3 places in 96 ms of which 1 ms to minimize.
[2023-04-06 20:43:42] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 0 ms to minimize.
[2023-04-06 20:43:42] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 0 ms to minimize.
[2023-04-06 20:43:42] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 1 ms to minimize.
[2023-04-06 20:43:42] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2023-04-06 20:43:42] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 950 ms
[2023-04-06 20:43:42] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-04-06 20:43:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2023-04-06 20:43:42] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-04-06 20:43:42] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 1 ms to minimize.
[2023-04-06 20:43:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 178 ms
[2023-04-06 20:43:43] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 2 ms to minimize.
[2023-04-06 20:43:43] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 1 ms to minimize.
[2023-04-06 20:43:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 193 ms
[2023-04-06 20:43:43] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2023-04-06 20:43:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2023-04-06 20:43:43] [INFO ] After 1982ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 210 ms.
[2023-04-06 20:43:43] [INFO ] After 2670ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 505 ms.
Support contains 8 out of 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 2160/2160 transitions.
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 56 Pre rules applied. Total rules applied 0 place count 448 transition count 2104
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 0 with 112 rules applied. Total rules applied 112 place count 392 transition count 2104
Applied a total of 112 rules in 74 ms. Remains 392 /448 variables (removed 56) and now considering 2104/2160 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 392/448 places, 2104/2160 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 14903 ms. (steps per millisecond=67 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1731 ms. (steps per millisecond=577 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1779 ms. (steps per millisecond=562 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1704 ms. (steps per millisecond=586 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1643 ms. (steps per millisecond=608 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1672 ms. (steps per millisecond=598 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1683 ms. (steps per millisecond=594 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1647 ms. (steps per millisecond=607 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1680 ms. (steps per millisecond=595 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 10350918 steps, run timeout after 84001 ms. (steps per millisecond=123 ) properties seen :{}
Probabilistic random walk after 10350918 steps, saw 2399608 distinct states, run finished after 84003 ms. (steps per millisecond=123 ) properties seen :0
Running SMT prover for 8 properties.
[2023-04-06 20:45:36] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2023-04-06 20:45:36] [INFO ] Computed 25 invariants in 4 ms
[2023-04-06 20:45:36] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-04-06 20:45:36] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-06 20:45:36] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-06 20:45:37] [INFO ] After 271ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-04-06 20:45:37] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 20:45:37] [INFO ] After 214ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-04-06 20:45:37] [INFO ] Deduced a trap composed of 3 places in 117 ms of which 1 ms to minimize.
[2023-04-06 20:45:37] [INFO ] Deduced a trap composed of 3 places in 112 ms of which 1 ms to minimize.
[2023-04-06 20:45:37] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 1 ms to minimize.
[2023-04-06 20:45:37] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 0 ms to minimize.
[2023-04-06 20:45:37] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 0 ms to minimize.
[2023-04-06 20:45:38] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 0 ms to minimize.
[2023-04-06 20:45:38] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2023-04-06 20:45:38] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 783 ms
[2023-04-06 20:45:38] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 0 ms to minimize.
[2023-04-06 20:45:38] [INFO ] Deduced a trap composed of 50 places in 62 ms of which 0 ms to minimize.
[2023-04-06 20:45:38] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 0 ms to minimize.
[2023-04-06 20:45:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 286 ms
[2023-04-06 20:45:38] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 0 ms to minimize.
[2023-04-06 20:45:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2023-04-06 20:45:38] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 1 ms to minimize.
[2023-04-06 20:45:38] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 0 ms to minimize.
[2023-04-06 20:45:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 174 ms
[2023-04-06 20:45:38] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 0 ms to minimize.
[2023-04-06 20:45:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2023-04-06 20:45:39] [INFO ] After 1856ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 200 ms.
[2023-04-06 20:45:39] [INFO ] After 2481ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 661 ms.
Support contains 8 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 56 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 55 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2023-04-06 20:45:39] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 20:45:39] [INFO ] Invariant cache hit.
[2023-04-06 20:45:40] [INFO ] Implicit Places using invariants in 335 ms returned []
[2023-04-06 20:45:40] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 20:45:40] [INFO ] Invariant cache hit.
[2023-04-06 20:45:40] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 20:45:41] [INFO ] Implicit Places using invariants and state equation in 1572 ms returned []
Implicit Place search using SMT with State Equation took 1909 ms to find 0 implicit places.
[2023-04-06 20:45:42] [INFO ] Redundant transitions in 117 ms returned []
[2023-04-06 20:45:42] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 20:45:42] [INFO ] Invariant cache hit.
[2023-04-06 20:45:42] [INFO ] Dead Transitions using invariants and state equation in 572 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2666 ms. Remains : 392/392 places, 2104/2104 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 1766 ms. (steps per millisecond=56 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-04-06 20:45:44] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 20:45:44] [INFO ] Invariant cache hit.
[2023-04-06 20:45:44] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-06 20:45:44] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 5 ms returned sat
[2023-04-06 20:45:44] [INFO ] After 132ms SMT Verify possible using state equation in real domain returned unsat :0 sat :8
[2023-04-06 20:45:44] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 20:45:44] [INFO ] After 55ms SMT Verify possible using 284 Read/Feed constraints in real domain returned unsat :0 sat :8
[2023-04-06 20:45:44] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 1 ms to minimize.
[2023-04-06 20:45:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 188 ms
[2023-04-06 20:45:45] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 0 ms to minimize.
[2023-04-06 20:45:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 161 ms
[2023-04-06 20:45:45] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 1 ms to minimize.
[2023-04-06 20:45:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2023-04-06 20:45:45] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 1 ms to minimize.
[2023-04-06 20:45:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2023-04-06 20:45:45] [INFO ] After 979ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:8
[2023-04-06 20:45:45] [INFO ] After 1185ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-04-06 20:45:45] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-06 20:45:45] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 7 ms returned sat
[2023-04-06 20:45:45] [INFO ] After 141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-04-06 20:45:45] [INFO ] After 74ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-04-06 20:45:45] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 0 ms to minimize.
[2023-04-06 20:45:46] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 0 ms to minimize.
[2023-04-06 20:45:46] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 0 ms to minimize.
[2023-04-06 20:45:46] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-04-06 20:45:46] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 411 ms
[2023-04-06 20:45:46] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-04-06 20:45:46] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 0 ms to minimize.
[2023-04-06 20:45:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 165 ms
[2023-04-06 20:45:46] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 0 ms to minimize.
[2023-04-06 20:45:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2023-04-06 20:45:46] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 0 ms to minimize.
[2023-04-06 20:45:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2023-04-06 20:45:46] [INFO ] Deduced a trap composed of 50 places in 66 ms of which 1 ms to minimize.
[2023-04-06 20:45:46] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 0 ms to minimize.
[2023-04-06 20:45:47] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2023-04-06 20:45:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 271 ms
[2023-04-06 20:45:47] [INFO ] After 1335ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-04-06 20:45:47] [INFO ] After 1596ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 16427 ms. (steps per millisecond=60 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1991 ms. (steps per millisecond=502 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2055 ms. (steps per millisecond=486 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2001 ms. (steps per millisecond=499 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2017 ms. (steps per millisecond=495 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1942 ms. (steps per millisecond=514 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1827 ms. (steps per millisecond=547 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1985 ms. (steps per millisecond=503 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1906 ms. (steps per millisecond=524 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 11775807 steps, run timeout after 96001 ms. (steps per millisecond=122 ) properties seen :{}
Probabilistic random walk after 11775807 steps, saw 2707233 distinct states, run finished after 96002 ms. (steps per millisecond=122 ) properties seen :0
Running SMT prover for 8 properties.
[2023-04-06 20:47:55] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 20:47:55] [INFO ] Invariant cache hit.
[2023-04-06 20:47:55] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-04-06 20:47:55] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-06 20:47:55] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-06 20:47:55] [INFO ] After 269ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-04-06 20:47:55] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 20:47:56] [INFO ] After 223ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-04-06 20:47:56] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
[2023-04-06 20:47:56] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 0 ms to minimize.
[2023-04-06 20:47:56] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2023-04-06 20:47:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 359 ms
[2023-04-06 20:47:56] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-04-06 20:47:56] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 0 ms to minimize.
[2023-04-06 20:47:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 190 ms
[2023-04-06 20:47:56] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 0 ms to minimize.
[2023-04-06 20:47:56] [INFO ] Deduced a trap composed of 50 places in 72 ms of which 0 ms to minimize.
[2023-04-06 20:47:57] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 0 ms to minimize.
[2023-04-06 20:47:57] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2023-04-06 20:47:57] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 0 ms to minimize.
[2023-04-06 20:47:57] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 488 ms
[2023-04-06 20:47:57] [INFO ] After 1507ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 187 ms.
[2023-04-06 20:47:57] [INFO ] After 2119ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 769 ms.
Support contains 8 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 54 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 70 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2023-04-06 20:47:58] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 20:47:58] [INFO ] Invariant cache hit.
[2023-04-06 20:47:58] [INFO ] Implicit Places using invariants in 326 ms returned []
[2023-04-06 20:47:58] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 20:47:58] [INFO ] Invariant cache hit.
[2023-04-06 20:47:58] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 20:48:00] [INFO ] Implicit Places using invariants and state equation in 1564 ms returned []
Implicit Place search using SMT with State Equation took 1893 ms to find 0 implicit places.
[2023-04-06 20:48:00] [INFO ] Redundant transitions in 130 ms returned []
[2023-04-06 20:48:00] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 20:48:00] [INFO ] Invariant cache hit.
[2023-04-06 20:48:01] [INFO ] Dead Transitions using invariants and state equation in 588 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2686 ms. Remains : 392/392 places, 2104/2104 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 1464 ms. (steps per millisecond=68 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-04-06 20:48:02] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 20:48:02] [INFO ] Invariant cache hit.
[2023-04-06 20:48:02] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2023-04-06 20:48:02] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 6 ms returned sat
[2023-04-06 20:48:02] [INFO ] After 126ms SMT Verify possible using state equation in real domain returned unsat :0 sat :8
[2023-04-06 20:48:02] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 20:48:02] [INFO ] After 52ms SMT Verify possible using 284 Read/Feed constraints in real domain returned unsat :0 sat :8
[2023-04-06 20:48:02] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 1 ms to minimize.
[2023-04-06 20:48:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2023-04-06 20:48:03] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 1 ms to minimize.
[2023-04-06 20:48:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 167 ms
[2023-04-06 20:48:03] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 0 ms to minimize.
[2023-04-06 20:48:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
[2023-04-06 20:48:03] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 0 ms to minimize.
[2023-04-06 20:48:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2023-04-06 20:48:03] [INFO ] After 936ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:8
[2023-04-06 20:48:03] [INFO ] After 1132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-04-06 20:48:03] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-06 20:48:03] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-06 20:48:03] [INFO ] After 129ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-04-06 20:48:03] [INFO ] After 75ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-04-06 20:48:04] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 0 ms to minimize.
[2023-04-06 20:48:04] [INFO ] Deduced a trap composed of 38 places in 91 ms of which 0 ms to minimize.
[2023-04-06 20:48:04] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 1 ms to minimize.
[2023-04-06 20:48:04] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-04-06 20:48:04] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 423 ms
[2023-04-06 20:48:04] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2023-04-06 20:48:04] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 1 ms to minimize.
[2023-04-06 20:48:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 163 ms
[2023-04-06 20:48:04] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 0 ms to minimize.
[2023-04-06 20:48:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2023-04-06 20:48:04] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 0 ms to minimize.
[2023-04-06 20:48:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2023-04-06 20:48:04] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 1 ms to minimize.
[2023-04-06 20:48:04] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2023-04-06 20:48:05] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 0 ms to minimize.
[2023-04-06 20:48:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 254 ms
[2023-04-06 20:48:05] [INFO ] After 1320ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-04-06 20:48:05] [INFO ] After 1550ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) 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 595485 steps, run timeout after 3001 ms. (steps per millisecond=198 ) properties seen :{}
Probabilistic random walk after 595485 steps, saw 308300 distinct states, run finished after 3001 ms. (steps per millisecond=198 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 20:48:08] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 20:48:08] [INFO ] Invariant cache hit.
[2023-04-06 20:48:08] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:48:08] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-06 20:48:08] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-06 20:48:08] [INFO ] After 142ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:48:08] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 20:48:08] [INFO ] After 66ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:48:08] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2023-04-06 20:48:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2023-04-06 20:48:08] [INFO ] After 176ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-04-06 20:48:08] [INFO ] After 417ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 68 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 392/392 places, 2104/2104 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) 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 599328 steps, run timeout after 3001 ms. (steps per millisecond=199 ) properties seen :{}
Probabilistic random walk after 599328 steps, saw 310492 distinct states, run finished after 3002 ms. (steps per millisecond=199 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 20:48:11] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 20:48:11] [INFO ] Invariant cache hit.
[2023-04-06 20:48:11] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:48:11] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2023-04-06 20:48:11] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 2 ms returned sat
[2023-04-06 20:48:12] [INFO ] After 129ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:48:12] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 20:48:12] [INFO ] After 67ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:48:12] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2023-04-06 20:48:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2023-04-06 20:48:12] [INFO ] After 175ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-04-06 20:48:12] [INFO ] After 401ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 57 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 56 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2023-04-06 20:48:12] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 20:48:12] [INFO ] Invariant cache hit.
[2023-04-06 20:48:12] [INFO ] Implicit Places using invariants in 327 ms returned []
[2023-04-06 20:48:12] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 20:48:12] [INFO ] Invariant cache hit.
[2023-04-06 20:48:12] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 20:48:14] [INFO ] Implicit Places using invariants and state equation in 1614 ms returned []
Implicit Place search using SMT with State Equation took 1942 ms to find 0 implicit places.
[2023-04-06 20:48:14] [INFO ] Redundant transitions in 46 ms returned []
[2023-04-06 20:48:14] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 20:48:14] [INFO ] Invariant cache hit.
[2023-04-06 20:48:15] [INFO ] Dead Transitions using invariants and state equation in 588 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2638 ms. Remains : 392/392 places, 2104/2104 transitions.
Graph (trivial) has 1938 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 4 ms
Free SCC test removed 56 places
Drop transitions removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 336 transition count 410
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 157 place count 258 transition count 410
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 157 place count 258 transition count 393
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 199 place count 233 transition count 393
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 421 place count 122 transition count 282
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 2 with 54 rules applied. Total rules applied 475 place count 122 transition count 228
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 491 place count 114 transition count 228
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 499 place count 114 transition count 220
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 508 place count 114 transition count 211
Free-agglomeration rule applied 57 times.
Iterating global reduction 4 with 57 rules applied. Total rules applied 565 place count 114 transition count 154
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 4 with 57 rules applied. Total rules applied 622 place count 57 transition count 154
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 630 place count 57 transition count 154
Applied a total of 630 rules in 45 ms. Remains 57 /392 variables (removed 335) and now considering 154/2104 (removed 1950) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 154 rows 57 cols
[2023-04-06 20:48:15] [INFO ] Computed 17 invariants in 0 ms
[2023-04-06 20:48:15] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:48:15] [INFO ] [Nat]Absence check using 17 positive place invariants in 2 ms returned sat
[2023-04-06 20:48:15] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:48:15] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-06 20:48:15] [INFO ] After 3ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:48:15] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-04-06 20:48:15] [INFO ] After 62ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) 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 596484 steps, run timeout after 3001 ms. (steps per millisecond=198 ) properties seen :{}
Probabilistic random walk after 596484 steps, saw 308822 distinct states, run finished after 3001 ms. (steps per millisecond=198 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 20:48:18] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2023-04-06 20:48:18] [INFO ] Computed 25 invariants in 6 ms
[2023-04-06 20:48:18] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:48:18] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-06 20:48:18] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-06 20:48:18] [INFO ] After 136ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:48:18] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 20:48:18] [INFO ] After 59ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:48:18] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-04-06 20:48:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2023-04-06 20:48:18] [INFO ] After 164ms 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-06 20:48:18] [INFO ] After 401ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 58 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 392/392 places, 2104/2104 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 584586 steps, run timeout after 3001 ms. (steps per millisecond=194 ) properties seen :{}
Probabilistic random walk after 584586 steps, saw 303754 distinct states, run finished after 3001 ms. (steps per millisecond=194 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 20:48:21] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 20:48:21] [INFO ] Invariant cache hit.
[2023-04-06 20:48:21] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:48:21] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2023-04-06 20:48:21] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 2 ms returned sat
[2023-04-06 20:48:21] [INFO ] After 139ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:48:21] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 20:48:22] [INFO ] After 55ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:48:22] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2023-04-06 20:48:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2023-04-06 20:48:22] [INFO ] After 168ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-04-06 20:48:22] [INFO ] After 395ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 87 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 80 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2023-04-06 20:48:22] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 20:48:22] [INFO ] Invariant cache hit.
[2023-04-06 20:48:22] [INFO ] Implicit Places using invariants in 334 ms returned []
[2023-04-06 20:48:22] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 20:48:22] [INFO ] Invariant cache hit.
[2023-04-06 20:48:22] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 20:48:24] [INFO ] Implicit Places using invariants and state equation in 1589 ms returned []
Implicit Place search using SMT with State Equation took 1924 ms to find 0 implicit places.
[2023-04-06 20:48:24] [INFO ] Redundant transitions in 48 ms returned []
[2023-04-06 20:48:24] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 20:48:24] [INFO ] Invariant cache hit.
[2023-04-06 20:48:24] [INFO ] Dead Transitions using invariants and state equation in 584 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2648 ms. Remains : 392/392 places, 2104/2104 transitions.
Graph (trivial) has 1958 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 1 ms
Free SCC test removed 56 places
Drop transitions removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 336 transition count 409
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 159 place count 257 transition count 409
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 159 place count 257 transition count 392
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 201 place count 232 transition count 392
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 423 place count 121 transition count 281
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 2 with 56 rules applied. Total rules applied 479 place count 121 transition count 225
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 495 place count 113 transition count 225
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 503 place count 113 transition count 217
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 511 place count 113 transition count 209
Free-agglomeration rule applied 56 times.
Iterating global reduction 4 with 56 rules applied. Total rules applied 567 place count 113 transition count 153
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 4 with 56 rules applied. Total rules applied 623 place count 57 transition count 153
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 631 place count 57 transition count 153
Applied a total of 631 rules in 33 ms. Remains 57 /392 variables (removed 335) and now considering 153/2104 (removed 1951) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 153 rows 57 cols
[2023-04-06 20:48:24] [INFO ] Computed 17 invariants in 1 ms
[2023-04-06 20:48:24] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:48:24] [INFO ] [Nat]Absence check using 17 positive place invariants in 2 ms returned sat
[2023-04-06 20:48:25] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:48:25] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-06 20:48:25] [INFO ] After 3ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:48:25] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-04-06 20:48:25] [INFO ] After 62ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 595440 steps, run timeout after 3001 ms. (steps per millisecond=198 ) properties seen :{}
Probabilistic random walk after 595440 steps, saw 308272 distinct states, run finished after 3002 ms. (steps per millisecond=198 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 20:48:28] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2023-04-06 20:48:28] [INFO ] Computed 25 invariants in 8 ms
[2023-04-06 20:48:28] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:48:28] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-06 20:48:28] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 2 ms returned sat
[2023-04-06 20:48:28] [INFO ] After 128ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:48:28] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 20:48:28] [INFO ] After 50ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:48:28] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-04-06 20:48:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2023-04-06 20:48:28] [INFO ] After 147ms 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-06 20:48:28] [INFO ] After 370ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 53 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 392/392 places, 2104/2104 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 602613 steps, run timeout after 3001 ms. (steps per millisecond=200 ) properties seen :{}
Probabilistic random walk after 602613 steps, saw 312014 distinct states, run finished after 3001 ms. (steps per millisecond=200 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 20:48:31] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 20:48:31] [INFO ] Invariant cache hit.
[2023-04-06 20:48:31] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:48:31] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2023-04-06 20:48:31] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 2 ms returned sat
[2023-04-06 20:48:31] [INFO ] After 136ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:48:31] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 20:48:31] [INFO ] After 55ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:48:31] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-04-06 20:48:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2023-04-06 20:48:32] [INFO ] After 145ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-04-06 20:48:32] [INFO ] After 382ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 54 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 53 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2023-04-06 20:48:32] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 20:48:32] [INFO ] Invariant cache hit.
[2023-04-06 20:48:32] [INFO ] Implicit Places using invariants in 326 ms returned []
[2023-04-06 20:48:32] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 20:48:32] [INFO ] Invariant cache hit.
[2023-04-06 20:48:32] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 20:48:34] [INFO ] Implicit Places using invariants and state equation in 1558 ms returned []
Implicit Place search using SMT with State Equation took 1886 ms to find 0 implicit places.
[2023-04-06 20:48:34] [INFO ] Redundant transitions in 45 ms returned []
[2023-04-06 20:48:34] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 20:48:34] [INFO ] Invariant cache hit.
[2023-04-06 20:48:34] [INFO ] Dead Transitions using invariants and state equation in 580 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2571 ms. Remains : 392/392 places, 2104/2104 transitions.
Graph (trivial) has 1958 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 1 ms
Free SCC test removed 56 places
Drop transitions removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 336 transition count 409
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 159 place count 257 transition count 409
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 159 place count 257 transition count 392
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 201 place count 232 transition count 392
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 423 place count 121 transition count 281
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 2 with 56 rules applied. Total rules applied 479 place count 121 transition count 225
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 495 place count 113 transition count 225
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 503 place count 113 transition count 217
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 511 place count 113 transition count 209
Free-agglomeration rule applied 56 times.
Iterating global reduction 4 with 56 rules applied. Total rules applied 567 place count 113 transition count 153
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 4 with 56 rules applied. Total rules applied 623 place count 57 transition count 153
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 631 place count 57 transition count 153
Applied a total of 631 rules in 22 ms. Remains 57 /392 variables (removed 335) and now considering 153/2104 (removed 1951) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 153 rows 57 cols
[2023-04-06 20:48:34] [INFO ] Computed 17 invariants in 1 ms
[2023-04-06 20:48:34] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:48:34] [INFO ] [Nat]Absence check using 17 positive place invariants in 2 ms returned sat
[2023-04-06 20:48:34] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:48:34] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-06 20:48:34] [INFO ] After 4ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:48:34] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-04-06 20:48:34] [INFO ] After 66ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) 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 598995 steps, run timeout after 3001 ms. (steps per millisecond=199 ) properties seen :{}
Probabilistic random walk after 598995 steps, saw 310278 distinct states, run finished after 3001 ms. (steps per millisecond=199 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 20:48:37] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2023-04-06 20:48:37] [INFO ] Computed 25 invariants in 6 ms
[2023-04-06 20:48:37] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:48:37] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-06 20:48:37] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-06 20:48:38] [INFO ] After 139ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:48:38] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 20:48:38] [INFO ] After 54ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:48:38] [INFO ] After 88ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-04-06 20:48:38] [INFO ] After 323ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 52 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 392/392 places, 2104/2104 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) 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 600390 steps, run timeout after 3001 ms. (steps per millisecond=200 ) properties seen :{}
Probabilistic random walk after 600390 steps, saw 310819 distinct states, run finished after 3001 ms. (steps per millisecond=200 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 20:48:41] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 20:48:41] [INFO ] Invariant cache hit.
[2023-04-06 20:48:41] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:48:41] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-06 20:48:41] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 2 ms returned sat
[2023-04-06 20:48:41] [INFO ] After 136ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:48:41] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 20:48:41] [INFO ] After 48ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:48:41] [INFO ] After 82ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-04-06 20:48:41] [INFO ] After 324ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 55 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 52 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2023-04-06 20:48:41] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 20:48:41] [INFO ] Invariant cache hit.
[2023-04-06 20:48:42] [INFO ] Implicit Places using invariants in 336 ms returned []
[2023-04-06 20:48:42] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 20:48:42] [INFO ] Invariant cache hit.
[2023-04-06 20:48:42] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 20:48:43] [INFO ] Implicit Places using invariants and state equation in 1636 ms returned []
Implicit Place search using SMT with State Equation took 1979 ms to find 0 implicit places.
[2023-04-06 20:48:43] [INFO ] Redundant transitions in 43 ms returned []
[2023-04-06 20:48:43] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 20:48:43] [INFO ] Invariant cache hit.
[2023-04-06 20:48:44] [INFO ] Dead Transitions using invariants and state equation in 574 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2654 ms. Remains : 392/392 places, 2104/2104 transitions.
Graph (trivial) has 1958 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 0 ms
Free SCC test removed 56 places
Drop transitions removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 336 transition count 409
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 159 place count 257 transition count 409
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 159 place count 257 transition count 392
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 201 place count 232 transition count 392
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 423 place count 121 transition count 281
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 2 with 56 rules applied. Total rules applied 479 place count 121 transition count 225
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 495 place count 113 transition count 225
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 503 place count 113 transition count 217
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 511 place count 113 transition count 209
Free-agglomeration rule applied 56 times.
Iterating global reduction 4 with 56 rules applied. Total rules applied 567 place count 113 transition count 153
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 4 with 56 rules applied. Total rules applied 623 place count 57 transition count 153
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 631 place count 57 transition count 153
Applied a total of 631 rules in 21 ms. Remains 57 /392 variables (removed 335) and now considering 153/2104 (removed 1951) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 153 rows 57 cols
[2023-04-06 20:48:44] [INFO ] Computed 17 invariants in 1 ms
[2023-04-06 20:48:44] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:48:44] [INFO ] [Nat]Absence check using 17 positive place invariants in 2 ms returned sat
[2023-04-06 20:48:44] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:48:44] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-06 20:48:44] [INFO ] After 4ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:48:44] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-04-06 20:48:44] [INFO ] After 63ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
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 597285 steps, run timeout after 3001 ms. (steps per millisecond=199 ) properties seen :{}
Probabilistic random walk after 597285 steps, saw 309226 distinct states, run finished after 3001 ms. (steps per millisecond=199 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 20:48:47] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2023-04-06 20:48:47] [INFO ] Computed 25 invariants in 8 ms
[2023-04-06 20:48:47] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:48:47] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-06 20:48:47] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-06 20:48:47] [INFO ] After 137ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:48:47] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 20:48:47] [INFO ] After 48ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:48:47] [INFO ] After 83ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-04-06 20:48:47] [INFO ] After 312ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 55 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 392/392 places, 2104/2104 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) 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 599247 steps, run timeout after 3001 ms. (steps per millisecond=199 ) properties seen :{}
Probabilistic random walk after 599247 steps, saw 310450 distinct states, run finished after 3001 ms. (steps per millisecond=199 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 20:48:50] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 20:48:50] [INFO ] Invariant cache hit.
[2023-04-06 20:48:51] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:48:51] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-06 20:48:51] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-06 20:48:51] [INFO ] After 140ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:48:51] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 20:48:51] [INFO ] After 56ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:48:51] [INFO ] After 88ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-04-06 20:48:51] [INFO ] After 333ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 54 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 52 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2023-04-06 20:48:51] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 20:48:51] [INFO ] Invariant cache hit.
[2023-04-06 20:48:51] [INFO ] Implicit Places using invariants in 336 ms returned []
[2023-04-06 20:48:51] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 20:48:51] [INFO ] Invariant cache hit.
[2023-04-06 20:48:52] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 20:48:53] [INFO ] Implicit Places using invariants and state equation in 1608 ms returned []
Implicit Place search using SMT with State Equation took 1946 ms to find 0 implicit places.
[2023-04-06 20:48:53] [INFO ] Redundant transitions in 48 ms returned []
[2023-04-06 20:48:53] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 20:48:53] [INFO ] Invariant cache hit.
[2023-04-06 20:48:54] [INFO ] Dead Transitions using invariants and state equation in 574 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2631 ms. Remains : 392/392 places, 2104/2104 transitions.
Graph (trivial) has 1958 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 0 ms
Free SCC test removed 56 places
Drop transitions removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 336 transition count 409
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 159 place count 257 transition count 409
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 159 place count 257 transition count 392
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 201 place count 232 transition count 392
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 423 place count 121 transition count 281
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 2 with 56 rules applied. Total rules applied 479 place count 121 transition count 225
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 495 place count 113 transition count 225
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 503 place count 113 transition count 217
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 511 place count 113 transition count 209
Free-agglomeration rule applied 56 times.
Iterating global reduction 4 with 56 rules applied. Total rules applied 567 place count 113 transition count 153
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 4 with 56 rules applied. Total rules applied 623 place count 57 transition count 153
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 631 place count 57 transition count 153
Applied a total of 631 rules in 19 ms. Remains 57 /392 variables (removed 335) and now considering 153/2104 (removed 1951) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 153 rows 57 cols
[2023-04-06 20:48:54] [INFO ] Computed 17 invariants in 1 ms
[2023-04-06 20:48:54] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:48:54] [INFO ] [Nat]Absence check using 17 positive place invariants in 2 ms returned sat
[2023-04-06 20:48:54] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:48:54] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-06 20:48:54] [INFO ] After 4ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:48:54] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-04-06 20:48:54] [INFO ] After 63ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) 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 598734 steps, run timeout after 3001 ms. (steps per millisecond=199 ) properties seen :{}
Probabilistic random walk after 598734 steps, saw 310076 distinct states, run finished after 3001 ms. (steps per millisecond=199 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 20:48:57] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2023-04-06 20:48:57] [INFO ] Computed 25 invariants in 6 ms
[2023-04-06 20:48:57] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:48:57] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-06 20:48:57] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 8 ms returned sat
[2023-04-06 20:48:57] [INFO ] After 141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:48:57] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 20:48:57] [INFO ] After 58ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:48:57] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2023-04-06 20:48:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2023-04-06 20:48:57] [INFO ] After 158ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-04-06 20:48:57] [INFO ] After 400ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 52 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 392/392 places, 2104/2104 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 595458 steps, run timeout after 3001 ms. (steps per millisecond=198 ) properties seen :{}
Probabilistic random walk after 595458 steps, saw 308281 distinct states, run finished after 3001 ms. (steps per millisecond=198 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 20:49:00] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 20:49:00] [INFO ] Invariant cache hit.
[2023-04-06 20:49:00] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:49:00] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-06 20:49:00] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-06 20:49:01] [INFO ] After 150ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:49:01] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 20:49:01] [INFO ] After 50ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:49:01] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2023-04-06 20:49:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2023-04-06 20:49:01] [INFO ] After 149ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-04-06 20:49:01] [INFO ] After 387ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 54 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 51 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2023-04-06 20:49:01] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 20:49:01] [INFO ] Invariant cache hit.
[2023-04-06 20:49:01] [INFO ] Implicit Places using invariants in 333 ms returned []
[2023-04-06 20:49:01] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 20:49:01] [INFO ] Invariant cache hit.
[2023-04-06 20:49:01] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 20:49:03] [INFO ] Implicit Places using invariants and state equation in 1565 ms returned []
Implicit Place search using SMT with State Equation took 1902 ms to find 0 implicit places.
[2023-04-06 20:49:03] [INFO ] Redundant transitions in 46 ms returned []
[2023-04-06 20:49:03] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 20:49:03] [INFO ] Invariant cache hit.
[2023-04-06 20:49:03] [INFO ] Dead Transitions using invariants and state equation in 583 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2588 ms. Remains : 392/392 places, 2104/2104 transitions.
Graph (trivial) has 1958 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 1 ms
Free SCC test removed 56 places
Drop transitions removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 336 transition count 409
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 159 place count 257 transition count 409
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 159 place count 257 transition count 392
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 201 place count 232 transition count 392
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 423 place count 121 transition count 281
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 2 with 56 rules applied. Total rules applied 479 place count 121 transition count 225
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 495 place count 113 transition count 225
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 503 place count 113 transition count 217
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 511 place count 113 transition count 209
Free-agglomeration rule applied 56 times.
Iterating global reduction 4 with 56 rules applied. Total rules applied 567 place count 113 transition count 153
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 4 with 56 rules applied. Total rules applied 623 place count 57 transition count 153
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 631 place count 57 transition count 153
Applied a total of 631 rules in 17 ms. Remains 57 /392 variables (removed 335) and now considering 153/2104 (removed 1951) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 153 rows 57 cols
[2023-04-06 20:49:03] [INFO ] Computed 17 invariants in 1 ms
[2023-04-06 20:49:03] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:49:03] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2023-04-06 20:49:03] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:49:03] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-06 20:49:03] [INFO ] After 9ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:49:03] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-04-06 20:49:03] [INFO ] After 72ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) 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 597402 steps, run timeout after 3001 ms. (steps per millisecond=199 ) properties seen :{}
Probabilistic random walk after 597402 steps, saw 309298 distinct states, run finished after 3001 ms. (steps per millisecond=199 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 20:49:06] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2023-04-06 20:49:06] [INFO ] Computed 25 invariants in 7 ms
[2023-04-06 20:49:07] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:49:07] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-06 20:49:07] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-06 20:49:07] [INFO ] After 137ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:49:07] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 20:49:07] [INFO ] After 56ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:49:07] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2023-04-06 20:49:07] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-04-06 20:49:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 169 ms
[2023-04-06 20:49:07] [INFO ] After 242ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-04-06 20:49:07] [INFO ] After 474ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 54 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 392/392 places, 2104/2104 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 600012 steps, run timeout after 3001 ms. (steps per millisecond=199 ) properties seen :{}
Probabilistic random walk after 600012 steps, saw 310698 distinct states, run finished after 3001 ms. (steps per millisecond=199 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 20:49:10] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 20:49:10] [INFO ] Invariant cache hit.
[2023-04-06 20:49:10] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:49:10] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-06 20:49:10] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-06 20:49:10] [INFO ] After 140ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:49:10] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 20:49:10] [INFO ] After 56ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:49:11] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2023-04-06 20:49:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2023-04-06 20:49:11] [INFO ] After 154ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-04-06 20:49:11] [INFO ] After 389ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 54 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 51 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2023-04-06 20:49:11] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 20:49:11] [INFO ] Invariant cache hit.
[2023-04-06 20:49:11] [INFO ] Implicit Places using invariants in 328 ms returned []
[2023-04-06 20:49:11] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 20:49:11] [INFO ] Invariant cache hit.
[2023-04-06 20:49:11] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 20:49:13] [INFO ] Implicit Places using invariants and state equation in 1524 ms returned []
Implicit Place search using SMT with State Equation took 1853 ms to find 0 implicit places.
[2023-04-06 20:49:13] [INFO ] Redundant transitions in 46 ms returned []
[2023-04-06 20:49:13] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 20:49:13] [INFO ] Invariant cache hit.
[2023-04-06 20:49:13] [INFO ] Dead Transitions using invariants and state equation in 576 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2533 ms. Remains : 392/392 places, 2104/2104 transitions.
Graph (trivial) has 1958 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 1 ms
Free SCC test removed 56 places
Drop transitions removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 336 transition count 409
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 159 place count 257 transition count 409
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 159 place count 257 transition count 392
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 201 place count 232 transition count 392
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 423 place count 121 transition count 281
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 2 with 56 rules applied. Total rules applied 479 place count 121 transition count 225
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 495 place count 113 transition count 225
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 503 place count 113 transition count 217
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 511 place count 113 transition count 209
Free-agglomeration rule applied 56 times.
Iterating global reduction 4 with 56 rules applied. Total rules applied 567 place count 113 transition count 153
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 4 with 56 rules applied. Total rules applied 623 place count 57 transition count 153
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 631 place count 57 transition count 153
Applied a total of 631 rules in 22 ms. Remains 57 /392 variables (removed 335) and now considering 153/2104 (removed 1951) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 153 rows 57 cols
[2023-04-06 20:49:13] [INFO ] Computed 17 invariants in 1 ms
[2023-04-06 20:49:13] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:49:13] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2023-04-06 20:49:13] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:49:13] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-06 20:49:13] [INFO ] After 4ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:49:13] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-04-06 20:49:13] [INFO ] After 72ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 600804 steps, run timeout after 3001 ms. (steps per millisecond=200 ) properties seen :{}
Probabilistic random walk after 600804 steps, saw 310991 distinct states, run finished after 3001 ms. (steps per millisecond=200 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 20:49:16] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2023-04-06 20:49:16] [INFO ] Computed 25 invariants in 5 ms
[2023-04-06 20:49:16] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:49:16] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-06 20:49:16] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-06 20:49:17] [INFO ] After 137ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:49:17] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 20:49:17] [INFO ] After 47ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:49:17] [INFO ] After 83ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-04-06 20:49:17] [INFO ] After 320ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 58 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 392/392 places, 2104/2104 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) 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 600642 steps, run timeout after 3001 ms. (steps per millisecond=200 ) properties seen :{}
Probabilistic random walk after 600642 steps, saw 310910 distinct states, run finished after 3001 ms. (steps per millisecond=200 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 20:49:20] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 20:49:20] [INFO ] Invariant cache hit.
[2023-04-06 20:49:20] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:49:20] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-06 20:49:20] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2023-04-06 20:49:20] [INFO ] After 132ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:49:20] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 20:49:20] [INFO ] After 50ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:49:20] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-04-06 20:49:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2023-04-06 20:49:20] [INFO ] After 151ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-04-06 20:49:20] [INFO ] After 385ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 54 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 53 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2023-04-06 20:49:20] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 20:49:20] [INFO ] Invariant cache hit.
[2023-04-06 20:49:21] [INFO ] Implicit Places using invariants in 333 ms returned []
[2023-04-06 20:49:21] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 20:49:21] [INFO ] Invariant cache hit.
[2023-04-06 20:49:21] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 20:49:22] [INFO ] Implicit Places using invariants and state equation in 1573 ms returned []
Implicit Place search using SMT with State Equation took 1907 ms to find 0 implicit places.
[2023-04-06 20:49:22] [INFO ] Redundant transitions in 46 ms returned []
[2023-04-06 20:49:22] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 20:49:22] [INFO ] Invariant cache hit.
[2023-04-06 20:49:23] [INFO ] Dead Transitions using invariants and state equation in 566 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2580 ms. Remains : 392/392 places, 2104/2104 transitions.
Graph (trivial) has 1958 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 0 ms
Free SCC test removed 56 places
Drop transitions removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 336 transition count 409
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 159 place count 257 transition count 409
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 159 place count 257 transition count 392
Deduced a syphon composed of 17 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 201 place count 232 transition count 392
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 423 place count 121 transition count 281
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 2 with 56 rules applied. Total rules applied 479 place count 121 transition count 225
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 495 place count 113 transition count 225
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 503 place count 113 transition count 217
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 511 place count 113 transition count 209
Free-agglomeration rule applied 56 times.
Iterating global reduction 4 with 56 rules applied. Total rules applied 567 place count 113 transition count 153
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 4 with 56 rules applied. Total rules applied 623 place count 57 transition count 153
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 631 place count 57 transition count 153
Applied a total of 631 rules in 30 ms. Remains 57 /392 variables (removed 335) and now considering 153/2104 (removed 1951) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 153 rows 57 cols
[2023-04-06 20:49:23] [INFO ] Computed 17 invariants in 1 ms
[2023-04-06 20:49:23] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:49:23] [INFO ] [Nat]Absence check using 17 positive place invariants in 2 ms returned sat
[2023-04-06 20:49:23] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:49:23] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-06 20:49:23] [INFO ] After 3ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:49:23] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-04-06 20:49:23] [INFO ] After 61ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Graph (trivial) has 1924 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 1 ms
Free SCC test removed 56 places
Drop transitions removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 336 transition count 410
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 157 place count 258 transition count 410
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 157 place count 258 transition count 393
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 199 place count 233 transition count 393
Performed 104 Post agglomeration using F-continuation condition.Transition count delta: 104
Deduced a syphon composed of 104 places in 0 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 2 with 208 rules applied. Total rules applied 407 place count 129 transition count 289
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 2 with 54 rules applied. Total rules applied 461 place count 129 transition count 235
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 477 place count 121 transition count 235
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 485 place count 121 transition count 227
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 494 place count 121 transition count 218
Free-agglomeration rule applied 57 times.
Iterating global reduction 4 with 57 rules applied. Total rules applied 551 place count 121 transition count 161
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 4 with 57 rules applied. Total rules applied 608 place count 64 transition count 161
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 616 place count 64 transition count 161
Applied a total of 616 rules in 17 ms. Remains 64 /392 variables (removed 328) and now considering 161/2104 (removed 1943) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 161 rows 64 cols
[2023-04-06 20:49:23] [INFO ] Computed 17 invariants in 2 ms
[2023-04-06 20:49:23] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-04-06 20:49:23] [INFO ] [Nat]Absence check using 17 positive place invariants in 2 ms returned sat
[2023-04-06 20:49:23] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-04-06 20:49:23] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-06 20:49:23] [INFO ] After 40ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-04-06 20:49:23] [INFO ] After 92ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-04-06 20:49:23] [INFO ] After 224ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Unable to solve all queries for examination StableMarking. Remains :8 assertions to prove.
No /home/mcc/execution/StableMarking.xml examination file found. Proceeding without properties.
Parsed 8 properties from file /home/mcc/execution/StableMarking.xml in 0 ms.
Working with output stream class java.io.PrintStream
Total runtime 573446 ms.
starting LoLA
BK_INPUT EisenbergMcGuire-PT-08
BK_EXAMINATION: StableMarking
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution
GlobalProperty: StableMarking
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393232 kB
MemFree: 12501576 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16123392 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -timeout 180 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/model.pnml
lola: STATE EQUATION TRIES PLACE p19_7_1
sara: try reading problem file stateEquationProblem-ConstantPlace-577.sara.
lola: LAUNCH SYMM
sara: place or transition ordering is non-deterministic
lola: reporting
lola: not produced: 295
lola: find path: 27
lola: goal oriented search: 390
lola: reporting
lola: not produced: 276
lola: find path: 46
lola: goal oriented search: 390
lola: reporting
lola: not produced: 268
lola: find path: 54
lola: goal oriented search: 390
lola: reporting
lola: not produced: 265
lola: find path: 57
lola: goal oriented search: 390
lola: reporting
lola: not produced: 249
lola: find path: 73
lola: goal oriented search: 390
lola: reporting
lola: not produced: 248
lola: find path: 74
lola: goal oriented search: 390
lola: reporting
lola: not produced: 245
lola: find path: 77
lola: goal oriented search: 390
lola: reporting
lola: not produced: 239
lola: find path: 83
lola: goal oriented search: 390
lola: reporting
lola: not produced: 237
lola: find path: 85
lola: goal oriented search: 390
lola: reporting
lola: not produced: 229
lola: find path: 93
lola: goal oriented search: 390
lola: reporting
lola: not produced: 229
lola: find path: 93
lola: goal oriented search: 390
lola: reporting
lola: not produced: 221
lola: find path: 101
lola: goal oriented search: 390
lola: reporting
lola: not produced: 221
lola: find path: 101
lola: goal oriented search: 390
lola: reporting
lola: not produced: 216
lola: find path: 106
lola: goal oriented search: 390
lola: reporting
lola: not produced: 215
lola: find path: 107
lola: goal oriented search: 390
lola: reporting
lola: not produced: 212
lola: find path: 110
lola: goal oriented search: 390
lola: reporting
lola: not produced: 210
lola: find path: 112
lola: goal oriented search: 390
lola: reporting
lola: not produced: 64
lola: find path: 114
lola: goal oriented search: 534
lola: reporting
lola: not produced: 63
lola: find path: 115
lola: goal oriented search: 534
lola: reporting
lola: not produced: 61
lola: find path: 117
lola: goal oriented search: 534
lola: reporting
lola: not produced: 59
lola: find path: 119
lola: goal oriented search: 534
lola: reporting
lola: not produced: 50
lola: find path: 128
lola: goal oriented search: 534
lola: reporting
lola: not produced: 50
lola: find path: 128
lola: goal oriented search: 534
lola: reporting
lola: not produced: 46
lola: find path: 132
lola: goal oriented search: 534
lola: reporting
lola: not produced: 46
lola: find path: 132
lola: goal oriented search: 534
lola: reporting
lola: not produced: 45
lola: find path: 133
lola: goal oriented search: 534
lola: reporting
lola: not produced: 45
lola: find path: 133
lola: goal oriented search: 534
lola: reporting
lola: not produced: 45
lola: find path: 133
lola: goal oriented search: 534
lola: reporting
lola: not produced: 45
lola: find path: 133
lola: goal oriented search: 534
lola: reporting
lola: not produced: 45
lola: find path: 133
lola: goal oriented search: 534
lola: reporting
lola: not produced: 44
lola: find path: 134
lola: goal oriented search: 534
lola: reporting
lola: not produced: 42
lola: find path: 136
lola: goal oriented search: 534
lola: reporting
lola: not produced: 40
lola: find path: 138
lola: goal oriented search: 534
lola: reporting
lola: not produced: 39
lola: find path: 139
lola: goal oriented search: 534
lola: reporting
lola: not produced: 39
lola: find path: 139
lola: goal oriented search: 534
lola: reporting
lola: not produced: 39
lola: find path: 139
lola: goal oriented search: 534
lola: reporting
lola: not produced: 39
lola: find path: 139
lola: goal oriented search: 534
lola: reporting
lola: not produced: 39
lola: find path: 139
lola: goal oriented search: 534
lola: reporting
lola: not produced: 39
lola: find path: 139
lola: goal oriented search: 534
lola: reporting
lola: not produced: 39
lola: find path: 139
lola: goal oriented search: 534
lola: reporting
lola: not produced: 39
lola: find path: 139
lola: goal oriented search: 534
lola: reporting
lola: not produced: 39
lola: find path: 139
lola: goal oriented search: 534
lola: reporting
lola: not produced: 39
lola: find path: 139
lola: goal oriented search: 534
lola: reporting
lola: not produced: 39
lola: find path: 139
lola: goal oriented search: 534
lola: reporting
lola: not produced: 39
lola: find path: 139
lola: goal oriented search: 534
lola: reporting
lola: not produced: 39
lola: find path: 139
lola: goal oriented search: 534
lola: reporting
lola: not produced: 39
lola: find path: 139
lola: goal oriented search: 534
lola: reporting
lola: not produced: 39
lola: find path: 139
lola: goal oriented search: 534
lola: reporting
lola: not produced: 39
lola: find path: 139
lola: goal oriented search: 534
lola: reporting
lola: not produced: 39
lola: find path: 139
lola: goal oriented search: 534
lola: reporting
lola: not produced: 39
lola: find path: 139
lola: goal oriented search: 534
lola: reporting
lola: not produced: 39
lola: find path: 139
lola: goal oriented search: 534
lola: reporting
lola: not produced: 39
lola: find path: 139
lola: goal oriented search: 534
lola: reporting
lola: not produced: 39
lola: find path: 139
lola: goal oriented search: 534
lola: reporting
lola: not produced: 39
lola: find path: 139
lola: goal oriented search: 534
lola: reporting
lola: not produced: 39
lola: find path: 139
lola: goal oriented search: 534
lola: reporting
lola: not produced: 38
lola: find path: 140
lola: goal oriented search: 534
lola: reporting
lola: not produced: 38
lola: find path: 140
lola: goal oriented search: 534
lola: reporting
lola: not produced: 38
lola: find path: 140
lola: goal oriented search: 534
lola: reporting
lola: not produced: 38
lola: find path: 140
lola: goal oriented search: 534
lola: reporting
lola: not produced: 38
lola: find path: 140
lola: goal oriented search: 534
lola: reporting
lola: not produced: 38
lola: find path: 140
lola: goal oriented search: 534
lola: reporting
lola: not produced: 38
lola: find path: 140
lola: goal oriented search: 534
lola: reporting
lola: not produced: 38
lola: find path: 140
lola: goal oriented search: 534
lola: reporting
lola: not produced: 38
lola: find path: 140
lola: goal oriented search: 534
lola: reporting
lola: not produced: 38
lola: find path: 140
lola: goal oriented search: 534
lola: reporting
lola: not produced: 38
lola: find path: 140
lola: goal oriented search: 534
lola: reporting
lola: not produced: 38
lola: find path: 140
lola: goal oriented search: 534
lola: reporting
lola: not produced: 38
lola: find path: 140
lola: goal oriented search: 534
lola: reporting
lola: not produced: 38
lola: find path: 140
lola: goal oriented search: 534
lola: reporting
lola: not produced: 38
lola: find path: 140
lola: goal oriented search: 534
lola: reporting
lola: not produced: 37
lola: find path: 141
lola: goal oriented search: 534
lola: reporting
lola: not produced: 37
lola: find path: 141
lola: goal oriented search: 534
lola: reporting
lola: not produced: 37
lola: find path: 141
lola: goal oriented search: 534
lola: reporting
lola: not produced: 37
lola: find path: 141
lola: goal oriented search: 534
lola: reporting
lola: not produced: 37
lola: find path: 141
lola: goal oriented search: 534
lola: reporting
lola: not produced: 37
lola: find path: 141
lola: goal oriented search: 534
lola: reporting
lola: not produced: 37
lola: find path: 141
lola: goal oriented search: 534
lola: reporting
lola: not produced: 37
lola: find path: 141
lola: goal oriented search: 534
lola: reporting
lola: not produced: 37
lola: find path: 141
lola: goal oriented search: 534
lola: reporting
lola: not produced: 37
lola: find path: 141
lola: goal oriented search: 534
lola: reporting
lola: not produced: 37
lola: find path: 141
lola: goal oriented search: 534
lola: reporting
lola: not produced: 37
lola: find path: 141
lola: goal oriented search: 534
lola: reporting
lola: not produced: 37
lola: find path: 141
lola: goal oriented search: 534
lola: reporting
lola: not produced: 37
lola: find path: 141
lola: goal oriented search: 534
lola: reporting
lola: not produced: 37
lola: find path: 141
lola: goal oriented search: 534
lola: reporting
lola: not produced: 37
lola: find path: 141
lola: goal oriented search: 534
lola: reporting
lola: not produced: 37
lola: find path: 141
lola: goal oriented search: 534
lola: reporting
lola: not produced: 37
lola: find path: 141
lola: goal oriented search: 534
lola: reporting
lola: not produced: 37
lola: find path: 141
lola: goal oriented search: 534
lola: reporting
lola: not produced: 37
lola: find path: 141
lola: goal oriented search: 534
lola: reporting
lola: not produced: 37
lola: find path: 141
lola: goal oriented search: 534
lola: reporting
lola: not produced: 37
lola: find path: 141
lola: goal oriented search: 534
lola: reporting
lola: not produced: 37
lola: find path: 141
lola: goal oriented search: 534
lola: reporting
lola: not produced: 37
lola: find path: 141
lola: goal oriented search: 534
lola: reporting
lola: not produced: 37
lola: find path: 141
lola: goal oriented search: 534
lola: reporting
lola: not produced: 37
lola: find path: 141
lola: goal oriented search: 534
lola: reporting
lola: not produced: 37
lola: find path: 141
lola: goal oriented search: 534
lola: reporting
lola: not produced: 37
lola: find path: 141
lola: goal oriented search: 534
lola: reporting
lola: not produced: 37
lola: find path: 141
lola: goal oriented search: 534
lola: reporting
lola: not produced: 37
lola: find path: 141
lola: goal oriented search: 534
lola: reporting
lola: not produced: 37
lola: find path: 141
lola: goal oriented search: 534
lola: reporting
lola: not produced: 37
lola: find path: 141
lola: goal oriented search: 534
lola: reporting
lola: not produced: 37
lola: find path: 141
lola: goal oriented search: 534
lola: reporting
lola: not produced: 37
lola: find path: 141
lola: goal oriented search: 534
lola: reporting
lola: not produced: 37
lola: find path: 141
lola: goal oriented search: 534
lola: reporting
lola: not produced: 37
lola: find path: 141
lola: goal oriented search: 534
lola: reporting
lola: not produced: 37
lola: find path: 141
lola: goal oriented search: 534
lola: reporting
lola: not produced: 37
lola: find path: 141
lola: goal oriented search: 534
lola: reporting
lola: not produced: 37
lola: find path: 141
lola: goal oriented search: 534
lola: reporting
lola: not produced: 37
lola: find path: 141
lola: goal oriented search: 534
lola: reporting
lola: not produced: 37
lola: find path: 141
lola: goal oriented search: 534
lola: reporting
lola: not produced: 37
lola: find path: 141
lola: goal oriented search: 534
lola: reporting
lola: not produced: 37
lola: find path: 141
lola: goal oriented search: 534
lola: reporting
lola: not produced: 37
lola: find path: 141
lola: goal oriented search: 534
lola: reporting
lola: not produced: 37
lola: find path: 141
lola: goal oriented search: 534
lola: reporting
lola: not produced: 37
lola: find path: 141
lola: goal oriented search: 534
lola: reporting
lola: not produced: 37
lola: find path: 141
lola: goal oriented search: 534
lola: reporting
lola: not produced: 37
lola: find path: 141
lola: goal oriented search: 534
lola: reporting
lola: not produced: 37
lola: find path: 141
lola: goal oriented search: 534
lola: reporting
lola: not produced: 37
lola: find path: 141
lola: goal oriented search: 534
lola: reporting
lola: not produced: 37
lola: find path: 141
lola: goal oriented search: 534
lola: reporting
lola: not produced: 37
lola: find path: 141
lola: goal oriented search: 534
lola: reporting
lola: not produced: 37
lola: find path: 141
lola: goal oriented search: 534
lola: reporting
lola: not produced: 37
lola: find path: 141
lola: goal oriented search: 534
lola: reporting
lola: not produced: 37
lola: find path: 141
lola: goal oriented search: 534
lola: reporting
lola: not produced: 37
lola: find path: 141
lola: goal oriented search: 534
lola: reporting
lola: not produced: 37
lola: find path: 141
lola: goal oriented search: 534
lola: reporting
lola: not produced: 37
lola: find path: 141
lola: goal oriented search: 534
lola: reporting
lola: not produced: 37
lola: find path: 141
lola: goal oriented search: 534
lola: reporting
lola: not produced: 37
lola: find path: 141
lola: goal oriented search: 534
lola: reporting
lola: not produced: 37
lola: find path: 141
lola: goal oriented search: 534
lola: reporting
lola: not produced: 37
lola: find path: 141
lola: goal oriented search: 534
lola: reporting
lola: not produced: 37
lola: find path: 141
lola: goal oriented search: 534
lola: reporting
lola: not produced: 37
lola: find path: 141
lola: goal oriented search: 534
lola: reporting
lola: not produced: 37
lola: find path: 141
lola: goal oriented search: 534
lola: reporting
lola: not produced: 37
lola: find path: 141
lola: goal oriented search: 534
lola: reporting
lola: not produced: 37
lola: find path: 141
lola: goal oriented search: 534
lola: reporting
lola: not produced: 37
lola: find path: 141
lola: goal oriented search: 534
lola: reporting
lola: not produced: 37
lola: find path: 141
lola: goal oriented search: 534
lola: reporting
lola: not produced: 36
lola: find path: 142
lola: goal oriented search: 534
lola: reporting
lola: not produced: 36
lola: find path: 142
lola: goal oriented search: 534
lola: reporting
lola: not produced: 36
lola: find path: 142
lola: goal oriented search: 534
lola: reporting
lola: not produced: 36
lola: find path: 142
lola: goal oriented search: 534
lola: reporting
lola: not produced: 36
lola: find path: 142
lola: goal oriented search: 534
lola: reporting
lola: not produced: 36
lola: find path: 142
lola: goal oriented search: 534
lola: reporting
lola: not produced: 36
lola: find path: 142
lola: goal oriented search: 534
lola: reporting
lola: not produced: 36
lola: find path: 142
lola: goal oriented search: 534
lola: reporting
lola: not produced: 36
lola: find path: 142
lola: goal oriented search: 534
lola: reporting
lola: not produced: 36
lola: find path: 142
lola: goal oriented search: 534
lola: reporting
lola: not produced: 36
lola: find path: 142
lola: goal oriented search: 534
lola: reporting
lola: not produced: 36
lola: find path: 142
lola: goal oriented search: 534
lola: reporting
lola: not produced: 36
lola: find path: 142
lola: goal oriented search: 534
lola: reporting
lola: not produced: 36
lola: find path: 142
lola: goal oriented search: 534
lola: reporting
lola: not produced: 36
lola: find path: 142
lola: goal oriented search: 534
lola: reporting
lola: not produced: 36
lola: find path: 142
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
sara: warning, failure of lp_solve (at job 4098)
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: reporting
lola: not produced: 35
lola: find path: 143
lola: goal oriented search: 534
lola: caught signal Terminated - aborting LoLA

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY


Time elapsed: 1224 secs. Pages in use: 179

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-08"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is EisenbergMcGuire-PT-08, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r533-tall-167987253200163"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-08.tgz
mv EisenbergMcGuire-PT-08 execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;