Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r560-tall-171734905900192.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is FireWire-PT-18, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r560-tall-171734905900192
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 8.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 10K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 168K Jun 2 16:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1717352404164

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=FireWire-PT-18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 18:20:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-06-02 18:20:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:20:05] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2024-06-02 18:20:05] [INFO ] Transformed 437 places.
[2024-06-02 18:20:05] [INFO ] Transformed 707 transitions.
[2024-06-02 18:20:05] [INFO ] Found NUPN structural information;
[2024-06-02 18:20:05] [INFO ] Parsed PT model containing 437 places and 707 transitions and 2170 arcs in 191 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 437/437 places, 707/707 transitions.
Graph (trivial) has 325 edges and 437 vertex of which 12 / 437 are part of one of the 3 SCC in 5 ms
Free SCC test removed 9 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 10 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 94 rules applied. Total rules applied 95 place count 418 transition count 613
Reduce places removed 84 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 86 rules applied. Total rules applied 181 place count 334 transition count 611
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 182 place count 333 transition count 611
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 182 place count 333 transition count 600
Deduced a syphon composed of 11 places in 5 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 204 place count 322 transition count 600
Performed 103 Post agglomeration using F-continuation condition.Transition count delta: 103
Deduced a syphon composed of 103 places in 3 ms
Reduce places removed 103 places and 0 transitions.
Iterating global reduction 3 with 206 rules applied. Total rules applied 410 place count 219 transition count 497
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 412 place count 219 transition count 495
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: -195
Deduced a syphon composed of 30 places in 2 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 472 place count 189 transition count 690
Applied a total of 472 rules in 137 ms. Remains 189 /437 variables (removed 248) and now considering 690/707 (removed 17) transitions.
[2024-06-02 18:20:05] [INFO ] Flow matrix only has 656 transitions (discarded 34 similar events)
// Phase 1: matrix 656 rows 189 cols
[2024-06-02 18:20:05] [INFO ] Computed 7 invariants in 24 ms
[2024-06-02 18:20:06] [INFO ] Implicit Places using invariants in 353 ms returned []
[2024-06-02 18:20:06] [INFO ] Flow matrix only has 656 transitions (discarded 34 similar events)
[2024-06-02 18:20:06] [INFO ] Invariant cache hit.
[2024-06-02 18:20:06] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-06-02 18:20:06] [INFO ] Implicit Places using invariants and state equation in 432 ms returned []
Implicit Place search using SMT with State Equation took 816 ms to find 0 implicit places.
Running 681 sub problems to find dead transitions.
[2024-06-02 18:20:06] [INFO ] Flow matrix only has 656 transitions (discarded 34 similar events)
[2024-06-02 18:20:06] [INFO ] Invariant cache hit.
[2024-06-02 18:20:06] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 188/188 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 2 (OVERLAPS) 1/189 variables, 7/195 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 681 unsolved
[2024-06-02 18:20:14] [INFO ] Deduced a trap composed of 60 places in 139 ms of which 13 ms to minimize.
[2024-06-02 18:20:14] [INFO ] Deduced a trap composed of 66 places in 124 ms of which 2 ms to minimize.
[2024-06-02 18:20:15] [INFO ] Deduced a trap composed of 57 places in 126 ms of which 1 ms to minimize.
[2024-06-02 18:20:15] [INFO ] Deduced a trap composed of 57 places in 179 ms of which 1 ms to minimize.
[2024-06-02 18:20:15] [INFO ] Deduced a trap composed of 114 places in 119 ms of which 1 ms to minimize.
[2024-06-02 18:20:15] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 1 ms to minimize.
[2024-06-02 18:20:16] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 1 ms to minimize.
[2024-06-02 18:20:16] [INFO ] Deduced a trap composed of 58 places in 60 ms of which 0 ms to minimize.
[2024-06-02 18:20:16] [INFO ] Deduced a trap composed of 46 places in 95 ms of which 2 ms to minimize.
[2024-06-02 18:20:17] [INFO ] Deduced a trap composed of 58 places in 51 ms of which 1 ms to minimize.
[2024-06-02 18:20:17] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 11/207 constraints. Problems are: Problem set: 0 solved, 681 unsolved
[2024-06-02 18:20:20] [INFO ] Deduced a trap composed of 124 places in 105 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 681 unsolved
[2024-06-02 18:20:24] [INFO ] Deduced a trap composed of 124 places in 111 ms of which 2 ms to minimize.
[2024-06-02 18:20:24] [INFO ] Deduced a trap composed of 134 places in 109 ms of which 2 ms to minimize.
[2024-06-02 18:20:24] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 3/211 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 8 (OVERLAPS) 655/844 variables, 189/400 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/844 variables, 14/414 constraints. Problems are: Problem set: 0 solved, 681 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 844/845 variables, and 414 constraints, problems are : Problem set: 0 solved, 681 unsolved in 30032 ms.
Refiners :[Domain max(s): 189/189 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 14/15 constraints, PredecessorRefiner: 681/681 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 681 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 188/188 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 2 (OVERLAPS) 1/189 variables, 7/195 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 15/211 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 6 (OVERLAPS) 655/844 variables, 189/400 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/844 variables, 14/414 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/844 variables, 681/1095 constraints. Problems are: Problem set: 0 solved, 681 unsolved
[2024-06-02 18:21:01] [INFO ] Deduced a trap composed of 73 places in 130 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 844/845 variables, and 1096 constraints, problems are : Problem set: 0 solved, 681 unsolved in 30016 ms.
Refiners :[Domain max(s): 189/189 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 14/15 constraints, PredecessorRefiner: 681/681 constraints, Known Traps: 16/16 constraints]
After SMT, in 61044ms problems are : Problem set: 0 solved, 681 unsolved
Search for dead transitions found 0 dead transitions in 61071ms
Starting structural reductions in LIVENESS mode, iteration 1 : 189/437 places, 690/707 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 62064 ms. Remains : 189/437 places, 690/707 transitions.
Discarding 311 transitions out of 690. Remains 379
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (2074 resets) in 2351 ms. (17 steps per ms) remains 299/378 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 299/299 properties
BEST_FIRST walk for 401 steps (8 resets) in 11 ms. (33 steps per ms) remains 299/299 properties
BEST_FIRST walk for 402 steps (8 resets) in 11 ms. (33 steps per ms) remains 299/299 properties
BEST_FIRST walk for 402 steps (8 resets) in 11 ms. (33 steps per ms) remains 299/299 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 299/299 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 299/299 properties
BEST_FIRST walk for 403 steps (8 resets) in 17 ms. (22 steps per ms) remains 299/299 properties
BEST_FIRST walk for 402 steps (8 resets) in 12 ms. (30 steps per ms) remains 299/299 properties
BEST_FIRST walk for 402 steps (8 resets) in 19 ms. (20 steps per ms) remains 299/299 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 299/299 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 299/299 properties
BEST_FIRST walk for 402 steps (8 resets) in 11 ms. (33 steps per ms) remains 299/299 properties
BEST_FIRST walk for 404 steps (8 resets) in 29 ms. (13 steps per ms) remains 299/299 properties
BEST_FIRST walk for 404 steps (8 resets) in 30 ms. (13 steps per ms) remains 299/299 properties
BEST_FIRST walk for 404 steps (8 resets) in 25 ms. (15 steps per ms) remains 299/299 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 299/299 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 299/299 properties
BEST_FIRST walk for 403 steps (8 resets) in 15 ms. (25 steps per ms) remains 299/299 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 299/299 properties
BEST_FIRST walk for 403 steps (8 resets) in 16 ms. (23 steps per ms) remains 299/299 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 299/299 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 299/299 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 299/299 properties
BEST_FIRST walk for 402 steps (8 resets) in 12 ms. (30 steps per ms) remains 299/299 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 299/299 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 299/299 properties
BEST_FIRST walk for 402 steps (8 resets) in 15 ms. (25 steps per ms) remains 299/299 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 299/299 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 299/299 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 299/299 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 299/299 properties
BEST_FIRST walk for 400 steps (8 resets) in 5 ms. (66 steps per ms) remains 299/299 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 299/299 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 299/299 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 299/299 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 299/299 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 299/299 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 299/299 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 299/299 properties
BEST_FIRST walk for 402 steps (8 resets) in 5 ms. (67 steps per ms) remains 299/299 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 299/299 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 299/299 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 299/299 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 299/299 properties
BEST_FIRST walk for 402 steps (8 resets) in 5 ms. (67 steps per ms) remains 299/299 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 299/299 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 299/299 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 299/299 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 299/299 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 299/299 properties
[2024-06-02 18:21:08] [INFO ] Flow matrix only has 656 transitions (discarded 34 similar events)
[2024-06-02 18:21:08] [INFO ] Invariant cache hit.
[2024-06-02 18:21:08] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 168/168 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/168 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (OVERLAPS) 15/183 variables, 7/175 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 15/190 constraints. Problems are: Problem set: 0 solved, 299 unsolved
[2024-06-02 18:21:12] [INFO ] Deduced a trap composed of 67 places in 195 ms of which 2 ms to minimize.
[2024-06-02 18:21:12] [INFO ] Deduced a trap composed of 57 places in 49 ms of which 1 ms to minimize.
[2024-06-02 18:21:13] [INFO ] Deduced a trap composed of 57 places in 259 ms of which 1 ms to minimize.
[2024-06-02 18:21:13] [INFO ] Deduced a trap composed of 114 places in 112 ms of which 1 ms to minimize.
[2024-06-02 18:21:13] [INFO ] Deduced a trap composed of 30 places in 130 ms of which 1 ms to minimize.
[2024-06-02 18:21:14] [INFO ] Deduced a trap composed of 24 places in 122 ms of which 2 ms to minimize.
[2024-06-02 18:21:14] [INFO ] Deduced a trap composed of 58 places in 62 ms of which 1 ms to minimize.
[2024-06-02 18:21:14] [INFO ] Deduced a trap composed of 46 places in 67 ms of which 0 ms to minimize.
SMT process timed out in 5511ms, After SMT, problems are : Problem set: 0 solved, 299 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 168 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 690/690 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 189 transition count 687
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 187 transition count 685
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 187 transition count 685
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 12 place count 187 transition count 680
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 20 place count 187 transition count 672
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 187 transition count 668
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 28 place count 183 transition count 668
Applied a total of 28 rules in 98 ms. Remains 183 /189 variables (removed 6) and now considering 668/690 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 183/189 places, 668/690 transitions.
RANDOM walk for 4000000 steps (178882 resets) in 57580 ms. (69 steps per ms) remains 176/299 properties
BEST_FIRST walk for 40004 steps (236 resets) in 179 ms. (222 steps per ms) remains 173/176 properties
BEST_FIRST walk for 40004 steps (248 resets) in 209 ms. (190 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40001 steps (412 resets) in 185 ms. (215 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40003 steps (243 resets) in 233 ms. (170 steps per ms) remains 170/173 properties
BEST_FIRST walk for 40003 steps (421 resets) in 183 ms. (217 steps per ms) remains 170/170 properties
BEST_FIRST walk for 40002 steps (239 resets) in 210 ms. (189 steps per ms) remains 166/170 properties
BEST_FIRST walk for 40004 steps (416 resets) in 179 ms. (222 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40003 steps (231 resets) in 155 ms. (256 steps per ms) remains 164/166 properties
BEST_FIRST walk for 40002 steps (414 resets) in 117 ms. (339 steps per ms) remains 164/164 properties
BEST_FIRST walk for 40002 steps (236 resets) in 110 ms. (360 steps per ms) remains 164/164 properties
BEST_FIRST walk for 40003 steps (416 resets) in 118 ms. (336 steps per ms) remains 164/164 properties
BEST_FIRST walk for 40003 steps (232 resets) in 121 ms. (327 steps per ms) remains 163/164 properties
BEST_FIRST walk for 40004 steps (406 resets) in 356 ms. (112 steps per ms) remains 162/163 properties
BEST_FIRST walk for 40003 steps (244 resets) in 124 ms. (320 steps per ms) remains 160/162 properties
BEST_FIRST walk for 40001 steps (234 resets) in 121 ms. (327 steps per ms) remains 160/160 properties
BEST_FIRST walk for 40004 steps (444 resets) in 111 ms. (357 steps per ms) remains 160/160 properties
BEST_FIRST walk for 40004 steps (221 resets) in 114 ms. (347 steps per ms) remains 160/160 properties
BEST_FIRST walk for 40004 steps (236 resets) in 113 ms. (350 steps per ms) remains 160/160 properties
BEST_FIRST walk for 40003 steps (412 resets) in 109 ms. (363 steps per ms) remains 160/160 properties
BEST_FIRST walk for 40003 steps (224 resets) in 108 ms. (367 steps per ms) remains 160/160 properties
BEST_FIRST walk for 40003 steps (415 resets) in 110 ms. (360 steps per ms) remains 160/160 properties
BEST_FIRST walk for 40004 steps (245 resets) in 113 ms. (350 steps per ms) remains 160/160 properties
BEST_FIRST walk for 40003 steps (417 resets) in 123 ms. (322 steps per ms) remains 160/160 properties
BEST_FIRST walk for 40004 steps (237 resets) in 127 ms. (312 steps per ms) remains 157/160 properties
BEST_FIRST walk for 40004 steps (415 resets) in 110 ms. (360 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40004 steps (238 resets) in 112 ms. (354 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40004 steps (417 resets) in 112 ms. (354 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40004 steps (241 resets) in 109 ms. (363 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40004 steps (421 resets) in 142 ms. (279 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40003 steps (237 resets) in 124 ms. (320 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40004 steps (415 resets) in 105 ms. (377 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40004 steps (426 resets) in 106 ms. (373 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40002 steps (423 resets) in 108 ms. (366 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40002 steps (421 resets) in 103 ms. (384 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40004 steps (432 resets) in 118 ms. (336 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40003 steps (421 resets) in 120 ms. (330 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40003 steps (412 resets) in 100 ms. (396 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40004 steps (409 resets) in 104 ms. (380 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40002 steps (424 resets) in 99 ms. (400 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40003 steps (408 resets) in 101 ms. (392 steps per ms) remains 156/157 properties
BEST_FIRST walk for 40003 steps (413 resets) in 99 ms. (400 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40003 steps (231 resets) in 106 ms. (373 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (237 resets) in 106 ms. (373 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40003 steps (495 resets) in 118 ms. (336 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40003 steps (249 resets) in 106 ms. (373 steps per ms) remains 155/156 properties
BEST_FIRST walk for 40004 steps (248 resets) in 107 ms. (370 steps per ms) remains 154/155 properties
BEST_FIRST walk for 40004 steps (499 resets) in 115 ms. (344 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40002 steps (408 resets) in 104 ms. (380 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40003 steps (423 resets) in 105 ms. (377 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40004 steps (437 resets) in 100 ms. (396 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40004 steps (422 resets) in 99 ms. (400 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40004 steps (448 resets) in 99 ms. (400 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40003 steps (430 resets) in 101 ms. (392 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40004 steps (414 resets) in 101 ms. (392 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40003 steps (420 resets) in 101 ms. (392 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40004 steps (429 resets) in 102 ms. (388 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40001 steps (397 resets) in 106 ms. (373 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40003 steps (402 resets) in 105 ms. (377 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40003 steps (422 resets) in 103 ms. (384 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40003 steps (427 resets) in 102 ms. (388 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40003 steps (405 resets) in 103 ms. (384 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40003 steps (419 resets) in 144 ms. (275 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40004 steps (406 resets) in 120 ms. (330 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40002 steps (408 resets) in 100 ms. (396 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40004 steps (420 resets) in 101 ms. (392 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40001 steps (432 resets) in 99 ms. (400 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40003 steps (422 resets) in 100 ms. (396 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40003 steps (428 resets) in 106 ms. (373 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40002 steps (434 resets) in 103 ms. (384 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40004 steps (420 resets) in 102 ms. (388 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40004 steps (418 resets) in 103 ms. (384 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40002 steps (412 resets) in 102 ms. (388 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40003 steps (414 resets) in 102 ms. (388 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40003 steps (421 resets) in 103 ms. (384 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40003 steps (411 resets) in 146 ms. (272 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40002 steps (428 resets) in 115 ms. (344 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40003 steps (412 resets) in 103 ms. (384 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40003 steps (436 resets) in 104 ms. (380 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40003 steps (430 resets) in 101 ms. (392 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40003 steps (412 resets) in 106 ms. (373 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40004 steps (437 resets) in 103 ms. (384 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40002 steps (413 resets) in 105 ms. (377 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40003 steps (434 resets) in 104 ms. (380 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40003 steps (426 resets) in 103 ms. (384 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40003 steps (430 resets) in 103 ms. (384 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40003 steps (417 resets) in 103 ms. (384 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40004 steps (432 resets) in 108 ms. (367 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40004 steps (433 resets) in 104 ms. (380 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40002 steps (437 resets) in 104 ms. (380 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40003 steps (427 resets) in 103 ms. (384 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40003 steps (431 resets) in 105 ms. (377 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40002 steps (567 resets) in 118 ms. (336 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40002 steps (564 resets) in 116 ms. (341 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40004 steps (431 resets) in 102 ms. (388 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40003 steps (409 resets) in 102 ms. (388 steps per ms) remains 154/154 properties
[2024-06-02 18:21:34] [INFO ] Flow matrix only has 636 transitions (discarded 32 similar events)
// Phase 1: matrix 636 rows 183 cols
[2024-06-02 18:21:34] [INFO ] Computed 7 invariants in 6 ms
[2024-06-02 18:21:34] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (OVERLAPS) 63/177 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 154 unsolved
[2024-06-02 18:21:35] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 0 ms to minimize.
[2024-06-02 18:21:35] [INFO ] Deduced a trap composed of 56 places in 51 ms of which 1 ms to minimize.
[2024-06-02 18:21:35] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 1 ms to minimize.
[2024-06-02 18:21:36] [INFO ] Deduced a trap composed of 55 places in 50 ms of which 1 ms to minimize.
[2024-06-02 18:21:36] [INFO ] Deduced a trap composed of 55 places in 109 ms of which 2 ms to minimize.
[2024-06-02 18:21:36] [INFO ] Deduced a trap composed of 110 places in 113 ms of which 1 ms to minimize.
[2024-06-02 18:21:36] [INFO ] Deduced a trap composed of 120 places in 110 ms of which 2 ms to minimize.
[2024-06-02 18:21:36] [INFO ] Deduced a trap composed of 120 places in 111 ms of which 2 ms to minimize.
[2024-06-02 18:21:36] [INFO ] Deduced a trap composed of 130 places in 109 ms of which 1 ms to minimize.
[2024-06-02 18:21:36] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 2 ms to minimize.
[2024-06-02 18:21:37] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 5 ms to minimize.
[2024-06-02 18:21:37] [INFO ] Deduced a trap composed of 61 places in 106 ms of which 1 ms to minimize.
[2024-06-02 18:21:37] [INFO ] Deduced a trap composed of 56 places in 52 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (OVERLAPS) 636/813 variables, 177/197 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/813 variables, 16/213 constraints. Problems are: Problem set: 0 solved, 154 unsolved
[2024-06-02 18:21:40] [INFO ] Deduced a trap composed of 60 places in 123 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/813 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/813 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 8 (OVERLAPS) 6/819 variables, 6/220 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/819 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 10 (OVERLAPS) 0/819 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Real declared 819/819 variables, and 220 constraints, problems are : Problem set: 0 solved, 154 unsolved in 16115 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 183/183 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 154 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (OVERLAPS) 63/177 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (OVERLAPS) 636/813 variables, 177/198 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/813 variables, 16/214 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/813 variables, 147/361 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/813 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 8 (OVERLAPS) 6/819 variables, 6/367 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/819 variables, 7/374 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/819 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 11 (OVERLAPS) 0/819 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Int declared 819/819 variables, and 374 constraints, problems are : Problem set: 0 solved, 154 unsolved in 45010 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 183/183 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 14/14 constraints]
After SMT, in 61259ms problems are : Problem set: 0 solved, 154 unsolved
Fused 154 Parikh solutions to 118 different solutions.
Parikh walk visited 0 properties in 16381 ms.
Support contains 114 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 668/668 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 180 transition count 494
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 180 transition count 494
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 180 transition count 492
Applied a total of 8 rules in 19 ms. Remains 180 /183 variables (removed 3) and now considering 492/668 (removed 176) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 180/183 places, 492/668 transitions.
RANDOM walk for 4000000 steps (183471 resets) in 48507 ms. (82 steps per ms) remains 143/154 properties
BEST_FIRST walk for 40004 steps (285 resets) in 270 ms. (147 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40004 steps (267 resets) in 244 ms. (163 steps per ms) remains 142/143 properties
BEST_FIRST walk for 40003 steps (441 resets) in 194 ms. (205 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40002 steps (271 resets) in 214 ms. (186 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40002 steps (445 resets) in 166 ms. (239 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (263 resets) in 198 ms. (201 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (441 resets) in 242 ms. (164 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (266 resets) in 207 ms. (192 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (454 resets) in 157 ms. (253 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (270 resets) in 192 ms. (207 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (447 resets) in 178 ms. (223 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (273 resets) in 278 ms. (143 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (449 resets) in 166 ms. (239 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40001 steps (274 resets) in 166 ms. (239 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (446 resets) in 201 ms. (198 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40001 steps (273 resets) in 178 ms. (223 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (274 resets) in 231 ms. (172 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (459 resets) in 214 ms. (186 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40002 steps (272 resets) in 151 ms. (263 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (452 resets) in 201 ms. (198 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40002 steps (275 resets) in 171 ms. (232 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (450 resets) in 165 ms. (240 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (282 resets) in 226 ms. (176 steps per ms) remains 141/142 properties
BEST_FIRST walk for 40003 steps (445 resets) in 178 ms. (223 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40004 steps (271 resets) in 178 ms. (223 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40002 steps (454 resets) in 181 ms. (219 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40004 steps (285 resets) in 283 ms. (140 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40004 steps (436 resets) in 188 ms. (211 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40002 steps (274 resets) in 227 ms. (175 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40002 steps (439 resets) in 177 ms. (224 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40003 steps (458 resets) in 145 ms. (273 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40003 steps (460 resets) in 268 ms. (148 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40002 steps (464 resets) in 205 ms. (194 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40003 steps (460 resets) in 202 ms. (197 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40003 steps (424 resets) in 194 ms. (205 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40004 steps (455 resets) in 266 ms. (149 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40003 steps (445 resets) in 220 ms. (181 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40004 steps (442 resets) in 118 ms. (336 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40003 steps (442 resets) in 169 ms. (235 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40002 steps (279 resets) in 222 ms. (179 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40003 steps (543 resets) in 189 ms. (210 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40002 steps (264 resets) in 228 ms. (174 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40004 steps (272 resets) in 224 ms. (177 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40004 steps (547 resets) in 313 ms. (127 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40004 steps (452 resets) in 210 ms. (189 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40003 steps (457 resets) in 174 ms. (228 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40002 steps (459 resets) in 245 ms. (162 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40004 steps (460 resets) in 201 ms. (198 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40002 steps (448 resets) in 188 ms. (211 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40001 steps (450 resets) in 223 ms. (178 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40004 steps (442 resets) in 185 ms. (215 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40003 steps (447 resets) in 177 ms. (224 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40004 steps (447 resets) in 141 ms. (281 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40002 steps (458 resets) in 173 ms. (229 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40003 steps (447 resets) in 178 ms. (223 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40003 steps (458 resets) in 148 ms. (268 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40001 steps (459 resets) in 142 ms. (279 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40002 steps (447 resets) in 149 ms. (266 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40002 steps (464 resets) in 239 ms. (166 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40003 steps (455 resets) in 163 ms. (243 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40002 steps (449 resets) in 163 ms. (243 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40002 steps (443 resets) in 170 ms. (233 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40003 steps (458 resets) in 211 ms. (188 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40002 steps (446 resets) in 126 ms. (314 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40002 steps (443 resets) in 195 ms. (204 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40002 steps (459 resets) in 220 ms. (181 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40003 steps (462 resets) in 162 ms. (245 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40004 steps (453 resets) in 256 ms. (155 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40002 steps (435 resets) in 189 ms. (210 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40002 steps (447 resets) in 197 ms. (202 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40004 steps (462 resets) in 191 ms. (208 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40002 steps (459 resets) in 181 ms. (219 steps per ms) remains 141/141 properties
Interrupted probabilistic random walk after 3646653 steps, run timeout after 57001 ms. (steps per millisecond=63 ) properties seen :41 out of 141
Probabilistic random walk after 3646653 steps, saw 1107374 distinct states, run finished after 57009 ms. (steps per millisecond=63 ) properties seen :41
[2024-06-02 18:24:09] [INFO ] Flow matrix only has 475 transitions (discarded 17 similar events)
// Phase 1: matrix 475 rows 180 cols
[2024-06-02 18:24:09] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 18:24:09] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 84/161 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-06-02 18:24:09] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
[2024-06-02 18:24:10] [INFO ] Deduced a trap composed of 55 places in 96 ms of which 2 ms to minimize.
[2024-06-02 18:24:10] [INFO ] Deduced a trap composed of 120 places in 87 ms of which 1 ms to minimize.
[2024-06-02 18:24:10] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 2 ms to minimize.
[2024-06-02 18:24:10] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 2 ms to minimize.
[2024-06-02 18:24:10] [INFO ] Deduced a trap composed of 56 places in 44 ms of which 0 ms to minimize.
[2024-06-02 18:24:10] [INFO ] Deduced a trap composed of 58 places in 85 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 10/171 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-06-02 18:24:11] [INFO ] Deduced a trap composed of 55 places in 43 ms of which 1 ms to minimize.
[2024-06-02 18:24:11] [INFO ] Deduced a trap composed of 44 places in 32 ms of which 1 ms to minimize.
[2024-06-02 18:24:12] [INFO ] Deduced a trap composed of 57 places in 89 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-06-02 18:24:12] [INFO ] Deduced a trap composed of 120 places in 87 ms of which 2 ms to minimize.
[2024-06-02 18:24:12] [INFO ] Deduced a trap composed of 130 places in 76 ms of which 2 ms to minimize.
[2024-06-02 18:24:12] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 475/646 variables, 171/191 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 13/204 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/646 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 11 (OVERLAPS) 9/655 variables, 9/213 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/655 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 13 (OVERLAPS) 0/655 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 655/655 variables, and 213 constraints, problems are : Problem set: 0 solved, 100 unsolved in 9103 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 180/180 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 84/161 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 10/171 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 475/646 variables, 171/191 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/646 variables, 13/204 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/646 variables, 96/300 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/646 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 11 (OVERLAPS) 9/655 variables, 9/309 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/655 variables, 4/313 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/655 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 14 (OVERLAPS) 0/655 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 655/655 variables, and 313 constraints, problems are : Problem set: 0 solved, 100 unsolved in 20701 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 180/180 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 13/13 constraints]
After SMT, in 29887ms problems are : Problem set: 0 solved, 100 unsolved
Parikh walk visited 0 properties in 10708 ms.
Support contains 77 out of 180 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 492/492 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 172 transition count 484
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 172 transition count 484
Free-agglomeration rule applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 172 transition count 480
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 30 place count 168 transition count 474
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 166 transition count 472
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 166 transition count 472
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 37 place count 166 transition count 469
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 2 with 16 rules applied. Total rules applied 53 place count 166 transition count 453
Applied a total of 53 rules in 38 ms. Remains 166 /180 variables (removed 14) and now considering 453/492 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 166/180 places, 453/492 transitions.
RANDOM walk for 4000000 steps (197303 resets) in 53097 ms. (75 steps per ms) remains 98/100 properties
BEST_FIRST walk for 400004 steps (2968 resets) in 1535 ms. (260 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400003 steps (2955 resets) in 1590 ms. (251 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400002 steps (4899 resets) in 1194 ms. (334 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400002 steps (2978 resets) in 1523 ms. (262 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (4856 resets) in 1337 ms. (298 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400003 steps (2952 resets) in 1769 ms. (225 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400002 steps (4827 resets) in 1275 ms. (313 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400002 steps (2967 resets) in 1573 ms. (254 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400003 steps (4895 resets) in 1175 ms. (340 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400003 steps (2988 resets) in 1624 ms. (246 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400003 steps (4806 resets) in 1261 ms. (316 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400001 steps (2980 resets) in 1526 ms. (261 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400003 steps (4855 resets) in 1195 ms. (334 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (2971 resets) in 1512 ms. (264 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400003 steps (4858 resets) in 1331 ms. (300 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400003 steps (4836 resets) in 1339 ms. (298 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (4842 resets) in 1725 ms. (231 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400003 steps (4860 resets) in 1332 ms. (300 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400002 steps (4881 resets) in 1218 ms. (328 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400003 steps (4868 resets) in 1284 ms. (311 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (4896 resets) in 1187 ms. (336 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400002 steps (4945 resets) in 1268 ms. (315 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400003 steps (4854 resets) in 1534 ms. (260 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (4847 resets) in 1252 ms. (319 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400002 steps (4789 resets) in 1348 ms. (296 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400003 steps (5578 resets) in 1466 ms. (272 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400002 steps (2983 resets) in 1274 ms. (313 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400003 steps (2946 resets) in 1615 ms. (247 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400003 steps (5943 resets) in 1277 ms. (312 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (4868 resets) in 1175 ms. (340 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400003 steps (4872 resets) in 1676 ms. (238 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400003 steps (4864 resets) in 1226 ms. (326 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400002 steps (4870 resets) in 1536 ms. (260 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400003 steps (4845 resets) in 1145 ms. (349 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400002 steps (4873 resets) in 1416 ms. (282 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400003 steps (4892 resets) in 1205 ms. (331 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400002 steps (4868 resets) in 1359 ms. (294 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (4863 resets) in 1147 ms. (348 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400002 steps (4835 resets) in 1554 ms. (257 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400003 steps (4823 resets) in 1138 ms. (351 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (4839 resets) in 1381 ms. (289 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400001 steps (4889 resets) in 1664 ms. (240 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400003 steps (4842 resets) in 1292 ms. (309 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400003 steps (4876 resets) in 1253 ms. (318 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400002 steps (4820 resets) in 1329 ms. (300 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (4843 resets) in 1312 ms. (304 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (4869 resets) in 1422 ms. (281 steps per ms) remains 97/98 properties
BEST_FIRST walk for 400003 steps (4861 resets) in 1548 ms. (258 steps per ms) remains 97/97 properties
BEST_FIRST walk for 400002 steps (4847 resets) in 1324 ms. (301 steps per ms) remains 97/97 properties
BEST_FIRST walk for 400003 steps (4874 resets) in 1181 ms. (338 steps per ms) remains 97/97 properties
BEST_FIRST walk for 400004 steps (4883 resets) in 1206 ms. (331 steps per ms) remains 97/97 properties
BEST_FIRST walk for 400004 steps (4912 resets) in 1387 ms. (288 steps per ms) remains 97/97 properties
BEST_FIRST walk for 400003 steps (4829 resets) in 1510 ms. (264 steps per ms) remains 97/97 properties
BEST_FIRST walk for 400003 steps (4831 resets) in 1190 ms. (335 steps per ms) remains 97/97 properties
BEST_FIRST walk for 400003 steps (4876 resets) in 1373 ms. (291 steps per ms) remains 97/97 properties
BEST_FIRST walk for 400004 steps (4859 resets) in 1329 ms. (300 steps per ms) remains 97/97 properties
BEST_FIRST walk for 400003 steps (4895 resets) in 1456 ms. (274 steps per ms) remains 97/97 properties
BEST_FIRST walk for 400002 steps (4896 resets) in 1790 ms. (223 steps per ms) remains 97/97 properties
BEST_FIRST walk for 400003 steps (4907 resets) in 1168 ms. (342 steps per ms) remains 97/97 properties
BEST_FIRST walk for 400002 steps (4876 resets) in 1444 ms. (276 steps per ms) remains 96/97 properties
BEST_FIRST walk for 400003 steps (4900 resets) in 1453 ms. (275 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400004 steps (4902 resets) in 1125 ms. (355 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400003 steps (4877 resets) in 1489 ms. (268 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400002 steps (6601 resets) in 1623 ms. (246 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400002 steps (6565 resets) in 1309 ms. (305 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400003 steps (6380 resets) in 1325 ms. (301 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400003 steps (4898 resets) in 1539 ms. (259 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400004 steps (4844 resets) in 1500 ms. (266 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400003 steps (4865 resets) in 1109 ms. (360 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400004 steps (4865 resets) in 1242 ms. (321 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400001 steps (6447 resets) in 1356 ms. (294 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400001 steps (4834 resets) in 1143 ms. (349 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400004 steps (6423 resets) in 1969 ms. (203 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400002 steps (4893 resets) in 1174 ms. (340 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400003 steps (4898 resets) in 1307 ms. (305 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400003 steps (4859 resets) in 1411 ms. (283 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400004 steps (4936 resets) in 1255 ms. (318 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400003 steps (4871 resets) in 1239 ms. (322 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400000 steps (4871 resets) in 1284 ms. (311 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400003 steps (4840 resets) in 1349 ms. (296 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400003 steps (4839 resets) in 1339 ms. (298 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400004 steps (4865 resets) in 1347 ms. (296 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400003 steps (6421 resets) in 1491 ms. (268 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400004 steps (4117 resets) in 1492 ms. (267 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400004 steps (4161 resets) in 1103 ms. (362 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400003 steps (4138 resets) in 1190 ms. (335 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400003 steps (4077 resets) in 1106 ms. (361 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400004 steps (4094 resets) in 1070 ms. (373 steps per ms) remains 96/96 properties
BEST_FIRST walk for 400004 steps (4105 resets) in 1639 ms. (243 steps per ms) remains 95/96 properties
BEST_FIRST walk for 400003 steps (4855 resets) in 1110 ms. (360 steps per ms) remains 95/95 properties
BEST_FIRST walk for 400003 steps (4874 resets) in 1393 ms. (286 steps per ms) remains 95/95 properties
BEST_FIRST walk for 400003 steps (4835 resets) in 1255 ms. (318 steps per ms) remains 95/95 properties
BEST_FIRST walk for 400003 steps (4899 resets) in 1258 ms. (317 steps per ms) remains 95/95 properties
BEST_FIRST walk for 400003 steps (4890 resets) in 1428 ms. (279 steps per ms) remains 95/95 properties
BEST_FIRST walk for 400004 steps (4889 resets) in 1219 ms. (327 steps per ms) remains 95/95 properties
BEST_FIRST walk for 400003 steps (2945 resets) in 1628 ms. (245 steps per ms) remains 95/95 properties
BEST_FIRST walk for 400001 steps (4851 resets) in 1139 ms. (350 steps per ms) remains 95/95 properties
Interrupted probabilistic random walk after 17561511 steps, run timeout after 183001 ms. (steps per millisecond=95 ) properties seen :42 out of 95
Probabilistic random walk after 17561511 steps, saw 4932270 distinct states, run finished after 183001 ms. (steps per millisecond=95 ) properties seen :42
[2024-06-02 18:28:54] [INFO ] Flow matrix only has 446 transitions (discarded 7 similar events)
// Phase 1: matrix 446 rows 166 cols
[2024-06-02 18:28:54] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 18:28:54] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 57/92 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-02 18:28:54] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 0 ms to minimize.
[2024-06-02 18:28:54] [INFO ] Deduced a trap composed of 55 places in 45 ms of which 0 ms to minimize.
[2024-06-02 18:28:54] [INFO ] Deduced a trap composed of 56 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (OVERLAPS) 64/156 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-02 18:28:55] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 1 ms to minimize.
[2024-06-02 18:28:55] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 5 ms to minimize.
[2024-06-02 18:28:55] [INFO ] Deduced a trap composed of 56 places in 87 ms of which 1 ms to minimize.
[2024-06-02 18:28:55] [INFO ] Deduced a trap composed of 56 places in 79 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 446/602 variables, 156/170 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/602 variables, 54/224 constraints. Problems are: Problem set: 0 solved, 53 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/602 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (OVERLAPS) 10/612 variables, 10/234 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/612 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 12 (OVERLAPS) 0/612 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 612/612 variables, and 234 constraints, problems are : Problem set: 0 solved, 53 unsolved in 3376 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 166/166 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 57/92 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (OVERLAPS) 64/156 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 446/602 variables, 156/170 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/602 variables, 54/224 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/602 variables, 53/277 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-02 18:28:59] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/602 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/602 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 12 (OVERLAPS) 10/612 variables, 10/288 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/612 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 14 (OVERLAPS) 0/612 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 612/612 variables, and 288 constraints, problems are : Problem set: 0 solved, 53 unsolved in 8740 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 166/166 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 8/8 constraints]
After SMT, in 12165ms problems are : Problem set: 0 solved, 53 unsolved
Parikh walk visited 0 properties in 2789 ms.
Support contains 35 out of 166 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 453/453 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 156 transition count 434
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 156 transition count 434
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 154 transition count 429
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 154 transition count 429
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 27 place count 154 transition count 426
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 153 transition count 423
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 153 transition count 423
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 152 transition count 421
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 152 transition count 421
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 151 transition count 418
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 151 transition count 418
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 150 transition count 416
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 150 transition count 416
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 149 transition count 413
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 149 transition count 413
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 148 transition count 411
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 148 transition count 411
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 147 transition count 408
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 147 transition count 408
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 146 transition count 406
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 146 transition count 406
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 145 transition count 404
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 145 transition count 404
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 144 transition count 402
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 144 transition count 402
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 144 transition count 400
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 53 place count 144 transition count 396
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 57 place count 140 transition count 396
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 139 transition count 395
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 139 transition count 395
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 62 place count 139 transition count 392
Applied a total of 62 rules in 70 ms. Remains 139 /166 variables (removed 27) and now considering 392/453 (removed 61) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 139/166 places, 392/453 transitions.
RANDOM walk for 4000000 steps (185404 resets) in 36547 ms. (109 steps per ms) remains 52/53 properties
BEST_FIRST walk for 400002 steps (1915 resets) in 1412 ms. (283 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400004 steps (4737 resets) in 1145 ms. (349 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400004 steps (1929 resets) in 1285 ms. (311 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400004 steps (4726 resets) in 1316 ms. (303 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400002 steps (1933 resets) in 1314 ms. (304 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400003 steps (4710 resets) in 1180 ms. (338 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400002 steps (1942 resets) in 1212 ms. (329 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400004 steps (4718 resets) in 1076 ms. (371 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400004 steps (1931 resets) in 1241 ms. (322 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400003 steps (4670 resets) in 1286 ms. (310 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400003 steps (1955 resets) in 1094 ms. (365 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400003 steps (4718 resets) in 954 ms. (418 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400004 steps (1953 resets) in 1055 ms. (378 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400003 steps (4747 resets) in 1039 ms. (384 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400004 steps (1924 resets) in 1116 ms. (358 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400002 steps (1933 resets) in 1174 ms. (340 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400001 steps (4727 resets) in 1092 ms. (365 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400003 steps (4748 resets) in 923 ms. (432 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400004 steps (4715 resets) in 954 ms. (418 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400004 steps (4760 resets) in 1098 ms. (363 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400003 steps (4690 resets) in 914 ms. (437 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400004 steps (4699 resets) in 1009 ms. (396 steps per ms) remains 52/52 properties
BEST_FIRST walk for 400003 steps (4668 resets) in 995 ms. (401 steps per ms) remains 50/52 properties
BEST_FIRST walk for 400004 steps (4734 resets) in 1267 ms. (315 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (4684 resets) in 1073 ms. (372 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400002 steps (4662 resets) in 953 ms. (419 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (4640 resets) in 1007 ms. (396 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (4680 resets) in 903 ms. (442 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (4687 resets) in 1153 ms. (346 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (4743 resets) in 934 ms. (427 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (4724 resets) in 867 ms. (460 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (4685 resets) in 1081 ms. (369 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (4758 resets) in 1126 ms. (354 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (4755 resets) in 1090 ms. (366 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (4753 resets) in 929 ms. (430 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (4696 resets) in 947 ms. (421 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (6149 resets) in 1071 ms. (373 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (4747 resets) in 1127 ms. (354 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400001 steps (4666 resets) in 1217 ms. (328 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400002 steps (4748 resets) in 1003 ms. (398 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (4736 resets) in 1209 ms. (330 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (4736 resets) in 967 ms. (413 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (4688 resets) in 1073 ms. (372 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (4697 resets) in 1160 ms. (344 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (4704 resets) in 1045 ms. (382 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (4750 resets) in 915 ms. (436 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (4706 resets) in 1013 ms. (394 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (4763 resets) in 1095 ms. (364 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (4739 resets) in 1071 ms. (373 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (1944 resets) in 1234 ms. (323 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (4687 resets) in 818 ms. (488 steps per ms) remains 50/50 properties
Interrupted probabilistic random walk after 10242952 steps, run timeout after 96001 ms. (steps per millisecond=106 ) properties seen :18 out of 50
Probabilistic random walk after 10242952 steps, saw 2868614 distinct states, run finished after 96002 ms. (steps per millisecond=106 ) properties seen :18
[2024-06-02 18:31:17] [INFO ] Flow matrix only has 385 transitions (discarded 7 similar events)
// Phase 1: matrix 385 rows 139 cols
[2024-06-02 18:31:17] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 18:31:17] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 61/84 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-06-02 18:31:18] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
[2024-06-02 18:31:18] [INFO ] Deduced a trap composed of 48 places in 39 ms of which 1 ms to minimize.
[2024-06-02 18:31:18] [INFO ] Deduced a trap composed of 50 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 47/131 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-06-02 18:31:18] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 385/516 variables, 131/142 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/516 variables, 49/191 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/516 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 10 (OVERLAPS) 8/524 variables, 8/199 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-06-02 18:31:19] [INFO ] Deduced a trap composed of 46 places in 73 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/524 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/524 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 13 (OVERLAPS) 0/524 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 524/524 variables, and 200 constraints, problems are : Problem set: 0 solved, 32 unsolved in 2666 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 139/139 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 61/84 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 47/131 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 385/516 variables, 131/143 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/516 variables, 49/192 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/516 variables, 32/224 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/516 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 11 (OVERLAPS) 8/524 variables, 8/232 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/524 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-06-02 18:31:22] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/524 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/524 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 15 (OVERLAPS) 0/524 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 524/524 variables, and 233 constraints, problems are : Problem set: 0 solved, 32 unsolved in 3624 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 139/139 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 6/6 constraints]
After SMT, in 6318ms problems are : Problem set: 0 solved, 32 unsolved
Parikh walk visited 0 properties in 1691 ms.
Support contains 23 out of 139 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 392/392 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 136 transition count 385
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 136 transition count 385
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 135 transition count 382
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 135 transition count 382
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 135 transition count 379
Applied a total of 11 rules in 13 ms. Remains 135 /139 variables (removed 4) and now considering 379/392 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 135/139 places, 379/392 transitions.
RANDOM walk for 4000000 steps (185572 resets) in 29409 ms. (136 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400001 steps (1911 resets) in 997 ms. (400 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400002 steps (4696 resets) in 801 ms. (498 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (1936 resets) in 1085 ms. (368 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400002 steps (4694 resets) in 1030 ms. (387 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (1958 resets) in 1048 ms. (381 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400002 steps (4737 resets) in 1042 ms. (383 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400001 steps (1924 resets) in 976 ms. (409 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400002 steps (4741 resets) in 1017 ms. (392 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400002 steps (1927 resets) in 1058 ms. (377 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (4694 resets) in 1019 ms. (392 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (4727 resets) in 1022 ms. (391 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (1962 resets) in 1029 ms. (388 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (4719 resets) in 967 ms. (413 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (4723 resets) in 861 ms. (464 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400001 steps (4717 resets) in 848 ms. (471 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (4759 resets) in 874 ms. (457 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400002 steps (4682 resets) in 874 ms. (457 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (4722 resets) in 866 ms. (461 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (4654 resets) in 905 ms. (441 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (4710 resets) in 924 ms. (432 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (4665 resets) in 1001 ms. (399 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400002 steps (4659 resets) in 947 ms. (421 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (4799 resets) in 846 ms. (472 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400002 steps (4736 resets) in 910 ms. (439 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (4739 resets) in 960 ms. (416 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (4766 resets) in 963 ms. (414 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (4737 resets) in 919 ms. (434 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (4672 resets) in 903 ms. (442 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (4724 resets) in 1127 ms. (354 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400002 steps (4722 resets) in 885 ms. (451 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (4706 resets) in 1008 ms. (396 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (4771 resets) in 908 ms. (440 steps per ms) remains 32/32 properties
Interrupted probabilistic random walk after 6927124 steps, run timeout after 63001 ms. (steps per millisecond=109 ) properties seen :0 out of 32
Probabilistic random walk after 6927124 steps, saw 1920713 distinct states, run finished after 63001 ms. (steps per millisecond=109 ) properties seen :0
[2024-06-02 18:32:50] [INFO ] Flow matrix only has 372 transitions (discarded 7 similar events)
// Phase 1: matrix 372 rows 135 cols
[2024-06-02 18:32:50] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 18:32:50] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 57/80 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-06-02 18:32:50] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-06-02 18:32:50] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 0 ms to minimize.
[2024-06-02 18:32:50] [INFO ] Deduced a trap composed of 49 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 47/127 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-06-02 18:32:51] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 0 ms to minimize.
[2024-06-02 18:32:51] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-06-02 18:32:51] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-06-02 18:32:51] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 372/499 variables, 127/141 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/499 variables, 47/188 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/499 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 32 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 8/507 variables, 8/196 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/507 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 14 (OVERLAPS) 0/507 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 507/507 variables, and 196 constraints, problems are : Problem set: 0 solved, 32 unsolved in 2160 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 57/80 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 47/127 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 372/499 variables, 127/141 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 47/188 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/499 variables, 32/220 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/499 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 11 (OVERLAPS) 8/507 variables, 8/228 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/507 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 13 (OVERLAPS) 0/507 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 507/507 variables, and 228 constraints, problems are : Problem set: 0 solved, 32 unsolved in 2456 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 7/7 constraints]
After SMT, in 4652ms problems are : Problem set: 0 solved, 32 unsolved
Parikh walk visited 0 properties in 1342 ms.
Support contains 23 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 379/379 transitions.
Applied a total of 0 rules in 7 ms. Remains 135 /135 variables (removed 0) and now considering 379/379 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 135/135 places, 379/379 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 379/379 transitions.
Applied a total of 0 rules in 6 ms. Remains 135 /135 variables (removed 0) and now considering 379/379 (removed 0) transitions.
[2024-06-02 18:32:56] [INFO ] Flow matrix only has 372 transitions (discarded 7 similar events)
[2024-06-02 18:32:56] [INFO ] Invariant cache hit.
[2024-06-02 18:32:56] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-02 18:32:56] [INFO ] Flow matrix only has 372 transitions (discarded 7 similar events)
[2024-06-02 18:32:56] [INFO ] Invariant cache hit.
[2024-06-02 18:32:56] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-06-02 18:32:56] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
[2024-06-02 18:32:56] [INFO ] Redundant transitions in 26 ms returned []
Running 375 sub problems to find dead transitions.
[2024-06-02 18:32:56] [INFO ] Flow matrix only has 372 transitions (discarded 7 similar events)
[2024-06-02 18:32:56] [INFO ] Invariant cache hit.
[2024-06-02 18:32:56] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-06-02 18:32:58] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 1 ms to minimize.
[2024-06-02 18:32:59] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 0 ms to minimize.
[2024-06-02 18:32:59] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 1 ms to minimize.
[2024-06-02 18:32:59] [INFO ] Deduced a trap composed of 90 places in 66 ms of which 1 ms to minimize.
[2024-06-02 18:32:59] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-06-02 18:32:59] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 1 ms to minimize.
[2024-06-02 18:32:59] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2024-06-02 18:32:59] [INFO ] Deduced a trap composed of 49 places in 37 ms of which 0 ms to minimize.
[2024-06-02 18:32:59] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 1 ms to minimize.
[2024-06-02 18:33:00] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 1 ms to minimize.
[2024-06-02 18:33:00] [INFO ] Deduced a trap composed of 85 places in 59 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 4 (OVERLAPS) 372/507 variables, 135/153 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/507 variables, 47/200 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/507 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 7 (OVERLAPS) 0/507 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 375 unsolved
No progress, stopping.
After SMT solving in domain Real declared 507/507 variables, and 200 constraints, problems are : Problem set: 0 solved, 375 unsolved in 11796 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 375 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 4 (OVERLAPS) 372/507 variables, 135/153 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/507 variables, 47/200 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/507 variables, 375/575 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/507 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-06-02 18:33:38] [INFO ] Deduced a trap composed of 96 places in 84 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/507 variables, 1/576 constraints. Problems are: Problem set: 0 solved, 375 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 507/507 variables, and 576 constraints, problems are : Problem set: 0 solved, 375 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 12/12 constraints]
After SMT, in 42102ms problems are : Problem set: 0 solved, 375 unsolved
Search for dead transitions found 0 dead transitions in 42106ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42406 ms. Remains : 135/135 places, 379/379 transitions.
RANDOM walk for 400000 steps (18584 resets) in 4175 ms. (95 steps per ms) remains 16/23 properties
Running SMT prover for 16 properties.
[2024-06-02 18:33:40] [INFO ] Flow matrix only has 372 transitions (discarded 7 similar events)
[2024-06-02 18:33:40] [INFO ] Invariant cache hit.
[2024-06-02 18:33:40] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 18:33:40] [INFO ] After 84ms SMT Verify possible using state equation in real domain returned unsat :0 sat :16
[2024-06-02 18:33:40] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-06-02 18:33:40] [INFO ] After 44ms SMT Verify possible using 47 Read/Feed constraints in real domain returned unsat :0 sat :16
TRAPS : Iteration 0
[2024-06-02 18:33:40] [INFO ] After 330ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:16
[2024-06-02 18:33:40] [INFO ] After 549ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2024-06-02 18:33:40] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 18:33:40] [INFO ] After 99ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2024-06-02 18:33:41] [INFO ] After 42ms SMT Verify possible using 47 Read/Feed constraints in natural domain returned unsat :0 sat :16
TRAPS : Iteration 0
[2024-06-02 18:33:41] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
[2024-06-02 18:33:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
TRAPS : Iteration 1
[2024-06-02 18:33:42] [INFO ] After 1166ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
[2024-06-02 18:33:42] [INFO ] After 1343ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
RANDOM walk for 4000000 steps (185579 resets) in 30511 ms. (131 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400002 steps (1931 resets) in 1137 ms. (351 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (4741 resets) in 972 ms. (411 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (1942 resets) in 1054 ms. (379 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (4675 resets) in 1031 ms. (387 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (1928 resets) in 1180 ms. (338 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (4661 resets) in 882 ms. (453 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (1943 resets) in 1463 ms. (273 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400002 steps (4714 resets) in 869 ms. (459 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (1930 resets) in 1026 ms. (389 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (4687 resets) in 1025 ms. (389 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (4803 resets) in 1000 ms. (399 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (1927 resets) in 1419 ms. (281 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (4674 resets) in 927 ms. (431 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (4753 resets) in 919 ms. (434 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400002 steps (4731 resets) in 910 ms. (439 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (4725 resets) in 1025 ms. (389 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (4693 resets) in 1134 ms. (352 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (4714 resets) in 1166 ms. (342 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (4688 resets) in 1037 ms. (385 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400002 steps (4638 resets) in 897 ms. (445 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400002 steps (4697 resets) in 982 ms. (406 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (4696 resets) in 784 ms. (509 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400002 steps (4748 resets) in 862 ms. (463 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (4785 resets) in 951 ms. (420 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (4792 resets) in 998 ms. (400 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (4712 resets) in 871 ms. (458 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400002 steps (4758 resets) in 931 ms. (429 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (4673 resets) in 823 ms. (485 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (4741 resets) in 835 ms. (478 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (4725 resets) in 996 ms. (401 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (4716 resets) in 979 ms. (408 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400002 steps (4665 resets) in 938 ms. (425 steps per ms) remains 32/32 properties
Interrupted probabilistic random walk after 7295352 steps, run timeout after 66001 ms. (steps per millisecond=110 ) properties seen :0 out of 32
Probabilistic random walk after 7295352 steps, saw 2023967 distinct states, run finished after 66001 ms. (steps per millisecond=110 ) properties seen :0
[2024-06-02 18:35:10] [INFO ] Flow matrix only has 372 transitions (discarded 7 similar events)
[2024-06-02 18:35:10] [INFO ] Invariant cache hit.
[2024-06-02 18:35:10] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 57/80 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-06-02 18:35:10] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-06-02 18:35:11] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 1 ms to minimize.
[2024-06-02 18:35:11] [INFO ] Deduced a trap composed of 49 places in 41 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 47/127 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-06-02 18:35:11] [INFO ] Deduced a trap composed of 45 places in 74 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 372/499 variables, 127/138 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 47/185 constraints. Problems are: Problem set: 0 solved, 32 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/499 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 10 (OVERLAPS) 8/507 variables, 8/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/507 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 12 (OVERLAPS) 0/507 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 507/507 variables, and 193 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1672 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 57/80 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 47/127 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-06-02 18:35:12] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 372/499 variables, 127/139 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/499 variables, 47/186 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/499 variables, 32/218 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/499 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 12 (OVERLAPS) 8/507 variables, 8/226 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-06-02 18:35:14] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/507 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/507 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-06-02 18:35:14] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/507 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/507 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 17 (OVERLAPS) 0/507 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 507/507 variables, and 228 constraints, problems are : Problem set: 0 solved, 32 unsolved in 3831 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 7/7 constraints]
After SMT, in 5533ms problems are : Problem set: 0 solved, 32 unsolved
Parikh walk visited 0 properties in 2190 ms.
Support contains 23 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 379/379 transitions.
Applied a total of 0 rules in 5 ms. Remains 135 /135 variables (removed 0) and now considering 379/379 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 135/135 places, 379/379 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 379/379 transitions.
Applied a total of 0 rules in 16 ms. Remains 135 /135 variables (removed 0) and now considering 379/379 (removed 0) transitions.
[2024-06-02 18:35:18] [INFO ] Flow matrix only has 372 transitions (discarded 7 similar events)
[2024-06-02 18:35:18] [INFO ] Invariant cache hit.
[2024-06-02 18:35:18] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-02 18:35:18] [INFO ] Flow matrix only has 372 transitions (discarded 7 similar events)
[2024-06-02 18:35:18] [INFO ] Invariant cache hit.
[2024-06-02 18:35:18] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-06-02 18:35:18] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
[2024-06-02 18:35:18] [INFO ] Redundant transitions in 11 ms returned []
Running 375 sub problems to find dead transitions.
[2024-06-02 18:35:18] [INFO ] Flow matrix only has 372 transitions (discarded 7 similar events)
[2024-06-02 18:35:18] [INFO ] Invariant cache hit.
[2024-06-02 18:35:18] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-06-02 18:35:20] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 1 ms to minimize.
[2024-06-02 18:35:21] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
[2024-06-02 18:35:21] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 1 ms to minimize.
[2024-06-02 18:35:21] [INFO ] Deduced a trap composed of 90 places in 64 ms of which 1 ms to minimize.
[2024-06-02 18:35:21] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
[2024-06-02 18:35:21] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2024-06-02 18:35:21] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-06-02 18:35:21] [INFO ] Deduced a trap composed of 49 places in 40 ms of which 1 ms to minimize.
[2024-06-02 18:35:22] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 1 ms to minimize.
[2024-06-02 18:35:22] [INFO ] Deduced a trap composed of 45 places in 69 ms of which 1 ms to minimize.
[2024-06-02 18:35:22] [INFO ] Deduced a trap composed of 85 places in 66 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 4 (OVERLAPS) 372/507 variables, 135/153 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/507 variables, 47/200 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/507 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 7 (OVERLAPS) 0/507 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 375 unsolved
No progress, stopping.
After SMT solving in domain Real declared 507/507 variables, and 200 constraints, problems are : Problem set: 0 solved, 375 unsolved in 11977 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 375 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 4 (OVERLAPS) 372/507 variables, 135/153 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/507 variables, 47/200 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/507 variables, 375/575 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/507 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 375 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 507/507 variables, and 575 constraints, problems are : Problem set: 0 solved, 375 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 11/11 constraints]
After SMT, in 42302ms problems are : Problem set: 0 solved, 375 unsolved
Search for dead transitions found 0 dead transitions in 42306ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42614 ms. Remains : 135/135 places, 379/379 transitions.
RANDOM walk for 400000 steps (18558 resets) in 2444 ms. (163 steps per ms) remains 15/23 properties
Running SMT prover for 15 properties.
[2024-06-02 18:36:02] [INFO ] Flow matrix only has 372 transitions (discarded 7 similar events)
[2024-06-02 18:36:02] [INFO ] Invariant cache hit.
[2024-06-02 18:36:02] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 18:36:02] [INFO ] After 85ms SMT Verify possible using state equation in real domain returned unsat :0 sat :15
[2024-06-02 18:36:02] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-06-02 18:36:02] [INFO ] After 42ms SMT Verify possible using 47 Read/Feed constraints in real domain returned unsat :0 sat :15
TRAPS : Iteration 0
[2024-06-02 18:36:02] [INFO ] After 298ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:15
[2024-06-02 18:36:02] [INFO ] After 422ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2024-06-02 18:36:02] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 18:36:02] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2024-06-02 18:36:02] [INFO ] After 39ms SMT Verify possible using 47 Read/Feed constraints in natural domain returned unsat :0 sat :15
TRAPS : Iteration 0
[2024-06-02 18:36:02] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-06-02 18:36:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
TRAPS : Iteration 1
[2024-06-02 18:36:03] [INFO ] After 604ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
[2024-06-02 18:36:03] [INFO ] After 754ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
RANDOM walk for 205 steps (9 resets) in 6 ms. (29 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (1855 resets) in 212 ms. (187 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (473 resets) in 109 ms. (363 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1254141 steps, run timeout after 3001 ms. (steps per millisecond=417 ) properties seen :0 out of 1
Probabilistic random walk after 1254141 steps, saw 368892 distinct states, run finished after 3004 ms. (steps per millisecond=417 ) properties seen :0
[2024-06-02 18:36:06] [INFO ] Flow matrix only has 372 transitions (discarded 7 similar events)
[2024-06-02 18:36:06] [INFO ] Invariant cache hit.
[2024-06-02 18:36:06] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 72/127 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:36:06] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 2 ms to minimize.
[2024-06-02 18:36:06] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 1 ms to minimize.
[2024-06-02 18:36:06] [INFO ] Deduced a trap composed of 45 places in 65 ms of which 1 ms to minimize.
[2024-06-02 18:36:06] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 372/499 variables, 127/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 47/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/507 variables, 8/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/507 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/507 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 507/507 variables, and 193 constraints, problems are : Problem set: 0 solved, 1 unsolved in 477 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 72/127 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:36:06] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 372/499 variables, 127/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 47/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/499 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/499 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 8/507 variables, 8/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/507 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/507 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 507/507 variables, and 195 constraints, problems are : Problem set: 0 solved, 1 unsolved in 222 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 707ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 23 ms.
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 379/379 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 133 transition count 377
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 133 transition count 377
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 132 transition count 371
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 132 transition count 371
Free-agglomeration rule applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 132 transition count 367
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 14 place count 128 transition count 367
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 127 transition count 366
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 127 transition count 366
Applied a total of 16 rules in 18 ms. Remains 127 /135 variables (removed 8) and now considering 366/379 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 127/135 places, 366/379 transitions.
RANDOM walk for 40000 steps (2008 resets) in 136 ms. (291 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (507 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1420025 steps, run timeout after 3001 ms. (steps per millisecond=473 ) properties seen :0 out of 1
Probabilistic random walk after 1420025 steps, saw 399560 distinct states, run finished after 3002 ms. (steps per millisecond=473 ) properties seen :0
[2024-06-02 18:36:10] [INFO ] Flow matrix only has 359 transitions (discarded 7 similar events)
// Phase 1: matrix 359 rows 127 cols
[2024-06-02 18:36:10] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 18:36:10] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/119 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:36:10] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 359/478 variables, 119/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/478 variables, 67/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/478 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/486 variables, 8/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/486 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/486 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 486/486 variables, and 202 constraints, problems are : Problem set: 0 solved, 1 unsolved in 228 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 127/127 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/119 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:36:10] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 359/478 variables, 119/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/478 variables, 67/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/478 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/478 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 8/486 variables, 8/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/486 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/486 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 486/486 variables, and 204 constraints, problems are : Problem set: 0 solved, 1 unsolved in 200 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 127/127 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 439ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 18 ms.
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 366/366 transitions.
Applied a total of 0 rules in 7 ms. Remains 127 /127 variables (removed 0) and now considering 366/366 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 127/127 places, 366/366 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 366/366 transitions.
Applied a total of 0 rules in 5 ms. Remains 127 /127 variables (removed 0) and now considering 366/366 (removed 0) transitions.
[2024-06-02 18:36:10] [INFO ] Flow matrix only has 359 transitions (discarded 7 similar events)
[2024-06-02 18:36:10] [INFO ] Invariant cache hit.
[2024-06-02 18:36:10] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-02 18:36:10] [INFO ] Flow matrix only has 359 transitions (discarded 7 similar events)
[2024-06-02 18:36:10] [INFO ] Invariant cache hit.
[2024-06-02 18:36:10] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-02 18:36:10] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
[2024-06-02 18:36:10] [INFO ] Redundant transitions in 7 ms returned []
Running 362 sub problems to find dead transitions.
[2024-06-02 18:36:10] [INFO ] Flow matrix only has 359 transitions (discarded 7 similar events)
[2024-06-02 18:36:10] [INFO ] Invariant cache hit.
[2024-06-02 18:36:10] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-06-02 18:36:13] [INFO ] Deduced a trap composed of 47 places in 70 ms of which 1 ms to minimize.
[2024-06-02 18:36:13] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-06-02 18:36:13] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 1 ms to minimize.
[2024-06-02 18:36:13] [INFO ] Deduced a trap composed of 87 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:36:13] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2024-06-02 18:36:13] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-06-02 18:36:13] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 0 ms to minimize.
[2024-06-02 18:36:14] [INFO ] Deduced a trap composed of 83 places in 63 ms of which 1 ms to minimize.
[2024-06-02 18:36:14] [INFO ] Deduced a trap composed of 93 places in 62 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 4 (OVERLAPS) 359/486 variables, 127/143 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/486 variables, 67/210 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 7 (OVERLAPS) 0/486 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 362 unsolved
No progress, stopping.
After SMT solving in domain Real declared 486/486 variables, and 210 constraints, problems are : Problem set: 0 solved, 362 unsolved in 11434 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 127/127 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 362/362 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 362 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 362 unsolved
[2024-06-02 18:36:23] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 1 ms to minimize.
[2024-06-02 18:36:24] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 5 (OVERLAPS) 359/486 variables, 127/145 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 67/212 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/486 variables, 362/574 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/486 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 9 (OVERLAPS) 0/486 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 362 unsolved
No progress, stopping.
After SMT solving in domain Int declared 486/486 variables, and 574 constraints, problems are : Problem set: 0 solved, 362 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 127/127 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 362/362 constraints, Known Traps: 11/11 constraints]
After SMT, in 41803ms problems are : Problem set: 0 solved, 362 unsolved
Search for dead transitions found 0 dead transitions in 41809ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42131 ms. Remains : 127/127 places, 366/366 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 83 edges and 127 vertex of which 20 / 127 are part of one of the 3 SCC in 1 ms
Free SCC test removed 17 places
Drop transitions (Empty/Sink Transition effects.) removed 99 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 117 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 108 transition count 247
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 108 transition count 247
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 15 place count 108 transition count 237
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 1 with 2 rules applied. Total rules applied 17 place count 107 transition count 236
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 1 with 18 rules applied. Total rules applied 35 place count 107 transition count 218
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 4 rules applied. Total rules applied 39 place count 107 transition count 214
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 45 place count 103 transition count 212
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 45 place count 103 transition count 210
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 49 place count 101 transition count 210
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 51 place count 100 transition count 209
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 100 transition count 208
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 54 place count 99 transition count 207
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 55 place count 98 transition count 180
Iterating global reduction 3 with 1 rules applied. Total rules applied 56 place count 98 transition count 180
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 98 transition count 178
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 60 place count 96 transition count 178
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 64 place count 96 transition count 174
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 66 place count 96 transition count 172
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 68 place count 94 transition count 172
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 72 place count 94 transition count 172
Applied a total of 72 rules in 56 ms. Remains 94 /127 variables (removed 33) and now considering 172/366 (removed 194) transitions.
Running SMT prover for 1 properties.
[2024-06-02 18:36:52] [INFO ] Flow matrix only has 170 transitions (discarded 2 similar events)
// Phase 1: matrix 170 rows 94 cols
[2024-06-02 18:36:52] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 18:36:52] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 18:36:52] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 18:36:52] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 18:36:52] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 18:36:52] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-02 18:36:52] [INFO ] After 6ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 18:36:52] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 18:36:52] [INFO ] After 89ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 220 ms.
RANDOM walk for 226 steps (7 resets) in 4 ms. (45 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (1838 resets) in 111 ms. (357 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (485 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1281860 steps, run timeout after 3001 ms. (steps per millisecond=427 ) properties seen :0 out of 1
Probabilistic random walk after 1281860 steps, saw 378355 distinct states, run finished after 3001 ms. (steps per millisecond=427 ) properties seen :0
[2024-06-02 18:36:56] [INFO ] Flow matrix only has 372 transitions (discarded 7 similar events)
// Phase 1: matrix 372 rows 135 cols
[2024-06-02 18:36:56] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 18:36:56] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 72/127 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:36:56] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 2 ms to minimize.
[2024-06-02 18:36:56] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
[2024-06-02 18:36:56] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 372/499 variables, 127/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 47/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/507 variables, 8/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/507 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/507 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 507/507 variables, and 192 constraints, problems are : Problem set: 0 solved, 1 unsolved in 337 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 72/127 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 372/499 variables, 127/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 47/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/499 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 8/507 variables, 8/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/507 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/507 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 507/507 variables, and 193 constraints, problems are : Problem set: 0 solved, 1 unsolved in 169 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 519ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 379/379 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 133 transition count 377
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 133 transition count 377
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 132 transition count 371
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 132 transition count 371
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 131 transition count 369
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 131 transition count 369
Free-agglomeration rule applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 12 place count 131 transition count 365
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 16 place count 127 transition count 365
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 126 transition count 364
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 126 transition count 364
Applied a total of 18 rules in 15 ms. Remains 126 /135 variables (removed 9) and now considering 364/379 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 126/135 places, 364/379 transitions.
RANDOM walk for 40000 steps (2023 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (507 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1425760 steps, run timeout after 3001 ms. (steps per millisecond=475 ) properties seen :0 out of 1
Probabilistic random walk after 1425760 steps, saw 401488 distinct states, run finished after 3001 ms. (steps per millisecond=475 ) properties seen :0
[2024-06-02 18:36:59] [INFO ] Flow matrix only has 357 transitions (discarded 7 similar events)
// Phase 1: matrix 357 rows 126 cols
[2024-06-02 18:36:59] [INFO ] Computed 7 invariants in 12 ms
[2024-06-02 18:36:59] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/118 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:36:59] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 357/475 variables, 118/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/475 variables, 67/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/475 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/483 variables, 8/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/483 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/483 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 483/483 variables, and 201 constraints, problems are : Problem set: 0 solved, 1 unsolved in 199 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 126/126 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/118 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:36:59] [INFO ] Deduced a trap composed of 67 places in 68 ms of which 1 ms to minimize.
[2024-06-02 18:37:00] [INFO ] Deduced a trap composed of 42 places in 32 ms of which 1 ms to minimize.
[2024-06-02 18:37:00] [INFO ] Deduced a trap composed of 67 places in 62 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 357/475 variables, 118/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/475 variables, 67/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/475 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/475 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 8/483 variables, 8/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/483 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/483 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 483/483 variables, and 205 constraints, problems are : Problem set: 0 solved, 1 unsolved in 333 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 126/126 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 552ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 364/364 transitions.
Applied a total of 0 rules in 10 ms. Remains 126 /126 variables (removed 0) and now considering 364/364 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 126/126 places, 364/364 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 364/364 transitions.
Applied a total of 0 rules in 4 ms. Remains 126 /126 variables (removed 0) and now considering 364/364 (removed 0) transitions.
[2024-06-02 18:37:00] [INFO ] Flow matrix only has 357 transitions (discarded 7 similar events)
[2024-06-02 18:37:00] [INFO ] Invariant cache hit.
[2024-06-02 18:37:00] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-02 18:37:00] [INFO ] Flow matrix only has 357 transitions (discarded 7 similar events)
[2024-06-02 18:37:00] [INFO ] Invariant cache hit.
[2024-06-02 18:37:00] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-02 18:37:00] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
[2024-06-02 18:37:00] [INFO ] Redundant transitions in 3 ms returned []
Running 360 sub problems to find dead transitions.
[2024-06-02 18:37:00] [INFO ] Flow matrix only has 357 transitions (discarded 7 similar events)
[2024-06-02 18:37:00] [INFO ] Invariant cache hit.
[2024-06-02 18:37:00] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 360 unsolved
[2024-06-02 18:37:02] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 1 ms to minimize.
[2024-06-02 18:37:02] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 0 ms to minimize.
[2024-06-02 18:37:02] [INFO ] Deduced a trap composed of 86 places in 58 ms of which 1 ms to minimize.
[2024-06-02 18:37:02] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 1 ms to minimize.
[2024-06-02 18:37:02] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 1 ms to minimize.
[2024-06-02 18:37:03] [INFO ] Deduced a trap composed of 42 places in 65 ms of which 1 ms to minimize.
[2024-06-02 18:37:03] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 0 ms to minimize.
[2024-06-02 18:37:03] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2024-06-02 18:37:03] [INFO ] Deduced a trap composed of 83 places in 61 ms of which 1 ms to minimize.
[2024-06-02 18:37:03] [INFO ] Deduced a trap composed of 92 places in 79 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 4 (OVERLAPS) 357/483 variables, 126/143 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/483 variables, 67/210 constraints. Problems are: Problem set: 0 solved, 360 unsolved
[2024-06-02 18:37:08] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/483 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/483 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 8 (OVERLAPS) 0/483 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 360 unsolved
No progress, stopping.
After SMT solving in domain Real declared 483/483 variables, and 211 constraints, problems are : Problem set: 0 solved, 360 unsolved in 14034 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 126/126 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 360/360 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 360 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 4 (OVERLAPS) 357/483 variables, 126/144 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/483 variables, 67/211 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/483 variables, 360/571 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/483 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 8 (OVERLAPS) 0/483 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 360 unsolved
No progress, stopping.
After SMT solving in domain Int declared 483/483 variables, and 571 constraints, problems are : Problem set: 0 solved, 360 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 126/126 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 360/360 constraints, Known Traps: 11/11 constraints]
After SMT, in 44356ms problems are : Problem set: 0 solved, 360 unsolved
Search for dead transitions found 0 dead transitions in 44360ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44670 ms. Remains : 126/126 places, 364/364 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 83 edges and 126 vertex of which 20 / 126 are part of one of the 3 SCC in 0 ms
Free SCC test removed 17 places
Drop transitions (Empty/Sink Transition effects.) removed 99 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 117 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 107 transition count 245
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 107 transition count 245
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 15 place count 107 transition count 235
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 1 with 2 rules applied. Total rules applied 17 place count 106 transition count 234
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 1 with 18 rules applied. Total rules applied 35 place count 106 transition count 216
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 4 rules applied. Total rules applied 39 place count 106 transition count 212
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 45 place count 102 transition count 210
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 45 place count 102 transition count 208
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 49 place count 100 transition count 208
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 51 place count 99 transition count 207
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 99 transition count 206
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 54 place count 98 transition count 205
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 55 place count 97 transition count 178
Iterating global reduction 3 with 1 rules applied. Total rules applied 56 place count 97 transition count 178
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 97 transition count 176
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 60 place count 95 transition count 176
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 64 place count 95 transition count 172
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 66 place count 95 transition count 170
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 68 place count 93 transition count 170
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 72 place count 93 transition count 170
Applied a total of 72 rules in 28 ms. Remains 93 /126 variables (removed 33) and now considering 170/364 (removed 194) transitions.
Running SMT prover for 1 properties.
[2024-06-02 18:37:44] [INFO ] Flow matrix only has 168 transitions (discarded 2 similar events)
// Phase 1: matrix 168 rows 93 cols
[2024-06-02 18:37:44] [INFO ] Computed 7 invariants in 0 ms
[2024-06-02 18:37:44] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 18:37:44] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 18:37:45] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 18:37:45] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 18:37:45] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-02 18:37:45] [INFO ] After 7ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 18:37:45] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 18:37:45] [INFO ] After 80ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 170 ms.
RANDOM walk for 40000 steps (1854 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (474 resets) in 23 ms. (1666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1333987 steps, run timeout after 3001 ms. (steps per millisecond=444 ) properties seen :0 out of 1
Probabilistic random walk after 1333987 steps, saw 394810 distinct states, run finished after 3001 ms. (steps per millisecond=444 ) properties seen :0
[2024-06-02 18:37:48] [INFO ] Flow matrix only has 372 transitions (discarded 7 similar events)
// Phase 1: matrix 372 rows 135 cols
[2024-06-02 18:37:48] [INFO ] Computed 7 invariants in 9 ms
[2024-06-02 18:37:48] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 72/127 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:37:48] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 1 ms to minimize.
[2024-06-02 18:37:48] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 1 ms to minimize.
[2024-06-02 18:37:48] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 372/499 variables, 127/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 47/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/507 variables, 8/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/507 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/507 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 507/507 variables, and 192 constraints, problems are : Problem set: 0 solved, 1 unsolved in 371 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 72/127 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 372/499 variables, 127/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 47/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/499 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 8/507 variables, 8/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/507 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/507 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 507/507 variables, and 193 constraints, problems are : Problem set: 0 solved, 1 unsolved in 147 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 534ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 379/379 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 133 transition count 377
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 133 transition count 377
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 132 transition count 371
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 132 transition count 371
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 131 transition count 369
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 131 transition count 369
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 130 transition count 366
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 130 transition count 366
Free-agglomeration rule applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 14 place count 130 transition count 362
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 18 place count 126 transition count 362
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 125 transition count 361
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 125 transition count 361
Applied a total of 20 rules in 18 ms. Remains 125 /135 variables (removed 10) and now considering 361/379 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 125/135 places, 361/379 transitions.
RANDOM walk for 40000 steps (2007 resets) in 78 ms. (506 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (521 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1406694 steps, run timeout after 3001 ms. (steps per millisecond=468 ) properties seen :0 out of 1
Probabilistic random walk after 1406694 steps, saw 395818 distinct states, run finished after 3001 ms. (steps per millisecond=468 ) properties seen :0
[2024-06-02 18:37:51] [INFO ] Flow matrix only has 354 transitions (discarded 7 similar events)
// Phase 1: matrix 354 rows 125 cols
[2024-06-02 18:37:51] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 18:37:51] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/117 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:37:51] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 354/471 variables, 117/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/471 variables, 66/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/471 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/479 variables, 8/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/479 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/479 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 479/479 variables, and 199 constraints, problems are : Problem set: 0 solved, 1 unsolved in 185 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 125/125 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/117 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:37:51] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 354/471 variables, 117/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/471 variables, 66/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/471 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/471 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 8/479 variables, 8/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/479 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/479 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 479/479 variables, and 201 constraints, problems are : Problem set: 0 solved, 1 unsolved in 222 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 125/125 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 416ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 361/361 transitions.
Applied a total of 0 rules in 6 ms. Remains 125 /125 variables (removed 0) and now considering 361/361 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 125/125 places, 361/361 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 361/361 transitions.
Applied a total of 0 rules in 4 ms. Remains 125 /125 variables (removed 0) and now considering 361/361 (removed 0) transitions.
[2024-06-02 18:37:52] [INFO ] Flow matrix only has 354 transitions (discarded 7 similar events)
[2024-06-02 18:37:52] [INFO ] Invariant cache hit.
[2024-06-02 18:37:52] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-02 18:37:52] [INFO ] Flow matrix only has 354 transitions (discarded 7 similar events)
[2024-06-02 18:37:52] [INFO ] Invariant cache hit.
[2024-06-02 18:37:52] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-06-02 18:37:52] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
[2024-06-02 18:37:52] [INFO ] Redundant transitions in 3 ms returned []
Running 357 sub problems to find dead transitions.
[2024-06-02 18:37:52] [INFO ] Flow matrix only has 354 transitions (discarded 7 similar events)
[2024-06-02 18:37:52] [INFO ] Invariant cache hit.
[2024-06-02 18:37:52] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 357 unsolved
[2024-06-02 18:37:54] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 1 ms to minimize.
[2024-06-02 18:37:54] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 1 ms to minimize.
[2024-06-02 18:37:54] [INFO ] Deduced a trap composed of 85 places in 59 ms of which 1 ms to minimize.
[2024-06-02 18:37:54] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 1 ms to minimize.
[2024-06-02 18:37:54] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-06-02 18:37:55] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-06-02 18:37:55] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 0 ms to minimize.
[2024-06-02 18:37:55] [INFO ] Deduced a trap composed of 83 places in 65 ms of which 1 ms to minimize.
[2024-06-02 18:37:55] [INFO ] Deduced a trap composed of 91 places in 64 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 4 (OVERLAPS) 354/479 variables, 125/141 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/479 variables, 66/207 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/479 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 7 (OVERLAPS) 0/479 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 357 unsolved
No progress, stopping.
After SMT solving in domain Real declared 479/479 variables, and 207 constraints, problems are : Problem set: 0 solved, 357 unsolved in 11025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 125/125 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 357/357 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 357 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 4 (OVERLAPS) 354/479 variables, 125/141 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/479 variables, 66/207 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/479 variables, 357/564 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/479 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 8 (OVERLAPS) 0/479 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 357 unsolved
No progress, stopping.
After SMT solving in domain Int declared 479/479 variables, and 564 constraints, problems are : Problem set: 0 solved, 357 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 125/125 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 357/357 constraints, Known Traps: 9/9 constraints]
After SMT, in 41302ms problems are : Problem set: 0 solved, 357 unsolved
Search for dead transitions found 0 dead transitions in 41307ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41633 ms. Remains : 125/125 places, 361/361 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 82 edges and 125 vertex of which 20 / 125 are part of one of the 3 SCC in 0 ms
Free SCC test removed 17 places
Drop transitions (Empty/Sink Transition effects.) removed 99 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 117 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 106 transition count 242
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 106 transition count 242
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 15 place count 106 transition count 232
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 1 with 2 rules applied. Total rules applied 17 place count 105 transition count 231
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 1 with 18 rules applied. Total rules applied 35 place count 105 transition count 213
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 4 rules applied. Total rules applied 39 place count 105 transition count 209
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 45 place count 101 transition count 207
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 45 place count 101 transition count 205
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 49 place count 99 transition count 205
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 51 place count 98 transition count 204
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 98 transition count 203
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 54 place count 97 transition count 202
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 55 place count 96 transition count 176
Iterating global reduction 3 with 1 rules applied. Total rules applied 56 place count 96 transition count 176
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 96 transition count 174
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 60 place count 94 transition count 174
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 64 place count 94 transition count 170
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 66 place count 94 transition count 168
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 68 place count 92 transition count 168
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 72 place count 92 transition count 168
Applied a total of 72 rules in 26 ms. Remains 92 /125 variables (removed 33) and now considering 168/361 (removed 193) transitions.
Running SMT prover for 1 properties.
[2024-06-02 18:38:33] [INFO ] Flow matrix only has 166 transitions (discarded 2 similar events)
// Phase 1: matrix 166 rows 92 cols
[2024-06-02 18:38:33] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 18:38:33] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 18:38:33] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 18:38:33] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 18:38:33] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 18:38:33] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-02 18:38:33] [INFO ] After 6ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 18:38:33] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 18:38:33] [INFO ] After 97ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 204 ms.
RANDOM walk for 40000 steps (1842 resets) in 84 ms. (470 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (473 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1215361 steps, run timeout after 3001 ms. (steps per millisecond=404 ) properties seen :0 out of 1
Probabilistic random walk after 1215361 steps, saw 358505 distinct states, run finished after 3001 ms. (steps per millisecond=404 ) properties seen :0
[2024-06-02 18:38:37] [INFO ] Flow matrix only has 372 transitions (discarded 7 similar events)
// Phase 1: matrix 372 rows 135 cols
[2024-06-02 18:38:37] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 18:38:37] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 72/127 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:38:37] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2024-06-02 18:38:37] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 0 ms to minimize.
[2024-06-02 18:38:37] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 372/499 variables, 127/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 47/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/507 variables, 8/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/507 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/507 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 507/507 variables, and 192 constraints, problems are : Problem set: 0 solved, 1 unsolved in 326 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 72/127 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 372/499 variables, 127/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 47/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/499 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 8/507 variables, 8/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/507 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/507 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 507/507 variables, and 193 constraints, problems are : Problem set: 0 solved, 1 unsolved in 162 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 499ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 379/379 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 133 transition count 377
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 133 transition count 377
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 132 transition count 371
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 132 transition count 371
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 131 transition count 369
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 131 transition count 369
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 130 transition count 366
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 130 transition count 366
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 129 transition count 364
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 129 transition count 364
Free-agglomeration rule applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 129 transition count 360
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 125 transition count 360
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 124 transition count 359
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 124 transition count 359
Applied a total of 22 rules in 16 ms. Remains 124 /135 variables (removed 11) and now considering 359/379 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 124/135 places, 359/379 transitions.
RANDOM walk for 40000 steps (1991 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (496 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1476251 steps, run timeout after 3001 ms. (steps per millisecond=491 ) properties seen :0 out of 1
Probabilistic random walk after 1476251 steps, saw 414391 distinct states, run finished after 3002 ms. (steps per millisecond=491 ) properties seen :0
[2024-06-02 18:38:40] [INFO ] Flow matrix only has 352 transitions (discarded 7 similar events)
// Phase 1: matrix 352 rows 124 cols
[2024-06-02 18:38:40] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 18:38:40] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 48/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/116 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:38:40] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 352/468 variables, 116/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/468 variables, 66/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/468 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/476 variables, 8/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/476 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/476 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 476/476 variables, and 198 constraints, problems are : Problem set: 0 solved, 1 unsolved in 177 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 48/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/116 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:38:40] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 352/468 variables, 116/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/468 variables, 66/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/468 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/468 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 8/476 variables, 8/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/476 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/476 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 476/476 variables, and 200 constraints, problems are : Problem set: 0 solved, 1 unsolved in 189 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 377ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 359/359 transitions.
Applied a total of 0 rules in 4 ms. Remains 124 /124 variables (removed 0) and now considering 359/359 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 124/124 places, 359/359 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 359/359 transitions.
Applied a total of 0 rules in 3 ms. Remains 124 /124 variables (removed 0) and now considering 359/359 (removed 0) transitions.
[2024-06-02 18:38:40] [INFO ] Flow matrix only has 352 transitions (discarded 7 similar events)
[2024-06-02 18:38:40] [INFO ] Invariant cache hit.
[2024-06-02 18:38:41] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-02 18:38:41] [INFO ] Flow matrix only has 352 transitions (discarded 7 similar events)
[2024-06-02 18:38:41] [INFO ] Invariant cache hit.
[2024-06-02 18:38:41] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-06-02 18:38:41] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
[2024-06-02 18:38:41] [INFO ] Redundant transitions in 2 ms returned []
Running 355 sub problems to find dead transitions.
[2024-06-02 18:38:41] [INFO ] Flow matrix only has 352 transitions (discarded 7 similar events)
[2024-06-02 18:38:41] [INFO ] Invariant cache hit.
[2024-06-02 18:38:41] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 355 unsolved
[2024-06-02 18:38:43] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2024-06-02 18:38:43] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 0 ms to minimize.
[2024-06-02 18:38:43] [INFO ] Deduced a trap composed of 84 places in 59 ms of which 1 ms to minimize.
[2024-06-02 18:38:43] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2024-06-02 18:38:43] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-06-02 18:38:43] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-06-02 18:38:44] [INFO ] Deduced a trap composed of 83 places in 62 ms of which 1 ms to minimize.
[2024-06-02 18:38:44] [INFO ] Deduced a trap composed of 90 places in 63 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 4 (OVERLAPS) 352/476 variables, 124/139 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/476 variables, 66/205 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/476 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 7 (OVERLAPS) 0/476 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 355 unsolved
No progress, stopping.
After SMT solving in domain Real declared 476/476 variables, and 205 constraints, problems are : Problem set: 0 solved, 355 unsolved in 11065 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 355/355 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 355 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 355 unsolved
[2024-06-02 18:38:53] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 5 (OVERLAPS) 352/476 variables, 124/140 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/476 variables, 66/206 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/476 variables, 355/561 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/476 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 9 (OVERLAPS) 0/476 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 355 unsolved
No progress, stopping.
After SMT solving in domain Int declared 476/476 variables, and 561 constraints, problems are : Problem set: 0 solved, 355 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 355/355 constraints, Known Traps: 9/9 constraints]
After SMT, in 41401ms problems are : Problem set: 0 solved, 355 unsolved
Search for dead transitions found 0 dead transitions in 41404ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41708 ms. Remains : 124/124 places, 359/359 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 82 edges and 124 vertex of which 20 / 124 are part of one of the 3 SCC in 0 ms
Free SCC test removed 17 places
Drop transitions (Empty/Sink Transition effects.) removed 99 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 117 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 105 transition count 240
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 105 transition count 240
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 15 place count 105 transition count 230
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 1 with 2 rules applied. Total rules applied 17 place count 104 transition count 229
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 1 with 18 rules applied. Total rules applied 35 place count 104 transition count 211
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 4 rules applied. Total rules applied 39 place count 104 transition count 207
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 45 place count 100 transition count 205
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 45 place count 100 transition count 203
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 49 place count 98 transition count 203
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 51 place count 97 transition count 202
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 97 transition count 201
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 54 place count 96 transition count 200
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 55 place count 95 transition count 174
Iterating global reduction 3 with 1 rules applied. Total rules applied 56 place count 95 transition count 174
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 95 transition count 172
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 60 place count 93 transition count 172
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 64 place count 93 transition count 168
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 66 place count 93 transition count 166
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 68 place count 91 transition count 166
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 72 place count 91 transition count 166
Applied a total of 72 rules in 24 ms. Remains 91 /124 variables (removed 33) and now considering 166/359 (removed 193) transitions.
Running SMT prover for 1 properties.
[2024-06-02 18:39:22] [INFO ] Flow matrix only has 164 transitions (discarded 2 similar events)
// Phase 1: matrix 164 rows 91 cols
[2024-06-02 18:39:22] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 18:39:22] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 18:39:22] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 18:39:22] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 18:39:22] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 18:39:22] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-02 18:39:22] [INFO ] After 6ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 18:39:22] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 18:39:22] [INFO ] After 93ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 209 ms.
RANDOM walk for 40000 steps (1854 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (461 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1339883 steps, run timeout after 3001 ms. (steps per millisecond=446 ) properties seen :0 out of 1
Probabilistic random walk after 1339883 steps, saw 396602 distinct states, run finished after 3001 ms. (steps per millisecond=446 ) properties seen :0
[2024-06-02 18:39:25] [INFO ] Flow matrix only has 372 transitions (discarded 7 similar events)
// Phase 1: matrix 372 rows 135 cols
[2024-06-02 18:39:25] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 18:39:25] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 72/127 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:39:26] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 1 ms to minimize.
[2024-06-02 18:39:26] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 1 ms to minimize.
[2024-06-02 18:39:26] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 372/499 variables, 127/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 47/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/507 variables, 8/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/507 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/507 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 507/507 variables, and 192 constraints, problems are : Problem set: 0 solved, 1 unsolved in 383 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 72/127 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 372/499 variables, 127/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 47/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/499 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 8/507 variables, 8/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/507 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/507 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 507/507 variables, and 193 constraints, problems are : Problem set: 0 solved, 1 unsolved in 158 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 557ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 23 ms.
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 379/379 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 133 transition count 377
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 133 transition count 377
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 132 transition count 371
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 132 transition count 371
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 131 transition count 369
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 131 transition count 369
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 130 transition count 366
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 130 transition count 366
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 129 transition count 364
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 129 transition count 364
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 128 transition count 361
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 128 transition count 361
Free-agglomeration rule applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 128 transition count 357
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 22 place count 124 transition count 357
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 123 transition count 356
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 123 transition count 356
Applied a total of 24 rules in 18 ms. Remains 123 /135 variables (removed 12) and now considering 356/379 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 123/135 places, 356/379 transitions.
RANDOM walk for 40000 steps (1968 resets) in 78 ms. (506 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (492 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1477573 steps, run timeout after 3001 ms. (steps per millisecond=492 ) properties seen :0 out of 1
Probabilistic random walk after 1477573 steps, saw 414623 distinct states, run finished after 3001 ms. (steps per millisecond=492 ) properties seen :0
[2024-06-02 18:39:29] [INFO ] Flow matrix only has 349 transitions (discarded 7 similar events)
// Phase 1: matrix 349 rows 123 cols
[2024-06-02 18:39:29] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 18:39:29] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/115 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:39:29] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 1 ms to minimize.
[2024-06-02 18:39:29] [INFO ] Deduced a trap composed of 35 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 349/464 variables, 115/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/464 variables, 65/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/464 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/472 variables, 8/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/472 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/472 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 472/472 variables, and 197 constraints, problems are : Problem set: 0 solved, 1 unsolved in 224 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 123/123 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/115 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 349/464 variables, 115/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/464 variables, 65/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/464 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/464 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 8/472 variables, 8/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/472 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/472 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 472/472 variables, and 198 constraints, problems are : Problem set: 0 solved, 1 unsolved in 155 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 123/123 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 389ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 28 ms.
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 356/356 transitions.
Applied a total of 0 rules in 3 ms. Remains 123 /123 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 123/123 places, 356/356 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 356/356 transitions.
Applied a total of 0 rules in 3 ms. Remains 123 /123 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2024-06-02 18:39:29] [INFO ] Flow matrix only has 349 transitions (discarded 7 similar events)
[2024-06-02 18:39:29] [INFO ] Invariant cache hit.
[2024-06-02 18:39:30] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-06-02 18:39:30] [INFO ] Flow matrix only has 349 transitions (discarded 7 similar events)
[2024-06-02 18:39:30] [INFO ] Invariant cache hit.
[2024-06-02 18:39:30] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-06-02 18:39:30] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
[2024-06-02 18:39:30] [INFO ] Redundant transitions in 1 ms returned []
Running 352 sub problems to find dead transitions.
[2024-06-02 18:39:30] [INFO ] Flow matrix only has 349 transitions (discarded 7 similar events)
[2024-06-02 18:39:30] [INFO ] Invariant cache hit.
[2024-06-02 18:39:30] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 352 unsolved
[2024-06-02 18:39:32] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 1 ms to minimize.
[2024-06-02 18:39:32] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-06-02 18:39:32] [INFO ] Deduced a trap composed of 42 places in 34 ms of which 1 ms to minimize.
[2024-06-02 18:39:32] [INFO ] Deduced a trap composed of 83 places in 57 ms of which 1 ms to minimize.
[2024-06-02 18:39:32] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2024-06-02 18:39:32] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
[2024-06-02 18:39:33] [INFO ] Deduced a trap composed of 89 places in 67 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 4 (OVERLAPS) 349/472 variables, 123/137 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/472 variables, 65/202 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/472 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 7 (OVERLAPS) 0/472 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 352 unsolved
No progress, stopping.
After SMT solving in domain Real declared 472/472 variables, and 202 constraints, problems are : Problem set: 0 solved, 352 unsolved in 10638 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 123/123 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 352/352 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 352 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 352 unsolved
[2024-06-02 18:39:42] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 5 (OVERLAPS) 349/472 variables, 123/138 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/472 variables, 65/203 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/472 variables, 352/555 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 9 (OVERLAPS) 0/472 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 352 unsolved
No progress, stopping.
After SMT solving in domain Int declared 472/472 variables, and 555 constraints, problems are : Problem set: 0 solved, 352 unsolved in 25929 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 123/123 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 352/352 constraints, Known Traps: 8/8 constraints]
After SMT, in 36854ms problems are : Problem set: 0 solved, 352 unsolved
Search for dead transitions found 0 dead transitions in 36857ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37169 ms. Remains : 123/123 places, 356/356 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 81 edges and 123 vertex of which 20 / 123 are part of one of the 3 SCC in 0 ms
Free SCC test removed 17 places
Drop transitions (Empty/Sink Transition effects.) removed 99 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 117 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 104 transition count 237
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 104 transition count 237
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 15 place count 104 transition count 227
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 1 with 2 rules applied. Total rules applied 17 place count 103 transition count 226
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 1 with 18 rules applied. Total rules applied 35 place count 103 transition count 208
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 4 rules applied. Total rules applied 39 place count 103 transition count 204
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 45 place count 99 transition count 202
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 45 place count 99 transition count 200
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 49 place count 97 transition count 200
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 51 place count 96 transition count 199
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 96 transition count 198
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 54 place count 95 transition count 197
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 55 place count 94 transition count 172
Iterating global reduction 3 with 1 rules applied. Total rules applied 56 place count 94 transition count 172
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 94 transition count 170
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 60 place count 92 transition count 170
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 64 place count 92 transition count 166
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 66 place count 92 transition count 164
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 68 place count 90 transition count 164
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 72 place count 90 transition count 164
Applied a total of 72 rules in 19 ms. Remains 90 /123 variables (removed 33) and now considering 164/356 (removed 192) transitions.
Running SMT prover for 1 properties.
[2024-06-02 18:40:07] [INFO ] Flow matrix only has 162 transitions (discarded 2 similar events)
// Phase 1: matrix 162 rows 90 cols
[2024-06-02 18:40:07] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 18:40:07] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 18:40:07] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 18:40:07] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 18:40:07] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 18:40:07] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-02 18:40:07] [INFO ] After 6ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 18:40:07] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 18:40:07] [INFO ] After 88ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 200 ms.
RANDOM walk for 40000 steps (1845 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (473 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1344055 steps, run timeout after 3001 ms. (steps per millisecond=447 ) properties seen :0 out of 1
Probabilistic random walk after 1344055 steps, saw 398318 distinct states, run finished after 3001 ms. (steps per millisecond=447 ) properties seen :0
[2024-06-02 18:40:10] [INFO ] Flow matrix only has 372 transitions (discarded 7 similar events)
// Phase 1: matrix 372 rows 135 cols
[2024-06-02 18:40:10] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 18:40:10] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 72/127 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:40:10] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 1 ms to minimize.
[2024-06-02 18:40:10] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 1 ms to minimize.
[2024-06-02 18:40:10] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 372/499 variables, 127/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 47/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/507 variables, 8/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/507 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/507 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 507/507 variables, and 192 constraints, problems are : Problem set: 0 solved, 1 unsolved in 329 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 72/127 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 372/499 variables, 127/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 47/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/499 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 8/507 variables, 8/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/507 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/507 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 507/507 variables, and 193 constraints, problems are : Problem set: 0 solved, 1 unsolved in 163 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 516ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 379/379 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 133 transition count 377
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 133 transition count 377
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 132 transition count 371
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 132 transition count 371
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 131 transition count 369
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 131 transition count 369
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 130 transition count 366
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 130 transition count 366
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 129 transition count 364
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 129 transition count 364
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 128 transition count 361
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 128 transition count 361
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 127 transition count 359
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 127 transition count 359
Free-agglomeration rule applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 127 transition count 355
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 24 place count 123 transition count 355
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 122 transition count 354
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 122 transition count 354
Applied a total of 26 rules in 16 ms. Remains 122 /135 variables (removed 13) and now considering 354/379 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 122/135 places, 354/379 transitions.
RANDOM walk for 40000 steps (1977 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (484 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1496605 steps, run timeout after 3001 ms. (steps per millisecond=498 ) properties seen :0 out of 1
Probabilistic random walk after 1496605 steps, saw 418331 distinct states, run finished after 3001 ms. (steps per millisecond=498 ) properties seen :0
[2024-06-02 18:40:14] [INFO ] Flow matrix only has 347 transitions (discarded 7 similar events)
// Phase 1: matrix 347 rows 122 cols
[2024-06-02 18:40:14] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 18:40:14] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/114 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:40:14] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
[2024-06-02 18:40:14] [INFO ] Deduced a trap composed of 35 places in 31 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 347/461 variables, 114/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/461 variables, 65/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/461 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/469 variables, 8/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/469 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/469 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 469/469 variables, and 196 constraints, problems are : Problem set: 0 solved, 1 unsolved in 217 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 122/122 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/114 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:40:14] [INFO ] Deduced a trap composed of 65 places in 63 ms of which 1 ms to minimize.
[2024-06-02 18:40:14] [INFO ] Deduced a trap composed of 66 places in 57 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 347/461 variables, 114/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/461 variables, 65/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/461 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/461 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 8/469 variables, 8/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/469 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/469 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 469/469 variables, and 199 constraints, problems are : Problem set: 0 solved, 1 unsolved in 263 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 122/122 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 486ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 1 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 354/354 transitions.
Applied a total of 0 rules in 4 ms. Remains 122 /122 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 122/122 places, 354/354 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 354/354 transitions.
Applied a total of 0 rules in 3 ms. Remains 122 /122 variables (removed 0) and now considering 354/354 (removed 0) transitions.
[2024-06-02 18:40:14] [INFO ] Flow matrix only has 347 transitions (discarded 7 similar events)
[2024-06-02 18:40:14] [INFO ] Invariant cache hit.
[2024-06-02 18:40:14] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-02 18:40:14] [INFO ] Flow matrix only has 347 transitions (discarded 7 similar events)
[2024-06-02 18:40:14] [INFO ] Invariant cache hit.
[2024-06-02 18:40:14] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-06-02 18:40:14] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
[2024-06-02 18:40:14] [INFO ] Redundant transitions in 3 ms returned []
Running 350 sub problems to find dead transitions.
[2024-06-02 18:40:14] [INFO ] Flow matrix only has 347 transitions (discarded 7 similar events)
[2024-06-02 18:40:14] [INFO ] Invariant cache hit.
[2024-06-02 18:40:14] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 350 unsolved
[2024-06-02 18:40:16] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-06-02 18:40:16] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 0 ms to minimize.
[2024-06-02 18:40:16] [INFO ] Deduced a trap composed of 82 places in 59 ms of which 1 ms to minimize.
[2024-06-02 18:40:17] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-06-02 18:40:17] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 0 ms to minimize.
[2024-06-02 18:40:17] [INFO ] Deduced a trap composed of 83 places in 62 ms of which 1 ms to minimize.
[2024-06-02 18:40:17] [INFO ] Deduced a trap composed of 88 places in 59 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 4 (OVERLAPS) 347/469 variables, 122/136 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/469 variables, 65/201 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/469 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 7 (OVERLAPS) 0/469 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 350 unsolved
No progress, stopping.
After SMT solving in domain Real declared 469/469 variables, and 201 constraints, problems are : Problem set: 0 solved, 350 unsolved in 10714 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 122/122 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 350/350 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 350 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 350 unsolved
[2024-06-02 18:40:26] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 5 (OVERLAPS) 347/469 variables, 122/137 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/469 variables, 65/202 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/469 variables, 350/552 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/469 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 9 (OVERLAPS) 0/469 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 350 unsolved
No progress, stopping.
After SMT solving in domain Int declared 469/469 variables, and 552 constraints, problems are : Problem set: 0 solved, 350 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 122/122 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 350/350 constraints, Known Traps: 8/8 constraints]
After SMT, in 41011ms problems are : Problem set: 0 solved, 350 unsolved
Search for dead transitions found 0 dead transitions in 41016ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41329 ms. Remains : 122/122 places, 354/354 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 81 edges and 122 vertex of which 20 / 122 are part of one of the 3 SCC in 0 ms
Free SCC test removed 17 places
Drop transitions (Empty/Sink Transition effects.) removed 99 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 117 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 103 transition count 235
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 103 transition count 235
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 15 place count 103 transition count 225
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 1 with 2 rules applied. Total rules applied 17 place count 102 transition count 224
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 1 with 18 rules applied. Total rules applied 35 place count 102 transition count 206
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 4 rules applied. Total rules applied 39 place count 102 transition count 202
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 45 place count 98 transition count 200
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 45 place count 98 transition count 198
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 49 place count 96 transition count 198
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 51 place count 95 transition count 197
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 95 transition count 196
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 54 place count 94 transition count 195
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 55 place count 93 transition count 170
Iterating global reduction 3 with 1 rules applied. Total rules applied 56 place count 93 transition count 170
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 93 transition count 168
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 60 place count 91 transition count 168
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 64 place count 91 transition count 164
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 66 place count 91 transition count 162
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 68 place count 89 transition count 162
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 72 place count 89 transition count 162
Applied a total of 72 rules in 20 ms. Remains 89 /122 variables (removed 33) and now considering 162/354 (removed 192) transitions.
Running SMT prover for 1 properties.
[2024-06-02 18:40:55] [INFO ] Flow matrix only has 160 transitions (discarded 2 similar events)
// Phase 1: matrix 160 rows 89 cols
[2024-06-02 18:40:55] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 18:40:55] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 18:40:55] [INFO ] After 37ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-02 18:40:55] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-02 18:40:55] [INFO ] After 8ms SMT Verify possible using 6 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 18:40:55] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 18:40:55] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 18:40:56] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 18:40:56] [INFO ] After 7ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 18:40:56] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 18:40:56] [INFO ] After 85ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 188 ms.
RANDOM walk for 40000 steps (1857 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (471 resets) in 23 ms. (1666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1204013 steps, run timeout after 3001 ms. (steps per millisecond=401 ) properties seen :0 out of 1
Probabilistic random walk after 1204013 steps, saw 355676 distinct states, run finished after 3001 ms. (steps per millisecond=401 ) properties seen :0
[2024-06-02 18:40:59] [INFO ] Flow matrix only has 372 transitions (discarded 7 similar events)
// Phase 1: matrix 372 rows 135 cols
[2024-06-02 18:40:59] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 18:40:59] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 72/127 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:40:59] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 1 ms to minimize.
[2024-06-02 18:40:59] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 1 ms to minimize.
[2024-06-02 18:40:59] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 372/499 variables, 127/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 47/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/507 variables, 8/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/507 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/507 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 507/507 variables, and 192 constraints, problems are : Problem set: 0 solved, 1 unsolved in 359 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 72/127 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 372/499 variables, 127/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 47/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/499 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 8/507 variables, 8/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/507 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/507 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 507/507 variables, and 193 constraints, problems are : Problem set: 0 solved, 1 unsolved in 162 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 529ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 23 ms.
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 379/379 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 133 transition count 377
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 133 transition count 377
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 132 transition count 371
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 132 transition count 371
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 131 transition count 369
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 131 transition count 369
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 130 transition count 366
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 130 transition count 366
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 129 transition count 364
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 129 transition count 364
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 128 transition count 361
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 128 transition count 361
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 127 transition count 359
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 127 transition count 359
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 126 transition count 356
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 126 transition count 356
Free-agglomeration rule applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 126 transition count 352
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 26 place count 122 transition count 352
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 121 transition count 351
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 121 transition count 351
Applied a total of 28 rules in 27 ms. Remains 121 /135 variables (removed 14) and now considering 351/379 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 121/135 places, 351/379 transitions.
RANDOM walk for 40000 steps (1996 resets) in 96 ms. (412 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (498 resets) in 23 ms. (1666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1329455 steps, run timeout after 3001 ms. (steps per millisecond=443 ) properties seen :0 out of 1
Probabilistic random walk after 1329455 steps, saw 376086 distinct states, run finished after 3001 ms. (steps per millisecond=443 ) properties seen :0
[2024-06-02 18:41:02] [INFO ] Flow matrix only has 344 transitions (discarded 7 similar events)
// Phase 1: matrix 344 rows 121 cols
[2024-06-02 18:41:02] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 18:41:02] [INFO ] State equation strengthened by 64 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/113 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:41:02] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
[2024-06-02 18:41:02] [INFO ] Deduced a trap composed of 35 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 344/457 variables, 113/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/457 variables, 64/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/457 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/465 variables, 8/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/465 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/465 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 465/465 variables, and 194 constraints, problems are : Problem set: 0 solved, 1 unsolved in 208 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 121/121 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/113 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 344/457 variables, 113/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/457 variables, 64/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/457 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/457 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 8/465 variables, 8/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/465 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/465 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 465/465 variables, and 195 constraints, problems are : Problem set: 0 solved, 1 unsolved in 175 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 121/121 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 391ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 351/351 transitions.
Applied a total of 0 rules in 4 ms. Remains 121 /121 variables (removed 0) and now considering 351/351 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 121/121 places, 351/351 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 351/351 transitions.
Applied a total of 0 rules in 3 ms. Remains 121 /121 variables (removed 0) and now considering 351/351 (removed 0) transitions.
[2024-06-02 18:41:03] [INFO ] Flow matrix only has 344 transitions (discarded 7 similar events)
[2024-06-02 18:41:03] [INFO ] Invariant cache hit.
[2024-06-02 18:41:03] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-02 18:41:03] [INFO ] Flow matrix only has 344 transitions (discarded 7 similar events)
[2024-06-02 18:41:03] [INFO ] Invariant cache hit.
[2024-06-02 18:41:03] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-06-02 18:41:03] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
[2024-06-02 18:41:03] [INFO ] Redundant transitions in 2 ms returned []
Running 347 sub problems to find dead transitions.
[2024-06-02 18:41:03] [INFO ] Flow matrix only has 344 transitions (discarded 7 similar events)
[2024-06-02 18:41:03] [INFO ] Invariant cache hit.
[2024-06-02 18:41:03] [INFO ] State equation strengthened by 64 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 347 unsolved
[2024-06-02 18:41:05] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 1 ms to minimize.
[2024-06-02 18:41:05] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2024-06-02 18:41:05] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 1 ms to minimize.
[2024-06-02 18:41:05] [INFO ] Deduced a trap composed of 81 places in 57 ms of which 1 ms to minimize.
[2024-06-02 18:41:05] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2024-06-02 18:41:05] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-06-02 18:41:05] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
[2024-06-02 18:41:06] [INFO ] Deduced a trap composed of 83 places in 65 ms of which 1 ms to minimize.
[2024-06-02 18:41:06] [INFO ] Deduced a trap composed of 87 places in 65 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 4 (OVERLAPS) 344/465 variables, 121/137 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/465 variables, 64/201 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/465 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 7 (OVERLAPS) 0/465 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 347 unsolved
No progress, stopping.
After SMT solving in domain Real declared 465/465 variables, and 201 constraints, problems are : Problem set: 0 solved, 347 unsolved in 10334 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 121/121 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 347/347 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 347 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 347 unsolved
[2024-06-02 18:41:15] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 5 (OVERLAPS) 344/465 variables, 121/138 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/465 variables, 64/202 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/465 variables, 347/549 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/465 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 9 (OVERLAPS) 0/465 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 347 unsolved
No progress, stopping.
After SMT solving in domain Int declared 465/465 variables, and 549 constraints, problems are : Problem set: 0 solved, 347 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 121/121 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 347/347 constraints, Known Traps: 10/10 constraints]
After SMT, in 40631ms problems are : Problem set: 0 solved, 347 unsolved
Search for dead transitions found 0 dead transitions in 40636ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40956 ms. Remains : 121/121 places, 351/351 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 80 edges and 121 vertex of which 20 / 121 are part of one of the 3 SCC in 0 ms
Free SCC test removed 17 places
Drop transitions (Empty/Sink Transition effects.) removed 99 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 117 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 102 transition count 232
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 102 transition count 232
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 15 place count 102 transition count 222
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 1 with 2 rules applied. Total rules applied 17 place count 101 transition count 221
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 1 with 18 rules applied. Total rules applied 35 place count 101 transition count 203
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 4 rules applied. Total rules applied 39 place count 101 transition count 199
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 45 place count 97 transition count 197
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 45 place count 97 transition count 195
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 49 place count 95 transition count 195
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 51 place count 94 transition count 194
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 94 transition count 193
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 54 place count 93 transition count 192
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 55 place count 92 transition count 168
Iterating global reduction 3 with 1 rules applied. Total rules applied 56 place count 92 transition count 168
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 92 transition count 166
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 60 place count 90 transition count 166
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 64 place count 90 transition count 162
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 66 place count 90 transition count 160
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 68 place count 88 transition count 160
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 72 place count 88 transition count 160
Applied a total of 72 rules in 34 ms. Remains 88 /121 variables (removed 33) and now considering 160/351 (removed 191) transitions.
Running SMT prover for 1 properties.
[2024-06-02 18:41:44] [INFO ] Flow matrix only has 158 transitions (discarded 2 similar events)
// Phase 1: matrix 158 rows 88 cols
[2024-06-02 18:41:44] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 18:41:44] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 18:41:44] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 18:41:44] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 18:41:44] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 18:41:44] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-02 18:41:44] [INFO ] After 6ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 18:41:44] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-06-02 18:41:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
TRAPS : Iteration 1
[2024-06-02 18:41:44] [INFO ] After 71ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 18:41:44] [INFO ] After 148ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 263 ms.
RANDOM walk for 40000 steps (1847 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (463 resets) in 23 ms. (1666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1341291 steps, run timeout after 3001 ms. (steps per millisecond=446 ) properties seen :0 out of 1
Probabilistic random walk after 1341291 steps, saw 397169 distinct states, run finished after 3001 ms. (steps per millisecond=446 ) properties seen :0
[2024-06-02 18:41:47] [INFO ] Flow matrix only has 372 transitions (discarded 7 similar events)
// Phase 1: matrix 372 rows 135 cols
[2024-06-02 18:41:47] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 18:41:47] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 72/127 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:41:47] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 1 ms to minimize.
[2024-06-02 18:41:47] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 0 ms to minimize.
[2024-06-02 18:41:47] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 372/499 variables, 127/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 47/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/507 variables, 8/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/507 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/507 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 507/507 variables, and 192 constraints, problems are : Problem set: 0 solved, 1 unsolved in 325 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 72/127 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 372/499 variables, 127/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 47/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/499 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 8/507 variables, 8/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/507 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/507 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 507/507 variables, and 193 constraints, problems are : Problem set: 0 solved, 1 unsolved in 161 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 492ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 379/379 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 133 transition count 377
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 133 transition count 377
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 132 transition count 371
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 132 transition count 371
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 131 transition count 369
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 131 transition count 369
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 130 transition count 366
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 130 transition count 366
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 129 transition count 364
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 129 transition count 364
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 128 transition count 361
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 128 transition count 361
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 127 transition count 359
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 127 transition count 359
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 126 transition count 356
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 126 transition count 356
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 125 transition count 354
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 125 transition count 354
Free-agglomeration rule applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 125 transition count 350
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 28 place count 121 transition count 350
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 120 transition count 349
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 120 transition count 349
Applied a total of 30 rules in 18 ms. Remains 120 /135 variables (removed 15) and now considering 349/379 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 120/135 places, 349/379 transitions.
RANDOM walk for 40000 steps (1999 resets) in 78 ms. (506 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (519 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1490749 steps, run timeout after 3001 ms. (steps per millisecond=496 ) properties seen :0 out of 1
Probabilistic random walk after 1490749 steps, saw 417280 distinct states, run finished after 3001 ms. (steps per millisecond=496 ) properties seen :0
[2024-06-02 18:41:50] [INFO ] Flow matrix only has 342 transitions (discarded 7 similar events)
// Phase 1: matrix 342 rows 120 cols
[2024-06-02 18:41:50] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 18:41:50] [INFO ] State equation strengthened by 64 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/112 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:41:50] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 342/454 variables, 112/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/454 variables, 64/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/462 variables, 8/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/462 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/462 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 462/462 variables, and 192 constraints, problems are : Problem set: 0 solved, 1 unsolved in 176 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 120/120 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/112 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:41:51] [INFO ] Deduced a trap composed of 42 places in 63 ms of which 1 ms to minimize.
[2024-06-02 18:41:51] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 342/454 variables, 112/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 64/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/454 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 8/462 variables, 8/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/462 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/462 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 462/462 variables, and 195 constraints, problems are : Problem set: 0 solved, 1 unsolved in 281 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 120/120 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 496ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 349/349 transitions.
Applied a total of 0 rules in 3 ms. Remains 120 /120 variables (removed 0) and now considering 349/349 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 120/120 places, 349/349 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 349/349 transitions.
Applied a total of 0 rules in 3 ms. Remains 120 /120 variables (removed 0) and now considering 349/349 (removed 0) transitions.
[2024-06-02 18:41:51] [INFO ] Flow matrix only has 342 transitions (discarded 7 similar events)
[2024-06-02 18:41:51] [INFO ] Invariant cache hit.
[2024-06-02 18:41:51] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-02 18:41:51] [INFO ] Flow matrix only has 342 transitions (discarded 7 similar events)
[2024-06-02 18:41:51] [INFO ] Invariant cache hit.
[2024-06-02 18:41:51] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-06-02 18:41:51] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
[2024-06-02 18:41:51] [INFO ] Redundant transitions in 3 ms returned []
Running 345 sub problems to find dead transitions.
[2024-06-02 18:41:51] [INFO ] Flow matrix only has 342 transitions (discarded 7 similar events)
[2024-06-02 18:41:51] [INFO ] Invariant cache hit.
[2024-06-02 18:41:51] [INFO ] State equation strengthened by 64 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 345 unsolved
[2024-06-02 18:41:53] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-06-02 18:41:53] [INFO ] Deduced a trap composed of 42 places in 31 ms of which 0 ms to minimize.
[2024-06-02 18:41:53] [INFO ] Deduced a trap composed of 80 places in 63 ms of which 1 ms to minimize.
[2024-06-02 18:41:53] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-06-02 18:41:53] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-06-02 18:41:54] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-06-02 18:41:54] [INFO ] Deduced a trap composed of 83 places in 60 ms of which 1 ms to minimize.
[2024-06-02 18:41:54] [INFO ] Deduced a trap composed of 86 places in 56 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 4 (OVERLAPS) 342/462 variables, 120/135 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 64/199 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 7 (OVERLAPS) 0/462 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 345 unsolved
No progress, stopping.
After SMT solving in domain Real declared 462/462 variables, and 199 constraints, problems are : Problem set: 0 solved, 345 unsolved in 10285 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 120/120 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 345/345 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 345 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 345 unsolved
[2024-06-02 18:42:03] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 5 (OVERLAPS) 342/462 variables, 120/136 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 64/200 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/462 variables, 345/545 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/462 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 9 (OVERLAPS) 0/462 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 345 unsolved
No progress, stopping.
After SMT solving in domain Int declared 462/462 variables, and 545 constraints, problems are : Problem set: 0 solved, 345 unsolved in 29098 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 120/120 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 345/345 constraints, Known Traps: 9/9 constraints]
After SMT, in 39679ms problems are : Problem set: 0 solved, 345 unsolved
Search for dead transitions found 0 dead transitions in 39685ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39991 ms. Remains : 120/120 places, 349/349 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 80 edges and 120 vertex of which 20 / 120 are part of one of the 3 SCC in 1 ms
Free SCC test removed 17 places
Drop transitions (Empty/Sink Transition effects.) removed 99 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 117 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 101 transition count 230
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 101 transition count 230
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 15 place count 101 transition count 220
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 1 with 2 rules applied. Total rules applied 17 place count 100 transition count 219
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 1 with 18 rules applied. Total rules applied 35 place count 100 transition count 201
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 4 rules applied. Total rules applied 39 place count 100 transition count 197
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 45 place count 96 transition count 195
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 45 place count 96 transition count 193
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 49 place count 94 transition count 193
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 51 place count 93 transition count 192
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 93 transition count 191
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 54 place count 92 transition count 190
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 55 place count 91 transition count 166
Iterating global reduction 3 with 1 rules applied. Total rules applied 56 place count 91 transition count 166
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 91 transition count 164
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 60 place count 89 transition count 164
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 64 place count 89 transition count 160
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 66 place count 89 transition count 158
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 68 place count 87 transition count 158
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 72 place count 87 transition count 158
Applied a total of 72 rules in 34 ms. Remains 87 /120 variables (removed 33) and now considering 158/349 (removed 191) transitions.
Running SMT prover for 1 properties.
[2024-06-02 18:42:31] [INFO ] Flow matrix only has 156 transitions (discarded 2 similar events)
// Phase 1: matrix 156 rows 87 cols
[2024-06-02 18:42:31] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 18:42:31] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 18:42:31] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 18:42:31] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 18:42:31] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 18:42:31] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-02 18:42:31] [INFO ] After 6ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 18:42:31] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 18:42:31] [INFO ] After 84ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 191 ms.
RANDOM walk for 40000 steps (1834 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (470 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1326384 steps, run timeout after 3001 ms. (steps per millisecond=441 ) properties seen :0 out of 1
Probabilistic random walk after 1326384 steps, saw 392855 distinct states, run finished after 3001 ms. (steps per millisecond=441 ) properties seen :0
[2024-06-02 18:42:34] [INFO ] Flow matrix only has 372 transitions (discarded 7 similar events)
// Phase 1: matrix 372 rows 135 cols
[2024-06-02 18:42:34] [INFO ] Computed 7 invariants in 8 ms
[2024-06-02 18:42:34] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 72/127 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:42:34] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 1 ms to minimize.
[2024-06-02 18:42:34] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 1 ms to minimize.
[2024-06-02 18:42:34] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 372/499 variables, 127/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 47/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/507 variables, 8/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/507 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/507 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 507/507 variables, and 192 constraints, problems are : Problem set: 0 solved, 1 unsolved in 362 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 72/127 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 372/499 variables, 127/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 47/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/499 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 8/507 variables, 8/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/507 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/507 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 507/507 variables, and 193 constraints, problems are : Problem set: 0 solved, 1 unsolved in 196 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 573ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 379/379 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 133 transition count 377
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 133 transition count 377
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 132 transition count 371
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 132 transition count 371
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 131 transition count 369
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 131 transition count 369
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 130 transition count 366
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 130 transition count 366
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 129 transition count 364
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 129 transition count 364
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 128 transition count 361
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 128 transition count 361
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 127 transition count 359
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 127 transition count 359
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 126 transition count 356
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 126 transition count 356
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 125 transition count 354
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 125 transition count 354
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 124 transition count 351
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 124 transition count 351
Free-agglomeration rule applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 124 transition count 347
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 30 place count 120 transition count 347
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 119 transition count 346
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 119 transition count 346
Applied a total of 32 rules in 21 ms. Remains 119 /135 variables (removed 16) and now considering 346/379 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 119/135 places, 346/379 transitions.
RANDOM walk for 40000 steps (2003 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (496 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1356214 steps, run timeout after 3001 ms. (steps per millisecond=451 ) properties seen :0 out of 1
Probabilistic random walk after 1356214 steps, saw 382092 distinct states, run finished after 3001 ms. (steps per millisecond=451 ) properties seen :0
[2024-06-02 18:42:38] [INFO ] Flow matrix only has 339 transitions (discarded 7 similar events)
// Phase 1: matrix 339 rows 119 cols
[2024-06-02 18:42:38] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 18:42:38] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/111 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:42:38] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 339/450 variables, 111/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/450 variables, 63/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/450 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/458 variables, 8/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/458 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/458 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 458/458 variables, and 190 constraints, problems are : Problem set: 0 solved, 1 unsolved in 185 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 119/119 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/111 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:42:38] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 339/450 variables, 111/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/450 variables, 63/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/450 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/450 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 8/458 variables, 8/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/458 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/458 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 458/458 variables, and 192 constraints, problems are : Problem set: 0 solved, 1 unsolved in 189 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 119/119 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 386ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 346/346 transitions.
Applied a total of 0 rules in 4 ms. Remains 119 /119 variables (removed 0) and now considering 346/346 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 119/119 places, 346/346 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 346/346 transitions.
Applied a total of 0 rules in 3 ms. Remains 119 /119 variables (removed 0) and now considering 346/346 (removed 0) transitions.
[2024-06-02 18:42:38] [INFO ] Flow matrix only has 339 transitions (discarded 7 similar events)
[2024-06-02 18:42:38] [INFO ] Invariant cache hit.
[2024-06-02 18:42:38] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-02 18:42:38] [INFO ] Flow matrix only has 339 transitions (discarded 7 similar events)
[2024-06-02 18:42:38] [INFO ] Invariant cache hit.
[2024-06-02 18:42:38] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-06-02 18:42:38] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
[2024-06-02 18:42:38] [INFO ] Redundant transitions in 3 ms returned []
Running 342 sub problems to find dead transitions.
[2024-06-02 18:42:38] [INFO ] Flow matrix only has 339 transitions (discarded 7 similar events)
[2024-06-02 18:42:38] [INFO ] Invariant cache hit.
[2024-06-02 18:42:38] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 342 unsolved
[2024-06-02 18:42:40] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 1 ms to minimize.
[2024-06-02 18:42:40] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 1 ms to minimize.
[2024-06-02 18:42:41] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 1 ms to minimize.
[2024-06-02 18:42:41] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2024-06-02 18:42:41] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-06-02 18:42:41] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 0 ms to minimize.
[2024-06-02 18:42:41] [INFO ] Deduced a trap composed of 83 places in 62 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 342 unsolved
[2024-06-02 18:42:42] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-06-02 18:42:43] [INFO ] Deduced a trap composed of 85 places in 62 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 5 (OVERLAPS) 339/458 variables, 119/135 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 63/198 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 8 (OVERLAPS) 0/458 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 342 unsolved
No progress, stopping.
After SMT solving in domain Real declared 458/458 variables, and 198 constraints, problems are : Problem set: 0 solved, 342 unsolved in 11137 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 119/119 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 342/342 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 342 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 4 (OVERLAPS) 339/458 variables, 119/135 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/458 variables, 63/198 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 342/540 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 8 (OVERLAPS) 0/458 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 342 unsolved
No progress, stopping.
After SMT solving in domain Int declared 458/458 variables, and 540 constraints, problems are : Problem set: 0 solved, 342 unsolved in 28763 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 119/119 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 342/342 constraints, Known Traps: 9/9 constraints]
After SMT, in 40145ms problems are : Problem set: 0 solved, 342 unsolved
Search for dead transitions found 0 dead transitions in 40150ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40461 ms. Remains : 119/119 places, 346/346 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 80 edges and 119 vertex of which 20 / 119 are part of one of the 3 SCC in 1 ms
Free SCC test removed 17 places
Drop transitions (Empty/Sink Transition effects.) removed 99 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 117 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 100 transition count 227
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 100 transition count 227
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 15 place count 100 transition count 217
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 1 with 2 rules applied. Total rules applied 17 place count 99 transition count 216
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 1 with 18 rules applied. Total rules applied 35 place count 99 transition count 198
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 4 rules applied. Total rules applied 39 place count 99 transition count 194
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 45 place count 95 transition count 192
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 45 place count 95 transition count 190
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 49 place count 93 transition count 190
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 51 place count 92 transition count 189
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 92 transition count 188
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 54 place count 91 transition count 187
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 55 place count 90 transition count 164
Iterating global reduction 3 with 1 rules applied. Total rules applied 56 place count 90 transition count 164
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 90 transition count 162
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 60 place count 88 transition count 162
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 64 place count 88 transition count 158
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 66 place count 88 transition count 156
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 68 place count 86 transition count 156
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 72 place count 86 transition count 156
Applied a total of 72 rules in 20 ms. Remains 86 /119 variables (removed 33) and now considering 156/346 (removed 190) transitions.
Running SMT prover for 1 properties.
[2024-06-02 18:43:19] [INFO ] Flow matrix only has 154 transitions (discarded 2 similar events)
// Phase 1: matrix 154 rows 86 cols
[2024-06-02 18:43:19] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 18:43:19] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 18:43:19] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 18:43:19] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 18:43:19] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 18:43:19] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-02 18:43:19] [INFO ] After 6ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 18:43:19] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 18:43:19] [INFO ] After 83ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 178 ms.
RANDOM walk for 40000 steps (1899 resets) in 78 ms. (506 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (470 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1223129 steps, run timeout after 3001 ms. (steps per millisecond=407 ) properties seen :0 out of 1
Probabilistic random walk after 1223129 steps, saw 361540 distinct states, run finished after 3001 ms. (steps per millisecond=407 ) properties seen :0
[2024-06-02 18:43:22] [INFO ] Flow matrix only has 372 transitions (discarded 7 similar events)
// Phase 1: matrix 372 rows 135 cols
[2024-06-02 18:43:22] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 18:43:22] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 72/127 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:43:22] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 1 ms to minimize.
[2024-06-02 18:43:22] [INFO ] Deduced a trap composed of 44 places in 37 ms of which 1 ms to minimize.
[2024-06-02 18:43:22] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 372/499 variables, 127/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 47/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/507 variables, 8/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/507 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/507 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 507/507 variables, and 192 constraints, problems are : Problem set: 0 solved, 1 unsolved in 334 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 72/127 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 372/499 variables, 127/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 47/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/499 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 8/507 variables, 8/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/507 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/507 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 507/507 variables, and 193 constraints, problems are : Problem set: 0 solved, 1 unsolved in 144 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 486ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 379/379 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 133 transition count 377
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 133 transition count 377
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 132 transition count 371
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 132 transition count 371
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 131 transition count 369
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 131 transition count 369
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 130 transition count 366
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 130 transition count 366
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 129 transition count 364
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 129 transition count 364
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 128 transition count 361
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 128 transition count 361
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 127 transition count 359
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 127 transition count 359
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 126 transition count 356
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 126 transition count 356
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 125 transition count 354
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 125 transition count 354
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 124 transition count 351
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 124 transition count 351
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 123 transition count 349
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 123 transition count 349
Free-agglomeration rule applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 123 transition count 345
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 32 place count 119 transition count 345
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 118 transition count 344
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 118 transition count 344
Applied a total of 34 rules in 21 ms. Remains 118 /135 variables (removed 17) and now considering 344/379 (removed 35) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 118/135 places, 344/379 transitions.
RANDOM walk for 40000 steps (1995 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (487 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1471053 steps, run timeout after 3001 ms. (steps per millisecond=490 ) properties seen :0 out of 1
Probabilistic random walk after 1471053 steps, saw 413448 distinct states, run finished after 3003 ms. (steps per millisecond=489 ) properties seen :0
[2024-06-02 18:43:25] [INFO ] Flow matrix only has 337 transitions (discarded 7 similar events)
// Phase 1: matrix 337 rows 118 cols
[2024-06-02 18:43:25] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 18:43:25] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 42/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/110 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:43:25] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 337/447 variables, 110/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 63/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/455 variables, 8/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/455 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/455 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 455/455 variables, and 189 constraints, problems are : Problem set: 0 solved, 1 unsolved in 173 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 118/118 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 42/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/110 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:43:26] [INFO ] Deduced a trap composed of 42 places in 63 ms of which 1 ms to minimize.
[2024-06-02 18:43:26] [INFO ] Deduced a trap composed of 63 places in 57 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 337/447 variables, 110/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 63/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/447 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 8/455 variables, 8/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/455 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/455 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 455/455 variables, and 192 constraints, problems are : Problem set: 0 solved, 1 unsolved in 269 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 118/118 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 451ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 344/344 transitions.
Applied a total of 0 rules in 3 ms. Remains 118 /118 variables (removed 0) and now considering 344/344 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 118/118 places, 344/344 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 344/344 transitions.
Applied a total of 0 rules in 3 ms. Remains 118 /118 variables (removed 0) and now considering 344/344 (removed 0) transitions.
[2024-06-02 18:43:26] [INFO ] Flow matrix only has 337 transitions (discarded 7 similar events)
[2024-06-02 18:43:26] [INFO ] Invariant cache hit.
[2024-06-02 18:43:26] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-02 18:43:26] [INFO ] Flow matrix only has 337 transitions (discarded 7 similar events)
[2024-06-02 18:43:26] [INFO ] Invariant cache hit.
[2024-06-02 18:43:26] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-06-02 18:43:26] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
[2024-06-02 18:43:26] [INFO ] Redundant transitions in 2 ms returned []
Running 340 sub problems to find dead transitions.
[2024-06-02 18:43:26] [INFO ] Flow matrix only has 337 transitions (discarded 7 similar events)
[2024-06-02 18:43:26] [INFO ] Invariant cache hit.
[2024-06-02 18:43:26] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 340 unsolved
[2024-06-02 18:43:28] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-06-02 18:43:28] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 3 ms to minimize.
[2024-06-02 18:43:28] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2024-06-02 18:43:28] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-06-02 18:43:28] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-06-02 18:43:29] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 0 ms to minimize.
[2024-06-02 18:43:29] [INFO ] Deduced a trap composed of 84 places in 61 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 4 (OVERLAPS) 337/455 variables, 118/132 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/455 variables, 63/195 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 7 (OVERLAPS) 0/455 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 340 unsolved
No progress, stopping.
After SMT solving in domain Real declared 455/455 variables, and 195 constraints, problems are : Problem set: 0 solved, 340 unsolved in 10194 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 118/118 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 340/340 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 340 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 4 (OVERLAPS) 337/455 variables, 118/132 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/455 variables, 63/195 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 340/535 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/455 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 8 (OVERLAPS) 0/455 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 340 unsolved
No progress, stopping.
After SMT solving in domain Int declared 455/455 variables, and 535 constraints, problems are : Problem set: 0 solved, 340 unsolved in 24724 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 118/118 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 340/340 constraints, Known Traps: 7/7 constraints]
After SMT, in 35218ms problems are : Problem set: 0 solved, 340 unsolved
Search for dead transitions found 0 dead transitions in 35223ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35516 ms. Remains : 118/118 places, 344/344 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 80 edges and 118 vertex of which 20 / 118 are part of one of the 3 SCC in 0 ms
Free SCC test removed 17 places
Drop transitions (Empty/Sink Transition effects.) removed 99 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 117 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 99 transition count 225
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 99 transition count 225
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 15 place count 99 transition count 215
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 1 with 2 rules applied. Total rules applied 17 place count 98 transition count 214
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 1 with 18 rules applied. Total rules applied 35 place count 98 transition count 196
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 4 rules applied. Total rules applied 39 place count 98 transition count 192
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 45 place count 94 transition count 190
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 45 place count 94 transition count 188
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 49 place count 92 transition count 188
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 51 place count 91 transition count 187
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 91 transition count 186
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 54 place count 90 transition count 185
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 55 place count 89 transition count 162
Iterating global reduction 3 with 1 rules applied. Total rules applied 56 place count 89 transition count 162
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 89 transition count 160
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 60 place count 87 transition count 160
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 64 place count 87 transition count 156
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 66 place count 87 transition count 154
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 68 place count 85 transition count 154
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 72 place count 85 transition count 154
Applied a total of 72 rules in 17 ms. Remains 85 /118 variables (removed 33) and now considering 154/344 (removed 190) transitions.
Running SMT prover for 1 properties.
[2024-06-02 18:44:01] [INFO ] Flow matrix only has 152 transitions (discarded 2 similar events)
// Phase 1: matrix 152 rows 85 cols
[2024-06-02 18:44:01] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 18:44:01] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 18:44:01] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 18:44:02] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 18:44:02] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 18:44:02] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-02 18:44:02] [INFO ] After 5ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 18:44:02] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 18:44:02] [INFO ] After 109ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 219 ms.
RANDOM walk for 33 steps (0 resets) in 5 ms. (5 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (1856 resets) in 99 ms. (400 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (455 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1413050 steps, run timeout after 3001 ms. (steps per millisecond=470 ) properties seen :0 out of 1
Probabilistic random walk after 1413050 steps, saw 420630 distinct states, run finished after 3002 ms. (steps per millisecond=470 ) properties seen :0
[2024-06-02 18:44:05] [INFO ] Flow matrix only has 372 transitions (discarded 7 similar events)
// Phase 1: matrix 372 rows 135 cols
[2024-06-02 18:44:05] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 18:44:05] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 72/127 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:44:05] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 1 ms to minimize.
[2024-06-02 18:44:05] [INFO ] Deduced a trap composed of 45 places in 86 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 372/499 variables, 127/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 47/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/507 variables, 8/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/507 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/507 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 507/507 variables, and 191 constraints, problems are : Problem set: 0 solved, 1 unsolved in 313 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 72/127 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:44:05] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 1 ms to minimize.
[2024-06-02 18:44:05] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 372/499 variables, 127/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 47/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/499 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/499 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 8/507 variables, 8/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/507 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/507 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 507/507 variables, and 194 constraints, problems are : Problem set: 0 solved, 1 unsolved in 352 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 695ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 379/379 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 133 transition count 377
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 133 transition count 377
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 132 transition count 371
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 132 transition count 371
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 131 transition count 369
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 131 transition count 369
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 130 transition count 366
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 130 transition count 366
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 129 transition count 364
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 129 transition count 364
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 128 transition count 361
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 128 transition count 361
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 127 transition count 359
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 127 transition count 359
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 126 transition count 356
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 126 transition count 356
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 125 transition count 354
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 125 transition count 354
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 124 transition count 351
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 124 transition count 351
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 123 transition count 349
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 123 transition count 349
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 122 transition count 347
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 122 transition count 347
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 121 transition count 345
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 121 transition count 345
Free-agglomeration rule applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 121 transition count 341
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 36 place count 117 transition count 341
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 116 transition count 340
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 116 transition count 340
Applied a total of 38 rules in 27 ms. Remains 116 /135 variables (removed 19) and now considering 340/379 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 116/135 places, 340/379 transitions.
RANDOM walk for 40000 steps (1998 resets) in 153 ms. (259 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (511 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1619214 steps, run timeout after 3001 ms. (steps per millisecond=539 ) properties seen :0 out of 1
Probabilistic random walk after 1619214 steps, saw 446625 distinct states, run finished after 3004 ms. (steps per millisecond=539 ) properties seen :0
[2024-06-02 18:44:08] [INFO ] Flow matrix only has 333 transitions (discarded 7 similar events)
// Phase 1: matrix 333 rows 116 cols
[2024-06-02 18:44:08] [INFO ] Computed 7 invariants in 8 ms
[2024-06-02 18:44:08] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/108 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 333/441 variables, 108/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 63/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/441 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 8/449 variables, 8/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/449 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/449 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 449/449 variables, and 186 constraints, problems are : Problem set: 0 solved, 1 unsolved in 117 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 116/116 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/108 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:44:09] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 333/441 variables, 108/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/441 variables, 63/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/441 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/441 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 8/449 variables, 8/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/449 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/449 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 449/449 variables, and 188 constraints, problems are : Problem set: 0 solved, 1 unsolved in 179 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 116/116 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 347ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 340/340 transitions.
Applied a total of 0 rules in 3 ms. Remains 116 /116 variables (removed 0) and now considering 340/340 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 116/116 places, 340/340 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 340/340 transitions.
Applied a total of 0 rules in 2 ms. Remains 116 /116 variables (removed 0) and now considering 340/340 (removed 0) transitions.
[2024-06-02 18:44:09] [INFO ] Flow matrix only has 333 transitions (discarded 7 similar events)
[2024-06-02 18:44:09] [INFO ] Invariant cache hit.
[2024-06-02 18:44:09] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-02 18:44:09] [INFO ] Flow matrix only has 333 transitions (discarded 7 similar events)
[2024-06-02 18:44:09] [INFO ] Invariant cache hit.
[2024-06-02 18:44:09] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-06-02 18:44:09] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
[2024-06-02 18:44:09] [INFO ] Redundant transitions in 1 ms returned []
Running 336 sub problems to find dead transitions.
[2024-06-02 18:44:09] [INFO ] Flow matrix only has 333 transitions (discarded 7 similar events)
[2024-06-02 18:44:09] [INFO ] Invariant cache hit.
[2024-06-02 18:44:09] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-06-02 18:44:11] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 1 ms to minimize.
[2024-06-02 18:44:11] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 1 ms to minimize.
[2024-06-02 18:44:11] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2024-06-02 18:44:11] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-06-02 18:44:11] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 0 ms to minimize.
[2024-06-02 18:44:11] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 1 ms to minimize.
[2024-06-02 18:44:12] [INFO ] Deduced a trap composed of 82 places in 77 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 4 (OVERLAPS) 333/449 variables, 116/130 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/449 variables, 63/193 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/449 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 7 (OVERLAPS) 0/449 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 336 unsolved
No progress, stopping.
After SMT solving in domain Real declared 449/449 variables, and 193 constraints, problems are : Problem set: 0 solved, 336 unsolved in 9697 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 116/116 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 336/336 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 336 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 4 (OVERLAPS) 333/449 variables, 116/130 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/449 variables, 63/193 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/449 variables, 336/529 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/449 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 8 (OVERLAPS) 0/449 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 336 unsolved
No progress, stopping.
After SMT solving in domain Int declared 449/449 variables, and 529 constraints, problems are : Problem set: 0 solved, 336 unsolved in 25702 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 116/116 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 336/336 constraints, Known Traps: 7/7 constraints]
After SMT, in 35696ms problems are : Problem set: 0 solved, 336 unsolved
Search for dead transitions found 0 dead transitions in 35699ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35983 ms. Remains : 116/116 places, 340/340 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 80 edges and 116 vertex of which 20 / 116 are part of one of the 3 SCC in 0 ms
Free SCC test removed 17 places
Drop transitions (Empty/Sink Transition effects.) removed 99 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 117 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 97 transition count 221
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 97 transition count 221
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 15 place count 97 transition count 211
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 1 with 2 rules applied. Total rules applied 17 place count 96 transition count 210
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 1 with 18 rules applied. Total rules applied 35 place count 96 transition count 192
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 4 rules applied. Total rules applied 39 place count 96 transition count 188
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 45 place count 92 transition count 186
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 45 place count 92 transition count 184
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 49 place count 90 transition count 184
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 3 with 2 rules applied. Total rules applied 51 place count 89 transition count 183
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 89 transition count 182
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 54 place count 88 transition count 181
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 55 place count 87 transition count 159
Iterating global reduction 3 with 1 rules applied. Total rules applied 56 place count 87 transition count 159
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 87 transition count 157
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 60 place count 85 transition count 157
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 64 place count 85 transition count 153
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 66 place count 85 transition count 151
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 68 place count 83 transition count 151
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 72 place count 83 transition count 151
Applied a total of 72 rules in 27 ms. Remains 83 /116 variables (removed 33) and now considering 151/340 (removed 189) transitions.
Running SMT prover for 1 properties.
[2024-06-02 18:44:45] [INFO ] Flow matrix only has 149 transitions (discarded 2 similar events)
// Phase 1: matrix 149 rows 83 cols
[2024-06-02 18:44:45] [INFO ] Computed 7 invariants in 8 ms
[2024-06-02 18:44:45] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 18:44:45] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 18:44:45] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 18:44:45] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 18:44:45] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-02 18:44:45] [INFO ] After 4ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 18:44:45] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 18:44:45] [INFO ] After 103ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 251 ms.
RANDOM walk for 40000 steps (1849 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (462 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1457909 steps, run timeout after 3001 ms. (steps per millisecond=485 ) properties seen :0 out of 1
Probabilistic random walk after 1457909 steps, saw 430743 distinct states, run finished after 3001 ms. (steps per millisecond=485 ) properties seen :0
[2024-06-02 18:44:48] [INFO ] Flow matrix only has 372 transitions (discarded 7 similar events)
// Phase 1: matrix 372 rows 135 cols
[2024-06-02 18:44:48] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 18:44:48] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 72/127 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:44:48] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
[2024-06-02 18:44:48] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 0 ms to minimize.
[2024-06-02 18:44:48] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 372/499 variables, 127/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 47/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/507 variables, 8/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/507 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/507 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 507/507 variables, and 192 constraints, problems are : Problem set: 0 solved, 1 unsolved in 347 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 72/127 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 372/499 variables, 127/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 47/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/499 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 8/507 variables, 8/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/507 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/507 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 507/507 variables, and 193 constraints, problems are : Problem set: 0 solved, 1 unsolved in 140 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 529ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 379/379 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 133 transition count 377
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 133 transition count 377
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 132 transition count 371
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 132 transition count 371
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 131 transition count 369
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 131 transition count 369
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 130 transition count 366
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 130 transition count 366
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 129 transition count 364
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 129 transition count 364
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 128 transition count 361
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 128 transition count 361
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 127 transition count 359
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 127 transition count 359
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 126 transition count 356
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 126 transition count 356
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 125 transition count 354
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 125 transition count 354
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 124 transition count 351
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 124 transition count 351
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 123 transition count 349
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 123 transition count 349
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 122 transition count 347
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 122 transition count 347
Free-agglomeration rule applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 122 transition count 343
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 34 place count 118 transition count 343
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 117 transition count 342
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 117 transition count 342
Applied a total of 36 rules in 21 ms. Remains 117 /135 variables (removed 18) and now considering 342/379 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 117/135 places, 342/379 transitions.
RANDOM walk for 40000 steps (2012 resets) in 104 ms. (380 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (485 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1674917 steps, run timeout after 3001 ms. (steps per millisecond=558 ) properties seen :0 out of 1
Probabilistic random walk after 1674917 steps, saw 458989 distinct states, run finished after 3001 ms. (steps per millisecond=558 ) properties seen :0
[2024-06-02 18:44:52] [INFO ] Flow matrix only has 335 transitions (discarded 7 similar events)
// Phase 1: matrix 335 rows 117 cols
[2024-06-02 18:44:52] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 18:44:52] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 41/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/109 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:44:52] [INFO ] Deduced a trap composed of 76 places in 73 ms of which 0 ms to minimize.
[2024-06-02 18:44:52] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 335/444 variables, 109/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/444 variables, 63/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/444 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/452 variables, 8/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/452 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/452 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 452/452 variables, and 189 constraints, problems are : Problem set: 0 solved, 1 unsolved in 258 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 117/117 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 41/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/109 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:44:52] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 335/444 variables, 109/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/444 variables, 63/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/444 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/444 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 8/452 variables, 8/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/452 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/452 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 452/452 variables, and 191 constraints, problems are : Problem set: 0 solved, 1 unsolved in 189 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 117/117 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 475ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 342/342 transitions.
Applied a total of 0 rules in 3 ms. Remains 117 /117 variables (removed 0) and now considering 342/342 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 117/117 places, 342/342 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 342/342 transitions.
Applied a total of 0 rules in 4 ms. Remains 117 /117 variables (removed 0) and now considering 342/342 (removed 0) transitions.
[2024-06-02 18:44:52] [INFO ] Flow matrix only has 335 transitions (discarded 7 similar events)
[2024-06-02 18:44:52] [INFO ] Invariant cache hit.
[2024-06-02 18:44:52] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-02 18:44:52] [INFO ] Flow matrix only has 335 transitions (discarded 7 similar events)
[2024-06-02 18:44:52] [INFO ] Invariant cache hit.
[2024-06-02 18:44:52] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-06-02 18:44:52] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
[2024-06-02 18:44:52] [INFO ] Redundant transitions in 1 ms returned []
Running 338 sub problems to find dead transitions.
[2024-06-02 18:44:52] [INFO ] Flow matrix only has 335 transitions (discarded 7 similar events)
[2024-06-02 18:44:52] [INFO ] Invariant cache hit.
[2024-06-02 18:44:52] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 338 unsolved
[2024-06-02 18:44:54] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 1 ms to minimize.
[2024-06-02 18:44:54] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 0 ms to minimize.
[2024-06-02 18:44:55] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 0 ms to minimize.
[2024-06-02 18:44:55] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2024-06-02 18:44:55] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 0 ms to minimize.
[2024-06-02 18:44:55] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-06-02 18:44:55] [INFO ] Deduced a trap composed of 83 places in 65 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 4 (OVERLAPS) 335/452 variables, 117/131 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/452 variables, 63/194 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/452 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 7 (OVERLAPS) 0/452 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 338 unsolved
No progress, stopping.
After SMT solving in domain Real declared 452/452 variables, and 194 constraints, problems are : Problem set: 0 solved, 338 unsolved in 9577 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 117/117 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 338/338 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 338 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 4 (OVERLAPS) 335/452 variables, 117/131 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/452 variables, 63/194 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/452 variables, 338/532 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/452 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 8 (OVERLAPS) 0/452 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 338 unsolved
No progress, stopping.
After SMT solving in domain Int declared 452/452 variables, and 532 constraints, problems are : Problem set: 0 solved, 338 unsolved in 20323 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 117/117 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 338/338 constraints, Known Traps: 7/7 constraints]
After SMT, in 30167ms problems are : Problem set: 0 solved, 338 unsolved
Search for dead transitions found 0 dead transitions in 30169ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30464 ms. Remains : 117/117 places, 342/342 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 80 edges and 117 vertex of which 20 / 117 are part of one of the 3 SCC in 0 ms
Free SCC test removed 17 places
Drop transitions (Empty/Sink Transition effects.) removed 99 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 117 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 98 transition count 223
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 98 transition count 223
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 15 place count 98 transition count 213
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 1 with 2 rules applied. Total rules applied 17 place count 97 transition count 212
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 1 with 18 rules applied. Total rules applied 35 place count 97 transition count 194
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 4 rules applied. Total rules applied 39 place count 97 transition count 190
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 45 place count 93 transition count 188
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 45 place count 93 transition count 186
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 49 place count 91 transition count 186
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 51 place count 90 transition count 185
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 90 transition count 184
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 54 place count 89 transition count 183
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 55 place count 88 transition count 161
Iterating global reduction 3 with 1 rules applied. Total rules applied 56 place count 88 transition count 161
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 88 transition count 159
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 60 place count 86 transition count 159
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 64 place count 86 transition count 155
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 66 place count 86 transition count 153
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 68 place count 84 transition count 153
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 72 place count 84 transition count 153
Applied a total of 72 rules in 17 ms. Remains 84 /117 variables (removed 33) and now considering 153/342 (removed 189) transitions.
Running SMT prover for 1 properties.
[2024-06-02 18:45:23] [INFO ] Flow matrix only has 151 transitions (discarded 2 similar events)
// Phase 1: matrix 151 rows 84 cols
[2024-06-02 18:45:23] [INFO ] Computed 7 invariants in 0 ms
[2024-06-02 18:45:23] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 18:45:23] [INFO ] After 78ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-02 18:45:23] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-02 18:45:23] [INFO ] After 5ms SMT Verify possible using 6 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 18:45:23] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 18:45:23] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 18:45:23] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 18:45:23] [INFO ] After 5ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 18:45:23] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-06-02 18:45:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
TRAPS : Iteration 1
[2024-06-02 18:45:23] [INFO ] After 67ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 18:45:23] [INFO ] After 133ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 293 ms.
RANDOM walk for 125 steps (3 resets) in 4 ms. (25 steps per ms) remains 0/1 properties
RANDOM walk for 5301 steps (234 resets) in 12 ms. (407 steps per ms) remains 0/1 properties
RANDOM walk for 136 steps (6 resets) in 6 ms. (19 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (1797 resets) in 81 ms. (487 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (467 resets) in 22 ms. (1739 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1406122 steps, run timeout after 3001 ms. (steps per millisecond=468 ) properties seen :0 out of 1
Probabilistic random walk after 1406122 steps, saw 418036 distinct states, run finished after 3001 ms. (steps per millisecond=468 ) properties seen :0
[2024-06-02 18:45:26] [INFO ] Flow matrix only has 372 transitions (discarded 7 similar events)
// Phase 1: matrix 372 rows 135 cols
[2024-06-02 18:45:26] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 18:45:26] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 122/127 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:45:26] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 372/499 variables, 127/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 47/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/507 variables, 8/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/507 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/507 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 507/507 variables, and 190 constraints, problems are : Problem set: 0 solved, 1 unsolved in 225 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 122/127 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:45:26] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 2 ms to minimize.
[2024-06-02 18:45:26] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 372/499 variables, 127/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 47/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/499 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/499 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 8/507 variables, 8/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/507 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/507 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 507/507 variables, and 193 constraints, problems are : Problem set: 0 solved, 1 unsolved in 512 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 767ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 379/379 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 134 transition count 378
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 134 transition count 378
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 133 transition count 372
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 133 transition count 372
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 132 transition count 370
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 132 transition count 370
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 131 transition count 367
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 131 transition count 367
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 130 transition count 365
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 130 transition count 365
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 129 transition count 362
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 129 transition count 362
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 128 transition count 360
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 128 transition count 360
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 127 transition count 357
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 127 transition count 357
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 126 transition count 355
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 126 transition count 355
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 125 transition count 352
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 125 transition count 352
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 124 transition count 350
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 124 transition count 350
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 123 transition count 348
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 123 transition count 348
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 122 transition count 346
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 122 transition count 346
Free-agglomeration rule applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 122 transition count 342
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 34 place count 118 transition count 342
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 117 transition count 341
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 117 transition count 341
Applied a total of 36 rules in 38 ms. Remains 117 /135 variables (removed 18) and now considering 341/379 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 117/135 places, 341/379 transitions.
RANDOM walk for 40000 steps (2008 resets) in 97 ms. (408 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (493 resets) in 23 ms. (1666 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 502859 steps, run visited all 1 properties in 996 ms. (steps per millisecond=504 )
Probabilistic random walk after 502859 steps, saw 133104 distinct states, run finished after 1001 ms. (steps per millisecond=502 ) properties seen :1
RANDOM walk for 40000 steps (1827 resets) in 72 ms. (547 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (472 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1396594 steps, run timeout after 3001 ms. (steps per millisecond=465 ) properties seen :0 out of 1
Probabilistic random walk after 1396594 steps, saw 414557 distinct states, run finished after 3001 ms. (steps per millisecond=465 ) properties seen :0
[2024-06-02 18:45:31] [INFO ] Flow matrix only has 372 transitions (discarded 7 similar events)
[2024-06-02 18:45:31] [INFO ] Invariant cache hit.
[2024-06-02 18:45:31] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 72/127 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:45:31] [INFO ] Deduced a trap composed of 45 places in 420 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 372/499 variables, 127/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 47/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/507 variables, 8/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/507 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/507 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 507/507 variables, and 190 constraints, problems are : Problem set: 0 solved, 1 unsolved in 698 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 72/127 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:45:32] [INFO ] Deduced a trap composed of 35 places in 295 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 372/499 variables, 127/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 47/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/499 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/499 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 8/507 variables, 8/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/507 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/507 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 507/507 variables, and 192 constraints, problems are : Problem set: 0 solved, 1 unsolved in 796 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 1518ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 379/379 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 133 transition count 377
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 133 transition count 377
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 132 transition count 371
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 132 transition count 371
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 131 transition count 369
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 131 transition count 369
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 130 transition count 366
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 130 transition count 366
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 129 transition count 364
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 129 transition count 364
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 128 transition count 361
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 128 transition count 361
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 127 transition count 359
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 127 transition count 359
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 126 transition count 356
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 126 transition count 356
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 125 transition count 354
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 125 transition count 354
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 124 transition count 351
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 124 transition count 351
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 123 transition count 349
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 123 transition count 349
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 122 transition count 347
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 122 transition count 347
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 121 transition count 345
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 121 transition count 345
Free-agglomeration rule applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 121 transition count 341
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 36 place count 117 transition count 341
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 116 transition count 340
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 116 transition count 340
Applied a total of 38 rules in 26 ms. Remains 116 /135 variables (removed 19) and now considering 340/379 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 116/135 places, 340/379 transitions.
RANDOM walk for 38092 steps (1918 resets) in 85 ms. (442 steps per ms) remains 0/1 properties
RANDOM walk for 62 steps (1 resets) in 4 ms. (12 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (1868 resets) in 94 ms. (421 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (452 resets) in 22 ms. (1739 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1395480 steps, run timeout after 3001 ms. (steps per millisecond=465 ) properties seen :0 out of 1
Probabilistic random walk after 1395480 steps, saw 414058 distinct states, run finished after 3001 ms. (steps per millisecond=465 ) properties seen :0
[2024-06-02 18:45:36] [INFO ] Flow matrix only has 372 transitions (discarded 7 similar events)
[2024-06-02 18:45:36] [INFO ] Invariant cache hit.
[2024-06-02 18:45:36] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 72/127 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:45:36] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 1 ms to minimize.
[2024-06-02 18:45:36] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 1 ms to minimize.
[2024-06-02 18:45:36] [INFO ] Deduced a trap composed of 45 places in 81 ms of which 1 ms to minimize.
[2024-06-02 18:45:36] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 372/499 variables, 127/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 47/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/507 variables, 8/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/507 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/507 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 507/507 variables, and 193 constraints, problems are : Problem set: 0 solved, 1 unsolved in 483 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 72/127 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:45:36] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 372/499 variables, 127/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 47/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/499 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/499 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 8/507 variables, 8/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/507 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/507 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 507/507 variables, and 195 constraints, problems are : Problem set: 0 solved, 1 unsolved in 198 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 711ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 20 ms.
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 379/379 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 134 transition count 378
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 134 transition count 378
Free-agglomeration rule applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 134 transition count 374
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 10 place count 130 transition count 374
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 129 transition count 373
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 129 transition count 373
Applied a total of 12 rules in 9 ms. Remains 129 /135 variables (removed 6) and now considering 373/379 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 129/135 places, 373/379 transitions.
RANDOM walk for 40000 steps (1986 resets) in 94 ms. (421 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (493 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1523554 steps, run timeout after 3001 ms. (steps per millisecond=507 ) properties seen :0 out of 1
Probabilistic random walk after 1523554 steps, saw 424281 distinct states, run finished after 3001 ms. (steps per millisecond=507 ) properties seen :0
[2024-06-02 18:45:39] [INFO ] Flow matrix only has 366 transitions (discarded 7 similar events)
// Phase 1: matrix 366 rows 129 cols
[2024-06-02 18:45:39] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 18:45:39] [INFO ] State equation strengthened by 69 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/121 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:45:39] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 366/487 variables, 121/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/487 variables, 69/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:45:40] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-06-02 18:45:40] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/487 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/487 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 8/495 variables, 8/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/495 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/495 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 495/495 variables, and 208 constraints, problems are : Problem set: 0 solved, 1 unsolved in 363 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 129/129 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/121 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:45:40] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 366/487 variables, 121/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/487 variables, 69/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/487 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/487 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 8/495 variables, 8/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/495 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/495 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 495/495 variables, and 210 constraints, problems are : Problem set: 0 solved, 1 unsolved in 203 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 129/129 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 597ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 20 ms.
Support contains 1 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 373/373 transitions.
Applied a total of 0 rules in 5 ms. Remains 129 /129 variables (removed 0) and now considering 373/373 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 129/129 places, 373/373 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 373/373 transitions.
Applied a total of 0 rules in 3 ms. Remains 129 /129 variables (removed 0) and now considering 373/373 (removed 0) transitions.
[2024-06-02 18:45:40] [INFO ] Flow matrix only has 366 transitions (discarded 7 similar events)
[2024-06-02 18:45:40] [INFO ] Invariant cache hit.
[2024-06-02 18:45:40] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-02 18:45:40] [INFO ] Flow matrix only has 366 transitions (discarded 7 similar events)
[2024-06-02 18:45:40] [INFO ] Invariant cache hit.
[2024-06-02 18:45:40] [INFO ] State equation strengthened by 69 read => feed constraints.
[2024-06-02 18:45:40] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
[2024-06-02 18:45:40] [INFO ] Redundant transitions in 2 ms returned []
Running 369 sub problems to find dead transitions.
[2024-06-02 18:45:40] [INFO ] Flow matrix only has 366 transitions (discarded 7 similar events)
[2024-06-02 18:45:40] [INFO ] Invariant cache hit.
[2024-06-02 18:45:40] [INFO ] State equation strengthened by 69 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-06-02 18:45:42] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 1 ms to minimize.
[2024-06-02 18:45:42] [INFO ] Deduced a trap composed of 48 places in 80 ms of which 1 ms to minimize.
[2024-06-02 18:45:42] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 1 ms to minimize.
[2024-06-02 18:45:43] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 0 ms to minimize.
[2024-06-02 18:45:43] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2024-06-02 18:45:43] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 1 ms to minimize.
[2024-06-02 18:45:43] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 0 ms to minimize.
[2024-06-02 18:45:44] [INFO ] Deduced a trap composed of 83 places in 90 ms of which 0 ms to minimize.
[2024-06-02 18:45:44] [INFO ] Deduced a trap composed of 95 places in 79 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 4 (OVERLAPS) 366/495 variables, 129/145 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/495 variables, 69/214 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/495 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 7 (OVERLAPS) 0/495 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 369 unsolved
No progress, stopping.
After SMT solving in domain Real declared 495/495 variables, and 214 constraints, problems are : Problem set: 0 solved, 369 unsolved in 12204 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 129/129 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 369/369 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 369 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 4 (OVERLAPS) 366/495 variables, 129/145 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/495 variables, 69/214 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/495 variables, 369/583 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/495 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 8 (OVERLAPS) 0/495 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 369 unsolved
No progress, stopping.
After SMT solving in domain Int declared 495/495 variables, and 583 constraints, problems are : Problem set: 0 solved, 369 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 129/129 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 369/369 constraints, Known Traps: 9/9 constraints]
After SMT, in 42518ms problems are : Problem set: 0 solved, 369 unsolved
Search for dead transitions found 0 dead transitions in 42521ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42866 ms. Remains : 129/129 places, 373/373 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 85 edges and 129 vertex of which 20 / 129 are part of one of the 3 SCC in 0 ms
Free SCC test removed 17 places
Drop transitions (Empty/Sink Transition effects.) removed 99 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 117 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 110 transition count 254
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 110 transition count 254
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 15 place count 110 transition count 244
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 1 with 2 rules applied. Total rules applied 17 place count 109 transition count 243
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 1 with 18 rules applied. Total rules applied 35 place count 109 transition count 225
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 4 rules applied. Total rules applied 39 place count 109 transition count 221
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 45 place count 105 transition count 219
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 45 place count 105 transition count 217
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 49 place count 103 transition count 217
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 51 place count 102 transition count 216
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 102 transition count 215
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 54 place count 101 transition count 214
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 55 place count 100 transition count 185
Iterating global reduction 3 with 1 rules applied. Total rules applied 56 place count 100 transition count 185
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 100 transition count 183
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 60 place count 98 transition count 183
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 64 place count 98 transition count 179
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 66 place count 98 transition count 177
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 68 place count 96 transition count 177
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 72 place count 96 transition count 177
Applied a total of 72 rules in 22 ms. Remains 96 /129 variables (removed 33) and now considering 177/373 (removed 196) transitions.
Running SMT prover for 1 properties.
[2024-06-02 18:46:23] [INFO ] Flow matrix only has 175 transitions (discarded 2 similar events)
// Phase 1: matrix 175 rows 96 cols
[2024-06-02 18:46:23] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 18:46:23] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 18:46:23] [INFO ] After 130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 18:46:23] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 18:46:23] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 18:46:23] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-02 18:46:23] [INFO ] After 5ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 18:46:23] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 18:46:23] [INFO ] After 96ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 250 ms.
RANDOM walk for 40000 steps (1893 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (472 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1359945 steps, run timeout after 3001 ms. (steps per millisecond=453 ) properties seen :0 out of 1
Probabilistic random walk after 1359945 steps, saw 403523 distinct states, run finished after 3001 ms. (steps per millisecond=453 ) properties seen :0
[2024-06-02 18:46:26] [INFO ] Flow matrix only has 372 transitions (discarded 7 similar events)
// Phase 1: matrix 372 rows 135 cols
[2024-06-02 18:46:26] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 18:46:26] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 72/127 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:46:26] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 0 ms to minimize.
[2024-06-02 18:46:26] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
[2024-06-02 18:46:26] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 372/499 variables, 127/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 47/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/507 variables, 8/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/507 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/507 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 507/507 variables, and 192 constraints, problems are : Problem set: 0 solved, 1 unsolved in 341 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 72/127 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 372/499 variables, 127/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 47/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/499 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 8/507 variables, 8/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/507 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/507 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 507/507 variables, and 193 constraints, problems are : Problem set: 0 solved, 1 unsolved in 151 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 545ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 379/379 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 133 transition count 377
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 133 transition count 377
Free-agglomeration rule applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 133 transition count 373
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 12 place count 129 transition count 373
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 128 transition count 372
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 128 transition count 372
Applied a total of 14 rules in 9 ms. Remains 128 /135 variables (removed 7) and now considering 372/379 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 128/135 places, 372/379 transitions.
RANDOM walk for 40000 steps (2010 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (496 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1443002 steps, run timeout after 3001 ms. (steps per millisecond=480 ) properties seen :0 out of 1
Probabilistic random walk after 1443002 steps, saw 406750 distinct states, run finished after 3001 ms. (steps per millisecond=480 ) properties seen :0
[2024-06-02 18:46:30] [INFO ] Flow matrix only has 365 transitions (discarded 7 similar events)
// Phase 1: matrix 365 rows 128 cols
[2024-06-02 18:46:30] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 18:46:30] [INFO ] State equation strengthened by 69 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/120 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:46:30] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 365/485 variables, 120/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 69/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:46:30] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/485 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/485 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 8/493 variables, 8/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/493 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/493 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 493/493 variables, and 206 constraints, problems are : Problem set: 0 solved, 1 unsolved in 335 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 128/128 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/120 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:46:30] [INFO ] Deduced a trap composed of 42 places in 85 ms of which 1 ms to minimize.
[2024-06-02 18:46:30] [INFO ] Deduced a trap composed of 68 places in 74 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 365/485 variables, 120/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/485 variables, 69/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/485 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/485 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 8/493 variables, 8/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/493 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/493 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 493/493 variables, and 209 constraints, problems are : Problem set: 0 solved, 1 unsolved in 319 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 128/128 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 702ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 372/372 transitions.
Applied a total of 0 rules in 3 ms. Remains 128 /128 variables (removed 0) and now considering 372/372 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 128/128 places, 372/372 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 372/372 transitions.
Applied a total of 0 rules in 3 ms. Remains 128 /128 variables (removed 0) and now considering 372/372 (removed 0) transitions.
[2024-06-02 18:46:30] [INFO ] Flow matrix only has 365 transitions (discarded 7 similar events)
[2024-06-02 18:46:30] [INFO ] Invariant cache hit.
[2024-06-02 18:46:30] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-02 18:46:30] [INFO ] Flow matrix only has 365 transitions (discarded 7 similar events)
[2024-06-02 18:46:30] [INFO ] Invariant cache hit.
[2024-06-02 18:46:31] [INFO ] State equation strengthened by 69 read => feed constraints.
[2024-06-02 18:46:31] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
[2024-06-02 18:46:31] [INFO ] Redundant transitions in 1 ms returned []
Running 368 sub problems to find dead transitions.
[2024-06-02 18:46:31] [INFO ] Flow matrix only has 365 transitions (discarded 7 similar events)
[2024-06-02 18:46:31] [INFO ] Invariant cache hit.
[2024-06-02 18:46:31] [INFO ] State equation strengthened by 69 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-06-02 18:46:33] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 1 ms to minimize.
[2024-06-02 18:46:33] [INFO ] Deduced a trap composed of 42 places in 32 ms of which 0 ms to minimize.
[2024-06-02 18:46:33] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 1 ms to minimize.
[2024-06-02 18:46:33] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 1 ms to minimize.
[2024-06-02 18:46:33] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 1 ms to minimize.
[2024-06-02 18:46:33] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:46:34] [INFO ] Deduced a trap composed of 83 places in 96 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 368 unsolved
[2024-06-02 18:46:35] [INFO ] Deduced a trap composed of 94 places in 79 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (OVERLAPS) 365/493 variables, 128/143 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/493 variables, 69/212 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/493 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 8 (OVERLAPS) 0/493 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 368 unsolved
No progress, stopping.
After SMT solving in domain Real declared 493/493 variables, and 212 constraints, problems are : Problem set: 0 solved, 368 unsolved in 12991 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 128/128 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (OVERLAPS) 365/493 variables, 128/143 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/493 variables, 69/212 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/493 variables, 368/580 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/493 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 8 (OVERLAPS) 0/493 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 368 unsolved
No progress, stopping.
After SMT solving in domain Int declared 493/493 variables, and 580 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 128/128 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 8/8 constraints]
After SMT, in 43277ms problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 43282ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43615 ms. Remains : 128/128 places, 372/372 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 84 edges and 128 vertex of which 20 / 128 are part of one of the 3 SCC in 1 ms
Free SCC test removed 17 places
Drop transitions (Empty/Sink Transition effects.) removed 99 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 117 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 109 transition count 253
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 109 transition count 253
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 15 place count 109 transition count 243
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 1 with 2 rules applied. Total rules applied 17 place count 108 transition count 242
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 1 with 21 rules applied. Total rules applied 38 place count 108 transition count 221
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 4 rules applied. Total rules applied 42 place count 108 transition count 217
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 48 place count 104 transition count 215
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 48 place count 104 transition count 213
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 52 place count 102 transition count 213
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 54 place count 101 transition count 212
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 place count 101 transition count 211
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 57 place count 100 transition count 210
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 58 place count 99 transition count 182
Iterating global reduction 3 with 1 rules applied. Total rules applied 59 place count 99 transition count 182
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 61 place count 99 transition count 180
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 63 place count 97 transition count 180
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 67 place count 97 transition count 176
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 69 place count 97 transition count 174
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 71 place count 95 transition count 174
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 75 place count 95 transition count 174
Applied a total of 75 rules in 28 ms. Remains 95 /128 variables (removed 33) and now considering 174/372 (removed 198) transitions.
Running SMT prover for 1 properties.
[2024-06-02 18:47:14] [INFO ] Flow matrix only has 172 transitions (discarded 2 similar events)
// Phase 1: matrix 172 rows 95 cols
[2024-06-02 18:47:14] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 18:47:14] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 18:47:14] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 18:47:14] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 18:47:14] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 18:47:14] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-02 18:47:14] [INFO ] After 18ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 18:47:14] [INFO ] After 30ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 18:47:14] [INFO ] After 139ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 255 ms.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 62 edges and 135 vertex of which 20 / 135 are part of one of the 3 SCC in 0 ms
Free SCC test removed 17 places
Drop transitions (Empty/Sink Transition effects.) removed 99 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 117 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 116 transition count 260
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 116 transition count 260
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 15 place count 116 transition count 250
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 1 with 2 rules applied. Total rules applied 17 place count 115 transition count 249
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 1 with 15 rules applied. Total rules applied 32 place count 115 transition count 234
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 4 rules applied. Total rules applied 36 place count 115 transition count 230
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 42 place count 111 transition count 228
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 42 place count 111 transition count 226
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 46 place count 109 transition count 226
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 48 place count 108 transition count 225
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 49 place count 108 transition count 224
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 3 with 2 rules applied. Total rules applied 51 place count 107 transition count 223
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 53 place count 107 transition count 221
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 55 place count 105 transition count 221
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 59 place count 105 transition count 217
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 61 place count 105 transition count 215
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 63 place count 103 transition count 215
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 64 place count 103 transition count 215
Applied a total of 64 rules in 20 ms. Remains 103 /135 variables (removed 32) and now considering 215/379 (removed 164) transitions.
Running SMT prover for 32 properties.
[2024-06-02 18:47:14] [INFO ] Flow matrix only has 213 transitions (discarded 2 similar events)
// Phase 1: matrix 213 rows 103 cols
[2024-06-02 18:47:14] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 18:47:14] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 18:47:15] [INFO ] After 481ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:32
[2024-06-02 18:47:15] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 18:47:15] [INFO ] After 308ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :32
[2024-06-02 18:47:15] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-02 18:47:16] [INFO ] After 267ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :32
TRAPS : Iteration 0
[2024-06-02 18:47:16] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-06-02 18:47:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2024-06-02 18:47:16] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-06-02 18:47:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
TRAPS : Iteration 1
[2024-06-02 18:47:16] [INFO ] After 1169ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :32
[2024-06-02 18:47:17] [INFO ] After 1884ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :32
Over-approximation ignoring read arcs solved 0 properties in 2403 ms.
Unable to solve all queries for examination QuasiLiveness. Remains :32 assertions to prove.
No /home/mcc/execution/QuasiLiveness.xml examination file found. Proceeding without properties.
Parsed 32 properties from file /home/mcc/execution/QuasiLiveness.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 1631875 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FireWire-PT-18

IS_COLORED=
IS_NUPN=1

LOADING model.pnml ...
MODEL CLASS: P/T NET WITH NUPN EXTENSION
PLACES: 437
TRANSITIONS: 707
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 2170
NUPN UNITS: 17
LOADING TIME: 0.708

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.093
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING NUPN UNITS AS FILE /home/mcc/execution/model.nu ...
TOTAL TIME: 1.165
OK.
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 2247
MODEL NAME: /home/mcc/execution/model
437 places, 707 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA QuasiLiveness TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717354070603

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -timeout 180 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FireWire-PT-18"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is FireWire-PT-18, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r560-tall-171734905900192"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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