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

--------------------
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 1678372091122

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DoubleExponent-PT-004
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 14:28:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-09 14:28:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 14:28:14] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2023-03-09 14:28:14] [INFO ] Transformed 216 places.
[2023-03-09 14:28:14] [INFO ] Transformed 198 transitions.
[2023-03-09 14:28:14] [INFO ] Parsed PT model containing 216 places and 198 transitions and 558 arcs in 174 ms.
Structural test allowed to assert that 11 places are NOT stable. Took 9 ms.
Incomplete random walk after 10000 steps, including 336 resets, run finished after 792 ms. (steps per millisecond=12 ) properties (out of 205) seen :44
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 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 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 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 8 ms. (steps per millisecond=12 ) 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 100 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
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 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 100 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=11 ) 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 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 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 9 ms. (steps per millisecond=11 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=25 ) 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 4 ms. (steps per millisecond=25 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 161) seen :0
Incomplete Best-First random walk after 100 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 2 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 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 101 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 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 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 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 9 ms. (steps per millisecond=11 ) 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 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 2 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 5 ms. (steps per millisecond=20 ) properties (out of 161) seen :0
Running SMT prover for 161 properties.
// Phase 1: matrix 198 rows 216 cols
[2023-03-09 14:28:15] [INFO ] Computed 24 place invariants in 26 ms
[2023-03-09 14:28:17] [INFO ] After 1622ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:161
[2023-03-09 14:28:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-09 14:28:18] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 15 ms returned sat
[2023-03-09 14:28:21] [INFO ] After 2357ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :161
[2023-03-09 14:28:21] [INFO ] Deduced a trap composed of 63 places in 109 ms of which 9 ms to minimize.
[2023-03-09 14:28:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2023-03-09 14:28:21] [INFO ] Deduced a trap composed of 102 places in 110 ms of which 2 ms to minimize.
[2023-03-09 14:28:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2023-03-09 14:28:22] [INFO ] Deduced a trap composed of 93 places in 103 ms of which 1 ms to minimize.
[2023-03-09 14:28:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2023-03-09 14:28:22] [INFO ] Deduced a trap composed of 60 places in 81 ms of which 3 ms to minimize.
[2023-03-09 14:28:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2023-03-09 14:28:22] [INFO ] Deduced a trap composed of 96 places in 105 ms of which 0 ms to minimize.
[2023-03-09 14:28:22] [INFO ] Deduced a trap composed of 58 places in 95 ms of which 1 ms to minimize.
[2023-03-09 14:28:22] [INFO ] Deduced a trap composed of 64 places in 91 ms of which 1 ms to minimize.
[2023-03-09 14:28:22] [INFO ] Deduced a trap composed of 57 places in 96 ms of which 1 ms to minimize.
[2023-03-09 14:28:22] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 467 ms
[2023-03-09 14:28:22] [INFO ] Deduced a trap composed of 43 places in 68 ms of which 0 ms to minimize.
[2023-03-09 14:28:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2023-03-09 14:28:23] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 1 ms to minimize.
[2023-03-09 14:28:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2023-03-09 14:28:23] [INFO ] Deduced a trap composed of 84 places in 88 ms of which 1 ms to minimize.
[2023-03-09 14:28:23] [INFO ] Deduced a trap composed of 68 places in 86 ms of which 1 ms to minimize.
[2023-03-09 14:28:23] [INFO ] Deduced a trap composed of 82 places in 85 ms of which 0 ms to minimize.
[2023-03-09 14:28:23] [INFO ] Deduced a trap composed of 47 places in 91 ms of which 1 ms to minimize.
[2023-03-09 14:28:23] [INFO ] Deduced a trap composed of 96 places in 82 ms of which 1 ms to minimize.
[2023-03-09 14:28:23] [INFO ] Deduced a trap composed of 86 places in 102 ms of which 0 ms to minimize.
[2023-03-09 14:28:23] [INFO ] Deduced a trap composed of 84 places in 81 ms of which 0 ms to minimize.
[2023-03-09 14:28:23] [INFO ] Deduced a trap composed of 68 places in 95 ms of which 1 ms to minimize.
[2023-03-09 14:28:23] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 838 ms
[2023-03-09 14:28:24] [INFO ] Deduced a trap composed of 69 places in 100 ms of which 1 ms to minimize.
[2023-03-09 14:28:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2023-03-09 14:28:24] [INFO ] Deduced a trap composed of 101 places in 91 ms of which 0 ms to minimize.
[2023-03-09 14:28:25] [INFO ] Deduced a trap composed of 52 places in 89 ms of which 1 ms to minimize.
[2023-03-09 14:28:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 224 ms
[2023-03-09 14:28:25] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 0 ms to minimize.
[2023-03-09 14:28:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2023-03-09 14:28:25] [INFO ] Deduced a trap composed of 54 places in 40 ms of which 0 ms to minimize.
[2023-03-09 14:28:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2023-03-09 14:28:25] [INFO ] Deduced a trap composed of 49 places in 47 ms of which 0 ms to minimize.
[2023-03-09 14:28:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2023-03-09 14:28:26] [INFO ] Deduced a trap composed of 60 places in 51 ms of which 0 ms to minimize.
[2023-03-09 14:28:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2023-03-09 14:28:26] [INFO ] Deduced a trap composed of 78 places in 94 ms of which 1 ms to minimize.
[2023-03-09 14:28:26] [INFO ] Deduced a trap composed of 73 places in 98 ms of which 0 ms to minimize.
[2023-03-09 14:28:26] [INFO ] Deduced a trap composed of 104 places in 87 ms of which 1 ms to minimize.
[2023-03-09 14:28:26] [INFO ] Deduced a trap composed of 70 places in 92 ms of which 0 ms to minimize.
[2023-03-09 14:28:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 446 ms
[2023-03-09 14:28:27] [INFO ] Deduced a trap composed of 88 places in 88 ms of which 1 ms to minimize.
[2023-03-09 14:28:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2023-03-09 14:28:27] [INFO ] After 8857ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :161
Attempting to minimize the solution found.
Minimization took 2271 ms.
[2023-03-09 14:28:30] [INFO ] After 13032ms 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 4855 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 3 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 71 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 71 ms. Remains : 187/216 places, 171/198 transitions.
Interrupted random walk after 868820 steps, including 110920 resets, run timeout after 30001 ms. (steps per millisecond=28 ) properties seen 38
Incomplete Best-First random walk after 10000 steps, including 847 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 834 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 852 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 825 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10001 steps, including 857 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 865 resets, run finished after 271 ms. (steps per millisecond=36 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10001 steps, including 859 resets, run finished after 340 ms. (steps per millisecond=29 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10001 steps, including 872 resets, run finished after 340 ms. (steps per millisecond=29 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 863 resets, run finished after 340 ms. (steps per millisecond=29 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 848 resets, run finished after 336 ms. (steps per millisecond=29 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10001 steps, including 831 resets, run finished after 251 ms. (steps per millisecond=39 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10001 steps, including 827 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10001 steps, including 861 resets, run finished after 275 ms. (steps per millisecond=36 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10001 steps, including 839 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 813 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10001 steps, including 838 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10001 steps, including 865 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 852 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 887 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 875 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 841 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 859 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 790 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 873 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 784 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 848 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 827 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 857 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 879 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 860 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 849 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 825 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 849 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 825 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 855 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 878 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 820 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 837 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 880 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 820 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 841 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 837 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 856 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 862 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 830 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 839 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 842 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 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 821 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 204 ms. (steps per millisecond=49 ) properties (out of 123) seen :0
Running SMT prover for 123 properties.
// Phase 1: matrix 171 rows 187 cols
[2023-03-09 14:29:16] [INFO ] Computed 24 place invariants in 9 ms
[2023-03-09 14:29:16] [INFO ] After 849ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:123
[2023-03-09 14:29:17] [INFO ] [Nat]Absence check using 5 positive place invariants in 7 ms returned sat
[2023-03-09 14:29:17] [INFO ] [Nat]Absence check using 5 positive and 19 generalized place invariants in 12 ms returned sat
[2023-03-09 14:29:19] [INFO ] After 1393ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :123
[2023-03-09 14:29:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 14:29:20] [INFO ] After 1167ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :123
[2023-03-09 14:29:20] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 0 ms to minimize.
[2023-03-09 14:29:20] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 1 ms to minimize.
[2023-03-09 14:29:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 175 ms
[2023-03-09 14:29:21] [INFO ] Deduced a trap composed of 88 places in 81 ms of which 0 ms to minimize.
[2023-03-09 14:29:21] [INFO ] Deduced a trap composed of 55 places in 70 ms of which 1 ms to minimize.
[2023-03-09 14:29:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 184 ms
[2023-03-09 14:29:21] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 0 ms to minimize.
[2023-03-09 14:29:21] [INFO ] Deduced a trap composed of 72 places in 74 ms of which 1 ms to minimize.
[2023-03-09 14:29:21] [INFO ] Deduced a trap composed of 53 places in 80 ms of which 0 ms to minimize.
[2023-03-09 14:29:21] [INFO ] Deduced a trap composed of 43 places in 72 ms of which 0 ms to minimize.
[2023-03-09 14:29:21] [INFO ] Deduced a trap composed of 61 places in 80 ms of which 1 ms to minimize.
[2023-03-09 14:29:21] [INFO ] Deduced a trap composed of 83 places in 73 ms of which 1 ms to minimize.
[2023-03-09 14:29:21] [INFO ] Deduced a trap composed of 96 places in 72 ms of which 0 ms to minimize.
[2023-03-09 14:29:21] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 1 ms to minimize.
[2023-03-09 14:29:21] [INFO ] Deduced a trap composed of 99 places in 78 ms of which 1 ms to minimize.
[2023-03-09 14:29:22] [INFO ] Deduced a trap composed of 70 places in 79 ms of which 1 ms to minimize.
[2023-03-09 14:29:22] [INFO ] Deduced a trap composed of 80 places in 74 ms of which 1 ms to minimize.
[2023-03-09 14:29:22] [INFO ] Deduced a trap composed of 46 places in 74 ms of which 0 ms to minimize.
[2023-03-09 14:29:22] [INFO ] Deduced a trap composed of 43 places in 73 ms of which 0 ms to minimize.
[2023-03-09 14:29:22] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1146 ms
[2023-03-09 14:29:22] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 1 ms to minimize.
[2023-03-09 14:29:22] [INFO ] Deduced a trap composed of 69 places in 77 ms of which 1 ms to minimize.
[2023-03-09 14:29:22] [INFO ] Deduced a trap composed of 77 places in 81 ms of which 2 ms to minimize.
[2023-03-09 14:29:22] [INFO ] Deduced a trap composed of 78 places in 81 ms of which 1 ms to minimize.
[2023-03-09 14:29:23] [INFO ] Deduced a trap composed of 45 places in 76 ms of which 1 ms to minimize.
[2023-03-09 14:29:23] [INFO ] Deduced a trap composed of 90 places in 77 ms of which 1 ms to minimize.
[2023-03-09 14:29:23] [INFO ] Deduced a trap composed of 67 places in 85 ms of which 1 ms to minimize.
[2023-03-09 14:29:23] [INFO ] Deduced a trap composed of 69 places in 92 ms of which 1 ms to minimize.
[2023-03-09 14:29:23] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 862 ms
[2023-03-09 14:29:23] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 12 ms to minimize.
[2023-03-09 14:29:23] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 0 ms to minimize.
[2023-03-09 14:29:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 152 ms
[2023-03-09 14:29:24] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 0 ms to minimize.
[2023-03-09 14:29:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2023-03-09 14:29:25] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
[2023-03-09 14:29:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2023-03-09 14:29:25] [INFO ] After 6268ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :123
Attempting to minimize the solution found.
Minimization took 1416 ms.
[2023-03-09 14:29:27] [INFO ] After 10312ms 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 2359 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 1 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 2 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 35 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 37 ms. Remains : 168/187 places, 153/171 transitions.
Interrupted random walk after 975517 steps, including 125142 resets, run timeout after 30001 ms. (steps per millisecond=32 ) properties seen 0
Incomplete Best-First random walk after 10000 steps, including 810 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 836 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 857 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 866 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 849 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 831 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 826 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 847 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 832 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 867 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10001 steps, including 838 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 867 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 814 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 830 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 831 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 875 resets, run finished after 201 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 201 ms. (steps per millisecond=49 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 866 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 852 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 842 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 830 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 859 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 829 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 807 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 829 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 868 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 850 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 862 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 852 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 841 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 849 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 841 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10001 steps, including 870 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 850 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 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 840 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 854 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 858 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 841 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 846 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 867 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 859 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 822 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 825 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 852 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 832 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 862 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 836 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 860 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 123) seen :0
Incomplete Best-First random walk after 10000 steps, including 831 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 123) seen :0
Interrupted probabilistic random walk after 5804164 steps, run timeout after 120001 ms. (steps per millisecond=48 ) 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 5804164 steps, saw 2901834 distinct states, run finished after 120005 ms. (steps per millisecond=48 ) properties seen :106
Running SMT prover for 17 properties.
// Phase 1: matrix 153 rows 168 cols
[2023-03-09 14:32:09] [INFO ] Computed 24 place invariants in 6 ms
[2023-03-09 14:32:09] [INFO ] After 135ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-09 14:32:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-09 14:32:10] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 11 ms returned sat
[2023-03-09 14:32:10] [INFO ] After 260ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2023-03-09 14:32:10] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-09 14:32:10] [INFO ] After 213ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :17
[2023-03-09 14:32:10] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 2 ms to minimize.
[2023-03-09 14:32:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2023-03-09 14:32:10] [INFO ] After 546ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 143 ms.
[2023-03-09 14:32:11] [INFO ] After 1144ms 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 1799 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 40 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 40 ms. Remains : 107/168 places, 98/153 transitions.
Incomplete random walk after 1000000 steps, including 128546 resets, run finished after 26717 ms. (steps per millisecond=37 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 8523 resets, run finished after 1754 ms. (steps per millisecond=57 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 8363 resets, run finished after 1994 ms. (steps per millisecond=50 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8453 resets, run finished after 1744 ms. (steps per millisecond=57 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8516 resets, run finished after 1771 ms. (steps per millisecond=56 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8513 resets, run finished after 1772 ms. (steps per millisecond=56 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 8435 resets, run finished after 1802 ms. (steps per millisecond=55 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 8423 resets, run finished after 1802 ms. (steps per millisecond=55 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8562 resets, run finished after 1803 ms. (steps per millisecond=55 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8542 resets, run finished after 1859 ms. (steps per millisecond=53 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8474 resets, run finished after 1851 ms. (steps per millisecond=54 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 8467 resets, run finished after 1856 ms. (steps per millisecond=53 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8515 resets, run finished after 1850 ms. (steps per millisecond=54 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8460 resets, run finished after 1710 ms. (steps per millisecond=58 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8445 resets, run finished after 1794 ms. (steps per millisecond=55 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8405 resets, run finished after 1810 ms. (steps per millisecond=55 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8455 resets, run finished after 1794 ms. (steps per millisecond=55 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8504 resets, run finished after 1683 ms. (steps per millisecond=59 ) properties (out of 17) seen :0
Interrupted probabilistic random walk after 9728164 steps, run timeout after 171001 ms. (steps per millisecond=56 ) properties seen :{}
Probabilistic random walk after 9728164 steps, saw 4862863 distinct states, run finished after 171004 ms. (steps per millisecond=56 ) properties seen :0
Running SMT prover for 17 properties.
// Phase 1: matrix 98 rows 107 cols
[2023-03-09 14:36:01] [INFO ] Computed 22 place invariants in 6 ms
[2023-03-09 14:36:01] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-09 14:36:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 14:36:01] [INFO ] [Nat]Absence check using 2 positive and 20 generalized place invariants in 9 ms returned sat
[2023-03-09 14:36:01] [INFO ] After 154ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2023-03-09 14:36:01] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 14:36:01] [INFO ] After 147ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :17
[2023-03-09 14:36:02] [INFO ] After 360ms 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 14:36:02] [INFO ] After 801ms 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 1419 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 7 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 14:36:03] [INFO ] Invariant cache hit.
[2023-03-09 14:36:03] [INFO ] Implicit Places using invariants in 164 ms returned [20, 26, 41, 75, 80, 98, 104]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 167 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 18 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 14:36:03] [INFO ] Computed 15 place invariants in 10 ms
[2023-03-09 14:36:03] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-09 14:36:03] [INFO ] Invariant cache hit.
[2023-03-09 14:36:03] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 14:36:04] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 416 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 609 ms. Remains : 96/107 places, 94/98 transitions.
Incomplete random walk after 1000000 steps, including 144084 resets, run finished after 25492 ms. (steps per millisecond=39 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 9127 resets, run finished after 1903 ms. (steps per millisecond=52 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 9111 resets, run finished after 1880 ms. (steps per millisecond=53 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 9088 resets, run finished after 1670 ms. (steps per millisecond=59 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 9011 resets, run finished after 1523 ms. (steps per millisecond=65 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 9065 resets, run finished after 1714 ms. (steps per millisecond=58 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 9064 resets, run finished after 1646 ms. (steps per millisecond=60 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 9105 resets, run finished after 1695 ms. (steps per millisecond=58 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 9183 resets, run finished after 1681 ms. (steps per millisecond=59 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 9198 resets, run finished after 1349 ms. (steps per millisecond=74 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 9118 resets, run finished after 1396 ms. (steps per millisecond=71 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 9168 resets, run finished after 1833 ms. (steps per millisecond=54 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 9192 resets, run finished after 1660 ms. (steps per millisecond=60 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 9098 resets, run finished after 1614 ms. (steps per millisecond=61 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 9123 resets, run finished after 1614 ms. (steps per millisecond=61 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 9171 resets, run finished after 1622 ms. (steps per millisecond=61 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 9146 resets, run finished after 1656 ms. (steps per millisecond=60 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 9148 resets, run finished after 1678 ms. (steps per millisecond=59 ) properties (out of 17) seen :0
Interrupted probabilistic random walk after 9469818 steps, run timeout after 159001 ms. (steps per millisecond=59 ) properties seen :{}
Probabilistic random walk after 9469818 steps, saw 4733463 distinct states, run finished after 159002 ms. (steps per millisecond=59 ) properties seen :0
Running SMT prover for 17 properties.
[2023-03-09 14:39:36] [INFO ] Invariant cache hit.
[2023-03-09 14:39:36] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-09 14:39:37] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-09 14:39:37] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-09 14:39:37] [INFO ] After 142ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2023-03-09 14:39:37] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 14:39:37] [INFO ] After 117ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :17
[2023-03-09 14:39:37] [INFO ] After 271ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 97 ms.
[2023-03-09 14:39:37] [INFO ] After 650ms 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 1250 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 5 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 17 ms. Remains 96 /96 variables (removed 0) and now considering 94/94 (removed 0) transitions.
[2023-03-09 14:39:38] [INFO ] Invariant cache hit.
[2023-03-09 14:39:38] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-09 14:39:38] [INFO ] Invariant cache hit.
[2023-03-09 14:39:39] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 14:39:39] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
[2023-03-09 14:39:39] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 14:39:39] [INFO ] Invariant cache hit.
[2023-03-09 14:39:39] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 536 ms. Remains : 96/96 places, 94/94 transitions.
Incomplete random walk after 100000 steps, including 14417 resets, run finished after 3102 ms. (steps per millisecond=32 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
[2023-03-09 14:39:42] [INFO ] Invariant cache hit.
[2023-03-09 14:39:42] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-09 14:39:42] [INFO ] [Real]Absence check using 7 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-09 14:39:42] [INFO ] After 73ms SMT Verify possible using state equation in real domain returned unsat :0 sat :17
[2023-03-09 14:39:42] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 14:39:42] [INFO ] After 32ms SMT Verify possible using 12 Read/Feed constraints in real domain returned unsat :0 sat :17
[2023-03-09 14:39:42] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 3 ms to minimize.
[2023-03-09 14:39:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2023-03-09 14:39:42] [INFO ] After 308ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-09 14:39:42] [INFO ] After 450ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-09 14:39:42] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-09 14:39:42] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 2 ms returned sat
[2023-03-09 14:39:43] [INFO ] After 60ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2023-03-09 14:39:43] [INFO ] After 46ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :17
[2023-03-09 14:39:43] [INFO ] After 215ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-09 14:39:43] [INFO ] After 351ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Incomplete random walk after 1000000 steps, including 144365 resets, run finished after 26509 ms. (steps per millisecond=37 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 9251 resets, run finished after 1771 ms. (steps per millisecond=56 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 9140 resets, run finished after 1801 ms. (steps per millisecond=55 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 9092 resets, run finished after 1644 ms. (steps per millisecond=60 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 9261 resets, run finished after 1814 ms. (steps per millisecond=55 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 9124 resets, run finished after 1660 ms. (steps per millisecond=60 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 9061 resets, run finished after 1610 ms. (steps per millisecond=62 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 9141 resets, run finished after 1621 ms. (steps per millisecond=61 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 9125 resets, run finished after 1608 ms. (steps per millisecond=62 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 9149 resets, run finished after 1625 ms. (steps per millisecond=61 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 9064 resets, run finished after 1601 ms. (steps per millisecond=62 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 9263 resets, run finished after 1632 ms. (steps per millisecond=61 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 9188 resets, run finished after 1659 ms. (steps per millisecond=60 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 9168 resets, run finished after 1673 ms. (steps per millisecond=59 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 9149 resets, run finished after 1643 ms. (steps per millisecond=60 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 9142 resets, run finished after 1650 ms. (steps per millisecond=60 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 9180 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 9121 resets, run finished after 1630 ms. (steps per millisecond=61 ) properties (out of 17) seen :0
Interrupted probabilistic random walk after 9042125 steps, run timeout after 162001 ms. (steps per millisecond=55 ) properties seen :{}
Probabilistic random walk after 9042125 steps, saw 4519771 distinct states, run finished after 162002 ms. (steps per millisecond=55 ) properties seen :0
Running SMT prover for 17 properties.
[2023-03-09 14:43:20] [INFO ] Invariant cache hit.
[2023-03-09 14:43:20] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-09 14:43:20] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2023-03-09 14:43:20] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-09 14:43:20] [INFO ] After 150ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2023-03-09 14:43:20] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 14:43:20] [INFO ] After 119ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :17
[2023-03-09 14:43:20] [INFO ] After 294ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 125 ms.
[2023-03-09 14:43:20] [INFO ] After 715ms 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 1282 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 5 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 3 ms. Remains 96 /96 variables (removed 0) and now considering 94/94 (removed 0) transitions.
[2023-03-09 14:43:22] [INFO ] Invariant cache hit.
[2023-03-09 14:43:22] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-09 14:43:22] [INFO ] Invariant cache hit.
[2023-03-09 14:43:22] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 14:43:22] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
[2023-03-09 14:43:22] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 14:43:22] [INFO ] Invariant cache hit.
[2023-03-09 14:43:22] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 511 ms. Remains : 96/96 places, 94/94 transitions.
Incomplete random walk after 100000 steps, including 14346 resets, run finished after 2483 ms. (steps per millisecond=40 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
[2023-03-09 14:43:25] [INFO ] Invariant cache hit.
[2023-03-09 14:43:25] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-09 14:43:25] [INFO ] [Real]Absence check using 7 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-09 14:43:25] [INFO ] After 72ms SMT Verify possible using state equation in real domain returned unsat :0 sat :17
[2023-03-09 14:43:25] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 14:43:25] [INFO ] After 31ms SMT Verify possible using 12 Read/Feed constraints in real domain returned unsat :0 sat :17
[2023-03-09 14:43:25] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2023-03-09 14:43:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2023-03-09 14:43:25] [INFO ] After 261ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-09 14:43:25] [INFO ] After 390ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-09 14:43:25] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-09 14:43:25] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-09 14:43:25] [INFO ] After 71ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2023-03-09 14:43:25] [INFO ] After 48ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :17
[2023-03-09 14:43:25] [INFO ] After 212ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-09 14:43:25] [INFO ] After 371ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Incomplete random walk after 10000 steps, including 1407 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 893 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 943591 steps, run timeout after 3001 ms. (steps per millisecond=314 ) properties seen :{}
Probabilistic random walk after 943591 steps, saw 471892 distinct states, run finished after 3001 ms. (steps per millisecond=314 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 14:43:28] [INFO ] Invariant cache hit.
[2023-03-09 14:43:29] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:43:29] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-09 14:43:29] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-09 14:43:29] [INFO ] After 59ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:43:29] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 14:43:29] [INFO ] After 15ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:43:29] [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 6 ms.
[2023-03-09 14:43:29] [INFO ] After 139ms 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 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 20 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 20 ms. Remains : 83/96 places, 83/94 transitions.
Incomplete random walk after 10000 steps, including 1426 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 904 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 968133 steps, run timeout after 3001 ms. (steps per millisecond=322 ) properties seen :{}
Probabilistic random walk after 968133 steps, saw 484166 distinct states, run finished after 3003 ms. (steps per millisecond=322 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 83 rows 83 cols
[2023-03-09 14:43:32] [INFO ] Computed 13 place invariants in 11 ms
[2023-03-09 14:43:32] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:43:32] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-09 14:43:32] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-09 14:43:32] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:43:32] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 14:43:32] [INFO ] After 17ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:43:32] [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 5 ms.
[2023-03-09 14:43:32] [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 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 4 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 5 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 14:43:32] [INFO ] Invariant cache hit.
[2023-03-09 14:43:32] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-09 14:43:32] [INFO ] Invariant cache hit.
[2023-03-09 14:43:32] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 14:43:32] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
[2023-03-09 14:43:32] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 14:43:32] [INFO ] Invariant cache hit.
[2023-03-09 14:43:32] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 449 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 16 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 14:43:32] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-09 14:43:32] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:43:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 14:43:32] [INFO ] [Nat]Absence check using 3 positive and 10 generalized place invariants in 4 ms returned sat
[2023-03-09 14:43:32] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:43:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 14:43:32] [INFO ] After 5ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:43:32] [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 14:43:33] [INFO ] After 96ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1424 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 898 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 991028 steps, run timeout after 3001 ms. (steps per millisecond=330 ) properties seen :{}
Probabilistic random walk after 991028 steps, saw 495619 distinct states, run finished after 3001 ms. (steps per millisecond=330 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 96 cols
[2023-03-09 14:43:36] [INFO ] Computed 15 place invariants in 7 ms
[2023-03-09 14:43:36] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:43:36] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-09 14:43:36] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-09 14:43:36] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:43:36] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 14:43:36] [INFO ] After 16ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:43:36] [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 14:43:36] [INFO ] After 133ms 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 1 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 17 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 18 ms. Remains : 85/96 places, 84/94 transitions.
Incomplete random walk after 10000 steps, including 1425 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 922 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1002980 steps, run timeout after 3001 ms. (steps per millisecond=334 ) properties seen :{}
Probabilistic random walk after 1002980 steps, saw 501594 distinct states, run finished after 3001 ms. (steps per millisecond=334 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 84 rows 85 cols
[2023-03-09 14:43:39] [INFO ] Computed 14 place invariants in 6 ms
[2023-03-09 14:43:39] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:43:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 14:43:39] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 4 ms returned sat
[2023-03-09 14:43:39] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:43:39] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 14:43:39] [INFO ] After 16ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:43:39] [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 14:43:39] [INFO ] After 118ms 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 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 3 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 14:43:39] [INFO ] Invariant cache hit.
[2023-03-09 14:43:39] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-09 14:43:39] [INFO ] Invariant cache hit.
[2023-03-09 14:43:39] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 14:43:39] [INFO ] Implicit Places using invariants and state equation in 267 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 363 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 5 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 14:43:39] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-09 14:43:39] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-09 14:43:39] [INFO ] Invariant cache hit.
[2023-03-09 14:43:39] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 14:43:40] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 378 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 750 ms. Remains : 84/85 places, 84/84 transitions.
Incomplete random walk after 10000 steps, including 1418 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 923 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 979747 steps, run timeout after 3001 ms. (steps per millisecond=326 ) properties seen :{}
Probabilistic random walk after 979747 steps, saw 489983 distinct states, run finished after 3001 ms. (steps per millisecond=326 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 14:43:43] [INFO ] Invariant cache hit.
[2023-03-09 14:43:43] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:43:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 14:43:43] [INFO ] [Nat]Absence check using 2 positive and 11 generalized place invariants in 6 ms returned sat
[2023-03-09 14:43:43] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:43:43] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 14:43:43] [INFO ] After 15ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:43:43] [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 14:43:43] [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 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 4 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 3 ms. Remains 84 /84 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-09 14:43:43] [INFO ] Invariant cache hit.
[2023-03-09 14:43:43] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-09 14:43:43] [INFO ] Invariant cache hit.
[2023-03-09 14:43:43] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 14:43:43] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
[2023-03-09 14:43:43] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 14:43:43] [INFO ] Invariant cache hit.
[2023-03-09 14:43:43] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 454 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 0 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 8 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 14:43:43] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-09 14:43:43] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:43:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 14:43:43] [INFO ] [Nat]Absence check using 2 positive and 11 generalized place invariants in 3 ms returned sat
[2023-03-09 14:43:43] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:43:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 14:43:43] [INFO ] After 4ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:43:43] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-09 14:43:43] [INFO ] After 84ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1454 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 909 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 988666 steps, run timeout after 3001 ms. (steps per millisecond=329 ) properties seen :{}
Probabilistic random walk after 988666 steps, saw 494437 distinct states, run finished after 3001 ms. (steps per millisecond=329 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 96 cols
[2023-03-09 14:43:46] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-09 14:43:47] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:43:47] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-09 14:43:47] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-09 14:43:47] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:43:47] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 14:43:47] [INFO ] After 17ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:43:47] [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 14:43:47] [INFO ] After 128ms 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 0 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 0 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 11 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 11 ms. Remains : 85/96 places, 83/94 transitions.
Incomplete random walk after 10000 steps, including 1491 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 941 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1022748 steps, run timeout after 3001 ms. (steps per millisecond=340 ) properties seen :{}
Probabilistic random walk after 1022748 steps, saw 511478 distinct states, run finished after 3001 ms. (steps per millisecond=340 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 83 rows 85 cols
[2023-03-09 14:43:50] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-09 14:43:50] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:43:50] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-09 14:43:50] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-09 14:43:50] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:43:50] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 14:43:50] [INFO ] After 16ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:43:50] [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 14:43:50] [INFO ] After 120ms 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 3 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 2 ms. Remains 85 /85 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2023-03-09 14:43:50] [INFO ] Invariant cache hit.
[2023-03-09 14:43:50] [INFO ] Implicit Places using invariants in 84 ms returned [37, 47]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 85 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 14:43:50] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-09 14:43:50] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-09 14:43:50] [INFO ] Invariant cache hit.
[2023-03-09 14:43:50] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 14:43:50] [INFO ] Implicit Places using invariants and state equation in 280 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 : 81/85 places, 81/83 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 461 ms. Remains : 81/85 places, 81/83 transitions.
Incomplete random walk after 10000 steps, including 1459 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 887 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 949542 steps, run timeout after 3001 ms. (steps per millisecond=316 ) properties seen :{}
Probabilistic random walk after 949542 steps, saw 474865 distinct states, run finished after 3001 ms. (steps per millisecond=316 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 14:43:53] [INFO ] Invariant cache hit.
[2023-03-09 14:43:53] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:43:53] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-09 14:43:53] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-09 14:43:53] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:43:53] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 14:43:53] [INFO ] After 15ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:43:53] [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 14:43:53] [INFO ] After 113ms 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 2 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2023-03-09 14:43:53] [INFO ] Invariant cache hit.
[2023-03-09 14:43:54] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-09 14:43:54] [INFO ] Invariant cache hit.
[2023-03-09 14:43:54] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 14:43:54] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
[2023-03-09 14:43:54] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 14:43:54] [INFO ] Invariant cache hit.
[2023-03-09 14:43:54] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 577 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 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 14:43:54] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-09 14:43:54] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:43:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 14:43:54] [INFO ] [Nat]Absence check using 3 positive and 10 generalized place invariants in 5 ms returned sat
[2023-03-09 14:43:54] [INFO ] After 58ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:43:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 14:43:54] [INFO ] After 7ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:43:54] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2023-03-09 14:43:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2023-03-09 14:43:54] [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 14:43:54] [INFO ] After 167ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1430 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 910 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 967714 steps, run timeout after 3001 ms. (steps per millisecond=322 ) properties seen :{}
Probabilistic random walk after 967714 steps, saw 483951 distinct states, run finished after 3001 ms. (steps per millisecond=322 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 96 cols
[2023-03-09 14:43:57] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-09 14:43:57] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:43:57] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-09 14:43:57] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-09 14:43:57] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:43:57] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 14:43:57] [INFO ] After 16ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:43:57] [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 14:43:57] [INFO ] After 127ms 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 1414 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 914 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 961642 steps, run timeout after 3001 ms. (steps per millisecond=320 ) properties seen :{}
Probabilistic random walk after 961642 steps, saw 480923 distinct states, run finished after 3001 ms. (steps per millisecond=320 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 83 rows 83 cols
[2023-03-09 14:44:00] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-09 14:44:01] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:44:01] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-09 14:44:01] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-09 14:44:01] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:44:01] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 14:44:01] [INFO ] After 22ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:44:01] [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 14:44:01] [INFO ] After 128ms 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 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 14:44:01] [INFO ] Invariant cache hit.
[2023-03-09 14:44:01] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-09 14:44:01] [INFO ] Invariant cache hit.
[2023-03-09 14:44:01] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 14:44:01] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
[2023-03-09 14:44:01] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 14:44:01] [INFO ] Invariant cache hit.
[2023-03-09 14:44:01] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 412 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 8 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 14:44:01] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-09 14:44:01] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:44:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-09 14:44:01] [INFO ] [Nat]Absence check using 3 positive and 10 generalized place invariants in 4 ms returned sat
[2023-03-09 14:44:01] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:44:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 14:44:01] [INFO ] After 5ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:44:01] [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 14:44:01] [INFO ] After 95ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1452 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 922 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 959901 steps, run timeout after 3001 ms. (steps per millisecond=319 ) properties seen :{}
Probabilistic random walk after 959901 steps, saw 480047 distinct states, run finished after 3001 ms. (steps per millisecond=319 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 96 cols
[2023-03-09 14:44:04] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-09 14:44:04] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:44:04] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-09 14:44:04] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-09 14:44:04] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:44:04] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 14:44:04] [INFO ] After 16ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:44:04] [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 14:44:04] [INFO ] After 151ms 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 28 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 28 ms. Remains : 83/96 places, 83/94 transitions.
Incomplete random walk after 10000 steps, including 1418 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 927 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 984617 steps, run timeout after 3001 ms. (steps per millisecond=328 ) properties seen :{}
Probabilistic random walk after 984617 steps, saw 492419 distinct states, run finished after 3001 ms. (steps per millisecond=328 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 83 rows 83 cols
[2023-03-09 14:44:07] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-09 14:44:07] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:44:08] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-09 14:44:08] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-09 14:44:08] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:44:08] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 14:44:08] [INFO ] After 19ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:44:08] [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 14:44:08] [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 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 14:44:08] [INFO ] Invariant cache hit.
[2023-03-09 14:44:08] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-09 14:44:08] [INFO ] Invariant cache hit.
[2023-03-09 14:44:08] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 14:44:08] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
[2023-03-09 14:44:08] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 14:44:08] [INFO ] Invariant cache hit.
[2023-03-09 14:44:08] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 434 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 6 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 14:44:08] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-09 14:44:08] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:44:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 14:44:08] [INFO ] [Nat]Absence check using 3 positive and 10 generalized place invariants in 3 ms returned sat
[2023-03-09 14:44:08] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:44:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 14:44:08] [INFO ] After 5ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:44:08] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-09 14:44:08] [INFO ] After 83ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1432 resets, run finished after 15 ms. (steps per millisecond=666 ) 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 922557 steps, run timeout after 3001 ms. (steps per millisecond=307 ) properties seen :{}
Probabilistic random walk after 922557 steps, saw 461376 distinct states, run finished after 3001 ms. (steps per millisecond=307 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 96 cols
[2023-03-09 14:44:11] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-09 14:44:11] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:44:11] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2023-03-09 14:44:11] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-09 14:44:11] [INFO ] After 79ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:44:11] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 14:44:11] [INFO ] After 24ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:44:11] [INFO ] After 39ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-09 14:44:11] [INFO ] After 197ms 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 15 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 15 ms. Remains : 83/96 places, 83/94 transitions.
Incomplete random walk after 10000 steps, including 1460 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 903 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 914849 steps, run timeout after 3001 ms. (steps per millisecond=304 ) properties seen :{}
Probabilistic random walk after 914849 steps, saw 457522 distinct states, run finished after 3004 ms. (steps per millisecond=304 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 83 rows 83 cols
[2023-03-09 14:44:14] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-09 14:44:15] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:44:15] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2023-03-09 14:44:15] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 4 ms returned sat
[2023-03-09 14:44:15] [INFO ] After 68ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:44:15] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 14:44:15] [INFO ] After 26ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:44:15] [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 8 ms.
[2023-03-09 14:44:15] [INFO ] After 172ms 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 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 3 ms. Remains 83 /83 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2023-03-09 14:44:15] [INFO ] Invariant cache hit.
[2023-03-09 14:44:15] [INFO ] Implicit Places using invariants in 121 ms returned []
[2023-03-09 14:44:15] [INFO ] Invariant cache hit.
[2023-03-09 14:44:15] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 14:44:15] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
[2023-03-09 14:44:15] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 14:44:15] [INFO ] Invariant cache hit.
[2023-03-09 14:44:15] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 489 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 14:44:15] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-09 14:44:15] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:44:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-09 14:44:15] [INFO ] [Nat]Absence check using 3 positive and 10 generalized place invariants in 4 ms returned sat
[2023-03-09 14:44:15] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:44:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 14:44:15] [INFO ] After 4ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:44:15] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-09 14:44:15] [INFO ] After 88ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1496 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 891 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 988664 steps, run timeout after 3001 ms. (steps per millisecond=329 ) properties seen :{}
Probabilistic random walk after 988664 steps, saw 494436 distinct states, run finished after 3001 ms. (steps per millisecond=329 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 96 cols
[2023-03-09 14:44:18] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-09 14:44:18] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:44:18] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-09 14:44:18] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-09 14:44:18] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:44:18] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 14:44:19] [INFO ] After 17ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:44: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 14:44:19] [INFO ] After 133ms 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 16 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 16 ms. Remains : 81/96 places, 81/94 transitions.
Incomplete random walk after 10000 steps, including 1461 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 930 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1018907 steps, run timeout after 3001 ms. (steps per millisecond=339 ) properties seen :{}
Probabilistic random walk after 1018907 steps, saw 509556 distinct states, run finished after 3001 ms. (steps per millisecond=339 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 81 rows 81 cols
[2023-03-09 14:44:22] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-09 14:44:22] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:44:22] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-09 14:44:22] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 13 ms returned sat
[2023-03-09 14:44:22] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:44:22] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 14:44:22] [INFO ] After 16ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:44:22] [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 5 ms.
[2023-03-09 14:44:22] [INFO ] After 136ms 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 6 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2023-03-09 14:44:22] [INFO ] Invariant cache hit.
[2023-03-09 14:44:22] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-09 14:44:22] [INFO ] Invariant cache hit.
[2023-03-09 14:44:22] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 14:44:22] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
[2023-03-09 14:44:22] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 14:44:22] [INFO ] Invariant cache hit.
[2023-03-09 14:44:22] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 473 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 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 9 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 14:44:22] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-09 14:44:22] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:44:22] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-09 14:44:22] [INFO ] [Nat]Absence check using 5 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-09 14:44:22] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:44:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 14:44:22] [INFO ] After 5ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:44:22] [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 14:44:22] [INFO ] After 110ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1409 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 865 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 936007 steps, run timeout after 3001 ms. (steps per millisecond=311 ) properties seen :{}
Probabilistic random walk after 936007 steps, saw 468103 distinct states, run finished after 3001 ms. (steps per millisecond=311 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 96 cols
[2023-03-09 14:44:25] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-09 14:44:25] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:44:25] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-09 14:44:25] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-09 14:44:26] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:44:26] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 14:44:26] [INFO ] After 11ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:44:26] [INFO ] After 21ms 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 14:44:26] [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 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 14 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 16 ms. Remains : 81/96 places, 81/94 transitions.
Incomplete random walk after 10000 steps, including 1423 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 895 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1009749 steps, run timeout after 3001 ms. (steps per millisecond=336 ) properties seen :{}
Probabilistic random walk after 1009749 steps, saw 504977 distinct states, run finished after 3001 ms. (steps per millisecond=336 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 81 rows 81 cols
[2023-03-09 14:44:29] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-09 14:44:29] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:44:29] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-09 14:44:29] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-09 14:44:29] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:44:29] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-09 14:44:29] [INFO ] After 20ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:44:29] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2023-03-09 14:44:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2023-03-09 14:44:29] [INFO ] After 83ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-09 14:44:29] [INFO ] After 191ms 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 2 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2023-03-09 14:44:29] [INFO ] Invariant cache hit.
[2023-03-09 14:44:29] [INFO ] Implicit Places using invariants in 151 ms returned []
[2023-03-09 14:44:29] [INFO ] Invariant cache hit.
[2023-03-09 14:44:29] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-09 14:44:29] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 452 ms to find 0 implicit places.
[2023-03-09 14:44:29] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 14:44:29] [INFO ] Invariant cache hit.
[2023-03-09 14:44:29] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 540 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 14:44:29] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-09 14:44:29] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:44:29] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-09 14:44:29] [INFO ] [Nat]Absence check using 5 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-09 14:44:29] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:44:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 14:44:29] [INFO ] After 5ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:44:29] [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 14:44:30] [INFO ] After 95ms 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 10001 steps, including 920 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 970767 steps, run timeout after 3001 ms. (steps per millisecond=323 ) properties seen :{}
Probabilistic random walk after 970767 steps, saw 485482 distinct states, run finished after 3001 ms. (steps per millisecond=323 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 96 cols
[2023-03-09 14:44:33] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-09 14:44:33] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:44:33] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-09 14:44:33] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-09 14:44:33] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:44:33] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 14:44:33] [INFO ] After 17ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:44:33] [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 14:44:33] [INFO ] After 144ms 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 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 13 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 14 ms. Remains : 81/96 places, 81/94 transitions.
Incomplete random walk after 10000 steps, including 1463 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 905 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 983213 steps, run timeout after 3001 ms. (steps per millisecond=327 ) properties seen :{}
Probabilistic random walk after 983213 steps, saw 491709 distinct states, run finished after 3001 ms. (steps per millisecond=327 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 81 rows 81 cols
[2023-03-09 14:44:36] [INFO ] Computed 13 place invariants in 5 ms
[2023-03-09 14:44:36] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:44:36] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-09 14:44:36] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-09 14:44:36] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:44:36] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 14:44:36] [INFO ] After 17ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:44:36] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2023-03-09 14:44:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2023-03-09 14:44:36] [INFO ] After 62ms 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 14:44:36] [INFO ] After 154ms 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 14:44:36] [INFO ] Invariant cache hit.
[2023-03-09 14:44:36] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-09 14:44:36] [INFO ] Invariant cache hit.
[2023-03-09 14:44:36] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 14:44:36] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
[2023-03-09 14:44:36] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 14:44:36] [INFO ] Invariant cache hit.
[2023-03-09 14:44:36] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 433 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 9 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 14:44:36] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-09 14:44:36] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:44:36] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-09 14:44:36] [INFO ] [Nat]Absence check using 5 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-09 14:44:36] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:44:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 14:44:36] [INFO ] After 6ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:44:37] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2023-03-09 14:44:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2023-03-09 14:44:37] [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 4 ms.
[2023-03-09 14:44:37] [INFO ] After 133ms 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 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 895 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 947350 steps, run timeout after 3001 ms. (steps per millisecond=315 ) properties seen :{}
Probabilistic random walk after 947350 steps, saw 473775 distinct states, run finished after 3001 ms. (steps per millisecond=315 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 96 cols
[2023-03-09 14:44:40] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-09 14:44:40] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:44:40] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-09 14:44:40] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-09 14:44:40] [INFO ] After 57ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:44:40] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 14:44:40] [INFO ] After 16ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:44:40] [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 14:44:40] [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 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 11 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 11 ms. Remains : 81/96 places, 81/94 transitions.
Incomplete random walk after 10000 steps, including 1458 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 922 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 983113 steps, run timeout after 3001 ms. (steps per millisecond=327 ) properties seen :{}
Probabilistic random walk after 983113 steps, saw 491660 distinct states, run finished after 3006 ms. (steps per millisecond=327 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 81 rows 81 cols
[2023-03-09 14:44:43] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-09 14:44:43] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:44:43] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-09 14:44:43] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-09 14:44:43] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:44:43] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-09 14:44:43] [INFO ] After 13ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:44:43] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2023-03-09 14:44:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2023-03-09 14:44:43] [INFO ] After 56ms 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 14:44:43] [INFO ] After 160ms 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 1 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 14:44:43] [INFO ] Invariant cache hit.
[2023-03-09 14:44:43] [INFO ] Implicit Places using invariants in 99 ms returned []
[2023-03-09 14:44:43] [INFO ] Invariant cache hit.
[2023-03-09 14:44:43] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-09 14:44:43] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
[2023-03-09 14:44:43] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 14:44:43] [INFO ] Invariant cache hit.
[2023-03-09 14:44:43] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 413 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 14:44:43] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-09 14:44:43] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:44:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-09 14:44:43] [INFO ] [Nat]Absence check using 3 positive and 10 generalized place invariants in 5 ms returned sat
[2023-03-09 14:44:43] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:44:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 14:44:44] [INFO ] After 6ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:44:44] [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 14:44:44] [INFO ] After 94ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1411 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 903 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 904716 steps, run timeout after 3001 ms. (steps per millisecond=301 ) properties seen :{}
Probabilistic random walk after 904716 steps, saw 452456 distinct states, run finished after 3005 ms. (steps per millisecond=301 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 96 cols
[2023-03-09 14:44:47] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-09 14:44:47] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:44:47] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-09 14:44:47] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-09 14:44:47] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:44:47] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 14:44:47] [INFO ] After 14ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:44:47] [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 14:44:47] [INFO ] After 135ms 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 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 1422 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 922 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 987549 steps, run timeout after 3001 ms. (steps per millisecond=329 ) properties seen :{}
Probabilistic random walk after 987549 steps, saw 493877 distinct states, run finished after 3001 ms. (steps per millisecond=329 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 81 rows 81 cols
[2023-03-09 14:44:50] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-09 14:44:50] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:44:50] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-09 14:44:50] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-09 14:44:50] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:44:50] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-09 14:44:50] [INFO ] After 13ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:44:50] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2023-03-09 14:44:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2023-03-09 14:44:50] [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 14:44:50] [INFO ] After 169ms 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 1 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2023-03-09 14:44:50] [INFO ] Invariant cache hit.
[2023-03-09 14:44:50] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-09 14:44:50] [INFO ] Invariant cache hit.
[2023-03-09 14:44:50] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-09 14:44:50] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
[2023-03-09 14:44:50] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 14:44:50] [INFO ] Invariant cache hit.
[2023-03-09 14:44:50] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 446 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 14:44:50] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-09 14:44:50] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:44:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-09 14:44:51] [INFO ] [Nat]Absence check using 3 positive and 10 generalized place invariants in 4 ms returned sat
[2023-03-09 14:44:51] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:44:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 14:44:51] [INFO ] After 4ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:44:51] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-09 14:44:51] [INFO ] After 107ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1450 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 924 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 938434 steps, run timeout after 3001 ms. (steps per millisecond=312 ) properties seen :{}
Probabilistic random walk after 938434 steps, saw 469312 distinct states, run finished after 3001 ms. (steps per millisecond=312 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 96 cols
[2023-03-09 14:44:54] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-09 14:44:54] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:44:54] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-09 14:44:54] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-09 14:44:54] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:44:54] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 14:44:54] [INFO ] After 15ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:44:54] [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 14:44:54] [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.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 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 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 14 ms. Remains : 81/96 places, 81/94 transitions.
Incomplete random walk after 10000 steps, including 1409 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 937 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 982890 steps, run timeout after 3001 ms. (steps per millisecond=327 ) properties seen :{}
Probabilistic random walk after 982890 steps, saw 491547 distinct states, run finished after 3001 ms. (steps per millisecond=327 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 81 rows 81 cols
[2023-03-09 14:44:57] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-09 14:44:57] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:44:57] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-09 14:44:57] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 4 ms returned sat
[2023-03-09 14:44:57] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:44:57] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-09 14:44:57] [INFO ] After 16ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:44:57] [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 14:44:57] [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 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 1 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 14:44:57] [INFO ] Invariant cache hit.
[2023-03-09 14:44:57] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-09 14:44:57] [INFO ] Invariant cache hit.
[2023-03-09 14:44:57] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-09 14:44:57] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2023-03-09 14:44:57] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 14:44:57] [INFO ] Invariant cache hit.
[2023-03-09 14:44:57] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 436 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 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 14:44:57] [INFO ] Computed 13 place invariants in 3 ms
[2023-03-09 14:44:58] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:44:58] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-09 14:44:58] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-09 14:44:58] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:44:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 14:44:58] [INFO ] After 7ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:44:58] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-09 14:44:58] [INFO ] After 134ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1405 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 907 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 896150 steps, run timeout after 3001 ms. (steps per millisecond=298 ) properties seen :{}
Probabilistic random walk after 896150 steps, saw 448171 distinct states, run finished after 3001 ms. (steps per millisecond=298 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 96 cols
[2023-03-09 14:45:01] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-09 14:45:01] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:45:01] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-09 14:45:01] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-09 14:45:01] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:45:01] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 14:45:01] [INFO ] After 12ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:45:01] [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 14:45:01] [INFO ] After 126ms 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 1437 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 886 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 992195 steps, run timeout after 3001 ms. (steps per millisecond=330 ) properties seen :{}
Probabilistic random walk after 992195 steps, saw 496206 distinct states, run finished after 3001 ms. (steps per millisecond=330 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 82 rows 82 cols
[2023-03-09 14:45:04] [INFO ] Computed 13 place invariants in 4 ms
[2023-03-09 14:45:04] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:45:04] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-09 14:45:04] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-09 14:45:04] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:45:04] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-09 14:45:04] [INFO ] After 14ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:45:04] [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 6 ms.
[2023-03-09 14:45:04] [INFO ] After 130ms 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 12 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 14:45:04] [INFO ] Invariant cache hit.
[2023-03-09 14:45:04] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-09 14:45:04] [INFO ] Invariant cache hit.
[2023-03-09 14:45:04] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-09 14:45:04] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
[2023-03-09 14:45:04] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 14:45:04] [INFO ] Invariant cache hit.
[2023-03-09 14:45:05] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 432 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 1 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 8 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 14:45:05] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-09 14:45:05] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:45:05] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-09 14:45:05] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-09 14:45:05] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:45:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 14:45:05] [INFO ] After 5ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:45:05] [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 14:45:05] [INFO ] After 97ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1421 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 926 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 970086 steps, run timeout after 3001 ms. (steps per millisecond=323 ) properties seen :{}
Probabilistic random walk after 970086 steps, saw 485137 distinct states, run finished after 3001 ms. (steps per millisecond=323 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 96 cols
[2023-03-09 14:45:08] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-09 14:45:08] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:45:08] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-09 14:45:08] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-09 14:45:08] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:45:08] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 14:45:08] [INFO ] After 14ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:45:08] [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 8 ms.
[2023-03-09 14:45:08] [INFO ] After 139ms 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 1 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 10 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 1415 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 937 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 987188 steps, run timeout after 3001 ms. (steps per millisecond=328 ) properties seen :{}
Probabilistic random walk after 987188 steps, saw 493703 distinct states, run finished after 3001 ms. (steps per millisecond=328 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 82 rows 82 cols
[2023-03-09 14:45:11] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-09 14:45:11] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:45:11] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-09 14:45:11] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-09 14:45:11] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:45:11] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-09 14:45:11] [INFO ] After 15ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:45:11] [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 14:45:11] [INFO ] After 118ms 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 1 ms. Remains 82 /82 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2023-03-09 14:45:11] [INFO ] Invariant cache hit.
[2023-03-09 14:45:11] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-09 14:45:11] [INFO ] Invariant cache hit.
[2023-03-09 14:45:11] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-09 14:45:11] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
[2023-03-09 14:45:11] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 14:45:11] [INFO ] Invariant cache hit.
[2023-03-09 14:45:11] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 440 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 8 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 14:45:11] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-09 14:45:12] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:45:12] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-09 14:45:12] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-09 14:45:12] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:45:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 14:45:12] [INFO ] After 5ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:45:12] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 0 ms to minimize.
[2023-03-09 14:45:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2023-03-09 14:45:12] [INFO ] After 60ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-09 14:45:12] [INFO ] After 143ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1444 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 920 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 957526 steps, run timeout after 3001 ms. (steps per millisecond=319 ) properties seen :{}
Probabilistic random walk after 957526 steps, saw 478864 distinct states, run finished after 3001 ms. (steps per millisecond=319 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 96 cols
[2023-03-09 14:45:15] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-09 14:45:15] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:45:15] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-09 14:45:15] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-09 14:45:15] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:45:15] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 14:45:15] [INFO ] After 20ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:45:15] [INFO ] After 30ms 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 14:45:15] [INFO ] After 127ms 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 9 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 1423 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 920 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1009202 steps, run timeout after 3001 ms. (steps per millisecond=336 ) properties seen :{}
Probabilistic random walk after 1009202 steps, saw 504707 distinct states, run finished after 3001 ms. (steps per millisecond=336 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 81 rows 81 cols
[2023-03-09 14:45:18] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-09 14:45:18] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:45:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 14:45:18] [INFO ] [Nat]Absence check using 2 positive and 11 generalized place invariants in 4 ms returned sat
[2023-03-09 14:45:18] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:45:18] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 14:45:18] [INFO ] After 16ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:45:18] [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 14:45:18] [INFO ] After 113ms 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 14:45:18] [INFO ] Invariant cache hit.
[2023-03-09 14:45:18] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-09 14:45:18] [INFO ] Invariant cache hit.
[2023-03-09 14:45:18] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 14:45:18] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
[2023-03-09 14:45:18] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 14:45:18] [INFO ] Invariant cache hit.
[2023-03-09 14:45:18] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 430 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 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 14:45:18] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-09 14:45:18] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:45:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 14:45:19] [INFO ] [Nat]Absence check using 2 positive and 11 generalized place invariants in 4 ms returned sat
[2023-03-09 14:45:19] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:45:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 14:45:19] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:45:19] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-09 14:45:19] [INFO ] After 104ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1437 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 921 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 955484 steps, run timeout after 3001 ms. (steps per millisecond=318 ) properties seen :{}
Probabilistic random walk after 955484 steps, saw 477837 distinct states, run finished after 3001 ms. (steps per millisecond=318 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 96 cols
[2023-03-09 14:45:22] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-09 14:45:22] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:45:22] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-09 14:45:22] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-09 14:45:22] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:45:22] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 14:45:22] [INFO ] After 14ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:45:22] [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 14:45:22] [INFO ] After 128ms 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 9 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 9 ms. Remains : 85/96 places, 84/94 transitions.
Incomplete random walk after 10000 steps, including 1418 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 908 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 994681 steps, run timeout after 3001 ms. (steps per millisecond=331 ) properties seen :{}
Probabilistic random walk after 994681 steps, saw 497445 distinct states, run finished after 3010 ms. (steps per millisecond=330 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 84 rows 85 cols
[2023-03-09 14:45:25] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-09 14:45:25] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:45:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 14:45:25] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 5 ms returned sat
[2023-03-09 14:45:25] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:45:25] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 14:45:25] [INFO ] After 13ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:45:25] [INFO ] After 21ms 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 14:45:25] [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 2 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 2 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 1 ms. Remains 85 /85 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-09 14:45:25] [INFO ] Invariant cache hit.
[2023-03-09 14:45:25] [INFO ] Implicit Places using invariants in 100 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 101 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 4 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 14:45:25] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-09 14:45:25] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-09 14:45:25] [INFO ] Invariant cache hit.
[2023-03-09 14:45:25] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 14:45:25] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 317 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 424 ms. Remains : 82/85 places, 82/84 transitions.
Incomplete random walk after 10000 steps, including 1428 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 908 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 996831 steps, run timeout after 3001 ms. (steps per millisecond=332 ) properties seen :{}
Probabilistic random walk after 996831 steps, saw 498522 distinct states, run finished after 3001 ms. (steps per millisecond=332 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 14:45:28] [INFO ] Invariant cache hit.
[2023-03-09 14:45:28] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:45:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 14:45:29] [INFO ] [Nat]Absence check using 2 positive and 11 generalized place invariants in 4 ms returned sat
[2023-03-09 14:45:29] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:45:29] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 14:45:29] [INFO ] After 18ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:45:29] [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 14:45:29] [INFO ] After 115ms 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 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 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 1 ms. Remains 82 /82 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2023-03-09 14:45:29] [INFO ] Invariant cache hit.
[2023-03-09 14:45:29] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-09 14:45:29] [INFO ] Invariant cache hit.
[2023-03-09 14:45:29] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 14:45:29] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
[2023-03-09 14:45:29] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 14:45:29] [INFO ] Invariant cache hit.
[2023-03-09 14:45:29] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 407 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 6 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 14:45:29] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-09 14:45:29] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:45:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 14:45:29] [INFO ] [Nat]Absence check using 2 positive and 11 generalized place invariants in 4 ms returned sat
[2023-03-09 14:45:29] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:45:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 14:45:29] [INFO ] After 5ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:45:29] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-09 14:45:29] [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 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 934 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 963320 steps, run timeout after 3001 ms. (steps per millisecond=320 ) properties seen :{}
Probabilistic random walk after 963320 steps, saw 481753 distinct states, run finished after 3002 ms. (steps per millisecond=320 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 96 cols
[2023-03-09 14:45:32] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-09 14:45:32] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:45:32] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-09 14:45:32] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-09 14:45:32] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:45:32] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 14:45:32] [INFO ] After 36ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:45:32] [INFO ] After 47ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-09 14:45:32] [INFO ] After 172ms 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.1 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 9 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 9 ms. Remains : 84/96 places, 84/94 transitions.
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 899 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 954959 steps, run timeout after 3001 ms. (steps per millisecond=318 ) properties seen :{}
Probabilistic random walk after 954959 steps, saw 477580 distinct states, run finished after 3001 ms. (steps per millisecond=318 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 84 rows 84 cols
[2023-03-09 14:45:35] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-09 14:45:35] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:45:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 14:45:35] [INFO ] [Nat]Absence check using 2 positive and 11 generalized place invariants in 5 ms returned sat
[2023-03-09 14:45:36] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:45:36] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 14:45:36] [INFO ] After 17ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:45:36] [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 14:45:36] [INFO ] After 113ms 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 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 1 ms. Remains 84 /84 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-09 14:45:36] [INFO ] Invariant cache hit.
[2023-03-09 14:45:36] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-09 14:45:36] [INFO ] Invariant cache hit.
[2023-03-09 14:45:36] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-09 14:45:36] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
[2023-03-09 14:45:36] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 14:45:36] [INFO ] Invariant cache hit.
[2023-03-09 14:45:36] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 435 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 1 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 5 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 14:45:36] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-09 14:45:36] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 14:45:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 14:45:36] [INFO ] [Nat]Absence check using 2 positive and 11 generalized place invariants in 5 ms returned sat
[2023-03-09 14:45:36] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 14:45:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 14:45:36] [INFO ] After 6ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 14:45:36] [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 14:45:36] [INFO ] After 99ms 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 14:45:36] [INFO ] Computed 15 place invariants in 0 ms
[2023-03-09 14:45:36] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-09 14:45:36] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-09 14:45:36] [INFO ] [Nat]Absence check using 4 positive and 11 generalized place invariants in 5 ms returned sat
[2023-03-09 14:45:36] [INFO ] After 136ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2023-03-09 14:45:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 14:45:37] [INFO ] After 91ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :17
[2023-03-09 14:45:37] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2023-03-09 14:45:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2023-03-09 14:45:37] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2023-03-09 14:45:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2023-03-09 14:45:37] [INFO ] After 298ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 89 ms.
[2023-03-09 14:45:37] [INFO ] After 653ms 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 1043426 ms.
starting LoLA
BK_INPUT DoubleExponent-PT-004
BK_EXAMINATION: StableMarking
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution
GlobalProperty: StableMarking
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393216 kB
MemFree: 3217684 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16160496 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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/model.pnml
lola: STATE EQUATION TRIES PLACE p23
lola: LAUNCH SYMM
sara: try reading problem file stateEquationProblem-ConstantPlace-139.sara.
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 26)

lola: STATE EQUATION TRIES PLACE p164
sara: try reading problem file stateEquationProblem-ConstantPlace-73.sara.
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 100)
lola: reporting
lola: not produced: 125
lola: state equation: 1
lola: find path: 90
lola: reporting
lola: not produced: 125
lola: state equation: 1
lola: find path: 90
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: reporting
lola: not produced: 29
lola: state equation: 1
lola: find path: 90
lola: goal oriented search: 96
lola: caught signal Terminated - aborting LoLA

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY


Time elapsed: 753 secs. Pages in use: 577

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is 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 r149-smll-167819435900293"
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 ;