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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 7.6K Feb 26 13:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 13:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 26 13:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K 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.4K Feb 25 16:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 17K Feb 25 16:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 13:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 26 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Feb 26 13:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K 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 67K 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 StableMarking

=== Now, execution of the tool begins

BK_START 1678402672125

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DoubleExponent-PT-004
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-09 22:57:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-09 22:57:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 22:57:54] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2023-03-09 22:57:54] [INFO ] Transformed 216 places.
[2023-03-09 22:57:54] [INFO ] Transformed 198 transitions.
[2023-03-09 22:57:54] [INFO ] Parsed PT model containing 216 places and 198 transitions and 558 arcs in 203 ms.
Structural test allowed to assert that 11 places are NOT stable. Took 9 ms.
Incomplete random walk after 10000 steps, including 332 resets, run finished after 756 ms. (steps per millisecond=13 ) properties (out of 205) seen :44
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 101 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=8 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 101 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=12 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 161) seen :0
Running SMT prover for 161 properties.
// Phase 1: matrix 198 rows 216 cols
[2023-03-09 22:57:56] [INFO ] Computed 24 place invariants in 28 ms
[2023-03-09 22:57:58] [INFO ] After 2629ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:161
[2023-03-09 22:58:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2023-03-09 22:58:00] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 23 ms returned sat
[2023-03-09 22:58:03] [INFO ] After 2361ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :161
[2023-03-09 22:58:04] [INFO ] Deduced a trap composed of 63 places in 122 ms of which 13 ms to minimize.
[2023-03-09 22:58:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
[2023-03-09 22:58:04] [INFO ] Deduced a trap composed of 102 places in 120 ms of which 1 ms to minimize.
[2023-03-09 22:58:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 162 ms
[2023-03-09 22:58:04] [INFO ] Deduced a trap composed of 93 places in 255 ms of which 1 ms to minimize.
[2023-03-09 22:58:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 283 ms
[2023-03-09 22:58:04] [INFO ] Deduced a trap composed of 60 places in 74 ms of which 1 ms to minimize.
[2023-03-09 22:58:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2023-03-09 22:58:05] [INFO ] Deduced a trap composed of 96 places in 92 ms of which 1 ms to minimize.
[2023-03-09 22:58:05] [INFO ] Deduced a trap composed of 58 places in 93 ms of which 1 ms to minimize.
[2023-03-09 22:58:05] [INFO ] Deduced a trap composed of 64 places in 94 ms of which 1 ms to minimize.
[2023-03-09 22:58:05] [INFO ] Deduced a trap composed of 57 places in 101 ms of which 1 ms to minimize.
[2023-03-09 22:58:05] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 468 ms
[2023-03-09 22:58:06] [INFO ] Deduced a trap composed of 43 places in 406 ms of which 1 ms to minimize.
[2023-03-09 22:58:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 435 ms
[2023-03-09 22:58:06] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 0 ms to minimize.
[2023-03-09 22:58:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2023-03-09 22:58:06] [INFO ] Deduced a trap composed of 84 places in 91 ms of which 1 ms to minimize.
[2023-03-09 22:58:06] [INFO ] Deduced a trap composed of 68 places in 95 ms of which 1 ms to minimize.
[2023-03-09 22:58:06] [INFO ] Deduced a trap composed of 82 places in 88 ms of which 0 ms to minimize.
[2023-03-09 22:58:06] [INFO ] Deduced a trap composed of 47 places in 92 ms of which 0 ms to minimize.
[2023-03-09 22:58:06] [INFO ] Deduced a trap composed of 96 places in 89 ms of which 0 ms to minimize.
[2023-03-09 22:58:06] [INFO ] Deduced a trap composed of 86 places in 90 ms of which 1 ms to minimize.
[2023-03-09 22:58:07] [INFO ] Deduced a trap composed of 84 places in 89 ms of which 1 ms to minimize.
[2023-03-09 22:58:07] [INFO ] Deduced a trap composed of 68 places in 94 ms of which 0 ms to minimize.
[2023-03-09 22:58:07] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 856 ms
[2023-03-09 22:58:07] [INFO ] Deduced a trap composed of 69 places in 116 ms of which 1 ms to minimize.
[2023-03-09 22:58:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2023-03-09 22:58:08] [INFO ] Deduced a trap composed of 101 places in 94 ms of which 1 ms to minimize.
[2023-03-09 22:58:08] [INFO ] Deduced a trap composed of 52 places in 97 ms of which 1 ms to minimize.
[2023-03-09 22:58:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 233 ms
[2023-03-09 22:58:08] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 0 ms to minimize.
[2023-03-09 22:58:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2023-03-09 22:58:08] [INFO ] Deduced a trap composed of 54 places in 37 ms of which 1 ms to minimize.
[2023-03-09 22:58:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2023-03-09 22:58:09] [INFO ] Deduced a trap composed of 49 places in 50 ms of which 0 ms to minimize.
[2023-03-09 22:58:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2023-03-09 22:58:09] [INFO ] Deduced a trap composed of 60 places in 56 ms of which 0 ms to minimize.
[2023-03-09 22:58:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2023-03-09 22:58:10] [INFO ] Deduced a trap composed of 78 places in 126 ms of which 1 ms to minimize.
[2023-03-09 22:58:10] [INFO ] Deduced a trap composed of 73 places in 132 ms of which 1 ms to minimize.
[2023-03-09 22:58:10] [INFO ] Deduced a trap composed of 104 places in 123 ms of which 1 ms to minimize.
[2023-03-09 22:58:10] [INFO ] Deduced a trap composed of 70 places in 99 ms of which 1 ms to minimize.
[2023-03-09 22:58:10] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 580 ms
[2023-03-09 22:58:10] [INFO ] Deduced a trap composed of 88 places in 82 ms of which 1 ms to minimize.
[2023-03-09 22:58:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2023-03-09 22:58:11] [INFO ] After 9897ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :161
Attempting to minimize the solution found.
Minimization took 2238 ms.
[2023-03-09 22:58:13] [INFO ] After 14737ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :161
Fused 161 Parikh solutions to 149 different solutions.
Parikh walk visited 0 properties in 4721 ms.
Support contains 161 out of 216 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 216/216 places, 198/198 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 216 transition count 189
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 207 transition count 189
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 18 place count 207 transition count 187
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 205 transition count 187
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 50 place count 191 transition count 173
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 54 place count 189 transition count 173
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 189 transition count 172
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 188 transition count 172
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 59 place count 188 transition count 172
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 187 transition count 171
Applied a total of 60 rules in 79 ms. Remains 187 /216 variables (removed 29) and now considering 171/198 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 187/216 places, 171/198 transitions.
Interrupted random walk after 932605 steps, including 119023 resets, run timeout after 30001 ms. (steps per millisecond=31 ) properties seen 38
Incomplete Best-First random walk after 10000 steps, including 825 resets, run finished after 221 ms. (steps per millisecond=45 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10001 steps, including 848 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10001 steps, including 840 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 857 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 834 resets, run finished after 221 ms. (steps per millisecond=45 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 835 resets, run finished after 379 ms. (steps per millisecond=26 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10001 steps, including 855 resets, run finished after 333 ms. (steps per millisecond=30 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 832 resets, run finished after 245 ms. (steps per millisecond=40 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 865 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 876 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 831 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 842 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10001 steps, including 850 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 861 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 849 resets, run finished after 344 ms. (steps per millisecond=29 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 905 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 834 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10001 steps, including 855 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 850 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10001 steps, including 843 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 824 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 847 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 842 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10001 steps, including 816 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10001 steps, including 836 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 830 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10001 steps, including 826 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10001 steps, including 853 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 820 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10001 steps, including 839 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 851 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 812 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 838 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 845 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 851 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 838 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10001 steps, including 834 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 850 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 819 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10001 steps, including 841 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 824 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 793 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 824 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 839 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 818 resets, run finished after 206 ms. (steps per millisecond=48 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 828 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10001 steps, including 851 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 859 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10001 steps, including 840 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 820 resets, run finished after 239 ms. (steps per millisecond=41 ) properties (out of 123) seen :0
Running SMT prover for 123 properties.
// Phase 1: matrix 171 rows 187 cols
[2023-03-09 22:58:59] [INFO ] Computed 24 place invariants in 7 ms
[2023-03-09 22:58:59] [INFO ] After 727ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:123
[2023-03-09 22:59:00] [INFO ] [Nat]Absence check using 5 positive place invariants in 6 ms returned sat
[2023-03-09 22:59:00] [INFO ] [Nat]Absence check using 5 positive and 19 generalized place invariants in 8 ms returned sat
[2023-03-09 22:59:02] [INFO ] After 1286ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :123
[2023-03-09 22:59:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 22:59:03] [INFO ] After 1175ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :123
[2023-03-09 22:59:03] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 0 ms to minimize.
[2023-03-09 22:59:03] [INFO ] Deduced a trap composed of 47 places in 61 ms of which 0 ms to minimize.
[2023-03-09 22:59:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 174 ms
[2023-03-09 22:59:03] [INFO ] Deduced a trap composed of 88 places in 78 ms of which 1 ms to minimize.
[2023-03-09 22:59:03] [INFO ] Deduced a trap composed of 55 places in 98 ms of which 11 ms to minimize.
[2023-03-09 22:59:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 208 ms
[2023-03-09 22:59:03] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 1 ms to minimize.
[2023-03-09 22:59:04] [INFO ] Deduced a trap composed of 72 places in 77 ms of which 0 ms to minimize.
[2023-03-09 22:59:04] [INFO ] Deduced a trap composed of 53 places in 75 ms of which 0 ms to minimize.
[2023-03-09 22:59:04] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 1 ms to minimize.
[2023-03-09 22:59:04] [INFO ] Deduced a trap composed of 61 places in 82 ms of which 1 ms to minimize.
[2023-03-09 22:59:04] [INFO ] Deduced a trap composed of 83 places in 76 ms of which 0 ms to minimize.
[2023-03-09 22:59:04] [INFO ] Deduced a trap composed of 96 places in 104 ms of which 0 ms to minimize.
[2023-03-09 22:59:04] [INFO ] Deduced a trap composed of 50 places in 107 ms of which 0 ms to minimize.
[2023-03-09 22:59:04] [INFO ] Deduced a trap composed of 99 places in 111 ms of which 1 ms to minimize.
[2023-03-09 22:59:04] [INFO ] Deduced a trap composed of 70 places in 113 ms of which 0 ms to minimize.
[2023-03-09 22:59:04] [INFO ] Deduced a trap composed of 80 places in 99 ms of which 1 ms to minimize.
[2023-03-09 22:59:05] [INFO ] Deduced a trap composed of 46 places in 86 ms of which 1 ms to minimize.
[2023-03-09 22:59:05] [INFO ] Deduced a trap composed of 43 places in 100 ms of which 0 ms to minimize.
[2023-03-09 22:59:05] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1389 ms
[2023-03-09 22:59:05] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 0 ms to minimize.
[2023-03-09 22:59:05] [INFO ] Deduced a trap composed of 69 places in 95 ms of which 0 ms to minimize.
[2023-03-09 22:59:05] [INFO ] Deduced a trap composed of 77 places in 80 ms of which 4 ms to minimize.
[2023-03-09 22:59:05] [INFO ] Deduced a trap composed of 78 places in 85 ms of which 0 ms to minimize.
[2023-03-09 22:59:05] [INFO ] Deduced a trap composed of 45 places in 90 ms of which 1 ms to minimize.
[2023-03-09 22:59:06] [INFO ] Deduced a trap composed of 90 places in 92 ms of which 0 ms to minimize.
[2023-03-09 22:59:06] [INFO ] Deduced a trap composed of 67 places in 97 ms of which 1 ms to minimize.
[2023-03-09 22:59:06] [INFO ] Deduced a trap composed of 69 places in 91 ms of which 0 ms to minimize.
[2023-03-09 22:59:06] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 908 ms
[2023-03-09 22:59:06] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 16 ms to minimize.
[2023-03-09 22:59:06] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2023-03-09 22:59:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 179 ms
[2023-03-09 22:59:07] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2023-03-09 22:59:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2023-03-09 22:59:08] [INFO ] Deduced a trap composed of 56 places in 63 ms of which 0 ms to minimize.
[2023-03-09 22:59:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2023-03-09 22:59:08] [INFO ] After 6654ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :123
Attempting to minimize the solution found.
Minimization took 1455 ms.
[2023-03-09 22:59:10] [INFO ] After 10524ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :123
Fused 123 Parikh solutions to 118 different solutions.
Parikh walk visited 0 properties in 2139 ms.
Support contains 123 out of 187 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 187/187 places, 171/171 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 187 transition count 163
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 179 transition count 163
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 16 place count 179 transition count 162
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 178 transition count 162
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 34 place count 170 transition count 154
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 169 transition count 154
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 169 transition count 153
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 38 place count 168 transition count 153
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 42 place count 168 transition count 153
Applied a total of 42 rules in 44 ms. Remains 168 /187 variables (removed 19) and now considering 153/171 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 168/187 places, 153/171 transitions.
Interrupted random walk after 985616 steps, including 126394 resets, run timeout after 30001 ms. (steps per millisecond=32 ) properties seen 0
Incomplete Best-First random walk after 10000 steps, including 821 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 830 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 877 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 833 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 863 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 849 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 832 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 819 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 849 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 863 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 844 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 838 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 812 resets, run finished after 206 ms. (steps per millisecond=48 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 818 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10001 steps, including 846 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 847 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 839 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 855 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10001 steps, including 814 resets, run finished after 206 ms. (steps per millisecond=48 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 850 resets, run finished after 206 ms. (steps per millisecond=48 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 864 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 835 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 877 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10001 steps, including 848 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10001 steps, including 845 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 872 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10001 steps, including 825 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10001 steps, including 829 resets, run finished after 206 ms. (steps per millisecond=48 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10001 steps, including 828 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 839 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 851 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10001 steps, including 819 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 823 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 856 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 829 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 853 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 826 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 845 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 842 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10001 steps, including 842 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10001 steps, including 869 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 795 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 864 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 828 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10001 steps, including 867 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 860 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 841 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10001 steps, including 866 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10001 steps, including 854 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 857 resets, run finished after 234 ms. (steps per millisecond=42 ) properties (out of 123) seen :0
Interrupted probabilistic random walk after 5656275 steps, run timeout after 120001 ms. (steps per millisecond=47 ) properties seen :{0=1, 1=1, 2=1, 3=1, 4=1, 5=1, 6=1, 7=1, 8=1, 9=1, 10=1, 11=1, 12=1, 13=1, 14=1, 15=1, 16=1, 17=1, 18=1, 19=1, 20=1, 21=1, 22=1, 23=1, 24=1, 25=1, 26=1, 27=1, 28=1, 29=1, 30=1, 31=1, 32=1, 33=1, 34=1, 35=1, 36=1, 37=1, 38=1, 39=1, 40=1, 41=1, 42=1, 43=1, 44=1, 45=1, 46=1, 47=1, 48=1, 49=1, 50=1, 51=1, 52=1, 53=1, 54=1, 55=1, 56=1, 57=1, 58=1, 59=1, 60=1, 61=1, 62=1, 63=1, 64=1, 65=1, 69=1, 70=1, 71=1, 72=1, 73=1, 74=1, 75=1, 76=1, 77=1, 78=1, 79=1, 93=1, 94=1, 95=1, 96=1, 97=1, 98=1, 99=1, 100=1, 101=1, 102=1, 104=1, 105=1, 106=1, 107=1, 108=1, 109=1, 110=1, 111=1, 112=1, 113=1, 114=1, 115=1, 116=1, 117=1, 118=1, 119=1, 120=1, 121=1, 122=1}
Probabilistic random walk after 5656275 steps, saw 2827915 distinct states, run finished after 120005 ms. (steps per millisecond=47 ) properties seen :106
Running SMT prover for 17 properties.
// Phase 1: matrix 153 rows 168 cols
[2023-03-09 23:01:52] [INFO ] Computed 24 place invariants in 5 ms
[2023-03-09 23:01:53] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-09 23:01:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-09 23:01:53] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 11 ms returned sat
[2023-03-09 23:01:53] [INFO ] After 239ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2023-03-09 23:01:53] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-09 23:01:53] [INFO ] After 178ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :17
[2023-03-09 23:01:53] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2023-03-09 23:01:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2023-03-09 23:01:53] [INFO ] After 499ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 149 ms.
[2023-03-09 23:01:54] [INFO ] After 1090ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Fused 17 Parikh solutions to 16 different solutions.
Parikh walk visited 0 properties in 1895 ms.
Support contains 17 out of 168 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 153/153 transitions.
Graph (complete) has 354 edges and 168 vertex of which 165 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 165 transition count 126
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 55 place count 138 transition count 126
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 55 place count 138 transition count 122
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 63 place count 134 transition count 122
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 95 place count 118 transition count 106
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 101 place count 115 transition count 106
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 109 place count 115 transition count 98
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 117 place count 107 transition count 98
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 126 place count 107 transition count 98
Applied a total of 126 rules in 56 ms. Remains 107 /168 variables (removed 61) and now considering 98/153 (removed 55) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 107/168 places, 98/153 transitions.
Incomplete random walk after 1000000 steps, including 127971 resets, run finished after 25955 ms. (steps per millisecond=38 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8466 resets, run finished after 1817 ms. (steps per millisecond=55 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8460 resets, run finished after 1753 ms. (steps per millisecond=57 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 8470 resets, run finished after 1831 ms. (steps per millisecond=54 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8574 resets, run finished after 1637 ms. (steps per millisecond=61 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 8427 resets, run finished after 1790 ms. (steps per millisecond=55 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 8489 resets, run finished after 1820 ms. (steps per millisecond=54 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8403 resets, run finished after 1843 ms. (steps per millisecond=54 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8450 resets, run finished after 1817 ms. (steps per millisecond=55 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8422 resets, run finished after 1793 ms. (steps per millisecond=55 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8481 resets, run finished after 1745 ms. (steps per millisecond=57 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8487 resets, run finished after 1745 ms. (steps per millisecond=57 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 8400 resets, run finished after 1825 ms. (steps per millisecond=54 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 8504 resets, run finished after 1673 ms. (steps per millisecond=59 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 8575 resets, run finished after 1818 ms. (steps per millisecond=55 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 8421 resets, run finished after 1829 ms. (steps per millisecond=54 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8491 resets, run finished after 1863 ms. (steps per millisecond=53 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8407 resets, run finished after 1753 ms. (steps per millisecond=57 ) properties (out of 17) seen :0
Interrupted probabilistic random walk after 9410968 steps, run timeout after 168001 ms. (steps per millisecond=56 ) properties seen :{}
Probabilistic random walk after 9410968 steps, saw 4704334 distinct states, run finished after 168003 ms. (steps per millisecond=56 ) properties seen :0
Running SMT prover for 17 properties.
// Phase 1: matrix 98 rows 107 cols
[2023-03-09 23:05:40] [INFO ] Computed 22 place invariants in 12 ms
[2023-03-09 23:05:40] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-09 23:05:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 23:05:40] [INFO ] [Nat]Absence check using 2 positive and 20 generalized place invariants in 9 ms returned sat
[2023-03-09 23:05:40] [INFO ] After 150ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2023-03-09 23:05:40] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 23:05:40] [INFO ] After 142ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :17
[2023-03-09 23:05:41] [INFO ] After 356ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 132 ms.
[2023-03-09 23:05:41] [INFO ] After 786ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Fused 17 Parikh solutions to 16 different solutions.
Parikh walk visited 0 properties in 758 ms.
Support contains 17 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 98/98 transitions.
Applied a total of 0 rules in 6 ms. Remains 107 /107 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 107/107 places, 98/98 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 98/98 transitions.
Applied a total of 0 rules in 6 ms. Remains 107 /107 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2023-03-09 23:05:42] [INFO ] Invariant cache hit.
[2023-03-09 23:05:42] [INFO ] Implicit Places using invariants in 165 ms returned [20, 26, 41, 75, 80, 98, 104]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 169 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 100/107 places, 98/98 transitions.
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 2 place count 99 transition count 97
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 99 transition count 94
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 8 place count 96 transition count 94
Applied a total of 8 rules in 15 ms. Remains 96 /100 variables (removed 4) and now considering 94/98 (removed 4) transitions.
// Phase 1: matrix 94 rows 96 cols
[2023-03-09 23:05:42] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-09 23:05:42] [INFO ] Implicit Places using invariants in 121 ms returned []
[2023-03-09 23:05:42] [INFO ] Invariant cache hit.
[2023-03-09 23:05:42] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 23:05:42] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 472 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 96/107 places, 94/98 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 662 ms. Remains : 96/107 places, 94/98 transitions.
Incomplete random walk after 1000000 steps, including 144465 resets, run finished after 14105 ms. (steps per millisecond=70 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 9088 resets, run finished after 907 ms. (steps per millisecond=110 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 9035 resets, run finished after 940 ms. (steps per millisecond=106 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 9106 resets, run finished after 926 ms. (steps per millisecond=107 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 9153 resets, run finished after 938 ms. (steps per millisecond=106 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 9080 resets, run finished after 891 ms. (steps per millisecond=112 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 9175 resets, run finished after 902 ms. (steps per millisecond=110 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 9120 resets, run finished after 877 ms. (steps per millisecond=114 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 9139 resets, run finished after 932 ms. (steps per millisecond=107 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 9133 resets, run finished after 871 ms. (steps per millisecond=114 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 9037 resets, run finished after 895 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 9251 resets, run finished after 886 ms. (steps per millisecond=112 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 9178 resets, run finished after 885 ms. (steps per millisecond=112 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 9119 resets, run finished after 903 ms. (steps per millisecond=110 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 9062 resets, run finished after 1186 ms. (steps per millisecond=84 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 9100 resets, run finished after 1472 ms. (steps per millisecond=67 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 9213 resets, run finished after 1526 ms. (steps per millisecond=65 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 9269 resets, run finished after 1646 ms. (steps per millisecond=60 ) properties (out of 17) seen :0
Interrupted probabilistic random walk after 5571296 steps, run timeout after 93001 ms. (steps per millisecond=59 ) properties seen :{}
Probabilistic random walk after 5571296 steps, saw 2785211 distinct states, run finished after 93003 ms. (steps per millisecond=59 ) properties seen :0
Running SMT prover for 17 properties.
[2023-03-09 23:07:47] [INFO ] Invariant cache hit.
[2023-03-09 23:07:47] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-09 23:07:47] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-09 23:07:47] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-09 23:07:47] [INFO ] After 145ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2023-03-09 23:07:47] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 23:07:47] [INFO ] After 129ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :17
[2023-03-09 23:07:48] [INFO ] After 322ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 130 ms.
[2023-03-09 23:07:48] [INFO ] After 739ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Fused 17 Parikh solutions to 16 different solutions.
Parikh walk visited 0 properties in 1307 ms.
Support contains 17 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 94/94 transitions.
Applied a total of 0 rules in 16 ms. Remains 96 /96 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 96/96 places, 94/94 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 94/94 transitions.
Applied a total of 0 rules in 4 ms. Remains 96 /96 variables (removed 0) and now considering 94/94 (removed 0) transitions.
[2023-03-09 23:07:49] [INFO ] Invariant cache hit.
[2023-03-09 23:07:49] [INFO ] Implicit Places using invariants in 99 ms returned []
[2023-03-09 23:07:49] [INFO ] Invariant cache hit.
[2023-03-09 23:07:49] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 23:07:49] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
[2023-03-09 23:07:49] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 23:07:49] [INFO ] Invariant cache hit.
[2023-03-09 23:07:50] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 482 ms. Remains : 96/96 places, 94/94 transitions.
Incomplete random walk after 100000 steps, including 14505 resets, run finished after 2859 ms. (steps per millisecond=34 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
[2023-03-09 23:07:52] [INFO ] Invariant cache hit.
[2023-03-09 23:07:52] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-09 23:07:52] [INFO ] [Real]Absence check using 7 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-09 23:07:53] [INFO ] After 70ms SMT Verify possible using state equation in real domain returned unsat :0 sat :17
[2023-03-09 23:07:53] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 23:07:53] [INFO ] After 31ms SMT Verify possible using 12 Read/Feed constraints in real domain returned unsat :0 sat :17
[2023-03-09 23:07:53] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2023-03-09 23:07:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2023-03-09 23:07:53] [INFO ] After 284ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-09 23:07:53] [INFO ] After 413ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-09 23:07:53] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-09 23:07:53] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 2 ms returned sat
[2023-03-09 23:07:53] [INFO ] After 98ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2023-03-09 23:07:53] [INFO ] After 65ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :17
[2023-03-09 23:07:53] [INFO ] After 302ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-09 23:07:53] [INFO ] After 492ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Incomplete random walk after 1000000 steps, including 144085 resets, run finished after 25591 ms. (steps per millisecond=39 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 9208 resets, run finished after 1628 ms. (steps per millisecond=61 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 9087 resets, run finished after 1735 ms. (steps per millisecond=57 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 9086 resets, run finished after 1528 ms. (steps per millisecond=65 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 9030 resets, run finished after 1561 ms. (steps per millisecond=64 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 9125 resets, run finished after 1636 ms. (steps per millisecond=61 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 9192 resets, run finished after 1509 ms. (steps per millisecond=66 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 9094 resets, run finished after 1561 ms. (steps per millisecond=64 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 9192 resets, run finished after 1539 ms. (steps per millisecond=64 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 9148 resets, run finished after 1554 ms. (steps per millisecond=64 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 9135 resets, run finished after 1138 ms. (steps per millisecond=87 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 9216 resets, run finished after 1031 ms. (steps per millisecond=96 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 9065 resets, run finished after 878 ms. (steps per millisecond=113 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 9153 resets, run finished after 927 ms. (steps per millisecond=107 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 9257 resets, run finished after 885 ms. (steps per millisecond=112 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 9103 resets, run finished after 906 ms. (steps per millisecond=110 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 9105 resets, run finished after 900 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 9051 resets, run finished after 942 ms. (steps per millisecond=106 ) properties (out of 17) seen :0
Interrupted probabilistic random walk after 8839359 steps, run timeout after 141001 ms. (steps per millisecond=62 ) properties seen :{}
Probabilistic random walk after 8839359 steps, saw 4418421 distinct states, run finished after 141002 ms. (steps per millisecond=62 ) properties seen :0
Running SMT prover for 17 properties.
[2023-03-09 23:11:02] [INFO ] Invariant cache hit.
[2023-03-09 23:11:02] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-09 23:11:02] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2023-03-09 23:11:02] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-09 23:11:02] [INFO ] After 170ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2023-03-09 23:11:02] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 23:11:02] [INFO ] After 134ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :17
[2023-03-09 23:11:03] [INFO ] After 370ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 155 ms.
[2023-03-09 23:11:03] [INFO ] After 864ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Fused 17 Parikh solutions to 16 different solutions.
Parikh walk visited 0 properties in 1278 ms.
Support contains 17 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 94/94 transitions.
Applied a total of 0 rules in 4 ms. Remains 96 /96 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 96/96 places, 94/94 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 94/94 transitions.
Applied a total of 0 rules in 4 ms. Remains 96 /96 variables (removed 0) and now considering 94/94 (removed 0) transitions.
[2023-03-09 23:11:04] [INFO ] Invariant cache hit.
[2023-03-09 23:11:04] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-03-09 23:11:04] [INFO ] Invariant cache hit.
[2023-03-09 23:11:04] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 23:11:04] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
[2023-03-09 23:11:04] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-09 23:11:04] [INFO ] Invariant cache hit.
[2023-03-09 23:11:05] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 564 ms. Remains : 96/96 places, 94/94 transitions.
Incomplete random walk after 100000 steps, including 14535 resets, run finished after 3022 ms. (steps per millisecond=33 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
[2023-03-09 23:11:08] [INFO ] Invariant cache hit.
[2023-03-09 23:11:08] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-09 23:11:08] [INFO ] [Real]Absence check using 7 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-09 23:11:08] [INFO ] After 72ms SMT Verify possible using state equation in real domain returned unsat :0 sat :17
[2023-03-09 23:11:08] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 23:11:08] [INFO ] After 34ms SMT Verify possible using 12 Read/Feed constraints in real domain returned unsat :0 sat :17
[2023-03-09 23:11:08] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2023-03-09 23:11:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2023-03-09 23:11:08] [INFO ] After 321ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-09 23:11:08] [INFO ] After 455ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-09 23:11:08] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-09 23:11:08] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-09 23:11:08] [INFO ] After 103ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2023-03-09 23:11:08] [INFO ] After 70ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :17
[2023-03-09 23:11:09] [INFO ] After 301ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-09 23:11:09] [INFO ] After 515ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Incomplete random walk after 10000 steps, including 1455 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 926 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 804506 steps, run timeout after 3001 ms. (steps per millisecond=268 ) properties seen :{}
Probabilistic random walk after 804506 steps, saw 402343 distinct states, run finished after 3005 ms. (steps per millisecond=267 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 23:11:12] [INFO ] Invariant cache hit.
[2023-03-09 23:11:12] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:11:12] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2023-03-09 23:11:12] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-09 23:11:12] [INFO ] After 67ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:11:12] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 23:11:12] [INFO ] After 18ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:11:12] [INFO ] After 36ms 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 23:11:12] [INFO ] After 166ms 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 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 94/94 transitions.
Graph (complete) has 335 edges and 96 vertex of which 93 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 92 transition count 90
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 9 place count 90 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 89 transition count 89
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 10 place count 89 transition count 87
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 14 place count 87 transition count 87
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 20 place count 84 transition count 84
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 21 place count 84 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 22 place count 83 transition count 83
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 24 place count 83 transition count 83
Applied a total of 24 rules in 32 ms. Remains 83 /96 variables (removed 13) and now considering 83/94 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 83/96 places, 83/94 transitions.
Incomplete random walk after 10000 steps, including 1446 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 907 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1010672 steps, run timeout after 3001 ms. (steps per millisecond=336 ) properties seen :{}
Probabilistic random walk after 1010672 steps, saw 505445 distinct states, run finished after 3001 ms. (steps per millisecond=336 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 83 rows 83 cols
[2023-03-09 23:11:15] [INFO ] Computed 13 place invariants in 5 ms
[2023-03-09 23:11:15] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:11:15] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-09 23:11:15] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-09 23:11:15] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:11:15] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 23:11:15] [INFO ] After 16ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:11:15] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-09 23:11:15] [INFO ] After 124ms 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 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 83/83 transitions.
Applied a total of 0 rules in 3 ms. Remains 83 /83 variables (removed 0) and now considering 83/83 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 83/83 places, 83/83 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 83/83 transitions.
Applied a total of 0 rules in 3 ms. Remains 83 /83 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2023-03-09 23:11:15] [INFO ] Invariant cache hit.
[2023-03-09 23:11:15] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-09 23:11:15] [INFO ] Invariant cache hit.
[2023-03-09 23:11:15] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 23:11:15] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 436 ms to find 0 implicit places.
[2023-03-09 23:11:16] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-09 23:11:16] [INFO ] Invariant cache hit.
[2023-03-09 23:11:16] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 586 ms. Remains : 83/83 places, 83/83 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 83 transition count 82
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 82 transition count 82
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2 place count 82 transition count 76
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 76 transition count 76
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 17 place count 73 transition count 73
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 place count 73 transition count 73
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 2 with 2 rules applied. Total rules applied 22 place count 72 transition count 72
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 72 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 71 transition count 71
Applied a total of 24 rules in 26 ms. Remains 71 /83 variables (removed 12) and now considering 71/83 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 71 rows 71 cols
[2023-03-09 23:11:16] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-09 23:11:16] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:11:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 23:11:16] [INFO ] [Nat]Absence check using 3 positive and 10 generalized place invariants in 5 ms returned sat
[2023-03-09 23:11:16] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:11:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:11:16] [INFO ] After 9ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:11:16] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-09 23:11:16] [INFO ] After 122ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1436 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 938 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1038961 steps, run timeout after 3001 ms. (steps per millisecond=346 ) properties seen :{}
Probabilistic random walk after 1038961 steps, saw 519581 distinct states, run finished after 3001 ms. (steps per millisecond=346 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 96 cols
[2023-03-09 23:11:19] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-09 23:11:19] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:11:19] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-09 23:11:19] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-09 23:11:19] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:11:19] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 23:11:19] [INFO ] After 17ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:11:19] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-09 23:11:19] [INFO ] After 131ms 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 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 94/94 transitions.
Graph (complete) has 335 edges and 96 vertex of which 95 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 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 95 transition count 91
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 92 transition count 91
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 92 transition count 90
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 91 transition count 90
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 88 transition count 87
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 18 place count 88 transition count 84
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 21 place count 85 transition count 84
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 22 place count 85 transition count 84
Applied a total of 22 rules in 22 ms. Remains 85 /96 variables (removed 11) and now considering 84/94 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 85/96 places, 84/94 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 940 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 978917 steps, run timeout after 3001 ms. (steps per millisecond=326 ) properties seen :{}
Probabilistic random walk after 978917 steps, saw 489560 distinct states, run finished after 3001 ms. (steps per millisecond=326 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 84 rows 85 cols
[2023-03-09 23:11:22] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-09 23:11:22] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:11:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:11:22] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 5 ms returned sat
[2023-03-09 23:11:22] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:11:22] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 23:11:22] [INFO ] After 13ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:11:22] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-09 23:11:22] [INFO ] After 119ms 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 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 84/84 transitions.
Applied a total of 0 rules in 3 ms. Remains 85 /85 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 85/85 places, 84/84 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 84/84 transitions.
Applied a total of 0 rules in 3 ms. Remains 85 /85 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-09 23:11:22] [INFO ] Invariant cache hit.
[2023-03-09 23:11:22] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-09 23:11:22] [INFO ] Invariant cache hit.
[2023-03-09 23:11:22] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 23:11:23] [INFO ] Implicit Places using invariants and state equation in 382 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 492 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 84/85 places, 84/84 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 84 transition count 84
Applied a total of 1 rules in 9 ms. Remains 84 /84 variables (removed 0) and now considering 84/84 (removed 0) transitions.
// Phase 1: matrix 84 rows 84 cols
[2023-03-09 23:11:23] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-09 23:11:23] [INFO ] Implicit Places using invariants in 130 ms returned []
[2023-03-09 23:11:23] [INFO ] Invariant cache hit.
[2023-03-09 23:11:23] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 23:11:23] [INFO ] Implicit Places using invariants and state equation in 370 ms returned []
Implicit Place search using SMT with State Equation took 515 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 84/85 places, 84/84 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1020 ms. Remains : 84/85 places, 84/84 transitions.
Incomplete random walk after 10000 steps, including 1393 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 950 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1029018 steps, run timeout after 3001 ms. (steps per millisecond=342 ) properties seen :{}
Probabilistic random walk after 1029018 steps, saw 514621 distinct states, run finished after 3001 ms. (steps per millisecond=342 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 23:11:26] [INFO ] Invariant cache hit.
[2023-03-09 23:11:26] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:11:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:11:26] [INFO ] [Nat]Absence check using 2 positive and 11 generalized place invariants in 5 ms returned sat
[2023-03-09 23:11:26] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:11:26] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 23:11:26] [INFO ] After 16ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:11:26] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-09 23:11:26] [INFO ] After 121ms 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 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 84/84 transitions.
Applied a total of 0 rules in 3 ms. Remains 84 /84 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 84/84 places, 84/84 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 84/84 transitions.
Applied a total of 0 rules in 2 ms. Remains 84 /84 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-09 23:11:26] [INFO ] Invariant cache hit.
[2023-03-09 23:11:27] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-09 23:11:27] [INFO ] Invariant cache hit.
[2023-03-09 23:11:27] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 23:11:27] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
[2023-03-09 23:11:27] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 23:11:27] [INFO ] Invariant cache hit.
[2023-03-09 23:11:27] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 500 ms. Remains : 84/84 places, 84/84 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 84 transition count 77
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 77 transition count 77
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 74 transition count 74
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 74 transition count 74
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 22 place count 73 transition count 73
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 23 place count 73 transition count 72
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 24 place count 72 transition count 72
Applied a total of 24 rules in 18 ms. Remains 72 /84 variables (removed 12) and now considering 72/84 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 72 rows 72 cols
[2023-03-09 23:11:27] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-09 23:11:27] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:11:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:11:27] [INFO ] [Nat]Absence check using 2 positive and 11 generalized place invariants in 6 ms returned sat
[2023-03-09 23:11:27] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:11:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:11:27] [INFO ] After 8ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:11:27] [INFO ] After 20ms 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 23:11:27] [INFO ] After 146ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1470 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 897 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1010340 steps, run timeout after 3001 ms. (steps per millisecond=336 ) properties seen :{}
Probabilistic random walk after 1010340 steps, saw 505274 distinct states, run finished after 3001 ms. (steps per millisecond=336 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 96 cols
[2023-03-09 23:11:30] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-09 23:11:30] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:11:30] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-09 23:11:30] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 2 ms returned sat
[2023-03-09 23:11:30] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:11:30] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 23:11:30] [INFO ] After 16ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:11:30] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-09 23:11:30] [INFO ] After 122ms 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 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 94/94 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 96 transition count 90
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 92 transition count 90
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 8 place count 92 transition count 89
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 91 transition count 89
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 88 transition count 86
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 19 place count 88 transition count 83
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 22 place count 85 transition count 83
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 23 place count 85 transition count 83
Applied a total of 23 rules in 17 ms. Remains 85 /96 variables (removed 11) and now considering 83/94 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 85/96 places, 83/94 transitions.
Incomplete random walk after 10000 steps, including 1440 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 902 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 992291 steps, run timeout after 3001 ms. (steps per millisecond=330 ) properties seen :{}
Probabilistic random walk after 992291 steps, saw 496251 distinct states, run finished after 3001 ms. (steps per millisecond=330 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 83 rows 85 cols
[2023-03-09 23:11:33] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-09 23:11:33] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:11:33] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-09 23:11:33] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-09 23:11:34] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:11:34] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 23:11:34] [INFO ] After 17ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:11:34] [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 6 ms.
[2023-03-09 23:11:34] [INFO ] After 121ms 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 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 83/83 transitions.
Applied a total of 0 rules in 2 ms. Remains 85 /85 variables (removed 0) and now considering 83/83 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 85/85 places, 83/83 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 83/83 transitions.
Applied a total of 0 rules in 3 ms. Remains 85 /85 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2023-03-09 23:11:34] [INFO ] Invariant cache hit.
[2023-03-09 23:11:34] [INFO ] Implicit Places using invariants in 115 ms returned [37, 47]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 116 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 83/85 places, 83/83 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 83 transition count 81
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 81 transition count 81
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 81 transition count 81
Applied a total of 5 rules in 7 ms. Remains 81 /83 variables (removed 2) and now considering 81/83 (removed 2) transitions.
// Phase 1: matrix 81 rows 81 cols
[2023-03-09 23:11:34] [INFO ] Computed 13 place invariants in 3 ms
[2023-03-09 23:11:34] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-09 23:11:34] [INFO ] Invariant cache hit.
[2023-03-09 23:11:34] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 23:11:34] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 81/85 places, 81/83 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 500 ms. Remains : 81/85 places, 81/83 transitions.
Incomplete random walk after 10000 steps, including 1441 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 910 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 968926 steps, run timeout after 3001 ms. (steps per millisecond=322 ) properties seen :{}
Probabilistic random walk after 968926 steps, saw 484554 distinct states, run finished after 3001 ms. (steps per millisecond=322 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 23:11:37] [INFO ] Invariant cache hit.
[2023-03-09 23:11:37] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:11:37] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-09 23:11:37] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-09 23:11:37] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:11:37] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 23:11:37] [INFO ] After 17ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:11:37] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-09 23:11:37] [INFO ] After 116ms 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 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 3 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 81/81 places, 81/81 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2023-03-09 23:11:37] [INFO ] Invariant cache hit.
[2023-03-09 23:11:37] [INFO ] Implicit Places using invariants in 111 ms returned []
[2023-03-09 23:11:37] [INFO ] Invariant cache hit.
[2023-03-09 23:11:37] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 23:11:38] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
[2023-03-09 23:11:38] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 23:11:38] [INFO ] Invariant cache hit.
[2023-03-09 23:11:38] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 501 ms. Remains : 81/81 places, 81/81 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 81 transition count 75
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 75 transition count 75
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 72 transition count 72
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 72 transition count 72
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 20 place count 71 transition count 71
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 71 transition count 69
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 69 transition count 69
Applied a total of 24 rules in 9 ms. Remains 69 /81 variables (removed 12) and now considering 69/81 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 69 rows 69 cols
[2023-03-09 23:11:38] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-09 23:11:38] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:11:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-09 23:11:38] [INFO ] [Nat]Absence check using 3 positive and 10 generalized place invariants in 4 ms returned sat
[2023-03-09 23:11:38] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:11:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:11:38] [INFO ] After 4ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:11:38] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2023-03-09 23:11:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2023-03-09 23:11:38] [INFO ] After 53ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-09 23:11:38] [INFO ] After 127ms 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 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 936 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1030031 steps, run timeout after 3001 ms. (steps per millisecond=343 ) properties seen :{}
Probabilistic random walk after 1030031 steps, saw 515123 distinct states, run finished after 3001 ms. (steps per millisecond=343 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 96 cols
[2023-03-09 23:11:41] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-09 23:11:41] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:11:41] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-09 23:11:41] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 7 ms returned sat
[2023-03-09 23:11:41] [INFO ] After 57ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:11:41] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 23:11:41] [INFO ] After 18ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:11:41] [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 7 ms.
[2023-03-09 23:11:41] [INFO ] After 141ms 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 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 94/94 transitions.
Graph (complete) has 335 edges and 96 vertex of which 93 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 92 transition count 89
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 11 place count 89 transition count 88
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 88 transition count 88
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 12 place count 88 transition count 87
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 14 place count 87 transition count 87
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 20 place count 84 transition count 84
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 21 place count 84 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 22 place count 83 transition count 83
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 24 place count 83 transition count 83
Applied a total of 24 rules in 10 ms. Remains 83 /96 variables (removed 13) and now considering 83/94 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 83/96 places, 83/94 transitions.
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 10001 steps, including 901 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1049569 steps, run timeout after 3001 ms. (steps per millisecond=349 ) properties seen :{}
Probabilistic random walk after 1049569 steps, saw 524894 distinct states, run finished after 3001 ms. (steps per millisecond=349 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 83 rows 83 cols
[2023-03-09 23:11:44] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-09 23:11:44] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:11:44] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-09 23:11:44] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 5 ms returned sat
[2023-03-09 23:11:44] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:11:44] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 23:11:44] [INFO ] After 21ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:11:44] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-09 23:11:44] [INFO ] After 132ms 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 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 83/83 transitions.
Applied a total of 0 rules in 2 ms. Remains 83 /83 variables (removed 0) and now considering 83/83 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 83/83 places, 83/83 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 83/83 transitions.
Applied a total of 0 rules in 1 ms. Remains 83 /83 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2023-03-09 23:11:44] [INFO ] Invariant cache hit.
[2023-03-09 23:11:44] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-09 23:11:44] [INFO ] Invariant cache hit.
[2023-03-09 23:11:44] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 23:11:45] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
[2023-03-09 23:11:45] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 23:11:45] [INFO ] Invariant cache hit.
[2023-03-09 23:11:45] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 436 ms. Remains : 83/83 places, 83/83 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 83 transition count 82
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 82 transition count 82
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2 place count 82 transition count 76
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 76 transition count 76
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 17 place count 73 transition count 73
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 place count 73 transition count 73
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 2 with 2 rules applied. Total rules applied 22 place count 72 transition count 72
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 72 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 71 transition count 71
Applied a total of 24 rules in 9 ms. Remains 71 /83 variables (removed 12) and now considering 71/83 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 71 rows 71 cols
[2023-03-09 23:11:45] [INFO ] Computed 13 place invariants in 0 ms
[2023-03-09 23:11:45] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:11:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 23:11:45] [INFO ] [Nat]Absence check using 3 positive and 10 generalized place invariants in 4 ms returned sat
[2023-03-09 23:11:45] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:11:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:11:45] [INFO ] After 5ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:11:45] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-09 23:11:45] [INFO ] After 96ms 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 10001 steps, including 906 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1007745 steps, run timeout after 3001 ms. (steps per millisecond=335 ) properties seen :{}
Probabilistic random walk after 1007745 steps, saw 503974 distinct states, run finished after 3001 ms. (steps per millisecond=335 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 96 cols
[2023-03-09 23:11:48] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-09 23:11:48] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:11:48] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-09 23:11:48] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-09 23:11:48] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:11:48] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 23:11:48] [INFO ] After 27ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:11:48] [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 7 ms.
[2023-03-09 23:11:48] [INFO ] After 147ms 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 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 94/94 transitions.
Graph (complete) has 335 edges and 96 vertex of which 93 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 92 transition count 89
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 10 place count 89 transition count 89
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 10 place count 89 transition count 87
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 87 transition count 87
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 20 place count 84 transition count 84
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 84 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 83 transition count 83
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 83 transition count 83
Applied a total of 24 rules in 16 ms. Remains 83 /96 variables (removed 13) and now considering 83/94 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 83/96 places, 83/94 transitions.
Incomplete random walk after 10000 steps, including 1439 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 920 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1043014 steps, run timeout after 3001 ms. (steps per millisecond=347 ) properties seen :{}
Probabilistic random walk after 1043014 steps, saw 521615 distinct states, run finished after 3001 ms. (steps per millisecond=347 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 83 rows 83 cols
[2023-03-09 23:11:51] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-09 23:11:51] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:11:51] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-09 23:11:51] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-09 23:11:51] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:11:51] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 23:11:51] [INFO ] After 19ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:11:51] [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 7 ms.
[2023-03-09 23:11:51] [INFO ] After 132ms 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 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 83/83 transitions.
Applied a total of 0 rules in 1 ms. Remains 83 /83 variables (removed 0) and now considering 83/83 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 83/83 places, 83/83 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 83/83 transitions.
Applied a total of 0 rules in 1 ms. Remains 83 /83 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2023-03-09 23:11:51] [INFO ] Invariant cache hit.
[2023-03-09 23:11:51] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-09 23:11:51] [INFO ] Invariant cache hit.
[2023-03-09 23:11:51] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 23:11:52] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
[2023-03-09 23:11:52] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 23:11:52] [INFO ] Invariant cache hit.
[2023-03-09 23:11:52] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 461 ms. Remains : 83/83 places, 83/83 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 83 transition count 82
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 82 transition count 82
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2 place count 82 transition count 76
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 76 transition count 76
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 17 place count 73 transition count 73
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 place count 73 transition count 73
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 2 with 2 rules applied. Total rules applied 22 place count 72 transition count 72
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 72 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 71 transition count 71
Applied a total of 24 rules in 11 ms. Remains 71 /83 variables (removed 12) and now considering 71/83 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 71 rows 71 cols
[2023-03-09 23:11:52] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-09 23:11:52] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:11:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-09 23:11:52] [INFO ] [Nat]Absence check using 3 positive and 10 generalized place invariants in 4 ms returned sat
[2023-03-09 23:11:52] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:11:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:11:52] [INFO ] After 5ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:11:52] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-09 23:11:52] [INFO ] After 94ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
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 937 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1029761 steps, run timeout after 3001 ms. (steps per millisecond=343 ) properties seen :{}
Probabilistic random walk after 1029761 steps, saw 514986 distinct states, run finished after 3001 ms. (steps per millisecond=343 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 96 cols
[2023-03-09 23:11:55] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-09 23:11:55] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:11:55] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-09 23:11:55] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-09 23:11:55] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:11:55] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 23:11:55] [INFO ] After 16ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:11: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 7 ms.
[2023-03-09 23:11:55] [INFO ] After 132ms 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 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 94/94 transitions.
Graph (complete) has 335 edges and 96 vertex of which 93 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 92 transition count 88
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 12 place count 88 transition count 88
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 12 place count 88 transition count 86
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 86 transition count 86
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 84 transition count 84
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 84 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 83 transition count 83
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 83 transition count 83
Applied a total of 24 rules in 13 ms. Remains 83 /96 variables (removed 13) and now considering 83/94 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 83/96 places, 83/94 transitions.
Incomplete random walk after 10000 steps, including 1395 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 914 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 958878 steps, run timeout after 3001 ms. (steps per millisecond=319 ) properties seen :{}
Probabilistic random walk after 958878 steps, saw 479535 distinct states, run finished after 3001 ms. (steps per millisecond=319 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 83 rows 83 cols
[2023-03-09 23:11:58] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-09 23:11:58] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:11:58] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-09 23:11:58] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-09 23:11:58] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:11:58] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 23:11:58] [INFO ] After 13ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:11:58] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-09 23:11:58] [INFO ] After 117ms 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 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 83/83 transitions.
Applied a total of 0 rules in 1 ms. Remains 83 /83 variables (removed 0) and now considering 83/83 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 83/83 places, 83/83 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 83/83 transitions.
Applied a total of 0 rules in 2 ms. Remains 83 /83 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2023-03-09 23:11:58] [INFO ] Invariant cache hit.
[2023-03-09 23:11:58] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-09 23:11:58] [INFO ] Invariant cache hit.
[2023-03-09 23:11:58] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 23:11:59] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
[2023-03-09 23:11:59] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 23:11:59] [INFO ] Invariant cache hit.
[2023-03-09 23:11:59] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 475 ms. Remains : 83/83 places, 83/83 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 83 transition count 82
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 82 transition count 82
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2 place count 82 transition count 76
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 76 transition count 76
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 17 place count 73 transition count 73
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 place count 73 transition count 73
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 2 with 2 rules applied. Total rules applied 22 place count 72 transition count 72
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 72 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 71 transition count 71
Applied a total of 24 rules in 21 ms. Remains 71 /83 variables (removed 12) and now considering 71/83 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 71 rows 71 cols
[2023-03-09 23:11:59] [INFO ] Computed 13 place invariants in 0 ms
[2023-03-09 23:11:59] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:11:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-09 23:11:59] [INFO ] [Nat]Absence check using 3 positive and 10 generalized place invariants in 4 ms returned sat
[2023-03-09 23:11:59] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:11:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:11:59] [INFO ] After 5ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:11:59] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-09 23:11:59] [INFO ] After 97ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1477 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 1019273 steps, run timeout after 3001 ms. (steps per millisecond=339 ) properties seen :{}
Probabilistic random walk after 1019273 steps, saw 509739 distinct states, run finished after 3001 ms. (steps per millisecond=339 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 96 cols
[2023-03-09 23:12:02] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-09 23:12:02] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:12:02] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-09 23:12:02] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-09 23:12:02] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:12:02] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 23:12:02] [INFO ] After 15ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:12:02] [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 7 ms.
[2023-03-09 23:12:02] [INFO ] After 132ms 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 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 94/94 transitions.
Graph (complete) has 335 edges and 96 vertex of which 93 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 92 transition count 88
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 88 transition count 87
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 87 transition count 87
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 14 place count 87 transition count 85
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 18 place count 85 transition count 85
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 22 place count 83 transition count 83
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 83 transition count 81
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 26 place count 81 transition count 81
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 27 place count 81 transition count 81
Applied a total of 27 rules in 19 ms. Remains 81 /96 variables (removed 15) and now considering 81/94 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 81/96 places, 81/94 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 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 1045256 steps, run timeout after 3001 ms. (steps per millisecond=348 ) properties seen :{}
Probabilistic random walk after 1045256 steps, saw 522733 distinct states, run finished after 3001 ms. (steps per millisecond=348 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 81 rows 81 cols
[2023-03-09 23:12:05] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-09 23:12:05] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:12:05] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-09 23:12:05] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-09 23:12:05] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:12:05] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 23:12:05] [INFO ] After 17ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:12:05] [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 12 ms.
[2023-03-09 23:12:05] [INFO ] After 131ms 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 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 81/81 places, 81/81 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2023-03-09 23:12:05] [INFO ] Invariant cache hit.
[2023-03-09 23:12:05] [INFO ] Implicit Places using invariants in 136 ms returned []
[2023-03-09 23:12:05] [INFO ] Invariant cache hit.
[2023-03-09 23:12:06] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 23:12:06] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
[2023-03-09 23:12:06] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 23:12:06] [INFO ] Invariant cache hit.
[2023-03-09 23:12:06] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 600 ms. Remains : 81/81 places, 81/81 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 81 transition count 75
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 75 transition count 75
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 72 transition count 72
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 72 transition count 72
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 20 place count 71 transition count 71
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 21 place count 71 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 22 place count 70 transition count 70
Applied a total of 22 rules in 8 ms. Remains 70 /81 variables (removed 11) and now considering 70/81 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 70 rows 70 cols
[2023-03-09 23:12:06] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-09 23:12:06] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:12:06] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-09 23:12:06] [INFO ] [Nat]Absence check using 5 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-09 23:12:06] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:12:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:12:06] [INFO ] After 5ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:12:06] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-09 23:12:06] [INFO ] After 93ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
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 936 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1018072 steps, run timeout after 3001 ms. (steps per millisecond=339 ) properties seen :{}
Probabilistic random walk after 1018072 steps, saw 509138 distinct states, run finished after 3004 ms. (steps per millisecond=338 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 96 cols
[2023-03-09 23:12:09] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-09 23:12:09] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:12:09] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-09 23:12:09] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-09 23:12:09] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:12:09] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 23:12:09] [INFO ] After 12ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:12:09] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-09 23:12:09] [INFO ] After 129ms 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 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 94/94 transitions.
Graph (complete) has 335 edges and 96 vertex of which 93 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 92 transition count 88
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 12 place count 88 transition count 88
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 12 place count 88 transition count 86
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 86 transition count 86
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 84 transition count 84
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 23 place count 84 transition count 81
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 26 place count 81 transition count 81
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 place count 81 transition count 81
Applied a total of 27 rules in 10 ms. Remains 81 /96 variables (removed 15) and now considering 81/94 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 81/96 places, 81/94 transitions.
Incomplete random walk after 10000 steps, including 1454 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 921 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1057898 steps, run timeout after 3001 ms. (steps per millisecond=352 ) properties seen :{}
Probabilistic random walk after 1057898 steps, saw 529055 distinct states, run finished after 3001 ms. (steps per millisecond=352 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 81 rows 81 cols
[2023-03-09 23:12:12] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-09 23:12:12] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:12:12] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-09 23:12:12] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-09 23:12:12] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:12:12] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-09 23:12:12] [INFO ] After 14ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:12:12] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2023-03-09 23:12:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2023-03-09 23:12:12] [INFO ] After 58ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-09 23:12:12] [INFO ] After 143ms 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 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 81/81 places, 81/81 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2023-03-09 23:12:12] [INFO ] Invariant cache hit.
[2023-03-09 23:12:13] [INFO ] Implicit Places using invariants in 104 ms returned []
[2023-03-09 23:12:13] [INFO ] Invariant cache hit.
[2023-03-09 23:12:13] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-09 23:12:13] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
[2023-03-09 23:12:13] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 23:12:13] [INFO ] Invariant cache hit.
[2023-03-09 23:12:13] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 440 ms. Remains : 81/81 places, 81/81 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 81 transition count 75
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 75 transition count 75
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 72 transition count 72
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 72 transition count 72
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 20 place count 71 transition count 71
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 21 place count 71 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 22 place count 70 transition count 70
Applied a total of 22 rules in 7 ms. Remains 70 /81 variables (removed 11) and now considering 70/81 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 70 rows 70 cols
[2023-03-09 23:12:13] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-09 23:12:13] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:12:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-09 23:12:13] [INFO ] [Nat]Absence check using 5 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-09 23:12:13] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:12:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:12:13] [INFO ] After 8ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:12:13] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-09 23:12:13] [INFO ] After 104ms 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 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 920 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1024989 steps, run timeout after 3001 ms. (steps per millisecond=341 ) properties seen :{}
Probabilistic random walk after 1024989 steps, saw 512599 distinct states, run finished after 3001 ms. (steps per millisecond=341 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 96 cols
[2023-03-09 23:12:16] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-09 23:12:16] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:12:16] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2023-03-09 23:12:16] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-09 23:12:16] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:12:16] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 23:12:16] [INFO ] After 17ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:12:16] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-09 23:12:16] [INFO ] After 161ms 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 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 94/94 transitions.
Graph (complete) has 335 edges and 96 vertex of which 93 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 92 transition count 88
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 12 place count 88 transition count 88
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 12 place count 88 transition count 87
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 87 transition count 87
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 85 transition count 85
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 85 transition count 81
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 26 place count 81 transition count 81
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 place count 81 transition count 81
Applied a total of 27 rules in 8 ms. Remains 81 /96 variables (removed 15) and now considering 81/94 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 81/96 places, 81/94 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 899 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1068022 steps, run timeout after 3001 ms. (steps per millisecond=355 ) properties seen :{}
Probabilistic random walk after 1068022 steps, saw 534124 distinct states, run finished after 3001 ms. (steps per millisecond=355 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 81 rows 81 cols
[2023-03-09 23:12:19] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-09 23:12:19] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:12:19] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2023-03-09 23:12:19] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-09 23:12:19] [INFO ] After 64ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:12:19] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 23:12:19] [INFO ] After 26ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:12:20] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2023-03-09 23:12:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2023-03-09 23:12:20] [INFO ] After 84ms 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 23:12:20] [INFO ] After 209ms 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 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 81/81 places, 81/81 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2023-03-09 23:12:20] [INFO ] Invariant cache hit.
[2023-03-09 23:12:20] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-03-09 23:12:20] [INFO ] Invariant cache hit.
[2023-03-09 23:12:20] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 23:12:20] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 451 ms to find 0 implicit places.
[2023-03-09 23:12:20] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 23:12:20] [INFO ] Invariant cache hit.
[2023-03-09 23:12:20] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 531 ms. Remains : 81/81 places, 81/81 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 81 transition count 75
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 75 transition count 75
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 72 transition count 72
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 72 transition count 72
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 20 place count 71 transition count 71
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 21 place count 71 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 22 place count 70 transition count 70
Applied a total of 22 rules in 7 ms. Remains 70 /81 variables (removed 11) and now considering 70/81 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 70 rows 70 cols
[2023-03-09 23:12:20] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-09 23:12:20] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:12:20] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-09 23:12:20] [INFO ] [Nat]Absence check using 5 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-09 23:12:20] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:12:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:12:20] [INFO ] After 6ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:12:20] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 0 ms to minimize.
[2023-03-09 23:12:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2023-03-09 23:12:20] [INFO ] After 73ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-09 23:12:20] [INFO ] After 156ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1439 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 944 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1028142 steps, run timeout after 3001 ms. (steps per millisecond=342 ) properties seen :{}
Probabilistic random walk after 1028142 steps, saw 514175 distinct states, run finished after 3001 ms. (steps per millisecond=342 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 96 cols
[2023-03-09 23:12:23] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-09 23:12:23] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:12:23] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-09 23:12:23] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-09 23:12:23] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:12:23] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 23:12:23] [INFO ] After 16ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:12:23] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-09 23:12:23] [INFO ] After 129ms 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 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 94/94 transitions.
Graph (complete) has 335 edges and 96 vertex of which 93 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 92 transition count 88
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 88 transition count 87
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 87 transition count 87
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 14 place count 87 transition count 85
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 18 place count 85 transition count 85
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 3 with 2 rules applied. Total rules applied 20 place count 84 transition count 84
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 23 place count 84 transition count 81
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 26 place count 81 transition count 81
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 27 place count 81 transition count 81
Applied a total of 27 rules in 12 ms. Remains 81 /96 variables (removed 15) and now considering 81/94 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 81/96 places, 81/94 transitions.
Incomplete random walk after 10000 steps, including 1418 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 933 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1064004 steps, run timeout after 3001 ms. (steps per millisecond=354 ) properties seen :{}
Probabilistic random walk after 1064004 steps, saw 532104 distinct states, run finished after 3001 ms. (steps per millisecond=354 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 81 rows 81 cols
[2023-03-09 23:12:27] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-09 23:12:27] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:12:27] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-09 23:12:27] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-09 23:12:27] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:12:27] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-09 23:12:27] [INFO ] After 13ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:12:27] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2023-03-09 23:12:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2023-03-09 23:12:27] [INFO ] After 58ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-09 23:12:27] [INFO ] After 156ms 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 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 81/81 places, 81/81 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2023-03-09 23:12:27] [INFO ] Invariant cache hit.
[2023-03-09 23:12:27] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-09 23:12:27] [INFO ] Invariant cache hit.
[2023-03-09 23:12:27] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-09 23:12:27] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
[2023-03-09 23:12:27] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 23:12:27] [INFO ] Invariant cache hit.
[2023-03-09 23:12:27] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 418 ms. Remains : 81/81 places, 81/81 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 81 transition count 75
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 75 transition count 75
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 72 transition count 72
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 72 transition count 72
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 20 place count 71 transition count 71
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 71 transition count 69
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 69 transition count 69
Applied a total of 24 rules in 8 ms. Remains 69 /81 variables (removed 12) and now considering 69/81 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 69 rows 69 cols
[2023-03-09 23:12:27] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-09 23:12:27] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:12:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 23:12:27] [INFO ] [Nat]Absence check using 3 positive and 10 generalized place invariants in 4 ms returned sat
[2023-03-09 23:12:27] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:12:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:12:27] [INFO ] After 6ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:12:27] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-09 23:12:27] [INFO ] After 123ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
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 10001 steps, including 908 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1026488 steps, run timeout after 3001 ms. (steps per millisecond=342 ) properties seen :{}
Probabilistic random walk after 1026488 steps, saw 513346 distinct states, run finished after 3001 ms. (steps per millisecond=342 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 96 cols
[2023-03-09 23:12:30] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-09 23:12:30] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:12:30] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-09 23:12:30] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-09 23:12:30] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:12:30] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 23:12:30] [INFO ] After 12ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:12:30] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-09 23:12:30] [INFO ] After 124ms 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 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 94/94 transitions.
Graph (complete) has 335 edges and 96 vertex of which 93 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 92 transition count 88
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 12 place count 88 transition count 88
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 12 place count 88 transition count 86
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 86 transition count 86
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 84 transition count 84
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 23 place count 84 transition count 81
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 26 place count 81 transition count 81
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 place count 81 transition count 81
Applied a total of 27 rules in 7 ms. Remains 81 /96 variables (removed 15) and now considering 81/94 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 81/96 places, 81/94 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 921 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1061964 steps, run timeout after 3001 ms. (steps per millisecond=353 ) properties seen :{}
Probabilistic random walk after 1061964 steps, saw 531089 distinct states, run finished after 3001 ms. (steps per millisecond=353 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 81 rows 81 cols
[2023-03-09 23:12:34] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-09 23:12:34] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:12:34] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-09 23:12:34] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-09 23:12:34] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:12:34] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-09 23:12:34] [INFO ] After 13ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:12:34] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2023-03-09 23:12:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2023-03-09 23:12:34] [INFO ] After 54ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-09 23:12:34] [INFO ] After 149ms 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 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 81/81 places, 81/81 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2023-03-09 23:12:34] [INFO ] Invariant cache hit.
[2023-03-09 23:12:34] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-03-09 23:12:34] [INFO ] Invariant cache hit.
[2023-03-09 23:12:34] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-09 23:12:34] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
[2023-03-09 23:12:34] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 23:12:34] [INFO ] Invariant cache hit.
[2023-03-09 23:12:34] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 431 ms. Remains : 81/81 places, 81/81 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 81 transition count 75
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 75 transition count 75
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 72 transition count 72
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 72 transition count 72
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 20 place count 71 transition count 71
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 71 transition count 69
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 69 transition count 69
Applied a total of 24 rules in 6 ms. Remains 69 /81 variables (removed 12) and now considering 69/81 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 69 rows 69 cols
[2023-03-09 23:12:34] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-09 23:12:34] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:12:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 23:12:34] [INFO ] [Nat]Absence check using 3 positive and 10 generalized place invariants in 5 ms returned sat
[2023-03-09 23:12:34] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:12:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:12:34] [INFO ] After 6ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:12:34] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-09 23:12:34] [INFO ] After 91ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1464 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 927 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1024614 steps, run timeout after 3001 ms. (steps per millisecond=341 ) properties seen :{}
Probabilistic random walk after 1024614 steps, saw 512409 distinct states, run finished after 3001 ms. (steps per millisecond=341 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 96 cols
[2023-03-09 23:12:37] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-09 23:12:37] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:12:37] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-09 23:12:37] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-09 23:12:37] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:12:37] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 23:12:37] [INFO ] After 16ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:12:37] [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 7 ms.
[2023-03-09 23:12:37] [INFO ] After 131ms 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 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 94/94 transitions.
Graph (complete) has 335 edges and 96 vertex of which 93 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 92 transition count 88
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 12 place count 88 transition count 88
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 12 place count 88 transition count 85
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 18 place count 85 transition count 85
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 2 with 2 rules applied. Total rules applied 20 place count 84 transition count 84
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 23 place count 84 transition count 81
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 26 place count 81 transition count 81
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 place count 81 transition count 81
Applied a total of 27 rules in 10 ms. Remains 81 /96 variables (removed 15) and now considering 81/94 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 81/96 places, 81/94 transitions.
Incomplete random walk after 10000 steps, including 1452 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 888 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1071776 steps, run timeout after 3001 ms. (steps per millisecond=357 ) properties seen :{}
Probabilistic random walk after 1071776 steps, saw 536001 distinct states, run finished after 3001 ms. (steps per millisecond=357 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 81 rows 81 cols
[2023-03-09 23:12:40] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-09 23:12:40] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:12:41] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-09 23:12:41] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-09 23:12:41] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:12:41] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-09 23:12:41] [INFO ] After 15ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:12:41] [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 6 ms.
[2023-03-09 23:12:41] [INFO ] After 121ms 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 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 81/81 places, 81/81 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2023-03-09 23:12:41] [INFO ] Invariant cache hit.
[2023-03-09 23:12:41] [INFO ] Implicit Places using invariants in 114 ms returned []
[2023-03-09 23:12:41] [INFO ] Invariant cache hit.
[2023-03-09 23:12:41] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-09 23:12:41] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2023-03-09 23:12:41] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 23:12:41] [INFO ] Invariant cache hit.
[2023-03-09 23:12:41] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 402 ms. Remains : 81/81 places, 81/81 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 81 transition count 75
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 75 transition count 75
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 72 transition count 72
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 72 transition count 72
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 20 place count 71 transition count 71
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 71 transition count 69
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 69 transition count 69
Applied a total of 24 rules in 6 ms. Remains 69 /81 variables (removed 12) and now considering 69/81 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 69 rows 69 cols
[2023-03-09 23:12:41] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-09 23:12:41] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:12:41] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-09 23:12:41] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-09 23:12:41] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:12:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:12:41] [INFO ] After 5ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:12:41] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-09 23:12:41] [INFO ] After 91ms 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 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 912 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 996271 steps, run timeout after 3001 ms. (steps per millisecond=331 ) properties seen :{}
Probabilistic random walk after 996271 steps, saw 498239 distinct states, run finished after 3001 ms. (steps per millisecond=331 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 96 cols
[2023-03-09 23:12:44] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-09 23:12:44] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:12:44] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-09 23:12:44] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-09 23:12:44] [INFO ] After 57ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:12:44] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 23:12:44] [INFO ] After 12ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:12:44] [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 6 ms.
[2023-03-09 23:12:44] [INFO ] After 129ms 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 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 94/94 transitions.
Graph (complete) has 335 edges and 96 vertex of which 93 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 92 transition count 87
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 14 place count 87 transition count 87
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 14 place count 87 transition count 85
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 85 transition count 85
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 2 with 2 rules applied. Total rules applied 20 place count 84 transition count 84
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 84 transition count 82
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 24 place count 82 transition count 82
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 25 place count 82 transition count 82
Applied a total of 25 rules in 11 ms. Remains 82 /96 variables (removed 14) and now considering 82/94 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 82/96 places, 82/94 transitions.
Incomplete random walk after 10000 steps, including 1416 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 1070386 steps, run timeout after 3001 ms. (steps per millisecond=356 ) properties seen :{}
Probabilistic random walk after 1070386 steps, saw 535305 distinct states, run finished after 3001 ms. (steps per millisecond=356 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 82 rows 82 cols
[2023-03-09 23:12:47] [INFO ] Computed 13 place invariants in 3 ms
[2023-03-09 23:12:47] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:12:47] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2023-03-09 23:12:47] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 19 ms returned sat
[2023-03-09 23:12:48] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:12:48] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-09 23:12:48] [INFO ] After 16ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:12:48] [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 7 ms.
[2023-03-09 23:12:48] [INFO ] After 152ms 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 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 82/82 transitions.
Applied a total of 0 rules in 1 ms. Remains 82 /82 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 82/82 places, 82/82 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 82/82 transitions.
Applied a total of 0 rules in 1 ms. Remains 82 /82 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2023-03-09 23:12:48] [INFO ] Invariant cache hit.
[2023-03-09 23:12:48] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-09 23:12:48] [INFO ] Invariant cache hit.
[2023-03-09 23:12:48] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-09 23:12:48] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
[2023-03-09 23:12:48] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 23:12:48] [INFO ] Invariant cache hit.
[2023-03-09 23:12:48] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 448 ms. Remains : 82/82 places, 82/82 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 82 transition count 76
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 76 transition count 76
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 73 transition count 73
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 73 transition count 73
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 20 place count 72 transition count 72
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 72 transition count 70
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 70 transition count 70
Applied a total of 24 rules in 7 ms. Remains 70 /82 variables (removed 12) and now considering 70/82 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 70 rows 70 cols
[2023-03-09 23:12:48] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-09 23:12:48] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:12:48] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-09 23:12:48] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-09 23:12:48] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:12:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:12:48] [INFO ] After 6ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:12:48] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-09 23:12:48] [INFO ] After 106ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
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 10000 steps, including 914 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1029368 steps, run timeout after 3001 ms. (steps per millisecond=343 ) properties seen :{}
Probabilistic random walk after 1029368 steps, saw 514788 distinct states, run finished after 3001 ms. (steps per millisecond=343 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 96 cols
[2023-03-09 23:12:51] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-09 23:12:51] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:12:51] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-09 23:12:51] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-09 23:12:51] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:12:51] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 23:12:51] [INFO ] After 14ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:12:51] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-09 23:12:51] [INFO ] After 132ms 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 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 94/94 transitions.
Graph (complete) has 335 edges and 96 vertex of which 93 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 92 transition count 87
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 14 place count 87 transition count 87
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 14 place count 87 transition count 85
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 85 transition count 85
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 2 with 2 rules applied. Total rules applied 20 place count 84 transition count 84
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 84 transition count 82
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 24 place count 82 transition count 82
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 25 place count 82 transition count 82
Applied a total of 25 rules in 9 ms. Remains 82 /96 variables (removed 14) and now considering 82/94 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 82/96 places, 82/94 transitions.
Incomplete random walk after 10000 steps, including 1422 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 915 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1066074 steps, run timeout after 3001 ms. (steps per millisecond=355 ) properties seen :{}
Probabilistic random walk after 1066074 steps, saw 533143 distinct states, run finished after 3001 ms. (steps per millisecond=355 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 82 rows 82 cols
[2023-03-09 23:12:54] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-09 23:12:54] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:12:54] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-09 23:12:54] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-09 23:12:55] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:12:55] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-09 23:12:55] [INFO ] After 15ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:12:55] [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 7 ms.
[2023-03-09 23:12:55] [INFO ] After 116ms 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 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 82/82 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 82/82 places, 82/82 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 82/82 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2023-03-09 23:12:55] [INFO ] Invariant cache hit.
[2023-03-09 23:12:55] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-09 23:12:55] [INFO ] Invariant cache hit.
[2023-03-09 23:12:55] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-09 23:12:55] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
[2023-03-09 23:12:55] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 23:12:55] [INFO ] Invariant cache hit.
[2023-03-09 23:12:55] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 451 ms. Remains : 82/82 places, 82/82 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 82 transition count 76
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 76 transition count 76
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 73 transition count 73
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 73 transition count 73
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 20 place count 72 transition count 72
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 72 transition count 70
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 70 transition count 70
Applied a total of 24 rules in 5 ms. Remains 70 /82 variables (removed 12) and now considering 70/82 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 70 rows 70 cols
[2023-03-09 23:12:55] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-09 23:12:55] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:12:55] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-09 23:12:55] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-09 23:12:55] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:12:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:12:55] [INFO ] After 5ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:12:55] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2023-03-09 23:12:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2023-03-09 23:12:55] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-09 23:12:55] [INFO ] After 140ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
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 900 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1030623 steps, run timeout after 3001 ms. (steps per millisecond=343 ) properties seen :{}
Probabilistic random walk after 1030623 steps, saw 515413 distinct states, run finished after 3001 ms. (steps per millisecond=343 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 96 cols
[2023-03-09 23:12:58] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-09 23:12:58] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:12:58] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-09 23:12:58] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-09 23:12:58] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:12:58] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 23:12:58] [INFO ] After 13ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:12:58] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-09 23:12:58] [INFO ] After 125ms 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 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 94/94 transitions.
Graph (complete) has 335 edges and 96 vertex of which 94 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 93 transition count 88
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 88 transition count 88
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 13 place count 88 transition count 87
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 87 transition count 87
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 19 place count 85 transition count 85
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 23 place count 85 transition count 81
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 27 place count 81 transition count 81
Applied a total of 27 rules in 8 ms. Remains 81 /96 variables (removed 15) and now considering 81/94 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 81/96 places, 81/94 transitions.
Incomplete random walk after 10000 steps, including 1449 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 1062132 steps, run timeout after 3001 ms. (steps per millisecond=353 ) properties seen :{}
Probabilistic random walk after 1062132 steps, saw 531174 distinct states, run finished after 3001 ms. (steps per millisecond=353 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 81 rows 81 cols
[2023-03-09 23:13:01] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-09 23:13:01] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:13:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:13:01] [INFO ] [Nat]Absence check using 2 positive and 11 generalized place invariants in 5 ms returned sat
[2023-03-09 23:13:02] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:13:02] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 23:13:02] [INFO ] After 26ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:13:02] [INFO ] After 36ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-09 23:13:02] [INFO ] After 129ms 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 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 81/81 places, 81/81 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2023-03-09 23:13:02] [INFO ] Invariant cache hit.
[2023-03-09 23:13:02] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-09 23:13:02] [INFO ] Invariant cache hit.
[2023-03-09 23:13:02] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 23:13:02] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
[2023-03-09 23:13:02] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 23:13:02] [INFO ] Invariant cache hit.
[2023-03-09 23:13:02] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 434 ms. Remains : 81/81 places, 81/81 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 81 transition count 75
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 75 transition count 75
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 72 transition count 72
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 72 transition count 72
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 20 place count 71 transition count 71
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 71 transition count 69
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 69 transition count 69
Applied a total of 24 rules in 7 ms. Remains 69 /81 variables (removed 12) and now considering 69/81 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 69 rows 69 cols
[2023-03-09 23:13:02] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-09 23:13:02] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:13:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:13:02] [INFO ] [Nat]Absence check using 2 positive and 11 generalized place invariants in 5 ms returned sat
[2023-03-09 23:13:02] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:13:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:13:02] [INFO ] After 4ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:13:02] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-09 23:13:02] [INFO ] After 90ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
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 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 1030985 steps, run timeout after 3001 ms. (steps per millisecond=343 ) properties seen :{}
Probabilistic random walk after 1030985 steps, saw 515596 distinct states, run finished after 3001 ms. (steps per millisecond=343 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 96 cols
[2023-03-09 23:13:05] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-09 23:13:05] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:13:05] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-09 23:13:05] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-09 23:13:05] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:13:05] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 23:13:05] [INFO ] After 15ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:13:05] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-09 23:13:05] [INFO ] After 138ms 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 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 94/94 transitions.
Graph (complete) has 335 edges and 96 vertex of which 95 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 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 95 transition count 90
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 91 transition count 90
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 9 place count 91 transition count 89
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 90 transition count 89
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 17 place count 87 transition count 86
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 87 transition count 84
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 21 place count 85 transition count 84
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 22 place count 85 transition count 84
Applied a total of 22 rules in 7 ms. Remains 85 /96 variables (removed 11) and now considering 84/94 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 85/96 places, 84/94 transitions.
Incomplete random walk after 10000 steps, including 1480 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 943 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1062249 steps, run timeout after 3001 ms. (steps per millisecond=353 ) properties seen :{}
Probabilistic random walk after 1062249 steps, saw 531230 distinct states, run finished after 3001 ms. (steps per millisecond=353 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 84 rows 85 cols
[2023-03-09 23:13:08] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-09 23:13:08] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:13:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:13:08] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 5 ms returned sat
[2023-03-09 23:13:08] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:13:08] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 23:13:08] [INFO ] After 14ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:13:09] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-09 23:13:09] [INFO ] After 123ms 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 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 85 /85 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 85/85 places, 84/84 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 84/84 transitions.
Applied a total of 0 rules in 2 ms. Remains 85 /85 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-09 23:13:09] [INFO ] Invariant cache hit.
[2023-03-09 23:13:09] [INFO ] Implicit Places using invariants in 107 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 108 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 84/85 places, 84/84 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 84 transition count 82
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 82 transition count 82
Applied a total of 4 rules in 3 ms. Remains 82 /84 variables (removed 2) and now considering 82/84 (removed 2) transitions.
// Phase 1: matrix 82 rows 82 cols
[2023-03-09 23:13:09] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-09 23:13:09] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-03-09 23:13:09] [INFO ] Invariant cache hit.
[2023-03-09 23:13:09] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 23:13:09] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 82/85 places, 82/84 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 481 ms. Remains : 82/85 places, 82/84 transitions.
Incomplete random walk after 10000 steps, including 1477 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 878 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1094590 steps, run timeout after 3001 ms. (steps per millisecond=364 ) properties seen :{}
Probabilistic random walk after 1094590 steps, saw 547414 distinct states, run finished after 3001 ms. (steps per millisecond=364 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 23:13:12] [INFO ] Invariant cache hit.
[2023-03-09 23:13:12] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:13:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:13:12] [INFO ] [Nat]Absence check using 2 positive and 11 generalized place invariants in 4 ms returned sat
[2023-03-09 23:13:12] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:13:12] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 23:13:12] [INFO ] After 17ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:13:12] [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 6 ms.
[2023-03-09 23:13:12] [INFO ] After 114ms 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 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 82/82 transitions.
Applied a total of 0 rules in 9 ms. Remains 82 /82 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 82/82 places, 82/82 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 82/82 transitions.
Applied a total of 0 rules in 1 ms. Remains 82 /82 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2023-03-09 23:13:12] [INFO ] Invariant cache hit.
[2023-03-09 23:13:12] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-09 23:13:12] [INFO ] Invariant cache hit.
[2023-03-09 23:13:12] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 23:13:13] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
[2023-03-09 23:13:13] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 23:13:13] [INFO ] Invariant cache hit.
[2023-03-09 23:13:13] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 459 ms. Remains : 82/82 places, 82/82 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 82 transition count 76
Deduced a syphon composed of 6 places in 6 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 76 transition count 76
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 73 transition count 73
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 73 transition count 73
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 20 place count 72 transition count 72
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 72 transition count 70
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 70 transition count 70
Applied a total of 24 rules in 12 ms. Remains 70 /82 variables (removed 12) and now considering 70/82 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 70 rows 70 cols
[2023-03-09 23:13:13] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-09 23:13:13] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:13:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:13:13] [INFO ] [Nat]Absence check using 2 positive and 11 generalized place invariants in 5 ms returned sat
[2023-03-09 23:13:13] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:13:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:13:13] [INFO ] After 6ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:13:13] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-09 23:13:13] [INFO ] After 116ms 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 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 888 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 939582 steps, run timeout after 3001 ms. (steps per millisecond=313 ) properties seen :{}
Probabilistic random walk after 939582 steps, saw 469886 distinct states, run finished after 3001 ms. (steps per millisecond=313 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 96 cols
[2023-03-09 23:13:16] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-09 23:13:16] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:13:16] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-09 23:13:16] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-09 23:13:16] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:13:16] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 23:13:16] [INFO ] After 26ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:13:16] [INFO ] After 36ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-09 23:13:16] [INFO ] After 140ms 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 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 94/94 transitions.
Graph (complete) has 335 edges and 96 vertex of which 94 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 93 transition count 89
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 12 place count 89 transition count 88
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 88 transition count 88
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 13 place count 88 transition count 87
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 15 place count 87 transition count 87
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 21 place count 84 transition count 84
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 22 place count 84 transition count 84
Applied a total of 22 rules in 12 ms. Remains 84 /96 variables (removed 12) and now considering 84/94 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 84/96 places, 84/94 transitions.
Incomplete random walk after 10000 steps, including 1484 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 889 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1049555 steps, run timeout after 3001 ms. (steps per millisecond=349 ) properties seen :{}
Probabilistic random walk after 1049555 steps, saw 524888 distinct states, run finished after 3001 ms. (steps per millisecond=349 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 84 rows 84 cols
[2023-03-09 23:13:19] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-09 23:13:19] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:13:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 23:13:19] [INFO ] [Nat]Absence check using 2 positive and 11 generalized place invariants in 6 ms returned sat
[2023-03-09 23:13:19] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:13:19] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 23:13:19] [INFO ] After 19ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:13:19] [INFO ] After 29ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-09 23:13:19] [INFO ] After 121ms 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 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 84 /84 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 84/84 places, 84/84 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 84/84 transitions.
Applied a total of 0 rules in 2 ms. Remains 84 /84 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-09 23:13:19] [INFO ] Invariant cache hit.
[2023-03-09 23:13:19] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-09 23:13:19] [INFO ] Invariant cache hit.
[2023-03-09 23:13:19] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 23:13:20] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 485 ms to find 0 implicit places.
[2023-03-09 23:13:20] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 23:13:20] [INFO ] Invariant cache hit.
[2023-03-09 23:13:20] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 587 ms. Remains : 84/84 places, 84/84 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 84 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 83 transition count 83
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2 place count 83 transition count 77
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 77 transition count 77
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 17 place count 74 transition count 74
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 place count 74 transition count 74
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 2 with 2 rules applied. Total rules applied 22 place count 73 transition count 73
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 73 transition count 72
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 72 transition count 72
Applied a total of 24 rules in 10 ms. Remains 72 /84 variables (removed 12) and now considering 72/84 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 72 rows 72 cols
[2023-03-09 23:13:20] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-09 23:13:20] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:13:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 23:13:20] [INFO ] [Nat]Absence check using 2 positive and 11 generalized place invariants in 5 ms returned sat
[2023-03-09 23:13:20] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 23:13:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:13:20] [INFO ] After 5ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 23:13:20] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-09 23:13:20] [INFO ] After 108ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 96 transition count 88
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 90 transition count 88
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 87 transition count 85
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 87 transition count 85
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 20 place count 86 transition count 84
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 21 place count 86 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 22 place count 85 transition count 83
Applied a total of 22 rules in 7 ms. Remains 85 /96 variables (removed 11) and now considering 83/94 (removed 11) transitions.
Running SMT prover for 17 properties.
// Phase 1: matrix 83 rows 85 cols
[2023-03-09 23:13:20] [INFO ] Computed 15 place invariants in 0 ms
[2023-03-09 23:13:20] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-09 23:13:20] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-09 23:13:20] [INFO ] [Nat]Absence check using 4 positive and 11 generalized place invariants in 5 ms returned sat
[2023-03-09 23:13:20] [INFO ] After 135ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2023-03-09 23:13:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:13:20] [INFO ] After 111ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :17
[2023-03-09 23:13:20] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2023-03-09 23:13:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2023-03-09 23:13:21] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2023-03-09 23:13:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2023-03-09 23:13:21] [INFO ] After 400ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 131 ms.
[2023-03-09 23:13:21] [INFO ] After 806ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Unable to solve all queries for examination StableMarking. Remains :17 assertions to prove.
No /home/mcc/execution/StableMarking.xml examination file found. Proceeding without properties.
Parsed 17 properties from file /home/mcc/execution/StableMarking.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 926805 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running DoubleExponent (PT), instance 004
Examination StableMarking
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/StableMarking.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

PNML FILE: model.pnml
Petri model created: 216 places, 198 transitions, 558 arcs.
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393232 kB
MemFree: 15083388 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16162760 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 StableMarking -timeout 180 -rebuildPNML
Caught signal 15, terminating.

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DoubleExponent-PT-004"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool smartxred"
echo " Input is DoubleExponent-PT-004, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r153-smll-167819440300293"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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