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.r537-tall-167987255000163.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 smartxred
Input is EisenbergMcGuire-PT-08, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r537-tall-167987255000163
=====================================================================

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

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1680816430765

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=smartxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=EisenbergMcGuire-PT-08
Applying reductions before tool smart
Invoking reducer
Running Version 202304061127
[2023-04-06 21:27:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-04-06 21:27:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 21:27:12] [INFO ] Load time of PNML (sax parser for PT used): 153 ms
[2023-04-06 21:27:12] [INFO ] Transformed 712 places.
[2023-04-06 21:27:12] [INFO ] Transformed 2816 transitions.
[2023-04-06 21:27:12] [INFO ] Found NUPN structural information;
[2023-04-06 21:27:12] [INFO ] Parsed PT model containing 712 places and 2816 transitions and 13440 arcs in 229 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 506 ms. (steps per millisecond=19 ) properties (out of 712) seen :465
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 247) 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 247) 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 247) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 247) 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 247) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 247) 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 247) 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 247) 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 247) 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 247) 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 247) 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 247) 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 247) 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 247) 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 247) 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 247) 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 247) 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 247) 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 247) 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 247) 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 247) 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 247) 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 247) 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 247) 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 247) 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 247) 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 247) 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 247) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 247) 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 247) 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 247) 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 247) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 247) 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 247) 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 247) 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 247) 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 247) 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 247) 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 247) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 247) 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 247) 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 247) 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 247) 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 247) 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 247) 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 247) 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 247) 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 247) 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 247) 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 247) seen :0
Running SMT prover for 247 properties.
[2023-04-06 21:27:13] [INFO ] Flow matrix only has 1368 transitions (discarded 1448 similar events)
// Phase 1: matrix 1368 rows 712 cols
[2023-04-06 21:27:13] [INFO ] Computed 25 invariants in 35 ms
[2023-04-06 21:27:16] [INFO ] After 3490ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:247
[2023-04-06 21:27:19] [INFO ] [Nat]Absence check using 17 positive place invariants in 24 ms returned sat
[2023-04-06 21:27:19] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 7 ms returned sat
[2023-04-06 21:27:31] [INFO ] After 9590ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :247
[2023-04-06 21:27:31] [INFO ] State equation strengthened by 676 read => feed constraints.
[2023-04-06 21:27:41] [INFO ] After 9974ms SMT Verify possible using 676 Read/Feed constraints in natural domain returned unsat :0 sat :247
[2023-04-06 21:27:41] [INFO ] After 9975ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :247
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-04-06 21:27:41] [INFO ] After 25020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :247
Fused 247 Parikh solutions to 145 different solutions.
Parikh walk visited 1 properties in 5530 ms.
Support contains 246 out of 712 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 712/712 places, 2816/2816 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 712 transition count 2808
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 704 transition count 2808
Performed 144 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 144 Pre rules applied. Total rules applied 16 place count 704 transition count 2664
Deduced a syphon composed of 144 places in 5 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 2 with 288 rules applied. Total rules applied 304 place count 560 transition count 2664
Discarding 56 places :
Symmetric choice reduction at 2 with 56 rule applications. Total rules 360 place count 504 transition count 2216
Iterating global reduction 2 with 56 rules applied. Total rules applied 416 place count 504 transition count 2216
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 5 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 484 place count 470 transition count 2182
Applied a total of 484 rules in 267 ms. Remains 470 /712 variables (removed 242) and now considering 2182/2816 (removed 634) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 268 ms. Remains : 470/712 places, 2182/2816 transitions.
Interrupted random walk after 820400 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=27 ) properties seen 30
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 216) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 215) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 215) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 215) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 215) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 215) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 215) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 215) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 215) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 215) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 215) 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 215) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 215) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 215) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 215) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 215) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 215) 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 215) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 215) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 215) 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 215) 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 215) 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 215) 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 215) 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 215) 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 215) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 215) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 215) 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 215) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 215) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 215) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 215) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 215) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 215) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 215) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 215) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 215) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 215) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 215) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 215) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 215) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 215) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 215) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 215) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 215) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 215) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 215) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 215) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 215) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 215) seen :0
Running SMT prover for 215 properties.
[2023-04-06 21:28:20] [INFO ] Flow matrix only has 734 transitions (discarded 1448 similar events)
// Phase 1: matrix 734 rows 470 cols
[2023-04-06 21:28:20] [INFO ] Computed 25 invariants in 6 ms
[2023-04-06 21:28:22] [INFO ] After 1982ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:215
[2023-04-06 21:28:23] [INFO ] [Nat]Absence check using 17 positive place invariants in 13 ms returned sat
[2023-04-06 21:28:23] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2023-04-06 21:28:29] [INFO ] After 4794ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :215
[2023-04-06 21:28:29] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 21:28:35] [INFO ] After 5588ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :215
[2023-04-06 21:28:35] [INFO ] Deduced a trap composed of 3 places in 120 ms of which 5 ms to minimize.
[2023-04-06 21:28:35] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 1 ms to minimize.
[2023-04-06 21:28:35] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 2 ms to minimize.
[2023-04-06 21:28:36] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 0 ms to minimize.
[2023-04-06 21:28:36] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 484 ms
[2023-04-06 21:28:36] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 1 ms to minimize.
[2023-04-06 21:28:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2023-04-06 21:28:36] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2023-04-06 21:28:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2023-04-06 21:28:36] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2023-04-06 21:28:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2023-04-06 21:28:36] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2023-04-06 21:28:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2023-04-06 21:28:36] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2023-04-06 21:28:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2023-04-06 21:28:37] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 0 ms to minimize.
[2023-04-06 21:28:37] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 0 ms to minimize.
[2023-04-06 21:28:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 219 ms
[2023-04-06 21:28:37] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 0 ms to minimize.
[2023-04-06 21:28:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2023-04-06 21:28:38] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 0 ms to minimize.
[2023-04-06 21:28:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2023-04-06 21:28:38] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 0 ms to minimize.
[2023-04-06 21:28:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2023-04-06 21:28:38] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 0 ms to minimize.
[2023-04-06 21:28:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2023-04-06 21:28:39] [INFO ] Deduced a trap composed of 51 places in 69 ms of which 1 ms to minimize.
[2023-04-06 21:28:39] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 2 ms to minimize.
[2023-04-06 21:28:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 227 ms
[2023-04-06 21:28:39] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 1 ms to minimize.
[2023-04-06 21:28:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2023-04-06 21:28:40] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 0 ms to minimize.
[2023-04-06 21:28:40] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 1 ms to minimize.
[2023-04-06 21:28:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 334 ms
[2023-04-06 21:28:40] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 1 ms to minimize.
[2023-04-06 21:28:40] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 1 ms to minimize.
[2023-04-06 21:28:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 264 ms
[2023-04-06 21:28:41] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 1 ms to minimize.
[2023-04-06 21:28:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2023-04-06 21:28:41] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 0 ms to minimize.
[2023-04-06 21:28:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 157 ms
[2023-04-06 21:28:41] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 0 ms to minimize.
[2023-04-06 21:28:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 149 ms
[2023-04-06 21:28:42] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 0 ms to minimize.
[2023-04-06 21:28:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2023-04-06 21:28:42] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 0 ms to minimize.
[2023-04-06 21:28:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2023-04-06 21:28:43] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 0 ms to minimize.
[2023-04-06 21:28:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2023-04-06 21:28:43] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 0 ms to minimize.
[2023-04-06 21:28:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2023-04-06 21:28:44] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 0 ms to minimize.
[2023-04-06 21:28:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2023-04-06 21:28:44] [INFO ] Deduced a trap composed of 49 places in 59 ms of which 1 ms to minimize.
[2023-04-06 21:28:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2023-04-06 21:28:44] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 0 ms to minimize.
[2023-04-06 21:28:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2023-04-06 21:28:44] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2023-04-06 21:28:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2023-04-06 21:28:46] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 0 ms to minimize.
[2023-04-06 21:28:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2023-04-06 21:28:46] [INFO ] Deduced a trap composed of 52 places in 61 ms of which 1 ms to minimize.
[2023-04-06 21:28:46] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 0 ms to minimize.
[2023-04-06 21:28:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 202 ms
[2023-04-06 21:28:47] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 1 ms to minimize.
[2023-04-06 21:28:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2023-04-06 21:28:47] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2023-04-06 21:28:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2023-04-06 21:28:47] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 0 ms to minimize.
[2023-04-06 21:28:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2023-04-06 21:28:48] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2023-04-06 21:28:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2023-04-06 21:28:48] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2023-04-06 21:28:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2023-04-06 21:28:48] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2023-04-06 21:28:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2023-04-06 21:28:50] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 0 ms to minimize.
[2023-04-06 21:28:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2023-04-06 21:28:50] [INFO ] After 20573ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :215
Attempting to minimize the solution found.
Minimization took 6103 ms.
[2023-04-06 21:28:56] [INFO ] After 34430ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :215
Fused 215 Parikh solutions to 159 different solutions.
Parikh walk visited 0 properties in 2590 ms.
Support contains 215 out of 470 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 470/470 places, 2182/2182 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 4 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 44 place count 448 transition count 2160
Applied a total of 44 rules in 89 ms. Remains 448 /470 variables (removed 22) and now considering 2160/2182 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 448/470 places, 2160/2182 transitions.
Interrupted random walk after 811820 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=27 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 215) 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 215) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 215) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 215) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 215) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 215) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 215) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 215) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 215) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 215) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 215) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 215) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 215) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 215) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 215) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 215) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 215) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 215) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 214) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 214) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 214) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 214) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 214) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 214) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 214) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 214) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 214) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 214) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 214) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 214) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 214) 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 214) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 214) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 214) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 214) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 214) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 214) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 214) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 214) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 214) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 214) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 214) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 214) 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 214) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 214) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 214) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 214) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 214) 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 214) 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 214) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 214) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 214) 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 214) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 214) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 214) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 214) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 214) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 214) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 214) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 214) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 214) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 214) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 214) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 214) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 214) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 214) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 214) seen :0
Interrupted probabilistic random walk after 9622485 steps, run timeout after 96001 ms. (steps per millisecond=100 ) 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, 69=1, 70=1, 71=1, 72=1, 73=1, 74=1, 75=1, 76=1, 77=1, 78=1, 79=1, 80=1, 81=1, 82=1, 83=1, 84=1, 85=1, 86=1, 87=1, 88=1, 90=1, 91=1, 92=1, 93=1, 94=1, 95=1, 96=1, 97=1, 98=1, 99=1, 100=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, 117=1, 118=1, 119=1, 120=1, 121=1, 122=1, 123=1, 124=1, 125=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, 166=1, 167=1, 168=1, 169=1, 170=1, 171=1, 174=1, 175=1, 176=1, 177=1, 178=1, 179=1, 180=1, 182=1, 183=1, 184=1, 185=1, 186=1, 187=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, 211=1, 212=1, 213=1}
Probabilistic random walk after 9622485 steps, saw 2157753 distinct states, run finished after 96005 ms. (steps per millisecond=100 ) properties seen :205
Running SMT prover for 9 properties.
[2023-04-06 21:31:08] [INFO ] Flow matrix only has 712 transitions (discarded 1448 similar events)
// Phase 1: matrix 712 rows 448 cols
[2023-04-06 21:31:08] [INFO ] Computed 25 invariants in 4 ms
[2023-04-06 21:31:08] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-04-06 21:31:08] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2023-04-06 21:31:08] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2023-04-06 21:31:08] [INFO ] After 328ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-04-06 21:31:08] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 21:31:09] [INFO ] After 285ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-04-06 21:31:09] [INFO ] Deduced a trap composed of 3 places in 132 ms of which 0 ms to minimize.
[2023-04-06 21:31:09] [INFO ] Deduced a trap composed of 3 places in 121 ms of which 0 ms to minimize.
[2023-04-06 21:31:09] [INFO ] Deduced a trap composed of 3 places in 103 ms of which 1 ms to minimize.
[2023-04-06 21:31:09] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2023-04-06 21:31:09] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 0 ms to minimize.
[2023-04-06 21:31:09] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2023-04-06 21:31:09] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 742 ms
[2023-04-06 21:31:10] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2023-04-06 21:31:10] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 0 ms to minimize.
[2023-04-06 21:31:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 191 ms
[2023-04-06 21:31:10] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 0 ms to minimize.
[2023-04-06 21:31:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2023-04-06 21:31:10] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2023-04-06 21:31:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2023-04-06 21:31:10] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 0 ms to minimize.
[2023-04-06 21:31:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2023-04-06 21:31:10] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 0 ms to minimize.
[2023-04-06 21:31:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2023-04-06 21:31:10] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 5 ms to minimize.
[2023-04-06 21:31:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2023-04-06 21:31:10] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 1 ms to minimize.
[2023-04-06 21:31:11] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 1 ms to minimize.
[2023-04-06 21:31:11] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 0 ms to minimize.
[2023-04-06 21:31:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 316 ms
[2023-04-06 21:31:11] [INFO ] After 2308ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 254 ms.
[2023-04-06 21:31:11] [INFO ] After 3101ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 918 ms.
Support contains 9 out of 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 2160/2160 transitions.
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 56 Pre rules applied. Total rules applied 0 place count 448 transition count 2104
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 0 with 112 rules applied. Total rules applied 112 place count 392 transition count 2104
Applied a total of 112 rules in 73 ms. Remains 392 /448 variables (removed 56) and now considering 2104/2160 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 392/448 places, 2104/2160 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 19783 ms. (steps per millisecond=50 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2260 ms. (steps per millisecond=442 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2175 ms. (steps per millisecond=459 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2235 ms. (steps per millisecond=447 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2185 ms. (steps per millisecond=457 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2219 ms. (steps per millisecond=450 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2214 ms. (steps per millisecond=451 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2204 ms. (steps per millisecond=453 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2217 ms. (steps per millisecond=451 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2173 ms. (steps per millisecond=460 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 13715469 steps, run timeout after 117001 ms. (steps per millisecond=117 ) properties seen :{0=1, 7=1, 8=1}
Probabilistic random walk after 13715469 steps, saw 3103829 distinct states, run finished after 117001 ms. (steps per millisecond=117 ) properties seen :3
Running SMT prover for 6 properties.
[2023-04-06 21:33:49] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2023-04-06 21:33:49] [INFO ] Computed 25 invariants in 3 ms
[2023-04-06 21:33:49] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-04-06 21:33:49] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-04-06 21:33:49] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2023-04-06 21:33:49] [INFO ] After 235ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-04-06 21:33:49] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 21:33:49] [INFO ] After 182ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-04-06 21:33:49] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 0 ms to minimize.
[2023-04-06 21:33:50] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 0 ms to minimize.
[2023-04-06 21:33:50] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 2 ms to minimize.
[2023-04-06 21:33:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 298 ms
[2023-04-06 21:33:50] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2023-04-06 21:33:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2023-04-06 21:33:50] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 2 ms to minimize.
[2023-04-06 21:33:50] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2023-04-06 21:33:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 232 ms
[2023-04-06 21:33:50] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 2 ms to minimize.
[2023-04-06 21:33:50] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 2 ms to minimize.
[2023-04-06 21:33:50] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 0 ms to minimize.
[2023-04-06 21:33:50] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
[2023-04-06 21:33:51] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 0 ms to minimize.
[2023-04-06 21:33:51] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 499 ms
[2023-04-06 21:33:51] [INFO ] After 1499ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 147 ms.
[2023-04-06 21:33:51] [INFO ] After 2013ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 460 ms.
Support contains 6 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 63 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 392/392 places, 2104/2104 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 16512 ms. (steps per millisecond=60 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2023 ms. (steps per millisecond=494 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2034 ms. (steps per millisecond=491 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2194 ms. (steps per millisecond=455 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1952 ms. (steps per millisecond=512 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2166 ms. (steps per millisecond=461 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2260 ms. (steps per millisecond=442 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 10678113 steps, run timeout after 87001 ms. (steps per millisecond=122 ) properties seen :{}
Probabilistic random walk after 10678113 steps, saw 2521448 distinct states, run finished after 87004 ms. (steps per millisecond=122 ) properties seen :0
Running SMT prover for 6 properties.
[2023-04-06 21:35:47] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 21:35:47] [INFO ] Invariant cache hit.
[2023-04-06 21:35:47] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-04-06 21:35:48] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-04-06 21:35:48] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2023-04-06 21:35:48] [INFO ] After 242ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-04-06 21:35:48] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 21:35:48] [INFO ] After 206ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-04-06 21:35:48] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 1 ms to minimize.
[2023-04-06 21:35:48] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 0 ms to minimize.
[2023-04-06 21:35:48] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 0 ms to minimize.
[2023-04-06 21:35:49] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 0 ms to minimize.
[2023-04-06 21:35:49] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 427 ms
[2023-04-06 21:35:49] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 1 ms to minimize.
[2023-04-06 21:35:49] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 0 ms to minimize.
[2023-04-06 21:35:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 227 ms
[2023-04-06 21:35:49] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 0 ms to minimize.
[2023-04-06 21:35:49] [INFO ] Deduced a trap composed of 48 places in 75 ms of which 0 ms to minimize.
[2023-04-06 21:35:49] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 0 ms to minimize.
[2023-04-06 21:35:49] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 0 ms to minimize.
[2023-04-06 21:35:49] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 414 ms
[2023-04-06 21:35:49] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 0 ms to minimize.
[2023-04-06 21:35:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2023-04-06 21:35:49] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 1 ms to minimize.
[2023-04-06 21:35:50] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 0 ms to minimize.
[2023-04-06 21:35:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 187 ms
[2023-04-06 21:35:50] [INFO ] After 1709ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 149 ms.
[2023-04-06 21:35:50] [INFO ] After 2262ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 384 ms.
Support contains 6 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 64 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 81 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2023-04-06 21:35:50] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 21:35:50] [INFO ] Invariant cache hit.
[2023-04-06 21:35:51] [INFO ] Implicit Places using invariants in 345 ms returned []
[2023-04-06 21:35:51] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 21:35:51] [INFO ] Invariant cache hit.
[2023-04-06 21:35:51] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 21:35:52] [INFO ] Implicit Places using invariants and state equation in 1661 ms returned []
Implicit Place search using SMT with State Equation took 2009 ms to find 0 implicit places.
[2023-04-06 21:35:52] [INFO ] Redundant transitions in 119 ms returned []
[2023-04-06 21:35:52] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 21:35:52] [INFO ] Invariant cache hit.
[2023-04-06 21:35:53] [INFO ] Dead Transitions using invariants and state equation in 646 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2863 ms. Remains : 392/392 places, 2104/2104 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 1773 ms. (steps per millisecond=56 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-04-06 21:35:55] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 21:35:55] [INFO ] Invariant cache hit.
[2023-04-06 21:35:55] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-06 21:35:55] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-06 21:35:55] [INFO ] After 140ms SMT Verify possible using state equation in real domain returned unsat :0 sat :6
[2023-04-06 21:35:55] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 21:35:55] [INFO ] After 56ms SMT Verify possible using 284 Read/Feed constraints in real domain returned unsat :0 sat :6
[2023-04-06 21:35:55] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 0 ms to minimize.
[2023-04-06 21:35:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2023-04-06 21:35:55] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-04-06 21:35:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2023-04-06 21:35:56] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 0 ms to minimize.
[2023-04-06 21:35:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 144 ms
[2023-04-06 21:35:56] [INFO ] After 611ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:6
[2023-04-06 21:35:56] [INFO ] After 834ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-04-06 21:35:56] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-06 21:35:56] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-06 21:35:56] [INFO ] After 141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-04-06 21:35:56] [INFO ] After 68ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-04-06 21:35:56] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 1 ms to minimize.
[2023-04-06 21:35:56] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 0 ms to minimize.
[2023-04-06 21:35:56] [INFO ] Deduced a trap composed of 49 places in 92 ms of which 1 ms to minimize.
[2023-04-06 21:35:56] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 0 ms to minimize.
[2023-04-06 21:35:57] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 0 ms to minimize.
[2023-04-06 21:35:57] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 0 ms to minimize.
[2023-04-06 21:35:57] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 688 ms
[2023-04-06 21:35:57] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2023-04-06 21:35:57] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 0 ms to minimize.
[2023-04-06 21:35:57] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 0 ms to minimize.
[2023-04-06 21:35:57] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 0 ms to minimize.
[2023-04-06 21:35:57] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 403 ms
[2023-04-06 21:35:57] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2023-04-06 21:35:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2023-04-06 21:35:57] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 0 ms to minimize.
[2023-04-06 21:35:57] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 0 ms to minimize.
[2023-04-06 21:35:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 211 ms
[2023-04-06 21:35:58] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 0 ms to minimize.
[2023-04-06 21:35:58] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2023-04-06 21:35:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 183 ms
[2023-04-06 21:35:58] [INFO ] After 1805ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-04-06 21:35:58] [INFO ] After 2053ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 16467 ms. (steps per millisecond=60 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1968 ms. (steps per millisecond=508 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1880 ms. (steps per millisecond=531 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1895 ms. (steps per millisecond=527 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1956 ms. (steps per millisecond=511 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1898 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1864 ms. (steps per millisecond=536 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 9864666 steps, run timeout after 81001 ms. (steps per millisecond=121 ) properties seen :{}
Probabilistic random walk after 9864666 steps, saw 2382066 distinct states, run finished after 81002 ms. (steps per millisecond=121 ) properties seen :0
Running SMT prover for 6 properties.
[2023-04-06 21:37:47] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 21:37:47] [INFO ] Invariant cache hit.
[2023-04-06 21:37:47] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-04-06 21:37:47] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2023-04-06 21:37:47] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2023-04-06 21:37:47] [INFO ] After 260ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-04-06 21:37:47] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 21:37:47] [INFO ] After 194ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-04-06 21:37:48] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 0 ms to minimize.
[2023-04-06 21:37:48] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 0 ms to minimize.
[2023-04-06 21:37:48] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 0 ms to minimize.
[2023-04-06 21:37:48] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 0 ms to minimize.
[2023-04-06 21:37:48] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 416 ms
[2023-04-06 21:37:48] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 0 ms to minimize.
[2023-04-06 21:37:48] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2023-04-06 21:37:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 217 ms
[2023-04-06 21:37:48] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 0 ms to minimize.
[2023-04-06 21:37:48] [INFO ] Deduced a trap composed of 48 places in 73 ms of which 0 ms to minimize.
[2023-04-06 21:37:48] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 1 ms to minimize.
[2023-04-06 21:37:48] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2023-04-06 21:37:49] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 404 ms
[2023-04-06 21:37:49] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2023-04-06 21:37:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2023-04-06 21:37:49] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 0 ms to minimize.
[2023-04-06 21:37:49] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 0 ms to minimize.
[2023-04-06 21:37:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 190 ms
[2023-04-06 21:37:49] [INFO ] After 1652ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 143 ms.
[2023-04-06 21:37:49] [INFO ] After 2226ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 404 ms.
Support contains 6 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 60 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 61 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2023-04-06 21:37:50] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 21:37:50] [INFO ] Invariant cache hit.
[2023-04-06 21:37:50] [INFO ] Implicit Places using invariants in 356 ms returned []
[2023-04-06 21:37:50] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 21:37:50] [INFO ] Invariant cache hit.
[2023-04-06 21:37:50] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 21:37:51] [INFO ] Implicit Places using invariants and state equation in 1603 ms returned []
Implicit Place search using SMT with State Equation took 1962 ms to find 0 implicit places.
[2023-04-06 21:37:52] [INFO ] Redundant transitions in 143 ms returned []
[2023-04-06 21:37:52] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 21:37:52] [INFO ] Invariant cache hit.
[2023-04-06 21:37:52] [INFO ] Dead Transitions using invariants and state equation in 659 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2835 ms. Remains : 392/392 places, 2104/2104 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 1773 ms. (steps per millisecond=56 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-04-06 21:37:54] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 21:37:54] [INFO ] Invariant cache hit.
[2023-04-06 21:37:54] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-06 21:37:54] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-06 21:37:54] [INFO ] After 148ms SMT Verify possible using state equation in real domain returned unsat :0 sat :6
[2023-04-06 21:37:54] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 21:37:54] [INFO ] After 61ms SMT Verify possible using 284 Read/Feed constraints in real domain returned unsat :0 sat :6
[2023-04-06 21:37:54] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2023-04-06 21:37:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2023-04-06 21:37:55] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2023-04-06 21:37:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2023-04-06 21:37:55] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 1 ms to minimize.
[2023-04-06 21:37:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2023-04-06 21:37:55] [INFO ] After 615ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:6
[2023-04-06 21:37:55] [INFO ] After 835ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-04-06 21:37:55] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-06 21:37:55] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-06 21:37:55] [INFO ] After 142ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-04-06 21:37:55] [INFO ] After 72ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-04-06 21:37:55] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 0 ms to minimize.
[2023-04-06 21:37:55] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 1 ms to minimize.
[2023-04-06 21:37:56] [INFO ] Deduced a trap composed of 49 places in 106 ms of which 0 ms to minimize.
[2023-04-06 21:37:56] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 0 ms to minimize.
[2023-04-06 21:37:56] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 1 ms to minimize.
[2023-04-06 21:37:56] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2023-04-06 21:37:56] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 724 ms
[2023-04-06 21:37:56] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-04-06 21:37:56] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 1 ms to minimize.
[2023-04-06 21:37:56] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 1 ms to minimize.
[2023-04-06 21:37:56] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 0 ms to minimize.
[2023-04-06 21:37:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 419 ms
[2023-04-06 21:37:56] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 0 ms to minimize.
[2023-04-06 21:37:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2023-04-06 21:37:57] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 0 ms to minimize.
[2023-04-06 21:37:57] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 0 ms to minimize.
[2023-04-06 21:37:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 224 ms
[2023-04-06 21:37:57] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 0 ms to minimize.
[2023-04-06 21:37:57] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2023-04-06 21:37:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 180 ms
[2023-04-06 21:37:57] [INFO ] After 1877ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-04-06 21:37:57] [INFO ] After 2132ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 561960 steps, run timeout after 3001 ms. (steps per millisecond=187 ) properties seen :{}
Probabilistic random walk after 561960 steps, saw 289555 distinct states, run finished after 3001 ms. (steps per millisecond=187 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:38:00] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 21:38:00] [INFO ] Invariant cache hit.
[2023-04-06 21:38:00] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:38:00] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-06 21:38:00] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-06 21:38:00] [INFO ] After 147ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:38:00] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 21:38:00] [INFO ] After 76ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:38:01] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 1 ms to minimize.
[2023-04-06 21:38:01] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 0 ms to minimize.
[2023-04-06 21:38:01] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 0 ms to minimize.
[2023-04-06 21:38:01] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 0 ms to minimize.
[2023-04-06 21:38:01] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2023-04-06 21:38:01] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 545 ms
[2023-04-06 21:38:01] [INFO ] After 639ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-04-06 21:38:01] [INFO ] After 887ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 61 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 392/392 places, 2104/2104 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) 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 545238 steps, run timeout after 3001 ms. (steps per millisecond=181 ) properties seen :{}
Probabilistic random walk after 545238 steps, saw 282227 distinct states, run finished after 3001 ms. (steps per millisecond=181 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:38:04] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 21:38:04] [INFO ] Invariant cache hit.
[2023-04-06 21:38:04] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:38:04] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-06 21:38:04] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-06 21:38:04] [INFO ] After 155ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:38:04] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 21:38:05] [INFO ] After 75ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:38:05] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 0 ms to minimize.
[2023-04-06 21:38:05] [INFO ] Deduced a trap composed of 3 places in 94 ms of which 1 ms to minimize.
[2023-04-06 21:38:05] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 1 ms to minimize.
[2023-04-06 21:38:05] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2023-04-06 21:38:05] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-04-06 21:38:05] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 569 ms
[2023-04-06 21:38:05] [INFO ] After 667ms 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 21:38:05] [INFO ] After 930ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 66 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 55 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2023-04-06 21:38:05] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 21:38:05] [INFO ] Invariant cache hit.
[2023-04-06 21:38:06] [INFO ] Implicit Places using invariants in 335 ms returned []
[2023-04-06 21:38:06] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 21:38:06] [INFO ] Invariant cache hit.
[2023-04-06 21:38:06] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 21:38:07] [INFO ] Implicit Places using invariants and state equation in 1663 ms returned []
Implicit Place search using SMT with State Equation took 2000 ms to find 0 implicit places.
[2023-04-06 21:38:07] [INFO ] Redundant transitions in 38 ms returned []
[2023-04-06 21:38:07] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 21:38:07] [INFO ] Invariant cache hit.
[2023-04-06 21:38:08] [INFO ] Dead Transitions using invariants and state equation in 639 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2740 ms. Remains : 392/392 places, 2104/2104 transitions.
Graph (trivial) has 1938 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 5 ms
Free SCC test removed 56 places
Drop transitions removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 336 transition count 410
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 157 place count 258 transition count 410
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 157 place count 258 transition count 393
Deduced a syphon composed of 17 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 199 place count 233 transition count 393
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 421 place count 122 transition count 282
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 2 with 54 rules applied. Total rules applied 475 place count 122 transition count 228
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 491 place count 114 transition count 228
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 499 place count 114 transition count 220
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 508 place count 114 transition count 211
Free-agglomeration rule applied 57 times.
Iterating global reduction 4 with 57 rules applied. Total rules applied 565 place count 114 transition count 154
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 4 with 57 rules applied. Total rules applied 622 place count 57 transition count 154
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 630 place count 57 transition count 154
Applied a total of 630 rules in 57 ms. Remains 57 /392 variables (removed 335) and now considering 154/2104 (removed 1950) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 154 rows 57 cols
[2023-04-06 21:38:08] [INFO ] Computed 17 invariants in 2 ms
[2023-04-06 21:38:08] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:38:08] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2023-04-06 21:38:08] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:38:08] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-06 21:38:08] [INFO ] After 4ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:38:08] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-04-06 21:38:08] [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 577908 steps, run timeout after 3001 ms. (steps per millisecond=192 ) properties seen :{}
Probabilistic random walk after 577908 steps, saw 296726 distinct states, run finished after 3001 ms. (steps per millisecond=192 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:38:11] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2023-04-06 21:38:11] [INFO ] Computed 25 invariants in 10 ms
[2023-04-06 21:38:11] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:38:11] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-06 21:38:11] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-06 21:38:11] [INFO ] After 148ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:38:11] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 21:38:12] [INFO ] After 65ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:38:12] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-04-06 21:38:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2023-04-06 21:38:12] [INFO ] After 161ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-04-06 21:38:12] [INFO ] After 411ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 89 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 392/392 places, 2104/2104 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) 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 564399 steps, run timeout after 3001 ms. (steps per millisecond=188 ) properties seen :{}
Probabilistic random walk after 564399 steps, saw 290167 distinct states, run finished after 3001 ms. (steps per millisecond=188 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:38:15] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 21:38:15] [INFO ] Invariant cache hit.
[2023-04-06 21:38:15] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:38:15] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-06 21:38:15] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-06 21:38:15] [INFO ] After 147ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:38:15] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 21:38:15] [INFO ] After 60ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:38:15] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2023-04-06 21:38:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2023-04-06 21:38:15] [INFO ] After 152ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-04-06 21:38:15] [INFO ] After 410ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 64 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 63 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2023-04-06 21:38:15] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 21:38:15] [INFO ] Invariant cache hit.
[2023-04-06 21:38:16] [INFO ] Implicit Places using invariants in 334 ms returned []
[2023-04-06 21:38:16] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 21:38:16] [INFO ] Invariant cache hit.
[2023-04-06 21:38:16] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 21:38:17] [INFO ] Implicit Places using invariants and state equation in 1636 ms returned []
Implicit Place search using SMT with State Equation took 1973 ms to find 0 implicit places.
[2023-04-06 21:38:17] [INFO ] Redundant transitions in 39 ms returned []
[2023-04-06 21:38:17] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 21:38:17] [INFO ] Invariant cache hit.
[2023-04-06 21:38:18] [INFO ] Dead Transitions using invariants and state equation in 627 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2715 ms. Remains : 392/392 places, 2104/2104 transitions.
Graph (trivial) has 1958 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 1 ms
Free SCC test removed 56 places
Drop transitions removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 336 transition count 409
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 159 place count 257 transition count 409
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 159 place count 257 transition count 392
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 201 place count 232 transition count 392
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 423 place count 121 transition count 281
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 2 with 56 rules applied. Total rules applied 479 place count 121 transition count 225
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 495 place count 113 transition count 225
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 503 place count 113 transition count 217
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 511 place count 113 transition count 209
Free-agglomeration rule applied 56 times.
Iterating global reduction 4 with 56 rules applied. Total rules applied 567 place count 113 transition count 153
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 4 with 56 rules applied. Total rules applied 623 place count 57 transition count 153
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 631 place count 57 transition count 153
Applied a total of 631 rules in 27 ms. Remains 57 /392 variables (removed 335) and now considering 153/2104 (removed 1951) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 153 rows 57 cols
[2023-04-06 21:38:18] [INFO ] Computed 17 invariants in 2 ms
[2023-04-06 21:38:18] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:38:18] [INFO ] [Nat]Absence check using 17 positive place invariants in 2 ms returned sat
[2023-04-06 21:38:18] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:38:18] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-06 21:38:18] [INFO ] After 4ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:38:18] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-04-06 21:38:18] [INFO ] After 62ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 566370 steps, run timeout after 3001 ms. (steps per millisecond=188 ) properties seen :{}
Probabilistic random walk after 566370 steps, saw 291234 distinct states, run finished after 3001 ms. (steps per millisecond=188 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:38:21] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2023-04-06 21:38:21] [INFO ] Computed 25 invariants in 4 ms
[2023-04-06 21:38:21] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:38:21] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-06 21:38:21] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 2 ms returned sat
[2023-04-06 21:38:21] [INFO ] After 149ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:38:21] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 21:38:22] [INFO ] After 51ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:38:22] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-04-06 21:38:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2023-04-06 21:38:22] [INFO ] After 147ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-04-06 21:38:22] [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 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 55 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 392/392 places, 2104/2104 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 569781 steps, run timeout after 3001 ms. (steps per millisecond=189 ) properties seen :{}
Probabilistic random walk after 569781 steps, saw 292818 distinct states, run finished after 3001 ms. (steps per millisecond=189 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:38:25] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 21:38:25] [INFO ] Invariant cache hit.
[2023-04-06 21:38:25] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:38:25] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-06 21:38:25] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-06 21:38:25] [INFO ] After 154ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:38:25] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 21:38:25] [INFO ] After 56ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:38:25] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2023-04-06 21:38:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2023-04-06 21:38:25] [INFO ] After 159ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-04-06 21:38:25] [INFO ] After 420ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 57 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 60 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2023-04-06 21:38:25] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 21:38:25] [INFO ] Invariant cache hit.
[2023-04-06 21:38:26] [INFO ] Implicit Places using invariants in 351 ms returned []
[2023-04-06 21:38:26] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 21:38:26] [INFO ] Invariant cache hit.
[2023-04-06 21:38:26] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 21:38:27] [INFO ] Implicit Places using invariants and state equation in 1596 ms returned []
Implicit Place search using SMT with State Equation took 1953 ms to find 0 implicit places.
[2023-04-06 21:38:27] [INFO ] Redundant transitions in 38 ms returned []
[2023-04-06 21:38:27] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 21:38:27] [INFO ] Invariant cache hit.
[2023-04-06 21:38:28] [INFO ] Dead Transitions using invariants and state equation in 633 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2690 ms. Remains : 392/392 places, 2104/2104 transitions.
Graph (trivial) has 1958 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 1 ms
Free SCC test removed 56 places
Drop transitions removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 336 transition count 409
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 159 place count 257 transition count 409
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 159 place count 257 transition count 392
Deduced a syphon composed of 17 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 201 place count 232 transition count 392
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 423 place count 121 transition count 281
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 2 with 56 rules applied. Total rules applied 479 place count 121 transition count 225
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 495 place count 113 transition count 225
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 503 place count 113 transition count 217
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 511 place count 113 transition count 209
Free-agglomeration rule applied 56 times.
Iterating global reduction 4 with 56 rules applied. Total rules applied 567 place count 113 transition count 153
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 4 with 56 rules applied. Total rules applied 623 place count 57 transition count 153
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 631 place count 57 transition count 153
Applied a total of 631 rules in 30 ms. Remains 57 /392 variables (removed 335) and now considering 153/2104 (removed 1951) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 153 rows 57 cols
[2023-04-06 21:38:28] [INFO ] Computed 17 invariants in 1 ms
[2023-04-06 21:38:28] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:38:28] [INFO ] [Nat]Absence check using 17 positive place invariants in 2 ms returned sat
[2023-04-06 21:38:28] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:38:28] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-06 21:38:28] [INFO ] After 5ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:38:28] [INFO ] After 18ms 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 21:38:28] [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 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 567000 steps, run timeout after 3001 ms. (steps per millisecond=188 ) properties seen :{}
Probabilistic random walk after 567000 steps, saw 291330 distinct states, run finished after 3001 ms. (steps per millisecond=188 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:38:31] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2023-04-06 21:38:31] [INFO ] Computed 25 invariants in 4 ms
[2023-04-06 21:38:31] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:38:31] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-06 21:38:31] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-06 21:38:31] [INFO ] After 141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:38:31] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 21:38:31] [INFO ] After 51ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:38:32] [INFO ] After 87ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-04-06 21:38:32] [INFO ] After 327ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 60 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 392/392 places, 2104/2104 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) 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 555498 steps, run timeout after 3001 ms. (steps per millisecond=185 ) properties seen :{}
Probabilistic random walk after 555498 steps, saw 287094 distinct states, run finished after 3001 ms. (steps per millisecond=185 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:38:35] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 21:38:35] [INFO ] Invariant cache hit.
[2023-04-06 21:38:35] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:38:35] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2023-04-06 21:38:35] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-06 21:38:35] [INFO ] After 144ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:38:35] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 21:38:35] [INFO ] After 59ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:38:35] [INFO ] After 96ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-04-06 21:38:35] [INFO ] After 353ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 59 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 56 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2023-04-06 21:38:35] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 21:38:35] [INFO ] Invariant cache hit.
[2023-04-06 21:38:35] [INFO ] Implicit Places using invariants in 339 ms returned []
[2023-04-06 21:38:35] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 21:38:35] [INFO ] Invariant cache hit.
[2023-04-06 21:38:36] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 21:38:37] [INFO ] Implicit Places using invariants and state equation in 1631 ms returned []
Implicit Place search using SMT with State Equation took 1972 ms to find 0 implicit places.
[2023-04-06 21:38:37] [INFO ] Redundant transitions in 43 ms returned []
[2023-04-06 21:38:37] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 21:38:37] [INFO ] Invariant cache hit.
[2023-04-06 21:38:38] [INFO ] Dead Transitions using invariants and state equation in 610 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2698 ms. Remains : 392/392 places, 2104/2104 transitions.
Graph (trivial) has 1958 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 0 ms
Free SCC test removed 56 places
Drop transitions removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 336 transition count 409
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 159 place count 257 transition count 409
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 159 place count 257 transition count 392
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 201 place count 232 transition count 392
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 423 place count 121 transition count 281
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 2 with 56 rules applied. Total rules applied 479 place count 121 transition count 225
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 495 place count 113 transition count 225
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 503 place count 113 transition count 217
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 511 place count 113 transition count 209
Free-agglomeration rule applied 56 times.
Iterating global reduction 4 with 56 rules applied. Total rules applied 567 place count 113 transition count 153
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 4 with 56 rules applied. Total rules applied 623 place count 57 transition count 153
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 631 place count 57 transition count 153
Applied a total of 631 rules in 21 ms. Remains 57 /392 variables (removed 335) and now considering 153/2104 (removed 1951) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 153 rows 57 cols
[2023-04-06 21:38:38] [INFO ] Computed 17 invariants in 1 ms
[2023-04-06 21:38:38] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:38:38] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2023-04-06 21:38:38] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:38:38] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-06 21:38:38] [INFO ] After 5ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:38:38] [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 21:38:38] [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 27 ms. (steps per millisecond=370 ) 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 564048 steps, run timeout after 3001 ms. (steps per millisecond=187 ) properties seen :{}
Probabilistic random walk after 564048 steps, saw 289958 distinct states, run finished after 3001 ms. (steps per millisecond=187 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:38:41] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2023-04-06 21:38:41] [INFO ] Computed 25 invariants in 7 ms
[2023-04-06 21:38:41] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:38:41] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-06 21:38:41] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-06 21:38:41] [INFO ] After 151ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:38:41] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 21:38:41] [INFO ] After 54ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:38:41] [INFO ] After 95ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-04-06 21:38:41] [INFO ] After 356ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 59 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 392/392 places, 2104/2104 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) 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 559161 steps, run timeout after 3001 ms. (steps per millisecond=186 ) properties seen :{}
Probabilistic random walk after 559161 steps, saw 288262 distinct states, run finished after 3002 ms. (steps per millisecond=186 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:38:44] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 21:38:44] [INFO ] Invariant cache hit.
[2023-04-06 21:38:45] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:38:45] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-06 21:38:45] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-06 21:38:45] [INFO ] After 145ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:38:45] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 21:38:45] [INFO ] After 55ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:38:45] [INFO ] After 91ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-04-06 21:38:45] [INFO ] After 334ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 57 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 56 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2023-04-06 21:38:45] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 21:38:45] [INFO ] Invariant cache hit.
[2023-04-06 21:38:45] [INFO ] Implicit Places using invariants in 350 ms returned []
[2023-04-06 21:38:45] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 21:38:45] [INFO ] Invariant cache hit.
[2023-04-06 21:38:46] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 21:38:47] [INFO ] Implicit Places using invariants and state equation in 1613 ms returned []
Implicit Place search using SMT with State Equation took 1966 ms to find 0 implicit places.
[2023-04-06 21:38:47] [INFO ] Redundant transitions in 41 ms returned []
[2023-04-06 21:38:47] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 21:38:47] [INFO ] Invariant cache hit.
[2023-04-06 21:38:48] [INFO ] Dead Transitions using invariants and state equation in 596 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2671 ms. Remains : 392/392 places, 2104/2104 transitions.
Graph (trivial) has 1958 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 1 ms
Free SCC test removed 56 places
Drop transitions removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 336 transition count 409
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 159 place count 257 transition count 409
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 159 place count 257 transition count 392
Deduced a syphon composed of 17 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 201 place count 232 transition count 392
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 423 place count 121 transition count 281
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 2 with 56 rules applied. Total rules applied 479 place count 121 transition count 225
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 495 place count 113 transition count 225
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 503 place count 113 transition count 217
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 511 place count 113 transition count 209
Free-agglomeration rule applied 56 times.
Iterating global reduction 4 with 56 rules applied. Total rules applied 567 place count 113 transition count 153
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 4 with 56 rules applied. Total rules applied 623 place count 57 transition count 153
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 631 place count 57 transition count 153
Applied a total of 631 rules in 25 ms. Remains 57 /392 variables (removed 335) and now considering 153/2104 (removed 1951) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 153 rows 57 cols
[2023-04-06 21:38:48] [INFO ] Computed 17 invariants in 1 ms
[2023-04-06 21:38:48] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:38:48] [INFO ] [Nat]Absence check using 17 positive place invariants in 2 ms returned sat
[2023-04-06 21:38:48] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:38:48] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-06 21:38:48] [INFO ] After 4ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:38:48] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-04-06 21:38:48] [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 27 ms. (steps per millisecond=370 ) 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 568980 steps, run timeout after 3001 ms. (steps per millisecond=189 ) properties seen :{}
Probabilistic random walk after 568980 steps, saw 292393 distinct states, run finished after 3001 ms. (steps per millisecond=189 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:38:51] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2023-04-06 21:38:51] [INFO ] Computed 25 invariants in 6 ms
[2023-04-06 21:38:51] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:38:51] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-06 21:38:51] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-06 21:38:51] [INFO ] After 154ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:38:51] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 21:38:51] [INFO ] After 60ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:38:51] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2023-04-06 21:38:51] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2023-04-06 21:38:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 180 ms
[2023-04-06 21:38:51] [INFO ] After 257ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-04-06 21:38:51] [INFO ] After 519ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 56 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 392/392 places, 2104/2104 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 557973 steps, run timeout after 3001 ms. (steps per millisecond=185 ) properties seen :{}
Probabilistic random walk after 557973 steps, saw 287727 distinct states, run finished after 3001 ms. (steps per millisecond=185 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:38:54] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 21:38:54] [INFO ] Invariant cache hit.
[2023-04-06 21:38:55] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:38:55] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-06 21:38:55] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-06 21:38:55] [INFO ] After 151ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:38:55] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 21:38:55] [INFO ] After 57ms SMT Verify possible using 284 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:38:55] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2023-04-06 21:38:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2023-04-06 21:38:55] [INFO ] After 159ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-04-06 21:38:55] [INFO ] After 419ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 57 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 56 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2023-04-06 21:38:55] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 21:38:55] [INFO ] Invariant cache hit.
[2023-04-06 21:38:55] [INFO ] Implicit Places using invariants in 342 ms returned []
[2023-04-06 21:38:55] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 21:38:55] [INFO ] Invariant cache hit.
[2023-04-06 21:38:56] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 21:38:57] [INFO ] Implicit Places using invariants and state equation in 1640 ms returned []
Implicit Place search using SMT with State Equation took 1982 ms to find 0 implicit places.
[2023-04-06 21:38:57] [INFO ] Redundant transitions in 42 ms returned []
[2023-04-06 21:38:57] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 21:38:57] [INFO ] Invariant cache hit.
[2023-04-06 21:38:58] [INFO ] Dead Transitions using invariants and state equation in 624 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2716 ms. Remains : 392/392 places, 2104/2104 transitions.
Graph (trivial) has 1958 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 0 ms
Free SCC test removed 56 places
Drop transitions removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 336 transition count 409
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 159 place count 257 transition count 409
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 159 place count 257 transition count 392
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 201 place count 232 transition count 392
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 423 place count 121 transition count 281
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 2 with 56 rules applied. Total rules applied 479 place count 121 transition count 225
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 495 place count 113 transition count 225
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 503 place count 113 transition count 217
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 511 place count 113 transition count 209
Free-agglomeration rule applied 56 times.
Iterating global reduction 4 with 56 rules applied. Total rules applied 567 place count 113 transition count 153
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 4 with 56 rules applied. Total rules applied 623 place count 57 transition count 153
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 631 place count 57 transition count 153
Applied a total of 631 rules in 17 ms. Remains 57 /392 variables (removed 335) and now considering 153/2104 (removed 1951) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 153 rows 57 cols
[2023-04-06 21:38:58] [INFO ] Computed 17 invariants in 1 ms
[2023-04-06 21:38:58] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:38:58] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2023-04-06 21:38:58] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:38:58] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-06 21:38:58] [INFO ] After 4ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:38:58] [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 21:38:58] [INFO ] After 64ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Graph (trivial) has 1928 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 1 ms
Free SCC test removed 56 places
Drop transitions removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 336 transition count 410
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 157 place count 258 transition count 410
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 157 place count 258 transition count 393
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 199 place count 233 transition count 393
Performed 106 Post agglomeration using F-continuation condition.Transition count delta: 106
Deduced a syphon composed of 106 places in 0 ms
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 2 with 212 rules applied. Total rules applied 411 place count 127 transition count 287
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 2 with 54 rules applied. Total rules applied 465 place count 127 transition count 233
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 481 place count 119 transition count 233
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 489 place count 119 transition count 225
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 498 place count 119 transition count 216
Free-agglomeration rule applied 57 times.
Iterating global reduction 4 with 57 rules applied. Total rules applied 555 place count 119 transition count 159
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 4 with 57 rules applied. Total rules applied 612 place count 62 transition count 159
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 620 place count 62 transition count 159
Applied a total of 620 rules in 22 ms. Remains 62 /392 variables (removed 330) and now considering 159/2104 (removed 1945) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 159 rows 62 cols
[2023-04-06 21:38:58] [INFO ] Computed 17 invariants in 1 ms
[2023-04-06 21:38:58] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-04-06 21:38:58] [INFO ] [Nat]Absence check using 17 positive place invariants in 2 ms returned sat
[2023-04-06 21:38:58] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-04-06 21:38:58] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-06 21:38:58] [INFO ] After 23ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-04-06 21:38:58] [INFO ] After 63ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-04-06 21:38:58] [INFO ] After 171ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Unable to solve all queries for examination StableMarking. Remains :6 assertions to prove.
No /home/mcc/execution/StableMarking.xml examination file found. Proceeding without properties.
Parsed 6 properties from file /home/mcc/execution/StableMarking.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 706273 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running EisenbergMcGuire (PT), instance 08
Examination StableMarking
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/StableMarking.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

PNML FILE: model.pnml
Petri model created: 712 places, 2816 transitions, 13440 arcs.
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393216 kB
MemFree: 13992988 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16164512 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -timeout 180 -rebuildPNML
Caught signal 15, terminating.

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="EisenbergMcGuire-PT-08"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is EisenbergMcGuire-PT-08, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r537-tall-167987255000163"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-08.tgz
mv EisenbergMcGuire-PT-08 execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;