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.r152-smll-167819439200297.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 marciexred
Input is DoubleExponent-PT-010, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r152-smll-167819439200297
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 7.2K Feb 26 13:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 26 13:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 26 13:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 13:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Feb 26 13:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 26 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 26 13:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Feb 26 13:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 169K Mar 5 18:22 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 QuasiLiveness

=== Now, execution of the tool begins

BK_START 1678398747160

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=marciexred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DoubleExponent-PT-010
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-09 21:52:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2023-03-09 21:52:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 21:52:30] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2023-03-09 21:52:30] [INFO ] Transformed 534 places.
[2023-03-09 21:52:30] [INFO ] Transformed 498 transitions.
[2023-03-09 21:52:30] [INFO ] Parsed PT model containing 534 places and 498 transitions and 1404 arcs in 214 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 534/534 places, 498/498 transitions.
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 124 rules applied. Total rules applied 124 place count 530 transition count 378
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 244 place count 410 transition count 378
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 244 place count 410 transition count 358
Deduced a syphon composed of 20 places in 21 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 284 place count 390 transition count 358
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 94
Deduced a syphon composed of 94 places in 3 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 2 with 188 rules applied. Total rules applied 472 place count 296 transition count 264
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 508 place count 278 transition count 264
Applied a total of 508 rules in 105 ms. Remains 278 /534 variables (removed 256) and now considering 264/498 (removed 234) transitions.
// Phase 1: matrix 264 rows 278 cols
[2023-03-09 21:52:30] [INFO ] Computed 51 place invariants in 57 ms
[2023-03-09 21:52:30] [INFO ] Implicit Places using invariants in 698 ms returned [229, 230]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 747 ms to find 2 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 276/534 places, 264/498 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 276 transition count 263
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 275 transition count 263
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 272 transition count 260
Applied a total of 8 rules in 13 ms. Remains 272 /276 variables (removed 4) and now considering 260/264 (removed 4) transitions.
// Phase 1: matrix 260 rows 272 cols
[2023-03-09 21:52:31] [INFO ] Computed 49 place invariants in 15 ms
[2023-03-09 21:52:31] [INFO ] Implicit Places using invariants in 321 ms returned []
[2023-03-09 21:52:31] [INFO ] Invariant cache hit.
[2023-03-09 21:52:31] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-09 21:52:32] [INFO ] Implicit Places using invariants and state equation in 1548 ms returned []
Implicit Place search using SMT with State Equation took 1873 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 272/534 places, 260/498 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 2740 ms. Remains : 272/534 places, 260/498 transitions.
Discarding 58 transitions out of 260. Remains 202
Initial state reduction rules removed 1 formulas.
Incomplete random walk after 10000 steps, including 1231 resets, run finished after 938 ms. (steps per millisecond=10 ) properties (out of 201) seen :14
Incomplete Best-First random walk after 101 steps, including 9 resets, run finished after 23 ms. (steps per millisecond=4 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 101 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 6 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 101 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 6 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 101 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 101 steps, including 7 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 6 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 7 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 101 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 101 steps, including 6 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 6 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 7 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 101 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 7 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 7 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 101 steps, including 6 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 6 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 7 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 101 steps, including 7 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 7 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 6 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 101 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 7 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 101 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 9 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 7 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 9 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 101 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 9 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 7 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 101 steps, including 7 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 8 resets, run finished after 11 ms. (steps per millisecond=9 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 9 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 9 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 101 steps, including 6 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 101 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 6 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 100 steps, including 6 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 187) seen :0
Incomplete Best-First random walk after 101 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 187) seen :0
Probabilistic random walk after 100000 steps, saw 50010 distinct states, run finished after 2826 ms. (steps per millisecond=35 ) properties seen :35
Running SMT prover for 152 properties.
[2023-03-09 21:52:36] [INFO ] Invariant cache hit.
[2023-03-09 21:52:38] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 21:52:38] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 25 ms returned sat
[2023-03-09 21:52:42] [INFO ] After 3819ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:149
[2023-03-09 21:52:42] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-09 21:52:43] [INFO ] After 153ms SMT Verify possible using 20 Read/Feed constraints in real domain returned unsat :0 sat :0 real:152
[2023-03-09 21:52:43] [INFO ] After 6112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:152
[2023-03-09 21:52:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 21:52:44] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 25 ms returned sat
[2023-03-09 21:52:48] [INFO ] After 3035ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :152
[2023-03-09 21:52:54] [INFO ] After 6034ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :152
[2023-03-09 21:52:54] [INFO ] Deduced a trap composed of 5 places in 128 ms of which 10 ms to minimize.
[2023-03-09 21:52:54] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 1 ms to minimize.
[2023-03-09 21:52:54] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 1 ms to minimize.
[2023-03-09 21:52:54] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 1 ms to minimize.
[2023-03-09 21:52:54] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 1 ms to minimize.
[2023-03-09 21:52:54] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 725 ms
[2023-03-09 21:52:55] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 2 ms to minimize.
[2023-03-09 21:52:55] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 1 ms to minimize.
[2023-03-09 21:52:55] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 1 ms to minimize.
[2023-03-09 21:52:56] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 0 ms to minimize.
[2023-03-09 21:52:56] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 1 ms to minimize.
[2023-03-09 21:52:56] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 655 ms
[2023-03-09 21:52:56] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 0 ms to minimize.
[2023-03-09 21:52:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 149 ms
[2023-03-09 21:52:57] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 1 ms to minimize.
[2023-03-09 21:52:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2023-03-09 21:52:57] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
[2023-03-09 21:52:57] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2023-03-09 21:52:57] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 1 ms to minimize.
[2023-03-09 21:52:57] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 0 ms to minimize.
[2023-03-09 21:52:57] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 402 ms
[2023-03-09 21:52:58] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2023-03-09 21:52:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2023-03-09 21:52:58] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
[2023-03-09 21:52:58] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2023-03-09 21:52:58] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
[2023-03-09 21:52:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 261 ms
[2023-03-09 21:52:59] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 0 ms to minimize.
[2023-03-09 21:52:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2023-03-09 21:52:59] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2023-03-09 21:52:59] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 0 ms to minimize.
[2023-03-09 21:52:59] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 0 ms to minimize.
[2023-03-09 21:52:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 229 ms
[2023-03-09 21:53:00] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2023-03-09 21:53:00] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2023-03-09 21:53:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 172 ms
[2023-03-09 21:53:00] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 1 ms to minimize.
[2023-03-09 21:53:00] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 0 ms to minimize.
[2023-03-09 21:53:00] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 0 ms to minimize.
[2023-03-09 21:53:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 209 ms
[2023-03-09 21:53:01] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 0 ms to minimize.
[2023-03-09 21:53:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2023-03-09 21:53:01] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2023-03-09 21:53:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2023-03-09 21:53:06] [INFO ] After 18329ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :152
Attempting to minimize the solution found.
Minimization took 1701 ms.
[2023-03-09 21:53:08] [INFO ] After 25008ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :151
Parikh walk visited 0 properties in 30208 ms.
Support contains 208 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 260/260 transitions.
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 272 transition count 255
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 10 place count 267 transition count 255
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 267 transition count 255
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 266 transition count 254
Applied a total of 19 rules in 68 ms. Remains 266 /272 variables (removed 6) and now considering 254/260 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 266/272 places, 254/260 transitions.
Interrupted random walk after 809361 steps, including 103716 resets, run timeout after 30001 ms. (steps per millisecond=26 ) properties seen 0
Incomplete Best-First random walk after 10000 steps, including 839 resets, run finished after 258 ms. (steps per millisecond=38 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 862 resets, run finished after 260 ms. (steps per millisecond=38 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 858 resets, run finished after 253 ms. (steps per millisecond=39 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 849 resets, run finished after 250 ms. (steps per millisecond=40 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10001 steps, including 857 resets, run finished after 254 ms. (steps per millisecond=39 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 848 resets, run finished after 271 ms. (steps per millisecond=36 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 846 resets, run finished after 390 ms. (steps per millisecond=25 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 849 resets, run finished after 397 ms. (steps per millisecond=25 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10001 steps, including 833 resets, run finished after 400 ms. (steps per millisecond=25 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10001 steps, including 842 resets, run finished after 403 ms. (steps per millisecond=24 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 863 resets, run finished after 402 ms. (steps per millisecond=24 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10001 steps, including 838 resets, run finished after 367 ms. (steps per millisecond=27 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 848 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 860 resets, run finished after 234 ms. (steps per millisecond=42 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10001 steps, including 830 resets, run finished after 233 ms. (steps per millisecond=42 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 859 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10001 steps, including 836 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 842 resets, run finished after 239 ms. (steps per millisecond=41 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10001 steps, including 846 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 814 resets, run finished after 260 ms. (steps per millisecond=38 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 844 resets, run finished after 251 ms. (steps per millisecond=39 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 850 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 813 resets, run finished after 245 ms. (steps per millisecond=40 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 863 resets, run finished after 275 ms. (steps per millisecond=36 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 842 resets, run finished after 469 ms. (steps per millisecond=21 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10001 steps, including 865 resets, run finished after 464 ms. (steps per millisecond=21 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 844 resets, run finished after 367 ms. (steps per millisecond=27 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 877 resets, run finished after 513 ms. (steps per millisecond=19 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 847 resets, run finished after 455 ms. (steps per millisecond=21 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 851 resets, run finished after 437 ms. (steps per millisecond=22 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10001 steps, including 844 resets, run finished after 291 ms. (steps per millisecond=34 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 841 resets, run finished after 253 ms. (steps per millisecond=39 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10001 steps, including 844 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10001 steps, including 835 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 839 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 839 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10001 steps, including 817 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 841 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10001 steps, including 811 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 863 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 866 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10001 steps, including 837 resets, run finished after 239 ms. (steps per millisecond=41 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10001 steps, including 838 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 868 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10001 steps, including 842 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 845 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10001 steps, including 853 resets, run finished after 241 ms. (steps per millisecond=41 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10001 steps, including 853 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10001 steps, including 829 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 152) seen :0
Incomplete Best-First random walk after 10000 steps, including 827 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 152) seen :0
Probably explored full state space saw : 430257 states, properties seen :7
Probabilistic random walk after 860541 steps, saw 430257 distinct states, run finished after 23671 ms. (steps per millisecond=36 ) properties seen :7
Interrupted probabilistic random walk after 4740724 steps, run timeout after 132001 ms. (steps per millisecond=35 ) properties seen :{0=1, 1=1, 2=1, 3=1, 6=1, 10=1, 11=1, 12=1, 13=1, 87=1, 88=1, 116=1, 117=1, 118=1}
Exhaustive walk after 4740724 steps, saw 2370579 distinct states, run finished after 132005 ms. (steps per millisecond=35 ) properties seen :14
Running SMT prover for 131 properties.
// Phase 1: matrix 254 rows 266 cols
[2023-03-09 21:56:58] [INFO ] Computed 49 place invariants in 14 ms
[2023-03-09 21:56:59] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 21:56:59] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 22 ms returned sat
[2023-03-09 21:57:03] [INFO ] After 2679ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:129
[2023-03-09 21:57:03] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 21:57:03] [INFO ] After 135ms SMT Verify possible using 22 Read/Feed constraints in real domain returned unsat :0 sat :0 real:131
[2023-03-09 21:57:03] [INFO ] After 4737ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:131
[2023-03-09 21:57:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 21:57:04] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 22 ms returned sat
[2023-03-09 21:57:07] [INFO ] After 2540ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :131
[2023-03-09 21:57:11] [INFO ] After 4439ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :131
[2023-03-09 21:57:11] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2023-03-09 21:57:12] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 1 ms to minimize.
[2023-03-09 21:57:12] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 5 ms to minimize.
[2023-03-09 21:57:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 319 ms
[2023-03-09 21:57:16] [INFO ] After 9399ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :131
Attempting to minimize the solution found.
Minimization took 4441 ms.
[2023-03-09 21:57:21] [INFO ] After 18012ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :131
Parikh walk visited 0 properties in 30717 ms.
Support contains 180 out of 266 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 254/254 transitions.
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 266 transition count 250
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 8 place count 262 transition count 250
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 12 place count 262 transition count 250
Applied a total of 12 rules in 33 ms. Remains 262 /266 variables (removed 4) and now considering 250/254 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 262/266 places, 250/254 transitions.
Interrupted random walk after 878129 steps, including 112509 resets, run timeout after 30001 ms. (steps per millisecond=29 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 841 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 845 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 809 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 858 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 861 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 844 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 820 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 831 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 838 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 852 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 857 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 838 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 857 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 851 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 849 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 875 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 823 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 835 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 831 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 848 resets, run finished after 255 ms. (steps per millisecond=39 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 866 resets, run finished after 251 ms. (steps per millisecond=39 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 877 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 828 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 826 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 868 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 852 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 838 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 854 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 874 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 858 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 857 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 873 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 859 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 863 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 841 resets, run finished after 221 ms. (steps per millisecond=45 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 816 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 888 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 817 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 846 resets, run finished after 221 ms. (steps per millisecond=45 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 853 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 831 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 835 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 823 resets, run finished after 221 ms. (steps per millisecond=45 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 844 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 850 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 858 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 883 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 854 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 829 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 842 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 131) seen :0
Interrupted probabilistic random walk after 5257566 steps, run timeout after 123001 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 5257566 steps, saw 2628587 distinct states, run finished after 123004 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 131 properties.
// Phase 1: matrix 250 rows 262 cols
[2023-03-09 22:00:36] [INFO ] Computed 49 place invariants in 17 ms
[2023-03-09 22:00:37] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 22:00:37] [INFO ] [Real]Absence check using 2 positive and 47 generalized place invariants in 32 ms returned sat
[2023-03-09 22:00:42] [INFO ] After 4307ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:129
[2023-03-09 22:00:42] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 22:00:43] [INFO ] After 211ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:131
[2023-03-09 22:00:43] [INFO ] After 6762ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:131
[2023-03-09 22:00:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 22:00:44] [INFO ] [Nat]Absence check using 2 positive and 47 generalized place invariants in 25 ms returned sat
[2023-03-09 22:00:49] [INFO ] After 3841ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :131
[2023-03-09 22:00:55] [INFO ] After 6280ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :131
[2023-03-09 22:00:56] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 1 ms to minimize.
[2023-03-09 22:00:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 157 ms
[2023-03-09 22:00:56] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 0 ms to minimize.
[2023-03-09 22:00:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2023-03-09 22:00:56] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 0 ms to minimize.
[2023-03-09 22:00:56] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 2 ms to minimize.
[2023-03-09 22:00:56] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 0 ms to minimize.
[2023-03-09 22:00:56] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 1 ms to minimize.
[2023-03-09 22:00:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 581 ms
[2023-03-09 22:00:57] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 1 ms to minimize.
[2023-03-09 22:00:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2023-03-09 22:00:58] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 0 ms to minimize.
[2023-03-09 22:00:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2023-03-09 22:00:58] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 1 ms to minimize.
[2023-03-09 22:00:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2023-03-09 22:00:59] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 1 ms to minimize.
[2023-03-09 22:00:59] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 1 ms to minimize.
[2023-03-09 22:00:59] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 1 ms to minimize.
[2023-03-09 22:00:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 327 ms
[2023-03-09 22:00:59] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 0 ms to minimize.
[2023-03-09 22:00:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2023-03-09 22:00:59] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 0 ms to minimize.
[2023-03-09 22:00:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2023-03-09 22:01:00] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 3 ms to minimize.
[2023-03-09 22:01:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 140 ms
[2023-03-09 22:01:00] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2023-03-09 22:01:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2023-03-09 22:01:01] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 1 ms to minimize.
[2023-03-09 22:01:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2023-03-09 22:01:01] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 1 ms to minimize.
[2023-03-09 22:01:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2023-03-09 22:01:01] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2023-03-09 22:01:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2023-03-09 22:01:02] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 4 ms to minimize.
[2023-03-09 22:01:02] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 1 ms to minimize.
[2023-03-09 22:01:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 204 ms
[2023-03-09 22:01:05] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 1 ms to minimize.
[2023-03-09 22:01:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2023-03-09 22:01:06] [INFO ] After 16805ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :131
Attempting to minimize the solution found.
Minimization took 6746 ms.
[2023-03-09 22:01:12] [INFO ] After 29878ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :131
Parikh walk visited 0 properties in 30235 ms.
Support contains 180 out of 262 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 262/262 places, 250/250 transitions.
Applied a total of 0 rules in 11 ms. Remains 262 /262 variables (removed 0) and now considering 250/250 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 262/262 places, 250/250 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 262/262 places, 250/250 transitions.
Applied a total of 0 rules in 10 ms. Remains 262 /262 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-09 22:01:43] [INFO ] Invariant cache hit.
[2023-03-09 22:01:43] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-09 22:01:43] [INFO ] Invariant cache hit.
[2023-03-09 22:01:43] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 22:01:44] [INFO ] Implicit Places using invariants and state equation in 1237 ms returned [20, 214, 253, 259]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 1392 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 258/262 places, 250/250 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 258 transition count 249
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 257 transition count 249
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 257 transition count 249
Applied a total of 4 rules in 28 ms. Remains 257 /258 variables (removed 1) and now considering 249/250 (removed 1) transitions.
// Phase 1: matrix 249 rows 257 cols
[2023-03-09 22:01:44] [INFO ] Computed 45 place invariants in 15 ms
[2023-03-09 22:01:44] [INFO ] Implicit Places using invariants in 132 ms returned []
[2023-03-09 22:01:44] [INFO ] Invariant cache hit.
[2023-03-09 22:01:44] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 22:01:45] [INFO ] Implicit Places using invariants and state equation in 788 ms returned [143]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 927 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 256/262 places, 249/250 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 256 transition count 248
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 255 transition count 248
Applied a total of 2 rules in 29 ms. Remains 255 /256 variables (removed 1) and now considering 248/249 (removed 1) transitions.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 22:01:45] [INFO ] Computed 44 place invariants in 16 ms
[2023-03-09 22:01:45] [INFO ] Implicit Places using invariants in 206 ms returned []
[2023-03-09 22:01:45] [INFO ] Invariant cache hit.
[2023-03-09 22:01:45] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 22:01:46] [INFO ] Implicit Places using invariants and state equation in 846 ms returned []
Implicit Place search using SMT with State Equation took 1054 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 255/262 places, 248/250 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3440 ms. Remains : 255/262 places, 248/250 transitions.
Interrupted random walk after 882603 steps, including 127503 resets, run timeout after 30001 ms. (steps per millisecond=29 ) properties seen 0
Incomplete Best-First random walk after 10000 steps, including 903 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 940 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 930 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 907 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 947 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 887 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 882 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 886 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 885 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 917 resets, run finished after 221 ms. (steps per millisecond=45 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 899 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 939 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 939 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 928 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 932 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 888 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 921 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 923 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 938 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 912 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 905 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 917 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 910 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 877 resets, run finished after 221 ms. (steps per millisecond=45 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 890 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 931 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 921 resets, run finished after 309 ms. (steps per millisecond=32 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 927 resets, run finished after 265 ms. (steps per millisecond=37 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 931 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 917 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 912 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 920 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 923 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 900 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 916 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 931 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 946 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 949 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 945 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 913 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 897 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 928 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 904 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 881 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 899 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 936 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 913 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 954 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 892 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 897 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 131) seen :0
Interrupted probabilistic random walk after 5285718 steps, run timeout after 120001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 5285718 steps, saw 2642489 distinct states, run finished after 120002 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 131 properties.
[2023-03-09 22:04:27] [INFO ] Invariant cache hit.
[2023-03-09 22:04:28] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 22:04:28] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 22 ms returned sat
[2023-03-09 22:04:32] [INFO ] After 2775ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:130
[2023-03-09 22:04:32] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 22:04:32] [INFO ] After 88ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:131
[2023-03-09 22:04:32] [INFO ] After 4567ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:131
[2023-03-09 22:04:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 22:04:32] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 22:04:36] [INFO ] After 2485ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :131
[2023-03-09 22:04:40] [INFO ] After 4228ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :131
[2023-03-09 22:04:40] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
[2023-03-09 22:04:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2023-03-09 22:04:40] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 0 ms to minimize.
[2023-03-09 22:04:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2023-03-09 22:04:41] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2023-03-09 22:04:41] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 0 ms to minimize.
[2023-03-09 22:04:41] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2023-03-09 22:04:41] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 0 ms to minimize.
[2023-03-09 22:04:41] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 367 ms
[2023-03-09 22:04:41] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 0 ms to minimize.
[2023-03-09 22:04:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2023-03-09 22:04:42] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 0 ms to minimize.
[2023-03-09 22:04:42] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 2 ms to minimize.
[2023-03-09 22:04:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 163 ms
[2023-03-09 22:04:42] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 5 ms to minimize.
[2023-03-09 22:04:42] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 2 ms to minimize.
[2023-03-09 22:04:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 210 ms
[2023-03-09 22:04:43] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 0 ms to minimize.
[2023-03-09 22:04:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2023-03-09 22:04:43] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2023-03-09 22:04:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2023-03-09 22:04:43] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2023-03-09 22:04:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2023-03-09 22:04:44] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2023-03-09 22:04:44] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2023-03-09 22:04:44] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 0 ms to minimize.
[2023-03-09 22:04:44] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 0 ms to minimize.
[2023-03-09 22:04:44] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 274 ms
[2023-03-09 22:04:44] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2023-03-09 22:04:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2023-03-09 22:04:45] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 0 ms to minimize.
[2023-03-09 22:04:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2023-03-09 22:04:46] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2023-03-09 22:04:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2023-03-09 22:04:47] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2023-03-09 22:04:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2023-03-09 22:04:47] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2023-03-09 22:04:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2023-03-09 22:04:47] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2023-03-09 22:04:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2023-03-09 22:04:47] [INFO ] After 11475ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :131
Attempting to minimize the solution found.
Minimization took 6034 ms.
[2023-03-09 22:04:53] [INFO ] After 21525ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :131
Parikh walk visited 0 properties in 30652 ms.
Support contains 180 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Applied a total of 0 rules in 8 ms. Remains 255 /255 variables (removed 0) and now considering 248/248 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 255/255 places, 248/248 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Applied a total of 0 rules in 9 ms. Remains 255 /255 variables (removed 0) and now considering 248/248 (removed 0) transitions.
[2023-03-09 22:05:24] [INFO ] Invariant cache hit.
[2023-03-09 22:05:24] [INFO ] Implicit Places using invariants in 125 ms returned []
[2023-03-09 22:05:24] [INFO ] Invariant cache hit.
[2023-03-09 22:05:24] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 22:05:25] [INFO ] Implicit Places using invariants and state equation in 902 ms returned []
Implicit Place search using SMT with State Equation took 1034 ms to find 0 implicit places.
[2023-03-09 22:05:25] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-09 22:05:25] [INFO ] Invariant cache hit.
[2023-03-09 22:05:25] [INFO ] Dead Transitions using invariants and state equation in 352 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1425 ms. Remains : 255/255 places, 248/248 transitions.
Incomplete random walk after 100000 steps, including 14449 resets, run finished after 4992 ms. (steps per millisecond=20 ) properties (out of 180) seen :0
Running SMT prover for 180 properties.
[2023-03-09 22:05:30] [INFO ] Invariant cache hit.
[2023-03-09 22:05:31] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 22:05:31] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 28 ms returned sat
[2023-03-09 22:05:32] [INFO ] After 945ms SMT Verify possible using state equation in real domain returned unsat :0 sat :180
[2023-03-09 22:05:32] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 22:05:33] [INFO ] After 1370ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :180
[2023-03-09 22:05:34] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 1 ms to minimize.
[2023-03-09 22:05:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 147 ms
[2023-03-09 22:05:34] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2023-03-09 22:05:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2023-03-09 22:05:38] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 1 ms to minimize.
[2023-03-09 22:05:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2023-03-09 22:05:38] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2023-03-09 22:05:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2023-03-09 22:05:38] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 1 ms to minimize.
[2023-03-09 22:05:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 162 ms
[2023-03-09 22:05:39] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 1 ms to minimize.
[2023-03-09 22:05:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2023-03-09 22:05:41] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 2 ms to minimize.
[2023-03-09 22:05:41] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 1 ms to minimize.
[2023-03-09 22:05:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 250 ms
[2023-03-09 22:05:42] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 0 ms to minimize.
[2023-03-09 22:05:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2023-03-09 22:05:42] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2023-03-09 22:05:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2023-03-09 22:05:42] [INFO ] After 10803ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:180
[2023-03-09 22:05:42] [INFO ] After 12070ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:180
[2023-03-09 22:05:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 22:05:43] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 34 ms returned sat
[2023-03-09 22:05:44] [INFO ] After 1125ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :180
[2023-03-09 22:05:45] [INFO ] After 1187ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :180
[2023-03-09 22:05:45] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2023-03-09 22:05:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2023-03-09 22:05:45] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 1 ms to minimize.
[2023-03-09 22:05:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2023-03-09 22:05:46] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 1 ms to minimize.
[2023-03-09 22:05:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2023-03-09 22:05:46] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 0 ms to minimize.
[2023-03-09 22:05:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2023-03-09 22:05:47] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 1 ms to minimize.
[2023-03-09 22:05:47] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 1 ms to minimize.
[2023-03-09 22:05:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 231 ms
[2023-03-09 22:05:47] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
[2023-03-09 22:05:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2023-03-09 22:05:48] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 1 ms to minimize.
[2023-03-09 22:05:48] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 1 ms to minimize.
[2023-03-09 22:05:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 243 ms
[2023-03-09 22:05:48] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 1 ms to minimize.
[2023-03-09 22:05:48] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 0 ms to minimize.
[2023-03-09 22:05:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 206 ms
[2023-03-09 22:05:50] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 1 ms to minimize.
[2023-03-09 22:05:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 152 ms
[2023-03-09 22:05:51] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 1 ms to minimize.
[2023-03-09 22:05:51] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 0 ms to minimize.
[2023-03-09 22:05:51] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 1 ms to minimize.
[2023-03-09 22:05:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 384 ms
[2023-03-09 22:05:52] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 1 ms to minimize.
[2023-03-09 22:05:52] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 1 ms to minimize.
[2023-03-09 22:05:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 245 ms
[2023-03-09 22:05:52] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 0 ms to minimize.
[2023-03-09 22:05:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2023-03-09 22:05:53] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 0 ms to minimize.
[2023-03-09 22:05:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2023-03-09 22:05:54] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 2 ms to minimize.
[2023-03-09 22:05:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2023-03-09 22:05:55] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
[2023-03-09 22:05:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2023-03-09 22:05:55] [INFO ] After 10879ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :180
Attempting to minimize the solution found.
Minimization took 2176 ms.
[2023-03-09 22:05:57] [INFO ] After 14551ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :180
Interrupted random walk after 806552 steps, including 116438 resets, run timeout after 30001 ms. (steps per millisecond=26 ) properties seen 0
Incomplete Best-First random walk after 10000 steps, including 912 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 912 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 889 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 937 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 957 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 903 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 939 resets, run finished after 233 ms. (steps per millisecond=42 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 910 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 895 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 921 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 935 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 904 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 911 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 927 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 930 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 923 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 912 resets, run finished after 235 ms. (steps per millisecond=42 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 921 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 893 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 943 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 917 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 906 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 908 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 925 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 890 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 941 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 934 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 889 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 903 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 917 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 933 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 895 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 919 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 895 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 910 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 902 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 925 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 948 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 943 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 894 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 906 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 929 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 934 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 901 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 926 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 923 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 924 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 871 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10001 steps, including 922 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 131) seen :0
Incomplete Best-First random walk after 10000 steps, including 911 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 131) seen :0
Interrupted probabilistic random walk after 4912606 steps, run timeout after 123001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 4912606 steps, saw 2455999 distinct states, run finished after 123001 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 131 properties.
[2023-03-09 22:08:41] [INFO ] Invariant cache hit.
[2023-03-09 22:08:42] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-09 22:08:42] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 34 ms returned sat
[2023-03-09 22:08:47] [INFO ] After 3291ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:130
[2023-03-09 22:08:47] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 22:08:47] [INFO ] After 84ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:131
[2023-03-09 22:08:47] [INFO ] After 5338ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:131
[2023-03-09 22:08:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 22:08:48] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 22:08:51] [INFO ] After 2435ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :131
[2023-03-09 22:08:55] [INFO ] After 4081ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :131
[2023-03-09 22:08:55] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 1 ms to minimize.
[2023-03-09 22:08:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2023-03-09 22:08:55] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 0 ms to minimize.
[2023-03-09 22:08:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2023-03-09 22:08:56] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 0 ms to minimize.
[2023-03-09 22:08:56] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 1 ms to minimize.
[2023-03-09 22:08:56] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 0 ms to minimize.
[2023-03-09 22:08:56] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 1 ms to minimize.
[2023-03-09 22:08:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 437 ms
[2023-03-09 22:08:56] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2023-03-09 22:08:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2023-03-09 22:08:57] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 1 ms to minimize.
[2023-03-09 22:08:57] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 1 ms to minimize.
[2023-03-09 22:08:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 251 ms
[2023-03-09 22:08:57] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 1 ms to minimize.
[2023-03-09 22:08:58] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 1 ms to minimize.
[2023-03-09 22:08:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 298 ms
[2023-03-09 22:08:58] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 0 ms to minimize.
[2023-03-09 22:08:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2023-03-09 22:08:59] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2023-03-09 22:08:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2023-03-09 22:08:59] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2023-03-09 22:08:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2023-03-09 22:08:59] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 2 ms to minimize.
[2023-03-09 22:08:59] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2023-03-09 22:08:59] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 0 ms to minimize.
[2023-03-09 22:08:59] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 0 ms to minimize.
[2023-03-09 22:08:59] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 248 ms
[2023-03-09 22:08:59] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2023-03-09 22:08:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2023-03-09 22:09:00] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
[2023-03-09 22:09:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2023-03-09 22:09:02] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2023-03-09 22:09:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2023-03-09 22:09:02] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 0 ms to minimize.
[2023-03-09 22:09:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2023-03-09 22:09:02] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2023-03-09 22:09:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2023-03-09 22:09:02] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2023-03-09 22:09:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2023-03-09 22:09:02] [INFO ] After 11514ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :131
Attempting to minimize the solution found.
Minimization took 4865 ms.
[2023-03-09 22:09:07] [INFO ] After 20489ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :131
Parikh walk visited 0 properties in 30059 ms.
Support contains 180 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Applied a total of 0 rules in 9 ms. Remains 255 /255 variables (removed 0) and now considering 248/248 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 255/255 places, 248/248 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Applied a total of 0 rules in 7 ms. Remains 255 /255 variables (removed 0) and now considering 248/248 (removed 0) transitions.
[2023-03-09 22:09:37] [INFO ] Invariant cache hit.
[2023-03-09 22:09:37] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-03-09 22:09:37] [INFO ] Invariant cache hit.
[2023-03-09 22:09:38] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 22:09:38] [INFO ] Implicit Places using invariants and state equation in 497 ms returned []
Implicit Place search using SMT with State Equation took 630 ms to find 0 implicit places.
[2023-03-09 22:09:38] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-09 22:09:38] [INFO ] Invariant cache hit.
[2023-03-09 22:09:38] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 843 ms. Remains : 255/255 places, 248/248 transitions.
Incomplete random walk after 100000 steps, including 14553 resets, run finished after 4535 ms. (steps per millisecond=22 ) properties (out of 180) seen :0
Running SMT prover for 180 properties.
[2023-03-09 22:09:43] [INFO ] Invariant cache hit.
[2023-03-09 22:09:43] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 22:09:43] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 22:09:44] [INFO ] After 712ms SMT Verify possible using state equation in real domain returned unsat :0 sat :180
[2023-03-09 22:09:44] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 22:09:45] [INFO ] After 1092ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :180
[2023-03-09 22:09:45] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2023-03-09 22:09:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2023-03-09 22:09:46] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2023-03-09 22:09:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2023-03-09 22:09:48] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2023-03-09 22:09:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2023-03-09 22:09:48] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2023-03-09 22:09:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2023-03-09 22:09:48] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2023-03-09 22:09:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2023-03-09 22:09:48] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2023-03-09 22:09:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2023-03-09 22:09:50] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 0 ms to minimize.
[2023-03-09 22:09:50] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2023-03-09 22:09:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 154 ms
[2023-03-09 22:09:50] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 0 ms to minimize.
[2023-03-09 22:09:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2023-03-09 22:09:51] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2023-03-09 22:09:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2023-03-09 22:09:51] [INFO ] After 7102ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:180
[2023-03-09 22:09:51] [INFO ] After 8035ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:180
[2023-03-09 22:09:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 22:09:51] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 22:09:52] [INFO ] After 780ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :180
[2023-03-09 22:09:53] [INFO ] After 1220ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :180
[2023-03-09 22:09:53] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2023-03-09 22:09:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2023-03-09 22:09:53] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2023-03-09 22:09:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2023-03-09 22:09:53] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 0 ms to minimize.
[2023-03-09 22:09:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2023-03-09 22:09:54] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2023-03-09 22:09:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2023-03-09 22:09:54] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2023-03-09 22:09:54] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 0 ms to minimize.
[2023-03-09 22:09:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 145 ms
[2023-03-09 22:09:54] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2023-03-09 22:09:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2023-03-09 22:09:55] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 0 ms to minimize.
[2023-03-09 22:09:55] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2023-03-09 22:09:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 172 ms
[2023-03-09 22:09:55] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2023-03-09 22:09:55] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 0 ms to minimize.
[2023-03-09 22:09:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 147 ms
[2023-03-09 22:09:56] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 0 ms to minimize.
[2023-03-09 22:09:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2023-03-09 22:09:57] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 0 ms to minimize.
[2023-03-09 22:09:57] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 1 ms to minimize.
[2023-03-09 22:09:57] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2023-03-09 22:09:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 262 ms
[2023-03-09 22:09:57] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 0 ms to minimize.
[2023-03-09 22:09:57] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 0 ms to minimize.
[2023-03-09 22:09:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 158 ms
[2023-03-09 22:09:58] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2023-03-09 22:09:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2023-03-09 22:09:58] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 0 ms to minimize.
[2023-03-09 22:09:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2023-03-09 22:09:59] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 0 ms to minimize.
[2023-03-09 22:09:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2023-03-09 22:09:59] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 0 ms to minimize.
[2023-03-09 22:09:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2023-03-09 22:09:59] [INFO ] After 7552ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :180
Attempting to minimize the solution found.
Minimization took 1759 ms.
[2023-03-09 22:10:01] [INFO ] After 10311ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :180
Incomplete random walk after 10000 steps, including 1417 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 947 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 634384 steps, run timeout after 3001 ms. (steps per millisecond=211 ) properties seen :{}
Probabilistic random walk after 634384 steps, saw 317263 distinct states, run finished after 3001 ms. (steps per millisecond=211 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 22:10:04] [INFO ] Invariant cache hit.
[2023-03-09 22:10:04] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 22:10:04] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 22:10:04] [INFO ] After 175ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:10:04] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 22:10:04] [INFO ] After 89ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:10:04] [INFO ] After 345ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:10:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 22:10:05] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 29 ms returned sat
[2023-03-09 22:10:05] [INFO ] After 236ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:10:05] [INFO ] After 149ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:10:05] [INFO ] After 179ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-09 22:10:05] [INFO ] After 547ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 26 times.
Iterating global reduction 1 with 26 rules applied. Total rules applied 28 place count 254 transition count 221
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 54 place count 228 transition count 221
Partial Free-agglomeration rule applied 30 times.
Drop transitions removed 30 transitions
Iterating global reduction 2 with 30 rules applied. Total rules applied 84 place count 228 transition count 221
Applied a total of 84 rules in 63 ms. Remains 228 /255 variables (removed 27) and now considering 221/248 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 228/255 places, 221/248 transitions.
Incomplete random walk after 10000 steps, including 1488 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 914 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 653427 steps, run timeout after 3001 ms. (steps per millisecond=217 ) properties seen :{}
Probabilistic random walk after 653427 steps, saw 326781 distinct states, run finished after 3006 ms. (steps per millisecond=217 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 221 rows 228 cols
[2023-03-09 22:10:08] [INFO ] Computed 44 place invariants in 11 ms
[2023-03-09 22:10:08] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 22:10:08] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 23 ms returned sat
[2023-03-09 22:10:08] [INFO ] After 124ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:10:08] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:10:08] [INFO ] After 61ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:10:08] [INFO ] After 265ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:10:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-09 22:10:08] [INFO ] [Nat]Absence check using 3 positive and 41 generalized place invariants in 23 ms returned sat
[2023-03-09 22:10:09] [INFO ] After 124ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:10:09] [INFO ] After 45ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:10:09] [INFO ] After 65ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 22:10:09] [INFO ] After 280ms 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 228 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 228/228 places, 221/221 transitions.
Applied a total of 0 rules in 9 ms. Remains 228 /228 variables (removed 0) and now considering 221/221 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 228/228 places, 221/221 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 228/228 places, 221/221 transitions.
Applied a total of 0 rules in 9 ms. Remains 228 /228 variables (removed 0) and now considering 221/221 (removed 0) transitions.
[2023-03-09 22:10:09] [INFO ] Invariant cache hit.
[2023-03-09 22:10:09] [INFO ] Implicit Places using invariants in 381 ms returned [25, 46, 51, 73, 78, 98, 104, 125, 130, 150, 155, 176, 182]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 382 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 215/228 places, 221/221 transitions.
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 215 transition count 214
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 208 transition count 214
Applied a total of 14 rules in 20 ms. Remains 208 /215 variables (removed 7) and now considering 214/221 (removed 7) transitions.
// Phase 1: matrix 214 rows 208 cols
[2023-03-09 22:10:09] [INFO ] Computed 31 place invariants in 12 ms
[2023-03-09 22:10:09] [INFO ] Implicit Places using invariants in 271 ms returned []
[2023-03-09 22:10:09] [INFO ] Invariant cache hit.
[2023-03-09 22:10:09] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:10:11] [INFO ] Implicit Places using invariants and state equation in 1914 ms returned []
Implicit Place search using SMT with State Equation took 2187 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 208/228 places, 214/221 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2599 ms. Remains : 208/228 places, 214/221 transitions.
Incomplete random walk after 10000 steps, including 1420 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 906 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 677194 steps, run timeout after 3001 ms. (steps per millisecond=225 ) properties seen :{}
Probabilistic random walk after 677194 steps, saw 338671 distinct states, run finished after 3004 ms. (steps per millisecond=225 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 22:10:14] [INFO ] Invariant cache hit.
[2023-03-09 22:10:14] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 22:10:14] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 22:10:14] [INFO ] After 113ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:10:14] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:10:14] [INFO ] After 37ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:10:14] [INFO ] After 224ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:10:15] [INFO ] [Nat]Absence check using 13 positive place invariants in 17 ms returned sat
[2023-03-09 22:10:15] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 22:10:15] [INFO ] After 109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:10:15] [INFO ] After 30ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:10:15] [INFO ] After 48ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-09 22:10:15] [INFO ] After 241ms 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 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 6 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 208/208 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 5 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-09 22:10:15] [INFO ] Invariant cache hit.
[2023-03-09 22:10:15] [INFO ] Implicit Places using invariants in 376 ms returned []
[2023-03-09 22:10:15] [INFO ] Invariant cache hit.
[2023-03-09 22:10:15] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:10:17] [INFO ] Implicit Places using invariants and state equation in 1808 ms returned []
Implicit Place search using SMT with State Equation took 2186 ms to find 0 implicit places.
[2023-03-09 22:10:17] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-09 22:10:17] [INFO ] Invariant cache hit.
[2023-03-09 22:10:17] [INFO ] Dead Transitions using invariants and state equation in 232 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2438 ms. Remains : 208/208 places, 214/214 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 208 transition count 196
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 190 transition count 196
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 181 transition count 187
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 181 transition count 187
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 180 transition count 186
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 180 transition count 184
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 178 transition count 184
Applied a total of 60 rules in 34 ms. Remains 178 /208 variables (removed 30) and now considering 184/214 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 184 rows 178 cols
[2023-03-09 22:10:17] [INFO ] Computed 31 place invariants in 10 ms
[2023-03-09 22:10:17] [INFO ] [Real]Absence check using 13 positive place invariants in 13 ms returned sat
[2023-03-09 22:10:17] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 22:10:17] [INFO ] After 122ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:10:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 22:10:17] [INFO ] After 14ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:10:17] [INFO ] After 204ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:10:17] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-03-09 22:10:17] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 22:10:18] [INFO ] After 120ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:10:18] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:10:18] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 0 ms to minimize.
[2023-03-09 22:10:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2023-03-09 22:10:18] [INFO ] After 111ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-09 22:10:18] [INFO ] After 309ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1462 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 911 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 617125 steps, run timeout after 3001 ms. (steps per millisecond=205 ) properties seen :{}
Probabilistic random walk after 617125 steps, saw 308633 distinct states, run finished after 3001 ms. (steps per millisecond=205 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 22:10:21] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 22:10:21] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 22:10:21] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 22:10:21] [INFO ] After 187ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:10:21] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 22:10:21] [INFO ] After 30ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:10:21] [INFO ] After 302ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:10:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 22:10:21] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 22:10:21] [INFO ] After 184ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:10:21] [INFO ] After 29ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:10:21] [INFO ] After 50ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 22:10:21] [INFO ] After 331ms 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 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 27 times.
Iterating global reduction 1 with 27 rules applied. Total rules applied 29 place count 254 transition count 220
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 56 place count 227 transition count 220
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 84 place count 227 transition count 220
Applied a total of 84 rules in 27 ms. Remains 227 /255 variables (removed 28) and now considering 220/248 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 227/255 places, 220/248 transitions.
Incomplete random walk after 10000 steps, including 1439 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 896 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 644442 steps, run timeout after 3001 ms. (steps per millisecond=214 ) properties seen :{}
Probabilistic random walk after 644442 steps, saw 322289 distinct states, run finished after 3001 ms. (steps per millisecond=214 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 220 rows 227 cols
[2023-03-09 22:10:24] [INFO ] Computed 44 place invariants in 8 ms
[2023-03-09 22:10:25] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 22:10:25] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 25 ms returned sat
[2023-03-09 22:10:25] [INFO ] After 150ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:10:25] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:10:25] [INFO ] After 35ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:10:25] [INFO ] After 270ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:10:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 22:10:25] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 26 ms returned sat
[2023-03-09 22:10:25] [INFO ] After 145ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:10:25] [INFO ] After 123ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:10:25] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 0 ms to minimize.
[2023-03-09 22:10:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2023-03-09 22:10:25] [INFO ] After 261ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 22:10:25] [INFO ] After 501ms 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 227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 5 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 227/227 places, 220/220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 5 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
[2023-03-09 22:10:25] [INFO ] Invariant cache hit.
[2023-03-09 22:10:26] [INFO ] Implicit Places using invariants in 524 ms returned [25, 46, 51, 72, 77, 97, 103, 124, 129, 149, 154, 175, 181]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 529 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 214/227 places, 220/220 transitions.
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 214 transition count 214
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 208 transition count 214
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 208 transition count 214
Applied a total of 14 rules in 15 ms. Remains 208 /214 variables (removed 6) and now considering 214/220 (removed 6) transitions.
// Phase 1: matrix 214 rows 208 cols
[2023-03-09 22:10:26] [INFO ] Computed 31 place invariants in 11 ms
[2023-03-09 22:10:26] [INFO ] Implicit Places using invariants in 294 ms returned []
[2023-03-09 22:10:26] [INFO ] Invariant cache hit.
[2023-03-09 22:10:26] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:10:28] [INFO ] Implicit Places using invariants and state equation in 1755 ms returned []
Implicit Place search using SMT with State Equation took 2051 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 208/227 places, 214/220 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2602 ms. Remains : 208/227 places, 214/220 transitions.
Incomplete random walk after 10000 steps, including 1445 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 914 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 642763 steps, run timeout after 3001 ms. (steps per millisecond=214 ) properties seen :{}
Probabilistic random walk after 642763 steps, saw 321458 distinct states, run finished after 3001 ms. (steps per millisecond=214 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 22:10:31] [INFO ] Invariant cache hit.
[2023-03-09 22:10:31] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 22:10:31] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 22:10:31] [INFO ] After 146ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:10:31] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:10:31] [INFO ] After 174ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:10:31] [INFO ] After 394ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:10:31] [INFO ] [Nat]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 22:10:31] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 22:10:31] [INFO ] After 140ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:10:32] [INFO ] After 174ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:10:32] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 0 ms to minimize.
[2023-03-09 22:10:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2023-03-09 22:10:32] [INFO ] After 290ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-09 22:10:32] [INFO ] After 520ms 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 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 4 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 208/208 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 4 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-09 22:10:32] [INFO ] Invariant cache hit.
[2023-03-09 22:10:32] [INFO ] Implicit Places using invariants in 290 ms returned []
[2023-03-09 22:10:32] [INFO ] Invariant cache hit.
[2023-03-09 22:10:32] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:10:34] [INFO ] Implicit Places using invariants and state equation in 1583 ms returned []
Implicit Place search using SMT with State Equation took 1875 ms to find 0 implicit places.
[2023-03-09 22:10:34] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-09 22:10:34] [INFO ] Invariant cache hit.
[2023-03-09 22:10:34] [INFO ] Dead Transitions using invariants and state equation in 241 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2132 ms. Remains : 208/208 places, 214/214 transitions.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 208 transition count 197
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 191 transition count 197
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 182 transition count 188
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 182 transition count 188
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 181 transition count 187
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 181 transition count 185
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 179 transition count 185
Applied a total of 58 rules in 18 ms. Remains 179 /208 variables (removed 29) and now considering 185/214 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 185 rows 179 cols
[2023-03-09 22:10:34] [INFO ] Computed 31 place invariants in 9 ms
[2023-03-09 22:10:34] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-09 22:10:34] [INFO ] [Real]Absence check using 5 positive and 26 generalized place invariants in 12 ms returned sat
[2023-03-09 22:10:34] [INFO ] After 120ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:10:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 22:10:34] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 22:10:34] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 1 ms to minimize.
[2023-03-09 22:10:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2023-03-09 22:10:34] [INFO ] After 144ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:10:34] [INFO ] After 329ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:10:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-09 22:10:34] [INFO ] [Nat]Absence check using 5 positive and 26 generalized place invariants in 17 ms returned sat
[2023-03-09 22:10:35] [INFO ] After 175ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:10:35] [INFO ] After 13ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:10:35] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 1 ms to minimize.
[2023-03-09 22:10:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 143 ms
[2023-03-09 22:10:35] [INFO ] After 165ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-09 22:10:35] [INFO ] After 440ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1453 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 926 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 608793 steps, run timeout after 3001 ms. (steps per millisecond=202 ) properties seen :{}
Probabilistic random walk after 608793 steps, saw 304460 distinct states, run finished after 3001 ms. (steps per millisecond=202 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 22:10:38] [INFO ] Computed 44 place invariants in 10 ms
[2023-03-09 22:10:38] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 22:10:38] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 23 ms returned sat
[2023-03-09 22:10:38] [INFO ] After 190ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:10:38] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 22:10:38] [INFO ] After 28ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 22:10:38] [INFO ] After 51ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 22:10:38] [INFO ] After 344ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 25 times.
Iterating global reduction 1 with 25 rules applied. Total rules applied 27 place count 254 transition count 222
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 52 place count 229 transition count 222
Partial Free-agglomeration rule applied 29 times.
Drop transitions removed 29 transitions
Iterating global reduction 2 with 29 rules applied. Total rules applied 81 place count 229 transition count 222
Applied a total of 81 rules in 21 ms. Remains 229 /255 variables (removed 26) and now considering 222/248 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 229/255 places, 222/248 transitions.
Incomplete random walk after 10000 steps, including 1467 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 902 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 643376 steps, run timeout after 3001 ms. (steps per millisecond=214 ) properties seen :{}
Probabilistic random walk after 643376 steps, saw 321763 distinct states, run finished after 3001 ms. (steps per millisecond=214 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 222 rows 229 cols
[2023-03-09 22:10:41] [INFO ] Computed 44 place invariants in 13 ms
[2023-03-09 22:10:41] [INFO ] [Real]Absence check using 20 positive place invariants in 28 ms returned sat
[2023-03-09 22:10:41] [INFO ] [Real]Absence check using 20 positive and 24 generalized place invariants in 7 ms returned sat
[2023-03-09 22:10:41] [INFO ] After 127ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:10:41] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:10:42] [INFO ] After 153ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:10:42] [INFO ] After 373ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:10:42] [INFO ] [Nat]Absence check using 20 positive place invariants in 28 ms returned sat
[2023-03-09 22:10:42] [INFO ] [Nat]Absence check using 20 positive and 24 generalized place invariants in 8 ms returned sat
[2023-03-09 22:10:42] [INFO ] After 122ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:10:42] [INFO ] After 114ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:10:42] [INFO ] After 135ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-09 22:10:42] [INFO ] After 362ms 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 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 222/222 transitions.
Applied a total of 0 rules in 4 ms. Remains 229 /229 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 229/229 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 222/222 transitions.
Applied a total of 0 rules in 4 ms. Remains 229 /229 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2023-03-09 22:10:42] [INFO ] Invariant cache hit.
[2023-03-09 22:10:42] [INFO ] Implicit Places using invariants in 390 ms returned [25, 45, 73, 78, 99, 105, 126, 131, 151, 156, 177, 183]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 391 ms to find 12 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 217/229 places, 222/222 transitions.
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 217 transition count 216
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 211 transition count 216
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 211 transition count 216
Applied a total of 13 rules in 16 ms. Remains 211 /217 variables (removed 6) and now considering 216/222 (removed 6) transitions.
// Phase 1: matrix 216 rows 211 cols
[2023-03-09 22:10:42] [INFO ] Computed 32 place invariants in 12 ms
[2023-03-09 22:10:43] [INFO ] Implicit Places using invariants in 247 ms returned []
[2023-03-09 22:10:43] [INFO ] Invariant cache hit.
[2023-03-09 22:10:43] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:10:44] [INFO ] Implicit Places using invariants and state equation in 1658 ms returned []
Implicit Place search using SMT with State Equation took 1906 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 211/229 places, 216/222 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2319 ms. Remains : 211/229 places, 216/222 transitions.
Incomplete random walk after 10000 steps, including 1473 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 914 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 650385 steps, run timeout after 3001 ms. (steps per millisecond=216 ) properties seen :{}
Probabilistic random walk after 650385 steps, saw 325263 distinct states, run finished after 3001 ms. (steps per millisecond=216 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 22:10:47] [INFO ] Invariant cache hit.
[2023-03-09 22:10:47] [INFO ] [Real]Absence check using 14 positive place invariants in 20 ms returned sat
[2023-03-09 22:10:47] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 22:10:47] [INFO ] After 138ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:10:47] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:10:48] [INFO ] After 58ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 22:10:48] [INFO ] After 78ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-09 22:10:48] [INFO ] After 309ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 211 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 216/216 transitions.
Applied a total of 0 rules in 5 ms. Remains 211 /211 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 211/211 places, 216/216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 216/216 transitions.
Applied a total of 0 rules in 6 ms. Remains 211 /211 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2023-03-09 22:10:48] [INFO ] Invariant cache hit.
[2023-03-09 22:10:48] [INFO ] Implicit Places using invariants in 262 ms returned []
[2023-03-09 22:10:48] [INFO ] Invariant cache hit.
[2023-03-09 22:10:48] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:10:49] [INFO ] Implicit Places using invariants and state equation in 1621 ms returned []
Implicit Place search using SMT with State Equation took 1884 ms to find 0 implicit places.
[2023-03-09 22:10:49] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 22:10:49] [INFO ] Invariant cache hit.
[2023-03-09 22:10:50] [INFO ] Dead Transitions using invariants and state equation in 228 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2124 ms. Remains : 211/211 places, 216/216 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 211 transition count 198
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 193 transition count 198
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 185 transition count 190
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 185 transition count 190
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 184 transition count 189
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 184 transition count 187
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 182 transition count 187
Applied a total of 58 rules in 21 ms. Remains 182 /211 variables (removed 29) and now considering 187/216 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 187 rows 182 cols
[2023-03-09 22:10:50] [INFO ] Computed 32 place invariants in 6 ms
[2023-03-09 22:10:50] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2023-03-09 22:10:50] [INFO ] [Real]Absence check using 7 positive and 25 generalized place invariants in 13 ms returned sat
[2023-03-09 22:10:50] [INFO ] After 170ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:10:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 22:10:50] [INFO ] After 13ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 22:10:50] [INFO ] After 34ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-09 22:10:50] [INFO ] After 293ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1442 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 893 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 615841 steps, run timeout after 3001 ms. (steps per millisecond=205 ) properties seen :{}
Probabilistic random walk after 615841 steps, saw 307993 distinct states, run finished after 3001 ms. (steps per millisecond=205 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 22:10:53] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 22:10:53] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 22:10:53] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 22:10:53] [INFO ] After 162ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:10:53] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 22:10:53] [INFO ] After 62ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 22:10:53] [INFO ] After 85ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 22:10:53] [INFO ] After 343ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 27 times.
Iterating global reduction 1 with 27 rules applied. Total rules applied 29 place count 254 transition count 220
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 56 place count 227 transition count 220
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 84 place count 227 transition count 220
Applied a total of 84 rules in 18 ms. Remains 227 /255 variables (removed 28) and now considering 220/248 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 227/255 places, 220/248 transitions.
Incomplete random walk after 10000 steps, including 1459 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 913 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 635528 steps, run timeout after 3001 ms. (steps per millisecond=211 ) properties seen :{}
Probabilistic random walk after 635528 steps, saw 317836 distinct states, run finished after 3001 ms. (steps per millisecond=211 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 220 rows 227 cols
[2023-03-09 22:10:56] [INFO ] Computed 44 place invariants in 8 ms
[2023-03-09 22:10:57] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 22:10:57] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 24 ms returned sat
[2023-03-09 22:10:57] [INFO ] After 154ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:10:57] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:10:57] [INFO ] After 46ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:10:57] [INFO ] After 280ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:10:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 22:10:57] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 25 ms returned sat
[2023-03-09 22:10:57] [INFO ] After 157ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:10:57] [INFO ] After 48ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:10:57] [INFO ] After 70ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 22:10:57] [INFO ] After 324ms 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 227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 5 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 227/227 places, 220/220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 4 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
[2023-03-09 22:10:57] [INFO ] Invariant cache hit.
[2023-03-09 22:10:58] [INFO ] Implicit Places using invariants in 524 ms returned [25, 51, 72, 77, 97, 103, 124, 129, 149, 154, 175, 181]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 526 ms to find 12 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 215/227 places, 220/220 transitions.
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 215 transition count 214
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 209 transition count 214
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 209 transition count 214
Applied a total of 13 rules in 12 ms. Remains 209 /215 variables (removed 6) and now considering 214/220 (removed 6) transitions.
// Phase 1: matrix 214 rows 209 cols
[2023-03-09 22:10:58] [INFO ] Computed 32 place invariants in 10 ms
[2023-03-09 22:10:58] [INFO ] Implicit Places using invariants in 340 ms returned []
[2023-03-09 22:10:58] [INFO ] Invariant cache hit.
[2023-03-09 22:10:58] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:11:00] [INFO ] Implicit Places using invariants and state equation in 1947 ms returned []
Implicit Place search using SMT with State Equation took 2289 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 209/227 places, 214/220 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2833 ms. Remains : 209/227 places, 214/220 transitions.
Incomplete random walk after 10000 steps, including 1464 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 895 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 642934 steps, run timeout after 3001 ms. (steps per millisecond=214 ) properties seen :{}
Probabilistic random walk after 642934 steps, saw 321544 distinct states, run finished after 3001 ms. (steps per millisecond=214 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 22:11:03] [INFO ] Invariant cache hit.
[2023-03-09 22:11:03] [INFO ] [Real]Absence check using 14 positive place invariants in 19 ms returned sat
[2023-03-09 22:11:03] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 4 ms returned sat
[2023-03-09 22:11:03] [INFO ] After 138ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:11:03] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:11:03] [INFO ] After 291ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 22:11:03] [INFO ] After 312ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-09 22:11:03] [INFO ] After 542ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 214/214 transitions.
Applied a total of 0 rules in 4 ms. Remains 209 /209 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 209/209 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 214/214 transitions.
Applied a total of 0 rules in 5 ms. Remains 209 /209 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-09 22:11:03] [INFO ] Invariant cache hit.
[2023-03-09 22:11:04] [INFO ] Implicit Places using invariants in 279 ms returned []
[2023-03-09 22:11:04] [INFO ] Invariant cache hit.
[2023-03-09 22:11:04] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:11:06] [INFO ] Implicit Places using invariants and state equation in 1839 ms returned []
Implicit Place search using SMT with State Equation took 2120 ms to find 0 implicit places.
[2023-03-09 22:11:06] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 22:11:06] [INFO ] Invariant cache hit.
[2023-03-09 22:11:06] [INFO ] Dead Transitions using invariants and state equation in 230 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2362 ms. Remains : 209/209 places, 214/214 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 209 transition count 196
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 191 transition count 196
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 183 transition count 188
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 183 transition count 188
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 182 transition count 187
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 182 transition count 185
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 180 transition count 185
Applied a total of 58 rules in 18 ms. Remains 180 /209 variables (removed 29) and now considering 185/214 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 185 rows 180 cols
[2023-03-09 22:11:06] [INFO ] Computed 32 place invariants in 11 ms
[2023-03-09 22:11:06] [INFO ] [Real]Absence check using 14 positive place invariants in 14 ms returned sat
[2023-03-09 22:11:06] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 22:11:06] [INFO ] After 157ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:11:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 22:11:06] [INFO ] After 9ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 22:11:06] [INFO ] After 25ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-09 22:11:06] [INFO ] After 270ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1461 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 894 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 631489 steps, run timeout after 3001 ms. (steps per millisecond=210 ) properties seen :{}
Probabilistic random walk after 631489 steps, saw 315819 distinct states, run finished after 3004 ms. (steps per millisecond=210 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 22:11:09] [INFO ] Computed 44 place invariants in 10 ms
[2023-03-09 22:11:09] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 22:11:09] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 23 ms returned sat
[2023-03-09 22:11:10] [INFO ] After 210ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:11:10] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 22:11:10] [INFO ] After 35ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:11:10] [INFO ] After 333ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:11:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 22:11:10] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 22:11:10] [INFO ] After 201ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:11:10] [INFO ] After 43ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:11:10] [INFO ] After 64ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 22:11:10] [INFO ] After 370ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 25 times.
Iterating global reduction 1 with 25 rules applied. Total rules applied 27 place count 254 transition count 222
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 52 place count 229 transition count 222
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 80 place count 229 transition count 222
Applied a total of 80 rules in 16 ms. Remains 229 /255 variables (removed 26) and now considering 222/248 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 229/255 places, 222/248 transitions.
Incomplete random walk after 10000 steps, including 1435 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 906 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 642700 steps, run timeout after 3001 ms. (steps per millisecond=214 ) properties seen :{}
Probabilistic random walk after 642700 steps, saw 321426 distinct states, run finished after 3004 ms. (steps per millisecond=213 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 222 rows 229 cols
[2023-03-09 22:11:13] [INFO ] Computed 44 place invariants in 17 ms
[2023-03-09 22:11:13] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 22:11:13] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 36 ms returned sat
[2023-03-09 22:11:13] [INFO ] After 152ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:11:13] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:11:13] [INFO ] After 212ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 22:11:13] [INFO ] After 234ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 22:11:13] [INFO ] After 493ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 222/222 transitions.
Applied a total of 0 rules in 4 ms. Remains 229 /229 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 229/229 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 222/222 transitions.
Applied a total of 0 rules in 4 ms. Remains 229 /229 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2023-03-09 22:11:13] [INFO ] Invariant cache hit.
[2023-03-09 22:11:14] [INFO ] Implicit Places using invariants in 424 ms returned [25, 74, 79, 99, 105, 126, 131, 151, 156, 177, 183]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 425 ms to find 11 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 218/229 places, 222/222 transitions.
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 218 transition count 216
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 212 transition count 216
Applied a total of 12 rules in 8 ms. Remains 212 /218 variables (removed 6) and now considering 216/222 (removed 6) transitions.
// Phase 1: matrix 216 rows 212 cols
[2023-03-09 22:11:14] [INFO ] Computed 33 place invariants in 12 ms
[2023-03-09 22:11:14] [INFO ] Implicit Places using invariants in 245 ms returned []
[2023-03-09 22:11:14] [INFO ] Invariant cache hit.
[2023-03-09 22:11:14] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:11:16] [INFO ] Implicit Places using invariants and state equation in 2003 ms returned []
Implicit Place search using SMT with State Equation took 2253 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 212/229 places, 216/222 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2694 ms. Remains : 212/229 places, 216/222 transitions.
Incomplete random walk after 10000 steps, including 1436 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 917 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 651825 steps, run timeout after 3001 ms. (steps per millisecond=217 ) properties seen :{}
Probabilistic random walk after 651825 steps, saw 325987 distinct states, run finished after 3004 ms. (steps per millisecond=216 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 22:11:19] [INFO ] Invariant cache hit.
[2023-03-09 22:11:19] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2023-03-09 22:11:19] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 13 ms returned sat
[2023-03-09 22:11:19] [INFO ] After 147ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:11:19] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:11:19] [INFO ] After 38ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:11:19] [INFO ] After 257ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:11:20] [INFO ] [Nat]Absence check using 4 positive place invariants in 6 ms returned sat
[2023-03-09 22:11:20] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 12 ms returned sat
[2023-03-09 22:11:20] [INFO ] After 144ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:11:20] [INFO ] After 38ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:11:20] [INFO ] After 57ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-09 22:11:20] [INFO ] After 285ms 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 212 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 216/216 transitions.
Applied a total of 0 rules in 4 ms. Remains 212 /212 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 212/212 places, 216/216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 212 /212 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2023-03-09 22:11:20] [INFO ] Invariant cache hit.
[2023-03-09 22:11:20] [INFO ] Implicit Places using invariants in 285 ms returned []
[2023-03-09 22:11:20] [INFO ] Invariant cache hit.
[2023-03-09 22:11:20] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:11:22] [INFO ] Implicit Places using invariants and state equation in 1911 ms returned []
Implicit Place search using SMT with State Equation took 2198 ms to find 0 implicit places.
[2023-03-09 22:11:22] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 22:11:22] [INFO ] Invariant cache hit.
[2023-03-09 22:11:22] [INFO ] Dead Transitions using invariants and state equation in 233 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2442 ms. Remains : 212/212 places, 216/216 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 212 transition count 198
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 194 transition count 198
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 186 transition count 190
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 186 transition count 190
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 185 transition count 189
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 185 transition count 187
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 183 transition count 187
Applied a total of 58 rules in 16 ms. Remains 183 /212 variables (removed 29) and now considering 187/216 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 187 rows 183 cols
[2023-03-09 22:11:22] [INFO ] Computed 33 place invariants in 14 ms
[2023-03-09 22:11:22] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2023-03-09 22:11:22] [INFO ] [Real]Absence check using 8 positive and 25 generalized place invariants in 11 ms returned sat
[2023-03-09 22:11:22] [INFO ] After 149ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:11:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 22:11:22] [INFO ] After 11ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 22:11:23] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 0 ms to minimize.
[2023-03-09 22:11:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2023-03-09 22:11:23] [INFO ] After 120ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:11:23] [INFO ] After 347ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:11:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2023-03-09 22:11:23] [INFO ] [Nat]Absence check using 8 positive and 25 generalized place invariants in 12 ms returned sat
[2023-03-09 22:11:23] [INFO ] After 150ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:11:23] [INFO ] After 9ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:11:23] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 0 ms to minimize.
[2023-03-09 22:11:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2023-03-09 22:11:23] [INFO ] After 106ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-09 22:11:23] [INFO ] After 335ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1456 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 898 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2031 steps, run visited all 1 properties in 12 ms. (steps per millisecond=169 )
Probabilistic random walk after 2031 steps, saw 1030 distinct states, run finished after 13 ms. (steps per millisecond=156 ) properties seen :1
Incomplete random walk after 10000 steps, including 1432 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 915 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 617538 steps, run timeout after 3001 ms. (steps per millisecond=205 ) properties seen :{}
Probabilistic random walk after 617538 steps, saw 308841 distinct states, run finished after 3001 ms. (steps per millisecond=205 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 22:11:26] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 22:11:26] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 22:11:26] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 22:11:26] [INFO ] After 191ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:11:26] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 22:11:26] [INFO ] After 32ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:11:26] [INFO ] After 305ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:11:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 22:11:26] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 22:11:27] [INFO ] After 191ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:11:27] [INFO ] After 36ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:11:27] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 1 ms to minimize.
[2023-03-09 22:11:27] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 0 ms to minimize.
[2023-03-09 22:11:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 215 ms
[2023-03-09 22:11:27] [INFO ] After 344ms 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-03-09 22:11:27] [INFO ] After 638ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 28 times.
Iterating global reduction 1 with 28 rules applied. Total rules applied 30 place count 254 transition count 219
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 58 place count 226 transition count 219
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 86 place count 226 transition count 219
Applied a total of 86 rules in 17 ms. Remains 226 /255 variables (removed 29) and now considering 219/248 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 226/255 places, 219/248 transitions.
Incomplete random walk after 10000 steps, including 1484 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 918 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 648497 steps, run timeout after 3001 ms. (steps per millisecond=216 ) properties seen :{}
Probabilistic random walk after 648497 steps, saw 324319 distinct states, run finished after 3001 ms. (steps per millisecond=216 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 219 rows 226 cols
[2023-03-09 22:11:30] [INFO ] Computed 44 place invariants in 13 ms
[2023-03-09 22:11:30] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 22:11:30] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 25 ms returned sat
[2023-03-09 22:11:30] [INFO ] After 160ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:11:30] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:11:30] [INFO ] After 48ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 22:11:30] [INFO ] After 77ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:11:30] [INFO ] After 320ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:11:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 22:11:30] [INFO ] [Nat]Absence check using 3 positive and 41 generalized place invariants in 25 ms returned sat
[2023-03-09 22:11:31] [INFO ] After 156ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:11:31] [INFO ] After 58ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:11:31] [INFO ] After 82ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 22:11:31] [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 226 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 4 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 226/226 places, 219/219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 3 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2023-03-09 22:11:31] [INFO ] Invariant cache hit.
[2023-03-09 22:11:31] [INFO ] Implicit Places using invariants in 519 ms returned [25, 45, 50, 71, 76, 96, 102, 123, 128, 148, 153, 174, 180]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 520 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 213/226 places, 219/219 transitions.
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 213 transition count 212
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 206 transition count 212
Applied a total of 14 rules in 12 ms. Remains 206 /213 variables (removed 7) and now considering 212/219 (removed 7) transitions.
// Phase 1: matrix 212 rows 206 cols
[2023-03-09 22:11:31] [INFO ] Computed 31 place invariants in 11 ms
[2023-03-09 22:11:31] [INFO ] Implicit Places using invariants in 310 ms returned []
[2023-03-09 22:11:31] [INFO ] Invariant cache hit.
[2023-03-09 22:11:32] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:11:33] [INFO ] Implicit Places using invariants and state equation in 1981 ms returned []
Implicit Place search using SMT with State Equation took 2293 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 206/226 places, 212/219 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2828 ms. Remains : 206/226 places, 212/219 transitions.
Incomplete random walk after 10000 steps, including 1440 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 888 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 650624 steps, run timeout after 3001 ms. (steps per millisecond=216 ) properties seen :{}
Probabilistic random walk after 650624 steps, saw 325388 distinct states, run finished after 3001 ms. (steps per millisecond=216 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 22:11:37] [INFO ] Invariant cache hit.
[2023-03-09 22:11:37] [INFO ] [Real]Absence check using 13 positive place invariants in 18 ms returned sat
[2023-03-09 22:11:37] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 22:11:37] [INFO ] After 137ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:11:37] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:11:37] [INFO ] After 160ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:11:37] [INFO ] After 372ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:11:37] [INFO ] [Nat]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 22:11:37] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 22:11:37] [INFO ] After 142ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:11:37] [INFO ] After 92ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:11:37] [INFO ] After 112ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-09 22:11:37] [INFO ] After 340ms 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 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 206/206 places, 212/212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2023-03-09 22:11:37] [INFO ] Invariant cache hit.
[2023-03-09 22:11:38] [INFO ] Implicit Places using invariants in 282 ms returned []
[2023-03-09 22:11:38] [INFO ] Invariant cache hit.
[2023-03-09 22:11:38] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:11:40] [INFO ] Implicit Places using invariants and state equation in 2122 ms returned []
Implicit Place search using SMT with State Equation took 2416 ms to find 0 implicit places.
[2023-03-09 22:11:40] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 22:11:40] [INFO ] Invariant cache hit.
[2023-03-09 22:11:40] [INFO ] Dead Transitions using invariants and state equation in 240 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2666 ms. Remains : 206/206 places, 212/212 transitions.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 206 transition count 195
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 189 transition count 195
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 180 transition count 186
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 180 transition count 186
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 179 transition count 185
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 179 transition count 183
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 177 transition count 183
Applied a total of 58 rules in 15 ms. Remains 177 /206 variables (removed 29) and now considering 183/212 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 183 rows 177 cols
[2023-03-09 22:11:40] [INFO ] Computed 31 place invariants in 10 ms
[2023-03-09 22:11:40] [INFO ] [Real]Absence check using 13 positive place invariants in 13 ms returned sat
[2023-03-09 22:11:40] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-09 22:11:40] [INFO ] After 116ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:11:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 22:11:40] [INFO ] After 11ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 22:11:40] [INFO ] After 30ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:11:40] [INFO ] After 215ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:11:40] [INFO ] [Nat]Absence check using 13 positive place invariants in 13 ms returned sat
[2023-03-09 22:11:40] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 22:11:40] [INFO ] After 117ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:11:40] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:11:40] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-09 22:11:40] [INFO ] After 219ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1429 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 944 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 627299 steps, run timeout after 3001 ms. (steps per millisecond=209 ) properties seen :{}
Probabilistic random walk after 627299 steps, saw 313721 distinct states, run finished after 3001 ms. (steps per millisecond=209 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 22:11:43] [INFO ] Computed 44 place invariants in 14 ms
[2023-03-09 22:11:43] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 22:11:43] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 22 ms returned sat
[2023-03-09 22:11:44] [INFO ] After 152ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:11:44] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 22:11:44] [INFO ] After 38ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 22:11:44] [INFO ] After 60ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-09 22:11:44] [INFO ] After 311ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 27 times.
Iterating global reduction 1 with 27 rules applied. Total rules applied 29 place count 254 transition count 220
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 56 place count 227 transition count 220
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 84 place count 227 transition count 220
Applied a total of 84 rules in 14 ms. Remains 227 /255 variables (removed 28) and now considering 220/248 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 227/255 places, 220/248 transitions.
Incomplete random walk after 10000 steps, including 1446 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 890 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 651582 steps, run timeout after 3001 ms. (steps per millisecond=217 ) properties seen :{}
Probabilistic random walk after 651582 steps, saw 325863 distinct states, run finished after 3001 ms. (steps per millisecond=217 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 220 rows 227 cols
[2023-03-09 22:11:47] [INFO ] Computed 44 place invariants in 11 ms
[2023-03-09 22:11:47] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 22:11:47] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 25 ms returned sat
[2023-03-09 22:11:47] [INFO ] After 137ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:11:47] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:11:47] [INFO ] After 28ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 22:11:47] [INFO ] After 50ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-09 22:11:47] [INFO ] After 283ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 3 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 227/227 places, 220/220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 3 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
[2023-03-09 22:11:47] [INFO ] Invariant cache hit.
[2023-03-09 22:11:47] [INFO ] Implicit Places using invariants in 426 ms returned [25, 45, 72, 77, 97, 103, 124, 129, 149, 154, 175, 181]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 428 ms to find 12 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 215/227 places, 220/220 transitions.
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 215 transition count 214
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 209 transition count 214
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 209 transition count 214
Applied a total of 13 rules in 11 ms. Remains 209 /215 variables (removed 6) and now considering 214/220 (removed 6) transitions.
// Phase 1: matrix 214 rows 209 cols
[2023-03-09 22:11:47] [INFO ] Computed 32 place invariants in 10 ms
[2023-03-09 22:11:48] [INFO ] Implicit Places using invariants in 281 ms returned []
[2023-03-09 22:11:48] [INFO ] Invariant cache hit.
[2023-03-09 22:11:48] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:11:50] [INFO ] Implicit Places using invariants and state equation in 2415 ms returned []
Implicit Place search using SMT with State Equation took 2698 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 209/227 places, 214/220 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3140 ms. Remains : 209/227 places, 214/220 transitions.
Incomplete random walk after 10000 steps, including 1447 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 913 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 657247 steps, run timeout after 3001 ms. (steps per millisecond=219 ) properties seen :{}
Probabilistic random walk after 657247 steps, saw 328699 distinct states, run finished after 3001 ms. (steps per millisecond=219 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 22:11:53] [INFO ] Invariant cache hit.
[2023-03-09 22:11:53] [INFO ] [Real]Absence check using 14 positive place invariants in 20 ms returned sat
[2023-03-09 22:11:53] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-09 22:11:53] [INFO ] After 167ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:11:53] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:11:54] [INFO ] After 192ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:11:54] [INFO ] After 447ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:11:54] [INFO ] [Nat]Absence check using 14 positive place invariants in 20 ms returned sat
[2023-03-09 22:11:54] [INFO ] [Nat]Absence check using 14 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 22:11:54] [INFO ] After 174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:11:54] [INFO ] After 156ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:11:54] [INFO ] After 176ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-09 22:11:54] [INFO ] After 439ms 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 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 209/209 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-09 22:11:54] [INFO ] Invariant cache hit.
[2023-03-09 22:11:54] [INFO ] Implicit Places using invariants in 289 ms returned []
[2023-03-09 22:11:54] [INFO ] Invariant cache hit.
[2023-03-09 22:11:55] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:11:57] [INFO ] Implicit Places using invariants and state equation in 2521 ms returned []
Implicit Place search using SMT with State Equation took 2812 ms to find 0 implicit places.
[2023-03-09 22:11:57] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 22:11:57] [INFO ] Invariant cache hit.
[2023-03-09 22:11:57] [INFO ] Dead Transitions using invariants and state equation in 223 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3051 ms. Remains : 209/209 places, 214/214 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 209 transition count 196
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 191 transition count 196
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 183 transition count 188
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 183 transition count 188
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 182 transition count 187
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 182 transition count 185
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 180 transition count 185
Applied a total of 58 rules in 13 ms. Remains 180 /209 variables (removed 29) and now considering 185/214 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 185 rows 180 cols
[2023-03-09 22:11:57] [INFO ] Computed 32 place invariants in 12 ms
[2023-03-09 22:11:57] [INFO ] [Real]Absence check using 14 positive place invariants in 14 ms returned sat
[2023-03-09 22:11:57] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 22:11:57] [INFO ] After 111ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:11:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 22:11:57] [INFO ] After 9ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 22:11:57] [INFO ] After 26ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-09 22:11:57] [INFO ] After 211ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1475 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 948 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 627728 steps, run timeout after 3001 ms. (steps per millisecond=209 ) properties seen :{}
Probabilistic random walk after 627728 steps, saw 313935 distinct states, run finished after 3001 ms. (steps per millisecond=209 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 22:12:00] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 22:12:00] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 22:12:00] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 22:12:01] [INFO ] After 200ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:12:01] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 22:12:01] [INFO ] After 37ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 22:12:01] [INFO ] After 60ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-09 22:12:01] [INFO ] After 358ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 25 times.
Iterating global reduction 1 with 25 rules applied. Total rules applied 27 place count 254 transition count 222
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 52 place count 229 transition count 222
Partial Free-agglomeration rule applied 29 times.
Drop transitions removed 29 transitions
Iterating global reduction 2 with 29 rules applied. Total rules applied 81 place count 229 transition count 222
Applied a total of 81 rules in 18 ms. Remains 229 /255 variables (removed 26) and now considering 222/248 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 229/255 places, 222/248 transitions.
Incomplete random walk after 10000 steps, including 1456 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 932 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 650476 steps, run timeout after 3001 ms. (steps per millisecond=216 ) properties seen :{}
Probabilistic random walk after 650476 steps, saw 325314 distinct states, run finished after 3001 ms. (steps per millisecond=216 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 222 rows 229 cols
[2023-03-09 22:12:04] [INFO ] Computed 44 place invariants in 13 ms
[2023-03-09 22:12:04] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 22:12:04] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 22 ms returned sat
[2023-03-09 22:12:04] [INFO ] After 171ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:12:04] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:12:04] [INFO ] After 63ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 22:12:04] [INFO ] After 84ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-09 22:12:04] [INFO ] After 346ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 222/222 transitions.
Applied a total of 0 rules in 4 ms. Remains 229 /229 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 229/229 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 222/222 transitions.
Applied a total of 0 rules in 4 ms. Remains 229 /229 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2023-03-09 22:12:04] [INFO ] Invariant cache hit.
[2023-03-09 22:12:05] [INFO ] Implicit Places using invariants in 447 ms returned [47, 52, 74, 79, 99, 105, 126, 131, 151, 156, 177, 183]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 448 ms to find 12 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 217/229 places, 222/222 transitions.
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 217 transition count 216
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 211 transition count 216
Applied a total of 12 rules in 7 ms. Remains 211 /217 variables (removed 6) and now considering 216/222 (removed 6) transitions.
// Phase 1: matrix 216 rows 211 cols
[2023-03-09 22:12:05] [INFO ] Computed 32 place invariants in 12 ms
[2023-03-09 22:12:05] [INFO ] Implicit Places using invariants in 286 ms returned []
[2023-03-09 22:12:05] [INFO ] Invariant cache hit.
[2023-03-09 22:12:05] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:12:07] [INFO ] Implicit Places using invariants and state equation in 1708 ms returned []
Implicit Place search using SMT with State Equation took 1996 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 211/229 places, 216/222 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2455 ms. Remains : 211/229 places, 216/222 transitions.
Incomplete random walk after 10000 steps, including 1442 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 932 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 652817 steps, run timeout after 3001 ms. (steps per millisecond=217 ) properties seen :{}
Probabilistic random walk after 652817 steps, saw 326480 distinct states, run finished after 3001 ms. (steps per millisecond=217 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 22:12:10] [INFO ] Invariant cache hit.
[2023-03-09 22:12:10] [INFO ] [Real]Absence check using 14 positive place invariants in 21 ms returned sat
[2023-03-09 22:12:10] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-09 22:12:10] [INFO ] After 162ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:12:10] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:12:10] [INFO ] After 82ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 22:12:10] [INFO ] After 104ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 22:12:10] [INFO ] After 371ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 211 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 216/216 transitions.
Applied a total of 0 rules in 4 ms. Remains 211 /211 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 211/211 places, 216/216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 211 /211 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2023-03-09 22:12:10] [INFO ] Invariant cache hit.
[2023-03-09 22:12:10] [INFO ] Implicit Places using invariants in 274 ms returned []
[2023-03-09 22:12:10] [INFO ] Invariant cache hit.
[2023-03-09 22:12:11] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:12:12] [INFO ] Implicit Places using invariants and state equation in 1732 ms returned []
Implicit Place search using SMT with State Equation took 2009 ms to find 0 implicit places.
[2023-03-09 22:12:12] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 22:12:12] [INFO ] Invariant cache hit.
[2023-03-09 22:12:12] [INFO ] Dead Transitions using invariants and state equation in 239 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2259 ms. Remains : 211/211 places, 216/216 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 211 transition count 198
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 193 transition count 198
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 185 transition count 190
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 185 transition count 190
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 184 transition count 189
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 184 transition count 187
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 182 transition count 187
Applied a total of 58 rules in 15 ms. Remains 182 /211 variables (removed 29) and now considering 187/216 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 187 rows 182 cols
[2023-03-09 22:12:12] [INFO ] Computed 32 place invariants in 8 ms
[2023-03-09 22:12:12] [INFO ] [Real]Absence check using 14 positive place invariants in 16 ms returned sat
[2023-03-09 22:12:12] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 22:12:13] [INFO ] After 126ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:12:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 22:12:13] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 22:12:13] [INFO ] After 27ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-09 22:12:13] [INFO ] After 233ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1464 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 932 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 627975 steps, run timeout after 3001 ms. (steps per millisecond=209 ) properties seen :{}
Probabilistic random walk after 627975 steps, saw 314058 distinct states, run finished after 3001 ms. (steps per millisecond=209 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 22:12:16] [INFO ] Computed 44 place invariants in 10 ms
[2023-03-09 22:12:16] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 22:12:16] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 22:12:16] [INFO ] After 156ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:12:16] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 22:12:16] [INFO ] After 62ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:12:16] [INFO ] After 300ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:12:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 22:12:16] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 22:12:16] [INFO ] After 160ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:12:16] [INFO ] After 68ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:12:16] [INFO ] After 90ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 22:12:16] [INFO ] After 347ms 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 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 27 times.
Iterating global reduction 1 with 27 rules applied. Total rules applied 29 place count 254 transition count 220
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 56 place count 227 transition count 220
Partial Free-agglomeration rule applied 27 times.
Drop transitions removed 27 transitions
Iterating global reduction 2 with 27 rules applied. Total rules applied 83 place count 227 transition count 220
Applied a total of 83 rules in 15 ms. Remains 227 /255 variables (removed 28) and now considering 220/248 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 227/255 places, 220/248 transitions.
Incomplete random walk after 10000 steps, including 1405 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 928 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 656357 steps, run timeout after 3001 ms. (steps per millisecond=218 ) properties seen :{}
Probabilistic random walk after 656357 steps, saw 328248 distinct states, run finished after 3001 ms. (steps per millisecond=218 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 220 rows 227 cols
[2023-03-09 22:12:19] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 22:12:19] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 22:12:19] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 25 ms returned sat
[2023-03-09 22:12:20] [INFO ] After 212ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:12:20] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:12:20] [INFO ] After 60ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:12:20] [INFO ] After 352ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:12:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 22:12:20] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 26 ms returned sat
[2023-03-09 22:12:20] [INFO ] After 220ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:12:20] [INFO ] After 295ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:12:20] [INFO ] After 324ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-09 22:12:20] [INFO ] After 645ms 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 227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 4 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 227/227 places, 220/220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 3 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
[2023-03-09 22:12:20] [INFO ] Invariant cache hit.
[2023-03-09 22:12:21] [INFO ] Implicit Places using invariants in 446 ms returned [25, 45, 50, 72, 77, 97, 103, 124, 129, 149, 154, 175, 181]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 448 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 214/227 places, 220/220 transitions.
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 214 transition count 214
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 208 transition count 214
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 208 transition count 214
Applied a total of 14 rules in 10 ms. Remains 208 /214 variables (removed 6) and now considering 214/220 (removed 6) transitions.
// Phase 1: matrix 214 rows 208 cols
[2023-03-09 22:12:21] [INFO ] Computed 31 place invariants in 17 ms
[2023-03-09 22:12:21] [INFO ] Implicit Places using invariants in 380 ms returned []
[2023-03-09 22:12:21] [INFO ] Invariant cache hit.
[2023-03-09 22:12:21] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:12:23] [INFO ] Implicit Places using invariants and state equation in 1838 ms returned []
Implicit Place search using SMT with State Equation took 2237 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 208/227 places, 214/220 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2699 ms. Remains : 208/227 places, 214/220 transitions.
Incomplete random walk after 10000 steps, including 1456 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 933 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 659746 steps, run timeout after 3001 ms. (steps per millisecond=219 ) properties seen :{}
Probabilistic random walk after 659746 steps, saw 329947 distinct states, run finished after 3001 ms. (steps per millisecond=219 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 22:12:26] [INFO ] Invariant cache hit.
[2023-03-09 22:12:26] [INFO ] [Real]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-03-09 22:12:26] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 22:12:26] [INFO ] After 149ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:12:26] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:12:26] [INFO ] After 51ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:12:26] [INFO ] After 270ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:12:26] [INFO ] [Nat]Absence check using 13 positive place invariants in 25 ms returned sat
[2023-03-09 22:12:26] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-09 22:12:27] [INFO ] After 250ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:12:27] [INFO ] After 78ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:12:27] [INFO ] After 108ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-09 22:12:27] [INFO ] After 490ms 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 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 5 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 208/208 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 5 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-09 22:12:27] [INFO ] Invariant cache hit.
[2023-03-09 22:12:27] [INFO ] Implicit Places using invariants in 385 ms returned []
[2023-03-09 22:12:27] [INFO ] Invariant cache hit.
[2023-03-09 22:12:27] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:12:30] [INFO ] Implicit Places using invariants and state equation in 2660 ms returned []
Implicit Place search using SMT with State Equation took 3047 ms to find 0 implicit places.
[2023-03-09 22:12:30] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 22:12:30] [INFO ] Invariant cache hit.
[2023-03-09 22:12:30] [INFO ] Dead Transitions using invariants and state equation in 254 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3313 ms. Remains : 208/208 places, 214/214 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 208 transition count 196
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 190 transition count 196
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 181 transition count 187
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 181 transition count 187
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 180 transition count 186
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 180 transition count 184
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 178 transition count 184
Applied a total of 60 rules in 14 ms. Remains 178 /208 variables (removed 30) and now considering 184/214 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 184 rows 178 cols
[2023-03-09 22:12:30] [INFO ] Computed 31 place invariants in 9 ms
[2023-03-09 22:12:30] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-09 22:12:30] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 14 ms returned sat
[2023-03-09 22:12:30] [INFO ] After 159ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:12:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 22:12:30] [INFO ] After 18ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:12:30] [INFO ] After 249ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:12:30] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-09 22:12:30] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 20 ms returned sat
[2023-03-09 22:12:31] [INFO ] After 180ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:12:31] [INFO ] After 15ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:12:31] [INFO ] After 39ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 22:12:31] [INFO ] After 327ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1447 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 907 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 561753 steps, run timeout after 3001 ms. (steps per millisecond=187 ) properties seen :{}
Probabilistic random walk after 561753 steps, saw 280940 distinct states, run finished after 3001 ms. (steps per millisecond=187 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 22:12:34] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 22:12:34] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 22:12:34] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 29 ms returned sat
[2023-03-09 22:12:34] [INFO ] After 391ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:12:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 22:12:34] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 28 ms returned sat
[2023-03-09 22:12:35] [INFO ] After 257ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:12:35] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 22:12:35] [INFO ] After 70ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:12:35] [INFO ] After 167ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-09 22:12:35] [INFO ] After 579ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 28 times.
Iterating global reduction 1 with 28 rules applied. Total rules applied 30 place count 254 transition count 219
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 58 place count 226 transition count 219
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 86 place count 226 transition count 219
Applied a total of 86 rules in 22 ms. Remains 226 /255 variables (removed 29) and now considering 219/248 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 226/255 places, 219/248 transitions.
Incomplete random walk after 10000 steps, including 1455 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 918 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 626938 steps, run timeout after 3001 ms. (steps per millisecond=208 ) properties seen :{}
Probabilistic random walk after 626938 steps, saw 313541 distinct states, run finished after 3001 ms. (steps per millisecond=208 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 219 rows 226 cols
[2023-03-09 22:12:38] [INFO ] Computed 44 place invariants in 11 ms
[2023-03-09 22:12:38] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 22:12:38] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 23 ms returned sat
[2023-03-09 22:12:38] [INFO ] After 218ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:12:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-09 22:12:38] [INFO ] [Nat]Absence check using 3 positive and 41 generalized place invariants in 22 ms returned sat
[2023-03-09 22:12:38] [INFO ] After 166ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:12:38] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:12:39] [INFO ] After 242ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:12:39] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 1 ms to minimize.
[2023-03-09 22:12:39] [INFO ] Deduced a trap composed of 16 places in 146 ms of which 1 ms to minimize.
[2023-03-09 22:12:39] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 1 ms to minimize.
[2023-03-09 22:12:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 504 ms
[2023-03-09 22:12:39] [INFO ] After 769ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 109 ms.
[2023-03-09 22:12:39] [INFO ] After 1123ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 226 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 6 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 226/226 places, 219/219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 6 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2023-03-09 22:12:39] [INFO ] Invariant cache hit.
[2023-03-09 22:12:40] [INFO ] Implicit Places using invariants in 681 ms returned [25, 45, 50, 71, 76, 96, 102, 123, 128, 148, 153, 174, 180]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 683 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 213/226 places, 219/219 transitions.
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 213 transition count 212
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 206 transition count 212
Applied a total of 14 rules in 12 ms. Remains 206 /213 variables (removed 7) and now considering 212/219 (removed 7) transitions.
// Phase 1: matrix 212 rows 206 cols
[2023-03-09 22:12:40] [INFO ] Computed 31 place invariants in 18 ms
[2023-03-09 22:12:40] [INFO ] Implicit Places using invariants in 431 ms returned []
[2023-03-09 22:12:40] [INFO ] Invariant cache hit.
[2023-03-09 22:12:41] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:12:43] [INFO ] Implicit Places using invariants and state equation in 2234 ms returned []
Implicit Place search using SMT with State Equation took 2669 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 206/226 places, 212/219 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3371 ms. Remains : 206/226 places, 212/219 transitions.
Incomplete random walk after 10000 steps, including 1458 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 901 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 623658 steps, run timeout after 3001 ms. (steps per millisecond=207 ) properties seen :{}
Probabilistic random walk after 623658 steps, saw 311902 distinct states, run finished after 3004 ms. (steps per millisecond=207 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 22:12:46] [INFO ] Invariant cache hit.
[2023-03-09 22:12:46] [INFO ] [Real]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-03-09 22:12:46] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-09 22:12:46] [INFO ] After 198ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:12:46] [INFO ] [Nat]Absence check using 13 positive place invariants in 25 ms returned sat
[2023-03-09 22:12:46] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-09 22:12:46] [INFO ] After 204ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:12:46] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:12:46] [INFO ] After 81ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:12:46] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 0 ms to minimize.
[2023-03-09 22:12:46] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 1 ms to minimize.
[2023-03-09 22:12:47] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 1 ms to minimize.
[2023-03-09 22:12:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 456 ms
[2023-03-09 22:12:47] [INFO ] After 557ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-09 22:12:47] [INFO ] After 892ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 5 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 206/206 places, 212/212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 5 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2023-03-09 22:12:47] [INFO ] Invariant cache hit.
[2023-03-09 22:12:47] [INFO ] Implicit Places using invariants in 393 ms returned []
[2023-03-09 22:12:47] [INFO ] Invariant cache hit.
[2023-03-09 22:12:47] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:12:49] [INFO ] Implicit Places using invariants and state equation in 2074 ms returned []
Implicit Place search using SMT with State Equation took 2470 ms to find 0 implicit places.
[2023-03-09 22:12:49] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 22:12:49] [INFO ] Invariant cache hit.
[2023-03-09 22:12:49] [INFO ] Dead Transitions using invariants and state equation in 229 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2712 ms. Remains : 206/206 places, 212/212 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 206 transition count 194
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 188 transition count 194
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 179 transition count 185
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 179 transition count 185
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 178 transition count 184
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 178 transition count 182
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 176 transition count 182
Applied a total of 60 rules in 15 ms. Remains 176 /206 variables (removed 30) and now considering 182/212 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 182 rows 176 cols
[2023-03-09 22:12:49] [INFO ] Computed 31 place invariants in 11 ms
[2023-03-09 22:12:49] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 22:12:49] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 22:12:50] [INFO ] After 200ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:12:50] [INFO ] [Nat]Absence check using 13 positive place invariants in 14 ms returned sat
[2023-03-09 22:12:50] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 22:12:50] [INFO ] After 132ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:12:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 22:12:50] [INFO ] After 11ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:12:50] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 0 ms to minimize.
[2023-03-09 22:12:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2023-03-09 22:12:50] [INFO ] After 135ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-09 22:12:50] [INFO ] After 356ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1425 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 921 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 606422 steps, run timeout after 3001 ms. (steps per millisecond=202 ) properties seen :{}
Probabilistic random walk after 606422 steps, saw 303279 distinct states, run finished after 3001 ms. (steps per millisecond=202 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 22:12:53] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 22:12:53] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 22:12:53] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 19 ms returned sat
[2023-03-09 22:12:53] [INFO ] After 118ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:12:53] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 22:12:53] [INFO ] After 74ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 22:12:53] [INFO ] After 109ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-09 22:12:53] [INFO ] After 325ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 27 times.
Iterating global reduction 1 with 27 rules applied. Total rules applied 29 place count 254 transition count 220
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 56 place count 227 transition count 220
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 84 place count 227 transition count 220
Applied a total of 84 rules in 24 ms. Remains 227 /255 variables (removed 28) and now considering 220/248 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 227/255 places, 220/248 transitions.
Incomplete random walk after 10000 steps, including 1454 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 902 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 551152 steps, run timeout after 3001 ms. (steps per millisecond=183 ) properties seen :{}
Probabilistic random walk after 551152 steps, saw 275637 distinct states, run finished after 3001 ms. (steps per millisecond=183 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 220 rows 227 cols
[2023-03-09 22:12:56] [INFO ] Computed 44 place invariants in 8 ms
[2023-03-09 22:12:56] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 22:12:56] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 26 ms returned sat
[2023-03-09 22:12:57] [INFO ] After 129ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:12:57] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:12:57] [INFO ] After 50ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:12:57] [INFO ] After 259ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:12:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 22:12:57] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 24 ms returned sat
[2023-03-09 22:12:57] [INFO ] After 198ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:12:57] [INFO ] After 69ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:12:57] [INFO ] After 102ms 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-03-09 22:12:57] [INFO ] After 397ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 6 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 227/227 places, 220/220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 6 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
[2023-03-09 22:12:57] [INFO ] Invariant cache hit.
[2023-03-09 22:12:58] [INFO ] Implicit Places using invariants in 732 ms returned [25, 45, 50, 72, 77, 97, 103, 124, 129, 149, 154, 175, 181]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 733 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 214/227 places, 220/220 transitions.
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 214 transition count 213
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 207 transition count 213
Applied a total of 14 rules in 12 ms. Remains 207 /214 variables (removed 7) and now considering 213/220 (removed 7) transitions.
// Phase 1: matrix 213 rows 207 cols
[2023-03-09 22:12:58] [INFO ] Computed 31 place invariants in 17 ms
[2023-03-09 22:12:58] [INFO ] Implicit Places using invariants in 429 ms returned []
[2023-03-09 22:12:58] [INFO ] Invariant cache hit.
[2023-03-09 22:12:59] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:13:01] [INFO ] Implicit Places using invariants and state equation in 2252 ms returned []
Implicit Place search using SMT with State Equation took 2683 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 207/227 places, 213/220 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3434 ms. Remains : 207/227 places, 213/220 transitions.
Incomplete random walk after 10000 steps, including 1440 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 927 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 619096 steps, run timeout after 3001 ms. (steps per millisecond=206 ) properties seen :{}
Probabilistic random walk after 619096 steps, saw 309620 distinct states, run finished after 3001 ms. (steps per millisecond=206 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 22:13:04] [INFO ] Invariant cache hit.
[2023-03-09 22:13:04] [INFO ] [Real]Absence check using 13 positive place invariants in 19 ms returned sat
[2023-03-09 22:13:04] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 22:13:04] [INFO ] After 114ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:13:04] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:13:04] [INFO ] After 41ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:13:04] [INFO ] After 228ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:13:04] [INFO ] [Nat]Absence check using 13 positive place invariants in 32 ms returned sat
[2023-03-09 22:13:04] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-09 22:13:04] [INFO ] After 169ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:13:04] [INFO ] After 67ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:13:04] [INFO ] After 97ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-09 22:13:04] [INFO ] After 402ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 213/213 transitions.
Applied a total of 0 rules in 5 ms. Remains 207 /207 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 207/207 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 213/213 transitions.
Applied a total of 0 rules in 6 ms. Remains 207 /207 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2023-03-09 22:13:04] [INFO ] Invariant cache hit.
[2023-03-09 22:13:05] [INFO ] Implicit Places using invariants in 402 ms returned []
[2023-03-09 22:13:05] [INFO ] Invariant cache hit.
[2023-03-09 22:13:05] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:13:07] [INFO ] Implicit Places using invariants and state equation in 2739 ms returned []
Implicit Place search using SMT with State Equation took 3142 ms to find 0 implicit places.
[2023-03-09 22:13:07] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 22:13:07] [INFO ] Invariant cache hit.
[2023-03-09 22:13:08] [INFO ] Dead Transitions using invariants and state equation in 206 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3360 ms. Remains : 207/207 places, 213/213 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 207 transition count 195
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 189 transition count 195
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 180 transition count 186
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 180 transition count 186
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 179 transition count 185
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 179 transition count 183
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 177 transition count 183
Applied a total of 60 rules in 12 ms. Remains 177 /207 variables (removed 30) and now considering 183/213 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 183 rows 177 cols
[2023-03-09 22:13:08] [INFO ] Computed 31 place invariants in 8 ms
[2023-03-09 22:13:08] [INFO ] [Real]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-03-09 22:13:08] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 22:13:08] [INFO ] After 96ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:13:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 22:13:08] [INFO ] After 11ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:13:08] [INFO ] After 168ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:13:08] [INFO ] [Nat]Absence check using 13 positive place invariants in 20 ms returned sat
[2023-03-09 22:13:08] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 10 ms returned sat
[2023-03-09 22:13:08] [INFO ] After 183ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:13:08] [INFO ] After 14ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:13:08] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 1 ms to minimize.
[2023-03-09 22:13:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2023-03-09 22:13:08] [INFO ] After 168ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-09 22:13:08] [INFO ] After 445ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1493 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 884 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 612100 steps, run timeout after 3001 ms. (steps per millisecond=203 ) properties seen :{}
Probabilistic random walk after 612100 steps, saw 306112 distinct states, run finished after 3001 ms. (steps per millisecond=203 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 22:13:11] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 22:13:11] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 22:13:11] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 28 ms returned sat
[2023-03-09 22:13:12] [INFO ] After 210ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:13:12] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 22:13:12] [INFO ] After 145ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 22:13:12] [INFO ] After 178ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-09 22:13:12] [INFO ] After 505ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 28 times.
Iterating global reduction 1 with 28 rules applied. Total rules applied 30 place count 254 transition count 219
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 58 place count 226 transition count 219
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 86 place count 226 transition count 219
Applied a total of 86 rules in 18 ms. Remains 226 /255 variables (removed 29) and now considering 219/248 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 226/255 places, 219/248 transitions.
Incomplete random walk after 10000 steps, including 1453 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 890 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 641631 steps, run timeout after 3001 ms. (steps per millisecond=213 ) properties seen :{}
Probabilistic random walk after 641631 steps, saw 320887 distinct states, run finished after 3001 ms. (steps per millisecond=213 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 219 rows 226 cols
[2023-03-09 22:13:15] [INFO ] Computed 44 place invariants in 11 ms
[2023-03-09 22:13:15] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 22:13:15] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 23 ms returned sat
[2023-03-09 22:13:15] [INFO ] After 116ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:13:15] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:13:15] [INFO ] After 51ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 22:13:15] [INFO ] After 72ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-09 22:13:15] [INFO ] After 277ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 226 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 4 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 226/226 places, 219/219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 4 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2023-03-09 22:13:15] [INFO ] Invariant cache hit.
[2023-03-09 22:13:16] [INFO ] Implicit Places using invariants in 582 ms returned [25, 45, 50, 71, 76, 96, 102, 123, 128, 148, 153, 174, 180]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 584 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 213/226 places, 219/219 transitions.
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 213 transition count 212
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 206 transition count 212
Applied a total of 14 rules in 12 ms. Remains 206 /213 variables (removed 7) and now considering 212/219 (removed 7) transitions.
// Phase 1: matrix 212 rows 206 cols
[2023-03-09 22:13:16] [INFO ] Computed 31 place invariants in 18 ms
[2023-03-09 22:13:16] [INFO ] Implicit Places using invariants in 411 ms returned []
[2023-03-09 22:13:16] [INFO ] Invariant cache hit.
[2023-03-09 22:13:16] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:13:18] [INFO ] Implicit Places using invariants and state equation in 2345 ms returned []
Implicit Place search using SMT with State Equation took 2758 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 206/226 places, 212/219 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3358 ms. Remains : 206/226 places, 212/219 transitions.
Incomplete random walk after 10000 steps, including 1457 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 933 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 639319 steps, run timeout after 3001 ms. (steps per millisecond=213 ) properties seen :{}
Probabilistic random walk after 639319 steps, saw 319732 distinct states, run finished after 3001 ms. (steps per millisecond=213 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 22:13:21] [INFO ] Invariant cache hit.
[2023-03-09 22:13:22] [INFO ] [Real]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-03-09 22:13:22] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-09 22:13:22] [INFO ] After 109ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:13:22] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:13:22] [INFO ] After 44ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 22:13:22] [INFO ] After 63ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-09 22:13:22] [INFO ] After 256ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 4 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 206/206 places, 212/212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2023-03-09 22:13:22] [INFO ] Invariant cache hit.
[2023-03-09 22:13:22] [INFO ] Implicit Places using invariants in 371 ms returned []
[2023-03-09 22:13:22] [INFO ] Invariant cache hit.
[2023-03-09 22:13:22] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:13:24] [INFO ] Implicit Places using invariants and state equation in 2147 ms returned []
Implicit Place search using SMT with State Equation took 2519 ms to find 0 implicit places.
[2023-03-09 22:13:24] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 22:13:24] [INFO ] Invariant cache hit.
[2023-03-09 22:13:25] [INFO ] Dead Transitions using invariants and state equation in 245 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2773 ms. Remains : 206/206 places, 212/212 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 206 transition count 194
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 188 transition count 194
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 179 transition count 185
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 179 transition count 185
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 178 transition count 184
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 178 transition count 182
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 176 transition count 182
Applied a total of 60 rules in 14 ms. Remains 176 /206 variables (removed 30) and now considering 182/212 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 182 rows 176 cols
[2023-03-09 22:13:25] [INFO ] Computed 31 place invariants in 11 ms
[2023-03-09 22:13:25] [INFO ] [Real]Absence check using 13 positive place invariants in 14 ms returned sat
[2023-03-09 22:13:25] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 22:13:25] [INFO ] After 115ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:13:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 22:13:25] [INFO ] After 13ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:13:25] [INFO ] After 197ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:13:25] [INFO ] [Nat]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-03-09 22:13:25] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 22:13:25] [INFO ] After 112ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:13:25] [INFO ] After 11ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:13:25] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 0 ms to minimize.
[2023-03-09 22:13:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2023-03-09 22:13:25] [INFO ] After 103ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-09 22:13:25] [INFO ] After 298ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1449 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 937 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 623790 steps, run timeout after 3001 ms. (steps per millisecond=207 ) properties seen :{}
Probabilistic random walk after 623790 steps, saw 311967 distinct states, run finished after 3001 ms. (steps per millisecond=207 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 22:13:28] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 22:13:28] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 22:13:28] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 22:13:28] [INFO ] After 242ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:13:28] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 22:13:28] [INFO ] After 69ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:13:28] [INFO ] After 390ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:13:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 22:13:29] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 24 ms returned sat
[2023-03-09 22:13:29] [INFO ] After 322ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:13:29] [INFO ] After 92ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:13:29] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 0 ms to minimize.
[2023-03-09 22:13:29] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 1 ms to minimize.
[2023-03-09 22:13:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 323 ms
[2023-03-09 22:13:29] [INFO ] After 432ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-09 22:13:29] [INFO ] After 886ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 28 times.
Iterating global reduction 1 with 28 rules applied. Total rules applied 30 place count 254 transition count 219
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 58 place count 226 transition count 219
Partial Free-agglomeration rule applied 27 times.
Drop transitions removed 27 transitions
Iterating global reduction 2 with 27 rules applied. Total rules applied 85 place count 226 transition count 219
Applied a total of 85 rules in 21 ms. Remains 226 /255 variables (removed 29) and now considering 219/248 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 226/255 places, 219/248 transitions.
Incomplete random walk after 10000 steps, including 1439 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 906 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 603986 steps, run timeout after 3001 ms. (steps per millisecond=201 ) properties seen :{}
Probabilistic random walk after 603986 steps, saw 302058 distinct states, run finished after 3001 ms. (steps per millisecond=201 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 219 rows 226 cols
[2023-03-09 22:13:32] [INFO ] Computed 44 place invariants in 11 ms
[2023-03-09 22:13:32] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 22:13:32] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 23 ms returned sat
[2023-03-09 22:13:33] [INFO ] After 114ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:13:33] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:13:33] [INFO ] After 65ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:13:33] [INFO ] After 254ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:13:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 22:13:33] [INFO ] [Nat]Absence check using 3 positive and 41 generalized place invariants in 22 ms returned sat
[2023-03-09 22:13:33] [INFO ] After 169ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:13:33] [INFO ] After 144ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:13:33] [INFO ] Deduced a trap composed of 16 places in 133 ms of which 1 ms to minimize.
[2023-03-09 22:13:33] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 0 ms to minimize.
[2023-03-09 22:13:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 340 ms
[2023-03-09 22:13:33] [INFO ] After 503ms 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-03-09 22:13:33] [INFO ] After 767ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 226 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 6 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 226/226 places, 219/219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 6 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2023-03-09 22:13:33] [INFO ] Invariant cache hit.
[2023-03-09 22:13:34] [INFO ] Implicit Places using invariants in 576 ms returned [25, 45, 50, 71, 76, 96, 102, 123, 128, 148, 153, 174, 180]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 578 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 213/226 places, 219/219 transitions.
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 213 transition count 212
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 206 transition count 212
Applied a total of 14 rules in 12 ms. Remains 206 /213 variables (removed 7) and now considering 212/219 (removed 7) transitions.
// Phase 1: matrix 212 rows 206 cols
[2023-03-09 22:13:34] [INFO ] Computed 31 place invariants in 17 ms
[2023-03-09 22:13:34] [INFO ] Implicit Places using invariants in 399 ms returned []
[2023-03-09 22:13:34] [INFO ] Invariant cache hit.
[2023-03-09 22:13:35] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:13:37] [INFO ] Implicit Places using invariants and state equation in 2256 ms returned []
Implicit Place search using SMT with State Equation took 2657 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 206/226 places, 212/219 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3253 ms. Remains : 206/226 places, 212/219 transitions.
Incomplete random walk after 10000 steps, including 1461 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 891 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 653488 steps, run timeout after 3001 ms. (steps per millisecond=217 ) properties seen :{}
Probabilistic random walk after 653488 steps, saw 326819 distinct states, run finished after 3004 ms. (steps per millisecond=217 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 22:13:40] [INFO ] Invariant cache hit.
[2023-03-09 22:13:40] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 22:13:40] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-09 22:13:40] [INFO ] After 146ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:13:40] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:13:40] [INFO ] After 62ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:13:40] [INFO ] After 279ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:13:40] [INFO ] [Nat]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-03-09 22:13:40] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 22:13:40] [INFO ] After 153ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:13:40] [INFO ] After 169ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:13:41] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 0 ms to minimize.
[2023-03-09 22:13:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
[2023-03-09 22:13:41] [INFO ] After 319ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-09 22:13:41] [INFO ] After 558ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 5 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 206/206 places, 212/212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 5 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2023-03-09 22:13:41] [INFO ] Invariant cache hit.
[2023-03-09 22:13:41] [INFO ] Implicit Places using invariants in 365 ms returned []
[2023-03-09 22:13:41] [INFO ] Invariant cache hit.
[2023-03-09 22:13:41] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:13:43] [INFO ] Implicit Places using invariants and state equation in 1980 ms returned []
Implicit Place search using SMT with State Equation took 2346 ms to find 0 implicit places.
[2023-03-09 22:13:43] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 22:13:43] [INFO ] Invariant cache hit.
[2023-03-09 22:13:43] [INFO ] Dead Transitions using invariants and state equation in 195 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2553 ms. Remains : 206/206 places, 212/212 transitions.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 206 transition count 195
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 189 transition count 195
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 180 transition count 186
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 180 transition count 186
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 179 transition count 185
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 179 transition count 183
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 177 transition count 183
Applied a total of 58 rules in 12 ms. Remains 177 /206 variables (removed 29) and now considering 183/212 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 183 rows 177 cols
[2023-03-09 22:13:43] [INFO ] Computed 31 place invariants in 9 ms
[2023-03-09 22:13:43] [INFO ] [Real]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-03-09 22:13:43] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-09 22:13:43] [INFO ] After 163ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:13:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 22:13:43] [INFO ] After 15ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 22:13:44] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 0 ms to minimize.
[2023-03-09 22:13:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2023-03-09 22:13:44] [INFO ] After 194ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:13:44] [INFO ] After 419ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:13:44] [INFO ] [Nat]Absence check using 13 positive place invariants in 20 ms returned sat
[2023-03-09 22:13:44] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-09 22:13:44] [INFO ] After 197ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:13:44] [INFO ] After 14ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:13:44] [INFO ] After 39ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-09 22:13:44] [INFO ] After 359ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1455 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 930 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 589008 steps, run timeout after 3001 ms. (steps per millisecond=196 ) properties seen :{}
Probabilistic random walk after 589008 steps, saw 294568 distinct states, run finished after 3001 ms. (steps per millisecond=196 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 22:13:47] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 22:13:47] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 22:13:47] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 22:13:47] [INFO ] After 143ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:13:47] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 22:13:47] [INFO ] After 49ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:13:47] [INFO ] After 270ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:13:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 22:13:47] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 30 ms returned sat
[2023-03-09 22:13:48] [INFO ] After 239ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:13:48] [INFO ] After 93ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:13:48] [INFO ] After 129ms 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-03-09 22:13:48] [INFO ] After 512ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 26 times.
Iterating global reduction 1 with 26 rules applied. Total rules applied 28 place count 254 transition count 221
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 54 place count 228 transition count 221
Partial Free-agglomeration rule applied 30 times.
Drop transitions removed 30 transitions
Iterating global reduction 2 with 30 rules applied. Total rules applied 84 place count 228 transition count 221
Applied a total of 84 rules in 20 ms. Remains 228 /255 variables (removed 27) and now considering 221/248 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 228/255 places, 221/248 transitions.
Incomplete random walk after 10000 steps, including 1447 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 929 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 635841 steps, run timeout after 3001 ms. (steps per millisecond=211 ) properties seen :{}
Probabilistic random walk after 635841 steps, saw 317990 distinct states, run finished after 3001 ms. (steps per millisecond=211 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 221 rows 228 cols
[2023-03-09 22:13:51] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 22:13:51] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 22:13:51] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 25 ms returned sat
[2023-03-09 22:13:51] [INFO ] After 121ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:13:51] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:13:51] [INFO ] After 55ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:13:51] [INFO ] After 256ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:13:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 22:13:51] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 25 ms returned sat
[2023-03-09 22:13:51] [INFO ] After 137ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:13:51] [INFO ] After 92ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:13:51] [INFO ] After 126ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-09 22:13:51] [INFO ] After 362ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 228 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 228/228 places, 221/221 transitions.
Applied a total of 0 rules in 6 ms. Remains 228 /228 variables (removed 0) and now considering 221/221 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 228/228 places, 221/221 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 228/228 places, 221/221 transitions.
Applied a total of 0 rules in 6 ms. Remains 228 /228 variables (removed 0) and now considering 221/221 (removed 0) transitions.
[2023-03-09 22:13:51] [INFO ] Invariant cache hit.
[2023-03-09 22:13:52] [INFO ] Implicit Places using invariants in 699 ms returned [25, 45, 50, 72, 77, 98, 104, 125, 130, 150, 155, 176, 182]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 701 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 215/228 places, 221/221 transitions.
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 215 transition count 214
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 208 transition count 214
Applied a total of 14 rules in 13 ms. Remains 208 /215 variables (removed 7) and now considering 214/221 (removed 7) transitions.
// Phase 1: matrix 214 rows 208 cols
[2023-03-09 22:13:52] [INFO ] Computed 31 place invariants in 18 ms
[2023-03-09 22:13:53] [INFO ] Implicit Places using invariants in 402 ms returned []
[2023-03-09 22:13:53] [INFO ] Invariant cache hit.
[2023-03-09 22:13:53] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:13:55] [INFO ] Implicit Places using invariants and state equation in 2349 ms returned []
Implicit Place search using SMT with State Equation took 2757 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 208/228 places, 214/221 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3477 ms. Remains : 208/228 places, 214/221 transitions.
Incomplete random walk after 10000 steps, including 1418 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 904 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 622512 steps, run timeout after 3001 ms. (steps per millisecond=207 ) properties seen :{}
Probabilistic random walk after 622512 steps, saw 311331 distinct states, run finished after 3001 ms. (steps per millisecond=207 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 22:13:58] [INFO ] Invariant cache hit.
[2023-03-09 22:13:58] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 22:13:58] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 22:13:58] [INFO ] After 118ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:13:58] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:13:58] [INFO ] After 57ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:13:58] [INFO ] After 244ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:13:58] [INFO ] [Nat]Absence check using 13 positive place invariants in 19 ms returned sat
[2023-03-09 22:13:58] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 22:13:58] [INFO ] After 146ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:13:59] [INFO ] After 71ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:13:59] [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 14 ms.
[2023-03-09 22:13:59] [INFO ] After 330ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 4 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 208/208 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 4 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-09 22:13:59] [INFO ] Invariant cache hit.
[2023-03-09 22:13:59] [INFO ] Implicit Places using invariants in 299 ms returned []
[2023-03-09 22:13:59] [INFO ] Invariant cache hit.
[2023-03-09 22:13:59] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:14:02] [INFO ] Implicit Places using invariants and state equation in 2776 ms returned []
Implicit Place search using SMT with State Equation took 3076 ms to find 0 implicit places.
[2023-03-09 22:14:02] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 22:14:02] [INFO ] Invariant cache hit.
[2023-03-09 22:14:02] [INFO ] Dead Transitions using invariants and state equation in 234 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3326 ms. Remains : 208/208 places, 214/214 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 208 transition count 196
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 190 transition count 196
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 181 transition count 187
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 181 transition count 187
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 180 transition count 186
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 180 transition count 184
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 178 transition count 184
Applied a total of 60 rules in 17 ms. Remains 178 /208 variables (removed 30) and now considering 184/214 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 184 rows 178 cols
[2023-03-09 22:14:02] [INFO ] Computed 31 place invariants in 12 ms
[2023-03-09 22:14:02] [INFO ] [Real]Absence check using 13 positive place invariants in 18 ms returned sat
[2023-03-09 22:14:02] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-09 22:14:02] [INFO ] After 129ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:14:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 22:14:02] [INFO ] After 14ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:14:02] [INFO ] After 222ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:14:02] [INFO ] [Nat]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 22:14:02] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 22:14:02] [INFO ] After 147ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:14:02] [INFO ] After 14ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:14:02] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 0 ms to minimize.
[2023-03-09 22:14:03] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 2 ms to minimize.
[2023-03-09 22:14:03] [INFO ] Deduced a trap composed of 42 places in 100 ms of which 2 ms to minimize.
[2023-03-09 22:14:03] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 2 ms to minimize.
[2023-03-09 22:14:03] [INFO ] Deduced a trap composed of 46 places in 97 ms of which 1 ms to minimize.
[2023-03-09 22:14:03] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 1 ms to minimize.
[2023-03-09 22:14:03] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 683 ms
[2023-03-09 22:14:03] [INFO ] After 710ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-09 22:14:03] [INFO ] After 955ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1486 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 903 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 556595 steps, run timeout after 3001 ms. (steps per millisecond=185 ) properties seen :{}
Probabilistic random walk after 556595 steps, saw 278359 distinct states, run finished after 3001 ms. (steps per millisecond=185 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 22:14:06] [INFO ] Computed 44 place invariants in 8 ms
[2023-03-09 22:14:06] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 22:14:06] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 19 ms returned sat
[2023-03-09 22:14:06] [INFO ] After 143ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:14:06] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 22:14:06] [INFO ] After 44ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:14:06] [INFO ] After 263ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:14:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 22:14:06] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 19 ms returned sat
[2023-03-09 22:14:07] [INFO ] After 158ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:14:07] [INFO ] After 46ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:14:07] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 0 ms to minimize.
[2023-03-09 22:14:07] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 0 ms to minimize.
[2023-03-09 22:14:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 254 ms
[2023-03-09 22:14:07] [INFO ] After 316ms 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-03-09 22:14:07] [INFO ] After 574ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 27 times.
Iterating global reduction 1 with 27 rules applied. Total rules applied 29 place count 254 transition count 220
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 56 place count 227 transition count 220
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 84 place count 227 transition count 220
Applied a total of 84 rules in 27 ms. Remains 227 /255 variables (removed 28) and now considering 220/248 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 227/255 places, 220/248 transitions.
Incomplete random walk after 10000 steps, including 1448 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 908 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 611336 steps, run timeout after 3001 ms. (steps per millisecond=203 ) properties seen :{}
Probabilistic random walk after 611336 steps, saw 305726 distinct states, run finished after 3001 ms. (steps per millisecond=203 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 220 rows 227 cols
[2023-03-09 22:14:10] [INFO ] Computed 44 place invariants in 8 ms
[2023-03-09 22:14:10] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 22:14:10] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 25 ms returned sat
[2023-03-09 22:14:10] [INFO ] After 141ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:14:10] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:14:10] [INFO ] After 73ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:14:10] [INFO ] After 292ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:14:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 22:14:10] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 31 ms returned sat
[2023-03-09 22:14:11] [INFO ] After 163ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:14:11] [INFO ] After 166ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:14:11] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 9 ms to minimize.
[2023-03-09 22:14:11] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 1 ms to minimize.
[2023-03-09 22:14:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 304 ms
[2023-03-09 22:14:11] [INFO ] After 509ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-09 22:14:11] [INFO ] After 792ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 5 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 227/227 places, 220/220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 5 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
[2023-03-09 22:14:11] [INFO ] Invariant cache hit.
[2023-03-09 22:14:12] [INFO ] Implicit Places using invariants in 653 ms returned [25, 45, 50, 72, 77, 97, 103, 124, 129, 149, 154, 175, 181]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 654 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 214/227 places, 220/220 transitions.
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 214 transition count 214
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 208 transition count 214
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 208 transition count 214
Applied a total of 14 rules in 15 ms. Remains 208 /214 variables (removed 6) and now considering 214/220 (removed 6) transitions.
// Phase 1: matrix 214 rows 208 cols
[2023-03-09 22:14:12] [INFO ] Computed 31 place invariants in 18 ms
[2023-03-09 22:14:12] [INFO ] Implicit Places using invariants in 399 ms returned []
[2023-03-09 22:14:12] [INFO ] Invariant cache hit.
[2023-03-09 22:14:13] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:14:14] [INFO ] Implicit Places using invariants and state equation in 2256 ms returned []
Implicit Place search using SMT with State Equation took 2657 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 208/227 places, 214/220 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3331 ms. Remains : 208/227 places, 214/220 transitions.
Incomplete random walk after 10000 steps, including 1447 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 916 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 623874 steps, run timeout after 3001 ms. (steps per millisecond=207 ) properties seen :{}
Probabilistic random walk after 623874 steps, saw 312015 distinct states, run finished after 3001 ms. (steps per millisecond=207 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 22:14:18] [INFO ] Invariant cache hit.
[2023-03-09 22:14:18] [INFO ] [Real]Absence check using 13 positive place invariants in 18 ms returned sat
[2023-03-09 22:14:18] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 22:14:18] [INFO ] After 157ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:14:18] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:14:18] [INFO ] After 60ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:14:18] [INFO ] After 288ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:14:18] [INFO ] [Nat]Absence check using 13 positive place invariants in 29 ms returned sat
[2023-03-09 22:14:18] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-09 22:14:18] [INFO ] After 216ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:14:18] [INFO ] After 93ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:14:18] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 1 ms to minimize.
[2023-03-09 22:14:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 140 ms
[2023-03-09 22:14:18] [INFO ] After 246ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-09 22:14:18] [INFO ] After 593ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 5 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 208/208 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 5 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-09 22:14:18] [INFO ] Invariant cache hit.
[2023-03-09 22:14:19] [INFO ] Implicit Places using invariants in 389 ms returned []
[2023-03-09 22:14:19] [INFO ] Invariant cache hit.
[2023-03-09 22:14:19] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:14:21] [INFO ] Implicit Places using invariants and state equation in 1986 ms returned []
Implicit Place search using SMT with State Equation took 2377 ms to find 0 implicit places.
[2023-03-09 22:14:21] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 22:14:21] [INFO ] Invariant cache hit.
[2023-03-09 22:14:21] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2586 ms. Remains : 208/208 places, 214/214 transitions.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 208 transition count 197
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 191 transition count 197
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 182 transition count 188
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 182 transition count 188
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 181 transition count 187
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 181 transition count 185
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 179 transition count 185
Applied a total of 58 rules in 13 ms. Remains 179 /208 variables (removed 29) and now considering 185/214 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 185 rows 179 cols
[2023-03-09 22:14:21] [INFO ] Computed 31 place invariants in 9 ms
[2023-03-09 22:14:21] [INFO ] [Real]Absence check using 13 positive place invariants in 13 ms returned sat
[2023-03-09 22:14:21] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 22:14:21] [INFO ] After 114ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:14:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 22:14:21] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 22:14:21] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 1 ms to minimize.
[2023-03-09 22:14:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2023-03-09 22:14:21] [INFO ] After 125ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:14:21] [INFO ] After 304ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:14:21] [INFO ] [Nat]Absence check using 13 positive place invariants in 20 ms returned sat
[2023-03-09 22:14:21] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-09 22:14:22] [INFO ] After 192ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:14:22] [INFO ] After 14ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:14:22] [INFO ] After 39ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-09 22:14:22] [INFO ] After 345ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1454 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 906 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 608899 steps, run timeout after 3001 ms. (steps per millisecond=202 ) properties seen :{}
Probabilistic random walk after 608899 steps, saw 304513 distinct states, run finished after 3001 ms. (steps per millisecond=202 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 22:14:25] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 22:14:25] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 22:14:25] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 28 ms returned sat
[2023-03-09 22:14:25] [INFO ] After 262ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:14:25] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 22:14:25] [INFO ] After 98ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:14:25] [INFO ] After 453ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:14:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 22:14:25] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 31 ms returned sat
[2023-03-09 22:14:26] [INFO ] After 253ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:14:26] [INFO ] After 72ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:14:26] [INFO ] After 108ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-09 22:14:26] [INFO ] After 496ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 25 times.
Iterating global reduction 1 with 25 rules applied. Total rules applied 27 place count 254 transition count 222
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 52 place count 229 transition count 222
Partial Free-agglomeration rule applied 29 times.
Drop transitions removed 29 transitions
Iterating global reduction 2 with 29 rules applied. Total rules applied 81 place count 229 transition count 222
Applied a total of 81 rules in 21 ms. Remains 229 /255 variables (removed 26) and now considering 222/248 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 229/255 places, 222/248 transitions.
Incomplete random walk after 10000 steps, including 1433 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 908 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 630032 steps, run timeout after 3001 ms. (steps per millisecond=209 ) properties seen :{}
Probabilistic random walk after 630032 steps, saw 315092 distinct states, run finished after 3001 ms. (steps per millisecond=209 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 222 rows 229 cols
[2023-03-09 22:14:29] [INFO ] Computed 44 place invariants in 12 ms
[2023-03-09 22:14:29] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-09 22:14:29] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 21 ms returned sat
[2023-03-09 22:14:29] [INFO ] After 153ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:14:29] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:14:29] [INFO ] After 49ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 22:14:29] [INFO ] After 71ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-09 22:14:29] [INFO ] After 313ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 222/222 transitions.
Applied a total of 0 rules in 3 ms. Remains 229 /229 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 229/229 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 222/222 transitions.
Applied a total of 0 rules in 3 ms. Remains 229 /229 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2023-03-09 22:14:29] [INFO ] Invariant cache hit.
[2023-03-09 22:14:29] [INFO ] Implicit Places using invariants in 355 ms returned [25, 45, 50, 71, 98, 104, 126, 131, 151, 156, 177, 183]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 356 ms to find 12 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 217/229 places, 222/222 transitions.
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 217 transition count 216
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 211 transition count 216
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 211 transition count 216
Applied a total of 13 rules in 10 ms. Remains 211 /217 variables (removed 6) and now considering 216/222 (removed 6) transitions.
// Phase 1: matrix 216 rows 211 cols
[2023-03-09 22:14:29] [INFO ] Computed 32 place invariants in 8 ms
[2023-03-09 22:14:30] [INFO ] Implicit Places using invariants in 249 ms returned []
[2023-03-09 22:14:30] [INFO ] Invariant cache hit.
[2023-03-09 22:14:30] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:14:31] [INFO ] Implicit Places using invariants and state equation in 1456 ms returned []
Implicit Place search using SMT with State Equation took 1707 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 211/229 places, 216/222 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2078 ms. Remains : 211/229 places, 216/222 transitions.
Incomplete random walk after 10000 steps, including 1430 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 921 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 686583 steps, run timeout after 3001 ms. (steps per millisecond=228 ) properties seen :{}
Probabilistic random walk after 686583 steps, saw 343365 distinct states, run finished after 3001 ms. (steps per millisecond=228 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 22:14:34] [INFO ] Invariant cache hit.
[2023-03-09 22:14:34] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 22:14:34] [INFO ] [Real]Absence check using 3 positive and 29 generalized place invariants in 18 ms returned sat
[2023-03-09 22:14:34] [INFO ] After 156ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:14:34] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:14:34] [INFO ] After 38ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:14:34] [INFO ] After 263ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:14:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 22:14:34] [INFO ] [Nat]Absence check using 3 positive and 29 generalized place invariants in 19 ms returned sat
[2023-03-09 22:14:35] [INFO ] After 155ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:14:35] [INFO ] After 44ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:14:35] [INFO ] After 63ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 22:14:35] [INFO ] After 301ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 211 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 211 /211 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 211/211 places, 216/216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 211 /211 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2023-03-09 22:14:35] [INFO ] Invariant cache hit.
[2023-03-09 22:14:35] [INFO ] Implicit Places using invariants in 240 ms returned []
[2023-03-09 22:14:35] [INFO ] Invariant cache hit.
[2023-03-09 22:14:35] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:14:36] [INFO ] Implicit Places using invariants and state equation in 1464 ms returned []
Implicit Place search using SMT with State Equation took 1705 ms to find 0 implicit places.
[2023-03-09 22:14:36] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 22:14:36] [INFO ] Invariant cache hit.
[2023-03-09 22:14:37] [INFO ] Dead Transitions using invariants and state equation in 209 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1925 ms. Remains : 211/211 places, 216/216 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 211 transition count 198
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 193 transition count 198
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 185 transition count 190
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 185 transition count 190
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 184 transition count 189
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 184 transition count 187
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 182 transition count 187
Applied a total of 58 rules in 15 ms. Remains 182 /211 variables (removed 29) and now considering 187/216 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 187 rows 182 cols
[2023-03-09 22:14:37] [INFO ] Computed 32 place invariants in 9 ms
[2023-03-09 22:14:37] [INFO ] [Real]Absence check using 14 positive place invariants in 15 ms returned sat
[2023-03-09 22:14:37] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 22:14:37] [INFO ] After 132ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:14:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 22:14:37] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 22:14:37] [INFO ] After 27ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-09 22:14:37] [INFO ] After 241ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1443 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 919 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 645131 steps, run timeout after 3001 ms. (steps per millisecond=214 ) properties seen :{}
Probabilistic random walk after 645131 steps, saw 322638 distinct states, run finished after 3001 ms. (steps per millisecond=214 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 22:14:40] [INFO ] Computed 44 place invariants in 11 ms
[2023-03-09 22:14:40] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 22:14:40] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 22:14:40] [INFO ] After 251ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:14:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 22:14:40] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 22:14:40] [INFO ] After 176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:14:40] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 22:14:41] [INFO ] After 48ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:14:41] [INFO ] After 114ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 22:14:41] [INFO ] After 387ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 28 times.
Iterating global reduction 1 with 28 rules applied. Total rules applied 30 place count 254 transition count 219
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 58 place count 226 transition count 219
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 86 place count 226 transition count 219
Applied a total of 86 rules in 15 ms. Remains 226 /255 variables (removed 29) and now considering 219/248 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 226/255 places, 219/248 transitions.
Incomplete random walk after 10000 steps, including 1462 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 900 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 645515 steps, run timeout after 3001 ms. (steps per millisecond=215 ) properties seen :{}
Probabilistic random walk after 645515 steps, saw 322829 distinct states, run finished after 3001 ms. (steps per millisecond=215 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 219 rows 226 cols
[2023-03-09 22:14:44] [INFO ] Computed 44 place invariants in 11 ms
[2023-03-09 22:14:44] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 22:14:44] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 24 ms returned sat
[2023-03-09 22:14:44] [INFO ] After 143ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:14:44] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:14:44] [INFO ] After 56ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:14:44] [INFO ] After 279ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:14:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 22:14:44] [INFO ] [Nat]Absence check using 3 positive and 41 generalized place invariants in 24 ms returned sat
[2023-03-09 22:14:44] [INFO ] After 138ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:14:44] [INFO ] After 45ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:14:44] [INFO ] After 66ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-09 22:14:44] [INFO ] After 297ms 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 226 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 3 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 226/226 places, 219/219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 3 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2023-03-09 22:14:44] [INFO ] Invariant cache hit.
[2023-03-09 22:14:45] [INFO ] Implicit Places using invariants in 523 ms returned [25, 45, 50, 71, 76, 96, 102, 123, 128, 148, 153, 174, 180]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 524 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 213/226 places, 219/219 transitions.
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 213 transition count 212
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 206 transition count 212
Applied a total of 14 rules in 7 ms. Remains 206 /213 variables (removed 7) and now considering 212/219 (removed 7) transitions.
// Phase 1: matrix 212 rows 206 cols
[2023-03-09 22:14:45] [INFO ] Computed 31 place invariants in 13 ms
[2023-03-09 22:14:45] [INFO ] Implicit Places using invariants in 297 ms returned []
[2023-03-09 22:14:45] [INFO ] Invariant cache hit.
[2023-03-09 22:14:45] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:14:48] [INFO ] Implicit Places using invariants and state equation in 2812 ms returned []
Implicit Place search using SMT with State Equation took 3111 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 206/226 places, 212/219 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3645 ms. Remains : 206/226 places, 212/219 transitions.
Incomplete random walk after 10000 steps, including 1448 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 917 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 649737 steps, run timeout after 3001 ms. (steps per millisecond=216 ) properties seen :{}
Probabilistic random walk after 649737 steps, saw 324939 distinct states, run finished after 3001 ms. (steps per millisecond=216 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 22:14:51] [INFO ] Invariant cache hit.
[2023-03-09 22:14:51] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 22:14:51] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 22:14:51] [INFO ] After 219ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:14:51] [INFO ] [Nat]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 22:14:51] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 22:14:51] [INFO ] After 136ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:14:51] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:14:51] [INFO ] After 60ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:14:52] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 0 ms to minimize.
[2023-03-09 22:14:52] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 1 ms to minimize.
[2023-03-09 22:14:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 206 ms
[2023-03-09 22:14:52] [INFO ] After 300ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-09 22:14:52] [INFO ] After 532ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 4 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 206/206 places, 212/212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2023-03-09 22:14:52] [INFO ] Invariant cache hit.
[2023-03-09 22:14:52] [INFO ] Implicit Places using invariants in 284 ms returned []
[2023-03-09 22:14:52] [INFO ] Invariant cache hit.
[2023-03-09 22:14:52] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:14:54] [INFO ] Implicit Places using invariants and state equation in 2467 ms returned []
Implicit Place search using SMT with State Equation took 2753 ms to find 0 implicit places.
[2023-03-09 22:14:54] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 22:14:54] [INFO ] Invariant cache hit.
[2023-03-09 22:14:55] [INFO ] Dead Transitions using invariants and state equation in 232 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2995 ms. Remains : 206/206 places, 212/212 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 206 transition count 194
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 188 transition count 194
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 179 transition count 185
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 179 transition count 185
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 178 transition count 184
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 178 transition count 182
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 176 transition count 182
Applied a total of 60 rules in 13 ms. Remains 176 /206 variables (removed 30) and now considering 182/212 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 182 rows 176 cols
[2023-03-09 22:14:55] [INFO ] Computed 31 place invariants in 10 ms
[2023-03-09 22:14:55] [INFO ] [Real]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-03-09 22:14:55] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 22:14:55] [INFO ] After 168ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:14:55] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2023-03-09 22:14:55] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 22:14:55] [INFO ] After 121ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:14:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 22:14:55] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:14:55] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-09 22:14:55] [INFO ] After 224ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1435 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 945 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 638627 steps, run timeout after 3001 ms. (steps per millisecond=212 ) properties seen :{}
Probabilistic random walk after 638627 steps, saw 319385 distinct states, run finished after 3001 ms. (steps per millisecond=212 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 22:14:58] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 22:14:58] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 22:14:58] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 22:14:59] [INFO ] After 312ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:14:59] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 22:14:59] [INFO ] After 89ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:14:59] [INFO ] After 479ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:14:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 22:14:59] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 31 ms returned sat
[2023-03-09 22:14:59] [INFO ] After 353ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:14:59] [INFO ] After 236ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:14:59] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 0 ms to minimize.
[2023-03-09 22:14:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2023-03-09 22:14:59] [INFO ] After 358ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-09 22:14:59] [INFO ] After 847ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 28 times.
Iterating global reduction 1 with 28 rules applied. Total rules applied 30 place count 254 transition count 219
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 58 place count 226 transition count 219
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 86 place count 226 transition count 219
Applied a total of 86 rules in 13 ms. Remains 226 /255 variables (removed 29) and now considering 219/248 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 226/255 places, 219/248 transitions.
Incomplete random walk after 10000 steps, including 1446 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 931 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 648928 steps, run timeout after 3001 ms. (steps per millisecond=216 ) properties seen :{}
Probabilistic random walk after 648928 steps, saw 324536 distinct states, run finished after 3001 ms. (steps per millisecond=216 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 219 rows 226 cols
[2023-03-09 22:15:03] [INFO ] Computed 44 place invariants in 12 ms
[2023-03-09 22:15:03] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 22:15:03] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 24 ms returned sat
[2023-03-09 22:15:03] [INFO ] After 128ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:15:03] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:15:03] [INFO ] After 102ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:15:03] [INFO ] After 312ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:15:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 22:15:03] [INFO ] [Nat]Absence check using 3 positive and 41 generalized place invariants in 28 ms returned sat
[2023-03-09 22:15:03] [INFO ] After 130ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:15:03] [INFO ] After 147ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:15:03] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 0 ms to minimize.
[2023-03-09 22:15:03] [INFO ] Deduced a trap composed of 59 places in 138 ms of which 1 ms to minimize.
[2023-03-09 22:15:04] [INFO ] Deduced a trap composed of 58 places in 136 ms of which 0 ms to minimize.
[2023-03-09 22:15:04] [INFO ] Deduced a trap composed of 72 places in 139 ms of which 0 ms to minimize.
[2023-03-09 22:15:04] [INFO ] Deduced a trap composed of 57 places in 137 ms of which 1 ms to minimize.
[2023-03-09 22:15:04] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 0 ms to minimize.
[2023-03-09 22:15:04] [INFO ] Deduced a trap composed of 60 places in 139 ms of which 0 ms to minimize.
[2023-03-09 22:15:04] [INFO ] Deduced a trap composed of 66 places in 137 ms of which 1 ms to minimize.
[2023-03-09 22:15:05] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 0 ms to minimize.
[2023-03-09 22:15:05] [INFO ] Deduced a trap composed of 9 places in 180 ms of which 1 ms to minimize.
[2023-03-09 22:15:05] [INFO ] Deduced a trap composed of 63 places in 241 ms of which 1 ms to minimize.
[2023-03-09 22:15:06] [INFO ] Deduced a trap composed of 63 places in 238 ms of which 1 ms to minimize.
[2023-03-09 22:15:06] [INFO ] Deduced a trap composed of 67 places in 189 ms of which 1 ms to minimize.
[2023-03-09 22:15:06] [INFO ] Deduced a trap composed of 69 places in 221 ms of which 1 ms to minimize.
[2023-03-09 22:15:07] [INFO ] Deduced a trap composed of 74 places in 173 ms of which 0 ms to minimize.
[2023-03-09 22:15:07] [INFO ] Deduced a trap composed of 76 places in 173 ms of which 1 ms to minimize.
[2023-03-09 22:15:07] [INFO ] Deduced a trap composed of 19 places in 210 ms of which 1 ms to minimize.
[2023-03-09 22:15:07] [INFO ] Deduced a trap composed of 13 places in 216 ms of which 1 ms to minimize.
[2023-03-09 22:15:08] [INFO ] Deduced a trap composed of 14 places in 212 ms of which 1 ms to minimize.
[2023-03-09 22:15:08] [INFO ] Deduced a trap composed of 56 places in 169 ms of which 1 ms to minimize.
[2023-03-09 22:15:09] [INFO ] Deduced a trap composed of 69 places in 171 ms of which 0 ms to minimize.
[2023-03-09 22:15:09] [INFO ] Deduced a trap composed of 68 places in 212 ms of which 1 ms to minimize.
[2023-03-09 22:15:09] [INFO ] Deduced a trap composed of 66 places in 205 ms of which 1 ms to minimize.
[2023-03-09 22:15:09] [INFO ] Deduced a trap composed of 16 places in 221 ms of which 1 ms to minimize.
[2023-03-09 22:15:10] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 0 ms to minimize.
[2023-03-09 22:15:10] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 1 ms to minimize.
[2023-03-09 22:15:10] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2023-03-09 22:15:10] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 1 ms to minimize.
[2023-03-09 22:15:10] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 0 ms to minimize.
[2023-03-09 22:15:10] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 7019 ms
[2023-03-09 22:15:10] [INFO ] After 7209ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-03-09 22:15:10] [INFO ] After 7469ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 20 ms.
Support contains 1 out of 226 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 6 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 226/226 places, 219/219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 6 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2023-03-09 22:15:10] [INFO ] Invariant cache hit.
[2023-03-09 22:15:11] [INFO ] Implicit Places using invariants in 714 ms returned [25, 45, 50, 71, 76, 96, 102, 123, 128, 148, 153, 174, 180]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 716 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 213/226 places, 219/219 transitions.
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 213 transition count 212
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 206 transition count 212
Applied a total of 14 rules in 13 ms. Remains 206 /213 variables (removed 7) and now considering 212/219 (removed 7) transitions.
// Phase 1: matrix 212 rows 206 cols
[2023-03-09 22:15:11] [INFO ] Computed 31 place invariants in 17 ms
[2023-03-09 22:15:11] [INFO ] Implicit Places using invariants in 427 ms returned []
[2023-03-09 22:15:11] [INFO ] Invariant cache hit.
[2023-03-09 22:15:12] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:15:14] [INFO ] Implicit Places using invariants and state equation in 2308 ms returned []
Implicit Place search using SMT with State Equation took 2737 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 206/226 places, 212/219 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3474 ms. Remains : 206/226 places, 212/219 transitions.
Incomplete random walk after 10000 steps, including 1431 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 909 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 599210 steps, run timeout after 3001 ms. (steps per millisecond=199 ) properties seen :{}
Probabilistic random walk after 599210 steps, saw 299666 distinct states, run finished after 3001 ms. (steps per millisecond=199 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 22:15:17] [INFO ] Invariant cache hit.
[2023-03-09 22:15:17] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 22:15:17] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 22:15:17] [INFO ] After 217ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:15:17] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:15:17] [INFO ] After 78ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:15:17] [INFO ] After 365ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:15:17] [INFO ] [Nat]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-03-09 22:15:17] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 22:15:18] [INFO ] After 306ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:15:18] [INFO ] After 213ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:15:18] [INFO ] Deduced a trap composed of 60 places in 102 ms of which 1 ms to minimize.
[2023-03-09 22:15:18] [INFO ] Deduced a trap composed of 56 places in 102 ms of which 0 ms to minimize.
[2023-03-09 22:15:18] [INFO ] Deduced a trap composed of 59 places in 111 ms of which 0 ms to minimize.
[2023-03-09 22:15:18] [INFO ] Deduced a trap composed of 64 places in 184 ms of which 1 ms to minimize.
[2023-03-09 22:15:19] [INFO ] Deduced a trap composed of 16 places in 195 ms of which 1 ms to minimize.
[2023-03-09 22:15:19] [INFO ] Deduced a trap composed of 63 places in 157 ms of which 0 ms to minimize.
[2023-03-09 22:15:19] [INFO ] Deduced a trap composed of 13 places in 186 ms of which 0 ms to minimize.
[2023-03-09 22:15:19] [INFO ] Deduced a trap composed of 12 places in 154 ms of which 1 ms to minimize.
[2023-03-09 22:15:19] [INFO ] Deduced a trap composed of 16 places in 188 ms of which 1 ms to minimize.
[2023-03-09 22:15:20] [INFO ] Deduced a trap composed of 71 places in 209 ms of which 1 ms to minimize.
[2023-03-09 22:15:20] [INFO ] Deduced a trap composed of 25 places in 197 ms of which 1 ms to minimize.
[2023-03-09 22:15:20] [INFO ] Deduced a trap composed of 67 places in 159 ms of which 0 ms to minimize.
[2023-03-09 22:15:20] [INFO ] Deduced a trap composed of 57 places in 193 ms of which 1 ms to minimize.
[2023-03-09 22:15:21] [INFO ] Deduced a trap composed of 66 places in 158 ms of which 0 ms to minimize.
[2023-03-09 22:15:21] [INFO ] Deduced a trap composed of 65 places in 189 ms of which 1 ms to minimize.
[2023-03-09 22:15:21] [INFO ] Deduced a trap composed of 57 places in 189 ms of which 1 ms to minimize.
[2023-03-09 22:15:21] [INFO ] Deduced a trap composed of 60 places in 180 ms of which 1 ms to minimize.
[2023-03-09 22:15:21] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 3488 ms
[2023-03-09 22:15:21] [INFO ] After 3758ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-03-09 22:15:21] [INFO ] After 4180ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 5 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 206/206 places, 212/212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 5 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2023-03-09 22:15:21] [INFO ] Invariant cache hit.
[2023-03-09 22:15:22] [INFO ] Implicit Places using invariants in 362 ms returned []
[2023-03-09 22:15:22] [INFO ] Invariant cache hit.
[2023-03-09 22:15:22] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:15:24] [INFO ] Implicit Places using invariants and state equation in 2627 ms returned []
Implicit Place search using SMT with State Equation took 2991 ms to find 0 implicit places.
[2023-03-09 22:15:24] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 22:15:24] [INFO ] Invariant cache hit.
[2023-03-09 22:15:25] [INFO ] Dead Transitions using invariants and state equation in 248 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3251 ms. Remains : 206/206 places, 212/212 transitions.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 206 transition count 195
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 189 transition count 195
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 180 transition count 186
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 180 transition count 186
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 179 transition count 185
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 179 transition count 183
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 177 transition count 183
Applied a total of 58 rules in 16 ms. Remains 177 /206 variables (removed 29) and now considering 183/212 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 183 rows 177 cols
[2023-03-09 22:15:25] [INFO ] Computed 31 place invariants in 11 ms
[2023-03-09 22:15:25] [INFO ] [Real]Absence check using 13 positive place invariants in 13 ms returned sat
[2023-03-09 22:15:25] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 22:15:25] [INFO ] After 122ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:15:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 22:15:25] [INFO ] After 46ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:15:25] [INFO ] After 239ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:15:25] [INFO ] [Nat]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-03-09 22:15:25] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-09 22:15:25] [INFO ] After 125ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:15:25] [INFO ] After 26ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:15:25] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2023-03-09 22:15:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2023-03-09 22:15:25] [INFO ] After 119ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-09 22:15:25] [INFO ] After 331ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1462 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 913 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 602558 steps, run timeout after 3001 ms. (steps per millisecond=200 ) properties seen :{}
Probabilistic random walk after 602558 steps, saw 301344 distinct states, run finished after 3001 ms. (steps per millisecond=200 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 22:15:28] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 22:15:28] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 22:15:28] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 29 ms returned sat
[2023-03-09 22:15:29] [INFO ] After 233ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:15:29] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 22:15:29] [INFO ] After 61ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 22:15:29] [INFO ] After 94ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-09 22:15:29] [INFO ] After 461ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 27 times.
Iterating global reduction 1 with 27 rules applied. Total rules applied 29 place count 254 transition count 220
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 56 place count 227 transition count 220
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 84 place count 227 transition count 220
Applied a total of 84 rules in 20 ms. Remains 227 /255 variables (removed 28) and now considering 220/248 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 227/255 places, 220/248 transitions.
Incomplete random walk after 10000 steps, including 1465 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 915 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 622462 steps, run timeout after 3001 ms. (steps per millisecond=207 ) properties seen :{}
Probabilistic random walk after 622462 steps, saw 311302 distinct states, run finished after 3001 ms. (steps per millisecond=207 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 220 rows 227 cols
[2023-03-09 22:15:32] [INFO ] Computed 44 place invariants in 8 ms
[2023-03-09 22:15:32] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 22:15:32] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 29 ms returned sat
[2023-03-09 22:15:32] [INFO ] After 124ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:15:32] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:15:32] [INFO ] After 159ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 22:15:32] [INFO ] After 181ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-09 22:15:32] [INFO ] After 401ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 3 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 227/227 places, 220/220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 4 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
[2023-03-09 22:15:32] [INFO ] Invariant cache hit.
[2023-03-09 22:15:33] [INFO ] Implicit Places using invariants in 515 ms returned [25, 45, 50, 77, 97, 103, 124, 129, 149, 154, 175, 181]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 516 ms to find 12 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 215/227 places, 220/220 transitions.
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 215 transition count 214
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 209 transition count 214
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 209 transition count 214
Applied a total of 13 rules in 11 ms. Remains 209 /215 variables (removed 6) and now considering 214/220 (removed 6) transitions.
// Phase 1: matrix 214 rows 209 cols
[2023-03-09 22:15:33] [INFO ] Computed 32 place invariants in 10 ms
[2023-03-09 22:15:33] [INFO ] Implicit Places using invariants in 421 ms returned []
[2023-03-09 22:15:33] [INFO ] Invariant cache hit.
[2023-03-09 22:15:33] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:15:36] [INFO ] Implicit Places using invariants and state equation in 2762 ms returned []
Implicit Place search using SMT with State Equation took 3185 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 209/227 places, 214/220 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3717 ms. Remains : 209/227 places, 214/220 transitions.
Incomplete random walk after 10000 steps, including 1433 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 915 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 626287 steps, run timeout after 3001 ms. (steps per millisecond=208 ) properties seen :{}
Probabilistic random walk after 626287 steps, saw 313217 distinct states, run finished after 3001 ms. (steps per millisecond=208 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 22:15:39] [INFO ] Invariant cache hit.
[2023-03-09 22:15:39] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2023-03-09 22:15:39] [INFO ] [Real]Absence check using 6 positive and 26 generalized place invariants in 11 ms returned sat
[2023-03-09 22:15:39] [INFO ] After 138ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:15:39] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:15:39] [INFO ] After 98ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:15:39] [INFO ] After 303ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:15:39] [INFO ] [Nat]Absence check using 6 positive place invariants in 15 ms returned sat
[2023-03-09 22:15:39] [INFO ] [Nat]Absence check using 6 positive and 26 generalized place invariants in 20 ms returned sat
[2023-03-09 22:15:40] [INFO ] After 220ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:15:40] [INFO ] After 118ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:15:40] [INFO ] After 154ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-09 22:15:40] [INFO ] After 495ms 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 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 214/214 transitions.
Applied a total of 0 rules in 5 ms. Remains 209 /209 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 209/209 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 214/214 transitions.
Applied a total of 0 rules in 4 ms. Remains 209 /209 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-09 22:15:40] [INFO ] Invariant cache hit.
[2023-03-09 22:15:40] [INFO ] Implicit Places using invariants in 409 ms returned []
[2023-03-09 22:15:40] [INFO ] Invariant cache hit.
[2023-03-09 22:15:40] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:15:43] [INFO ] Implicit Places using invariants and state equation in 2680 ms returned []
Implicit Place search using SMT with State Equation took 3090 ms to find 0 implicit places.
[2023-03-09 22:15:43] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 22:15:43] [INFO ] Invariant cache hit.
[2023-03-09 22:15:43] [INFO ] Dead Transitions using invariants and state equation in 226 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3332 ms. Remains : 209/209 places, 214/214 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 209 transition count 196
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 191 transition count 196
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 183 transition count 188
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 183 transition count 188
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 182 transition count 187
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 182 transition count 185
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 180 transition count 185
Applied a total of 58 rules in 12 ms. Remains 180 /209 variables (removed 29) and now considering 185/214 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 185 rows 180 cols
[2023-03-09 22:15:43] [INFO ] Computed 32 place invariants in 11 ms
[2023-03-09 22:15:43] [INFO ] [Real]Absence check using 14 positive place invariants in 14 ms returned sat
[2023-03-09 22:15:43] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 22:15:43] [INFO ] After 135ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:15:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 22:15:43] [INFO ] After 15ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 22:15:43] [INFO ] After 42ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-09 22:15:43] [INFO ] After 257ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1448 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 886 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 573923 steps, run timeout after 3001 ms. (steps per millisecond=191 ) properties seen :{}
Probabilistic random walk after 573923 steps, saw 287022 distinct states, run finished after 3001 ms. (steps per millisecond=191 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 22:15:46] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 22:15:46] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 22:15:46] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 22:15:47] [INFO ] After 150ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:15:47] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 22:15:47] [INFO ] After 35ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 22:15:47] [INFO ] After 57ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-09 22:15:47] [INFO ] After 312ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 25 times.
Iterating global reduction 1 with 25 rules applied. Total rules applied 27 place count 254 transition count 222
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 52 place count 229 transition count 222
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 80 place count 229 transition count 222
Applied a total of 80 rules in 14 ms. Remains 229 /255 variables (removed 26) and now considering 222/248 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 229/255 places, 222/248 transitions.
Incomplete random walk after 10000 steps, including 1431 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 942 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 584848 steps, run timeout after 3001 ms. (steps per millisecond=194 ) properties seen :{}
Probabilistic random walk after 584848 steps, saw 292489 distinct states, run finished after 3001 ms. (steps per millisecond=194 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 222 rows 229 cols
[2023-03-09 22:15:50] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 22:15:50] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 22:15:50] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 26 ms returned sat
[2023-03-09 22:15:50] [INFO ] After 118ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:15:50] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:15:50] [INFO ] After 98ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:15:50] [INFO ] After 296ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:15:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 22:15:50] [INFO ] [Nat]Absence check using 3 positive and 41 generalized place invariants in 24 ms returned sat
[2023-03-09 22:15:50] [INFO ] After 121ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:15:50] [INFO ] After 192ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:15:50] [INFO ] After 227ms 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-03-09 22:15:51] [INFO ] After 450ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 222/222 transitions.
Applied a total of 0 rules in 5 ms. Remains 229 /229 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 229/229 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 222/222 transitions.
Applied a total of 0 rules in 5 ms. Remains 229 /229 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2023-03-09 22:15:51] [INFO ] Invariant cache hit.
[2023-03-09 22:15:51] [INFO ] Implicit Places using invariants in 539 ms returned [25, 45, 50, 99, 105, 126, 131, 151, 156, 177, 183]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 541 ms to find 11 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 218/229 places, 222/222 transitions.
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 218 transition count 216
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 212 transition count 216
Applied a total of 12 rules in 12 ms. Remains 212 /218 variables (removed 6) and now considering 216/222 (removed 6) transitions.
// Phase 1: matrix 216 rows 212 cols
[2023-03-09 22:15:51] [INFO ] Computed 33 place invariants in 17 ms
[2023-03-09 22:15:51] [INFO ] Implicit Places using invariants in 404 ms returned []
[2023-03-09 22:15:51] [INFO ] Invariant cache hit.
[2023-03-09 22:15:52] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:15:54] [INFO ] Implicit Places using invariants and state equation in 2041 ms returned []
Implicit Place search using SMT with State Equation took 2447 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 212/229 places, 216/222 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3006 ms. Remains : 212/229 places, 216/222 transitions.
Incomplete random walk after 10000 steps, including 1414 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 892 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 612733 steps, run timeout after 3001 ms. (steps per millisecond=204 ) properties seen :{}
Probabilistic random walk after 612733 steps, saw 306428 distinct states, run finished after 3001 ms. (steps per millisecond=204 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 22:15:57] [INFO ] Invariant cache hit.
[2023-03-09 22:15:57] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2023-03-09 22:15:57] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 14 ms returned sat
[2023-03-09 22:15:57] [INFO ] After 302ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:15:57] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:15:57] [INFO ] After 70ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 22:15:57] [INFO ] After 97ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-09 22:15:57] [INFO ] After 484ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 212 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 216/216 transitions.
Applied a total of 0 rules in 4 ms. Remains 212 /212 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 212/212 places, 216/216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 216/216 transitions.
Applied a total of 0 rules in 4 ms. Remains 212 /212 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2023-03-09 22:15:57] [INFO ] Invariant cache hit.
[2023-03-09 22:15:57] [INFO ] Implicit Places using invariants in 352 ms returned []
[2023-03-09 22:15:57] [INFO ] Invariant cache hit.
[2023-03-09 22:15:58] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:15:59] [INFO ] Implicit Places using invariants and state equation in 2039 ms returned []
Implicit Place search using SMT with State Equation took 2394 ms to find 0 implicit places.
[2023-03-09 22:15:59] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 22:15:59] [INFO ] Invariant cache hit.
[2023-03-09 22:16:00] [INFO ] Dead Transitions using invariants and state equation in 215 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2619 ms. Remains : 212/212 places, 216/216 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 212 transition count 198
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 194 transition count 198
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 186 transition count 190
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 186 transition count 190
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 185 transition count 189
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 185 transition count 187
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 183 transition count 187
Applied a total of 58 rules in 12 ms. Remains 183 /212 variables (removed 29) and now considering 187/216 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 187 rows 183 cols
[2023-03-09 22:16:00] [INFO ] Computed 33 place invariants in 11 ms
[2023-03-09 22:16:00] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2023-03-09 22:16:00] [INFO ] [Real]Absence check using 6 positive and 27 generalized place invariants in 11 ms returned sat
[2023-03-09 22:16:00] [INFO ] After 144ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:16:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 22:16:00] [INFO ] After 15ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 22:16:00] [INFO ] After 41ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-09 22:16:00] [INFO ] After 260ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1474 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 936 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 581758 steps, run timeout after 3001 ms. (steps per millisecond=193 ) properties seen :{}
Probabilistic random walk after 581758 steps, saw 290941 distinct states, run finished after 3001 ms. (steps per millisecond=193 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 22:16:03] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 22:16:03] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 22:16:03] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 22:16:03] [INFO ] After 154ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:16:03] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 22:16:03] [INFO ] After 136ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:16:03] [INFO ] After 367ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:16:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 22:16:03] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 30 ms returned sat
[2023-03-09 22:16:04] [INFO ] After 246ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:16:04] [INFO ] After 119ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:16:04] [INFO ] After 156ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 137 ms.
[2023-03-09 22:16:04] [INFO ] After 661ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 28 times.
Iterating global reduction 1 with 28 rules applied. Total rules applied 30 place count 254 transition count 219
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 58 place count 226 transition count 219
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 86 place count 226 transition count 219
Applied a total of 86 rules in 21 ms. Remains 226 /255 variables (removed 29) and now considering 219/248 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 226/255 places, 219/248 transitions.
Incomplete random walk after 10000 steps, including 1447 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 912 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 608827 steps, run timeout after 3001 ms. (steps per millisecond=202 ) properties seen :{}
Probabilistic random walk after 608827 steps, saw 304475 distinct states, run finished after 3001 ms. (steps per millisecond=202 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 219 rows 226 cols
[2023-03-09 22:16:07] [INFO ] Computed 44 place invariants in 12 ms
[2023-03-09 22:16:07] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 22:16:07] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 23 ms returned sat
[2023-03-09 22:16:07] [INFO ] After 174ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:16:07] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:16:07] [INFO ] After 127ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:16:07] [INFO ] After 379ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:16:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-09 22:16:08] [INFO ] [Nat]Absence check using 3 positive and 41 generalized place invariants in 36 ms returned sat
[2023-03-09 22:16:08] [INFO ] After 217ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:16:08] [INFO ] After 134ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:16:08] [INFO ] After 183ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-09 22:16:08] [INFO ] After 548ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 226 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 6 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 226/226 places, 219/219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 6 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2023-03-09 22:16:08] [INFO ] Invariant cache hit.
[2023-03-09 22:16:09] [INFO ] Implicit Places using invariants in 726 ms returned [25, 45, 50, 71, 76, 96, 102, 123, 128, 148, 153, 174, 180]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 727 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 213/226 places, 219/219 transitions.
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 213 transition count 212
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 206 transition count 212
Applied a total of 14 rules in 11 ms. Remains 206 /213 variables (removed 7) and now considering 212/219 (removed 7) transitions.
// Phase 1: matrix 212 rows 206 cols
[2023-03-09 22:16:09] [INFO ] Computed 31 place invariants in 18 ms
[2023-03-09 22:16:09] [INFO ] Implicit Places using invariants in 415 ms returned []
[2023-03-09 22:16:09] [INFO ] Invariant cache hit.
[2023-03-09 22:16:09] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:16:12] [INFO ] Implicit Places using invariants and state equation in 2697 ms returned []
Implicit Place search using SMT with State Equation took 3113 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 206/226 places, 212/219 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3858 ms. Remains : 206/226 places, 212/219 transitions.
Incomplete random walk after 10000 steps, including 1462 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 933 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 645071 steps, run timeout after 3001 ms. (steps per millisecond=214 ) properties seen :{}
Probabilistic random walk after 645071 steps, saw 322607 distinct states, run finished after 3001 ms. (steps per millisecond=214 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 22:16:15] [INFO ] Invariant cache hit.
[2023-03-09 22:16:15] [INFO ] [Real]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-03-09 22:16:15] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 22:16:15] [INFO ] After 159ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:16:15] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:16:15] [INFO ] After 58ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:16:15] [INFO ] After 287ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:16:15] [INFO ] [Nat]Absence check using 13 positive place invariants in 17 ms returned sat
[2023-03-09 22:16:15] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 22:16:15] [INFO ] After 162ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:16:16] [INFO ] After 46ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:16:16] [INFO ] After 67ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-09 22:16:16] [INFO ] After 320ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 4 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 206/206 places, 212/212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2023-03-09 22:16:16] [INFO ] Invariant cache hit.
[2023-03-09 22:16:16] [INFO ] Implicit Places using invariants in 277 ms returned []
[2023-03-09 22:16:16] [INFO ] Invariant cache hit.
[2023-03-09 22:16:16] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:16:18] [INFO ] Implicit Places using invariants and state equation in 2510 ms returned []
Implicit Place search using SMT with State Equation took 2788 ms to find 0 implicit places.
[2023-03-09 22:16:18] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 22:16:18] [INFO ] Invariant cache hit.
[2023-03-09 22:16:19] [INFO ] Dead Transitions using invariants and state equation in 195 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2993 ms. Remains : 206/206 places, 212/212 transitions.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 206 transition count 195
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 189 transition count 195
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 180 transition count 186
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 180 transition count 186
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 179 transition count 185
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 179 transition count 183
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 177 transition count 183
Applied a total of 58 rules in 12 ms. Remains 177 /206 variables (removed 29) and now considering 183/212 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 183 rows 177 cols
[2023-03-09 22:16:19] [INFO ] Computed 31 place invariants in 9 ms
[2023-03-09 22:16:19] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2023-03-09 22:16:19] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 22:16:19] [INFO ] After 115ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:16:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 22:16:19] [INFO ] After 20ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 22:16:19] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 0 ms to minimize.
[2023-03-09 22:16:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 143 ms
[2023-03-09 22:16:19] [INFO ] After 176ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:16:19] [INFO ] After 355ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:16:19] [INFO ] [Nat]Absence check using 13 positive place invariants in 18 ms returned sat
[2023-03-09 22:16:19] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-09 22:16:19] [INFO ] After 200ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:16:19] [INFO ] After 15ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:16:19] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 1 ms to minimize.
[2023-03-09 22:16:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2023-03-09 22:16:19] [INFO ] After 164ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-09 22:16:19] [INFO ] After 471ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1422 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 913 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 583488 steps, run timeout after 3001 ms. (steps per millisecond=194 ) properties seen :{}
Probabilistic random walk after 583488 steps, saw 291806 distinct states, run finished after 3001 ms. (steps per millisecond=194 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 22:16:22] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 22:16:22] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 22:16:23] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 22:16:23] [INFO ] After 155ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:16:23] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 22:16:23] [INFO ] After 53ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 22:16:23] [INFO ] After 75ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 22:16:23] [INFO ] After 320ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 27 times.
Iterating global reduction 1 with 27 rules applied. Total rules applied 29 place count 254 transition count 220
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 56 place count 227 transition count 220
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 84 place count 227 transition count 220
Applied a total of 84 rules in 19 ms. Remains 227 /255 variables (removed 28) and now considering 220/248 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 227/255 places, 220/248 transitions.
Incomplete random walk after 10000 steps, including 1437 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 909 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 644128 steps, run timeout after 3001 ms. (steps per millisecond=214 ) properties seen :{}
Probabilistic random walk after 644128 steps, saw 322133 distinct states, run finished after 3001 ms. (steps per millisecond=214 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 220 rows 227 cols
[2023-03-09 22:16:26] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 22:16:26] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 22:16:26] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 25 ms returned sat
[2023-03-09 22:16:26] [INFO ] After 138ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:16:26] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:16:26] [INFO ] After 40ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:16:26] [INFO ] After 256ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:16:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 22:16:26] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 25 ms returned sat
[2023-03-09 22:16:26] [INFO ] After 161ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:16:26] [INFO ] After 72ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:16:26] [INFO ] After 104ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-09 22:16:26] [INFO ] After 362ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 5 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 227/227 places, 220/220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 6 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
[2023-03-09 22:16:26] [INFO ] Invariant cache hit.
[2023-03-09 22:16:27] [INFO ] Implicit Places using invariants in 557 ms returned [25, 45, 50, 71, 97, 103, 124, 129, 149, 154, 175, 181]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 558 ms to find 12 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 215/227 places, 220/220 transitions.
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 215 transition count 214
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 209 transition count 214
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 209 transition count 214
Applied a total of 13 rules in 14 ms. Remains 209 /215 variables (removed 6) and now considering 214/220 (removed 6) transitions.
// Phase 1: matrix 214 rows 209 cols
[2023-03-09 22:16:27] [INFO ] Computed 32 place invariants in 17 ms
[2023-03-09 22:16:27] [INFO ] Implicit Places using invariants in 388 ms returned []
[2023-03-09 22:16:27] [INFO ] Invariant cache hit.
[2023-03-09 22:16:28] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:16:30] [INFO ] Implicit Places using invariants and state equation in 2870 ms returned []
Implicit Place search using SMT with State Equation took 3260 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 209/227 places, 214/220 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3839 ms. Remains : 209/227 places, 214/220 transitions.
Incomplete random walk after 10000 steps, including 1405 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 908 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 648585 steps, run timeout after 3001 ms. (steps per millisecond=216 ) properties seen :{}
Probabilistic random walk after 648585 steps, saw 324368 distinct states, run finished after 3001 ms. (steps per millisecond=216 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 22:16:33] [INFO ] Invariant cache hit.
[2023-03-09 22:16:33] [INFO ] [Real]Absence check using 14 positive place invariants in 18 ms returned sat
[2023-03-09 22:16:33] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 22:16:34] [INFO ] After 141ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:16:34] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:16:34] [INFO ] After 94ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 22:16:34] [INFO ] After 113ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-09 22:16:34] [INFO ] After 338ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 209/209 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-09 22:16:34] [INFO ] Invariant cache hit.
[2023-03-09 22:16:34] [INFO ] Implicit Places using invariants in 307 ms returned []
[2023-03-09 22:16:34] [INFO ] Invariant cache hit.
[2023-03-09 22:16:34] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:16:36] [INFO ] Implicit Places using invariants and state equation in 2086 ms returned []
Implicit Place search using SMT with State Equation took 2395 ms to find 0 implicit places.
[2023-03-09 22:16:36] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 22:16:36] [INFO ] Invariant cache hit.
[2023-03-09 22:16:36] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2564 ms. Remains : 209/209 places, 214/214 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 209 transition count 196
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 191 transition count 196
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 183 transition count 188
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 183 transition count 188
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 182 transition count 187
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 182 transition count 185
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 180 transition count 185
Applied a total of 58 rules in 12 ms. Remains 180 /209 variables (removed 29) and now considering 185/214 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 185 rows 180 cols
[2023-03-09 22:16:36] [INFO ] Computed 32 place invariants in 11 ms
[2023-03-09 22:16:36] [INFO ] [Real]Absence check using 14 positive place invariants in 22 ms returned sat
[2023-03-09 22:16:36] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-09 22:16:37] [INFO ] After 192ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:16:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 22:16:37] [INFO ] After 14ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 22:16:37] [INFO ] After 38ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-09 22:16:37] [INFO ] After 340ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1448 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 944 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 603563 steps, run timeout after 3001 ms. (steps per millisecond=201 ) properties seen :{}
Probabilistic random walk after 603563 steps, saw 301846 distinct states, run finished after 3001 ms. (steps per millisecond=201 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 22:16:40] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 22:16:40] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 22:16:40] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 19 ms returned sat
[2023-03-09 22:16:40] [INFO ] After 183ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:16:40] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 22:16:40] [INFO ] After 72ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:16:40] [INFO ] After 330ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:16:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 22:16:40] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 22:16:40] [INFO ] After 176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:16:40] [INFO ] After 41ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:16:40] [INFO ] After 63ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-03-09 22:16:40] [INFO ] After 367ms 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 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 28 times.
Iterating global reduction 1 with 28 rules applied. Total rules applied 30 place count 254 transition count 219
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 58 place count 226 transition count 219
Partial Free-agglomeration rule applied 27 times.
Drop transitions removed 27 transitions
Iterating global reduction 2 with 27 rules applied. Total rules applied 85 place count 226 transition count 219
Applied a total of 85 rules in 12 ms. Remains 226 /255 variables (removed 29) and now considering 219/248 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 226/255 places, 219/248 transitions.
Incomplete random walk after 10000 steps, including 1453 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 919 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 636235 steps, run timeout after 3001 ms. (steps per millisecond=212 ) properties seen :{}
Probabilistic random walk after 636235 steps, saw 318191 distinct states, run finished after 3001 ms. (steps per millisecond=212 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 219 rows 226 cols
[2023-03-09 22:16:43] [INFO ] Computed 44 place invariants in 12 ms
[2023-03-09 22:16:43] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 22:16:43] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 22 ms returned sat
[2023-03-09 22:16:44] [INFO ] After 159ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:16:44] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:16:44] [INFO ] After 72ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 22:16:44] [INFO ] Deduced a trap composed of 61 places in 124 ms of which 0 ms to minimize.
[2023-03-09 22:16:44] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 1 ms to minimize.
[2023-03-09 22:16:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 313 ms
[2023-03-09 22:16:44] [INFO ] After 397ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:16:44] [INFO ] After 633ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:16:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 22:16:44] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 27 ms returned sat
[2023-03-09 22:16:44] [INFO ] After 209ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:16:44] [INFO ] After 81ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:16:45] [INFO ] Deduced a trap composed of 57 places in 181 ms of which 1 ms to minimize.
[2023-03-09 22:16:45] [INFO ] Deduced a trap composed of 16 places in 223 ms of which 1 ms to minimize.
[2023-03-09 22:16:45] [INFO ] Deduced a trap composed of 4 places in 180 ms of which 0 ms to minimize.
[2023-03-09 22:16:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 663 ms
[2023-03-09 22:16:45] [INFO ] After 765ms 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-03-09 22:16:45] [INFO ] After 1082ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 226 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 6 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 226/226 places, 219/219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 5 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2023-03-09 22:16:45] [INFO ] Invariant cache hit.
[2023-03-09 22:16:46] [INFO ] Implicit Places using invariants in 679 ms returned [25, 45, 50, 71, 76, 96, 102, 123, 128, 148, 153, 174, 180]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 680 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 213/226 places, 219/219 transitions.
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 213 transition count 213
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 207 transition count 213
Applied a total of 12 rules in 10 ms. Remains 207 /213 variables (removed 6) and now considering 213/219 (removed 6) transitions.
// Phase 1: matrix 213 rows 207 cols
[2023-03-09 22:16:46] [INFO ] Computed 31 place invariants in 16 ms
[2023-03-09 22:16:46] [INFO ] Implicit Places using invariants in 401 ms returned []
[2023-03-09 22:16:46] [INFO ] Invariant cache hit.
[2023-03-09 22:16:46] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:16:49] [INFO ] Implicit Places using invariants and state equation in 2864 ms returned []
Implicit Place search using SMT with State Equation took 3266 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 207/226 places, 213/219 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3961 ms. Remains : 207/226 places, 213/219 transitions.
Incomplete random walk after 10000 steps, including 1418 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 920 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 636289 steps, run timeout after 3001 ms. (steps per millisecond=212 ) properties seen :{}
Probabilistic random walk after 636289 steps, saw 318221 distinct states, run finished after 3001 ms. (steps per millisecond=212 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 22:16:52] [INFO ] Invariant cache hit.
[2023-03-09 22:16:52] [INFO ] [Real]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-03-09 22:16:52] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-09 22:16:52] [INFO ] After 215ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:16:52] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:16:52] [INFO ] After 54ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 22:16:53] [INFO ] Deduced a trap composed of 58 places in 156 ms of which 0 ms to minimize.
[2023-03-09 22:16:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
[2023-03-09 22:16:53] [INFO ] After 267ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:16:53] [INFO ] After 551ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:16:53] [INFO ] [Nat]Absence check using 13 positive place invariants in 26 ms returned sat
[2023-03-09 22:16:53] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-09 22:16:53] [INFO ] After 240ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:16:53] [INFO ] After 110ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:16:53] [INFO ] Deduced a trap composed of 16 places in 160 ms of which 1 ms to minimize.
[2023-03-09 22:16:53] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 0 ms to minimize.
[2023-03-09 22:16:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 352 ms
[2023-03-09 22:16:53] [INFO ] After 486ms 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-03-09 22:16:54] [INFO ] After 858ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 213/213 transitions.
Applied a total of 0 rules in 5 ms. Remains 207 /207 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 207/207 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 213/213 transitions.
Applied a total of 0 rules in 4 ms. Remains 207 /207 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2023-03-09 22:16:54] [INFO ] Invariant cache hit.
[2023-03-09 22:16:54] [INFO ] Implicit Places using invariants in 395 ms returned []
[2023-03-09 22:16:54] [INFO ] Invariant cache hit.
[2023-03-09 22:16:54] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:16:57] [INFO ] Implicit Places using invariants and state equation in 2698 ms returned []
Implicit Place search using SMT with State Equation took 3099 ms to find 0 implicit places.
[2023-03-09 22:16:57] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 22:16:57] [INFO ] Invariant cache hit.
[2023-03-09 22:16:57] [INFO ] Dead Transitions using invariants and state equation in 275 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3389 ms. Remains : 207/207 places, 213/213 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 207 transition count 195
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 189 transition count 195
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 180 transition count 186
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 180 transition count 186
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 179 transition count 185
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 179 transition count 183
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 177 transition count 183
Applied a total of 60 rules in 16 ms. Remains 177 /207 variables (removed 30) and now considering 183/213 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 183 rows 177 cols
[2023-03-09 22:16:57] [INFO ] Computed 31 place invariants in 13 ms
[2023-03-09 22:16:57] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 22:16:57] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-09 22:16:57] [INFO ] After 140ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:16:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 22:16:57] [INFO ] After 13ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 22:16:57] [INFO ] After 33ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-09 22:16:57] [INFO ] After 266ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1426 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 914 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2031 steps, run visited all 1 properties in 15 ms. (steps per millisecond=135 )
Probabilistic random walk after 2031 steps, saw 1030 distinct states, run finished after 15 ms. (steps per millisecond=135 ) properties seen :1
Incomplete random walk after 10000 steps, including 1461 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 907 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 620089 steps, run timeout after 3001 ms. (steps per millisecond=206 ) properties seen :{}
Probabilistic random walk after 620089 steps, saw 310116 distinct states, run finished after 3001 ms. (steps per millisecond=206 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 22:17:00] [INFO ] Computed 44 place invariants in 8 ms
[2023-03-09 22:17:00] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 22:17:00] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 22:17:01] [INFO ] After 178ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:17:01] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 22:17:01] [INFO ] After 52ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 22:17:01] [INFO ] After 74ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 22:17:01] [INFO ] After 345ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:17:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 22:17:01] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 18 ms returned sat
[2023-03-09 22:17:01] [INFO ] After 218ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:17:01] [INFO ] After 53ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:17:01] [INFO ] After 81ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-09 22:17:01] [INFO ] After 392ms 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 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 28 times.
Iterating global reduction 1 with 28 rules applied. Total rules applied 30 place count 254 transition count 219
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 58 place count 226 transition count 219
Partial Free-agglomeration rule applied 27 times.
Drop transitions removed 27 transitions
Iterating global reduction 2 with 27 rules applied. Total rules applied 85 place count 226 transition count 219
Applied a total of 85 rules in 16 ms. Remains 226 /255 variables (removed 29) and now considering 219/248 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 226/255 places, 219/248 transitions.
Incomplete random walk after 10000 steps, including 1419 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 912 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 625821 steps, run timeout after 3001 ms. (steps per millisecond=208 ) properties seen :{}
Probabilistic random walk after 625821 steps, saw 312981 distinct states, run finished after 3001 ms. (steps per millisecond=208 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 219 rows 226 cols
[2023-03-09 22:17:04] [INFO ] Computed 44 place invariants in 11 ms
[2023-03-09 22:17:04] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 22:17:04] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 23 ms returned sat
[2023-03-09 22:17:04] [INFO ] After 121ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:17:04] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:17:04] [INFO ] After 92ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:17:04] [INFO ] After 287ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:17:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 22:17:04] [INFO ] [Nat]Absence check using 3 positive and 41 generalized place invariants in 29 ms returned sat
[2023-03-09 22:17:05] [INFO ] After 143ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:17:05] [INFO ] After 159ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:17:05] [INFO ] After 190ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-09 22:17:05] [INFO ] After 447ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 226 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 4 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 226/226 places, 219/219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 4 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2023-03-09 22:17:05] [INFO ] Invariant cache hit.
[2023-03-09 22:17:05] [INFO ] Implicit Places using invariants in 612 ms returned [25, 45, 50, 71, 76, 96, 102, 123, 128, 148, 153, 174, 180]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 614 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 213/226 places, 219/219 transitions.
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 213 transition count 212
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 206 transition count 212
Applied a total of 14 rules in 10 ms. Remains 206 /213 variables (removed 7) and now considering 212/219 (removed 7) transitions.
// Phase 1: matrix 212 rows 206 cols
[2023-03-09 22:17:05] [INFO ] Computed 31 place invariants in 17 ms
[2023-03-09 22:17:06] [INFO ] Implicit Places using invariants in 376 ms returned []
[2023-03-09 22:17:06] [INFO ] Invariant cache hit.
[2023-03-09 22:17:06] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:17:08] [INFO ] Implicit Places using invariants and state equation in 2265 ms returned []
Implicit Place search using SMT with State Equation took 2643 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 206/226 places, 212/219 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3273 ms. Remains : 206/226 places, 212/219 transitions.
Incomplete random walk after 10000 steps, including 1448 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 925 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 636207 steps, run timeout after 3001 ms. (steps per millisecond=211 ) properties seen :{}
Probabilistic random walk after 636207 steps, saw 318178 distinct states, run finished after 3001 ms. (steps per millisecond=211 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 22:17:11] [INFO ] Invariant cache hit.
[2023-03-09 22:17:11] [INFO ] [Real]Absence check using 13 positive place invariants in 17 ms returned sat
[2023-03-09 22:17:11] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 22:17:11] [INFO ] After 147ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:17:11] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:17:11] [INFO ] After 75ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:17:11] [INFO ] After 295ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:17:12] [INFO ] [Nat]Absence check using 13 positive place invariants in 18 ms returned sat
[2023-03-09 22:17:12] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 22:17:12] [INFO ] After 149ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:17:12] [INFO ] After 102ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:17:12] [INFO ] After 131ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-09 22:17:12] [INFO ] After 374ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 5 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 206/206 places, 212/212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 5 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2023-03-09 22:17:12] [INFO ] Invariant cache hit.
[2023-03-09 22:17:12] [INFO ] Implicit Places using invariants in 381 ms returned []
[2023-03-09 22:17:12] [INFO ] Invariant cache hit.
[2023-03-09 22:17:12] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:17:15] [INFO ] Implicit Places using invariants and state equation in 2568 ms returned []
Implicit Place search using SMT with State Equation took 2951 ms to find 0 implicit places.
[2023-03-09 22:17:15] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 22:17:15] [INFO ] Invariant cache hit.
[2023-03-09 22:17:15] [INFO ] Dead Transitions using invariants and state equation in 225 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3188 ms. Remains : 206/206 places, 212/212 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 206 transition count 194
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 188 transition count 194
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 179 transition count 185
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 179 transition count 185
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 178 transition count 184
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 178 transition count 182
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 176 transition count 182
Applied a total of 60 rules in 13 ms. Remains 176 /206 variables (removed 30) and now considering 182/212 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 182 rows 176 cols
[2023-03-09 22:17:15] [INFO ] Computed 31 place invariants in 10 ms
[2023-03-09 22:17:15] [INFO ] [Real]Absence check using 13 positive place invariants in 13 ms returned sat
[2023-03-09 22:17:15] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-09 22:17:15] [INFO ] After 138ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:17:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 22:17:15] [INFO ] After 11ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 22:17:15] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 1 ms to minimize.
[2023-03-09 22:17:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2023-03-09 22:17:15] [INFO ] After 102ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:17:15] [INFO ] After 303ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:17:15] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2023-03-09 22:17:15] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 22:17:16] [INFO ] After 124ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:17:16] [INFO ] After 9ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:17:16] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 0 ms to minimize.
[2023-03-09 22:17:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2023-03-09 22:17:16] [INFO ] After 97ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-09 22:17:16] [INFO ] After 292ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1474 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 909 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 614924 steps, run timeout after 3001 ms. (steps per millisecond=204 ) properties seen :{}
Probabilistic random walk after 614924 steps, saw 307534 distinct states, run finished after 3001 ms. (steps per millisecond=204 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 22:17:19] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 22:17:19] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 22:17:19] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 19 ms returned sat
[2023-03-09 22:17:19] [INFO ] After 239ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:17:19] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 22:17:19] [INFO ] After 135ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:17:19] [INFO ] After 449ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:17:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 22:17:19] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 31 ms returned sat
[2023-03-09 22:17:19] [INFO ] After 258ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:17:20] [INFO ] After 153ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:17:20] [INFO ] After 186ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-09 22:17:20] [INFO ] After 585ms 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 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 28 times.
Iterating global reduction 1 with 28 rules applied. Total rules applied 30 place count 254 transition count 219
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 58 place count 226 transition count 219
Partial Free-agglomeration rule applied 27 times.
Drop transitions removed 27 transitions
Iterating global reduction 2 with 27 rules applied. Total rules applied 85 place count 226 transition count 219
Applied a total of 85 rules in 21 ms. Remains 226 /255 variables (removed 29) and now considering 219/248 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 226/255 places, 219/248 transitions.
Incomplete random walk after 10000 steps, including 1454 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 903 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 635785 steps, run timeout after 3001 ms. (steps per millisecond=211 ) properties seen :{}
Probabilistic random walk after 635785 steps, saw 317964 distinct states, run finished after 3001 ms. (steps per millisecond=211 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 219 rows 226 cols
[2023-03-09 22:17:23] [INFO ] Computed 44 place invariants in 11 ms
[2023-03-09 22:17:23] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 22:17:23] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 22 ms returned sat
[2023-03-09 22:17:23] [INFO ] After 150ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:17:23] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:17:23] [INFO ] After 43ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:17:23] [INFO ] After 267ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:17:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 22:17:23] [INFO ] [Nat]Absence check using 3 positive and 41 generalized place invariants in 22 ms returned sat
[2023-03-09 22:17:23] [INFO ] After 140ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:17:23] [INFO ] After 83ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:17:23] [INFO ] After 107ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-09 22:17:23] [INFO ] After 336ms 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 226 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 4 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 226/226 places, 219/219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 5 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2023-03-09 22:17:23] [INFO ] Invariant cache hit.
[2023-03-09 22:17:24] [INFO ] Implicit Places using invariants in 568 ms returned [25, 45, 50, 71, 76, 96, 102, 123, 128, 148, 153, 174, 180]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 569 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 213/226 places, 219/219 transitions.
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 213 transition count 212
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 206 transition count 212
Applied a total of 14 rules in 9 ms. Remains 206 /213 variables (removed 7) and now considering 212/219 (removed 7) transitions.
// Phase 1: matrix 212 rows 206 cols
[2023-03-09 22:17:24] [INFO ] Computed 31 place invariants in 13 ms
[2023-03-09 22:17:24] [INFO ] Implicit Places using invariants in 333 ms returned []
[2023-03-09 22:17:24] [INFO ] Invariant cache hit.
[2023-03-09 22:17:25] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:17:26] [INFO ] Implicit Places using invariants and state equation in 1874 ms returned []
Implicit Place search using SMT with State Equation took 2210 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 206/226 places, 212/219 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2793 ms. Remains : 206/226 places, 212/219 transitions.
Incomplete random walk after 10000 steps, including 1453 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 913 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 661077 steps, run timeout after 3001 ms. (steps per millisecond=220 ) properties seen :{}
Probabilistic random walk after 661077 steps, saw 330613 distinct states, run finished after 3001 ms. (steps per millisecond=220 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 22:17:29] [INFO ] Invariant cache hit.
[2023-03-09 22:17:29] [INFO ] [Real]Absence check using 13 positive place invariants in 19 ms returned sat
[2023-03-09 22:17:29] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 10 ms returned sat
[2023-03-09 22:17:30] [INFO ] After 223ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:17:30] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:17:30] [INFO ] After 248ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:17:30] [INFO ] After 551ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:17:30] [INFO ] [Nat]Absence check using 13 positive place invariants in 24 ms returned sat
[2023-03-09 22:17:30] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-09 22:17:30] [INFO ] After 197ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:17:30] [INFO ] After 79ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:17:30] [INFO ] After 105ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-09 22:17:30] [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 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 4 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 206/206 places, 212/212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 5 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2023-03-09 22:17:30] [INFO ] Invariant cache hit.
[2023-03-09 22:17:31] [INFO ] Implicit Places using invariants in 390 ms returned []
[2023-03-09 22:17:31] [INFO ] Invariant cache hit.
[2023-03-09 22:17:31] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:17:32] [INFO ] Implicit Places using invariants and state equation in 1782 ms returned []
Implicit Place search using SMT with State Equation took 2181 ms to find 0 implicit places.
[2023-03-09 22:17:32] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 22:17:32] [INFO ] Invariant cache hit.
[2023-03-09 22:17:33] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2390 ms. Remains : 206/206 places, 212/212 transitions.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 206 transition count 195
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 189 transition count 195
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 180 transition count 186
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 180 transition count 186
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 179 transition count 185
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 179 transition count 183
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 177 transition count 183
Applied a total of 58 rules in 11 ms. Remains 177 /206 variables (removed 29) and now considering 183/212 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 183 rows 177 cols
[2023-03-09 22:17:33] [INFO ] Computed 31 place invariants in 9 ms
[2023-03-09 22:17:33] [INFO ] [Real]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-03-09 22:17:33] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 22:17:33] [INFO ] After 158ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:17:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 22:17:33] [INFO ] After 14ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 22:17:33] [INFO ] After 39ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-09 22:17:33] [INFO ] After 276ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1414 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 896 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 525462 steps, run timeout after 3001 ms. (steps per millisecond=175 ) properties seen :{}
Probabilistic random walk after 525462 steps, saw 262792 distinct states, run finished after 3001 ms. (steps per millisecond=175 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 22:17:36] [INFO ] Computed 44 place invariants in 13 ms
[2023-03-09 22:17:36] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 22:17:36] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 32 ms returned sat
[2023-03-09 22:17:36] [INFO ] After 340ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:17:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 22:17:36] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 31 ms returned sat
[2023-03-09 22:17:37] [INFO ] After 248ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:17:37] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 22:17:37] [INFO ] After 124ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:17:37] [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-03-09 22:17:37] [INFO ] After 549ms 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 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 28 times.
Iterating global reduction 1 with 28 rules applied. Total rules applied 30 place count 254 transition count 219
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 58 place count 226 transition count 219
Partial Free-agglomeration rule applied 27 times.
Drop transitions removed 27 transitions
Iterating global reduction 2 with 27 rules applied. Total rules applied 85 place count 226 transition count 219
Applied a total of 85 rules in 21 ms. Remains 226 /255 variables (removed 29) and now considering 219/248 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 226/255 places, 219/248 transitions.
Incomplete random walk after 10000 steps, including 1421 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 946 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 607097 steps, run timeout after 3001 ms. (steps per millisecond=202 ) properties seen :{}
Probabilistic random walk after 607097 steps, saw 303609 distinct states, run finished after 3001 ms. (steps per millisecond=202 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 219 rows 226 cols
[2023-03-09 22:17:40] [INFO ] Computed 44 place invariants in 13 ms
[2023-03-09 22:17:40] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 22:17:40] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 22 ms returned sat
[2023-03-09 22:17:40] [INFO ] After 137ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:17:40] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:17:40] [INFO ] After 61ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:17:40] [INFO ] After 274ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:17:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 22:17:40] [INFO ] [Nat]Absence check using 3 positive and 41 generalized place invariants in 23 ms returned sat
[2023-03-09 22:17:40] [INFO ] After 211ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:17:41] [INFO ] After 115ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:17:41] [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 20 ms.
[2023-03-09 22:17:41] [INFO ] After 453ms 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 226 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 6 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 226/226 places, 219/219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 6 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2023-03-09 22:17:41] [INFO ] Invariant cache hit.
[2023-03-09 22:17:41] [INFO ] Implicit Places using invariants in 551 ms returned [25, 45, 50, 71, 76, 96, 102, 123, 128, 148, 153, 174, 180]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 552 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 213/226 places, 219/219 transitions.
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 213 transition count 212
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 206 transition count 212
Applied a total of 14 rules in 10 ms. Remains 206 /213 variables (removed 7) and now considering 212/219 (removed 7) transitions.
// Phase 1: matrix 212 rows 206 cols
[2023-03-09 22:17:41] [INFO ] Computed 31 place invariants in 17 ms
[2023-03-09 22:17:42] [INFO ] Implicit Places using invariants in 391 ms returned []
[2023-03-09 22:17:42] [INFO ] Invariant cache hit.
[2023-03-09 22:17:42] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:17:44] [INFO ] Implicit Places using invariants and state equation in 1950 ms returned []
Implicit Place search using SMT with State Equation took 2342 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 206/226 places, 212/219 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2910 ms. Remains : 206/226 places, 212/219 transitions.
Incomplete random walk after 10000 steps, including 1420 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 932 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 642993 steps, run timeout after 3001 ms. (steps per millisecond=214 ) properties seen :{}
Probabilistic random walk after 642993 steps, saw 321573 distinct states, run finished after 3001 ms. (steps per millisecond=214 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 22:17:47] [INFO ] Invariant cache hit.
[2023-03-09 22:17:47] [INFO ] [Real]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-03-09 22:17:47] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 22:17:47] [INFO ] After 150ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:17:47] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:17:47] [INFO ] After 301ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 22:17:47] [INFO ] After 331ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-09 22:17:47] [INFO ] After 572ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 5 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 206/206 places, 212/212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 5 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2023-03-09 22:17:47] [INFO ] Invariant cache hit.
[2023-03-09 22:17:48] [INFO ] Implicit Places using invariants in 387 ms returned []
[2023-03-09 22:17:48] [INFO ] Invariant cache hit.
[2023-03-09 22:17:48] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:17:50] [INFO ] Implicit Places using invariants and state equation in 2122 ms returned []
Implicit Place search using SMT with State Equation took 2511 ms to find 0 implicit places.
[2023-03-09 22:17:50] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 22:17:50] [INFO ] Invariant cache hit.
[2023-03-09 22:17:50] [INFO ] Dead Transitions using invariants and state equation in 196 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2718 ms. Remains : 206/206 places, 212/212 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 206 transition count 194
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 188 transition count 194
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 179 transition count 185
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 179 transition count 185
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 178 transition count 184
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 178 transition count 182
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 176 transition count 182
Applied a total of 60 rules in 10 ms. Remains 176 /206 variables (removed 30) and now considering 182/212 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 182 rows 176 cols
[2023-03-09 22:17:50] [INFO ] Computed 31 place invariants in 9 ms
[2023-03-09 22:17:50] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2023-03-09 22:17:50] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 22:17:50] [INFO ] After 119ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:17:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 22:17:50] [INFO ] After 9ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 22:17:50] [INFO ] After 24ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-09 22:17:50] [INFO ] After 216ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1432 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 891 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 612996 steps, run timeout after 3001 ms. (steps per millisecond=204 ) properties seen :{}
Probabilistic random walk after 612996 steps, saw 306565 distinct states, run finished after 3001 ms. (steps per millisecond=204 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 22:17:53] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 22:17:53] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 22:17:53] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 19 ms returned sat
[2023-03-09 22:17:53] [INFO ] After 150ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:17:53] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 22:17:53] [INFO ] After 48ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:17:53] [INFO ] After 275ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:17:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 22:17:53] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 19 ms returned sat
[2023-03-09 22:17:54] [INFO ] After 151ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:17:54] [INFO ] After 46ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:17:54] [INFO ] After 68ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-09 22:17:54] [INFO ] After 307ms 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 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 27 times.
Iterating global reduction 1 with 27 rules applied. Total rules applied 29 place count 254 transition count 220
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 56 place count 227 transition count 220
Partial Free-agglomeration rule applied 27 times.
Drop transitions removed 27 transitions
Iterating global reduction 2 with 27 rules applied. Total rules applied 83 place count 227 transition count 220
Applied a total of 83 rules in 12 ms. Remains 227 /255 variables (removed 28) and now considering 220/248 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 227/255 places, 220/248 transitions.
Incomplete random walk after 10000 steps, including 1447 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 944 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 677278 steps, run timeout after 3001 ms. (steps per millisecond=225 ) properties seen :{}
Probabilistic random walk after 677278 steps, saw 338708 distinct states, run finished after 3001 ms. (steps per millisecond=225 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 220 rows 227 cols
[2023-03-09 22:17:57] [INFO ] Computed 44 place invariants in 11 ms
[2023-03-09 22:17:57] [INFO ] [Real]Absence check using 10 positive place invariants in 17 ms returned sat
[2023-03-09 22:17:57] [INFO ] [Real]Absence check using 10 positive and 34 generalized place invariants in 19 ms returned sat
[2023-03-09 22:17:57] [INFO ] After 253ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:17:57] [INFO ] [Nat]Absence check using 10 positive place invariants in 17 ms returned sat
[2023-03-09 22:17:57] [INFO ] [Nat]Absence check using 10 positive and 34 generalized place invariants in 19 ms returned sat
[2023-03-09 22:17:57] [INFO ] After 148ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:17:57] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:17:57] [INFO ] After 206ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:17:57] [INFO ] After 227ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-09 22:17:58] [INFO ] After 478ms 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 227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 3 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 227/227 places, 220/220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 3 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
[2023-03-09 22:17:58] [INFO ] Invariant cache hit.
[2023-03-09 22:17:58] [INFO ] Implicit Places using invariants in 305 ms returned [25, 45, 50, 71, 76, 97, 103, 124, 129, 149, 154, 175, 181]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 306 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 214/227 places, 220/220 transitions.
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 214 transition count 214
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 208 transition count 214
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 208 transition count 214
Applied a total of 14 rules in 9 ms. Remains 208 /214 variables (removed 6) and now considering 214/220 (removed 6) transitions.
// Phase 1: matrix 214 rows 208 cols
[2023-03-09 22:17:58] [INFO ] Computed 31 place invariants in 12 ms
[2023-03-09 22:17:58] [INFO ] Implicit Places using invariants in 277 ms returned []
[2023-03-09 22:17:58] [INFO ] Invariant cache hit.
[2023-03-09 22:17:58] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:18:00] [INFO ] Implicit Places using invariants and state equation in 1955 ms returned []
Implicit Place search using SMT with State Equation took 2232 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 208/227 places, 214/220 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2551 ms. Remains : 208/227 places, 214/220 transitions.
Incomplete random walk after 10000 steps, including 1440 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 910 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 659097 steps, run timeout after 3001 ms. (steps per millisecond=219 ) properties seen :{}
Probabilistic random walk after 659097 steps, saw 329625 distinct states, run finished after 3001 ms. (steps per millisecond=219 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 22:18:03] [INFO ] Invariant cache hit.
[2023-03-09 22:18:03] [INFO ] [Real]Absence check using 13 positive place invariants in 18 ms returned sat
[2023-03-09 22:18:03] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 22:18:03] [INFO ] After 149ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:18:03] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:18:03] [INFO ] After 43ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 22:18:03] [INFO ] After 64ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-09 22:18:03] [INFO ] After 299ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 208/208 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-09 22:18:03] [INFO ] Invariant cache hit.
[2023-03-09 22:18:04] [INFO ] Implicit Places using invariants in 271 ms returned []
[2023-03-09 22:18:04] [INFO ] Invariant cache hit.
[2023-03-09 22:18:04] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:18:06] [INFO ] Implicit Places using invariants and state equation in 1916 ms returned []
Implicit Place search using SMT with State Equation took 2188 ms to find 0 implicit places.
[2023-03-09 22:18:06] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 22:18:06] [INFO ] Invariant cache hit.
[2023-03-09 22:18:06] [INFO ] Dead Transitions using invariants and state equation in 239 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2437 ms. Remains : 208/208 places, 214/214 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 208 transition count 196
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 190 transition count 196
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 181 transition count 187
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 181 transition count 187
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 180 transition count 186
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 180 transition count 184
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 178 transition count 184
Applied a total of 60 rules in 12 ms. Remains 178 /208 variables (removed 30) and now considering 184/214 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 184 rows 178 cols
[2023-03-09 22:18:06] [INFO ] Computed 31 place invariants in 12 ms
[2023-03-09 22:18:06] [INFO ] [Real]Absence check using 13 positive place invariants in 14 ms returned sat
[2023-03-09 22:18:06] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 22:18:06] [INFO ] After 127ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:18:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 22:18:06] [INFO ] After 12ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:18:06] [INFO ] After 207ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:18:06] [INFO ] [Nat]Absence check using 13 positive place invariants in 13 ms returned sat
[2023-03-09 22:18:06] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 22:18:06] [INFO ] After 140ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:18:06] [INFO ] After 9ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:18:06] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 0 ms to minimize.
[2023-03-09 22:18:06] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
[2023-03-09 22:18:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 177 ms
[2023-03-09 22:18:06] [INFO ] After 195ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-09 22:18:06] [INFO ] After 412ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1441 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 923 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 613716 steps, run timeout after 3001 ms. (steps per millisecond=204 ) properties seen :{}
Probabilistic random walk after 613716 steps, saw 306933 distinct states, run finished after 3001 ms. (steps per millisecond=204 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 22:18:10] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 22:18:10] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 22:18:10] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 22:18:10] [INFO ] After 236ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:18:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 22:18:10] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 22 ms returned sat
[2023-03-09 22:18:10] [INFO ] After 159ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:18:10] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 22:18:10] [INFO ] After 107ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:18:10] [INFO ] After 149ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-09 22:18:10] [INFO ] After 403ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 28 times.
Iterating global reduction 1 with 28 rules applied. Total rules applied 30 place count 254 transition count 219
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 58 place count 226 transition count 219
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 86 place count 226 transition count 219
Applied a total of 86 rules in 13 ms. Remains 226 /255 variables (removed 29) and now considering 219/248 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 226/255 places, 219/248 transitions.
Incomplete random walk after 10000 steps, including 1459 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 928 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 632694 steps, run timeout after 3001 ms. (steps per millisecond=210 ) properties seen :{}
Probabilistic random walk after 632694 steps, saw 316417 distinct states, run finished after 3001 ms. (steps per millisecond=210 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 219 rows 226 cols
[2023-03-09 22:18:13] [INFO ] Computed 44 place invariants in 12 ms
[2023-03-09 22:18:13] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 22:18:13] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 23 ms returned sat
[2023-03-09 22:18:13] [INFO ] After 155ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:18:13] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:18:14] [INFO ] After 160ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:18:14] [INFO ] After 397ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:18:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 22:18:14] [INFO ] [Nat]Absence check using 3 positive and 41 generalized place invariants in 24 ms returned sat
[2023-03-09 22:18:14] [INFO ] After 191ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:18:14] [INFO ] After 117ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:18:14] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 0 ms to minimize.
[2023-03-09 22:18:14] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 1 ms to minimize.
[2023-03-09 22:18:14] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 1 ms to minimize.
[2023-03-09 22:18:14] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 1 ms to minimize.
[2023-03-09 22:18:14] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 0 ms to minimize.
[2023-03-09 22:18:14] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 487 ms
[2023-03-09 22:18:15] [INFO ] After 637ms 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-03-09 22:18:15] [INFO ] After 930ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 226 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 4 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 226/226 places, 219/219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 4 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2023-03-09 22:18:15] [INFO ] Invariant cache hit.
[2023-03-09 22:18:15] [INFO ] Implicit Places using invariants in 503 ms returned [25, 45, 50, 71, 76, 96, 102, 123, 128, 148, 153, 174, 180]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 504 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 213/226 places, 219/219 transitions.
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 213 transition count 212
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 206 transition count 212
Applied a total of 14 rules in 8 ms. Remains 206 /213 variables (removed 7) and now considering 212/219 (removed 7) transitions.
// Phase 1: matrix 212 rows 206 cols
[2023-03-09 22:18:15] [INFO ] Computed 31 place invariants in 11 ms
[2023-03-09 22:18:15] [INFO ] Implicit Places using invariants in 313 ms returned []
[2023-03-09 22:18:15] [INFO ] Invariant cache hit.
[2023-03-09 22:18:16] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:18:17] [INFO ] Implicit Places using invariants and state equation in 2068 ms returned []
Implicit Place search using SMT with State Equation took 2382 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 206/226 places, 212/219 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2899 ms. Remains : 206/226 places, 212/219 transitions.
Incomplete random walk after 10000 steps, including 1472 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 896 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 597544 steps, run timeout after 3001 ms. (steps per millisecond=199 ) properties seen :{}
Probabilistic random walk after 597544 steps, saw 298832 distinct states, run finished after 3001 ms. (steps per millisecond=199 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 22:18:20] [INFO ] Invariant cache hit.
[2023-03-09 22:18:21] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 22:18:21] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 22:18:21] [INFO ] After 224ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:18:21] [INFO ] [Nat]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 22:18:21] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-09 22:18:21] [INFO ] After 152ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:18:21] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:18:21] [INFO ] After 56ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:18:21] [INFO ] After 97ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-09 22:18:21] [INFO ] After 341ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 206/206 places, 212/212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2023-03-09 22:18:21] [INFO ] Invariant cache hit.
[2023-03-09 22:18:21] [INFO ] Implicit Places using invariants in 281 ms returned []
[2023-03-09 22:18:21] [INFO ] Invariant cache hit.
[2023-03-09 22:18:21] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:18:24] [INFO ] Implicit Places using invariants and state equation in 2780 ms returned []
Implicit Place search using SMT with State Equation took 3063 ms to find 0 implicit places.
[2023-03-09 22:18:24] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 22:18:24] [INFO ] Invariant cache hit.
[2023-03-09 22:18:24] [INFO ] Dead Transitions using invariants and state equation in 242 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3316 ms. Remains : 206/206 places, 212/212 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 206 transition count 194
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 188 transition count 194
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 179 transition count 185
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 179 transition count 185
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 178 transition count 184
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 178 transition count 182
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 176 transition count 182
Applied a total of 60 rules in 12 ms. Remains 176 /206 variables (removed 30) and now considering 182/212 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 182 rows 176 cols
[2023-03-09 22:18:24] [INFO ] Computed 31 place invariants in 9 ms
[2023-03-09 22:18:24] [INFO ] [Real]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-03-09 22:18:24] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-09 22:18:25] [INFO ] After 192ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:18:25] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2023-03-09 22:18:25] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 22:18:25] [INFO ] After 155ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:18:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 22:18:25] [INFO ] After 11ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:18:25] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-09 22:18:25] [INFO ] After 258ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1398 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 919 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 628235 steps, run timeout after 3001 ms. (steps per millisecond=209 ) properties seen :{}
Probabilistic random walk after 628235 steps, saw 314190 distinct states, run finished after 3001 ms. (steps per millisecond=209 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 22:18:28] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 22:18:28] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 22:18:28] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 22:18:28] [INFO ] After 137ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:18:28] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 22:18:28] [INFO ] After 101ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 22:18:28] [INFO ] After 124ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 22:18:28] [INFO ] After 354ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 27 times.
Iterating global reduction 1 with 27 rules applied. Total rules applied 29 place count 254 transition count 220
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 56 place count 227 transition count 220
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 84 place count 227 transition count 220
Applied a total of 84 rules in 11 ms. Remains 227 /255 variables (removed 28) and now considering 220/248 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 227/255 places, 220/248 transitions.
Incomplete random walk after 10000 steps, including 1471 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 954 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 648667 steps, run timeout after 3001 ms. (steps per millisecond=216 ) properties seen :{}
Probabilistic random walk after 648667 steps, saw 324403 distinct states, run finished after 3001 ms. (steps per millisecond=216 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 220 rows 227 cols
[2023-03-09 22:18:31] [INFO ] Computed 44 place invariants in 12 ms
[2023-03-09 22:18:31] [INFO ] [Real]Absence check using 5 positive place invariants in 12 ms returned sat
[2023-03-09 22:18:31] [INFO ] [Real]Absence check using 5 positive and 39 generalized place invariants in 17 ms returned sat
[2023-03-09 22:18:32] [INFO ] After 236ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:18:32] [INFO ] [Nat]Absence check using 5 positive place invariants in 11 ms returned sat
[2023-03-09 22:18:32] [INFO ] [Nat]Absence check using 5 positive and 39 generalized place invariants in 16 ms returned sat
[2023-03-09 22:18:32] [INFO ] After 161ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:18:32] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:18:32] [INFO ] After 159ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:18:32] [INFO ] After 181ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 22:18:32] [INFO ] After 438ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 3 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 227/227 places, 220/220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 3 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
[2023-03-09 22:18:32] [INFO ] Invariant cache hit.
[2023-03-09 22:18:32] [INFO ] Implicit Places using invariants in 514 ms returned [25, 45, 50, 71, 76, 97, 103, 124, 129, 149, 154, 175, 181]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 515 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 214/227 places, 220/220 transitions.
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 214 transition count 213
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 207 transition count 213
Applied a total of 14 rules in 7 ms. Remains 207 /214 variables (removed 7) and now considering 213/220 (removed 7) transitions.
// Phase 1: matrix 213 rows 207 cols
[2023-03-09 22:18:32] [INFO ] Computed 31 place invariants in 11 ms
[2023-03-09 22:18:33] [INFO ] Implicit Places using invariants in 302 ms returned []
[2023-03-09 22:18:33] [INFO ] Invariant cache hit.
[2023-03-09 22:18:33] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:18:35] [INFO ] Implicit Places using invariants and state equation in 1907 ms returned []
Implicit Place search using SMT with State Equation took 2211 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 207/227 places, 213/220 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2737 ms. Remains : 207/227 places, 213/220 transitions.
Incomplete random walk after 10000 steps, including 1414 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 927 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 650534 steps, run timeout after 3001 ms. (steps per millisecond=216 ) properties seen :{}
Probabilistic random walk after 650534 steps, saw 325341 distinct states, run finished after 3001 ms. (steps per millisecond=216 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 22:18:38] [INFO ] Invariant cache hit.
[2023-03-09 22:18:38] [INFO ] [Real]Absence check using 13 positive place invariants in 18 ms returned sat
[2023-03-09 22:18:38] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 22:18:38] [INFO ] After 131ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:18:38] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:18:38] [INFO ] After 52ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:18:38] [INFO ] After 260ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:18:38] [INFO ] [Nat]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 22:18:38] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-09 22:18:38] [INFO ] After 126ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:18:38] [INFO ] After 52ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:18:38] [INFO ] After 71ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-09 22:18:38] [INFO ] After 284ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 213/213 transitions.
Applied a total of 0 rules in 4 ms. Remains 207 /207 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 207/207 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 213/213 transitions.
Applied a total of 0 rules in 3 ms. Remains 207 /207 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2023-03-09 22:18:38] [INFO ] Invariant cache hit.
[2023-03-09 22:18:39] [INFO ] Implicit Places using invariants in 282 ms returned []
[2023-03-09 22:18:39] [INFO ] Invariant cache hit.
[2023-03-09 22:18:39] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:18:41] [INFO ] Implicit Places using invariants and state equation in 2250 ms returned []
Implicit Place search using SMT with State Equation took 2534 ms to find 0 implicit places.
[2023-03-09 22:18:41] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 22:18:41] [INFO ] Invariant cache hit.
[2023-03-09 22:18:41] [INFO ] Dead Transitions using invariants and state equation in 315 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2861 ms. Remains : 207/207 places, 213/213 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 207 transition count 195
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 189 transition count 195
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 180 transition count 186
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 180 transition count 186
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 179 transition count 185
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 179 transition count 183
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 177 transition count 183
Applied a total of 60 rules in 19 ms. Remains 177 /207 variables (removed 30) and now considering 183/213 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 183 rows 177 cols
[2023-03-09 22:18:41] [INFO ] Computed 31 place invariants in 14 ms
[2023-03-09 22:18:41] [INFO ] [Real]Absence check using 13 positive place invariants in 17 ms returned sat
[2023-03-09 22:18:41] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-09 22:18:41] [INFO ] After 113ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:18:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 22:18:41] [INFO ] After 13ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 22:18:41] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 0 ms to minimize.
[2023-03-09 22:18:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2023-03-09 22:18:41] [INFO ] After 99ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:18:41] [INFO ] After 305ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:18:42] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-03-09 22:18:42] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 22:18:42] [INFO ] After 107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:18:42] [INFO ] After 9ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:18:42] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 0 ms to minimize.
[2023-03-09 22:18:42] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 1 ms to minimize.
[2023-03-09 22:18:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 172 ms
[2023-03-09 22:18:42] [INFO ] After 193ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 22:18:42] [INFO ] After 378ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1432 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 878 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 571109 steps, run timeout after 3001 ms. (steps per millisecond=190 ) properties seen :{}
Probabilistic random walk after 571109 steps, saw 285620 distinct states, run finished after 3001 ms. (steps per millisecond=190 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 22:18:45] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 22:18:45] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 22:18:45] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 22:18:45] [INFO ] After 138ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:18:45] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 22:18:45] [INFO ] After 130ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:18:45] [INFO ] After 348ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:18:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 22:18:45] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 22:18:45] [INFO ] After 134ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:18:46] [INFO ] After 111ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:18:46] [INFO ] After 134ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 22:18:46] [INFO ] After 366ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 28 times.
Iterating global reduction 1 with 28 rules applied. Total rules applied 30 place count 254 transition count 219
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 58 place count 226 transition count 219
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 86 place count 226 transition count 219
Applied a total of 86 rules in 13 ms. Remains 226 /255 variables (removed 29) and now considering 219/248 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 226/255 places, 219/248 transitions.
Incomplete random walk after 10000 steps, including 1429 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 909 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 647860 steps, run timeout after 3001 ms. (steps per millisecond=215 ) properties seen :{}
Probabilistic random walk after 647860 steps, saw 324000 distinct states, run finished after 3001 ms. (steps per millisecond=215 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 219 rows 226 cols
[2023-03-09 22:18:49] [INFO ] Computed 44 place invariants in 12 ms
[2023-03-09 22:18:49] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 22:18:49] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 24 ms returned sat
[2023-03-09 22:18:49] [INFO ] After 130ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:18:49] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:18:49] [INFO ] After 48ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 22:18:49] [INFO ] After 69ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 22:18:49] [INFO ] After 294ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 226 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 4 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 226/226 places, 219/219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 3 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2023-03-09 22:18:49] [INFO ] Invariant cache hit.
[2023-03-09 22:18:49] [INFO ] Implicit Places using invariants in 515 ms returned [25, 45, 50, 71, 76, 96, 102, 123, 128, 148, 153, 174, 180]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 516 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 213/226 places, 219/219 transitions.
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 213 transition count 212
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 206 transition count 212
Applied a total of 14 rules in 8 ms. Remains 206 /213 variables (removed 7) and now considering 212/219 (removed 7) transitions.
// Phase 1: matrix 212 rows 206 cols
[2023-03-09 22:18:49] [INFO ] Computed 31 place invariants in 11 ms
[2023-03-09 22:18:50] [INFO ] Implicit Places using invariants in 287 ms returned []
[2023-03-09 22:18:50] [INFO ] Invariant cache hit.
[2023-03-09 22:18:50] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:18:52] [INFO ] Implicit Places using invariants and state equation in 1923 ms returned []
Implicit Place search using SMT with State Equation took 2213 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 206/226 places, 212/219 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2741 ms. Remains : 206/226 places, 212/219 transitions.
Incomplete random walk after 10000 steps, including 1457 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 896 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 650520 steps, run timeout after 3001 ms. (steps per millisecond=216 ) properties seen :{}
Probabilistic random walk after 650520 steps, saw 325334 distinct states, run finished after 3001 ms. (steps per millisecond=216 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 22:18:55] [INFO ] Invariant cache hit.
[2023-03-09 22:18:55] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 22:18:55] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 22:18:55] [INFO ] After 133ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:18:55] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:18:55] [INFO ] After 60ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:18:55] [INFO ] After 268ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:18:55] [INFO ] [Nat]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 22:18:55] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 22:18:55] [INFO ] After 129ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:18:55] [INFO ] After 57ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:18:55] [INFO ] After 78ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-09 22:18:55] [INFO ] After 302ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 206/206 places, 212/212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2023-03-09 22:18:55] [INFO ] Invariant cache hit.
[2023-03-09 22:18:56] [INFO ] Implicit Places using invariants in 282 ms returned []
[2023-03-09 22:18:56] [INFO ] Invariant cache hit.
[2023-03-09 22:18:56] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:18:58] [INFO ] Implicit Places using invariants and state equation in 2614 ms returned []
Implicit Place search using SMT with State Equation took 2898 ms to find 0 implicit places.
[2023-03-09 22:18:58] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 22:18:58] [INFO ] Invariant cache hit.
[2023-03-09 22:18:58] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3068 ms. Remains : 206/206 places, 212/212 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 206 transition count 194
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 188 transition count 194
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 179 transition count 185
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 179 transition count 185
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 178 transition count 184
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 178 transition count 182
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 176 transition count 182
Applied a total of 60 rules in 11 ms. Remains 176 /206 variables (removed 30) and now considering 182/212 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 182 rows 176 cols
[2023-03-09 22:18:58] [INFO ] Computed 31 place invariants in 10 ms
[2023-03-09 22:18:58] [INFO ] [Real]Absence check using 13 positive place invariants in 13 ms returned sat
[2023-03-09 22:18:58] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 22:18:59] [INFO ] After 116ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:18:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 22:18:59] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:18:59] [INFO ] After 191ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:18:59] [INFO ] [Nat]Absence check using 13 positive place invariants in 13 ms returned sat
[2023-03-09 22:18:59] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 22:18:59] [INFO ] After 118ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:18:59] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:18:59] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-09 22:18:59] [INFO ] After 216ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1463 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 920 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 625125 steps, run timeout after 3001 ms. (steps per millisecond=208 ) properties seen :{}
Probabilistic random walk after 625125 steps, saw 312635 distinct states, run finished after 3001 ms. (steps per millisecond=208 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 22:19:02] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 22:19:02] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 22:19:02] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 22:19:02] [INFO ] After 197ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:19:02] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 22:19:02] [INFO ] After 71ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:19:02] [INFO ] After 348ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:19:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 22:19:02] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 22:19:03] [INFO ] After 275ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:19:03] [INFO ] After 111ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:19:03] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 0 ms to minimize.
[2023-03-09 22:19:03] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 0 ms to minimize.
[2023-03-09 22:19:03] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 0 ms to minimize.
[2023-03-09 22:19:03] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
[2023-03-09 22:19:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 413 ms
[2023-03-09 22:19:03] [INFO ] After 537ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-09 22:19:03] [INFO ] After 908ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 28 times.
Iterating global reduction 1 with 28 rules applied. Total rules applied 30 place count 254 transition count 219
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 58 place count 226 transition count 219
Partial Free-agglomeration rule applied 27 times.
Drop transitions removed 27 transitions
Iterating global reduction 2 with 27 rules applied. Total rules applied 85 place count 226 transition count 219
Applied a total of 85 rules in 13 ms. Remains 226 /255 variables (removed 29) and now considering 219/248 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 226/255 places, 219/248 transitions.
Incomplete random walk after 10000 steps, including 1447 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 925 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 646365 steps, run timeout after 3001 ms. (steps per millisecond=215 ) properties seen :{}
Probabilistic random walk after 646365 steps, saw 323255 distinct states, run finished after 3001 ms. (steps per millisecond=215 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 219 rows 226 cols
[2023-03-09 22:19:06] [INFO ] Computed 44 place invariants in 11 ms
[2023-03-09 22:19:06] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 22:19:06] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 25 ms returned sat
[2023-03-09 22:19:06] [INFO ] After 162ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:19:06] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:19:06] [INFO ] After 47ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:19:06] [INFO ] After 289ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:19:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 22:19:07] [INFO ] [Nat]Absence check using 3 positive and 41 generalized place invariants in 25 ms returned sat
[2023-03-09 22:19:07] [INFO ] After 159ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:19:07] [INFO ] After 65ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:19:07] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 0 ms to minimize.
[2023-03-09 22:19:07] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 0 ms to minimize.
[2023-03-09 22:19:07] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 1 ms to minimize.
[2023-03-09 22:19:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 300 ms
[2023-03-09 22:19:07] [INFO ] After 379ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-09 22:19:07] [INFO ] After 632ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 226 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 4 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 226/226 places, 219/219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 3 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2023-03-09 22:19:07] [INFO ] Invariant cache hit.
[2023-03-09 22:19:08] [INFO ] Implicit Places using invariants in 438 ms returned [25, 45, 50, 71, 76, 96, 102, 123, 128, 148, 153, 174, 180]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 453 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 213/226 places, 219/219 transitions.
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 213 transition count 212
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 206 transition count 212
Applied a total of 14 rules in 7 ms. Remains 206 /213 variables (removed 7) and now considering 212/219 (removed 7) transitions.
// Phase 1: matrix 212 rows 206 cols
[2023-03-09 22:19:08] [INFO ] Computed 31 place invariants in 11 ms
[2023-03-09 22:19:08] [INFO ] Implicit Places using invariants in 273 ms returned []
[2023-03-09 22:19:08] [INFO ] Invariant cache hit.
[2023-03-09 22:19:08] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:19:10] [INFO ] Implicit Places using invariants and state equation in 1985 ms returned []
Implicit Place search using SMT with State Equation took 2259 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 206/226 places, 212/219 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2723 ms. Remains : 206/226 places, 212/219 transitions.
Incomplete random walk after 10000 steps, including 1397 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 912 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 631185 steps, run timeout after 3001 ms. (steps per millisecond=210 ) properties seen :{}
Probabilistic random walk after 631185 steps, saw 315666 distinct states, run finished after 3001 ms. (steps per millisecond=210 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 22:19:13] [INFO ] Invariant cache hit.
[2023-03-09 22:19:13] [INFO ] [Real]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-03-09 22:19:13] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 22:19:13] [INFO ] After 140ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:19:13] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:19:13] [INFO ] After 54ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:19:13] [INFO ] After 263ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:19:13] [INFO ] [Nat]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-03-09 22:19:13] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-09 22:19:13] [INFO ] After 164ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:19:13] [INFO ] After 153ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:19:14] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 1 ms to minimize.
[2023-03-09 22:19:14] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 1 ms to minimize.
[2023-03-09 22:19:14] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 1 ms to minimize.
[2023-03-09 22:19:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 385 ms
[2023-03-09 22:19:14] [INFO ] After 558ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-09 22:19:14] [INFO ] After 810ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 5 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 206/206 places, 212/212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 5 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2023-03-09 22:19:14] [INFO ] Invariant cache hit.
[2023-03-09 22:19:14] [INFO ] Implicit Places using invariants in 401 ms returned []
[2023-03-09 22:19:14] [INFO ] Invariant cache hit.
[2023-03-09 22:19:15] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:19:17] [INFO ] Implicit Places using invariants and state equation in 2368 ms returned []
Implicit Place search using SMT with State Equation took 2771 ms to find 0 implicit places.
[2023-03-09 22:19:17] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 22:19:17] [INFO ] Invariant cache hit.
[2023-03-09 22:19:17] [INFO ] Dead Transitions using invariants and state equation in 286 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3071 ms. Remains : 206/206 places, 212/212 transitions.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 206 transition count 195
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 189 transition count 195
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 180 transition count 186
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 180 transition count 186
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 179 transition count 185
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 179 transition count 183
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 177 transition count 183
Applied a total of 58 rules in 18 ms. Remains 177 /206 variables (removed 29) and now considering 183/212 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 183 rows 177 cols
[2023-03-09 22:19:17] [INFO ] Computed 31 place invariants in 14 ms
[2023-03-09 22:19:17] [INFO ] [Real]Absence check using 13 positive place invariants in 20 ms returned sat
[2023-03-09 22:19:17] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-09 22:19:17] [INFO ] After 196ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:19:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 22:19:17] [INFO ] After 15ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 22:19:17] [INFO ] After 39ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-09 22:19:17] [INFO ] After 356ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1434 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 892 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 580659 steps, run timeout after 3001 ms. (steps per millisecond=193 ) properties seen :{}
Probabilistic random walk after 580659 steps, saw 290395 distinct states, run finished after 3001 ms. (steps per millisecond=193 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 22:19:20] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 22:19:20] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 22:19:20] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 22:19:21] [INFO ] After 141ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:19:21] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 22:19:21] [INFO ] After 98ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:19:21] [INFO ] After 316ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:19:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 22:19:21] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 22:19:21] [INFO ] After 138ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:19:21] [INFO ] After 120ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:19:21] [INFO ] After 143ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 22:19:21] [INFO ] After 373ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 26 times.
Iterating global reduction 1 with 26 rules applied. Total rules applied 28 place count 254 transition count 221
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 54 place count 228 transition count 221
Partial Free-agglomeration rule applied 30 times.
Drop transitions removed 30 transitions
Iterating global reduction 2 with 30 rules applied. Total rules applied 84 place count 228 transition count 221
Applied a total of 84 rules in 13 ms. Remains 228 /255 variables (removed 27) and now considering 221/248 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 228/255 places, 221/248 transitions.
Incomplete random walk after 10000 steps, including 1455 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 907 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 644760 steps, run timeout after 3001 ms. (steps per millisecond=214 ) properties seen :{}
Probabilistic random walk after 644760 steps, saw 322451 distinct states, run finished after 3001 ms. (steps per millisecond=214 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 221 rows 228 cols
[2023-03-09 22:19:24] [INFO ] Computed 44 place invariants in 10 ms
[2023-03-09 22:19:24] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2023-03-09 22:19:24] [INFO ] [Real]Absence check using 6 positive and 38 generalized place invariants in 36 ms returned sat
[2023-03-09 22:19:24] [INFO ] After 145ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:19:24] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:19:24] [INFO ] After 63ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 22:19:24] [INFO ] After 86ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-09 22:19:24] [INFO ] After 338ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 228 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 228/228 places, 221/221 transitions.
Applied a total of 0 rules in 3 ms. Remains 228 /228 variables (removed 0) and now considering 221/221 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 228/228 places, 221/221 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 228/228 places, 221/221 transitions.
Applied a total of 0 rules in 3 ms. Remains 228 /228 variables (removed 0) and now considering 221/221 (removed 0) transitions.
[2023-03-09 22:19:25] [INFO ] Invariant cache hit.
[2023-03-09 22:19:25] [INFO ] Implicit Places using invariants in 482 ms returned [25, 45, 50, 71, 76, 97, 103, 125, 130, 150, 155, 176, 182]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 488 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 215/228 places, 221/221 transitions.
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 215 transition count 214
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 208 transition count 214
Applied a total of 14 rules in 7 ms. Remains 208 /215 variables (removed 7) and now considering 214/221 (removed 7) transitions.
// Phase 1: matrix 214 rows 208 cols
[2023-03-09 22:19:25] [INFO ] Computed 31 place invariants in 11 ms
[2023-03-09 22:19:25] [INFO ] Implicit Places using invariants in 207 ms returned []
[2023-03-09 22:19:25] [INFO ] Invariant cache hit.
[2023-03-09 22:19:25] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:19:28] [INFO ] Implicit Places using invariants and state equation in 2392 ms returned []
Implicit Place search using SMT with State Equation took 2600 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 208/228 places, 214/221 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3099 ms. Remains : 208/228 places, 214/221 transitions.
Incomplete random walk after 10000 steps, including 1443 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 893 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 604774 steps, run timeout after 3001 ms. (steps per millisecond=201 ) properties seen :{}
Probabilistic random walk after 604774 steps, saw 302450 distinct states, run finished after 3004 ms. (steps per millisecond=201 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 22:19:31] [INFO ] Invariant cache hit.
[2023-03-09 22:19:31] [INFO ] [Real]Absence check using 13 positive place invariants in 19 ms returned sat
[2023-03-09 22:19:31] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 22:19:31] [INFO ] After 130ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:19:31] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:19:31] [INFO ] After 87ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:19:31] [INFO ] After 293ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:19:31] [INFO ] [Nat]Absence check using 13 positive place invariants in 20 ms returned sat
[2023-03-09 22:19:31] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 22:19:31] [INFO ] After 123ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:19:31] [INFO ] After 84ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:19:31] [INFO ] After 105ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-09 22:19:31] [INFO ] After 322ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 4 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 208/208 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-09 22:19:31] [INFO ] Invariant cache hit.
[2023-03-09 22:19:32] [INFO ] Implicit Places using invariants in 277 ms returned []
[2023-03-09 22:19:32] [INFO ] Invariant cache hit.
[2023-03-09 22:19:32] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:19:34] [INFO ] Implicit Places using invariants and state equation in 2222 ms returned []
Implicit Place search using SMT with State Equation took 2501 ms to find 0 implicit places.
[2023-03-09 22:19:34] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 22:19:34] [INFO ] Invariant cache hit.
[2023-03-09 22:19:34] [INFO ] Dead Transitions using invariants and state equation in 245 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2754 ms. Remains : 208/208 places, 214/214 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 208 transition count 196
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 190 transition count 196
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 181 transition count 187
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 181 transition count 187
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 180 transition count 186
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 180 transition count 184
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 178 transition count 184
Applied a total of 60 rules in 12 ms. Remains 178 /208 variables (removed 30) and now considering 184/214 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 184 rows 178 cols
[2023-03-09 22:19:34] [INFO ] Computed 31 place invariants in 9 ms
[2023-03-09 22:19:34] [INFO ] [Real]Absence check using 13 positive place invariants in 13 ms returned sat
[2023-03-09 22:19:34] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 22:19:34] [INFO ] After 130ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:19:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 22:19:34] [INFO ] After 11ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 22:19:34] [INFO ] After 30ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:19:34] [INFO ] After 225ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:19:34] [INFO ] [Nat]Absence check using 13 positive place invariants in 13 ms returned sat
[2023-03-09 22:19:34] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 22:19:34] [INFO ] After 129ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:19:34] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:19:35] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 0 ms to minimize.
[2023-03-09 22:19:35] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2023-03-09 22:19:35] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 0 ms to minimize.
[2023-03-09 22:19:35] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 0 ms to minimize.
[2023-03-09 22:19:35] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 0 ms to minimize.
[2023-03-09 22:19:35] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 363 ms
[2023-03-09 22:19:35] [INFO ] After 382ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-09 22:19:35] [INFO ] After 588ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1451 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 910 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 627770 steps, run timeout after 3001 ms. (steps per millisecond=209 ) properties seen :{}
Probabilistic random walk after 627770 steps, saw 313957 distinct states, run finished after 3001 ms. (steps per millisecond=209 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 22:19:38] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 22:19:38] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 22:19:38] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 22 ms returned sat
[2023-03-09 22:19:38] [INFO ] After 200ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:19:38] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 22:19:38] [INFO ] After 39ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 22:19:38] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 0 ms to minimize.
[2023-03-09 22:19:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2023-03-09 22:19:38] [INFO ] After 141ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:19:38] [INFO ] After 420ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:19:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 22:19:38] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 22 ms returned sat
[2023-03-09 22:19:39] [INFO ] After 186ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:19:39] [INFO ] After 50ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:19:39] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 0 ms to minimize.
[2023-03-09 22:19:39] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 0 ms to minimize.
[2023-03-09 22:19:39] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 1 ms to minimize.
[2023-03-09 22:19:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 275 ms
[2023-03-09 22:19:39] [INFO ] After 336ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 22:19:39] [INFO ] After 617ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 27 times.
Iterating global reduction 1 with 27 rules applied. Total rules applied 29 place count 254 transition count 220
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 56 place count 227 transition count 220
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 84 place count 227 transition count 220
Applied a total of 84 rules in 12 ms. Remains 227 /255 variables (removed 28) and now considering 220/248 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 227/255 places, 220/248 transitions.
Incomplete random walk after 10000 steps, including 1403 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 909 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 644583 steps, run timeout after 3001 ms. (steps per millisecond=214 ) properties seen :{}
Probabilistic random walk after 644583 steps, saw 322361 distinct states, run finished after 3001 ms. (steps per millisecond=214 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 220 rows 227 cols
[2023-03-09 22:19:42] [INFO ] Computed 44 place invariants in 12 ms
[2023-03-09 22:19:42] [INFO ] [Real]Absence check using 5 positive place invariants in 11 ms returned sat
[2023-03-09 22:19:42] [INFO ] [Real]Absence check using 5 positive and 39 generalized place invariants in 17 ms returned sat
[2023-03-09 22:19:42] [INFO ] After 145ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:19:42] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:19:42] [INFO ] After 132ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:19:42] [INFO ] After 358ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:19:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 11 ms returned sat
[2023-03-09 22:19:42] [INFO ] [Nat]Absence check using 5 positive and 39 generalized place invariants in 16 ms returned sat
[2023-03-09 22:19:43] [INFO ] After 141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:19:43] [INFO ] After 199ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:19:43] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 0 ms to minimize.
[2023-03-09 22:19:43] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 1 ms to minimize.
[2023-03-09 22:19:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 190 ms
[2023-03-09 22:19:43] [INFO ] After 400ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-09 22:19:43] [INFO ] After 635ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 3 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 227/227 places, 220/220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 3 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
[2023-03-09 22:19:43] [INFO ] Invariant cache hit.
[2023-03-09 22:19:44] [INFO ] Implicit Places using invariants in 574 ms returned [25, 45, 50, 71, 76, 97, 103, 124, 129, 149, 154, 175, 181]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 576 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 214/227 places, 220/220 transitions.
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 214 transition count 214
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 208 transition count 214
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 208 transition count 214
Applied a total of 14 rules in 15 ms. Remains 208 /214 variables (removed 6) and now considering 214/220 (removed 6) transitions.
// Phase 1: matrix 214 rows 208 cols
[2023-03-09 22:19:44] [INFO ] Computed 31 place invariants in 17 ms
[2023-03-09 22:19:44] [INFO ] Implicit Places using invariants in 298 ms returned []
[2023-03-09 22:19:44] [INFO ] Invariant cache hit.
[2023-03-09 22:19:44] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:19:46] [INFO ] Implicit Places using invariants and state equation in 2281 ms returned []
Implicit Place search using SMT with State Equation took 2579 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 208/227 places, 214/220 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3175 ms. Remains : 208/227 places, 214/220 transitions.
Incomplete random walk after 10000 steps, including 1443 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 934 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 648951 steps, run timeout after 3001 ms. (steps per millisecond=216 ) properties seen :{}
Probabilistic random walk after 648951 steps, saw 324553 distinct states, run finished after 3001 ms. (steps per millisecond=216 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 22:19:49] [INFO ] Invariant cache hit.
[2023-03-09 22:19:49] [INFO ] [Real]Absence check using 13 positive place invariants in 18 ms returned sat
[2023-03-09 22:19:49] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 22:19:49] [INFO ] After 209ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:19:49] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:19:50] [INFO ] After 83ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:19:50] [INFO ] After 367ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:19:50] [INFO ] [Nat]Absence check using 13 positive place invariants in 19 ms returned sat
[2023-03-09 22:19:50] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-09 22:19:50] [INFO ] After 157ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:19:50] [INFO ] After 80ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:19:50] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2023-03-09 22:19:50] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 0 ms to minimize.
[2023-03-09 22:19:50] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 0 ms to minimize.
[2023-03-09 22:19:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 258 ms
[2023-03-09 22:19:50] [INFO ] After 352ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-09 22:19:50] [INFO ] After 599ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 208/208 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-09 22:19:50] [INFO ] Invariant cache hit.
[2023-03-09 22:19:50] [INFO ] Implicit Places using invariants in 283 ms returned []
[2023-03-09 22:19:50] [INFO ] Invariant cache hit.
[2023-03-09 22:19:51] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:19:52] [INFO ] Implicit Places using invariants and state equation in 1761 ms returned []
Implicit Place search using SMT with State Equation took 2046 ms to find 0 implicit places.
[2023-03-09 22:19:52] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 22:19:52] [INFO ] Invariant cache hit.
[2023-03-09 22:19:52] [INFO ] Dead Transitions using invariants and state equation in 252 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2308 ms. Remains : 208/208 places, 214/214 transitions.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 208 transition count 197
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 191 transition count 197
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 182 transition count 188
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 182 transition count 188
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 181 transition count 187
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 181 transition count 185
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 179 transition count 185
Applied a total of 58 rules in 13 ms. Remains 179 /208 variables (removed 29) and now considering 185/214 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 185 rows 179 cols
[2023-03-09 22:19:52] [INFO ] Computed 31 place invariants in 10 ms
[2023-03-09 22:19:53] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-09 22:19:53] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 10 ms returned sat
[2023-03-09 22:19:53] [INFO ] After 112ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:19:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 22:19:53] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 22:19:53] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 0 ms to minimize.
[2023-03-09 22:19:53] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 0 ms to minimize.
[2023-03-09 22:19:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 158 ms
[2023-03-09 22:19:53] [INFO ] After 178ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:19:53] [INFO ] After 347ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:19:53] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-09 22:19:53] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 12 ms returned sat
[2023-03-09 22:19:53] [INFO ] After 122ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:19:53] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:19:53] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2023-03-09 22:19:53] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2023-03-09 22:19:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 154 ms
[2023-03-09 22:19:53] [INFO ] After 172ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-09 22:19:53] [INFO ] After 364ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1485 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 895 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 625663 steps, run timeout after 3001 ms. (steps per millisecond=208 ) properties seen :{}
Probabilistic random walk after 625663 steps, saw 312903 distinct states, run finished after 3004 ms. (steps per millisecond=208 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 22:19:56] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 22:19:56] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 22:19:56] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 22:19:57] [INFO ] After 187ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:19:57] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 22:19:57] [INFO ] After 37ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:19:57] [INFO ] After 308ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:19:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 22:19:57] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 22:19:57] [INFO ] After 184ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:19:57] [INFO ] After 37ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:19:57] [INFO ] After 60ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 22:19:57] [INFO ] After 338ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 25 times.
Iterating global reduction 1 with 25 rules applied. Total rules applied 27 place count 254 transition count 222
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 52 place count 229 transition count 222
Partial Free-agglomeration rule applied 29 times.
Drop transitions removed 29 transitions
Iterating global reduction 2 with 29 rules applied. Total rules applied 81 place count 229 transition count 222
Applied a total of 81 rules in 13 ms. Remains 229 /255 variables (removed 26) and now considering 222/248 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 229/255 places, 222/248 transitions.
Incomplete random walk after 10000 steps, including 1430 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 903 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 645724 steps, run timeout after 3001 ms. (steps per millisecond=215 ) properties seen :{}
Probabilistic random walk after 645724 steps, saw 322934 distinct states, run finished after 3001 ms. (steps per millisecond=215 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 222 rows 229 cols
[2023-03-09 22:20:00] [INFO ] Computed 44 place invariants in 13 ms
[2023-03-09 22:20:00] [INFO ] [Real]Absence check using 20 positive place invariants in 27 ms returned sat
[2023-03-09 22:20:00] [INFO ] [Real]Absence check using 20 positive and 24 generalized place invariants in 8 ms returned sat
[2023-03-09 22:20:00] [INFO ] After 151ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:20:00] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:20:00] [INFO ] After 179ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:20:00] [INFO ] After 422ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:20:00] [INFO ] [Nat]Absence check using 20 positive place invariants in 25 ms returned sat
[2023-03-09 22:20:00] [INFO ] [Nat]Absence check using 20 positive and 24 generalized place invariants in 7 ms returned sat
[2023-03-09 22:20:01] [INFO ] After 146ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:20:01] [INFO ] After 378ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:20:01] [INFO ] After 401ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 22:20:01] [INFO ] After 647ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 222/222 transitions.
Applied a total of 0 rules in 4 ms. Remains 229 /229 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 229/229 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 222/222 transitions.
Applied a total of 0 rules in 3 ms. Remains 229 /229 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2023-03-09 22:20:01] [INFO ] Invariant cache hit.
[2023-03-09 22:20:01] [INFO ] Implicit Places using invariants in 389 ms returned [25, 45, 50, 71, 76, 96, 125, 130, 151, 156, 177, 183]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 390 ms to find 12 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 217/229 places, 222/222 transitions.
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 217 transition count 216
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 211 transition count 216
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 211 transition count 216
Applied a total of 13 rules in 10 ms. Remains 211 /217 variables (removed 6) and now considering 216/222 (removed 6) transitions.
// Phase 1: matrix 216 rows 211 cols
[2023-03-09 22:20:01] [INFO ] Computed 32 place invariants in 11 ms
[2023-03-09 22:20:02] [INFO ] Implicit Places using invariants in 272 ms returned []
[2023-03-09 22:20:02] [INFO ] Invariant cache hit.
[2023-03-09 22:20:02] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:20:04] [INFO ] Implicit Places using invariants and state equation in 1937 ms returned []
Implicit Place search using SMT with State Equation took 2211 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 211/229 places, 216/222 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2619 ms. Remains : 211/229 places, 216/222 transitions.
Incomplete random walk after 10000 steps, including 1426 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 910 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 651763 steps, run timeout after 3001 ms. (steps per millisecond=217 ) properties seen :{}
Probabilistic random walk after 651763 steps, saw 325955 distinct states, run finished after 3001 ms. (steps per millisecond=217 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 22:20:07] [INFO ] Invariant cache hit.
[2023-03-09 22:20:07] [INFO ] [Real]Absence check using 14 positive place invariants in 17 ms returned sat
[2023-03-09 22:20:07] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 22:20:07] [INFO ] After 156ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:20:07] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:20:07] [INFO ] After 127ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:20:07] [INFO ] After 360ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:20:07] [INFO ] [Nat]Absence check using 14 positive place invariants in 17 ms returned sat
[2023-03-09 22:20:07] [INFO ] [Nat]Absence check using 14 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 22:20:07] [INFO ] After 135ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:20:07] [INFO ] After 102ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:20:07] [INFO ] After 123ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-09 22:20:07] [INFO ] After 347ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 211 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 211 /211 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 211/211 places, 216/216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 211 /211 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2023-03-09 22:20:07] [INFO ] Invariant cache hit.
[2023-03-09 22:20:08] [INFO ] Implicit Places using invariants in 262 ms returned []
[2023-03-09 22:20:08] [INFO ] Invariant cache hit.
[2023-03-09 22:20:08] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:20:10] [INFO ] Implicit Places using invariants and state equation in 1887 ms returned []
Implicit Place search using SMT with State Equation took 2149 ms to find 0 implicit places.
[2023-03-09 22:20:10] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 22:20:10] [INFO ] Invariant cache hit.
[2023-03-09 22:20:10] [INFO ] Dead Transitions using invariants and state equation in 234 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2393 ms. Remains : 211/211 places, 216/216 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 211 transition count 198
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 193 transition count 198
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 185 transition count 190
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 185 transition count 190
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 184 transition count 189
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 184 transition count 187
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 182 transition count 187
Applied a total of 58 rules in 12 ms. Remains 182 /211 variables (removed 29) and now considering 187/216 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 187 rows 182 cols
[2023-03-09 22:20:10] [INFO ] Computed 32 place invariants in 8 ms
[2023-03-09 22:20:10] [INFO ] [Real]Absence check using 14 positive place invariants in 14 ms returned sat
[2023-03-09 22:20:10] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 22:20:10] [INFO ] After 137ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:20:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 22:20:10] [INFO ] After 11ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 22:20:10] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 0 ms to minimize.
[2023-03-09 22:20:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2023-03-09 22:20:10] [INFO ] After 113ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:20:10] [INFO ] After 314ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:20:10] [INFO ] [Nat]Absence check using 14 positive place invariants in 13 ms returned sat
[2023-03-09 22:20:10] [INFO ] [Nat]Absence check using 14 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 22:20:10] [INFO ] After 132ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:20:10] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:20:10] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 0 ms to minimize.
[2023-03-09 22:20:10] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 0 ms to minimize.
[2023-03-09 22:20:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 161 ms
[2023-03-09 22:20:10] [INFO ] After 179ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-09 22:20:10] [INFO ] After 388ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1423 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 902 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 625775 steps, run timeout after 3001 ms. (steps per millisecond=208 ) properties seen :{}
Probabilistic random walk after 625775 steps, saw 312959 distinct states, run finished after 3001 ms. (steps per millisecond=208 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 22:20:14] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 22:20:14] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 22:20:14] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 22:20:14] [INFO ] After 159ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:20:14] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 22:20:14] [INFO ] After 50ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 22:20:14] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 0 ms to minimize.
[2023-03-09 22:20:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2023-03-09 22:20:14] [INFO ] After 163ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:20:14] [INFO ] After 404ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:20:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 22:20:14] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 22:20:14] [INFO ] After 152ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:20:14] [INFO ] After 78ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:20:14] [INFO ] After 101ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-09 22:20:14] [INFO ] After 355ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 28 times.
Iterating global reduction 1 with 28 rules applied. Total rules applied 30 place count 254 transition count 219
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 58 place count 226 transition count 219
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 86 place count 226 transition count 219
Applied a total of 86 rules in 13 ms. Remains 226 /255 variables (removed 29) and now considering 219/248 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 226/255 places, 219/248 transitions.
Incomplete random walk after 10000 steps, including 1470 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 940 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 645590 steps, run timeout after 3001 ms. (steps per millisecond=215 ) properties seen :{}
Probabilistic random walk after 645590 steps, saw 322865 distinct states, run finished after 3001 ms. (steps per millisecond=215 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 219 rows 226 cols
[2023-03-09 22:20:17] [INFO ] Computed 44 place invariants in 12 ms
[2023-03-09 22:20:17] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 22:20:17] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 26 ms returned sat
[2023-03-09 22:20:18] [INFO ] After 161ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:20:18] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:20:18] [INFO ] After 93ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:20:18] [INFO ] After 336ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:20:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 22:20:18] [INFO ] [Nat]Absence check using 3 positive and 41 generalized place invariants in 25 ms returned sat
[2023-03-09 22:20:18] [INFO ] After 141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:20:18] [INFO ] After 85ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:20:18] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 0 ms to minimize.
[2023-03-09 22:20:18] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2023-03-09 22:20:18] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 0 ms to minimize.
[2023-03-09 22:20:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 332 ms
[2023-03-09 22:20:18] [INFO ] After 436ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-09 22:20:18] [INFO ] After 683ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 226 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 4 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 226/226 places, 219/219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 3 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2023-03-09 22:20:18] [INFO ] Invariant cache hit.
[2023-03-09 22:20:19] [INFO ] Implicit Places using invariants in 474 ms returned [25, 45, 50, 71, 76, 96, 102, 123, 128, 148, 153, 174, 180]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 478 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 213/226 places, 219/219 transitions.
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 213 transition count 212
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 206 transition count 212
Applied a total of 14 rules in 7 ms. Remains 206 /213 variables (removed 7) and now considering 212/219 (removed 7) transitions.
// Phase 1: matrix 212 rows 206 cols
[2023-03-09 22:20:19] [INFO ] Computed 31 place invariants in 11 ms
[2023-03-09 22:20:19] [INFO ] Implicit Places using invariants in 214 ms returned []
[2023-03-09 22:20:19] [INFO ] Invariant cache hit.
[2023-03-09 22:20:19] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:20:21] [INFO ] Implicit Places using invariants and state equation in 1831 ms returned []
Implicit Place search using SMT with State Equation took 2047 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 206/226 places, 212/219 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2535 ms. Remains : 206/226 places, 212/219 transitions.
Incomplete random walk after 10000 steps, including 1437 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 884 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 649276 steps, run timeout after 3001 ms. (steps per millisecond=216 ) properties seen :{}
Probabilistic random walk after 649276 steps, saw 324712 distinct states, run finished after 3005 ms. (steps per millisecond=216 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 22:20:24] [INFO ] Invariant cache hit.
[2023-03-09 22:20:24] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 22:20:24] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 22:20:24] [INFO ] After 245ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:20:24] [INFO ] [Nat]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 22:20:24] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 22:20:24] [INFO ] After 168ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:20:24] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:20:25] [INFO ] After 301ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:20:25] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 0 ms to minimize.
[2023-03-09 22:20:25] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2023-03-09 22:20:25] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 0 ms to minimize.
[2023-03-09 22:20:25] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2023-03-09 22:20:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 334 ms
[2023-03-09 22:20:25] [INFO ] After 647ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 22:20:25] [INFO ] After 903ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 206/206 places, 212/212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 8 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2023-03-09 22:20:25] [INFO ] Invariant cache hit.
[2023-03-09 22:20:25] [INFO ] Implicit Places using invariants in 212 ms returned []
[2023-03-09 22:20:25] [INFO ] Invariant cache hit.
[2023-03-09 22:20:25] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:20:28] [INFO ] Implicit Places using invariants and state equation in 2176 ms returned []
Implicit Place search using SMT with State Equation took 2411 ms to find 0 implicit places.
[2023-03-09 22:20:28] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 22:20:28] [INFO ] Invariant cache hit.
[2023-03-09 22:20:28] [INFO ] Dead Transitions using invariants and state equation in 233 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2662 ms. Remains : 206/206 places, 212/212 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 206 transition count 194
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 188 transition count 194
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 179 transition count 185
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 179 transition count 185
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 178 transition count 184
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 178 transition count 182
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 176 transition count 182
Applied a total of 60 rules in 13 ms. Remains 176 /206 variables (removed 30) and now considering 182/212 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 182 rows 176 cols
[2023-03-09 22:20:28] [INFO ] Computed 31 place invariants in 10 ms
[2023-03-09 22:20:28] [INFO ] [Real]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-03-09 22:20:28] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 22:20:28] [INFO ] After 170ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:20:28] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-03-09 22:20:28] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 22:20:28] [INFO ] After 130ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:20:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 22:20:28] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:20:28] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2023-03-09 22:20:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2023-03-09 22:20:28] [INFO ] After 97ms 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-03-09 22:20:28] [INFO ] After 314ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1452 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 918 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 612411 steps, run timeout after 3001 ms. (steps per millisecond=204 ) properties seen :{}
Probabilistic random walk after 612411 steps, saw 306268 distinct states, run finished after 3004 ms. (steps per millisecond=203 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 22:20:31] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 22:20:31] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 22:20:31] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 22:20:32] [INFO ] After 166ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:20:32] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 22:20:32] [INFO ] After 82ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:20:32] [INFO ] After 327ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:20:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 22:20:32] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 22:20:32] [INFO ] After 166ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:20:32] [INFO ] After 277ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:20:32] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2023-03-09 22:20:32] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 0 ms to minimize.
[2023-03-09 22:20:32] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 0 ms to minimize.
[2023-03-09 22:20:32] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 0 ms to minimize.
[2023-03-09 22:20:33] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 372 ms
[2023-03-09 22:20:33] [INFO ] After 670ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 115 ms.
[2023-03-09 22:20:33] [INFO ] After 1033ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 28 times.
Iterating global reduction 1 with 28 rules applied. Total rules applied 30 place count 254 transition count 219
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 58 place count 226 transition count 219
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 86 place count 226 transition count 219
Applied a total of 86 rules in 13 ms. Remains 226 /255 variables (removed 29) and now considering 219/248 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 226/255 places, 219/248 transitions.
Incomplete random walk after 10000 steps, including 1418 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 913 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 645531 steps, run timeout after 3001 ms. (steps per millisecond=215 ) properties seen :{}
Probabilistic random walk after 645531 steps, saw 322836 distinct states, run finished after 3001 ms. (steps per millisecond=215 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 219 rows 226 cols
[2023-03-09 22:20:36] [INFO ] Computed 44 place invariants in 11 ms
[2023-03-09 22:20:36] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 22:20:36] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 25 ms returned sat
[2023-03-09 22:20:36] [INFO ] After 135ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:20:36] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:20:36] [INFO ] After 66ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:20:36] [INFO ] After 281ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:20:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 22:20:36] [INFO ] [Nat]Absence check using 3 positive and 41 generalized place invariants in 24 ms returned sat
[2023-03-09 22:20:36] [INFO ] After 141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:20:36] [INFO ] After 90ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:20:36] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 0 ms to minimize.
[2023-03-09 22:20:37] [INFO ] Deduced a trap composed of 56 places in 133 ms of which 1 ms to minimize.
[2023-03-09 22:20:37] [INFO ] Deduced a trap composed of 71 places in 130 ms of which 0 ms to minimize.
[2023-03-09 22:20:37] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 1 ms to minimize.
[2023-03-09 22:20:37] [INFO ] Deduced a trap composed of 61 places in 113 ms of which 1 ms to minimize.
[2023-03-09 22:20:37] [INFO ] Deduced a trap composed of 67 places in 128 ms of which 1 ms to minimize.
[2023-03-09 22:20:37] [INFO ] Deduced a trap composed of 65 places in 114 ms of which 0 ms to minimize.
[2023-03-09 22:20:38] [INFO ] Deduced a trap composed of 63 places in 115 ms of which 1 ms to minimize.
[2023-03-09 22:20:38] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2023-03-09 22:20:38] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 0 ms to minimize.
[2023-03-09 22:20:38] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 0 ms to minimize.
[2023-03-09 22:20:38] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1649 ms
[2023-03-09 22:20:38] [INFO ] After 1755ms 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-03-09 22:20:38] [INFO ] After 1998ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 226 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 3 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 226/226 places, 219/219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 3 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2023-03-09 22:20:38] [INFO ] Invariant cache hit.
[2023-03-09 22:20:39] [INFO ] Implicit Places using invariants in 497 ms returned [25, 45, 50, 71, 76, 96, 102, 123, 128, 148, 153, 174, 180]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 499 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 213/226 places, 219/219 transitions.
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 213 transition count 212
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 206 transition count 212
Applied a total of 14 rules in 7 ms. Remains 206 /213 variables (removed 7) and now considering 212/219 (removed 7) transitions.
// Phase 1: matrix 212 rows 206 cols
[2023-03-09 22:20:39] [INFO ] Computed 31 place invariants in 11 ms
[2023-03-09 22:20:39] [INFO ] Implicit Places using invariants in 309 ms returned []
[2023-03-09 22:20:39] [INFO ] Invariant cache hit.
[2023-03-09 22:20:39] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:20:41] [INFO ] Implicit Places using invariants and state equation in 1999 ms returned []
Implicit Place search using SMT with State Equation took 2309 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 206/226 places, 212/219 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2820 ms. Remains : 206/226 places, 212/219 transitions.
Incomplete random walk after 10000 steps, including 1417 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 917 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 649976 steps, run timeout after 3001 ms. (steps per millisecond=216 ) properties seen :{}
Probabilistic random walk after 649976 steps, saw 325060 distinct states, run finished after 3001 ms. (steps per millisecond=216 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 22:20:44] [INFO ] Invariant cache hit.
[2023-03-09 22:20:44] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 22:20:44] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 22:20:44] [INFO ] After 130ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:20:44] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:20:44] [INFO ] After 137ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:20:44] [INFO ] After 341ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:20:44] [INFO ] [Nat]Absence check using 13 positive place invariants in 17 ms returned sat
[2023-03-09 22:20:44] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 4 ms returned sat
[2023-03-09 22:20:44] [INFO ] After 134ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:20:45] [INFO ] After 120ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:20:45] [INFO ] Deduced a trap composed of 60 places in 100 ms of which 1 ms to minimize.
[2023-03-09 22:20:45] [INFO ] Deduced a trap composed of 60 places in 100 ms of which 0 ms to minimize.
[2023-03-09 22:20:45] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 1 ms to minimize.
[2023-03-09 22:20:45] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 0 ms to minimize.
[2023-03-09 22:20:45] [INFO ] Deduced a trap composed of 57 places in 108 ms of which 1 ms to minimize.
[2023-03-09 22:20:45] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 0 ms to minimize.
[2023-03-09 22:20:45] [INFO ] Deduced a trap composed of 59 places in 115 ms of which 0 ms to minimize.
[2023-03-09 22:20:46] [INFO ] Deduced a trap composed of 63 places in 110 ms of which 0 ms to minimize.
[2023-03-09 22:20:46] [INFO ] Deduced a trap composed of 64 places in 112 ms of which 1 ms to minimize.
[2023-03-09 22:20:46] [INFO ] Deduced a trap composed of 57 places in 101 ms of which 0 ms to minimize.
[2023-03-09 22:20:46] [INFO ] Deduced a trap composed of 61 places in 110 ms of which 1 ms to minimize.
[2023-03-09 22:20:46] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 1 ms to minimize.
[2023-03-09 22:20:46] [INFO ] Deduced a trap composed of 50 places in 109 ms of which 0 ms to minimize.
[2023-03-09 22:20:46] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1704 ms
[2023-03-09 22:20:46] [INFO ] After 1839ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-09 22:20:46] [INFO ] After 2070ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 206/206 places, 212/212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2023-03-09 22:20:46] [INFO ] Invariant cache hit.
[2023-03-09 22:20:47] [INFO ] Implicit Places using invariants in 284 ms returned []
[2023-03-09 22:20:47] [INFO ] Invariant cache hit.
[2023-03-09 22:20:47] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:20:49] [INFO ] Implicit Places using invariants and state equation in 1981 ms returned []
Implicit Place search using SMT with State Equation took 2267 ms to find 0 implicit places.
[2023-03-09 22:20:49] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 22:20:49] [INFO ] Invariant cache hit.
[2023-03-09 22:20:49] [INFO ] Dead Transitions using invariants and state equation in 238 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2515 ms. Remains : 206/206 places, 212/212 transitions.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 206 transition count 195
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 189 transition count 195
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 180 transition count 186
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 180 transition count 186
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 179 transition count 185
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 179 transition count 183
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 177 transition count 183
Applied a total of 58 rules in 13 ms. Remains 177 /206 variables (removed 29) and now considering 183/212 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 183 rows 177 cols
[2023-03-09 22:20:49] [INFO ] Computed 31 place invariants in 9 ms
[2023-03-09 22:20:49] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2023-03-09 22:20:49] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 4 ms returned sat
[2023-03-09 22:20:49] [INFO ] After 107ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:20:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 22:20:49] [INFO ] After 51ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:20:49] [INFO ] After 222ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:20:49] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-03-09 22:20:49] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 22:20:49] [INFO ] After 109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:20:49] [INFO ] After 54ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:20:49] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 0 ms to minimize.
[2023-03-09 22:20:49] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 0 ms to minimize.
[2023-03-09 22:20:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 114 ms
[2023-03-09 22:20:49] [INFO ] After 178ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-09 22:20:49] [INFO ] After 362ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1434 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 926 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 626477 steps, run timeout after 3001 ms. (steps per millisecond=208 ) properties seen :{}
Probabilistic random walk after 626477 steps, saw 313309 distinct states, run finished after 3001 ms. (steps per millisecond=208 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 22:20:52] [INFO ] Computed 44 place invariants in 11 ms
[2023-03-09 22:20:52] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 22:20:52] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 22:20:53] [INFO ] After 159ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:20:53] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 22:20:53] [INFO ] After 60ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:20:53] [INFO ] After 303ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:20:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 22:20:53] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 18 ms returned sat
[2023-03-09 22:20:53] [INFO ] After 155ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:20:53] [INFO ] After 78ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:20:53] [INFO ] After 101ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 22:20:53] [INFO ] After 346ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 27 times.
Iterating global reduction 1 with 27 rules applied. Total rules applied 29 place count 254 transition count 220
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 56 place count 227 transition count 220
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 84 place count 227 transition count 220
Applied a total of 84 rules in 13 ms. Remains 227 /255 variables (removed 28) and now considering 220/248 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 227/255 places, 220/248 transitions.
Incomplete random walk after 10000 steps, including 1437 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 896 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 643720 steps, run timeout after 3001 ms. (steps per millisecond=214 ) properties seen :{}
Probabilistic random walk after 643720 steps, saw 321933 distinct states, run finished after 3001 ms. (steps per millisecond=214 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 220 rows 227 cols
[2023-03-09 22:20:56] [INFO ] Computed 44 place invariants in 11 ms
[2023-03-09 22:20:56] [INFO ] [Real]Absence check using 5 positive place invariants in 10 ms returned sat
[2023-03-09 22:20:56] [INFO ] [Real]Absence check using 5 positive and 39 generalized place invariants in 20 ms returned sat
[2023-03-09 22:20:56] [INFO ] After 185ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:20:56] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:20:57] [INFO ] After 125ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:20:57] [INFO ] After 394ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:20:57] [INFO ] [Nat]Absence check using 5 positive place invariants in 9 ms returned sat
[2023-03-09 22:20:57] [INFO ] [Nat]Absence check using 5 positive and 39 generalized place invariants in 20 ms returned sat
[2023-03-09 22:20:57] [INFO ] After 187ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:20:57] [INFO ] After 114ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:20:57] [INFO ] After 136ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-09 22:20:57] [INFO ] After 416ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 4 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 227/227 places, 220/220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 3 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
[2023-03-09 22:20:57] [INFO ] Invariant cache hit.
[2023-03-09 22:20:57] [INFO ] Implicit Places using invariants in 490 ms returned [25, 45, 50, 71, 76, 103, 124, 129, 149, 154, 175, 181]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 491 ms to find 12 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 215/227 places, 220/220 transitions.
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 215 transition count 214
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 209 transition count 214
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 209 transition count 214
Applied a total of 13 rules in 11 ms. Remains 209 /215 variables (removed 6) and now considering 214/220 (removed 6) transitions.
// Phase 1: matrix 214 rows 209 cols
[2023-03-09 22:20:57] [INFO ] Computed 32 place invariants in 9 ms
[2023-03-09 22:20:58] [INFO ] Implicit Places using invariants in 291 ms returned []
[2023-03-09 22:20:58] [INFO ] Invariant cache hit.
[2023-03-09 22:20:58] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:21:00] [INFO ] Implicit Places using invariants and state equation in 2081 ms returned []
Implicit Place search using SMT with State Equation took 2373 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 209/227 places, 214/220 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2879 ms. Remains : 209/227 places, 214/220 transitions.
Incomplete random walk after 10000 steps, including 1412 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 913 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 668107 steps, run timeout after 3001 ms. (steps per millisecond=222 ) properties seen :{}
Probabilistic random walk after 668107 steps, saw 334129 distinct states, run finished after 3001 ms. (steps per millisecond=222 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 22:21:03] [INFO ] Invariant cache hit.
[2023-03-09 22:21:03] [INFO ] [Real]Absence check using 12 positive place invariants in 19 ms returned sat
[2023-03-09 22:21:03] [INFO ] [Real]Absence check using 12 positive and 20 generalized place invariants in 6 ms returned sat
[2023-03-09 22:21:03] [INFO ] After 131ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:21:03] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:21:03] [INFO ] After 101ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 22:21:03] [INFO ] After 120ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-09 22:21:03] [INFO ] After 336ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 209/209 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-09 22:21:03] [INFO ] Invariant cache hit.
[2023-03-09 22:21:04] [INFO ] Implicit Places using invariants in 374 ms returned []
[2023-03-09 22:21:04] [INFO ] Invariant cache hit.
[2023-03-09 22:21:04] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:21:06] [INFO ] Implicit Places using invariants and state equation in 2299 ms returned []
Implicit Place search using SMT with State Equation took 2674 ms to find 0 implicit places.
[2023-03-09 22:21:06] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 22:21:06] [INFO ] Invariant cache hit.
[2023-03-09 22:21:06] [INFO ] Dead Transitions using invariants and state equation in 209 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2893 ms. Remains : 209/209 places, 214/214 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 209 transition count 196
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 191 transition count 196
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 183 transition count 188
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 183 transition count 188
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 182 transition count 187
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 182 transition count 185
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 180 transition count 185
Applied a total of 58 rules in 12 ms. Remains 180 /209 variables (removed 29) and now considering 185/214 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 185 rows 180 cols
[2023-03-09 22:21:06] [INFO ] Computed 32 place invariants in 9 ms
[2023-03-09 22:21:06] [INFO ] [Real]Absence check using 14 positive place invariants in 12 ms returned sat
[2023-03-09 22:21:06] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 22:21:06] [INFO ] After 144ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:21:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 22:21:06] [INFO ] After 15ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 22:21:06] [INFO ] After 41ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-09 22:21:06] [INFO ] After 263ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1420 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 927 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 575731 steps, run timeout after 3001 ms. (steps per millisecond=191 ) properties seen :{}
Probabilistic random walk after 575731 steps, saw 287926 distinct states, run finished after 3001 ms. (steps per millisecond=191 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 22:21:09] [INFO ] Computed 44 place invariants in 8 ms
[2023-03-09 22:21:09] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 22:21:09] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 22:21:10] [INFO ] After 158ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:21:10] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 22:21:10] [INFO ] After 54ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:21:10] [INFO ] After 289ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:21:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 22:21:10] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 29 ms returned sat
[2023-03-09 22:21:10] [INFO ] After 256ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:21:10] [INFO ] After 89ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:21:10] [INFO ] After 125ms 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-03-09 22:21:10] [INFO ] After 497ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 25 times.
Iterating global reduction 1 with 25 rules applied. Total rules applied 27 place count 254 transition count 222
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 52 place count 229 transition count 222
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 80 place count 229 transition count 222
Applied a total of 80 rules in 18 ms. Remains 229 /255 variables (removed 26) and now considering 222/248 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 229/255 places, 222/248 transitions.
Incomplete random walk after 10000 steps, including 1425 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 893 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 632067 steps, run timeout after 3001 ms. (steps per millisecond=210 ) properties seen :{}
Probabilistic random walk after 632067 steps, saw 316107 distinct states, run finished after 3001 ms. (steps per millisecond=210 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 222 rows 229 cols
[2023-03-09 22:21:13] [INFO ] Computed 44 place invariants in 11 ms
[2023-03-09 22:21:13] [INFO ] [Real]Absence check using 5 positive place invariants in 9 ms returned sat
[2023-03-09 22:21:13] [INFO ] [Real]Absence check using 5 positive and 39 generalized place invariants in 16 ms returned sat
[2023-03-09 22:21:14] [INFO ] After 179ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:21:14] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:21:14] [INFO ] After 66ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:21:14] [INFO ] After 322ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:21:14] [INFO ] [Nat]Absence check using 5 positive place invariants in 8 ms returned sat
[2023-03-09 22:21:14] [INFO ] [Nat]Absence check using 5 positive and 39 generalized place invariants in 17 ms returned sat
[2023-03-09 22:21:14] [INFO ] After 221ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:21:14] [INFO ] After 196ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:21:14] [INFO ] After 224ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-09 22:21:14] [INFO ] After 537ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 222/222 transitions.
Applied a total of 0 rules in 4 ms. Remains 229 /229 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 229/229 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 222/222 transitions.
Applied a total of 0 rules in 4 ms. Remains 229 /229 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2023-03-09 22:21:14] [INFO ] Invariant cache hit.
[2023-03-09 22:21:15] [INFO ] Implicit Places using invariants in 436 ms returned [25, 45, 50, 71, 76, 126, 131, 151, 156, 177, 183]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 437 ms to find 11 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 218/229 places, 222/222 transitions.
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 218 transition count 216
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 212 transition count 216
Applied a total of 12 rules in 8 ms. Remains 212 /218 variables (removed 6) and now considering 216/222 (removed 6) transitions.
// Phase 1: matrix 216 rows 212 cols
[2023-03-09 22:21:15] [INFO ] Computed 33 place invariants in 12 ms
[2023-03-09 22:21:15] [INFO ] Implicit Places using invariants in 324 ms returned []
[2023-03-09 22:21:15] [INFO ] Invariant cache hit.
[2023-03-09 22:21:15] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:21:17] [INFO ] Implicit Places using invariants and state equation in 1859 ms returned []
Implicit Place search using SMT with State Equation took 2184 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 212/229 places, 216/222 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2635 ms. Remains : 212/229 places, 216/222 transitions.
Incomplete random walk after 10000 steps, including 1443 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 940 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 645218 steps, run timeout after 3001 ms. (steps per millisecond=215 ) properties seen :{}
Probabilistic random walk after 645218 steps, saw 322681 distinct states, run finished after 3001 ms. (steps per millisecond=215 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 22:21:20] [INFO ] Invariant cache hit.
[2023-03-09 22:21:20] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-09 22:21:20] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 17 ms returned sat
[2023-03-09 22:21:20] [INFO ] After 134ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:21:20] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:21:20] [INFO ] After 114ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:21:20] [INFO ] After 317ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:21:20] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-09 22:21:20] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 18 ms returned sat
[2023-03-09 22:21:20] [INFO ] After 207ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:21:21] [INFO ] After 392ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:21:21] [INFO ] After 413ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-09 22:21:21] [INFO ] After 703ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 212 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 212 /212 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 212/212 places, 216/216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 216/216 transitions.
Applied a total of 0 rules in 2 ms. Remains 212 /212 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2023-03-09 22:21:21] [INFO ] Invariant cache hit.
[2023-03-09 22:21:21] [INFO ] Implicit Places using invariants in 229 ms returned []
[2023-03-09 22:21:21] [INFO ] Invariant cache hit.
[2023-03-09 22:21:21] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:21:23] [INFO ] Implicit Places using invariants and state equation in 1715 ms returned []
Implicit Place search using SMT with State Equation took 1946 ms to find 0 implicit places.
[2023-03-09 22:21:23] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 22:21:23] [INFO ] Invariant cache hit.
[2023-03-09 22:21:23] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2138 ms. Remains : 212/212 places, 216/216 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 212 transition count 198
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 194 transition count 198
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 186 transition count 190
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 186 transition count 190
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 185 transition count 189
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 185 transition count 187
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 183 transition count 187
Applied a total of 58 rules in 11 ms. Remains 183 /212 variables (removed 29) and now considering 187/216 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 187 rows 183 cols
[2023-03-09 22:21:23] [INFO ] Computed 33 place invariants in 12 ms
[2023-03-09 22:21:23] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-09 22:21:23] [INFO ] [Real]Absence check using 8 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-09 22:21:23] [INFO ] After 114ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:21:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 22:21:23] [INFO ] After 9ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 22:21:23] [INFO ] After 26ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-09 22:21:23] [INFO ] After 210ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1398 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 908 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 614470 steps, run timeout after 3001 ms. (steps per millisecond=204 ) properties seen :{}
Probabilistic random walk after 614470 steps, saw 307309 distinct states, run finished after 3004 ms. (steps per millisecond=204 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 22:21:26] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 22:21:26] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 22:21:26] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 22:21:27] [INFO ] After 171ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:21:27] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 22:21:27] [INFO ] After 73ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:21:27] [INFO ] After 322ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:21:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 22:21:27] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-09 22:21:27] [INFO ] After 207ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:21:27] [INFO ] After 105ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:21:27] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 1 ms to minimize.
[2023-03-09 22:21:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2023-03-09 22:21:27] [INFO ] After 256ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 62 ms.
[2023-03-09 22:21:27] [INFO ] After 604ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 28 times.
Iterating global reduction 1 with 28 rules applied. Total rules applied 30 place count 254 transition count 219
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 58 place count 226 transition count 219
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 86 place count 226 transition count 219
Applied a total of 86 rules in 21 ms. Remains 226 /255 variables (removed 29) and now considering 219/248 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 226/255 places, 219/248 transitions.
Incomplete random walk after 10000 steps, including 1441 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 924 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 634217 steps, run timeout after 3001 ms. (steps per millisecond=211 ) properties seen :{}
Probabilistic random walk after 634217 steps, saw 317180 distinct states, run finished after 3001 ms. (steps per millisecond=211 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 219 rows 226 cols
[2023-03-09 22:21:30] [INFO ] Computed 44 place invariants in 11 ms
[2023-03-09 22:21:30] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 22:21:30] [INFO ] [Real]Absence check using 3 positive and 41 generalized place invariants in 33 ms returned sat
[2023-03-09 22:21:31] [INFO ] After 226ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:21:31] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:21:31] [INFO ] After 126ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 22:21:31] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 0 ms to minimize.
[2023-03-09 22:21:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 149 ms
[2023-03-09 22:21:31] [INFO ] After 333ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:21:31] [INFO ] After 671ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:21:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-09 22:21:31] [INFO ] [Nat]Absence check using 3 positive and 41 generalized place invariants in 32 ms returned sat
[2023-03-09 22:21:31] [INFO ] After 235ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:21:32] [INFO ] After 259ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:21:32] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 0 ms to minimize.
[2023-03-09 22:21:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2023-03-09 22:21:32] [INFO ] After 479ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-03-09 22:21:32] [INFO ] After 857ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 226 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 6 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 226/226 places, 219/219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 6 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2023-03-09 22:21:32] [INFO ] Invariant cache hit.
[2023-03-09 22:21:33] [INFO ] Implicit Places using invariants in 711 ms returned [25, 45, 50, 71, 76, 96, 102, 123, 128, 148, 153, 174, 180]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 713 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 213/226 places, 219/219 transitions.
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 213 transition count 212
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 206 transition count 212
Applied a total of 14 rules in 12 ms. Remains 206 /213 variables (removed 7) and now considering 212/219 (removed 7) transitions.
// Phase 1: matrix 212 rows 206 cols
[2023-03-09 22:21:33] [INFO ] Computed 31 place invariants in 17 ms
[2023-03-09 22:21:33] [INFO ] Implicit Places using invariants in 412 ms returned []
[2023-03-09 22:21:33] [INFO ] Invariant cache hit.
[2023-03-09 22:21:33] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:21:35] [INFO ] Implicit Places using invariants and state equation in 2399 ms returned []
Implicit Place search using SMT with State Equation took 2812 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 206/226 places, 212/219 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3544 ms. Remains : 206/226 places, 212/219 transitions.
Incomplete random walk after 10000 steps, including 1462 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 956 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 615469 steps, run timeout after 3001 ms. (steps per millisecond=205 ) properties seen :{}
Probabilistic random walk after 615469 steps, saw 307807 distinct states, run finished after 3001 ms. (steps per millisecond=205 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 22:21:38] [INFO ] Invariant cache hit.
[2023-03-09 22:21:38] [INFO ] [Real]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-03-09 22:21:38] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 22:21:39] [INFO ] After 159ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:21:39] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:21:39] [INFO ] After 99ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:21:39] [INFO ] After 326ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:21:39] [INFO ] [Nat]Absence check using 13 positive place invariants in 19 ms returned sat
[2023-03-09 22:21:39] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-09 22:21:39] [INFO ] After 262ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:21:39] [INFO ] After 154ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:21:39] [INFO ] After 184ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-09 22:21:39] [INFO ] After 548ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 5 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 206/206 places, 212/212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 4 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2023-03-09 22:21:39] [INFO ] Invariant cache hit.
[2023-03-09 22:21:40] [INFO ] Implicit Places using invariants in 393 ms returned []
[2023-03-09 22:21:40] [INFO ] Invariant cache hit.
[2023-03-09 22:21:40] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:21:42] [INFO ] Implicit Places using invariants and state equation in 1987 ms returned []
Implicit Place search using SMT with State Equation took 2390 ms to find 0 implicit places.
[2023-03-09 22:21:42] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 22:21:42] [INFO ] Invariant cache hit.
[2023-03-09 22:21:42] [INFO ] Dead Transitions using invariants and state equation in 307 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2712 ms. Remains : 206/206 places, 212/212 transitions.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 206 transition count 195
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 189 transition count 195
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 180 transition count 186
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 180 transition count 186
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 179 transition count 185
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 179 transition count 183
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 177 transition count 183
Applied a total of 58 rules in 18 ms. Remains 177 /206 variables (removed 29) and now considering 183/212 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 183 rows 177 cols
[2023-03-09 22:21:42] [INFO ] Computed 31 place invariants in 13 ms
[2023-03-09 22:21:42] [INFO ] [Real]Absence check using 13 positive place invariants in 19 ms returned sat
[2023-03-09 22:21:42] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 10 ms returned sat
[2023-03-09 22:21:42] [INFO ] After 170ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:21:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 22:21:42] [INFO ] After 18ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:21:42] [INFO ] After 279ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:21:42] [INFO ] [Nat]Absence check using 13 positive place invariants in 21 ms returned sat
[2023-03-09 22:21:42] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-09 22:21:43] [INFO ] After 181ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:21:43] [INFO ] After 14ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:21:43] [INFO ] After 42ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-09 22:21:43] [INFO ] After 333ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1460 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 907 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 606861 steps, run timeout after 3001 ms. (steps per millisecond=202 ) properties seen :{}
Probabilistic random walk after 606861 steps, saw 303491 distinct states, run finished after 3001 ms. (steps per millisecond=202 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 22:21:46] [INFO ] Computed 44 place invariants in 8 ms
[2023-03-09 22:21:46] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 22:21:46] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 20 ms returned sat
[2023-03-09 22:21:46] [INFO ] After 146ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:21:46] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 22:21:46] [INFO ] After 53ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:21:46] [INFO ] After 275ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:21:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 22:21:46] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 18 ms returned sat
[2023-03-09 22:21:46] [INFO ] After 157ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:21:46] [INFO ] After 50ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:21:46] [INFO ] After 71ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-09 22:21:46] [INFO ] After 322ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 27 times.
Iterating global reduction 1 with 27 rules applied. Total rules applied 29 place count 254 transition count 220
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 56 place count 227 transition count 220
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 84 place count 227 transition count 220
Applied a total of 84 rules in 15 ms. Remains 227 /255 variables (removed 28) and now considering 220/248 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 227/255 places, 220/248 transitions.
Incomplete random walk after 10000 steps, including 1460 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 911 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 662046 steps, run timeout after 3001 ms. (steps per millisecond=220 ) properties seen :{}
Probabilistic random walk after 662046 steps, saw 331100 distinct states, run finished after 3001 ms. (steps per millisecond=220 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 220 rows 227 cols
[2023-03-09 22:21:49] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 22:21:49] [INFO ] [Real]Absence check using 5 positive place invariants in 9 ms returned sat
[2023-03-09 22:21:49] [INFO ] [Real]Absence check using 5 positive and 39 generalized place invariants in 16 ms returned sat
[2023-03-09 22:21:50] [INFO ] After 158ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:21:50] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:21:50] [INFO ] After 46ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:21:50] [INFO ] After 280ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:21:50] [INFO ] [Nat]Absence check using 5 positive place invariants in 10 ms returned sat
[2023-03-09 22:21:50] [INFO ] [Nat]Absence check using 5 positive and 39 generalized place invariants in 16 ms returned sat
[2023-03-09 22:21:50] [INFO ] After 223ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:21:50] [INFO ] After 116ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:21:50] [INFO ] After 149ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-09 22:21:50] [INFO ] After 473ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 5 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 227/227 places, 220/220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 6 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
[2023-03-09 22:21:50] [INFO ] Invariant cache hit.
[2023-03-09 22:21:51] [INFO ] Implicit Places using invariants in 544 ms returned [25, 45, 50, 71, 76, 96, 124, 129, 149, 154, 175, 181]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 546 ms to find 12 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 215/227 places, 220/220 transitions.
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 215 transition count 214
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 209 transition count 214
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 209 transition count 214
Applied a total of 13 rules in 16 ms. Remains 209 /215 variables (removed 6) and now considering 214/220 (removed 6) transitions.
// Phase 1: matrix 214 rows 209 cols
[2023-03-09 22:21:51] [INFO ] Computed 32 place invariants in 14 ms
[2023-03-09 22:21:51] [INFO ] Implicit Places using invariants in 391 ms returned []
[2023-03-09 22:21:51] [INFO ] Invariant cache hit.
[2023-03-09 22:21:51] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:21:53] [INFO ] Implicit Places using invariants and state equation in 2337 ms returned []
Implicit Place search using SMT with State Equation took 2729 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 209/227 places, 214/220 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3298 ms. Remains : 209/227 places, 214/220 transitions.
Incomplete random walk after 10000 steps, including 1418 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 883 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 643622 steps, run timeout after 3001 ms. (steps per millisecond=214 ) properties seen :{}
Probabilistic random walk after 643622 steps, saw 321886 distinct states, run finished after 3001 ms. (steps per millisecond=214 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 22:21:56] [INFO ] Invariant cache hit.
[2023-03-09 22:21:56] [INFO ] [Real]Absence check using 14 positive place invariants in 21 ms returned sat
[2023-03-09 22:21:56] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 22:21:57] [INFO ] After 136ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:21:57] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:21:57] [INFO ] After 60ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:21:57] [INFO ] After 272ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:21:57] [INFO ] [Nat]Absence check using 14 positive place invariants in 20 ms returned sat
[2023-03-09 22:21:57] [INFO ] [Nat]Absence check using 14 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-09 22:21:57] [INFO ] After 217ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:21:57] [INFO ] After 92ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:21:57] [INFO ] After 125ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-09 22:21:57] [INFO ] After 436ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 214/214 transitions.
Applied a total of 0 rules in 5 ms. Remains 209 /209 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 209/209 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 214/214 transitions.
Applied a total of 0 rules in 5 ms. Remains 209 /209 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-09 22:21:57] [INFO ] Invariant cache hit.
[2023-03-09 22:21:58] [INFO ] Implicit Places using invariants in 371 ms returned []
[2023-03-09 22:21:58] [INFO ] Invariant cache hit.
[2023-03-09 22:21:58] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:22:00] [INFO ] Implicit Places using invariants and state equation in 2354 ms returned []
Implicit Place search using SMT with State Equation took 2727 ms to find 0 implicit places.
[2023-03-09 22:22:00] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 22:22:00] [INFO ] Invariant cache hit.
[2023-03-09 22:22:00] [INFO ] Dead Transitions using invariants and state equation in 244 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2983 ms. Remains : 209/209 places, 214/214 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 209 transition count 196
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 191 transition count 196
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 183 transition count 188
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 183 transition count 188
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 182 transition count 187
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 182 transition count 185
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 180 transition count 185
Applied a total of 58 rules in 16 ms. Remains 180 /209 variables (removed 29) and now considering 185/214 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 185 rows 180 cols
[2023-03-09 22:22:00] [INFO ] Computed 32 place invariants in 9 ms
[2023-03-09 22:22:00] [INFO ] [Real]Absence check using 14 positive place invariants in 16 ms returned sat
[2023-03-09 22:22:00] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-09 22:22:00] [INFO ] After 207ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:22:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 22:22:00] [INFO ] After 15ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 22:22:00] [INFO ] After 42ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-09 22:22:00] [INFO ] After 343ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1453 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 920 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 594491 steps, run timeout after 3001 ms. (steps per millisecond=198 ) properties seen :{}
Probabilistic random walk after 594491 steps, saw 297313 distinct states, run finished after 3001 ms. (steps per millisecond=198 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 22:22:04] [INFO ] Computed 44 place invariants in 9 ms
[2023-03-09 22:22:04] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 22:22:04] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 19 ms returned sat
[2023-03-09 22:22:04] [INFO ] After 187ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:22:04] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 22:22:04] [INFO ] After 82ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:22:04] [INFO ] After 346ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:22:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 22:22:04] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 34 ms returned sat
[2023-03-09 22:22:04] [INFO ] After 261ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:22:04] [INFO ] After 104ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:22:04] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 0 ms to minimize.
[2023-03-09 22:22:05] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 1 ms to minimize.
[2023-03-09 22:22:05] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 0 ms to minimize.
[2023-03-09 22:22:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 413 ms
[2023-03-09 22:22:05] [INFO ] After 537ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-09 22:22:05] [INFO ] After 962ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 28 times.
Iterating global reduction 1 with 28 rules applied. Total rules applied 30 place count 254 transition count 219
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 58 place count 226 transition count 219
Partial Free-agglomeration rule applied 27 times.
Drop transitions removed 27 transitions
Iterating global reduction 2 with 27 rules applied. Total rules applied 85 place count 226 transition count 219
Applied a total of 85 rules in 20 ms. Remains 226 /255 variables (removed 29) and now considering 219/248 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 226/255 places, 219/248 transitions.
Incomplete random walk after 10000 steps, including 1431 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 935 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 601893 steps, run timeout after 3001 ms. (steps per millisecond=200 ) properties seen :{}
Probabilistic random walk after 601893 steps, saw 301010 distinct states, run finished after 3001 ms. (steps per millisecond=200 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 219 rows 226 cols
[2023-03-09 22:22:08] [INFO ] Computed 44 place invariants in 11 ms
[2023-03-09 22:22:08] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 22:22:08] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 24 ms returned sat
[2023-03-09 22:22:08] [INFO ] After 153ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:22:08] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:22:08] [INFO ] After 96ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:22:08] [INFO ] After 326ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:22:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 22:22:08] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 36 ms returned sat
[2023-03-09 22:22:09] [INFO ] After 235ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:22:09] [INFO ] After 97ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:22:09] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 0 ms to minimize.
[2023-03-09 22:22:09] [INFO ] Deduced a trap composed of 12 places in 148 ms of which 1 ms to minimize.
[2023-03-09 22:22:09] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 1 ms to minimize.
[2023-03-09 22:22:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 496 ms
[2023-03-09 22:22:09] [INFO ] After 617ms 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-03-09 22:22:09] [INFO ] After 988ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 226 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 6 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 226/226 places, 219/219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 219/219 transitions.
Applied a total of 0 rules in 6 ms. Remains 226 /226 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2023-03-09 22:22:09] [INFO ] Invariant cache hit.
[2023-03-09 22:22:10] [INFO ] Implicit Places using invariants in 653 ms returned [25, 45, 50, 71, 76, 96, 102, 123, 128, 148, 153, 174, 180]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 655 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 213/226 places, 219/219 transitions.
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 213 transition count 213
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 207 transition count 213
Applied a total of 12 rules in 10 ms. Remains 207 /213 variables (removed 6) and now considering 213/219 (removed 6) transitions.
// Phase 1: matrix 213 rows 207 cols
[2023-03-09 22:22:10] [INFO ] Computed 31 place invariants in 17 ms
[2023-03-09 22:22:10] [INFO ] Implicit Places using invariants in 383 ms returned []
[2023-03-09 22:22:10] [INFO ] Invariant cache hit.
[2023-03-09 22:22:11] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:22:13] [INFO ] Implicit Places using invariants and state equation in 2836 ms returned []
Implicit Place search using SMT with State Equation took 3221 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 207/226 places, 213/219 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3893 ms. Remains : 207/226 places, 213/219 transitions.
Incomplete random walk after 10000 steps, including 1458 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 900 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 584943 steps, run timeout after 3001 ms. (steps per millisecond=194 ) properties seen :{}
Probabilistic random walk after 584943 steps, saw 292538 distinct states, run finished after 3001 ms. (steps per millisecond=194 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 22:22:16] [INFO ] Invariant cache hit.
[2023-03-09 22:22:16] [INFO ] [Real]Absence check using 13 positive place invariants in 20 ms returned sat
[2023-03-09 22:22:16] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-09 22:22:16] [INFO ] After 199ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:22:16] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:22:17] [INFO ] After 97ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 22:22:17] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2023-03-09 22:22:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2023-03-09 22:22:17] [INFO ] After 190ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:22:17] [INFO ] After 463ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:22:17] [INFO ] [Nat]Absence check using 13 positive place invariants in 20 ms returned sat
[2023-03-09 22:22:17] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-09 22:22:17] [INFO ] After 304ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:22:17] [INFO ] After 229ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:22:17] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 0 ms to minimize.
[2023-03-09 22:22:17] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 1 ms to minimize.
[2023-03-09 22:22:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 244 ms
[2023-03-09 22:22:18] [INFO ] After 495ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-09 22:22:18] [INFO ] After 904ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 213/213 transitions.
Applied a total of 0 rules in 5 ms. Remains 207 /207 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 207/207 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 213/213 transitions.
Applied a total of 0 rules in 4 ms. Remains 207 /207 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2023-03-09 22:22:18] [INFO ] Invariant cache hit.
[2023-03-09 22:22:18] [INFO ] Implicit Places using invariants in 373 ms returned []
[2023-03-09 22:22:18] [INFO ] Invariant cache hit.
[2023-03-09 22:22:18] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-09 22:22:20] [INFO ] Implicit Places using invariants and state equation in 2261 ms returned []
Implicit Place search using SMT with State Equation took 2636 ms to find 0 implicit places.
[2023-03-09 22:22:20] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 22:22:20] [INFO ] Invariant cache hit.
[2023-03-09 22:22:20] [INFO ] Dead Transitions using invariants and state equation in 216 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2864 ms. Remains : 207/207 places, 213/213 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 207 transition count 195
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 189 transition count 195
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 180 transition count 186
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 180 transition count 186
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 179 transition count 185
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 179 transition count 183
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 177 transition count 183
Applied a total of 60 rules in 18 ms. Remains 177 /207 variables (removed 30) and now considering 183/213 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 183 rows 177 cols
[2023-03-09 22:22:20] [INFO ] Computed 31 place invariants in 13 ms
[2023-03-09 22:22:21] [INFO ] [Real]Absence check using 13 positive place invariants in 21 ms returned sat
[2023-03-09 22:22:21] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-09 22:22:21] [INFO ] After 228ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 22:22:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 22:22:21] [INFO ] After 14ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 22:22:21] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 0 ms to minimize.
[2023-03-09 22:22:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2023-03-09 22:22:21] [INFO ] After 116ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:22:21] [INFO ] After 437ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:22:21] [INFO ] [Nat]Absence check using 13 positive place invariants in 18 ms returned sat
[2023-03-09 22:22:21] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 10 ms returned sat
[2023-03-09 22:22:21] [INFO ] After 286ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:22:21] [INFO ] After 14ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:22:21] [INFO ] After 37ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 22:22:21] [INFO ] After 427ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1463 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 924 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 545922 steps, run timeout after 3001 ms. (steps per millisecond=181 ) properties seen :{}
Probabilistic random walk after 545922 steps, saw 273024 distinct states, run finished after 3002 ms. (steps per millisecond=181 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 248 rows 255 cols
[2023-03-09 22:22:24] [INFO ] Computed 44 place invariants in 8 ms
[2023-03-09 22:22:24] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 22:22:24] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 22 ms returned sat
[2023-03-09 22:22:25] [INFO ] After 259ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 22:22:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 22:22:25] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 19 ms returned sat
[2023-03-09 22:22:25] [INFO ] After 223ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 22:22:25] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-09 22:22:25] [INFO ] After 52ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 22:22:25] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2023-03-09 22:22:25] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 0 ms to minimize.
[2023-03-09 22:22:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 173 ms
[2023-03-09 22:22:25] [INFO ] After 240ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-09 22:22:25] [INFO ] After 558ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 28 times.
Iterating global reduction 1 with 28 rules applied. Total rules applied 30 place count 254 transition count 219
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 58 place count 226 transition count 219
Partial Free-agglomeration rule applied 27 times.
Drop transitions removed 27 transitions
Iterating global reduction 2 with 27 rules applied. Total rules applied 85 place count 226 transition count 219
Applied a total of 85 rules in 15 ms. Remains 226 /255 variables (removed 29) and now considering 219/248 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 226/255 places, 219/248 transitions.
Incomplete random walk after 10000 steps, including 1464 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 950 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393216 kB
MemFree: 13869584 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16166044 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -timeout 180 -rebuildPNML

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="DoubleExponent-PT-010"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is DoubleExponent-PT-010, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r152-smll-167819439200297"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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