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-167987253200168.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-09, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r533-tall-167987253200168
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.8M
-rw-r--r-- 1 mcc users 6.3K Mar 23 15:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Mar 23 15:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Mar 23 15:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Mar 23 15:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 16K Mar 23 15:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 160K Mar 23 15:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 23 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Mar 23 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 2.3M 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 1680813737777

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-09
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2023-04-06 20:42:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-04-06 20:42:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 20:42:19] [INFO ] Load time of PNML (sax parser for PT used): 170 ms
[2023-04-06 20:42:19] [INFO ] Transformed 891 places.
[2023-04-06 20:42:19] [INFO ] Transformed 3888 transitions.
[2023-04-06 20:42:19] [INFO ] Found NUPN structural information;
[2023-04-06 20:42:19] [INFO ] Parsed PT model containing 891 places and 3888 transitions and 18792 arcs in 256 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 524 ms. (steps per millisecond=19 ) properties (out of 891) seen :567
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 324) 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 324) 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 324) 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 324) 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 324) 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 324) 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 324) 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 324) 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 324) 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 324) 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 324) 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 324) 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 324) 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 324) 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 324) 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 324) 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 324) 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 324) 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 324) 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 324) 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 324) 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 324) 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 324) 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 324) 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 324) 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 324) 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 324) 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 324) 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 324) 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 324) 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 324) 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 324) 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 324) 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 324) 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 324) 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 324) 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 324) 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 324) 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 324) 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 324) 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 324) 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 324) 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 324) 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 324) 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 324) 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 324) 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 324) 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 324) 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 324) 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 324) seen :0
Running SMT prover for 324 properties.
[2023-04-06 20:42:20] [INFO ] Flow matrix only has 1809 transitions (discarded 2079 similar events)
// Phase 1: matrix 1809 rows 891 cols
[2023-04-06 20:42:20] [INFO ] Computed 28 invariants in 32 ms
[2023-04-06 20:42:26] [INFO ] After 5587ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:324
[2023-04-06 20:42:30] [INFO ] [Nat]Absence check using 19 positive place invariants in 28 ms returned sat
[2023-04-06 20:42:30] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 10 ms returned sat
[2023-04-06 20:42:49] [INFO ] After 14609ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :324
[2023-04-06 20:42:49] [INFO ] State equation strengthened by 932 read => feed constraints.
[2023-04-06 20:42:51] [INFO ] After 2038ms SMT Verify possible using 932 Read/Feed constraints in natural domain returned unsat :0 sat :324
[2023-04-06 20:42:51] [INFO ] After 2040ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :324
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-04-06 20:42:51] [INFO ] After 25017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :324
Fused 324 Parikh solutions to 174 different solutions.
Parikh walk visited 1 properties in 1837 ms.
Support contains 323 out of 891 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 891/891 places, 3888/3888 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 891 transition count 3879
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 882 transition count 3879
Performed 180 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 180 Pre rules applied. Total rules applied 18 place count 882 transition count 3699
Deduced a syphon composed of 180 places in 4 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 2 with 360 rules applied. Total rules applied 378 place count 702 transition count 3699
Discarding 72 places :
Symmetric choice reduction at 2 with 72 rule applications. Total rules 450 place count 630 transition count 3051
Iterating global reduction 2 with 72 rules applied. Total rules applied 522 place count 630 transition count 3051
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 3 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 596 place count 593 transition count 3014
Applied a total of 596 rules in 338 ms. Remains 593 /891 variables (removed 298) and now considering 3014/3888 (removed 874) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 340 ms. Remains : 593/891 places, 3014/3888 transitions.
Interrupted random walk after 840001 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=27 ) properties seen 41
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 282) 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 282) 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 282) 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 282) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 281) 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 281) 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 281) 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 281) 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 281) 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 281) 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 281) 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 281) 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 281) 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 281) 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 281) 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 281) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 280) 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 280) 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 280) 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 280) 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 280) 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 280) 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 280) 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 280) 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 280) 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 280) 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 280) 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 280) 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 280) 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 280) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 280) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 280) 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 280) 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 280) 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 280) 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 280) 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 280) 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 280) 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 280) 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 280) 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 280) 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 280) 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 280) 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 280) 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 280) 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 280) 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 280) 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 280) 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 280) 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 280) 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 280) 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 280) 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 280) 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 280) 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 280) 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 280) 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 280) 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 280) 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 280) 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 280) 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 280) 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 280) 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 280) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 279) 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 279) 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 279) 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 279) 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 279) 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 279) 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 279) 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 279) 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 279) 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 279) 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 279) 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 279) 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 279) 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 279) 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 279) 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 279) 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 279) 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 279) 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 279) 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 279) 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 279) 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 279) 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 279) 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 279) 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 279) 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 279) 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 279) 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 279) 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 279) 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 279) 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 279) 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 279) 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 279) 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 279) 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 279) 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 279) 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 279) 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 279) 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 279) 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 279) 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 279) 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 279) 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 279) 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 279) 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 279) 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 279) 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 279) 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 279) 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 279) seen :0
Running SMT prover for 279 properties.
[2023-04-06 20:43:27] [INFO ] Flow matrix only has 935 transitions (discarded 2079 similar events)
// Phase 1: matrix 935 rows 593 cols
[2023-04-06 20:43:27] [INFO ] Computed 28 invariants in 6 ms
[2023-04-06 20:43:30] [INFO ] After 3107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:279
[2023-04-06 20:43:32] [INFO ] [Nat]Absence check using 19 positive place invariants in 12 ms returned sat
[2023-04-06 20:43:32] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-06 20:43:42] [INFO ] After 7663ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :279
[2023-04-06 20:43:42] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 20:43:52] [INFO ] After 9414ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :279
[2023-04-06 20:43:52] [INFO ] Deduced a trap composed of 3 places in 218 ms of which 5 ms to minimize.
[2023-04-06 20:43:52] [INFO ] Deduced a trap composed of 33 places in 197 ms of which 1 ms to minimize.
[2023-04-06 20:43:53] [INFO ] Deduced a trap composed of 50 places in 202 ms of which 1 ms to minimize.
[2023-04-06 20:43:53] [INFO ] Deduced a trap composed of 20 places in 175 ms of which 1 ms to minimize.
[2023-04-06 20:43:53] [INFO ] Deduced a trap composed of 63 places in 188 ms of which 1 ms to minimize.
[2023-04-06 20:43:53] [INFO ] Deduced a trap composed of 51 places in 170 ms of which 0 ms to minimize.
[2023-04-06 20:43:53] [INFO ] Deduced a trap composed of 35 places in 154 ms of which 1 ms to minimize.
[2023-04-06 20:43:54] [INFO ] Deduced a trap composed of 17 places in 149 ms of which 1 ms to minimize.
[2023-04-06 20:43:54] [INFO ] Deduced a trap composed of 31 places in 160 ms of which 0 ms to minimize.
[2023-04-06 20:43:54] [INFO ] Deduced a trap composed of 35 places in 159 ms of which 2 ms to minimize.
[2023-04-06 20:43:54] [INFO ] Deduced a trap composed of 3 places in 154 ms of which 1 ms to minimize.
[2023-04-06 20:43:54] [INFO ] Deduced a trap composed of 3 places in 129 ms of which 0 ms to minimize.
[2023-04-06 20:43:55] [INFO ] Deduced a trap composed of 3 places in 132 ms of which 0 ms to minimize.
[2023-04-06 20:43:55] [INFO ] Deduced a trap composed of 22 places in 138 ms of which 1 ms to minimize.
[2023-04-06 20:43:55] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 0 ms to minimize.
[2023-04-06 20:43:55] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 1 ms to minimize.
[2023-04-06 20:43:55] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 0 ms to minimize.
[2023-04-06 20:43:55] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2023-04-06 20:43:55] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2023-04-06 20:43:55] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2023-04-06 20:43:55] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2023-04-06 20:43:56] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 3647 ms
[2023-04-06 20:43:56] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 0 ms to minimize.
[2023-04-06 20:43:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2023-04-06 20:43:56] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2023-04-06 20:43:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2023-04-06 20:43:57] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 1 ms to minimize.
[2023-04-06 20:43:57] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 0 ms to minimize.
[2023-04-06 20:43:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 227 ms
[2023-04-06 20:43:57] [INFO ] Deduced a trap composed of 49 places in 67 ms of which 0 ms to minimize.
[2023-04-06 20:43:58] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 0 ms to minimize.
[2023-04-06 20:43:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 233 ms
[2023-04-06 20:43:58] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-04-06 20:43:58] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 0 ms to minimize.
[2023-04-06 20:43:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 219 ms
[2023-04-06 20:43:59] [INFO ] Deduced a trap composed of 52 places in 60 ms of which 1 ms to minimize.
[2023-04-06 20:43:59] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 0 ms to minimize.
[2023-04-06 20:43:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 230 ms
[2023-04-06 20:43:59] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 1 ms to minimize.
[2023-04-06 20:43:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 144 ms
[2023-04-06 20:44:00] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 0 ms to minimize.
[2023-04-06 20:44:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2023-04-06 20:44:01] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 1 ms to minimize.
[2023-04-06 20:44:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2023-04-06 20:44:01] [INFO ] Deduced a trap composed of 15 places in 186 ms of which 2 ms to minimize.
[2023-04-06 20:44:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 259 ms
[2023-04-06 20:44:02] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 0 ms to minimize.
[2023-04-06 20:44:02] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 0 ms to minimize.
[2023-04-06 20:44:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 324 ms
[2023-04-06 20:44:02] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 0 ms to minimize.
[2023-04-06 20:44:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 167 ms
[2023-04-06 20:44:03] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 0 ms to minimize.
[2023-04-06 20:44:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 144 ms
[2023-04-06 20:44:03] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 1 ms to minimize.
[2023-04-06 20:44:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2023-04-06 20:44:04] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 0 ms to minimize.
[2023-04-06 20:44:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2023-04-06 20:44:04] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2023-04-06 20:44:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 143 ms
[2023-04-06 20:44:04] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 1 ms to minimize.
[2023-04-06 20:44:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 161 ms
[2023-04-06 20:44:05] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 0 ms to minimize.
[2023-04-06 20:44:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2023-04-06 20:44:05] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 0 ms to minimize.
[2023-04-06 20:44:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 144 ms
[2023-04-06 20:44:07] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 0 ms to minimize.
[2023-04-06 20:44:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2023-04-06 20:44:07] [INFO ] Deduced a trap composed of 56 places in 93 ms of which 0 ms to minimize.
[2023-04-06 20:44:08] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2023-04-06 20:44:08] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 1 ms to minimize.
[2023-04-06 20:44:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 386 ms
[2023-04-06 20:44:08] [INFO ] Deduced a trap composed of 60 places in 65 ms of which 0 ms to minimize.
[2023-04-06 20:44:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2023-04-06 20:44:11] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 1 ms to minimize.
[2023-04-06 20:44:11] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 0 ms to minimize.
[2023-04-06 20:44:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 289 ms
[2023-04-06 20:44:13] [INFO ] Deduced a trap composed of 59 places in 100 ms of which 1 ms to minimize.
[2023-04-06 20:44:14] [INFO ] Deduced a trap composed of 53 places in 71 ms of which 1 ms to minimize.
[2023-04-06 20:44:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 283 ms
[2023-04-06 20:44:17] [INFO ] After 34133ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :279
Attempting to minimize the solution found.
Minimization took 10340 ms.
[2023-04-06 20:44:27] [INFO ] After 56806ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :279
Fused 279 Parikh solutions to 197 different solutions.
Parikh walk visited 0 properties in 4758 ms.
Support contains 279 out of 593 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 593/593 places, 3014/3014 transitions.
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 2 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 0 with 70 rules applied. Total rules applied 70 place count 558 transition count 2979
Applied a total of 70 rules in 121 ms. Remains 558 /593 variables (removed 35) and now considering 2979/3014 (removed 35) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 558/593 places, 2979/3014 transitions.
Interrupted random walk after 920319 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=30 ) properties seen 2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 277) 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 277) 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 277) 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 277) 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 277) 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 277) 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 277) 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 277) 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 277) 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 277) 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 277) 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 277) 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 277) 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 277) 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 277) 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 277) 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 277) 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 277) 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 277) 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 277) 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 277) 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 277) 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 277) 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 277) 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 277) 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 277) 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 277) 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 277) 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 277) 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 277) 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 277) 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 277) 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 277) 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 277) 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 277) 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 277) 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 277) 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 277) 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 277) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 276) 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 276) 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 276) 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 276) 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 276) 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 276) 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 276) 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 276) 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 276) 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 276) 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 276) 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 276) 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 276) 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 276) 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 276) 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 276) 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 276) 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 276) 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 276) 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 276) 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 276) 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 276) 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 276) 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 276) 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 276) 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 276) 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 276) 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 276) 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 276) 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 276) 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 276) 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 276) 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 276) 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 276) 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 276) 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 276) 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 276) 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 276) 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 276) 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 276) 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 276) 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 276) 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 276) 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 276) 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 276) 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 276) 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 276) 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 276) 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 276) seen :0
Interrupted probabilistic random walk after 7298360 steps, run timeout after 99001 ms. (steps per millisecond=73 ) properties seen :{0=1, 1=1, 2=1, 3=1, 4=1, 5=1, 6=1, 7=1, 8=1, 9=1, 10=1, 11=1, 12=1, 13=1, 14=1, 15=1, 16=1, 17=1, 18=1, 19=1, 20=1, 21=1, 22=1, 23=1, 24=1, 25=1, 26=1, 27=1, 28=1, 29=1, 30=1, 31=1, 32=1, 33=1, 34=1, 35=1, 36=1, 37=1, 38=1, 39=1, 40=1, 41=1, 42=1, 43=1, 44=1, 45=1, 46=1, 47=1, 48=1, 49=1, 50=1, 51=1, 52=1, 53=1, 54=1, 55=1, 56=1, 57=1, 58=1, 59=1, 60=1, 61=1, 62=1, 63=1, 64=1, 65=1, 66=1, 67=1, 68=1, 69=1, 70=1, 71=1, 74=1, 75=1, 76=1, 77=1, 79=1, 80=1, 81=1, 82=1, 83=1, 86=1, 87=1, 88=1, 89=1, 90=1, 91=1, 94=1, 95=1, 96=1, 97=1, 98=1, 99=1, 101=1, 102=1, 103=1, 104=1, 105=1, 106=1, 107=1, 108=1, 109=1, 110=1, 111=1, 112=1, 113=1, 114=1, 115=1, 116=1, 118=1, 119=1, 120=1, 121=1, 122=1, 123=1, 124=1, 126=1, 127=1, 128=1, 129=1, 130=1, 131=1, 132=1, 133=1, 134=1, 135=1, 136=1, 137=1, 138=1, 139=1, 140=1, 141=1, 142=1, 143=1, 144=1, 145=1, 146=1, 147=1, 148=1, 149=1, 150=1, 151=1, 152=1, 153=1, 154=1, 155=1, 156=1, 157=1, 158=1, 159=1, 160=1, 161=1, 162=1, 163=1, 164=1, 165=1, 166=1, 167=1, 168=1, 169=1, 170=1, 171=1, 172=1, 173=1, 174=1, 175=1, 176=1, 177=1, 178=1, 179=1, 180=1, 181=1, 182=1, 183=1, 184=1, 185=1, 186=1, 187=1, 188=1, 189=1, 190=1, 191=1, 192=1, 193=1, 194=1, 195=1, 196=1, 197=1, 198=1, 199=1, 200=1, 201=1, 202=1, 203=1, 204=1, 205=1, 206=1, 207=1, 208=1, 209=1, 210=1, 213=1, 214=1, 215=1, 216=1, 217=1, 218=1, 219=1, 222=1, 223=1, 224=1, 225=1, 226=1, 227=1, 231=1, 232=1, 233=1, 234=1, 235=1, 237=1, 240=1, 241=1, 242=1, 243=1, 244=1, 245=1, 246=1, 249=1, 250=1, 251=1, 252=1, 253=1, 254=1, 255=1, 256=1, 258=1, 259=1, 260=1, 261=1, 262=1, 263=1, 264=1, 265=1, 266=1, 267=1, 268=1, 269=1, 270=1, 271=1, 272=1, 273=1, 274=1, 275=1}
Probabilistic random walk after 7298360 steps, saw 2571845 distinct states, run finished after 99004 ms. (steps per millisecond=73 ) properties seen :253
Running SMT prover for 23 properties.
[2023-04-06 20:46:44] [INFO ] Flow matrix only has 900 transitions (discarded 2079 similar events)
// Phase 1: matrix 900 rows 558 cols
[2023-04-06 20:46:44] [INFO ] Computed 28 invariants in 4 ms
[2023-04-06 20:46:44] [INFO ] After 243ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:23
[2023-04-06 20:46:44] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2023-04-06 20:46:44] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-06 20:46:45] [INFO ] After 782ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :23
[2023-04-06 20:46:45] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 20:46:46] [INFO ] After 774ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :23
[2023-04-06 20:46:46] [INFO ] Deduced a trap composed of 3 places in 186 ms of which 0 ms to minimize.
[2023-04-06 20:46:47] [INFO ] Deduced a trap composed of 62 places in 161 ms of which 0 ms to minimize.
[2023-04-06 20:46:47] [INFO ] Deduced a trap composed of 90 places in 158 ms of which 1 ms to minimize.
[2023-04-06 20:46:47] [INFO ] Deduced a trap composed of 12 places in 153 ms of which 1 ms to minimize.
[2023-04-06 20:46:47] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 1 ms to minimize.
[2023-04-06 20:46:47] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 0 ms to minimize.
[2023-04-06 20:46:47] [INFO ] Deduced a trap composed of 49 places in 63 ms of which 0 ms to minimize.
[2023-04-06 20:46:47] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1229 ms
[2023-04-06 20:46:48] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 0 ms to minimize.
[2023-04-06 20:46:48] [INFO ] Deduced a trap composed of 52 places in 87 ms of which 0 ms to minimize.
[2023-04-06 20:46:48] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 0 ms to minimize.
[2023-04-06 20:46:48] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 2 ms to minimize.
[2023-04-06 20:46:48] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 530 ms
[2023-04-06 20:46:48] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2023-04-06 20:46:48] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 2 ms to minimize.
[2023-04-06 20:46:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 223 ms
[2023-04-06 20:46:48] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 3 ms to minimize.
[2023-04-06 20:46:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2023-04-06 20:46:49] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 0 ms to minimize.
[2023-04-06 20:46:49] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2023-04-06 20:46:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 214 ms
[2023-04-06 20:46:49] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 0 ms to minimize.
[2023-04-06 20:46:49] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 0 ms to minimize.
[2023-04-06 20:46:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 316 ms
[2023-04-06 20:46:49] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 0 ms to minimize.
[2023-04-06 20:46:49] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 0 ms to minimize.
[2023-04-06 20:46:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 244 ms
[2023-04-06 20:46:50] [INFO ] Deduced a trap composed of 55 places in 69 ms of which 0 ms to minimize.
[2023-04-06 20:46:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
[2023-04-06 20:46:50] [INFO ] Deduced a trap composed of 42 places in 63 ms of which 0 ms to minimize.
[2023-04-06 20:46:50] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 0 ms to minimize.
[2023-04-06 20:46:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 223 ms
[2023-04-06 20:46:50] [INFO ] Deduced a trap composed of 58 places in 66 ms of which 0 ms to minimize.
[2023-04-06 20:46:51] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 0 ms to minimize.
[2023-04-06 20:46:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 231 ms
[2023-04-06 20:46:51] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 0 ms to minimize.
[2023-04-06 20:46:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2023-04-06 20:46:51] [INFO ] Deduced a trap composed of 50 places in 64 ms of which 0 ms to minimize.
[2023-04-06 20:46:51] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 0 ms to minimize.
[2023-04-06 20:46:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 241 ms
[2023-04-06 20:46:51] [INFO ] After 5592ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :23
Attempting to minimize the solution found.
Minimization took 784 ms.
[2023-04-06 20:46:52] [INFO ] After 7594ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :23
Fused 23 Parikh solutions to 22 different solutions.
Parikh walk visited 0 properties in 806 ms.
Support contains 23 out of 558 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 558/558 places, 2979/2979 transitions.
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 72 Pre rules applied. Total rules applied 0 place count 558 transition count 2907
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 0 with 144 rules applied. Total rules applied 144 place count 486 transition count 2907
Applied a total of 144 rules in 118 ms. Remains 486 /558 variables (removed 72) and now considering 2907/2979 (removed 72) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 486/558 places, 2907/2979 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 21512 ms. (steps per millisecond=46 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 273 ms. (steps per millisecond=366 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 266 ms. (steps per millisecond=375 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 264 ms. (steps per millisecond=378 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 272 ms. (steps per millisecond=367 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 274 ms. (steps per millisecond=364 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 271 ms. (steps per millisecond=369 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 274 ms. (steps per millisecond=364 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 270 ms. (steps per millisecond=370 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 269 ms. (steps per millisecond=371 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 267 ms. (steps per millisecond=374 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 268 ms. (steps per millisecond=373 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 276 ms. (steps per millisecond=362 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 270 ms. (steps per millisecond=370 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 273 ms. (steps per millisecond=366 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 274 ms. (steps per millisecond=364 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 274 ms. (steps per millisecond=364 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 270 ms. (steps per millisecond=370 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 271 ms. (steps per millisecond=369 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 267 ms. (steps per millisecond=374 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 269 ms. (steps per millisecond=371 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 273 ms. (steps per millisecond=366 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 269 ms. (steps per millisecond=371 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 270 ms. (steps per millisecond=370 ) properties (out of 23) seen :0
Interrupted probabilistic random walk after 6476160 steps, run timeout after 81001 ms. (steps per millisecond=79 ) properties seen :{1=1, 4=1, 6=1, 17=1, 18=1, 20=1}
Probabilistic random walk after 6476160 steps, saw 2394349 distinct states, run finished after 81001 ms. (steps per millisecond=79 ) properties seen :6
Running SMT prover for 17 properties.
[2023-04-06 20:48:41] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2023-04-06 20:48:42] [INFO ] Computed 28 invariants in 8 ms
[2023-04-06 20:48:42] [INFO ] After 171ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-04-06 20:48:42] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-04-06 20:48:42] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-06 20:48:43] [INFO ] After 557ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2023-04-06 20:48:43] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 20:48:43] [INFO ] After 589ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :17
[2023-04-06 20:48:43] [INFO ] Deduced a trap composed of 3 places in 153 ms of which 0 ms to minimize.
[2023-04-06 20:48:43] [INFO ] Deduced a trap composed of 49 places in 124 ms of which 1 ms to minimize.
[2023-04-06 20:48:44] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 0 ms to minimize.
[2023-04-06 20:48:44] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 1 ms to minimize.
[2023-04-06 20:48:44] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 1 ms to minimize.
[2023-04-06 20:48:44] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 0 ms to minimize.
[2023-04-06 20:48:44] [INFO ] Deduced a trap composed of 50 places in 97 ms of which 0 ms to minimize.
[2023-04-06 20:48:44] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 0 ms to minimize.
[2023-04-06 20:48:44] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1091 ms
[2023-04-06 20:48:44] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 0 ms to minimize.
[2023-04-06 20:48:44] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 0 ms to minimize.
[2023-04-06 20:48:45] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2023-04-06 20:48:45] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2023-04-06 20:48:45] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 406 ms
[2023-04-06 20:48:45] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 0 ms to minimize.
[2023-04-06 20:48:45] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2023-04-06 20:48:45] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 0 ms to minimize.
[2023-04-06 20:48:45] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 0 ms to minimize.
[2023-04-06 20:48:45] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 413 ms
[2023-04-06 20:48:45] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2023-04-06 20:48:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2023-04-06 20:48:45] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2023-04-06 20:48:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2023-04-06 20:48:46] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 0 ms to minimize.
[2023-04-06 20:48:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2023-04-06 20:48:46] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 0 ms to minimize.
[2023-04-06 20:48:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2023-04-06 20:48:46] [INFO ] Deduced a trap composed of 48 places in 65 ms of which 0 ms to minimize.
[2023-04-06 20:48:46] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 0 ms to minimize.
[2023-04-06 20:48:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 220 ms
[2023-04-06 20:48:46] [INFO ] After 3859ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 523 ms.
[2023-04-06 20:48:47] [INFO ] After 5250ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Fused 17 Parikh solutions to 16 different solutions.
Parikh walk visited 0 properties in 348 ms.
Support contains 17 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 100 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 486/486 places, 2907/2907 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 19403 ms. (steps per millisecond=51 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 256 ms. (steps per millisecond=390 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 262 ms. (steps per millisecond=381 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 256 ms. (steps per millisecond=390 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 260 ms. (steps per millisecond=384 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 260 ms. (steps per millisecond=384 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 259 ms. (steps per millisecond=386 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 262 ms. (steps per millisecond=381 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 261 ms. (steps per millisecond=383 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 261 ms. (steps per millisecond=383 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 257 ms. (steps per millisecond=389 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 263 ms. (steps per millisecond=380 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 261 ms. (steps per millisecond=383 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 262 ms. (steps per millisecond=381 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 262 ms. (steps per millisecond=381 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 264 ms. (steps per millisecond=378 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 264 ms. (steps per millisecond=378 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 261 ms. (steps per millisecond=383 ) properties (out of 17) seen :0
Interrupted probabilistic random walk after 4829510 steps, run timeout after 69001 ms. (steps per millisecond=69 ) properties seen :{}
Probabilistic random walk after 4829510 steps, saw 2010834 distinct states, run finished after 69002 ms. (steps per millisecond=69 ) properties seen :0
Running SMT prover for 17 properties.
[2023-04-06 20:50:20] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:50:20] [INFO ] Invariant cache hit.
[2023-04-06 20:50:20] [INFO ] After 170ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-04-06 20:50:21] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2023-04-06 20:50:21] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-06 20:50:21] [INFO ] After 556ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2023-04-06 20:50:21] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 20:50:22] [INFO ] After 613ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :17
[2023-04-06 20:50:22] [INFO ] Deduced a trap composed of 3 places in 134 ms of which 0 ms to minimize.
[2023-04-06 20:50:22] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 4 ms to minimize.
[2023-04-06 20:50:22] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 0 ms to minimize.
[2023-04-06 20:50:22] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 1 ms to minimize.
[2023-04-06 20:50:22] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 0 ms to minimize.
[2023-04-06 20:50:23] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 645 ms
[2023-04-06 20:50:23] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2023-04-06 20:50:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2023-04-06 20:50:23] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-04-06 20:50:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2023-04-06 20:50:23] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 0 ms to minimize.
[2023-04-06 20:50:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
[2023-04-06 20:50:23] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 0 ms to minimize.
[2023-04-06 20:50:23] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 0 ms to minimize.
[2023-04-06 20:50:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 252 ms
[2023-04-06 20:50:23] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2023-04-06 20:50:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2023-04-06 20:50:24] [INFO ] Deduced a trap composed of 42 places in 66 ms of which 1 ms to minimize.
[2023-04-06 20:50:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2023-04-06 20:50:24] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 0 ms to minimize.
[2023-04-06 20:50:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2023-04-06 20:50:24] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 0 ms to minimize.
[2023-04-06 20:50:24] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 1 ms to minimize.
[2023-04-06 20:50:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 241 ms
[2023-04-06 20:50:24] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2023-04-06 20:50:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2023-04-06 20:50:24] [INFO ] After 3223ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 518 ms.
[2023-04-06 20:50:25] [INFO ] After 4605ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Fused 17 Parikh solutions to 16 different solutions.
Parikh walk visited 0 properties in 285 ms.
Support contains 17 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 91 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 86 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2023-04-06 20:50:25] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:50:25] [INFO ] Invariant cache hit.
[2023-04-06 20:50:26] [INFO ] Implicit Places using invariants in 446 ms returned []
[2023-04-06 20:50:26] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:50:26] [INFO ] Invariant cache hit.
[2023-04-06 20:50:26] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 20:50:28] [INFO ] Implicit Places using invariants and state equation in 2311 ms returned []
Implicit Place search using SMT with State Equation took 2759 ms to find 0 implicit places.
[2023-04-06 20:50:28] [INFO ] Redundant transitions in 185 ms returned []
[2023-04-06 20:50:28] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:50:28] [INFO ] Invariant cache hit.
[2023-04-06 20:50:29] [INFO ] Dead Transitions using invariants and state equation in 825 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3866 ms. Remains : 486/486 places, 2907/2907 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 1999 ms. (steps per millisecond=50 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
[2023-04-06 20:50:31] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:50:31] [INFO ] Invariant cache hit.
[2023-04-06 20:50:31] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-04-06 20:50:31] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 7 ms returned sat
[2023-04-06 20:50:32] [INFO ] After 183ms SMT Verify possible using state equation in real domain returned unsat :0 sat :17
[2023-04-06 20:50:32] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 20:50:32] [INFO ] After 156ms SMT Verify possible using 356 Read/Feed constraints in real domain returned unsat :0 sat :17
[2023-04-06 20:50:32] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 1 ms to minimize.
[2023-04-06 20:50:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 212 ms
[2023-04-06 20:50:33] [INFO ] Deduced a trap composed of 42 places in 139 ms of which 0 ms to minimize.
[2023-04-06 20:50:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 207 ms
[2023-04-06 20:50:33] [INFO ] Deduced a trap composed of 50 places in 116 ms of which 0 ms to minimize.
[2023-04-06 20:50:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 186 ms
[2023-04-06 20:50:33] [INFO ] Deduced a trap composed of 71 places in 128 ms of which 0 ms to minimize.
[2023-04-06 20:50:33] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 0 ms to minimize.
[2023-04-06 20:50:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 349 ms
[2023-04-06 20:50:34] [INFO ] After 1994ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:17
[2023-04-06 20:50:34] [INFO ] After 2277ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-04-06 20:50:34] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-04-06 20:50:34] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-06 20:50:34] [INFO ] After 184ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2023-04-06 20:50:34] [INFO ] After 168ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :17
[2023-04-06 20:50:34] [INFO ] Deduced a trap composed of 31 places in 207 ms of which 1 ms to minimize.
[2023-04-06 20:50:34] [INFO ] Deduced a trap composed of 3 places in 181 ms of which 1 ms to minimize.
[2023-04-06 20:50:35] [INFO ] Deduced a trap composed of 3 places in 177 ms of which 1 ms to minimize.
[2023-04-06 20:50:35] [INFO ] Deduced a trap composed of 3 places in 122 ms of which 0 ms to minimize.
[2023-04-06 20:50:35] [INFO ] Deduced a trap composed of 48 places in 131 ms of which 0 ms to minimize.
[2023-04-06 20:50:35] [INFO ] Deduced a trap composed of 57 places in 116 ms of which 1 ms to minimize.
[2023-04-06 20:50:35] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 0 ms to minimize.
[2023-04-06 20:50:35] [INFO ] Deduced a trap composed of 50 places in 65 ms of which 0 ms to minimize.
[2023-04-06 20:50:35] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2023-04-06 20:50:36] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 0 ms to minimize.
[2023-04-06 20:50:36] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1575 ms
[2023-04-06 20:50:36] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 0 ms to minimize.
[2023-04-06 20:50:36] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 0 ms to minimize.
[2023-04-06 20:50:36] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 0 ms to minimize.
[2023-04-06 20:50:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 403 ms
[2023-04-06 20:50:36] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 2 ms to minimize.
[2023-04-06 20:50:36] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
[2023-04-06 20:50:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 247 ms
[2023-04-06 20:50:36] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 0 ms to minimize.
[2023-04-06 20:50:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2023-04-06 20:50:37] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 0 ms to minimize.
[2023-04-06 20:50:37] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 0 ms to minimize.
[2023-04-06 20:50:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 268 ms
[2023-04-06 20:50:37] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 0 ms to minimize.
[2023-04-06 20:50:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2023-04-06 20:50:37] [INFO ] Deduced a trap composed of 56 places in 63 ms of which 0 ms to minimize.
[2023-04-06 20:50:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2023-04-06 20:50:37] [INFO ] Deduced a trap composed of 42 places in 64 ms of which 0 ms to minimize.
[2023-04-06 20:50:37] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 0 ms to minimize.
[2023-04-06 20:50:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 211 ms
[2023-04-06 20:50:38] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 0 ms to minimize.
[2023-04-06 20:50:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2023-04-06 20:50:38] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2023-04-06 20:50:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2023-04-06 20:50:38] [INFO ] Deduced a trap composed of 48 places in 68 ms of which 1 ms to minimize.
[2023-04-06 20:50:38] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 0 ms to minimize.
[2023-04-06 20:50:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 215 ms
[2023-04-06 20:50:38] [INFO ] After 4341ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 138 ms.
[2023-04-06 20:50:38] [INFO ] After 4740ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 20894 ms. (steps per millisecond=47 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 271 ms. (steps per millisecond=369 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 272 ms. (steps per millisecond=367 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 272 ms. (steps per millisecond=367 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 268 ms. (steps per millisecond=373 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 270 ms. (steps per millisecond=370 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 273 ms. (steps per millisecond=366 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 271 ms. (steps per millisecond=369 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 272 ms. (steps per millisecond=367 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 272 ms. (steps per millisecond=367 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 271 ms. (steps per millisecond=369 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 269 ms. (steps per millisecond=371 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 270 ms. (steps per millisecond=370 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 268 ms. (steps per millisecond=373 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 268 ms. (steps per millisecond=373 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 265 ms. (steps per millisecond=377 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 268 ms. (steps per millisecond=373 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 266 ms. (steps per millisecond=375 ) properties (out of 17) seen :0
Interrupted probabilistic random walk after 5257250 steps, run timeout after 75001 ms. (steps per millisecond=70 ) properties seen :{}
Probabilistic random walk after 5257250 steps, saw 2093751 distinct states, run finished after 75001 ms. (steps per millisecond=70 ) properties seen :0
Running SMT prover for 17 properties.
[2023-04-06 20:52:19] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:52:19] [INFO ] Invariant cache hit.
[2023-04-06 20:52:19] [INFO ] After 171ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-04-06 20:52:19] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2023-04-06 20:52:19] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 5 ms returned sat
[2023-04-06 20:52:20] [INFO ] After 585ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2023-04-06 20:52:20] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 20:52:20] [INFO ] After 636ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :17
[2023-04-06 20:52:21] [INFO ] Deduced a trap composed of 3 places in 137 ms of which 0 ms to minimize.
[2023-04-06 20:52:21] [INFO ] Deduced a trap composed of 3 places in 111 ms of which 0 ms to minimize.
[2023-04-06 20:52:21] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 0 ms to minimize.
[2023-04-06 20:52:21] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 1 ms to minimize.
[2023-04-06 20:52:21] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 0 ms to minimize.
[2023-04-06 20:52:21] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 683 ms
[2023-04-06 20:52:21] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2023-04-06 20:52:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2023-04-06 20:52:21] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2023-04-06 20:52:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2023-04-06 20:52:22] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 0 ms to minimize.
[2023-04-06 20:52:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 140 ms
[2023-04-06 20:52:22] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 1 ms to minimize.
[2023-04-06 20:52:22] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 0 ms to minimize.
[2023-04-06 20:52:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 262 ms
[2023-04-06 20:52:22] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 0 ms to minimize.
[2023-04-06 20:52:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2023-04-06 20:52:22] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 0 ms to minimize.
[2023-04-06 20:52:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2023-04-06 20:52:23] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 0 ms to minimize.
[2023-04-06 20:52:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2023-04-06 20:52:23] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 0 ms to minimize.
[2023-04-06 20:52:23] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 1 ms to minimize.
[2023-04-06 20:52:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 255 ms
[2023-04-06 20:52:23] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 0 ms to minimize.
[2023-04-06 20:52:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2023-04-06 20:52:23] [INFO ] After 3342ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 554 ms.
[2023-04-06 20:52:24] [INFO ] After 4792ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Fused 17 Parikh solutions to 16 different solutions.
Parikh walk visited 0 properties in 341 ms.
Support contains 17 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 95 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 87 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2023-04-06 20:52:24] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:52:24] [INFO ] Invariant cache hit.
[2023-04-06 20:52:25] [INFO ] Implicit Places using invariants in 455 ms returned []
[2023-04-06 20:52:25] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:52:25] [INFO ] Invariant cache hit.
[2023-04-06 20:52:25] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 20:52:27] [INFO ] Implicit Places using invariants and state equation in 2294 ms returned []
Implicit Place search using SMT with State Equation took 2755 ms to find 0 implicit places.
[2023-04-06 20:52:27] [INFO ] Redundant transitions in 149 ms returned []
[2023-04-06 20:52:27] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:52:27] [INFO ] Invariant cache hit.
[2023-04-06 20:52:28] [INFO ] Dead Transitions using invariants and state equation in 856 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3853 ms. Remains : 486/486 places, 2907/2907 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 1949 ms. (steps per millisecond=51 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
[2023-04-06 20:52:30] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:52:30] [INFO ] Invariant cache hit.
[2023-04-06 20:52:30] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-04-06 20:52:30] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-06 20:52:30] [INFO ] After 183ms SMT Verify possible using state equation in real domain returned unsat :0 sat :17
[2023-04-06 20:52:30] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 20:52:30] [INFO ] After 147ms SMT Verify possible using 356 Read/Feed constraints in real domain returned unsat :0 sat :17
[2023-04-06 20:52:31] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 0 ms to minimize.
[2023-04-06 20:52:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 214 ms
[2023-04-06 20:52:31] [INFO ] Deduced a trap composed of 42 places in 145 ms of which 0 ms to minimize.
[2023-04-06 20:52:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 221 ms
[2023-04-06 20:52:32] [INFO ] Deduced a trap composed of 50 places in 123 ms of which 0 ms to minimize.
[2023-04-06 20:52:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 185 ms
[2023-04-06 20:52:32] [INFO ] Deduced a trap composed of 71 places in 128 ms of which 0 ms to minimize.
[2023-04-06 20:52:32] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 1 ms to minimize.
[2023-04-06 20:52:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 348 ms
[2023-04-06 20:52:32] [INFO ] After 1938ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:17
[2023-04-06 20:52:32] [INFO ] After 2204ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-04-06 20:52:32] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-04-06 20:52:32] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 3 ms returned sat
[2023-04-06 20:52:32] [INFO ] After 186ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2023-04-06 20:52:33] [INFO ] After 176ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :17
[2023-04-06 20:52:33] [INFO ] Deduced a trap composed of 31 places in 189 ms of which 0 ms to minimize.
[2023-04-06 20:52:33] [INFO ] Deduced a trap composed of 3 places in 181 ms of which 1 ms to minimize.
[2023-04-06 20:52:33] [INFO ] Deduced a trap composed of 3 places in 179 ms of which 0 ms to minimize.
[2023-04-06 20:52:33] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 0 ms to minimize.
[2023-04-06 20:52:34] [INFO ] Deduced a trap composed of 48 places in 128 ms of which 0 ms to minimize.
[2023-04-06 20:52:34] [INFO ] Deduced a trap composed of 57 places in 125 ms of which 1 ms to minimize.
[2023-04-06 20:52:34] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 0 ms to minimize.
[2023-04-06 20:52:34] [INFO ] Deduced a trap composed of 50 places in 66 ms of which 0 ms to minimize.
[2023-04-06 20:52:34] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2023-04-06 20:52:34] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 1 ms to minimize.
[2023-04-06 20:52:34] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1590 ms
[2023-04-06 20:52:34] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 1 ms to minimize.
[2023-04-06 20:52:34] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 1 ms to minimize.
[2023-04-06 20:52:35] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 0 ms to minimize.
[2023-04-06 20:52:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 393 ms
[2023-04-06 20:52:35] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 1 ms to minimize.
[2023-04-06 20:52:35] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 0 ms to minimize.
[2023-04-06 20:52:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 237 ms
[2023-04-06 20:52:35] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 0 ms to minimize.
[2023-04-06 20:52:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2023-04-06 20:52:35] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 1 ms to minimize.
[2023-04-06 20:52:35] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 0 ms to minimize.
[2023-04-06 20:52:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 283 ms
[2023-04-06 20:52:36] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 1 ms to minimize.
[2023-04-06 20:52:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2023-04-06 20:52:36] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 0 ms to minimize.
[2023-04-06 20:52:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2023-04-06 20:52:36] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 1 ms to minimize.
[2023-04-06 20:52:36] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 0 ms to minimize.
[2023-04-06 20:52:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 214 ms
[2023-04-06 20:52:36] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 0 ms to minimize.
[2023-04-06 20:52:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2023-04-06 20:52:36] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2023-04-06 20:52:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2023-04-06 20:52:37] [INFO ] Deduced a trap composed of 48 places in 67 ms of which 0 ms to minimize.
[2023-04-06 20:52:37] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 0 ms to minimize.
[2023-04-06 20:52:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 222 ms
[2023-04-06 20:52:37] [INFO ] After 4396ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 138 ms.
[2023-04-06 20:52:37] [INFO ] After 4797ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Finished Best-First random walk after 7162 steps, including 2 resets, run visited all 1 properties in 5 ms. (steps per millisecond=1432 )
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 452390 steps, run timeout after 3001 ms. (steps per millisecond=150 ) properties seen :{}
Probabilistic random walk after 452390 steps, saw 275465 distinct states, run finished after 3001 ms. (steps per millisecond=150 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 20:52:40] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:52:40] [INFO ] Invariant cache hit.
[2023-04-06 20:52:40] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:52:40] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-04-06 20:52:40] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-06 20:52:40] [INFO ] After 190ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:52:40] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 20:52:40] [INFO ] After 79ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:52:41] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2023-04-06 20:52:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2023-04-06 20:52:41] [INFO ] After 207ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2023-04-06 20:52:41] [INFO ] After 517ms 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 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 95 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 486/486 places, 2907/2907 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 447050 steps, run timeout after 3001 ms. (steps per millisecond=148 ) properties seen :{}
Probabilistic random walk after 447050 steps, saw 272417 distinct states, run finished after 3001 ms. (steps per millisecond=148 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 20:52:44] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:52:44] [INFO ] Invariant cache hit.
[2023-04-06 20:52:44] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:52:44] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-04-06 20:52:44] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-06 20:52:44] [INFO ] After 183ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:52:44] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 20:52:44] [INFO ] After 77ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:52:44] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2023-04-06 20:52:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2023-04-06 20:52:44] [INFO ] After 197ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-04-06 20:52:44] [INFO ] After 498ms 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 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 86 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 84 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2023-04-06 20:52:45] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:52:45] [INFO ] Invariant cache hit.
[2023-04-06 20:52:45] [INFO ] Implicit Places using invariants in 464 ms returned []
[2023-04-06 20:52:45] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:52:45] [INFO ] Invariant cache hit.
[2023-04-06 20:52:45] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 20:52:47] [INFO ] Implicit Places using invariants and state equation in 2332 ms returned []
Implicit Place search using SMT with State Equation took 2801 ms to find 0 implicit places.
[2023-04-06 20:52:47] [INFO ] Redundant transitions in 82 ms returned []
[2023-04-06 20:52:47] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:52:47] [INFO ] Invariant cache hit.
[2023-04-06 20:52:48] [INFO ] Dead Transitions using invariants and state equation in 804 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3779 ms. Remains : 486/486 places, 2907/2907 transitions.
Graph (trivial) has 2702 edges and 486 vertex of which 81 / 486 are part of one of the 9 SCC in 3 ms
Free SCC test removed 72 places
Drop transitions removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 414 transition count 515
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 195 place count 317 transition count 515
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 195 place count 317 transition count 496
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 242 place count 289 transition count 496
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 528 place count 146 transition count 353
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 2 with 70 rules applied. Total rules applied 598 place count 146 transition count 283
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 616 place count 137 transition count 283
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 625 place count 137 transition count 274
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 635 place count 137 transition count 264
Free-agglomeration rule applied 73 times.
Iterating global reduction 4 with 73 rules applied. Total rules applied 708 place count 137 transition count 191
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 4 with 73 rules applied. Total rules applied 781 place count 64 transition count 191
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 790 place count 64 transition count 191
Applied a total of 790 rules in 59 ms. Remains 64 /486 variables (removed 422) and now considering 191/2907 (removed 2716) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 191 rows 64 cols
[2023-04-06 20:52:48] [INFO ] Computed 19 invariants in 0 ms
[2023-04-06 20:52:48] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:52:48] [INFO ] [Nat]Absence check using 19 positive place invariants in 2 ms returned sat
[2023-04-06 20:52:48] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:52:48] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-04-06 20:52:48] [INFO ] After 5ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:52:48] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-04-06 20:52:48] [INFO ] After 73ms 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 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 453690 steps, run timeout after 3001 ms. (steps per millisecond=151 ) properties seen :{}
Probabilistic random walk after 453690 steps, saw 276121 distinct states, run finished after 3001 ms. (steps per millisecond=151 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 20:52:51] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2023-04-06 20:52:51] [INFO ] Computed 28 invariants in 21 ms
[2023-04-06 20:52:52] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:52:52] [INFO ] [Nat]Absence check using 19 positive place invariants in 11 ms returned sat
[2023-04-06 20:52:52] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-06 20:52:52] [INFO ] After 184ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:52:52] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 20:52:52] [INFO ] After 85ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:52:52] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2023-04-06 20:52:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2023-04-06 20:52:52] [INFO ] After 218ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-04-06 20:52:52] [INFO ] After 525ms 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 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 109 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 486/486 places, 2907/2907 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 451010 steps, run timeout after 3001 ms. (steps per millisecond=150 ) properties seen :{}
Probabilistic random walk after 451010 steps, saw 274832 distinct states, run finished after 3001 ms. (steps per millisecond=150 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 20:52:55] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:52:55] [INFO ] Invariant cache hit.
[2023-04-06 20:52:55] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:52:55] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-04-06 20:52:55] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-06 20:52:56] [INFO ] After 177ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:52:56] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 20:52:56] [INFO ] After 72ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:52:56] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-04-06 20:52:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2023-04-06 20:52:56] [INFO ] After 211ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-04-06 20:52:56] [INFO ] After 504ms 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 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 123 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 126 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2023-04-06 20:52:56] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:52:56] [INFO ] Invariant cache hit.
[2023-04-06 20:52:56] [INFO ] Implicit Places using invariants in 449 ms returned []
[2023-04-06 20:52:56] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:52:56] [INFO ] Invariant cache hit.
[2023-04-06 20:52:57] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 20:52:59] [INFO ] Implicit Places using invariants and state equation in 2419 ms returned []
Implicit Place search using SMT with State Equation took 2873 ms to find 0 implicit places.
[2023-04-06 20:52:59] [INFO ] Redundant transitions in 78 ms returned []
[2023-04-06 20:52:59] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:52:59] [INFO ] Invariant cache hit.
[2023-04-06 20:53:00] [INFO ] Dead Transitions using invariants and state equation in 834 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3919 ms. Remains : 486/486 places, 2907/2907 transitions.
Graph (trivial) has 2702 edges and 486 vertex of which 81 / 486 are part of one of the 9 SCC in 1 ms
Free SCC test removed 72 places
Drop transitions removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 414 transition count 515
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 195 place count 317 transition count 515
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 195 place count 317 transition count 496
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 242 place count 289 transition count 496
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 528 place count 146 transition count 353
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 2 with 70 rules applied. Total rules applied 598 place count 146 transition count 283
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 616 place count 137 transition count 283
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 625 place count 137 transition count 274
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 635 place count 137 transition count 264
Free-agglomeration rule applied 73 times.
Iterating global reduction 4 with 73 rules applied. Total rules applied 708 place count 137 transition count 191
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 4 with 73 rules applied. Total rules applied 781 place count 64 transition count 191
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 790 place count 64 transition count 191
Applied a total of 790 rules in 32 ms. Remains 64 /486 variables (removed 422) and now considering 191/2907 (removed 2716) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 191 rows 64 cols
[2023-04-06 20:53:00] [INFO ] Computed 19 invariants in 0 ms
[2023-04-06 20:53:00] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:53:00] [INFO ] [Nat]Absence check using 19 positive place invariants in 2 ms returned sat
[2023-04-06 20:53:00] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:53:00] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-04-06 20:53:00] [INFO ] After 6ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:53:00] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-04-06 20:53:00] [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 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 458980 steps, run timeout after 3001 ms. (steps per millisecond=152 ) properties seen :{}
Probabilistic random walk after 458980 steps, saw 278513 distinct states, run finished after 3001 ms. (steps per millisecond=152 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 20:53:03] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2023-04-06 20:53:03] [INFO ] Computed 28 invariants in 12 ms
[2023-04-06 20:53:03] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:53:03] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-04-06 20:53:03] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-06 20:53:03] [INFO ] After 183ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:53:03] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 20:53:03] [INFO ] After 85ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:53:04] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 0 ms to minimize.
[2023-04-06 20:53:04] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2023-04-06 20:53:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 200 ms
[2023-04-06 20:53:04] [INFO ] After 309ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-04-06 20:53:04] [INFO ] After 605ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 91 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 486/486 places, 2907/2907 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 464490 steps, run timeout after 3001 ms. (steps per millisecond=154 ) properties seen :{}
Probabilistic random walk after 464490 steps, saw 281695 distinct states, run finished after 3001 ms. (steps per millisecond=154 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 20:53:07] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:53:07] [INFO ] Invariant cache hit.
[2023-04-06 20:53:07] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:53:07] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-04-06 20:53:07] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-06 20:53:07] [INFO ] After 184ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:53:07] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 20:53:07] [INFO ] After 91ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:53:07] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2023-04-06 20:53:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2023-04-06 20:53:07] [INFO ] After 231ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-04-06 20:53:07] [INFO ] After 534ms 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 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 83 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 86 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2023-04-06 20:53:08] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:53:08] [INFO ] Invariant cache hit.
[2023-04-06 20:53:08] [INFO ] Implicit Places using invariants in 440 ms returned []
[2023-04-06 20:53:08] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:53:08] [INFO ] Invariant cache hit.
[2023-04-06 20:53:08] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 20:53:10] [INFO ] Implicit Places using invariants and state equation in 2311 ms returned []
Implicit Place search using SMT with State Equation took 2753 ms to find 0 implicit places.
[2023-04-06 20:53:10] [INFO ] Redundant transitions in 77 ms returned []
[2023-04-06 20:53:10] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:53:10] [INFO ] Invariant cache hit.
[2023-04-06 20:53:11] [INFO ] Dead Transitions using invariants and state equation in 816 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3740 ms. Remains : 486/486 places, 2907/2907 transitions.
Graph (trivial) has 2702 edges and 486 vertex of which 81 / 486 are part of one of the 9 SCC in 0 ms
Free SCC test removed 72 places
Drop transitions removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 414 transition count 515
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 195 place count 317 transition count 515
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 195 place count 317 transition count 496
Deduced a syphon composed of 19 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 242 place count 289 transition count 496
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 528 place count 146 transition count 353
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 2 with 70 rules applied. Total rules applied 598 place count 146 transition count 283
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 616 place count 137 transition count 283
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 625 place count 137 transition count 274
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 635 place count 137 transition count 264
Free-agglomeration rule applied 73 times.
Iterating global reduction 4 with 73 rules applied. Total rules applied 708 place count 137 transition count 191
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 4 with 73 rules applied. Total rules applied 781 place count 64 transition count 191
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 790 place count 64 transition count 191
Applied a total of 790 rules in 31 ms. Remains 64 /486 variables (removed 422) and now considering 191/2907 (removed 2716) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 191 rows 64 cols
[2023-04-06 20:53:11] [INFO ] Computed 19 invariants in 2 ms
[2023-04-06 20:53:11] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:53:11] [INFO ] [Nat]Absence check using 19 positive place invariants in 5 ms returned sat
[2023-04-06 20:53:11] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:53:11] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-04-06 20:53:11] [INFO ] After 5ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:53:11] [INFO ] After 12ms 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:53:11] [INFO ] After 80ms 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 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 465230 steps, run timeout after 3001 ms. (steps per millisecond=155 ) properties seen :{}
Probabilistic random walk after 465230 steps, saw 282076 distinct states, run finished after 3002 ms. (steps per millisecond=154 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 20:53:14] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2023-04-06 20:53:14] [INFO ] Computed 28 invariants in 9 ms
[2023-04-06 20:53:14] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:53:15] [INFO ] [Nat]Absence check using 19 positive place invariants in 18 ms returned sat
[2023-04-06 20:53:15] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 5 ms returned sat
[2023-04-06 20:53:15] [INFO ] After 188ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:53:15] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 20:53:15] [INFO ] After 93ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:53:15] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2023-04-06 20:53:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2023-04-06 20:53:15] [INFO ] After 231ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-04-06 20:53:15] [INFO ] After 553ms 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 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 81 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 486/486 places, 2907/2907 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) 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 467740 steps, run timeout after 3001 ms. (steps per millisecond=155 ) properties seen :{}
Probabilistic random walk after 467740 steps, saw 283586 distinct states, run finished after 3001 ms. (steps per millisecond=155 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 20:53:18] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:53:18] [INFO ] Invariant cache hit.
[2023-04-06 20:53:18] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:53:18] [INFO ] [Nat]Absence check using 19 positive place invariants in 21 ms returned sat
[2023-04-06 20:53:18] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-06 20:53:18] [INFO ] After 178ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:53:18] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 20:53:19] [INFO ] After 84ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:53:19] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 0 ms to minimize.
[2023-04-06 20:53:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2023-04-06 20:53:19] [INFO ] After 222ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2023-04-06 20:53:19] [INFO ] After 537ms 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 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 82 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 83 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2023-04-06 20:53:19] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:53:19] [INFO ] Invariant cache hit.
[2023-04-06 20:53:19] [INFO ] Implicit Places using invariants in 437 ms returned []
[2023-04-06 20:53:19] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:53:19] [INFO ] Invariant cache hit.
[2023-04-06 20:53:20] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 20:53:22] [INFO ] Implicit Places using invariants and state equation in 2276 ms returned []
Implicit Place search using SMT with State Equation took 2714 ms to find 0 implicit places.
[2023-04-06 20:53:22] [INFO ] Redundant transitions in 80 ms returned []
[2023-04-06 20:53:22] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:53:22] [INFO ] Invariant cache hit.
[2023-04-06 20:53:23] [INFO ] Dead Transitions using invariants and state equation in 808 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3691 ms. Remains : 486/486 places, 2907/2907 transitions.
Graph (trivial) has 2702 edges and 486 vertex of which 81 / 486 are part of one of the 9 SCC in 0 ms
Free SCC test removed 72 places
Drop transitions removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 414 transition count 515
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 195 place count 317 transition count 515
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 195 place count 317 transition count 496
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 242 place count 289 transition count 496
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 528 place count 146 transition count 353
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 2 with 70 rules applied. Total rules applied 598 place count 146 transition count 283
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 616 place count 137 transition count 283
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 625 place count 137 transition count 274
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 635 place count 137 transition count 264
Free-agglomeration rule applied 73 times.
Iterating global reduction 4 with 73 rules applied. Total rules applied 708 place count 137 transition count 191
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 4 with 73 rules applied. Total rules applied 781 place count 64 transition count 191
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 790 place count 64 transition count 191
Applied a total of 790 rules in 22 ms. Remains 64 /486 variables (removed 422) and now considering 191/2907 (removed 2716) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 191 rows 64 cols
[2023-04-06 20:53:23] [INFO ] Computed 19 invariants in 2 ms
[2023-04-06 20:53:23] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:53:23] [INFO ] [Nat]Absence check using 19 positive place invariants in 2 ms returned sat
[2023-04-06 20:53:23] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:53:23] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-04-06 20:53:23] [INFO ] After 5ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:53:23] [INFO ] After 11ms 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:53:23] [INFO ] After 69ms 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 467270 steps, run timeout after 3001 ms. (steps per millisecond=155 ) properties seen :{}
Probabilistic random walk after 467270 steps, saw 283363 distinct states, run finished after 3001 ms. (steps per millisecond=155 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 20:53:26] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2023-04-06 20:53:26] [INFO ] Computed 28 invariants in 8 ms
[2023-04-06 20:53:26] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:53:26] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-04-06 20:53:26] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 12 ms returned sat
[2023-04-06 20:53:26] [INFO ] After 176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:53:26] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 20:53:26] [INFO ] After 80ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:53:26] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 0 ms to minimize.
[2023-04-06 20:53:26] [INFO ] Deduced a trap composed of 3 places in 99 ms of which 0 ms to minimize.
[2023-04-06 20:53:26] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 0 ms to minimize.
[2023-04-06 20:53:27] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 0 ms to minimize.
[2023-04-06 20:53:27] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 0 ms to minimize.
[2023-04-06 20:53:27] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2023-04-06 20:53:27] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 698 ms
[2023-04-06 20:53:27] [INFO ] After 805ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-04-06 20:53:27] [INFO ] After 1109ms 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 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 80 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 486/486 places, 2907/2907 transitions.
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 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 468830 steps, run timeout after 3001 ms. (steps per millisecond=156 ) properties seen :{}
Probabilistic random walk after 468830 steps, saw 284097 distinct states, run finished after 3001 ms. (steps per millisecond=156 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 20:53:30] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:53:30] [INFO ] Invariant cache hit.
[2023-04-06 20:53:30] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:53:30] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-04-06 20:53:30] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-06 20:53:30] [INFO ] After 180ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:53:30] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 20:53:30] [INFO ] After 73ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:53:30] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2023-04-06 20:53:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2023-04-06 20:53:30] [INFO ] After 203ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-04-06 20:53:31] [INFO ] After 500ms 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 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 81 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 82 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2023-04-06 20:53:31] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:53:31] [INFO ] Invariant cache hit.
[2023-04-06 20:53:31] [INFO ] Implicit Places using invariants in 437 ms returned []
[2023-04-06 20:53:31] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:53:31] [INFO ] Invariant cache hit.
[2023-04-06 20:53:31] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 20:53:33] [INFO ] Implicit Places using invariants and state equation in 2313 ms returned []
Implicit Place search using SMT with State Equation took 2752 ms to find 0 implicit places.
[2023-04-06 20:53:34] [INFO ] Redundant transitions in 80 ms returned []
[2023-04-06 20:53:34] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:53:34] [INFO ] Invariant cache hit.
[2023-04-06 20:53:34] [INFO ] Dead Transitions using invariants and state equation in 795 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3718 ms. Remains : 486/486 places, 2907/2907 transitions.
Graph (trivial) has 2702 edges and 486 vertex of which 81 / 486 are part of one of the 9 SCC in 0 ms
Free SCC test removed 72 places
Drop transitions removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 414 transition count 515
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 195 place count 317 transition count 515
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 195 place count 317 transition count 496
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 242 place count 289 transition count 496
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 528 place count 146 transition count 353
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 2 with 70 rules applied. Total rules applied 598 place count 146 transition count 283
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 616 place count 137 transition count 283
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 625 place count 137 transition count 274
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 635 place count 137 transition count 264
Free-agglomeration rule applied 73 times.
Iterating global reduction 4 with 73 rules applied. Total rules applied 708 place count 137 transition count 191
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 4 with 73 rules applied. Total rules applied 781 place count 64 transition count 191
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 790 place count 64 transition count 191
Applied a total of 790 rules in 25 ms. Remains 64 /486 variables (removed 422) and now considering 191/2907 (removed 2716) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 191 rows 64 cols
[2023-04-06 20:53:34] [INFO ] Computed 19 invariants in 1 ms
[2023-04-06 20:53:34] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:53:34] [INFO ] [Nat]Absence check using 19 positive place invariants in 2 ms returned sat
[2023-04-06 20:53:34] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:53:34] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-04-06 20:53:34] [INFO ] After 5ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:53:34] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-04-06 20:53:34] [INFO ] After 69ms 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 25 ms. (steps per millisecond=400 ) 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 464260 steps, run timeout after 3001 ms. (steps per millisecond=154 ) properties seen :{}
Probabilistic random walk after 464260 steps, saw 281533 distinct states, run finished after 3001 ms. (steps per millisecond=154 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 20:53:37] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2023-04-06 20:53:38] [INFO ] Computed 28 invariants in 4 ms
[2023-04-06 20:53:38] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:53:38] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-04-06 20:53:38] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-06 20:53:38] [INFO ] After 184ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:53:38] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 20:53:38] [INFO ] After 74ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:53:38] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2023-04-06 20:53:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2023-04-06 20:53:38] [INFO ] After 194ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-04-06 20:53:38] [INFO ] After 503ms 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 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 82 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 486/486 places, 2907/2907 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 466140 steps, run timeout after 3001 ms. (steps per millisecond=155 ) properties seen :{}
Probabilistic random walk after 466140 steps, saw 282665 distinct states, run finished after 3001 ms. (steps per millisecond=155 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 20:53:41] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:53:41] [INFO ] Invariant cache hit.
[2023-04-06 20:53:41] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:53:41] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-04-06 20:53:41] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-06 20:53:42] [INFO ] After 187ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:53:42] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 20:53:42] [INFO ] After 74ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:53:42] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2023-04-06 20:53:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2023-04-06 20:53:42] [INFO ] After 196ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-04-06 20:53:42] [INFO ] After 499ms 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 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 83 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 85 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2023-04-06 20:53:42] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:53:42] [INFO ] Invariant cache hit.
[2023-04-06 20:53:42] [INFO ] Implicit Places using invariants in 461 ms returned []
[2023-04-06 20:53:42] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:53:42] [INFO ] Invariant cache hit.
[2023-04-06 20:53:43] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 20:53:45] [INFO ] Implicit Places using invariants and state equation in 2313 ms returned []
Implicit Place search using SMT with State Equation took 2777 ms to find 0 implicit places.
[2023-04-06 20:53:45] [INFO ] Redundant transitions in 82 ms returned []
[2023-04-06 20:53:45] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:53:45] [INFO ] Invariant cache hit.
[2023-04-06 20:53:46] [INFO ] Dead Transitions using invariants and state equation in 786 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3743 ms. Remains : 486/486 places, 2907/2907 transitions.
Graph (trivial) has 2702 edges and 486 vertex of which 81 / 486 are part of one of the 9 SCC in 0 ms
Free SCC test removed 72 places
Drop transitions removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 414 transition count 515
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 195 place count 317 transition count 515
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 195 place count 317 transition count 496
Deduced a syphon composed of 19 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 242 place count 289 transition count 496
Performed 144 Post agglomeration using F-continuation condition.Transition count delta: 144
Deduced a syphon composed of 144 places in 0 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 2 with 288 rules applied. Total rules applied 530 place count 145 transition count 352
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 71 transitions.
Iterating post reduction 2 with 71 rules applied. Total rules applied 601 place count 145 transition count 281
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 617 place count 137 transition count 281
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 625 place count 137 transition count 273
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 634 place count 137 transition count 264
Free-agglomeration rule applied 73 times.
Iterating global reduction 4 with 73 rules applied. Total rules applied 707 place count 137 transition count 191
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 4 with 73 rules applied. Total rules applied 780 place count 64 transition count 191
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 789 place count 64 transition count 191
Applied a total of 789 rules in 28 ms. Remains 64 /486 variables (removed 422) and now considering 191/2907 (removed 2716) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 191 rows 64 cols
[2023-04-06 20:53:46] [INFO ] Computed 19 invariants in 0 ms
[2023-04-06 20:53:46] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:53:46] [INFO ] [Nat]Absence check using 19 positive place invariants in 3 ms returned sat
[2023-04-06 20:53:46] [INFO ] After 28ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:53:46] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-04-06 20:53:46] [INFO ] After 4ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:53:46] [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:53:46] [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 25 ms. (steps per millisecond=400 ) 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 467520 steps, run timeout after 3001 ms. (steps per millisecond=155 ) properties seen :{}
Probabilistic random walk after 467520 steps, saw 283444 distinct states, run finished after 3001 ms. (steps per millisecond=155 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 20:53:49] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2023-04-06 20:53:49] [INFO ] Computed 28 invariants in 5 ms
[2023-04-06 20:53:49] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:53:49] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-04-06 20:53:49] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-06 20:53:49] [INFO ] After 179ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:53:49] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 20:53:49] [INFO ] After 74ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:53:49] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2023-04-06 20:53:49] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2023-04-06 20:53:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 186 ms
[2023-04-06 20:53:49] [INFO ] After 280ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-04-06 20:53:49] [INFO ] After 579ms 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 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 81 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 486/486 places, 2907/2907 transitions.
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 468480 steps, run timeout after 3001 ms. (steps per millisecond=156 ) properties seen :{}
Probabilistic random walk after 468480 steps, saw 283936 distinct states, run finished after 3001 ms. (steps per millisecond=156 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 20:53:52] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:53:52] [INFO ] Invariant cache hit.
[2023-04-06 20:53:53] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:53:53] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-04-06 20:53:53] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-06 20:53:53] [INFO ] After 173ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:53:53] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 20:53:53] [INFO ] After 67ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:53:53] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2023-04-06 20:53:53] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 0 ms to minimize.
[2023-04-06 20:53:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 194 ms
[2023-04-06 20:53:53] [INFO ] After 280ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-04-06 20:53:53] [INFO ] After 574ms 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 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 80 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 83 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2023-04-06 20:53:53] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:53:53] [INFO ] Invariant cache hit.
[2023-04-06 20:53:54] [INFO ] Implicit Places using invariants in 436 ms returned []
[2023-04-06 20:53:54] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:53:54] [INFO ] Invariant cache hit.
[2023-04-06 20:53:54] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 20:53:56] [INFO ] Implicit Places using invariants and state equation in 2084 ms returned []
Implicit Place search using SMT with State Equation took 2522 ms to find 0 implicit places.
[2023-04-06 20:53:56] [INFO ] Redundant transitions in 81 ms returned []
[2023-04-06 20:53:56] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:53:56] [INFO ] Invariant cache hit.
[2023-04-06 20:53:57] [INFO ] Dead Transitions using invariants and state equation in 783 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3479 ms. Remains : 486/486 places, 2907/2907 transitions.
Graph (trivial) has 2725 edges and 486 vertex of which 81 / 486 are part of one of the 9 SCC in 0 ms
Free SCC test removed 72 places
Drop transitions removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 414 transition count 514
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 316 transition count 514
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 197 place count 316 transition count 495
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 244 place count 288 transition count 495
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 1 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 530 place count 145 transition count 352
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 602 place count 145 transition count 280
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 620 place count 136 transition count 280
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 629 place count 136 transition count 271
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 638 place count 136 transition count 262
Free-agglomeration rule applied 72 times.
Iterating global reduction 4 with 72 rules applied. Total rules applied 710 place count 136 transition count 190
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 4 with 72 rules applied. Total rules applied 782 place count 64 transition count 190
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 791 place count 64 transition count 190
Applied a total of 791 rules in 22 ms. Remains 64 /486 variables (removed 422) and now considering 190/2907 (removed 2717) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 190 rows 64 cols
[2023-04-06 20:53:57] [INFO ] Computed 19 invariants in 1 ms
[2023-04-06 20:53:57] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:53:57] [INFO ] [Nat]Absence check using 19 positive place invariants in 3 ms returned sat
[2023-04-06 20:53:57] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:53:57] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-04-06 20:53:57] [INFO ] After 5ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:53:57] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-04-06 20:53:57] [INFO ] After 70ms 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 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 468530 steps, run timeout after 3001 ms. (steps per millisecond=156 ) properties seen :{}
Probabilistic random walk after 468530 steps, saw 283950 distinct states, run finished after 3001 ms. (steps per millisecond=156 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 20:54:00] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2023-04-06 20:54:00] [INFO ] Computed 28 invariants in 9 ms
[2023-04-06 20:54:00] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:54:00] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-04-06 20:54:00] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-06 20:54:00] [INFO ] After 179ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:54:00] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 20:54:00] [INFO ] After 75ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:54:00] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-04-06 20:54:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2023-04-06 20:54:00] [INFO ] After 196ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-04-06 20:54:00] [INFO ] After 488ms 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 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 81 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 486/486 places, 2907/2907 transitions.
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 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 470400 steps, run timeout after 3001 ms. (steps per millisecond=156 ) properties seen :{}
Probabilistic random walk after 470400 steps, saw 284903 distinct states, run finished after 3001 ms. (steps per millisecond=156 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 20:54:04] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:54:04] [INFO ] Invariant cache hit.
[2023-04-06 20:54:04] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:54:04] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-04-06 20:54:04] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-06 20:54:04] [INFO ] After 177ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:54:04] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 20:54:04] [INFO ] After 64ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:54:04] [INFO ] After 106ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-04-06 20:54:04] [INFO ] After 393ms 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 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 81 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 84 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2023-04-06 20:54:04] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:54:04] [INFO ] Invariant cache hit.
[2023-04-06 20:54:05] [INFO ] Implicit Places using invariants in 428 ms returned []
[2023-04-06 20:54:05] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:54:05] [INFO ] Invariant cache hit.
[2023-04-06 20:54:05] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 20:54:07] [INFO ] Implicit Places using invariants and state equation in 2277 ms returned []
Implicit Place search using SMT with State Equation took 2706 ms to find 0 implicit places.
[2023-04-06 20:54:07] [INFO ] Redundant transitions in 83 ms returned []
[2023-04-06 20:54:07] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:54:07] [INFO ] Invariant cache hit.
[2023-04-06 20:54:08] [INFO ] Dead Transitions using invariants and state equation in 787 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3672 ms. Remains : 486/486 places, 2907/2907 transitions.
Graph (trivial) has 2725 edges and 486 vertex of which 81 / 486 are part of one of the 9 SCC in 0 ms
Free SCC test removed 72 places
Drop transitions removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 414 transition count 514
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 316 transition count 514
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 197 place count 316 transition count 495
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 244 place count 288 transition count 495
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 530 place count 145 transition count 352
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 602 place count 145 transition count 280
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 620 place count 136 transition count 280
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 629 place count 136 transition count 271
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 638 place count 136 transition count 262
Free-agglomeration rule applied 72 times.
Iterating global reduction 4 with 72 rules applied. Total rules applied 710 place count 136 transition count 190
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 4 with 72 rules applied. Total rules applied 782 place count 64 transition count 190
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 791 place count 64 transition count 190
Applied a total of 791 rules in 21 ms. Remains 64 /486 variables (removed 422) and now considering 190/2907 (removed 2717) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 190 rows 64 cols
[2023-04-06 20:54:08] [INFO ] Computed 19 invariants in 1 ms
[2023-04-06 20:54:08] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:54:08] [INFO ] [Nat]Absence check using 19 positive place invariants in 2 ms returned sat
[2023-04-06 20:54:08] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:54:08] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-04-06 20:54:08] [INFO ] After 5ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:54:08] [INFO ] After 11ms 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:54:08] [INFO ] After 68ms 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 25 ms. (steps per millisecond=400 ) 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 468680 steps, run timeout after 3001 ms. (steps per millisecond=156 ) properties seen :{}
Probabilistic random walk after 468680 steps, saw 284017 distinct states, run finished after 3001 ms. (steps per millisecond=156 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 20:54:11] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2023-04-06 20:54:11] [INFO ] Computed 28 invariants in 7 ms
[2023-04-06 20:54:11] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:54:11] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-04-06 20:54:11] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-06 20:54:11] [INFO ] After 163ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:54:11] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 20:54:11] [INFO ] After 65ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:54:11] [INFO ] After 112ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-04-06 20:54:11] [INFO ] After 398ms 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 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 80 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 486/486 places, 2907/2907 transitions.
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 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 469860 steps, run timeout after 3001 ms. (steps per millisecond=156 ) properties seen :{}
Probabilistic random walk after 469860 steps, saw 284625 distinct states, run finished after 3001 ms. (steps per millisecond=156 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 20:54:14] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:54:14] [INFO ] Invariant cache hit.
[2023-04-06 20:54:15] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:54:15] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-04-06 20:54:15] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-06 20:54:15] [INFO ] After 167ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:54:15] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 20:54:15] [INFO ] After 70ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:54:15] [INFO ] After 121ms 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:54:15] [INFO ] After 412ms 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 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 82 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 82 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2023-04-06 20:54:15] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:54:15] [INFO ] Invariant cache hit.
[2023-04-06 20:54:16] [INFO ] Implicit Places using invariants in 432 ms returned []
[2023-04-06 20:54:16] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:54:16] [INFO ] Invariant cache hit.
[2023-04-06 20:54:16] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 20:54:18] [INFO ] Implicit Places using invariants and state equation in 2325 ms returned []
Implicit Place search using SMT with State Equation took 2758 ms to find 0 implicit places.
[2023-04-06 20:54:18] [INFO ] Redundant transitions in 82 ms returned []
[2023-04-06 20:54:18] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:54:18] [INFO ] Invariant cache hit.
[2023-04-06 20:54:19] [INFO ] Dead Transitions using invariants and state equation in 813 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3747 ms. Remains : 486/486 places, 2907/2907 transitions.
Graph (trivial) has 2725 edges and 486 vertex of which 81 / 486 are part of one of the 9 SCC in 1 ms
Free SCC test removed 72 places
Drop transitions removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 414 transition count 514
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 316 transition count 514
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 197 place count 316 transition count 495
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 244 place count 288 transition count 495
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 1 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 530 place count 145 transition count 352
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 602 place count 145 transition count 280
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 620 place count 136 transition count 280
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 629 place count 136 transition count 271
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 638 place count 136 transition count 262
Free-agglomeration rule applied 72 times.
Iterating global reduction 4 with 72 rules applied. Total rules applied 710 place count 136 transition count 190
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 4 with 72 rules applied. Total rules applied 782 place count 64 transition count 190
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 791 place count 64 transition count 190
Applied a total of 791 rules in 21 ms. Remains 64 /486 variables (removed 422) and now considering 190/2907 (removed 2717) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 190 rows 64 cols
[2023-04-06 20:54:19] [INFO ] Computed 19 invariants in 1 ms
[2023-04-06 20:54:19] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:54:19] [INFO ] [Nat]Absence check using 19 positive place invariants in 3 ms returned sat
[2023-04-06 20:54:19] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:54:19] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-04-06 20:54:19] [INFO ] After 5ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:54:19] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-04-06 20:54:19] [INFO ] After 79ms 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 25 ms. (steps per millisecond=400 ) 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 468740 steps, run timeout after 3001 ms. (steps per millisecond=156 ) properties seen :{}
Probabilistic random walk after 468740 steps, saw 284051 distinct states, run finished after 3001 ms. (steps per millisecond=156 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 20:54:22] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2023-04-06 20:54:22] [INFO ] Computed 28 invariants in 6 ms
[2023-04-06 20:54:22] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:54:22] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-04-06 20:54:22] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-06 20:54:22] [INFO ] After 174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:54:22] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 20:54:22] [INFO ] After 72ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:54:22] [INFO ] After 120ms 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:54:22] [INFO ] After 409ms 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 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 81 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 486/486 places, 2907/2907 transitions.
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 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 468790 steps, run timeout after 3001 ms. (steps per millisecond=156 ) properties seen :{}
Probabilistic random walk after 468790 steps, saw 284074 distinct states, run finished after 3001 ms. (steps per millisecond=156 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 20:54:26] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:54:26] [INFO ] Invariant cache hit.
[2023-04-06 20:54:26] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:54:26] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-04-06 20:54:26] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-06 20:54:26] [INFO ] After 179ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:54:26] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 20:54:26] [INFO ] After 70ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:54:26] [INFO ] After 115ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-04-06 20:54:26] [INFO ] After 403ms 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 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 81 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 82 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2023-04-06 20:54:26] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:54:26] [INFO ] Invariant cache hit.
[2023-04-06 20:54:27] [INFO ] Implicit Places using invariants in 446 ms returned []
[2023-04-06 20:54:27] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:54:27] [INFO ] Invariant cache hit.
[2023-04-06 20:54:27] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 20:54:29] [INFO ] Implicit Places using invariants and state equation in 2340 ms returned []
Implicit Place search using SMT with State Equation took 2786 ms to find 0 implicit places.
[2023-04-06 20:54:29] [INFO ] Redundant transitions in 80 ms returned []
[2023-04-06 20:54:29] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:54:29] [INFO ] Invariant cache hit.
[2023-04-06 20:54:30] [INFO ] Dead Transitions using invariants and state equation in 772 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3734 ms. Remains : 486/486 places, 2907/2907 transitions.
Graph (trivial) has 2725 edges and 486 vertex of which 81 / 486 are part of one of the 9 SCC in 1 ms
Free SCC test removed 72 places
Drop transitions removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 414 transition count 514
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 316 transition count 514
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 197 place count 316 transition count 495
Deduced a syphon composed of 19 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 244 place count 288 transition count 495
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 1 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 530 place count 145 transition count 352
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 602 place count 145 transition count 280
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 620 place count 136 transition count 280
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 629 place count 136 transition count 271
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 638 place count 136 transition count 262
Free-agglomeration rule applied 72 times.
Iterating global reduction 4 with 72 rules applied. Total rules applied 710 place count 136 transition count 190
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 4 with 72 rules applied. Total rules applied 782 place count 64 transition count 190
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 791 place count 64 transition count 190
Applied a total of 791 rules in 24 ms. Remains 64 /486 variables (removed 422) and now considering 190/2907 (removed 2717) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 190 rows 64 cols
[2023-04-06 20:54:30] [INFO ] Computed 19 invariants in 1 ms
[2023-04-06 20:54:30] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:54:30] [INFO ] [Nat]Absence check using 19 positive place invariants in 3 ms returned sat
[2023-04-06 20:54:30] [INFO ] After 28ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:54:30] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-04-06 20:54:30] [INFO ] After 5ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:54:30] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-04-06 20:54:30] [INFO ] After 81ms 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 469270 steps, run timeout after 3001 ms. (steps per millisecond=156 ) properties seen :{}
Probabilistic random walk after 469270 steps, saw 284341 distinct states, run finished after 3001 ms. (steps per millisecond=156 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 20:54:33] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2023-04-06 20:54:33] [INFO ] Computed 28 invariants in 6 ms
[2023-04-06 20:54:33] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:54:33] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2023-04-06 20:54:33] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 5 ms returned sat
[2023-04-06 20:54:33] [INFO ] After 156ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:54:33] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 20:54:33] [INFO ] After 61ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:54:33] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-04-06 20:54:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2023-04-06 20:54:34] [INFO ] After 171ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-04-06 20:54:34] [INFO ] After 451ms 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 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 80 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 486/486 places, 2907/2907 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 468570 steps, run timeout after 3001 ms. (steps per millisecond=156 ) properties seen :{}
Probabilistic random walk after 468570 steps, saw 283964 distinct states, run finished after 3001 ms. (steps per millisecond=156 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 20:54:37] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:54:37] [INFO ] Invariant cache hit.
[2023-04-06 20:54:37] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:54:37] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-04-06 20:54:37] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-06 20:54:37] [INFO ] After 173ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:54:37] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 20:54:37] [INFO ] After 67ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:54:37] [INFO ] After 110ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-04-06 20:54:37] [INFO ] After 407ms 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 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 81 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 83 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2023-04-06 20:54:37] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:54:37] [INFO ] Invariant cache hit.
[2023-04-06 20:54:38] [INFO ] Implicit Places using invariants in 440 ms returned []
[2023-04-06 20:54:38] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:54:38] [INFO ] Invariant cache hit.
[2023-04-06 20:54:38] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 20:54:40] [INFO ] Implicit Places using invariants and state equation in 2126 ms returned []
Implicit Place search using SMT with State Equation took 2568 ms to find 0 implicit places.
[2023-04-06 20:54:40] [INFO ] Redundant transitions in 78 ms returned []
[2023-04-06 20:54:40] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:54:40] [INFO ] Invariant cache hit.
[2023-04-06 20:54:41] [INFO ] Dead Transitions using invariants and state equation in 783 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3517 ms. Remains : 486/486 places, 2907/2907 transitions.
Graph (trivial) has 2725 edges and 486 vertex of which 81 / 486 are part of one of the 9 SCC in 0 ms
Free SCC test removed 72 places
Drop transitions removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 414 transition count 514
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 316 transition count 514
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 197 place count 316 transition count 495
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 244 place count 288 transition count 495
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 530 place count 145 transition count 352
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 602 place count 145 transition count 280
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 620 place count 136 transition count 280
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 629 place count 136 transition count 271
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 638 place count 136 transition count 262
Free-agglomeration rule applied 72 times.
Iterating global reduction 4 with 72 rules applied. Total rules applied 710 place count 136 transition count 190
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 4 with 72 rules applied. Total rules applied 782 place count 64 transition count 190
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 791 place count 64 transition count 190
Applied a total of 791 rules in 18 ms. Remains 64 /486 variables (removed 422) and now considering 190/2907 (removed 2717) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 190 rows 64 cols
[2023-04-06 20:54:41] [INFO ] Computed 19 invariants in 1 ms
[2023-04-06 20:54:41] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:54:41] [INFO ] [Nat]Absence check using 19 positive place invariants in 2 ms returned sat
[2023-04-06 20:54:41] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:54:41] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-04-06 20:54:41] [INFO ] After 5ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:54:41] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-04-06 20:54:41] [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 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 468580 steps, run timeout after 3001 ms. (steps per millisecond=156 ) properties seen :{}
Probabilistic random walk after 468580 steps, saw 283968 distinct states, run finished after 3001 ms. (steps per millisecond=156 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 20:54:44] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2023-04-06 20:54:44] [INFO ] Computed 28 invariants in 6 ms
[2023-04-06 20:54:44] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:54:44] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-04-06 20:54:44] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-06 20:54:44] [INFO ] After 175ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:54:44] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 20:54:44] [INFO ] After 64ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:54:44] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2023-04-06 20:54:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2023-04-06 20:54:44] [INFO ] After 182ms 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:54:44] [INFO ] After 466ms 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 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 81 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 486/486 places, 2907/2907 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 469730 steps, run timeout after 3001 ms. (steps per millisecond=156 ) properties seen :{}
Probabilistic random walk after 469730 steps, saw 284542 distinct states, run finished after 3001 ms. (steps per millisecond=156 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 20:54:48] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:54:48] [INFO ] Invariant cache hit.
[2023-04-06 20:54:48] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:54:48] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-04-06 20:54:48] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-06 20:54:48] [INFO ] After 170ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:54:48] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 20:54:48] [INFO ] After 61ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:54:48] [INFO ] After 105ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-04-06 20:54:48] [INFO ] After 389ms 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 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 79 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 82 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2023-04-06 20:54:48] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:54:48] [INFO ] Invariant cache hit.
[2023-04-06 20:54:49] [INFO ] Implicit Places using invariants in 442 ms returned []
[2023-04-06 20:54:49] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:54:49] [INFO ] Invariant cache hit.
[2023-04-06 20:54:49] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 20:54:51] [INFO ] Implicit Places using invariants and state equation in 2364 ms returned []
Implicit Place search using SMT with State Equation took 2808 ms to find 0 implicit places.
[2023-04-06 20:54:51] [INFO ] Redundant transitions in 78 ms returned []
[2023-04-06 20:54:51] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:54:51] [INFO ] Invariant cache hit.
[2023-04-06 20:54:52] [INFO ] Dead Transitions using invariants and state equation in 790 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3764 ms. Remains : 486/486 places, 2907/2907 transitions.
Graph (trivial) has 2725 edges and 486 vertex of which 81 / 486 are part of one of the 9 SCC in 1 ms
Free SCC test removed 72 places
Drop transitions removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 414 transition count 514
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 316 transition count 514
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 197 place count 316 transition count 495
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 244 place count 288 transition count 495
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 530 place count 145 transition count 352
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 602 place count 145 transition count 280
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 620 place count 136 transition count 280
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 629 place count 136 transition count 271
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 638 place count 136 transition count 262
Free-agglomeration rule applied 72 times.
Iterating global reduction 4 with 72 rules applied. Total rules applied 710 place count 136 transition count 190
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 4 with 72 rules applied. Total rules applied 782 place count 64 transition count 190
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 791 place count 64 transition count 190
Applied a total of 791 rules in 19 ms. Remains 64 /486 variables (removed 422) and now considering 190/2907 (removed 2717) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 190 rows 64 cols
[2023-04-06 20:54:52] [INFO ] Computed 19 invariants in 0 ms
[2023-04-06 20:54:52] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:54:52] [INFO ] [Nat]Absence check using 19 positive place invariants in 3 ms returned sat
[2023-04-06 20:54:52] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:54:52] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-04-06 20:54:52] [INFO ] After 5ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:54:52] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-04-06 20:54:52] [INFO ] After 77ms 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 467220 steps, run timeout after 3001 ms. (steps per millisecond=155 ) properties seen :{}
Probabilistic random walk after 467220 steps, saw 283344 distinct states, run finished after 3001 ms. (steps per millisecond=155 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 20:54:55] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2023-04-06 20:54:55] [INFO ] Computed 28 invariants in 3 ms
[2023-04-06 20:54:55] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:54:55] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-04-06 20:54:55] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-06 20:54:55] [INFO ] After 183ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:54:55] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 20:54:55] [INFO ] After 70ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:54:56] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2023-04-06 20:54:56] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 0 ms to minimize.
[2023-04-06 20:54:56] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-04-06 20:54:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 273 ms
[2023-04-06 20:54:56] [INFO ] After 363ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-04-06 20:54:56] [INFO ] After 655ms 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 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 81 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 486/486 places, 2907/2907 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) 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 468420 steps, run timeout after 3001 ms. (steps per millisecond=156 ) properties seen :{}
Probabilistic random walk after 468420 steps, saw 283916 distinct states, run finished after 3001 ms. (steps per millisecond=156 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 20:54:59] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:54:59] [INFO ] Invariant cache hit.
[2023-04-06 20:54:59] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:54:59] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-04-06 20:54:59] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-06 20:54:59] [INFO ] After 172ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:54:59] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 20:54:59] [INFO ] After 71ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:54:59] [INFO ] After 120ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-04-06 20:54:59] [INFO ] After 428ms 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 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 85 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 80 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2023-04-06 20:55:00] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:55:00] [INFO ] Invariant cache hit.
[2023-04-06 20:55:00] [INFO ] Implicit Places using invariants in 441 ms returned []
[2023-04-06 20:55:00] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:55:00] [INFO ] Invariant cache hit.
[2023-04-06 20:55:00] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 20:55:02] [INFO ] Implicit Places using invariants and state equation in 2305 ms returned []
Implicit Place search using SMT with State Equation took 2748 ms to find 0 implicit places.
[2023-04-06 20:55:02] [INFO ] Redundant transitions in 80 ms returned []
[2023-04-06 20:55:02] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:55:02] [INFO ] Invariant cache hit.
[2023-04-06 20:55:03] [INFO ] Dead Transitions using invariants and state equation in 787 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3706 ms. Remains : 486/486 places, 2907/2907 transitions.
Graph (trivial) has 2725 edges and 486 vertex of which 81 / 486 are part of one of the 9 SCC in 0 ms
Free SCC test removed 72 places
Drop transitions removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 414 transition count 514
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 316 transition count 514
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 197 place count 316 transition count 495
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 244 place count 288 transition count 495
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 530 place count 145 transition count 352
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 602 place count 145 transition count 280
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 620 place count 136 transition count 280
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 629 place count 136 transition count 271
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 638 place count 136 transition count 262
Free-agglomeration rule applied 72 times.
Iterating global reduction 4 with 72 rules applied. Total rules applied 710 place count 136 transition count 190
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 4 with 72 rules applied. Total rules applied 782 place count 64 transition count 190
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 791 place count 64 transition count 190
Applied a total of 791 rules in 23 ms. Remains 64 /486 variables (removed 422) and now considering 190/2907 (removed 2717) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 190 rows 64 cols
[2023-04-06 20:55:03] [INFO ] Computed 19 invariants in 1 ms
[2023-04-06 20:55:03] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:55:03] [INFO ] [Nat]Absence check using 19 positive place invariants in 2 ms returned sat
[2023-04-06 20:55:03] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:55:03] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-04-06 20:55:03] [INFO ] After 4ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:55:03] [INFO ] After 11ms 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:55:03] [INFO ] After 81ms 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 467730 steps, run timeout after 3001 ms. (steps per millisecond=155 ) properties seen :{}
Probabilistic random walk after 467730 steps, saw 283579 distinct states, run finished after 3001 ms. (steps per millisecond=155 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 20:55:06] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2023-04-06 20:55:06] [INFO ] Computed 28 invariants in 6 ms
[2023-04-06 20:55:06] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:55:06] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-04-06 20:55:06] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-06 20:55:07] [INFO ] After 173ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:55:07] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 20:55:07] [INFO ] After 74ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:55:07] [INFO ] After 117ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-04-06 20:55:07] [INFO ] After 402ms 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 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 82 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 486/486 places, 2907/2907 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) 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 468610 steps, run timeout after 3001 ms. (steps per millisecond=156 ) properties seen :{}
Probabilistic random walk after 468610 steps, saw 283980 distinct states, run finished after 3001 ms. (steps per millisecond=156 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 20:55:10] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:55:10] [INFO ] Invariant cache hit.
[2023-04-06 20:55:10] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:55:10] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-04-06 20:55:10] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-06 20:55:10] [INFO ] After 171ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:55:10] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 20:55:10] [INFO ] After 71ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:55:10] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2023-04-06 20:55:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2023-04-06 20:55:10] [INFO ] After 190ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-04-06 20:55:10] [INFO ] After 478ms 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 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 85 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 80 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2023-04-06 20:55:11] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:55:11] [INFO ] Invariant cache hit.
[2023-04-06 20:55:11] [INFO ] Implicit Places using invariants in 440 ms returned []
[2023-04-06 20:55:11] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:55:11] [INFO ] Invariant cache hit.
[2023-04-06 20:55:11] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 20:55:13] [INFO ] Implicit Places using invariants and state equation in 2304 ms returned []
Implicit Place search using SMT with State Equation took 2745 ms to find 0 implicit places.
[2023-04-06 20:55:13] [INFO ] Redundant transitions in 83 ms returned []
[2023-04-06 20:55:13] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:55:13] [INFO ] Invariant cache hit.
[2023-04-06 20:55:14] [INFO ] Dead Transitions using invariants and state equation in 783 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3702 ms. Remains : 486/486 places, 2907/2907 transitions.
Graph (trivial) has 2725 edges and 486 vertex of which 81 / 486 are part of one of the 9 SCC in 0 ms
Free SCC test removed 72 places
Drop transitions removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 414 transition count 514
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 316 transition count 514
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 197 place count 316 transition count 495
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 244 place count 288 transition count 495
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 530 place count 145 transition count 352
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 602 place count 145 transition count 280
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 620 place count 136 transition count 280
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 629 place count 136 transition count 271
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 638 place count 136 transition count 262
Free-agglomeration rule applied 72 times.
Iterating global reduction 4 with 72 rules applied. Total rules applied 710 place count 136 transition count 190
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 4 with 72 rules applied. Total rules applied 782 place count 64 transition count 190
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 791 place count 64 transition count 190
Applied a total of 791 rules in 20 ms. Remains 64 /486 variables (removed 422) and now considering 190/2907 (removed 2717) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 190 rows 64 cols
[2023-04-06 20:55:14] [INFO ] Computed 19 invariants in 1 ms
[2023-04-06 20:55:14] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:55:14] [INFO ] [Nat]Absence check using 19 positive place invariants in 2 ms returned sat
[2023-04-06 20:55:14] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:55:14] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-04-06 20:55:14] [INFO ] After 5ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:55:14] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-04-06 20:55:14] [INFO ] After 69ms 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 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 463130 steps, run timeout after 3001 ms. (steps per millisecond=154 ) properties seen :{}
Probabilistic random walk after 463130 steps, saw 280784 distinct states, run finished after 3001 ms. (steps per millisecond=154 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 20:55:17] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2023-04-06 20:55:17] [INFO ] Computed 28 invariants in 6 ms
[2023-04-06 20:55:17] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:55:18] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-04-06 20:55:18] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-06 20:55:18] [INFO ] After 177ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:55:18] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 20:55:18] [INFO ] After 70ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:55:18] [INFO ] After 117ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-04-06 20:55:18] [INFO ] After 415ms 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 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 82 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 486/486 places, 2907/2907 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 464780 steps, run timeout after 3001 ms. (steps per millisecond=154 ) properties seen :{}
Probabilistic random walk after 464780 steps, saw 281862 distinct states, run finished after 3001 ms. (steps per millisecond=154 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 20:55:21] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:55:21] [INFO ] Invariant cache hit.
[2023-04-06 20:55:21] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:55:21] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-04-06 20:55:21] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-06 20:55:21] [INFO ] After 182ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:55:21] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 20:55:21] [INFO ] After 67ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:55:21] [INFO ] After 113ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-04-06 20:55:21] [INFO ] After 407ms 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 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 83 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 83 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2023-04-06 20:55:22] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:55:22] [INFO ] Invariant cache hit.
[2023-04-06 20:55:22] [INFO ] Implicit Places using invariants in 449 ms returned []
[2023-04-06 20:55:22] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:55:22] [INFO ] Invariant cache hit.
[2023-04-06 20:55:22] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 20:55:24] [INFO ] Implicit Places using invariants and state equation in 2375 ms returned []
Implicit Place search using SMT with State Equation took 2824 ms to find 0 implicit places.
[2023-04-06 20:55:25] [INFO ] Redundant transitions in 82 ms returned []
[2023-04-06 20:55:25] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:55:25] [INFO ] Invariant cache hit.
[2023-04-06 20:55:25] [INFO ] Dead Transitions using invariants and state equation in 804 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3805 ms. Remains : 486/486 places, 2907/2907 transitions.
Graph (trivial) has 2725 edges and 486 vertex of which 81 / 486 are part of one of the 9 SCC in 1 ms
Free SCC test removed 72 places
Drop transitions removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 414 transition count 514
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 316 transition count 514
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 197 place count 316 transition count 495
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 244 place count 288 transition count 495
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 530 place count 145 transition count 352
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 602 place count 145 transition count 280
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 620 place count 136 transition count 280
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 629 place count 136 transition count 271
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 638 place count 136 transition count 262
Free-agglomeration rule applied 72 times.
Iterating global reduction 4 with 72 rules applied. Total rules applied 710 place count 136 transition count 190
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 4 with 72 rules applied. Total rules applied 782 place count 64 transition count 190
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 791 place count 64 transition count 190
Applied a total of 791 rules in 19 ms. Remains 64 /486 variables (removed 422) and now considering 190/2907 (removed 2717) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 190 rows 64 cols
[2023-04-06 20:55:25] [INFO ] Computed 19 invariants in 0 ms
[2023-04-06 20:55:25] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:55:25] [INFO ] [Nat]Absence check using 19 positive place invariants in 2 ms returned sat
[2023-04-06 20:55:25] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:55:25] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-04-06 20:55:25] [INFO ] After 5ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:55:25] [INFO ] After 12ms 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:55:25] [INFO ] After 78ms 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 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 462770 steps, run timeout after 3001 ms. (steps per millisecond=154 ) properties seen :{}
Probabilistic random walk after 462770 steps, saw 280508 distinct states, run finished after 3001 ms. (steps per millisecond=154 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 20:55:29] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2023-04-06 20:55:29] [INFO ] Computed 28 invariants in 6 ms
[2023-04-06 20:55:29] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:55:29] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-04-06 20:55:29] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 3 ms returned sat
[2023-04-06 20:55:29] [INFO ] After 176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:55:29] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 20:55:29] [INFO ] After 64ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:55:29] [INFO ] After 108ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-04-06 20:55:29] [INFO ] After 396ms 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 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 81 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 486/486 places, 2907/2907 transitions.
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 463290 steps, run timeout after 3001 ms. (steps per millisecond=154 ) properties seen :{}
Probabilistic random walk after 463290 steps, saw 280881 distinct states, run finished after 3001 ms. (steps per millisecond=154 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 20:55:32] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:55:32] [INFO ] Invariant cache hit.
[2023-04-06 20:55:32] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:55:32] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-04-06 20:55:32] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-06 20:55:32] [INFO ] After 174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:55:32] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 20:55:33] [INFO ] After 66ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:55:33] [INFO ] After 111ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-04-06 20:55:33] [INFO ] After 409ms 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 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 80 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 86 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2023-04-06 20:55:33] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:55:33] [INFO ] Invariant cache hit.
[2023-04-06 20:55:33] [INFO ] Implicit Places using invariants in 449 ms returned []
[2023-04-06 20:55:33] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:55:33] [INFO ] Invariant cache hit.
[2023-04-06 20:55:33] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-06 20:55:36] [INFO ] Implicit Places using invariants and state equation in 2357 ms returned []
Implicit Place search using SMT with State Equation took 2812 ms to find 0 implicit places.
[2023-04-06 20:55:36] [INFO ] Redundant transitions in 81 ms returned []
[2023-04-06 20:55:36] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-06 20:55:36] [INFO ] Invariant cache hit.
[2023-04-06 20:55:36] [INFO ] Dead Transitions using invariants and state equation in 800 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3785 ms. Remains : 486/486 places, 2907/2907 transitions.
Graph (trivial) has 2725 edges and 486 vertex of which 81 / 486 are part of one of the 9 SCC in 0 ms
Free SCC test removed 72 places
Drop transitions removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 414 transition count 514
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 316 transition count 514
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 197 place count 316 transition count 495
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 244 place count 288 transition count 495
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 530 place count 145 transition count 352
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 602 place count 145 transition count 280
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 620 place count 136 transition count 280
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 629 place count 136 transition count 271
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 638 place count 136 transition count 262
Free-agglomeration rule applied 72 times.
Iterating global reduction 4 with 72 rules applied. Total rules applied 710 place count 136 transition count 190
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 4 with 72 rules applied. Total rules applied 782 place count 64 transition count 190
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 791 place count 64 transition count 190
Applied a total of 791 rules in 20 ms. Remains 64 /486 variables (removed 422) and now considering 190/2907 (removed 2717) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 190 rows 64 cols
[2023-04-06 20:55:36] [INFO ] Computed 19 invariants in 1 ms
[2023-04-06 20:55:37] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:55:37] [INFO ] [Nat]Absence check using 19 positive place invariants in 2 ms returned sat
[2023-04-06 20:55:37] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:55:37] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-04-06 20:55:37] [INFO ] After 5ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:55:37] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-04-06 20:55:37] [INFO ] After 74ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Graph (trivial) has 2532 edges and 486 vertex of which 81 / 486 are part of one of the 9 SCC in 0 ms
Free SCC test removed 72 places
Drop transitions removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions removed 91 transitions
Trivial Post-agglo rules discarded 91 transitions
Performed 91 trivial Post agglomeration. Transition count delta: 91
Iterating post reduction 0 with 91 rules applied. Total rules applied 92 place count 414 transition count 521
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 1 with 91 rules applied. Total rules applied 183 place count 323 transition count 521
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 183 place count 323 transition count 502
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 230 place count 295 transition count 502
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 256 rules applied. Total rules applied 486 place count 167 transition count 374
Ensure Unique test removed 59 transitions
Reduce isomorphic transitions removed 59 transitions.
Iterating post reduction 2 with 59 rules applied. Total rules applied 545 place count 167 transition count 315
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 561 place count 159 transition count 315
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 569 place count 159 transition count 307
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 4 with 15 rules applied. Total rules applied 584 place count 159 transition count 292
Free-agglomeration rule applied 79 times.
Iterating global reduction 4 with 79 rules applied. Total rules applied 663 place count 159 transition count 213
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 4 with 79 rules applied. Total rules applied 742 place count 80 transition count 213
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 751 place count 80 transition count 213
Applied a total of 751 rules in 23 ms. Remains 80 /486 variables (removed 406) and now considering 213/2907 (removed 2694) transitions.
Running SMT prover for 17 properties.
// Phase 1: matrix 213 rows 80 cols
[2023-04-06 20:55:37] [INFO ] Computed 19 invariants in 1 ms
[2023-04-06 20:55:37] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-04-06 20:55:37] [INFO ] [Nat]Absence check using 19 positive place invariants in 2 ms returned sat
[2023-04-06 20:55:37] [INFO ] After 113ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2023-04-06 20:55:37] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-04-06 20:55:37] [INFO ] After 85ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :17
[2023-04-06 20:55:37] [INFO ] After 232ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 86 ms.
[2023-04-06 20:55:37] [INFO ] After 501ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Unable to solve all queries for examination StableMarking. Remains :17 assertions to prove.
No /home/mcc/execution/StableMarking.xml examination file found. Proceeding without properties.
Parsed 17 properties from file /home/mcc/execution/StableMarking.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 798388 ms.
starting LoLA
BK_INPUT EisenbergMcGuire-PT-09
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: 13002808 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16162392 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_3_1
sara: try reading problem file stateEquationProblem-ConstantPlace-665.sara.
lola: LAUNCH SYMM
sara: place or transition ordering is non-deterministic
lola: reporting
lola: not produced: 556
lola: find path: 222
lola: goal oriented search: 113
lola: reporting
lola: not produced: 272
lola: find path: 261
lola: goal oriented search: 358
lola: reporting
lola: not produced: 241
lola: find path: 292
lola: goal oriented search: 358
lola: reporting
lola: not produced: 222
lola: find path: 311
lola: goal oriented search: 358
lola: reporting
lola: not produced: 222
lola: find path: 311
lola: goal oriented search: 358
lola: reporting
lola: not produced: 207
lola: find path: 326
lola: goal oriented search: 358
lola: reporting
lola: not produced: 198
lola: find path: 335
lola: goal oriented search: 358
lola: reporting
lola: not produced: 195
lola: find path: 338
lola: goal oriented search: 358
lola: reporting
lola: not produced: 180
lola: find path: 353
lola: goal oriented search: 358
lola: reporting
lola: not produced: 179
lola: find path: 354
lola: goal oriented search: 358
lola: reporting
lola: not produced: 179
lola: find path: 354
lola: goal oriented search: 358
lola: reporting
lola: not produced: 179
lola: find path: 354
lola: goal oriented search: 358
lola: reporting
lola: not produced: 179
lola: find path: 354
lola: goal oriented search: 358
lola: reporting
lola: not produced: 170
lola: find path: 363
lola: goal oriented search: 358
lola: reporting
lola: not produced: 155
lola: find path: 378
lola: goal oriented search: 358
lola: reporting
lola: not produced: 155
lola: find path: 378
lola: goal oriented search: 358
lola: reporting
lola: not produced: 140
lola: find path: 393
lola: goal oriented search: 358
lola: reporting
lola: not produced: 137
lola: find path: 396
lola: goal oriented search: 358
lola: reporting
lola: not produced: 136
lola: find path: 397
lola: goal oriented search: 358
lola: reporting
lola: not produced: 135
lola: find path: 398
lola: goal oriented search: 358
lola: reporting
lola: not produced: 133
lola: find path: 400
lola: goal oriented search: 358
lola: reporting
lola: not produced: 133
lola: find path: 400
lola: goal oriented search: 358
lola: reporting
lola: not produced: 130
lola: find path: 403
lola: goal oriented search: 358
lola: reporting
lola: not produced: 130
lola: find path: 403
lola: goal oriented search: 358
lola: reporting
lola: not produced: 130
lola: find path: 403
lola: goal oriented search: 358
lola: reporting
lola: not produced: 128
lola: find path: 405
lola: goal oriented search: 358
lola: reporting
lola: not produced: 128
lola: find path: 405
lola: goal oriented search: 358
lola: reporting
lola: not produced: 128
lola: find path: 405
lola: goal oriented search: 358
lola: reporting
lola: not produced: 128
lola: find path: 405
lola: goal oriented search: 358
lola: reporting
lola: not produced: 127
lola: find path: 406
lola: goal oriented search: 358
lola: reporting
lola: not produced: 127
lola: find path: 406
lola: goal oriented search: 358
lola: reporting
lola: not produced: 127
lola: find path: 406
lola: goal oriented search: 358
lola: reporting
lola: not produced: 123
lola: find path: 410
lola: goal oriented search: 358
lola: reporting
lola: not produced: 123
lola: find path: 410
lola: goal oriented search: 358
lola: reporting
lola: not produced: 123
lola: find path: 410
lola: goal oriented search: 358
lola: reporting
lola: not produced: 123
lola: find path: 410
lola: goal oriented search: 358
lola: reporting
lola: not produced: 123
lola: find path: 410
lola: goal oriented search: 358
lola: reporting
lola: not produced: 123
lola: find path: 410
lola: goal oriented search: 358
lola: reporting
lola: not produced: 123
lola: find path: 410
lola: goal oriented search: 358
lola: reporting
lola: not produced: 123
lola: find path: 410
lola: goal oriented search: 358
lola: reporting
lola: not produced: 123
lola: find path: 410
lola: goal oriented search: 358
lola: reporting
lola: not produced: 123
lola: find path: 410
lola: goal oriented search: 358
lola: reporting
lola: not produced: 123
lola: find path: 410
lola: goal oriented search: 358
lola: reporting
lola: not produced: 122
lola: find path: 411
lola: goal oriented search: 358
lola: reporting
lola: not produced: 121
lola: find path: 412
lola: goal oriented search: 358
lola: reporting
lola: not produced: 120
lola: find path: 413
lola: goal oriented search: 358
lola: reporting
lola: not produced: 120
lola: find path: 413
lola: goal oriented search: 358
lola: reporting
lola: not produced: 120
lola: find path: 413
lola: goal oriented search: 358
lola: reporting
lola: not produced: 120
lola: find path: 413
lola: goal oriented search: 358
lola: reporting
lola: not produced: 120
lola: find path: 413
lola: goal oriented search: 358
lola: reporting
lola: not produced: 115
lola: find path: 418
lola: goal oriented search: 358
lola: reporting
lola: not produced: 115
lola: find path: 418
lola: goal oriented search: 358
lola: reporting
lola: not produced: 115
lola: find path: 418
lola: goal oriented search: 358
lola: reporting
lola: not produced: 115
lola: find path: 418
lola: goal oriented search: 358
lola: reporting
lola: not produced: 115
lola: find path: 418
lola: goal oriented search: 358
lola: reporting
lola: not produced: 115
lola: find path: 418
lola: goal oriented search: 358
lola: reporting
lola: not produced: 115
lola: find path: 418
lola: goal oriented search: 358
sara: warning, failure of lp_solve (at job 1014)
lola: reporting
lola: not produced: 115
lola: find path: 418
lola: goal oriented search: 358
lola: reporting
lola: not produced: 115
lola: find path: 418
lola: goal oriented search: 358
lola: reporting
lola: not produced: 115
lola: find path: 418
lola: goal oriented search: 358
lola: reporting
lola: not produced: 115
lola: find path: 418
lola: goal oriented search: 358
lola: reporting
lola: not produced: 113
lola: find path: 420
lola: goal oriented search: 358
lola: reporting
lola: not produced: 113
lola: find path: 420
lola: goal oriented search: 358
lola: reporting
lola: not produced: 113
lola: find path: 420
lola: goal oriented search: 358
lola: reporting
lola: not produced: 113
lola: find path: 420
lola: goal oriented search: 358
lola: reporting
lola: not produced: 113
lola: find path: 420
lola: goal oriented search: 358
lola: reporting
lola: not produced: 71
lola: find path: 420
lola: goal oriented search: 400
lola: reporting
lola: not produced: 71
lola: find path: 420
lola: goal oriented search: 400
lola: reporting
lola: not produced: 71
lola: find path: 420
lola: goal oriented search: 400
lola: reporting
lola: not produced: 68
lola: find path: 423
lola: goal oriented search: 400
lola: reporting
lola: not produced: 68
lola: find path: 423
lola: goal oriented search: 400
lola: reporting
lola: not produced: 68
lola: find path: 423
lola: goal oriented search: 400
lola: reporting
lola: not produced: 68
lola: find path: 423
lola: goal oriented search: 400
lola: reporting
lola: not produced: 68
lola: find path: 423
lola: goal oriented search: 400
lola: reporting
lola: not produced: 68
lola: find path: 423
lola: goal oriented search: 400
lola: reporting
lola: not produced: 68
lola: find path: 423
lola: goal oriented search: 400
lola: reporting
lola: not produced: 67
lola: find path: 424
lola: goal oriented search: 400
lola: reporting
lola: not produced: 67
lola: find path: 424
lola: goal oriented search: 400
lola: reporting
lola: not produced: 66
lola: find path: 424
lola: goal oriented search: 401
lola: reporting
lola: not produced: 61
lola: find path: 425
lola: goal oriented search: 405
lola: reporting
lola: not produced: 61
lola: find path: 425
lola: goal oriented search: 405
lola: reporting
lola: not produced: 60
lola: find path: 426
lola: goal oriented search: 405
lola: reporting
lola: not produced: 60
lola: find path: 426
lola: goal oriented search: 405
lola: reporting
lola: not produced: 58
lola: find path: 428
lola: goal oriented search: 405
lola: reporting
lola: not produced: 58
lola: find path: 428
lola: goal oriented search: 405
lola: reporting
lola: not produced: 58
lola: find path: 428
lola: goal oriented search: 405
lola: reporting
lola: not produced: 58
lola: find path: 428
lola: goal oriented search: 405
lola: reporting
lola: not produced: 58
lola: find path: 428
lola: goal oriented search: 405
lola: reporting
lola: not produced: 58
lola: find path: 428
lola: goal oriented search: 405
lola: reporting
lola: not produced: 57
lola: find path: 429
lola: goal oriented search: 405
lola: reporting
lola: not produced: 57
lola: find path: 429
lola: goal oriented search: 405
lola: reporting
lola: not produced: 54
lola: find path: 429
lola: goal oriented search: 408
lola: reporting
lola: not produced: 54
lola: find path: 429
lola: goal oriented search: 408
lola: reporting
lola: not produced: 54
lola: find path: 429
lola: goal oriented search: 408
lola: reporting
lola: not produced: 54
lola: find path: 429
lola: goal oriented search: 408
lola: reporting
lola: not produced: 54
lola: find path: 429
lola: goal oriented search: 408
lola: reporting
lola: not produced: 53
lola: find path: 430
lola: goal oriented search: 408
lola: reporting
lola: not produced: 53
lola: find path: 430
lola: goal oriented search: 408
lola: reporting
lola: not produced: 53
lola: find path: 430
lola: goal oriented search: 408
lola: reporting
lola: not produced: 53
lola: find path: 430
lola: goal oriented search: 408
lola: reporting
lola: not produced: 53
lola: find path: 430
lola: goal oriented search: 408
lola: reporting
lola: not produced: 53
lola: find path: 430
lola: goal oriented search: 408
lola: reporting
lola: not produced: 53
lola: find path: 430
lola: goal oriented search: 408
lola: reporting
lola: not produced: 53
lola: find path: 430
lola: goal oriented search: 408
lola: reporting
lola: not produced: 53
lola: find path: 430
lola: goal oriented search: 408
lola: reporting
lola: not produced: 53
lola: find path: 430
lola: goal oriented search: 408
lola: reporting
lola: not produced: 53
lola: find path: 430
lola: goal oriented search: 408
lola: reporting
lola: not produced: 53
lola: find path: 430
lola: goal oriented search: 408
lola: reporting
lola: not produced: 53
lola: find path: 430
lola: goal oriented search: 408
lola: reporting
lola: not produced: 53
lola: find path: 430
lola: goal oriented search: 408
lola: reporting
lola: not produced: 53
lola: find path: 430
lola: goal oriented search: 408
lola: reporting
lola: not produced: 53
lola: find path: 430
lola: goal oriented search: 408
lola: reporting
lola: not produced: 53
lola: find path: 430
lola: goal oriented search: 408
lola: reporting
lola: not produced: 53
lola: find path: 430
lola: goal oriented search: 408
lola: reporting
lola: not produced: 53
lola: find path: 430
lola: goal oriented search: 408
lola: reporting
lola: not produced: 53
lola: find path: 430
lola: goal oriented search: 408
lola: reporting
lola: not produced: 53
lola: find path: 430
lola: goal oriented search: 408
lola: reporting
lola: not produced: 53
lola: find path: 430
lola: goal oriented search: 408
lola: reporting
lola: not produced: 53
lola: find path: 430
lola: goal oriented search: 408
lola: reporting
lola: not produced: 53
lola: find path: 430
lola: goal oriented search: 408
lola: reporting
lola: not produced: 53
lola: find path: 430
lola: goal oriented search: 408
lola: reporting
lola: not produced: 53
lola: find path: 430
lola: goal oriented search: 408
lola: reporting
lola: not produced: 53
lola: find path: 430
lola: goal oriented search: 408
lola: reporting
lola: not produced: 53
lola: find path: 430
lola: goal oriented search: 408
lola: reporting
lola: not produced: 53
lola: find path: 430
lola: goal oriented search: 408
lola: reporting
lola: not produced: 53
lola: find path: 430
lola: goal oriented search: 408
lola: reporting
lola: not produced: 53
lola: find path: 430
lola: goal oriented search: 408
lola: reporting
lola: not produced: 53
lola: find path: 430
lola: goal oriented search: 408
lola: reporting
lola: not produced: 53
lola: find path: 430
lola: goal oriented search: 408
lola: reporting
lola: not produced: 53
lola: find path: 430
lola: goal oriented search: 408
lola: reporting
lola: not produced: 53
lola: find path: 430
lola: goal oriented search: 408
lola: reporting
lola: not produced: 53
lola: find path: 430
lola: goal oriented search: 408
lola: reporting
lola: not produced: 53
lola: find path: 430
lola: goal oriented search: 408
lola: reporting
lola: not produced: 52
lola: find path: 431
lola: goal oriented search: 408
lola: reporting
lola: not produced: 52
lola: find path: 431
lola: goal oriented search: 408
lola: reporting
lola: not produced: 52
lola: find path: 431
lola: goal oriented search: 408
lola: reporting
lola: not produced: 52
lola: find path: 431
lola: goal oriented search: 408
lola: reporting
lola: not produced: 52
lola: find path: 431
lola: goal oriented search: 408
lola: reporting
lola: not produced: 52
lola: find path: 431
lola: goal oriented search: 408
lola: reporting
lola: not produced: 52
lola: find path: 431
lola: goal oriented search: 408
lola: reporting
lola: not produced: 52
lola: find path: 431
lola: goal oriented search: 408
lola: reporting
lola: not produced: 52
lola: find path: 431
lola: goal oriented search: 408
lola: reporting
lola: not produced: 52
lola: find path: 431
lola: goal oriented search: 408
lola: reporting
lola: not produced: 52
lola: find path: 431
lola: goal oriented search: 408
lola: reporting
lola: not produced: 52
lola: find path: 431
lola: goal oriented search: 408
lola: reporting
lola: not produced: 52
lola: find path: 431
lola: goal oriented search: 408
lola: reporting
lola: not produced: 52
lola: find path: 431
lola: goal oriented search: 408
lola: reporting
lola: not produced: 52
lola: find path: 431
lola: goal oriented search: 408
lola: reporting
lola: not produced: 52
lola: find path: 431
lola: goal oriented search: 408
lola: reporting
lola: not produced: 52
lola: find path: 431
lola: goal oriented search: 408
lola: reporting
lola: not produced: 51
lola: find path: 432
lola: goal oriented search: 408
lola: reporting
lola: not produced: 51
lola: find path: 432
lola: goal oriented search: 408
lola: reporting
lola: not produced: 51
lola: find path: 432
lola: goal oriented search: 408
lola: reporting
lola: not produced: 51
lola: find path: 432
lola: goal oriented search: 408
lola: reporting
lola: not produced: 44
lola: find path: 432
lola: goal oriented search: 415
lola: reporting
lola: not produced: 44
lola: find path: 432
lola: goal oriented search: 415
lola: reporting
lola: not produced: 44
lola: find path: 432
lola: goal oriented search: 415
lola: reporting
lola: not produced: 44
lola: find path: 432
lola: goal oriented search: 415
lola: reporting
lola: not produced: 44
lola: find path: 432
lola: goal oriented search: 415
lola: reporting
lola: not produced: 44
lola: find path: 432
lola: goal oriented search: 415
lola: reporting
lola: not produced: 44
lola: find path: 432
lola: goal oriented search: 415
lola: reporting
lola: not produced: 44
lola: find path: 432
lola: goal oriented search: 415
lola: reporting
lola: not produced: 44
lola: find path: 432
lola: goal oriented search: 415
lola: reporting
lola: not produced: 44
lola: find path: 432
lola: goal oriented search: 415
lola: reporting
lola: not produced: 44
lola: find path: 432
lola: goal oriented search: 415
lola: reporting
lola: not produced: 44
lola: find path: 432
lola: goal oriented search: 415
lola: reporting
lola: not produced: 44
lola: find path: 432
lola: goal oriented search: 415
lola: reporting
lola: not produced: 44
lola: find path: 432
lola: goal oriented search: 415
lola: reporting
lola: not produced: 44
lola: find path: 432
lola: goal oriented search: 415
lola: reporting
lola: not produced: 44
lola: find path: 432
lola: goal oriented search: 415
lola: reporting
lola: not produced: 44
lola: find path: 432
lola: goal oriented search: 415
lola: reporting
lola: not produced: 44
lola: find path: 432
lola: goal oriented search: 415
lola: reporting
lola: not produced: 44
lola: find path: 432
lola: goal oriented search: 415
lola: reporting
lola: not produced: 44
lola: find path: 432
lola: goal oriented search: 415
lola: reporting
lola: not produced: 44
lola: find path: 432
lola: goal oriented search: 415
lola: reporting
lola: not produced: 44
lola: find path: 432
lola: goal oriented search: 415
lola: reporting
lola: not produced: 44
lola: find path: 432
lola: goal oriented search: 415
lola: reporting
lola: not produced: 44
lola: find path: 432
lola: goal oriented search: 415
lola: reporting
lola: not produced: 44
lola: find path: 432
lola: goal oriented search: 415
lola: reporting
lola: not produced: 44
lola: find path: 432
lola: goal oriented search: 415
lola: reporting
lola: not produced: 44
lola: find path: 432
lola: goal oriented search: 415
lola: reporting
lola: not produced: 44
lola: find path: 432
lola: goal oriented search: 415
lola: reporting
lola: not produced: 44
lola: find path: 432
lola: goal oriented search: 415
lola: reporting
lola: not produced: 44
lola: find path: 432
lola: goal oriented search: 415
lola: reporting
lola: not produced: 44
lola: find path: 432
lola: goal oriented search: 415
lola: reporting
lola: not produced: 44
lola: find path: 432
lola: goal oriented search: 415
lola: reporting
lola: not produced: 44
lola: find path: 432
lola: goal oriented search: 415
lola: reporting
lola: not produced: 44
lola: find path: 432
lola: goal oriented search: 415
lola: reporting
lola: not produced: 44
lola: find path: 432
lola: goal oriented search: 415
lola: reporting
lola: not produced: 44
lola: find path: 432
lola: goal oriented search: 415
lola: reporting
lola: not produced: 44
lola: find path: 432
lola: goal oriented search: 415
lola: reporting
lola: not produced: 44
lola: find path: 432
lola: goal oriented search: 415
lola: reporting
lola: not produced: 44
lola: find path: 432
lola: goal oriented search: 415
lola: reporting
lola: not produced: 44
lola: find path: 432
lola: goal oriented search: 415
lola: reporting
lola: not produced: 44
lola: find path: 432
lola: goal oriented search: 415
lola: reporting
lola: not produced: 44
lola: find path: 432
lola: goal oriented search: 415
lola: reporting
lola: not produced: 44
lola: find path: 432
lola: goal oriented search: 415
lola: reporting
lola: not produced: 44
lola: find path: 432
lola: goal oriented search: 415
lola: reporting
lola: not produced: 44
lola: find path: 432
lola: goal oriented search: 415
lola: caught signal Terminated - aborting LoLA

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY


Time elapsed: 999 secs. Pages in use: 172

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

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