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-171734905800167.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-13, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r560-tall-171734905800167
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 6.0K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K 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 12K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K 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 153K 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 1717351951142

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-13
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 18:12:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-06-02 18:12:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:12:32] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2024-06-02 18:12:32] [INFO ] Transformed 205 places.
[2024-06-02 18:12:32] [INFO ] Transformed 610 transitions.
[2024-06-02 18:12:32] [INFO ] Found NUPN structural information;
[2024-06-02 18:12:32] [INFO ] Parsed PT model containing 205 places and 610 transitions and 2309 arcs in 182 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 205/205 places, 610/610 transitions.
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 0 with 68 rules applied. Total rules applied 68 place count 205 transition count 542
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 68 place count 205 transition count 539
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 74 place count 202 transition count 539
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 80 place count 199 transition count 536
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 86 place count 196 transition count 542
Applied a total of 86 rules in 65 ms. Remains 196 /205 variables (removed 9) and now considering 542/610 (removed 68) transitions.
[2024-06-02 18:12:32] [INFO ] Flow matrix only has 494 transitions (discarded 48 similar events)
// Phase 1: matrix 494 rows 196 cols
[2024-06-02 18:12:32] [INFO ] Computed 10 invariants in 35 ms
[2024-06-02 18:12:32] [INFO ] Implicit Places using invariants in 322 ms returned []
[2024-06-02 18:12:32] [INFO ] Flow matrix only has 494 transitions (discarded 48 similar events)
[2024-06-02 18:12:32] [INFO ] Invariant cache hit.
[2024-06-02 18:12:33] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-02 18:12:33] [INFO ] Implicit Places using invariants and state equation in 601 ms returned [19, 80, 141]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 955 ms to find 3 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 193/205 places, 542/610 transitions.
Applied a total of 0 rules in 6 ms. Remains 193 /193 variables (removed 0) and now considering 542/542 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 1045 ms. Remains : 193/205 places, 542/610 transitions.
Discarding 159 transitions out of 542. Remains 383
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (1270 resets) in 2271 ms. (17 steps per ms) remains 169/382 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 169/169 properties
BEST_FIRST walk for 401 steps (8 resets) in 9 ms. (40 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 31 ms. (12 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 169/169 properties
BEST_FIRST walk for 403 steps (8 resets) in 15 ms. (25 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 169/169 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 18 ms. (21 steps per ms) remains 169/169 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 169/169 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 169/169 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 169/169 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 169/169 properties
BEST_FIRST walk for 401 steps (8 resets) in 9 ms. (40 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 169/169 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 169/169 properties
BEST_FIRST walk for 403 steps (8 resets) in 4 ms. (80 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 169/169 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 169/169 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 169/169 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 169/169 properties
BEST_FIRST walk for 403 steps (8 resets) in 4 ms. (80 steps per ms) remains 169/169 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 169/169 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 169/169 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 169/169 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 169/169 properties
BEST_FIRST walk for 402 steps (8 resets) in 4 ms. (80 steps per ms) remains 169/169 properties
BEST_FIRST walk for 403 steps (8 resets) in 4 ms. (80 steps per ms) remains 169/169 properties
BEST_FIRST walk for 403 steps (8 resets) in 4 ms. (80 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 169/169 properties
BEST_FIRST walk for 403 steps (8 resets) in 4 ms. (80 steps per ms) remains 169/169 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 169/169 properties
BEST_FIRST walk for 403 steps (8 resets) in 4 ms. (80 steps per ms) remains 169/169 properties
BEST_FIRST walk for 403 steps (8 resets) in 4 ms. (80 steps per ms) remains 169/169 properties
[2024-06-02 18:12:34] [INFO ] Flow matrix only has 494 transitions (discarded 48 similar events)
// Phase 1: matrix 494 rows 193 cols
[2024-06-02 18:12:34] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 18:12:34] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 117/117 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (OVERLAPS) 76/193 variables, 7/124 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 76/200 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-06-02 18:12:36] [INFO ] Deduced a trap composed of 35 places in 104 ms of which 12 ms to minimize.
[2024-06-02 18:12:36] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 1 ms to minimize.
[2024-06-02 18:12:36] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-06-02 18:12:36] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 2 ms to minimize.
[2024-06-02 18:12:37] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 5/205 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (OVERLAPS) 493/686 variables, 193/398 constraints. Problems are: Problem set: 0 solved, 169 unsolved
SMT process timed out in 5365ms, After SMT, problems are : Problem set: 0 solved, 169 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 117 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 542/542 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 193 transition count 533
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 1 with 9 rules applied. Total rules applied 18 place count 193 transition count 524
Applied a total of 18 rules in 43 ms. Remains 193 /193 variables (removed 0) and now considering 524/542 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 193/193 places, 524/542 transitions.
RANDOM walk for 4000000 steps (124395 resets) in 45858 ms. (87 steps per ms) remains 112/169 properties
BEST_FIRST walk for 40003 steps (293 resets) in 97 ms. (408 steps per ms) remains 112/112 properties
BEST_FIRST walk for 40002 steps (25 resets) in 126 ms. (314 steps per ms) remains 112/112 properties
BEST_FIRST walk for 40002 steps (267 resets) in 124 ms. (320 steps per ms) remains 112/112 properties
BEST_FIRST walk for 40004 steps (385 resets) in 114 ms. (347 steps per ms) remains 112/112 properties
BEST_FIRST walk for 40003 steps (271 resets) in 129 ms. (307 steps per ms) remains 112/112 properties
BEST_FIRST walk for 40001 steps (29 resets) in 174 ms. (228 steps per ms) remains 112/112 properties
BEST_FIRST walk for 40003 steps (279 resets) in 93 ms. (425 steps per ms) remains 112/112 properties
BEST_FIRST walk for 40002 steps (382 resets) in 92 ms. (430 steps per ms) remains 112/112 properties
BEST_FIRST walk for 40003 steps (269 resets) in 97 ms. (408 steps per ms) remains 112/112 properties
BEST_FIRST walk for 40003 steps (52 resets) in 148 ms. (268 steps per ms) remains 112/112 properties
BEST_FIRST walk for 40002 steps (264 resets) in 117 ms. (339 steps per ms) remains 112/112 properties
BEST_FIRST walk for 40003 steps (382 resets) in 120 ms. (330 steps per ms) remains 112/112 properties
BEST_FIRST walk for 40001 steps (270 resets) in 111 ms. (357 steps per ms) remains 112/112 properties
BEST_FIRST walk for 40001 steps (43 resets) in 121 ms. (327 steps per ms) remains 112/112 properties
BEST_FIRST walk for 40002 steps (263 resets) in 121 ms. (327 steps per ms) remains 112/112 properties
BEST_FIRST walk for 40004 steps (389 resets) in 115 ms. (344 steps per ms) remains 112/112 properties
BEST_FIRST walk for 40003 steps (267 resets) in 103 ms. (384 steps per ms) remains 112/112 properties
BEST_FIRST walk for 40003 steps (51 resets) in 129 ms. (307 steps per ms) remains 112/112 properties
BEST_FIRST walk for 40004 steps (274 resets) in 111 ms. (357 steps per ms) remains 112/112 properties
BEST_FIRST walk for 40002 steps (382 resets) in 95 ms. (416 steps per ms) remains 112/112 properties
BEST_FIRST walk for 40003 steps (262 resets) in 94 ms. (421 steps per ms) remains 112/112 properties
BEST_FIRST walk for 40002 steps (27 resets) in 221 ms. (180 steps per ms) remains 112/112 properties
BEST_FIRST walk for 40003 steps (266 resets) in 120 ms. (330 steps per ms) remains 108/112 properties
BEST_FIRST walk for 40003 steps (386 resets) in 91 ms. (434 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (272 resets) in 109 ms. (363 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (36 resets) in 111 ms. (357 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (280 resets) in 119 ms. (333 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (398 resets) in 117 ms. (339 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (266 resets) in 96 ms. (412 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (42 resets) in 161 ms. (246 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (276 resets) in 142 ms. (279 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (299 resets) in 124 ms. (320 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (263 resets) in 93 ms. (425 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (255 resets) in 112 ms. (354 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (298 resets) in 114 ms. (347 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (258 resets) in 113 ms. (350 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (287 resets) in 120 ms. (330 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (46 resets) in 117 ms. (339 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (278 resets) in 127 ms. (312 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (391 resets) in 92 ms. (430 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (267 resets) in 115 ms. (344 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (46 resets) in 110 ms. (360 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (271 resets) in 92 ms. (430 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (392 resets) in 106 ms. (373 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (288 resets) in 105 ms. (377 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (23 resets) in 179 ms. (222 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (260 resets) in 91 ms. (434 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (384 resets) in 89 ms. (444 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (262 resets) in 90 ms. (439 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40001 steps (36 resets) in 127 ms. (312 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (255 resets) in 149 ms. (266 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (378 resets) in 91 ms. (434 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (282 resets) in 93 ms. (425 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (42 resets) in 152 ms. (261 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (272 resets) in 121 ms. (327 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (384 resets) in 121 ms. (327 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (275 resets) in 117 ms. (339 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (45 resets) in 96 ms. (412 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (271 resets) in 94 ms. (421 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (375 resets) in 115 ms. (344 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (275 resets) in 99 ms. (400 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (47 resets) in 110 ms. (360 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (268 resets) in 95 ms. (416 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (367 resets) in 115 ms. (344 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (294 resets) in 125 ms. (317 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (44 resets) in 110 ms. (360 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (277 resets) in 122 ms. (325 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (277 resets) in 116 ms. (341 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (266 resets) in 119 ms. (333 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (269 resets) in 101 ms. (392 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (264 resets) in 122 ms. (325 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (37 resets) in 95 ms. (416 steps per ms) remains 108/108 properties
[2024-06-02 18:12:56] [INFO ] Flow matrix only has 490 transitions (discarded 34 similar events)
// Phase 1: matrix 490 rows 193 cols
[2024-06-02 18:12:56] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 18:12:56] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 115/187 variables, 6/78 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 115/193 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-06-02 18:12:57] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2024-06-02 18:12:57] [INFO ] Deduced a trap composed of 35 places in 31 ms of which 0 ms to minimize.
[2024-06-02 18:12:57] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 2 ms to minimize.
[2024-06-02 18:12:58] [INFO ] Deduced a trap composed of 66 places in 84 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 4/197 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 3/190 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-06-02 18:12:59] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 10 (OVERLAPS) 490/680 variables, 190/392 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/680 variables, 74/466 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/680 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 13 (OVERLAPS) 3/683 variables, 3/469 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/683 variables, 3/472 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/683 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 16 (OVERLAPS) 0/683 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 683/683 variables, and 472 constraints, problems are : Problem set: 0 solved, 108 unsolved in 12491 ms.
Refiners :[Domain max(s): 193/193 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 193/193 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 115/187 variables, 6/78 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 115/193 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 4/197 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 3/190 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 10 (OVERLAPS) 490/680 variables, 190/392 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/680 variables, 74/466 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/680 variables, 108/574 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-06-02 18:13:12] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 0 ms to minimize.
[2024-06-02 18:13:13] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/680 variables, 2/576 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/680 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 15 (OVERLAPS) 3/683 variables, 3/579 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/683 variables, 3/582 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-06-02 18:13:31] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 1 ms to minimize.
[2024-06-02 18:13:33] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 1 ms to minimize.
[2024-06-02 18:13:33] [INFO ] Deduced a trap composed of 46 places in 37 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/683 variables, 3/585 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/683 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 19 (OVERLAPS) 0/683 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 683/683 variables, and 585 constraints, problems are : Problem set: 0 solved, 108 unsolved in 42965 ms.
Refiners :[Domain max(s): 193/193 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 193/193 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 10/10 constraints]
After SMT, in 55596ms problems are : Problem set: 0 solved, 108 unsolved
Parikh walk visited 0 properties in 11315 ms.
Support contains 72 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 524/524 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 190 transition count 518
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 190 transition count 518
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 9 place count 190 transition count 515
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 189 transition count 514
Applied a total of 10 rules in 37 ms. Remains 189 /193 variables (removed 4) and now considering 514/524 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 189/193 places, 514/524 transitions.
RANDOM walk for 4000000 steps (127824 resets) in 31690 ms. (126 steps per ms) remains 104/108 properties
BEST_FIRST walk for 40004 steps (290 resets) in 76 ms. (519 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (44 resets) in 93 ms. (425 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (259 resets) in 92 ms. (430 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (390 resets) in 74 ms. (533 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (277 resets) in 76 ms. (519 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (46 resets) in 77 ms. (512 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (286 resets) in 77 ms. (512 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (376 resets) in 76 ms. (519 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (284 resets) in 76 ms. (519 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (45 resets) in 86 ms. (459 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (257 resets) in 88 ms. (449 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (379 resets) in 82 ms. (481 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (281 resets) in 77 ms. (512 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (47 resets) in 75 ms. (526 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (253 resets) in 78 ms. (506 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (394 resets) in 73 ms. (540 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (277 resets) in 79 ms. (500 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (46 resets) in 86 ms. (459 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (267 resets) in 87 ms. (454 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (382 resets) in 76 ms. (519 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (278 resets) in 82 ms. (481 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (39 resets) in 106 ms. (373 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (254 resets) in 103 ms. (384 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (381 resets) in 75 ms. (526 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (276 resets) in 75 ms. (526 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (50 resets) in 78 ms. (506 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (277 resets) in 77 ms. (512 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (268 resets) in 80 ms. (493 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (263 resets) in 77 ms. (512 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40002 steps (279 resets) in 74 ms. (533 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40002 steps (248 resets) in 85 ms. (465 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (250 resets) in 77 ms. (512 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (280 resets) in 79 ms. (500 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (275 resets) in 79 ms. (500 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40002 steps (275 resets) in 74 ms. (533 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (43 resets) in 75 ms. (526 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (251 resets) in 77 ms. (512 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40002 steps (381 resets) in 79 ms. (500 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (290 resets) in 78 ms. (506 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (29 resets) in 85 ms. (465 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (266 resets) in 80 ms. (493 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40002 steps (403 resets) in 78 ms. (506 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (276 resets) in 78 ms. (506 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (44 resets) in 122 ms. (325 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (261 resets) in 74 ms. (533 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40002 steps (374 resets) in 77 ms. (512 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (279 resets) in 75 ms. (526 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (50 resets) in 102 ms. (388 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (246 resets) in 77 ms. (512 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (391 resets) in 76 ms. (519 steps per ms) remains 104/104 properties
Interrupted probabilistic random walk after 4037615 steps, run timeout after 30001 ms. (steps per millisecond=134 ) properties seen :24 out of 104
Probabilistic random walk after 4037615 steps, saw 867838 distinct states, run finished after 30009 ms. (steps per millisecond=134 ) properties seen :24
[2024-06-02 18:14:44] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
// Phase 1: matrix 480 rows 189 cols
[2024-06-02 18:14:44] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 18:14:44] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 127/183 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-02 18:14:45] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-06-02 18:14:45] [INFO ] Deduced a trap composed of 33 places in 25 ms of which 1 ms to minimize.
[2024-06-02 18:14:45] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 1 ms to minimize.
[2024-06-02 18:14:45] [INFO ] Deduced a trap composed of 76 places in 77 ms of which 1 ms to minimize.
[2024-06-02 18:14:45] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 1 ms to minimize.
[2024-06-02 18:14:45] [INFO ] Deduced a trap composed of 69 places in 89 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 479/662 variables, 183/195 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/662 variables, 71/266 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/662 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (OVERLAPS) 7/669 variables, 6/272 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/669 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-02 18:14:48] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 1 ms to minimize.
[2024-06-02 18:14:48] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/669 variables, 2/275 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-02 18:14:49] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/669 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/669 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 12 (OVERLAPS) 0/669 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 669/669 variables, and 276 constraints, problems are : Problem set: 0 solved, 80 unsolved in 8686 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 127/183 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 479/662 variables, 183/198 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/662 variables, 71/269 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/662 variables, 79/348 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-02 18:14:55] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/662 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/662 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (OVERLAPS) 7/669 variables, 6/355 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/669 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/669 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/669 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 13 (OVERLAPS) 0/669 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 669/669 variables, and 357 constraints, problems are : Problem set: 0 solved, 80 unsolved in 12368 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 10/10 constraints]
After SMT, in 21168ms problems are : Problem set: 0 solved, 80 unsolved
Parikh walk visited 0 properties in 6120 ms.
Support contains 56 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 514/514 transitions.
Applied a total of 0 rules in 13 ms. Remains 189 /189 variables (removed 0) and now considering 514/514 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 189/189 places, 514/514 transitions.
RANDOM walk for 4000000 steps (128417 resets) in 34800 ms. (114 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400003 steps (2789 resets) in 674 ms. (592 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400001 steps (138 resets) in 1391 ms. (287 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400003 steps (2613 resets) in 648 ms. (616 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400002 steps (3840 resets) in 636 ms. (627 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (2801 resets) in 639 ms. (625 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400002 steps (107 resets) in 1347 ms. (296 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400003 steps (2668 resets) in 654 ms. (610 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (3903 resets) in 636 ms. (627 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400003 steps (2830 resets) in 641 ms. (623 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400003 steps (78 resets) in 1404 ms. (284 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (2760 resets) in 662 ms. (603 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400003 steps (3881 resets) in 622 ms. (642 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400003 steps (2796 resets) in 643 ms. (621 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400003 steps (91 resets) in 1463 ms. (273 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (2724 resets) in 657 ms. (607 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400002 steps (3904 resets) in 627 ms. (636 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400003 steps (2711 resets) in 638 ms. (625 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400003 steps (111 resets) in 1358 ms. (294 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (2671 resets) in 673 ms. (593 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400003 steps (3802 resets) in 631 ms. (632 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400003 steps (2798 resets) in 640 ms. (624 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400002 steps (256 resets) in 1178 ms. (339 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (2630 resets) in 656 ms. (608 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400003 steps (3833 resets) in 629 ms. (634 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (2683 resets) in 644 ms. (620 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400002 steps (3882 resets) in 629 ms. (634 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (2776 resets) in 656 ms. (608 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400000 steps (220 resets) in 1318 ms. (303 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400002 steps (2617 resets) in 649 ms. (615 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (3884 resets) in 634 ms. (629 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400003 steps (2756 resets) in 651 ms. (613 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400002 steps (161 resets) in 1488 ms. (268 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400003 steps (2619 resets) in 661 ms. (604 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (3851 resets) in 636 ms. (627 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (2771 resets) in 653 ms. (611 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400002 steps (58 resets) in 1440 ms. (277 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (2673 resets) in 652 ms. (612 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (3869 resets) in 636 ms. (627 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400003 steps (2757 resets) in 646 ms. (618 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400002 steps (141 resets) in 1443 ms. (277 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400002 steps (2710 resets) in 643 ms. (621 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (3866 resets) in 623 ms. (641 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400003 steps (2753 resets) in 636 ms. (627 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400002 steps (89 resets) in 1450 ms. (275 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (2647 resets) in 670 ms. (596 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400002 steps (3881 resets) in 641 ms. (623 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (2776 resets) in 654 ms. (610 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (187 resets) in 1456 ms. (274 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (2688 resets) in 666 ms. (599 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400003 steps (3835 resets) in 634 ms. (629 steps per ms) remains 80/80 properties
Interrupted probabilistic random walk after 9431494 steps, run timeout after 69001 ms. (steps per millisecond=136 ) properties seen :0 out of 80
Probabilistic random walk after 9431494 steps, saw 2045986 distinct states, run finished after 69003 ms. (steps per millisecond=136 ) properties seen :0
[2024-06-02 18:16:44] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
[2024-06-02 18:16:44] [INFO ] Invariant cache hit.
[2024-06-02 18:16:44] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 127/183 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-02 18:16:44] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 0 ms to minimize.
[2024-06-02 18:16:44] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 1 ms to minimize.
[2024-06-02 18:16:44] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 2 ms to minimize.
[2024-06-02 18:16:45] [INFO ] Deduced a trap composed of 69 places in 95 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 479/662 variables, 183/193 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/662 variables, 71/264 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/662 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (OVERLAPS) 7/669 variables, 6/270 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/669 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-02 18:16:47] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 1 ms to minimize.
[2024-06-02 18:16:48] [INFO ] Deduced a trap composed of 45 places in 37 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/669 variables, 2/273 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-02 18:16:49] [INFO ] Deduced a trap composed of 45 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/669 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/669 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-02 18:16:50] [INFO ] Deduced a trap composed of 41 places in 33 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/669 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/669 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 14 (OVERLAPS) 0/669 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 669/669 variables, and 275 constraints, problems are : Problem set: 0 solved, 80 unsolved in 9840 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 127/183 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 479/662 variables, 183/196 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/662 variables, 71/267 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/662 variables, 79/346 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/662 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 7/669 variables, 6/352 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/669 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/669 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/669 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-02 18:17:01] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-06-02 18:17:01] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/669 variables, 2/357 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-02 18:17:03] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/669 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/669 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 15 (OVERLAPS) 0/669 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 669/669 variables, and 358 constraints, problems are : Problem set: 0 solved, 80 unsolved in 16012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 11/11 constraints]
After SMT, in 25941ms problems are : Problem set: 0 solved, 80 unsolved
Parikh walk visited 0 properties in 11657 ms.
Support contains 56 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 514/514 transitions.
Applied a total of 0 rules in 12 ms. Remains 189 /189 variables (removed 0) and now considering 514/514 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 189/189 places, 514/514 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 514/514 transitions.
Applied a total of 0 rules in 15 ms. Remains 189 /189 variables (removed 0) and now considering 514/514 (removed 0) transitions.
[2024-06-02 18:17:21] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
[2024-06-02 18:17:21] [INFO ] Invariant cache hit.
[2024-06-02 18:17:21] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-02 18:17:21] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
[2024-06-02 18:17:21] [INFO ] Invariant cache hit.
[2024-06-02 18:17:21] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-06-02 18:17:22] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
[2024-06-02 18:17:22] [INFO ] Redundant transitions in 31 ms returned []
Running 508 sub problems to find dead transitions.
[2024-06-02 18:17:22] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
[2024-06-02 18:17:22] [INFO ] Invariant cache hit.
[2024-06-02 18:17:22] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 508 unsolved
[2024-06-02 18:17:24] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 0 ms to minimize.
[2024-06-02 18:17:24] [INFO ] Deduced a trap composed of 33 places in 28 ms of which 0 ms to minimize.
[2024-06-02 18:17:24] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
[2024-06-02 18:17:24] [INFO ] Deduced a trap composed of 71 places in 92 ms of which 2 ms to minimize.
[2024-06-02 18:17:24] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 1 ms to minimize.
[2024-06-02 18:17:25] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 1 ms to minimize.
[2024-06-02 18:17:25] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 1 ms to minimize.
[2024-06-02 18:17:26] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 1 ms to minimize.
[2024-06-02 18:17:27] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 3 (OVERLAPS) 480/669 variables, 189/205 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/669 variables, 71/276 constraints. Problems are: Problem set: 0 solved, 508 unsolved
[2024-06-02 18:17:37] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 0 ms to minimize.
[2024-06-02 18:17:37] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/669 variables, 2/278 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/669 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 7 (OVERLAPS) 0/669 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 508 unsolved
No progress, stopping.
After SMT solving in domain Real declared 669/669 variables, and 278 constraints, problems are : Problem set: 0 solved, 508 unsolved in 29538 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 508/508 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 508 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 3 (OVERLAPS) 480/669 variables, 189/207 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/669 variables, 71/278 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/669 variables, 508/786 constraints. Problems are: Problem set: 0 solved, 508 unsolved
[2024-06-02 18:17:59] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 1 ms to minimize.
[2024-06-02 18:17:59] [INFO ] Deduced a trap composed of 41 places in 35 ms of which 0 ms to minimize.
[2024-06-02 18:17:59] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/669 variables, 3/789 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/669 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 508 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 669/669 variables, and 789 constraints, problems are : Problem set: 0 solved, 508 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 508/508 constraints, Known Traps: 14/14 constraints]
After SMT, in 60123ms problems are : Problem set: 0 solved, 508 unsolved
Search for dead transitions found 0 dead transitions in 60132ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60548 ms. Remains : 189/189 places, 514/514 transitions.
RANDOM walk for 400000 steps (12907 resets) in 3450 ms. (115 steps per ms) remains 44/56 properties
Running SMT prover for 44 properties.
[2024-06-02 18:18:23] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
[2024-06-02 18:18:23] [INFO ] Invariant cache hit.
[2024-06-02 18:18:23] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 18:18:23] [INFO ] After 142ms SMT Verify possible using state equation in real domain returned unsat :0 sat :44
[2024-06-02 18:18:23] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-06-02 18:18:23] [INFO ] After 80ms SMT Verify possible using 71 Read/Feed constraints in real domain returned unsat :0 sat :44
TRAPS : Iteration 0
[2024-06-02 18:18:24] [INFO ] After 1163ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:44
[2024-06-02 18:18:24] [INFO ] After 1385ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:44
[2024-06-02 18:18:24] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 18:18:24] [INFO ] After 147ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :44
[2024-06-02 18:18:25] [INFO ] After 116ms SMT Verify possible using 71 Read/Feed constraints in natural domain returned unsat :0 sat :44
TRAPS : Iteration 0
[2024-06-02 18:18:25] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 2 ms to minimize.
[2024-06-02 18:18:25] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-06-02 18:18:25] [INFO ] Deduced a trap composed of 41 places in 33 ms of which 1 ms to minimize.
[2024-06-02 18:18:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 199 ms
[2024-06-02 18:18:26] [INFO ] Deduced a trap composed of 41 places in 34 ms of which 1 ms to minimize.
[2024-06-02 18:18:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
TRAPS : Iteration 1
[2024-06-02 18:18:26] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 0 ms to minimize.
[2024-06-02 18:18:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2024-06-02 18:18:26] [INFO ] Deduced a trap composed of 54 places in 90 ms of which 2 ms to minimize.
[2024-06-02 18:18:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2024-06-02 18:18:26] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 1 ms to minimize.
[2024-06-02 18:18:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
TRAPS : Iteration 2
[2024-06-02 18:18:27] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 2 ms to minimize.
[2024-06-02 18:18:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
TRAPS : Iteration 3
[2024-06-02 18:18:29] [INFO ] After 4615ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :44
[2024-06-02 18:18:29] [INFO ] After 4912ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :44
RANDOM walk for 4000000 steps (128598 resets) in 27202 ms. (147 steps per ms) remains 76/80 properties
BEST_FIRST walk for 400003 steps (2820 resets) in 635 ms. (628 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400002 steps (67 resets) in 1669 ms. (239 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400002 steps (2650 resets) in 958 ms. (417 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400001 steps (3879 resets) in 931 ms. (429 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400003 steps (2737 resets) in 943 ms. (423 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400001 steps (67 resets) in 2093 ms. (191 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400003 steps (2648 resets) in 1079 ms. (370 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400002 steps (3874 resets) in 901 ms. (443 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400003 steps (2794 resets) in 951 ms. (420 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400001 steps (255 resets) in 1434 ms. (278 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400003 steps (2686 resets) in 942 ms. (424 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400003 steps (3893 resets) in 852 ms. (468 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400003 steps (2867 resets) in 899 ms. (444 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400001 steps (152 resets) in 1528 ms. (261 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400002 steps (2676 resets) in 904 ms. (441 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400004 steps (3864 resets) in 971 ms. (411 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400003 steps (2815 resets) in 979 ms. (408 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400000 steps (236 resets) in 1619 ms. (246 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400003 steps (2768 resets) in 931 ms. (429 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400004 steps (2792 resets) in 929 ms. (430 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400002 steps (2671 resets) in 1076 ms. (371 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400004 steps (2678 resets) in 934 ms. (427 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400003 steps (3849 resets) in 873 ms. (457 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400001 steps (2790 resets) in 878 ms. (455 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400001 steps (87 resets) in 1623 ms. (246 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400002 steps (2731 resets) in 1199 ms. (333 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400003 steps (3839 resets) in 1205 ms. (331 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400004 steps (2816 resets) in 1165 ms. (343 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400003 steps (160 resets) in 2253 ms. (177 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400002 steps (2690 resets) in 1167 ms. (342 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400004 steps (3854 resets) in 1077 ms. (371 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400003 steps (2813 resets) in 931 ms. (429 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400002 steps (114 resets) in 2181 ms. (183 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400003 steps (2633 resets) in 1057 ms. (378 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400003 steps (3869 resets) in 1039 ms. (384 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400003 steps (2764 resets) in 1189 ms. (336 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400002 steps (159 resets) in 2432 ms. (164 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400004 steps (2640 resets) in 1183 ms. (337 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400003 steps (3866 resets) in 1146 ms. (348 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400002 steps (2780 resets) in 1014 ms. (394 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400002 steps (197 resets) in 2017 ms. (198 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400003 steps (2676 resets) in 1196 ms. (334 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400004 steps (3841 resets) in 1250 ms. (319 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400002 steps (2816 resets) in 1329 ms. (300 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400004 steps (135 resets) in 2296 ms. (174 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400003 steps (2649 resets) in 976 ms. (409 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400003 steps (3872 resets) in 1290 ms. (309 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400003 steps (2787 resets) in 1241 ms. (322 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400001 steps (207 resets) in 1807 ms. (221 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400003 steps (2630 resets) in 1163 ms. (343 steps per ms) remains 76/76 properties
Interrupted probabilistic random walk after 12568301 steps, run timeout after 93001 ms. (steps per millisecond=135 ) properties seen :0 out of 76
Probabilistic random walk after 12568301 steps, saw 2747313 distinct states, run finished after 93001 ms. (steps per millisecond=135 ) properties seen :0
[2024-06-02 18:20:34] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
[2024-06-02 18:20:34] [INFO ] Invariant cache hit.
[2024-06-02 18:20:34] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 128/182 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-06-02 18:20:34] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-06-02 18:20:34] [INFO ] Deduced a trap composed of 33 places in 27 ms of which 1 ms to minimize.
[2024-06-02 18:20:34] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 1 ms to minimize.
[2024-06-02 18:20:35] [INFO ] Deduced a trap composed of 69 places in 80 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-06-02 18:20:35] [INFO ] Deduced a trap composed of 76 places in 91 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 478/660 variables, 182/193 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/660 variables, 71/264 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/660 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 9/669 variables, 7/271 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/669 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-06-02 18:20:39] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 2 ms to minimize.
[2024-06-02 18:20:39] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/669 variables, 2/274 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/669 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 12 (OVERLAPS) 0/669 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 669/669 variables, and 274 constraints, problems are : Problem set: 0 solved, 76 unsolved in 7799 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 128/182 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 478/660 variables, 182/194 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/660 variables, 71/265 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/660 variables, 74/339 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-06-02 18:20:43] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/660 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/660 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 9/669 variables, 7/347 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/669 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/669 variables, 2/350 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/669 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-06-02 18:20:50] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/669 variables, 1/352 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-06-02 18:20:52] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
[2024-06-02 18:20:52] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/669 variables, 2/354 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/669 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 16 (OVERLAPS) 0/669 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 669/669 variables, and 354 constraints, problems are : Problem set: 0 solved, 76 unsolved in 18413 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 11/11 constraints]
After SMT, in 26296ms problems are : Problem set: 0 solved, 76 unsolved
Parikh walk visited 0 properties in 5177 ms.
Support contains 54 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 514/514 transitions.
Applied a total of 0 rules in 19 ms. Remains 189 /189 variables (removed 0) and now considering 514/514 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 189/189 places, 514/514 transitions.
RANDOM walk for 4000000 steps (128070 resets) in 45741 ms. (87 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400004 steps (2699 resets) in 1093 ms. (365 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400002 steps (120 resets) in 1925 ms. (207 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400003 steps (2637 resets) in 1156 ms. (345 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400001 steps (3871 resets) in 1070 ms. (373 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400002 steps (2765 resets) in 1178 ms. (339 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400001 steps (149 resets) in 1884 ms. (212 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400003 steps (2661 resets) in 1015 ms. (393 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400002 steps (3846 resets) in 1203 ms. (332 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400004 steps (2808 resets) in 1121 ms. (356 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400001 steps (66 resets) in 2497 ms. (160 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400003 steps (2694 resets) in 1019 ms. (392 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400003 steps (3874 resets) in 1132 ms. (353 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400002 steps (2823 resets) in 931 ms. (429 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400001 steps (46 resets) in 2036 ms. (196 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400004 steps (2695 resets) in 1013 ms. (394 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400004 steps (3849 resets) in 1063 ms. (375 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400003 steps (2720 resets) in 1066 ms. (374 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400003 steps (214 resets) in 1743 ms. (229 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400003 steps (2732 resets) in 1097 ms. (364 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400004 steps (2819 resets) in 1027 ms. (389 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400004 steps (2694 resets) in 1083 ms. (369 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400003 steps (2667 resets) in 1036 ms. (385 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400003 steps (3830 resets) in 1102 ms. (362 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400003 steps (2759 resets) in 1403 ms. (284 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400002 steps (247 resets) in 1739 ms. (229 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400003 steps (2658 resets) in 1106 ms. (361 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400004 steps (3853 resets) in 1088 ms. (367 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400004 steps (2756 resets) in 1008 ms. (396 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400003 steps (80 resets) in 1936 ms. (206 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400004 steps (2604 resets) in 1059 ms. (377 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400001 steps (3890 resets) in 945 ms. (422 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400003 steps (2791 resets) in 997 ms. (400 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400002 steps (103 resets) in 2171 ms. (184 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400003 steps (2696 resets) in 971 ms. (411 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400003 steps (3875 resets) in 936 ms. (426 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400004 steps (2772 resets) in 1044 ms. (382 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400002 steps (212 resets) in 1802 ms. (221 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400004 steps (2697 resets) in 1117 ms. (357 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400004 steps (3922 resets) in 1002 ms. (398 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400004 steps (2778 resets) in 915 ms. (436 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400001 steps (156 resets) in 1566 ms. (255 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400003 steps (2698 resets) in 987 ms. (404 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400002 steps (3832 resets) in 1139 ms. (350 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400002 steps (2797 resets) in 1179 ms. (338 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400001 steps (179 resets) in 1573 ms. (254 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400004 steps (2739 resets) in 1021 ms. (391 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400003 steps (3898 resets) in 970 ms. (411 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400003 steps (2794 resets) in 1117 ms. (357 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400002 steps (222 resets) in 1896 ms. (210 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400003 steps (2717 resets) in 993 ms. (402 steps per ms) remains 76/76 properties
Interrupted probabilistic random walk after 14616797 steps, run timeout after 108001 ms. (steps per millisecond=135 ) properties seen :0 out of 76
Probabilistic random walk after 14616797 steps, saw 3209475 distinct states, run finished after 108001 ms. (steps per millisecond=135 ) properties seen :0
[2024-06-02 18:23:30] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
[2024-06-02 18:23:30] [INFO ] Invariant cache hit.
[2024-06-02 18:23:30] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 128/182 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-06-02 18:23:30] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-06-02 18:23:30] [INFO ] Deduced a trap composed of 33 places in 26 ms of which 1 ms to minimize.
[2024-06-02 18:23:31] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 1 ms to minimize.
[2024-06-02 18:23:31] [INFO ] Deduced a trap composed of 69 places in 82 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-06-02 18:23:31] [INFO ] Deduced a trap composed of 76 places in 82 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 478/660 variables, 182/193 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/660 variables, 71/264 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/660 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 9/669 variables, 7/271 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/669 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-06-02 18:23:35] [INFO ] Deduced a trap composed of 45 places in 34 ms of which 0 ms to minimize.
[2024-06-02 18:23:35] [INFO ] Deduced a trap composed of 45 places in 33 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/669 variables, 2/274 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/669 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 12 (OVERLAPS) 0/669 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 669/669 variables, and 274 constraints, problems are : Problem set: 0 solved, 76 unsolved in 7515 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 128/182 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 478/660 variables, 182/194 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/660 variables, 71/265 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/660 variables, 74/339 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-06-02 18:23:39] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/660 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/660 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 9/669 variables, 7/347 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/669 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/669 variables, 2/350 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/669 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-06-02 18:23:45] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/669 variables, 1/352 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/669 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-06-02 18:23:50] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 8 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/669 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/669 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 17 (OVERLAPS) 0/669 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 669/669 variables, and 353 constraints, problems are : Problem set: 0 solved, 76 unsolved in 17780 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 10/10 constraints]
After SMT, in 25377ms problems are : Problem set: 0 solved, 76 unsolved
Parikh walk visited 1 properties in 18506 ms.
Support contains 52 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 514/514 transitions.
Applied a total of 0 rules in 16 ms. Remains 189 /189 variables (removed 0) and now considering 514/514 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 189/189 places, 514/514 transitions.
RANDOM walk for 4000000 steps (128105 resets) in 45048 ms. (88 steps per ms) remains 74/75 properties
BEST_FIRST walk for 400002 steps (2832 resets) in 1241 ms. (322 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400002 steps (68 resets) in 1849 ms. (216 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (2653 resets) in 1233 ms. (324 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400003 steps (3880 resets) in 972 ms. (411 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (2784 resets) in 909 ms. (439 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400002 steps (125 resets) in 1835 ms. (217 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (2635 resets) in 1062 ms. (376 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400003 steps (3843 resets) in 889 ms. (449 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400003 steps (2794 resets) in 1008 ms. (396 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400002 steps (119 resets) in 2104 ms. (190 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (2611 resets) in 1002 ms. (398 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (3888 resets) in 1058 ms. (377 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400003 steps (2817 resets) in 1127 ms. (354 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400001 steps (81 resets) in 1975 ms. (202 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400002 steps (2650 resets) in 988 ms. (404 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (3815 resets) in 943 ms. (423 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (2815 resets) in 1119 ms. (357 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400003 steps (52 resets) in 2218 ms. (180 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400003 steps (2714 resets) in 977 ms. (409 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400003 steps (2712 resets) in 1075 ms. (371 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400003 steps (2667 resets) in 1090 ms. (366 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (2698 resets) in 1134 ms. (352 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400003 steps (3867 resets) in 994 ms. (402 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (2782 resets) in 925 ms. (431 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400001 steps (121 resets) in 2208 ms. (181 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (2714 resets) in 1122 ms. (356 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (3882 resets) in 1094 ms. (365 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400003 steps (2798 resets) in 1096 ms. (364 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400002 steps (104 resets) in 2168 ms. (184 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400002 steps (2682 resets) in 1041 ms. (383 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400003 steps (3859 resets) in 938 ms. (425 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400003 steps (2801 resets) in 1199 ms. (333 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400002 steps (78 resets) in 2254 ms. (177 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400003 steps (2735 resets) in 1051 ms. (380 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400003 steps (3879 resets) in 999 ms. (400 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400002 steps (2771 resets) in 1117 ms. (357 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400001 steps (181 resets) in 2302 ms. (173 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (2622 resets) in 940 ms. (425 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (3855 resets) in 1036 ms. (385 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (2768 resets) in 1152 ms. (346 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400001 steps (171 resets) in 1870 ms. (213 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (2626 resets) in 1139 ms. (350 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400002 steps (3867 resets) in 943 ms. (423 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (2760 resets) in 1021 ms. (391 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400002 steps (141 resets) in 1937 ms. (206 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400003 steps (2636 resets) in 944 ms. (423 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (3848 resets) in 977 ms. (409 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400003 steps (2822 resets) in 927 ms. (431 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400001 steps (171 resets) in 1765 ms. (226 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400002 steps (2712 resets) in 937 ms. (426 steps per ms) remains 74/74 properties
Interrupted probabilistic random walk after 15302920 steps, run timeout after 105001 ms. (steps per millisecond=145 ) properties seen :0 out of 74
Probabilistic random walk after 15302920 steps, saw 3365237 distinct states, run finished after 105001 ms. (steps per millisecond=145 ) properties seen :0
[2024-06-02 18:26:34] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
[2024-06-02 18:26:34] [INFO ] Invariant cache hit.
[2024-06-02 18:26:34] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 126/176 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-06-02 18:26:35] [INFO ] Deduced a trap composed of 65 places in 85 ms of which 1 ms to minimize.
[2024-06-02 18:26:35] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
[2024-06-02 18:26:35] [INFO ] Deduced a trap composed of 76 places in 80 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (OVERLAPS) 475/651 variables, 176/183 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/651 variables, 71/254 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/651 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (OVERLAPS) 17/668 variables, 12/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/668 variables, 3/269 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/668 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 1/669 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/669 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 12 (OVERLAPS) 0/669 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 669/669 variables, and 270 constraints, problems are : Problem set: 0 solved, 74 unsolved in 7763 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 126/176 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (OVERLAPS) 475/651 variables, 176/183 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/651 variables, 71/254 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/651 variables, 72/326 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/651 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (OVERLAPS) 17/668 variables, 12/338 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/668 variables, 3/341 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/668 variables, 2/343 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-06-02 18:26:49] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/668 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-06-02 18:26:51] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/668 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-06-02 18:26:53] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/668 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-06-02 18:26:55] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 1 ms to minimize.
[2024-06-02 18:26:55] [INFO ] Deduced a trap composed of 41 places in 35 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/668 variables, 2/348 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/668 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 16 (OVERLAPS) 1/669 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/669 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 18 (OVERLAPS) 0/669 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 669/669 variables, and 349 constraints, problems are : Problem set: 0 solved, 74 unsolved in 24898 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 8/8 constraints]
After SMT, in 32737ms problems are : Problem set: 0 solved, 74 unsolved
Parikh walk visited 0 properties in 5055 ms.
Support contains 50 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 514/514 transitions.
Applied a total of 0 rules in 8 ms. Remains 189 /189 variables (removed 0) and now considering 514/514 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 189/189 places, 514/514 transitions.
RANDOM walk for 4000000 steps (128497 resets) in 43452 ms. (92 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400003 steps (2833 resets) in 1056 ms. (378 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400002 steps (302 resets) in 1619 ms. (246 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (2689 resets) in 1088 ms. (367 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (3882 resets) in 1196 ms. (334 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (2810 resets) in 1182 ms. (338 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400002 steps (86 resets) in 2103 ms. (190 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400003 steps (2643 resets) in 1006 ms. (397 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400003 steps (3904 resets) in 1080 ms. (370 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400002 steps (2769 resets) in 923 ms. (432 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400002 steps (87 resets) in 2149 ms. (186 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (2694 resets) in 1047 ms. (381 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (3897 resets) in 962 ms. (415 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (2776 resets) in 1111 ms. (359 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400003 steps (126 resets) in 2066 ms. (193 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400003 steps (2692 resets) in 1074 ms. (372 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400003 steps (3862 resets) in 949 ms. (421 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400003 steps (2761 resets) in 904 ms. (441 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400002 steps (142 resets) in 1982 ms. (201 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (2688 resets) in 918 ms. (435 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400002 steps (2798 resets) in 1042 ms. (383 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (2696 resets) in 1086 ms. (367 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (2732 resets) in 952 ms. (419 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400002 steps (3843 resets) in 944 ms. (423 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (2814 resets) in 1037 ms. (385 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400002 steps (282 resets) in 1818 ms. (219 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400002 steps (2683 resets) in 1070 ms. (373 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (3814 resets) in 1101 ms. (362 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (2846 resets) in 1136 ms. (351 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400000 steps (175 resets) in 2037 ms. (196 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (2627 resets) in 1001 ms. (399 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400001 steps (3877 resets) in 1028 ms. (388 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (2808 resets) in 1161 ms. (344 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400001 steps (189 resets) in 1674 ms. (238 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400001 steps (2668 resets) in 1030 ms. (387 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (3896 resets) in 1085 ms. (368 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400003 steps (2756 resets) in 936 ms. (426 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400002 steps (42 resets) in 2423 ms. (165 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400002 steps (2656 resets) in 1112 ms. (359 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400001 steps (3871 resets) in 1017 ms. (392 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400003 steps (2807 resets) in 1095 ms. (364 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400002 steps (228 resets) in 1638 ms. (244 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400003 steps (2670 resets) in 1177 ms. (339 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (3865 resets) in 979 ms. (408 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400001 steps (2812 resets) in 1086 ms. (367 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400003 steps (129 resets) in 2076 ms. (192 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (2685 resets) in 1121 ms. (356 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400003 steps (3874 resets) in 911 ms. (438 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (2719 resets) in 1027 ms. (389 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400002 steps (81 resets) in 2453 ms. (163 steps per ms) remains 74/74 properties
BEST_FIRST walk for 400004 steps (2723 resets) in 1303 ms. (306 steps per ms) remains 74/74 properties
Interrupted probabilistic random walk after 14977180 steps, run timeout after 105001 ms. (steps per millisecond=142 ) properties seen :0 out of 74
Probabilistic random walk after 14977180 steps, saw 3288181 distinct states, run finished after 105001 ms. (steps per millisecond=142 ) properties seen :0
[2024-06-02 18:29:33] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
[2024-06-02 18:29:33] [INFO ] Invariant cache hit.
[2024-06-02 18:29:33] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 126/176 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-06-02 18:29:34] [INFO ] Deduced a trap composed of 65 places in 86 ms of which 2 ms to minimize.
[2024-06-02 18:29:34] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 2 ms to minimize.
[2024-06-02 18:29:34] [INFO ] Deduced a trap composed of 76 places in 84 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (OVERLAPS) 475/651 variables, 176/183 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/651 variables, 71/254 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/651 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (OVERLAPS) 17/668 variables, 12/266 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/668 variables, 3/269 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/668 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 1/669 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/669 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 12 (OVERLAPS) 0/669 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 669/669 variables, and 270 constraints, problems are : Problem set: 0 solved, 74 unsolved in 7311 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 126/176 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (OVERLAPS) 475/651 variables, 176/183 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/651 variables, 71/254 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/651 variables, 72/326 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/651 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (OVERLAPS) 17/668 variables, 12/338 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/668 variables, 3/341 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/668 variables, 2/343 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-06-02 18:29:47] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/668 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-06-02 18:29:49] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/668 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-06-02 18:29:51] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/668 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-06-02 18:29:53] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
[2024-06-02 18:29:53] [INFO ] Deduced a trap composed of 41 places in 33 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/668 variables, 2/348 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/668 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 16 (OVERLAPS) 1/669 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/669 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 18 (OVERLAPS) 0/669 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 669/669 variables, and 349 constraints, problems are : Problem set: 0 solved, 74 unsolved in 24265 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 8/8 constraints]
After SMT, in 31666ms problems are : Problem set: 0 solved, 74 unsolved
Parikh walk visited 0 properties in 5006 ms.
Support contains 50 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 514/514 transitions.
Applied a total of 0 rules in 9 ms. Remains 189 /189 variables (removed 0) and now considering 514/514 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 189/189 places, 514/514 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 514/514 transitions.
Applied a total of 0 rules in 7 ms. Remains 189 /189 variables (removed 0) and now considering 514/514 (removed 0) transitions.
[2024-06-02 18:30:10] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
[2024-06-02 18:30:10] [INFO ] Invariant cache hit.
[2024-06-02 18:30:10] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-06-02 18:30:10] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
[2024-06-02 18:30:10] [INFO ] Invariant cache hit.
[2024-06-02 18:30:10] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-06-02 18:30:10] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
[2024-06-02 18:30:10] [INFO ] Redundant transitions in 10 ms returned []
Running 508 sub problems to find dead transitions.
[2024-06-02 18:30:10] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
[2024-06-02 18:30:10] [INFO ] Invariant cache hit.
[2024-06-02 18:30:10] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 508 unsolved
[2024-06-02 18:30:12] [INFO ] Deduced a trap composed of 33 places in 27 ms of which 1 ms to minimize.
[2024-06-02 18:30:12] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 1 ms to minimize.
[2024-06-02 18:30:12] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 0 ms to minimize.
[2024-06-02 18:30:13] [INFO ] Deduced a trap composed of 71 places in 91 ms of which 2 ms to minimize.
[2024-06-02 18:30:13] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 1 ms to minimize.
[2024-06-02 18:30:13] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 1 ms to minimize.
[2024-06-02 18:30:13] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 2 ms to minimize.
[2024-06-02 18:30:14] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2024-06-02 18:30:15] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 3 (OVERLAPS) 480/669 variables, 189/205 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/669 variables, 71/276 constraints. Problems are: Problem set: 0 solved, 508 unsolved
[2024-06-02 18:30:26] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 1 ms to minimize.
[2024-06-02 18:30:26] [INFO ] Deduced a trap composed of 45 places in 38 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/669 variables, 2/278 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/669 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 7 (OVERLAPS) 0/669 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 508 unsolved
No progress, stopping.
After SMT solving in domain Real declared 669/669 variables, and 278 constraints, problems are : Problem set: 0 solved, 508 unsolved in 29536 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 508/508 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 508 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 3 (OVERLAPS) 480/669 variables, 189/207 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/669 variables, 71/278 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/669 variables, 508/786 constraints. Problems are: Problem set: 0 solved, 508 unsolved
[2024-06-02 18:30:47] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 1 ms to minimize.
[2024-06-02 18:30:48] [INFO ] Deduced a trap composed of 41 places in 31 ms of which 0 ms to minimize.
[2024-06-02 18:30:48] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/669 variables, 3/789 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/669 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 508 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 669/669 variables, and 789 constraints, problems are : Problem set: 0 solved, 508 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 508/508 constraints, Known Traps: 14/14 constraints]
After SMT, in 60033ms problems are : Problem set: 0 solved, 508 unsolved
Search for dead transitions found 0 dead transitions in 60038ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60396 ms. Remains : 189/189 places, 514/514 transitions.
RANDOM walk for 400000 steps (12976 resets) in 3135 ms. (127 steps per ms) remains 41/50 properties
Running SMT prover for 41 properties.
[2024-06-02 18:31:11] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
[2024-06-02 18:31:11] [INFO ] Invariant cache hit.
[2024-06-02 18:31:11] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 18:31:11] [INFO ] After 122ms SMT Verify possible using state equation in real domain returned unsat :0 sat :41
[2024-06-02 18:31:11] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-06-02 18:31:12] [INFO ] After 90ms SMT Verify possible using 71 Read/Feed constraints in real domain returned unsat :0 sat :41
TRAPS : Iteration 0
[2024-06-02 18:31:12] [INFO ] After 1047ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:41
[2024-06-02 18:31:12] [INFO ] After 1233ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:41
[2024-06-02 18:31:13] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 18:31:13] [INFO ] After 115ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :41
[2024-06-02 18:31:13] [INFO ] After 88ms SMT Verify possible using 71 Read/Feed constraints in natural domain returned unsat :0 sat :41
TRAPS : Iteration 0
[2024-06-02 18:31:13] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 1 ms to minimize.
[2024-06-02 18:31:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2024-06-02 18:31:13] [INFO ] Deduced a trap composed of 54 places in 88 ms of which 2 ms to minimize.
[2024-06-02 18:31:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
TRAPS : Iteration 1
[2024-06-02 18:31:15] [INFO ] After 2045ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :41
[2024-06-02 18:31:15] [INFO ] After 2294ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :41
RANDOM walk for 32 steps (0 resets) in 7 ms. (4 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (1259 resets) in 247 ms. (161 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (281 resets) in 83 ms. (476 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1346223 steps, run timeout after 3001 ms. (steps per millisecond=448 ) properties seen :0 out of 1
Probabilistic random walk after 1346223 steps, saw 320400 distinct states, run finished after 3001 ms. (steps per millisecond=448 ) properties seen :0
[2024-06-02 18:31:18] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
[2024-06-02 18:31:18] [INFO ] Invariant cache hit.
[2024-06-02 18:31:18] [INFO ] State equation strengthened by 71 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) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 237/443 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/444 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/444 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/444 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 205/649 variables, 107/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/649 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/649 variables, 48/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/649 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 18/667 variables, 10/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/667 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/667 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/669 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/669 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/669 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 669/669 variables, and 267 constraints, problems are : Problem set: 0 solved, 1 unsolved in 204 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 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) 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) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 237/443 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/443 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/444 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/444 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/444 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 205/649 variables, 107/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/649 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/649 variables, 48/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/649 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/667 variables, 10/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/667 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/667 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/669 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/669 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/669 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 669/669 variables, and 268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 216 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 439ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 5686 steps, including 892 resets, run visited all 1 properties in 10 ms. (steps per millisecond=568 )
Parikh walk visited 1 properties in 13 ms.
RANDOM walk for 140 steps (3 resets) in 6 ms. (20 steps per ms) remains 0/1 properties
RANDOM walk for 1006 steps (31 resets) in 7 ms. (125 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (1260 resets) in 154 ms. (258 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (269 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1306469 steps, run timeout after 3001 ms. (steps per millisecond=435 ) properties seen :0 out of 1
Probabilistic random walk after 1306469 steps, saw 313985 distinct states, run finished after 3001 ms. (steps per millisecond=435 ) properties seen :0
[2024-06-02 18:31:21] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
[2024-06-02 18:31:21] [INFO ] Invariant cache hit.
[2024-06-02 18:31:21] [INFO ] State equation strengthened by 71 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) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 237/443 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/444 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/444 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/444 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 205/649 variables, 107/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/649 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/649 variables, 48/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/649 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 18/667 variables, 10/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/667 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/667 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/669 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/669 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/669 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 669/669 variables, and 267 constraints, problems are : Problem set: 0 solved, 1 unsolved in 208 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 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) 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) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 237/443 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/443 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/444 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/444 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/444 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 205/649 variables, 107/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/649 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/649 variables, 48/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/649 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/667 variables, 10/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/667 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/667 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/669 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/669 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/669 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 669/669 variables, and 268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 204 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 419ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 18 ms.
Support contains 1 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 514/514 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 186 transition count 508
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 186 transition count 508
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 183 transition count 499
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 183 transition count 499
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 181 transition count 495
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 181 transition count 495
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 179 transition count 489
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 179 transition count 489
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 177 transition count 485
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 177 transition count 485
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 175 transition count 479
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 175 transition count 479
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 173 transition count 475
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 173 transition count 475
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 171 transition count 469
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 171 transition count 469
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 169 transition count 465
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 169 transition count 465
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 167 transition count 459
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 167 transition count 459
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 165 transition count 455
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 165 transition count 455
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 163 transition count 451
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 163 transition count 451
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 161 transition count 447
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 161 transition count 447
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 59 place count 161 transition count 453
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 68 place count 158 transition count 447
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 74 place count 158 transition count 441
Applied a total of 74 rules in 76 ms. Remains 158 /189 variables (removed 31) and now considering 441/514 (removed 73) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 158/189 places, 441/514 transitions.
RANDOM walk for 40000 steps (1279 resets) in 189 ms. (210 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (264 resets) in 76 ms. (519 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1389990 steps, run timeout after 3001 ms. (steps per millisecond=463 ) properties seen :0 out of 1
Probabilistic random walk after 1389990 steps, saw 337091 distinct states, run finished after 3001 ms. (steps per millisecond=463 ) properties seen :0
[2024-06-02 18:31:25] [INFO ] Flow matrix only has 404 transitions (discarded 37 similar events)
// Phase 1: matrix 404 rows 158 cols
[2024-06-02 18:31:25] [INFO ] Computed 7 invariants in 9 ms
[2024-06-02 18:31:25] [INFO ] State equation strengthened by 60 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) 145/195 variables, 50/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 187/382 variables, 16/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/382 variables, 22/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/382 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/383 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/383 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/383 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 159/542 variables, 79/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/542 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/542 variables, 38/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/542 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 18/560 variables, 10/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/560 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/560 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/562 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/562 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/562 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 562/562 variables, and 225 constraints, problems are : Problem set: 0 solved, 1 unsolved in 206 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, ReadFeed: 60/60 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) 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) 145/195 variables, 50/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 187/382 variables, 16/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/382 variables, 22/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/382 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/382 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/383 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/383 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/383 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 159/542 variables, 79/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/542 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/542 variables, 38/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/542 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/560 variables, 10/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/560 variables, 2/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/560 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/562 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/562 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/562 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 562/562 variables, and 226 constraints, problems are : Problem set: 0 solved, 1 unsolved in 191 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 411ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 441/441 transitions.
Applied a total of 0 rules in 9 ms. Remains 158 /158 variables (removed 0) and now considering 441/441 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 158/158 places, 441/441 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 441/441 transitions.
Applied a total of 0 rules in 8 ms. Remains 158 /158 variables (removed 0) and now considering 441/441 (removed 0) transitions.
[2024-06-02 18:31:25] [INFO ] Flow matrix only has 404 transitions (discarded 37 similar events)
[2024-06-02 18:31:25] [INFO ] Invariant cache hit.
[2024-06-02 18:31:26] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-02 18:31:26] [INFO ] Flow matrix only has 404 transitions (discarded 37 similar events)
[2024-06-02 18:31:26] [INFO ] Invariant cache hit.
[2024-06-02 18:31:26] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 18:31:26] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
[2024-06-02 18:31:26] [INFO ] Redundant transitions in 3 ms returned []
Running 435 sub problems to find dead transitions.
[2024-06-02 18:31:26] [INFO ] Flow matrix only has 404 transitions (discarded 37 similar events)
[2024-06-02 18:31:26] [INFO ] Invariant cache hit.
[2024-06-02 18:31:26] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 435 unsolved
[2024-06-02 18:31:28] [INFO ] Deduced a trap composed of 56 places in 84 ms of which 2 ms to minimize.
[2024-06-02 18:31:28] [INFO ] Deduced a trap composed of 57 places in 74 ms of which 1 ms to minimize.
[2024-06-02 18:31:28] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2024-06-02 18:31:28] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 2 ms to minimize.
[2024-06-02 18:31:28] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 1 ms to minimize.
[2024-06-02 18:31:29] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2024-06-02 18:31:29] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
[2024-06-02 18:31:29] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 1 ms to minimize.
[2024-06-02 18:31:29] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 1 ms to minimize.
[2024-06-02 18:31:30] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2024-06-02 18:31:30] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 3 (OVERLAPS) 404/562 variables, 158/176 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/562 variables, 60/236 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 435 unsolved
[2024-06-02 18:31:41] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-06-02 18:31:41] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 0 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/562 variables, 2/238 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/562 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 8 (OVERLAPS) 0/562 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 435 unsolved
No progress, stopping.
After SMT solving in domain Real declared 562/562 variables, and 238 constraints, problems are : Problem set: 0 solved, 435 unsolved in 24560 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 435/435 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 435 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 3 (OVERLAPS) 404/562 variables, 158/178 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/562 variables, 60/238 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 435/673 constraints. Problems are: Problem set: 0 solved, 435 unsolved
[2024-06-02 18:31:57] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 0 ms to minimize.
[2024-06-02 18:32:02] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 2/675 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/562 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 435 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 562/562 variables, and 675 constraints, problems are : Problem set: 0 solved, 435 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 435/435 constraints, Known Traps: 15/15 constraints]
After SMT, in 54963ms problems are : Problem set: 0 solved, 435 unsolved
Search for dead transitions found 0 dead transitions in 54969ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55333 ms. Remains : 158/158 places, 441/441 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 142 edges and 158 vertex of which 29 / 158 are part of one of the 4 SCC in 3 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 132 transition count 296
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 132 transition count 287
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 131 transition count 286
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 131 transition count 285
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 130 transition count 284
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 129 transition count 240
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 129 transition count 240
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 28 place count 129 transition count 225
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 40 place count 120 transition count 222
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 120 transition count 222
Applied a total of 46 rules in 55 ms. Remains 120 /158 variables (removed 38) and now considering 222/441 (removed 219) transitions.
Running SMT prover for 1 properties.
[2024-06-02 18:32:21] [INFO ] Flow matrix only has 220 transitions (discarded 2 similar events)
// Phase 1: matrix 220 rows 120 cols
[2024-06-02 18:32:21] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 18:32:21] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 18:32:21] [INFO ] After 46ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 18:32:21] [INFO ] Deduced a trap composed of 29 places in 24 ms of which 1 ms to minimize.
TRAPS : Iteration 1
[2024-06-02 18:32:21] [INFO ] After 97ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 18:32:21] [INFO ] After 141ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 18:32:21] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 18:32:21] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 18:32:21] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 0 ms to minimize.
[2024-06-02 18:32:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
TRAPS : Iteration 1
[2024-06-02 18:32:21] [INFO ] After 101ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 18:32:21] [INFO ] After 138ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 341 ms.
RANDOM walk for 31 steps (0 resets) in 4 ms. (6 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (1298 resets) in 98 ms. (404 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (286 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1305235 steps, run timeout after 3001 ms. (steps per millisecond=434 ) properties seen :0 out of 1
Probabilistic random walk after 1305235 steps, saw 313674 distinct states, run finished after 3001 ms. (steps per millisecond=434 ) properties seen :0
[2024-06-02 18:32:24] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
// Phase 1: matrix 480 rows 189 cols
[2024-06-02 18:32:24] [INFO ] Computed 7 invariants in 8 ms
[2024-06-02 18:32:24] [INFO ] State equation strengthened by 71 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) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 237/443 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/444 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/444 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/444 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 205/649 variables, 107/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/649 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/649 variables, 48/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/649 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 18/667 variables, 10/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/667 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/667 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/669 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/669 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/669 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 669/669 variables, and 267 constraints, problems are : Problem set: 0 solved, 1 unsolved in 210 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 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) 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) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 237/443 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/443 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/444 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/444 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/444 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 205/649 variables, 107/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/649 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/649 variables, 48/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/649 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/667 variables, 10/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/667 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/667 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/669 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/669 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/669 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 669/669 variables, and 268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 229 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 464ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 514/514 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 186 transition count 508
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 186 transition count 508
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 183 transition count 499
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 183 transition count 499
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 180 transition count 493
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 180 transition count 493
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 178 transition count 487
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 178 transition count 487
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 176 transition count 483
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 176 transition count 483
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 174 transition count 477
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 174 transition count 477
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 172 transition count 473
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 172 transition count 473
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 170 transition count 467
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 170 transition count 467
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 168 transition count 463
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 168 transition count 463
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 166 transition count 457
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 166 transition count 457
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 164 transition count 453
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 164 transition count 453
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 162 transition count 449
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 162 transition count 449
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 160 transition count 445
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 160 transition count 445
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 61 place count 160 transition count 451
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 70 place count 157 transition count 445
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 76 place count 157 transition count 439
Applied a total of 76 rules in 61 ms. Remains 157 /189 variables (removed 32) and now considering 439/514 (removed 75) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 157/189 places, 439/514 transitions.
RANDOM walk for 40000 steps (1264 resets) in 127 ms. (312 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (277 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1357882 steps, run timeout after 3001 ms. (steps per millisecond=452 ) properties seen :0 out of 1
Probabilistic random walk after 1357882 steps, saw 329960 distinct states, run finished after 3001 ms. (steps per millisecond=452 ) properties seen :0
[2024-06-02 18:32:28] [INFO ] Flow matrix only has 402 transitions (discarded 37 similar events)
// Phase 1: matrix 402 rows 157 cols
[2024-06-02 18:32:28] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 18:32:28] [INFO ] State equation strengthened by 60 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) 143/192 variables, 49/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 187/379 variables, 16/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/379 variables, 22/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/380 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/380 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/380 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 159/539 variables, 79/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/539 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/539 variables, 38/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/539 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 18/557 variables, 10/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/557 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/557 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/559 variables, 2/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/559 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/559 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 559/559 variables, and 224 constraints, problems are : Problem set: 0 solved, 1 unsolved in 169 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 157/157 constraints, ReadFeed: 60/60 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) 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) 143/192 variables, 49/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 187/379 variables, 16/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/379 variables, 22/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/379 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/380 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/380 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/380 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 159/539 variables, 79/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/539 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/539 variables, 38/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/539 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/557 variables, 10/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/557 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/557 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/559 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/559 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/559 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 559/559 variables, and 225 constraints, problems are : Problem set: 0 solved, 1 unsolved in 171 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 157/157 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 379ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 439/439 transitions.
Applied a total of 0 rules in 5 ms. Remains 157 /157 variables (removed 0) and now considering 439/439 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 157/157 places, 439/439 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 439/439 transitions.
Applied a total of 0 rules in 5 ms. Remains 157 /157 variables (removed 0) and now considering 439/439 (removed 0) transitions.
[2024-06-02 18:32:28] [INFO ] Flow matrix only has 402 transitions (discarded 37 similar events)
[2024-06-02 18:32:28] [INFO ] Invariant cache hit.
[2024-06-02 18:32:28] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-02 18:32:28] [INFO ] Flow matrix only has 402 transitions (discarded 37 similar events)
[2024-06-02 18:32:28] [INFO ] Invariant cache hit.
[2024-06-02 18:32:28] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 18:32:29] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
[2024-06-02 18:32:29] [INFO ] Redundant transitions in 3 ms returned []
Running 433 sub problems to find dead transitions.
[2024-06-02 18:32:29] [INFO ] Flow matrix only has 402 transitions (discarded 37 similar events)
[2024-06-02 18:32:29] [INFO ] Invariant cache hit.
[2024-06-02 18:32:29] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-06-02 18:32:30] [INFO ] Deduced a trap composed of 58 places in 78 ms of which 1 ms to minimize.
[2024-06-02 18:32:30] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-06-02 18:32:31] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2024-06-02 18:32:31] [INFO ] Deduced a trap composed of 32 places in 26 ms of which 0 ms to minimize.
[2024-06-02 18:32:31] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
[2024-06-02 18:32:31] [INFO ] Deduced a trap composed of 32 places in 29 ms of which 1 ms to minimize.
[2024-06-02 18:32:31] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
[2024-06-02 18:32:32] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 1 ms to minimize.
[2024-06-02 18:32:32] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-06-02 18:32:32] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-06-02 18:32:32] [INFO ] Deduced a trap composed of 51 places in 70 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 3 (OVERLAPS) 402/559 variables, 157/175 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/559 variables, 60/235 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-06-02 18:32:38] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/559 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-06-02 18:32:41] [INFO ] Deduced a trap composed of 57 places in 77 ms of which 1 ms to minimize.
[2024-06-02 18:32:44] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 0 ms to minimize.
[2024-06-02 18:32:44] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/559 variables, 3/239 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/559 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 8 (OVERLAPS) 0/559 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 433 unsolved
No progress, stopping.
After SMT solving in domain Real declared 559/559 variables, and 239 constraints, problems are : Problem set: 0 solved, 433 unsolved in 26924 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 157/157 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 433/433 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 433 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 3 (OVERLAPS) 402/559 variables, 157/179 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/559 variables, 60/239 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/559 variables, 433/672 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/559 variables, 0/672 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 7 (OVERLAPS) 0/559 variables, 0/672 constraints. Problems are: Problem set: 0 solved, 433 unsolved
No progress, stopping.
After SMT solving in domain Int declared 559/559 variables, and 672 constraints, problems are : Problem set: 0 solved, 433 unsolved in 30005 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 157/157 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 433/433 constraints, Known Traps: 15/15 constraints]
After SMT, in 57279ms problems are : Problem set: 0 solved, 433 unsolved
Search for dead transitions found 0 dead transitions in 57283ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57709 ms. Remains : 157/157 places, 439/439 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 142 edges and 157 vertex of which 29 / 157 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 131 transition count 294
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 131 transition count 285
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 130 transition count 284
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 130 transition count 283
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 129 transition count 282
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 128 transition count 238
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 128 transition count 238
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 28 place count 128 transition count 223
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 40 place count 119 transition count 220
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 119 transition count 220
Applied a total of 46 rules in 31 ms. Remains 119 /157 variables (removed 38) and now considering 220/439 (removed 219) transitions.
Running SMT prover for 1 properties.
[2024-06-02 18:33:26] [INFO ] Flow matrix only has 218 transitions (discarded 2 similar events)
// Phase 1: matrix 218 rows 119 cols
[2024-06-02 18:33:26] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 18:33:26] [INFO ] [Real]Absence check using 7 positive place invariants in 53 ms returned sat
[2024-06-02 18:33:26] [INFO ] After 81ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 18:33:26] [INFO ] After 95ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-06-02 18:33:26] [INFO ] After 333ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 370 ms.
RANDOM walk for 40000 steps (1301 resets) in 119 ms. (333 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (260 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1317156 steps, run timeout after 3001 ms. (steps per millisecond=438 ) properties seen :0 out of 1
Probabilistic random walk after 1317156 steps, saw 315894 distinct states, run finished after 3001 ms. (steps per millisecond=438 ) properties seen :0
[2024-06-02 18:33:29] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
// Phase 1: matrix 480 rows 189 cols
[2024-06-02 18:33:29] [INFO ] Computed 7 invariants in 12 ms
[2024-06-02 18:33:29] [INFO ] State equation strengthened by 71 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) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 237/443 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/444 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/444 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/444 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 205/649 variables, 107/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/649 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/649 variables, 48/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/649 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 18/667 variables, 10/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/667 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/667 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/669 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/669 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/669 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 669/669 variables, and 267 constraints, problems are : Problem set: 0 solved, 1 unsolved in 229 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 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) 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) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 237/443 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/443 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/444 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/444 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/444 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 205/649 variables, 107/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/649 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/649 variables, 48/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/649 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/667 variables, 10/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/667 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/667 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/669 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/669 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/669 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 669/669 variables, and 268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 215 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 473ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 514/514 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 186 transition count 508
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 186 transition count 508
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 183 transition count 499
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 183 transition count 499
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 180 transition count 493
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 180 transition count 493
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 177 transition count 484
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 177 transition count 484
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 175 transition count 480
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 175 transition count 480
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 173 transition count 474
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 173 transition count 474
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 171 transition count 470
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 171 transition count 470
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 169 transition count 464
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 169 transition count 464
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 167 transition count 460
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 167 transition count 460
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 165 transition count 454
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 165 transition count 454
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 163 transition count 450
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 163 transition count 450
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 161 transition count 446
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 161 transition count 446
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 159 transition count 442
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 159 transition count 442
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 63 place count 159 transition count 448
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 72 place count 156 transition count 442
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 78 place count 156 transition count 436
Applied a total of 78 rules in 41 ms. Remains 156 /189 variables (removed 33) and now considering 436/514 (removed 78) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 156/189 places, 436/514 transitions.
RANDOM walk for 40000 steps (1300 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (259 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1458175 steps, run timeout after 3001 ms. (steps per millisecond=485 ) properties seen :0 out of 1
Probabilistic random walk after 1458175 steps, saw 354470 distinct states, run finished after 3001 ms. (steps per millisecond=485 ) properties seen :0
[2024-06-02 18:33:33] [INFO ] Flow matrix only has 399 transitions (discarded 37 similar events)
// Phase 1: matrix 399 rows 156 cols
[2024-06-02 18:33:33] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 18:33:33] [INFO ] State equation strengthened by 59 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) 140/188 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 187/375 variables, 16/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 21/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/376 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/376 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 159/535 variables, 79/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/535 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/535 variables, 38/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/535 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 18/553 variables, 10/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/553 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/553 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/555 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/555 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/555 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 222 constraints, problems are : Problem set: 0 solved, 1 unsolved in 212 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, ReadFeed: 59/59 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) 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) 140/188 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 187/375 variables, 16/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 21/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/375 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/376 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/376 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/376 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 159/535 variables, 79/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/535 variables, 2/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/535 variables, 38/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/535 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/553 variables, 10/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/553 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/553 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/555 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/555 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/555 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 223 constraints, problems are : Problem set: 0 solved, 1 unsolved in 214 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 438ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 436/436 transitions.
Applied a total of 0 rules in 4 ms. Remains 156 /156 variables (removed 0) and now considering 436/436 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 156/156 places, 436/436 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 436/436 transitions.
Applied a total of 0 rules in 4 ms. Remains 156 /156 variables (removed 0) and now considering 436/436 (removed 0) transitions.
[2024-06-02 18:33:33] [INFO ] Flow matrix only has 399 transitions (discarded 37 similar events)
[2024-06-02 18:33:33] [INFO ] Invariant cache hit.
[2024-06-02 18:33:33] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-02 18:33:33] [INFO ] Flow matrix only has 399 transitions (discarded 37 similar events)
[2024-06-02 18:33:33] [INFO ] Invariant cache hit.
[2024-06-02 18:33:34] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-06-02 18:33:34] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
[2024-06-02 18:33:34] [INFO ] Redundant transitions in 2 ms returned []
Running 430 sub problems to find dead transitions.
[2024-06-02 18:33:34] [INFO ] Flow matrix only has 399 transitions (discarded 37 similar events)
[2024-06-02 18:33:34] [INFO ] Invariant cache hit.
[2024-06-02 18:33:34] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2024-06-02 18:33:35] [INFO ] Deduced a trap composed of 58 places in 72 ms of which 1 ms to minimize.
[2024-06-02 18:33:35] [INFO ] Deduced a trap composed of 59 places in 66 ms of which 1 ms to minimize.
[2024-06-02 18:33:36] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 2 ms to minimize.
[2024-06-02 18:33:36] [INFO ] Deduced a trap composed of 32 places in 28 ms of which 1 ms to minimize.
[2024-06-02 18:33:36] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
[2024-06-02 18:33:36] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2024-06-02 18:33:36] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
[2024-06-02 18:33:36] [INFO ] Deduced a trap composed of 32 places in 29 ms of which 1 ms to minimize.
[2024-06-02 18:33:37] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2024-06-02 18:33:37] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-06-02 18:33:37] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 1 ms to minimize.
[2024-06-02 18:33:38] [INFO ] Deduced a trap composed of 51 places in 74 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2024-06-02 18:33:38] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 4 (OVERLAPS) 399/555 variables, 156/176 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 59/235 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2024-06-02 18:33:43] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 1 ms to minimize.
[2024-06-02 18:33:43] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/555 variables, 2/237 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2024-06-02 18:33:51] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2024-06-02 18:33:51] [INFO ] Deduced a trap composed of 31 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 2/239 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 9 (OVERLAPS) 0/555 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 430 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 239 constraints, problems are : Problem set: 0 solved, 430 unsolved in 29211 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 430/430 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 430 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 3 (OVERLAPS) 399/555 variables, 156/180 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/555 variables, 59/239 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 430/669 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/555 variables, 0/669 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 7 (OVERLAPS) 0/555 variables, 0/669 constraints. Problems are: Problem set: 0 solved, 430 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 669 constraints, problems are : Problem set: 0 solved, 430 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 430/430 constraints, Known Traps: 17/17 constraints]
After SMT, in 59540ms problems are : Problem set: 0 solved, 430 unsolved
Search for dead transitions found 0 dead transitions in 59544ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59921 ms. Remains : 156/156 places, 436/436 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 141 edges and 156 vertex of which 29 / 156 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 130 transition count 291
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 130 transition count 282
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 129 transition count 281
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 129 transition count 280
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 128 transition count 279
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 127 transition count 236
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 127 transition count 236
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 28 place count 127 transition count 221
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 40 place count 118 transition count 218
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 118 transition count 218
Applied a total of 46 rules in 23 ms. Remains 118 /156 variables (removed 38) and now considering 218/436 (removed 218) transitions.
Running SMT prover for 1 properties.
[2024-06-02 18:34:33] [INFO ] Flow matrix only has 216 transitions (discarded 2 similar events)
// Phase 1: matrix 216 rows 118 cols
[2024-06-02 18:34:33] [INFO ] Computed 7 invariants in 0 ms
[2024-06-02 18:34:33] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 18:34:33] [INFO ] After 51ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 18:34:33] [INFO ] After 80ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 18:34:33] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 18:34:33] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 18:34:33] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 18:34:33] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 18:34:33] [INFO ] After 100ms 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 (1268 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (293 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1326433 steps, run timeout after 3001 ms. (steps per millisecond=441 ) properties seen :0 out of 1
Probabilistic random walk after 1326433 steps, saw 316881 distinct states, run finished after 3001 ms. (steps per millisecond=441 ) properties seen :0
[2024-06-02 18:34:37] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
// Phase 1: matrix 480 rows 189 cols
[2024-06-02 18:34:37] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 18:34:37] [INFO ] State equation strengthened by 71 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) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 237/443 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/444 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/444 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/444 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 205/649 variables, 107/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/649 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/649 variables, 48/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/649 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 18/667 variables, 10/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/667 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/667 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/669 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/669 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/669 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 669/669 variables, and 267 constraints, problems are : Problem set: 0 solved, 1 unsolved in 218 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 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) 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) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 237/443 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/443 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/444 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/444 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/444 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 205/649 variables, 107/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/649 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/649 variables, 48/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/649 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/667 variables, 10/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/667 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/667 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/669 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/669 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/669 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 669/669 variables, and 268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 246 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 480ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 514/514 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 186 transition count 508
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 186 transition count 508
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 183 transition count 499
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 183 transition count 499
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 180 transition count 493
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 180 transition count 493
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 177 transition count 484
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 177 transition count 484
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 174 transition count 478
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 174 transition count 478
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 172 transition count 472
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 172 transition count 472
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 170 transition count 468
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 170 transition count 468
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 168 transition count 462
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 168 transition count 462
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 166 transition count 458
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 166 transition count 458
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 164 transition count 452
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 164 transition count 452
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 162 transition count 448
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 162 transition count 448
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 160 transition count 444
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 160 transition count 444
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 158 transition count 440
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 158 transition count 440
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 65 place count 158 transition count 446
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 74 place count 155 transition count 440
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 80 place count 155 transition count 434
Applied a total of 80 rules in 36 ms. Remains 155 /189 variables (removed 34) and now considering 434/514 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 155/189 places, 434/514 transitions.
RANDOM walk for 40000 steps (1280 resets) in 84 ms. (470 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (254 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1452474 steps, run timeout after 3001 ms. (steps per millisecond=483 ) properties seen :0 out of 1
Probabilistic random walk after 1452474 steps, saw 353025 distinct states, run finished after 3002 ms. (steps per millisecond=483 ) properties seen :0
[2024-06-02 18:34:40] [INFO ] Flow matrix only has 397 transitions (discarded 37 similar events)
// Phase 1: matrix 397 rows 155 cols
[2024-06-02 18:34:40] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 18:34:40] [INFO ] State equation strengthened by 59 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) 138/185 variables, 47/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 187/372 variables, 16/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 21/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/373 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/373 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/373 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 159/532 variables, 79/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/532 variables, 2/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/532 variables, 38/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/532 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 18/550 variables, 10/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/550 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/550 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/552 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/552 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/552 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 552/552 variables, and 221 constraints, problems are : Problem set: 0 solved, 1 unsolved in 163 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, ReadFeed: 59/59 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) 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) 138/185 variables, 47/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 187/372 variables, 16/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 21/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/372 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/373 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/373 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/373 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 159/532 variables, 79/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/532 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/532 variables, 38/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/532 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/550 variables, 10/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/550 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/550 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/552 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/552 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/552 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 552/552 variables, and 222 constraints, problems are : Problem set: 0 solved, 1 unsolved in 196 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 376ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 434/434 transitions.
Applied a total of 0 rules in 7 ms. Remains 155 /155 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 155/155 places, 434/434 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 434/434 transitions.
Applied a total of 0 rules in 4 ms. Remains 155 /155 variables (removed 0) and now considering 434/434 (removed 0) transitions.
[2024-06-02 18:34:41] [INFO ] Flow matrix only has 397 transitions (discarded 37 similar events)
[2024-06-02 18:34:41] [INFO ] Invariant cache hit.
[2024-06-02 18:34:41] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-02 18:34:41] [INFO ] Flow matrix only has 397 transitions (discarded 37 similar events)
[2024-06-02 18:34:41] [INFO ] Invariant cache hit.
[2024-06-02 18:34:41] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-06-02 18:34:41] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
[2024-06-02 18:34:41] [INFO ] Redundant transitions in 2 ms returned []
Running 428 sub problems to find dead transitions.
[2024-06-02 18:34:41] [INFO ] Flow matrix only has 397 transitions (discarded 37 similar events)
[2024-06-02 18:34:41] [INFO ] Invariant cache hit.
[2024-06-02 18:34:41] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 428 unsolved
[2024-06-02 18:34:43] [INFO ] Deduced a trap composed of 59 places in 75 ms of which 1 ms to minimize.
[2024-06-02 18:34:43] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2024-06-02 18:34:43] [INFO ] Deduced a trap composed of 66 places in 72 ms of which 1 ms to minimize.
[2024-06-02 18:34:43] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-06-02 18:34:43] [INFO ] Deduced a trap composed of 32 places in 24 ms of which 1 ms to minimize.
[2024-06-02 18:34:43] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-06-02 18:34:44] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 1 ms to minimize.
[2024-06-02 18:34:44] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2024-06-02 18:34:44] [INFO ] Deduced a trap composed of 32 places in 26 ms of which 0 ms to minimize.
[2024-06-02 18:34:44] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-06-02 18:34:45] [INFO ] Deduced a trap composed of 62 places in 72 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 428 unsolved
[2024-06-02 18:34:45] [INFO ] Deduced a trap composed of 92 places in 74 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 428 unsolved
[2024-06-02 18:34:48] [INFO ] Deduced a trap composed of 51 places in 74 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 5 (OVERLAPS) 397/552 variables, 155/175 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/552 variables, 59/234 constraints. Problems are: Problem set: 0 solved, 428 unsolved
[2024-06-02 18:34:55] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
[2024-06-02 18:34:56] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 0 ms to minimize.
[2024-06-02 18:34:56] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/552 variables, 3/237 constraints. Problems are: Problem set: 0 solved, 428 unsolved
[2024-06-02 18:34:57] [INFO ] Deduced a trap composed of 55 places in 81 ms of which 2 ms to minimize.
[2024-06-02 18:34:57] [INFO ] Deduced a trap composed of 53 places in 80 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/552 variables, 2/239 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/552 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 10 (OVERLAPS) 0/552 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 428 unsolved
No progress, stopping.
After SMT solving in domain Real declared 552/552 variables, and 239 constraints, problems are : Problem set: 0 solved, 428 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 428/428 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 428 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 3 (OVERLAPS) 397/552 variables, 155/180 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/552 variables, 59/239 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/552 variables, 428/667 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/552 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 7 (OVERLAPS) 0/552 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 428 unsolved
No progress, stopping.
After SMT solving in domain Int declared 552/552 variables, and 667 constraints, problems are : Problem set: 0 solved, 428 unsolved in 27813 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 428/428 constraints, Known Traps: 18/18 constraints]
After SMT, in 58122ms problems are : Problem set: 0 solved, 428 unsolved
Search for dead transitions found 0 dead transitions in 58126ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58484 ms. Remains : 155/155 places, 434/434 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 141 edges and 155 vertex of which 29 / 155 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 129 transition count 289
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 129 transition count 280
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 128 transition count 279
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 128 transition count 278
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 127 transition count 277
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 126 transition count 234
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 126 transition count 234
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 28 place count 126 transition count 219
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 40 place count 117 transition count 216
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 117 transition count 216
Applied a total of 46 rules in 19 ms. Remains 117 /155 variables (removed 38) and now considering 216/434 (removed 218) transitions.
Running SMT prover for 1 properties.
[2024-06-02 18:35:39] [INFO ] Flow matrix only has 214 transitions (discarded 2 similar events)
// Phase 1: matrix 214 rows 117 cols
[2024-06-02 18:35:39] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 18:35:39] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 18:35:39] [INFO ] After 44ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 18:35:39] [INFO ] After 55ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-06-02 18:35:39] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 126 ms.
RANDOM walk for 40000 steps (1283 resets) in 103 ms. (384 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (240 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1298440 steps, run timeout after 3001 ms. (steps per millisecond=432 ) properties seen :0 out of 1
Probabilistic random walk after 1298440 steps, saw 311967 distinct states, run finished after 3001 ms. (steps per millisecond=432 ) properties seen :0
[2024-06-02 18:35:42] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
// Phase 1: matrix 480 rows 189 cols
[2024-06-02 18:35:42] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 18:35:42] [INFO ] State equation strengthened by 71 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) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 237/443 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/444 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/444 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/444 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 205/649 variables, 107/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/649 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/649 variables, 48/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/649 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 18/667 variables, 10/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/667 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/667 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/669 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/669 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/669 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 669/669 variables, and 267 constraints, problems are : Problem set: 0 solved, 1 unsolved in 191 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 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) 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) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 237/443 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/443 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/444 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/444 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/444 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 205/649 variables, 107/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/649 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/649 variables, 48/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/649 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/667 variables, 10/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/667 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/667 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/669 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/669 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/669 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 669/669 variables, and 268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 250 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 454ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 514/514 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 186 transition count 508
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 186 transition count 508
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 183 transition count 499
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 183 transition count 499
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 180 transition count 493
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 180 transition count 493
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 177 transition count 484
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 177 transition count 484
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 174 transition count 478
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 174 transition count 478
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 171 transition count 469
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 171 transition count 469
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 169 transition count 465
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 169 transition count 465
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 167 transition count 459
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 167 transition count 459
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 165 transition count 455
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 165 transition count 455
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 163 transition count 449
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 163 transition count 449
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 161 transition count 445
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 161 transition count 445
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 159 transition count 441
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 159 transition count 441
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 157 transition count 437
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 157 transition count 437
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 67 place count 157 transition count 443
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 76 place count 154 transition count 437
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 82 place count 154 transition count 431
Applied a total of 82 rules in 37 ms. Remains 154 /189 variables (removed 35) and now considering 431/514 (removed 83) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 154/189 places, 431/514 transitions.
RANDOM walk for 40000 steps (1257 resets) in 93 ms. (425 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (270 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1464880 steps, run timeout after 3001 ms. (steps per millisecond=488 ) properties seen :0 out of 1
Probabilistic random walk after 1464880 steps, saw 356440 distinct states, run finished after 3001 ms. (steps per millisecond=488 ) properties seen :0
[2024-06-02 18:35:46] [INFO ] Flow matrix only has 394 transitions (discarded 37 similar events)
// Phase 1: matrix 394 rows 154 cols
[2024-06-02 18:35:46] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 18:35:46] [INFO ] State equation strengthened by 58 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) 135/181 variables, 46/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 187/368 variables, 16/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/369 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/369 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/369 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 159/528 variables, 79/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/528 variables, 2/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/528 variables, 38/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/528 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 18/546 variables, 10/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/546 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/546 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/548 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/548 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/548 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 219 constraints, problems are : Problem set: 0 solved, 1 unsolved in 186 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, ReadFeed: 58/58 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) 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) 135/181 variables, 46/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 187/368 variables, 16/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/368 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/369 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/369 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/369 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 159/528 variables, 79/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/528 variables, 2/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/528 variables, 38/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/528 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/546 variables, 10/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/546 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/546 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/548 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/548 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/548 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 220 constraints, problems are : Problem set: 0 solved, 1 unsolved in 211 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 404ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 431/431 transitions.
Applied a total of 0 rules in 6 ms. Remains 154 /154 variables (removed 0) and now considering 431/431 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 154/154 places, 431/431 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 431/431 transitions.
Applied a total of 0 rules in 4 ms. Remains 154 /154 variables (removed 0) and now considering 431/431 (removed 0) transitions.
[2024-06-02 18:35:46] [INFO ] Flow matrix only has 394 transitions (discarded 37 similar events)
[2024-06-02 18:35:46] [INFO ] Invariant cache hit.
[2024-06-02 18:35:46] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-02 18:35:46] [INFO ] Flow matrix only has 394 transitions (discarded 37 similar events)
[2024-06-02 18:35:46] [INFO ] Invariant cache hit.
[2024-06-02 18:35:46] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 18:35:46] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
[2024-06-02 18:35:46] [INFO ] Redundant transitions in 3 ms returned []
Running 425 sub problems to find dead transitions.
[2024-06-02 18:35:46] [INFO ] Flow matrix only has 394 transitions (discarded 37 similar events)
[2024-06-02 18:35:46] [INFO ] Invariant cache hit.
[2024-06-02 18:35:46] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-06-02 18:35:48] [INFO ] Deduced a trap composed of 57 places in 68 ms of which 1 ms to minimize.
[2024-06-02 18:35:48] [INFO ] Deduced a trap composed of 32 places in 27 ms of which 0 ms to minimize.
[2024-06-02 18:35:48] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 1 ms to minimize.
[2024-06-02 18:35:48] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-06-02 18:35:48] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2024-06-02 18:35:49] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-06-02 18:35:49] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:35:49] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 1 ms to minimize.
[2024-06-02 18:35:49] [INFO ] Deduced a trap composed of 32 places in 29 ms of which 1 ms to minimize.
[2024-06-02 18:35:50] [INFO ] Deduced a trap composed of 62 places in 73 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 3 (OVERLAPS) 394/548 variables, 154/171 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/548 variables, 58/229 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-06-02 18:35:55] [INFO ] Deduced a trap composed of 53 places in 81 ms of which 1 ms to minimize.
[2024-06-02 18:35:55] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 0 ms to minimize.
[2024-06-02 18:35:57] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 0 ms to minimize.
[2024-06-02 18:35:58] [INFO ] Deduced a trap composed of 31 places in 29 ms of which 0 ms to minimize.
[2024-06-02 18:35:58] [INFO ] Deduced a trap composed of 89 places in 69 ms of which 1 ms to minimize.
[2024-06-02 18:35:58] [INFO ] Deduced a trap composed of 50 places in 68 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 6/235 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 7 (OVERLAPS) 0/548 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 425 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 235 constraints, problems are : Problem set: 0 solved, 425 unsolved in 21578 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 425 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 3 (OVERLAPS) 394/548 variables, 154/177 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/548 variables, 58/235 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 425/660 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 0/660 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 7 (OVERLAPS) 0/548 variables, 0/660 constraints. Problems are: Problem set: 0 solved, 425 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 660 constraints, problems are : Problem set: 0 solved, 425 unsolved in 24478 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 16/16 constraints]
After SMT, in 46376ms problems are : Problem set: 0 solved, 425 unsolved
Search for dead transitions found 0 dead transitions in 46379ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46711 ms. Remains : 154/154 places, 431/431 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 140 edges and 154 vertex of which 29 / 154 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 128 transition count 286
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 128 transition count 277
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 127 transition count 276
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 127 transition count 275
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 126 transition count 274
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 125 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 125 transition count 232
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 28 place count 125 transition count 217
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 40 place count 116 transition count 214
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 116 transition count 214
Applied a total of 46 rules in 28 ms. Remains 116 /154 variables (removed 38) and now considering 214/431 (removed 217) transitions.
Running SMT prover for 1 properties.
[2024-06-02 18:36:33] [INFO ] Flow matrix only has 212 transitions (discarded 2 similar events)
// Phase 1: matrix 212 rows 116 cols
[2024-06-02 18:36:33] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 18:36:33] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 18:36:33] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 18:36:33] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 18:36:33] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 18:36:33] [INFO ] Deduced a trap composed of 29 places in 26 ms of which 0 ms to minimize.
[2024-06-02 18:36:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
TRAPS : Iteration 1
[2024-06-02 18:36:33] [INFO ] After 94ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 18:36:33] [INFO ] After 142ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 266 ms.
RANDOM walk for 40000 steps (1334 resets) in 110 ms. (360 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (258 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1321100 steps, run timeout after 3001 ms. (steps per millisecond=440 ) properties seen :0 out of 1
Probabilistic random walk after 1321100 steps, saw 316417 distinct states, run finished after 3001 ms. (steps per millisecond=440 ) properties seen :0
[2024-06-02 18:36:36] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
// Phase 1: matrix 480 rows 189 cols
[2024-06-02 18:36:36] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 18:36:36] [INFO ] State equation strengthened by 71 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) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 237/443 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/444 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/444 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/444 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 205/649 variables, 107/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/649 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/649 variables, 48/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:36:36] [INFO ] Deduced a trap composed of 54 places in 86 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/649 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/649 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/667 variables, 10/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/667 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/667 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/669 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/669 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/669 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 669/669 variables, and 268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 309 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 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) 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) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 237/443 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/443 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/444 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/444 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/444 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 205/649 variables, 107/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/649 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/649 variables, 48/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/649 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/649 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 18/667 variables, 10/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/667 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/667 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/669 variables, 2/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/669 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/669 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 669/669 variables, and 269 constraints, problems are : Problem set: 0 solved, 1 unsolved in 256 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 575ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 1 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 514/514 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 186 transition count 508
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 186 transition count 508
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 183 transition count 499
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 183 transition count 499
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 180 transition count 493
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 180 transition count 493
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 177 transition count 484
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 177 transition count 484
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 174 transition count 478
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 174 transition count 478
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 171 transition count 469
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 171 transition count 469
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 168 transition count 463
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 168 transition count 463
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 166 transition count 457
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 166 transition count 457
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 164 transition count 453
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 164 transition count 453
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 162 transition count 447
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 162 transition count 447
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 160 transition count 443
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 160 transition count 443
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 158 transition count 439
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 158 transition count 439
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 64 place count 156 transition count 435
Iterating global reduction 0 with 2 rules applied. Total rules applied 66 place count 156 transition count 435
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 69 place count 156 transition count 441
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 78 place count 153 transition count 435
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 84 place count 153 transition count 429
Applied a total of 84 rules in 35 ms. Remains 153 /189 variables (removed 36) and now considering 429/514 (removed 85) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 153/189 places, 429/514 transitions.
RANDOM walk for 40000 steps (1286 resets) in 93 ms. (425 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (291 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1484203 steps, run timeout after 3001 ms. (steps per millisecond=494 ) properties seen :0 out of 1
Probabilistic random walk after 1484203 steps, saw 361656 distinct states, run finished after 3001 ms. (steps per millisecond=494 ) properties seen :0
[2024-06-02 18:36:40] [INFO ] Flow matrix only has 392 transitions (discarded 37 similar events)
// Phase 1: matrix 392 rows 153 cols
[2024-06-02 18:36:40] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 18:36:40] [INFO ] State equation strengthened by 58 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) 133/178 variables, 45/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 187/365 variables, 16/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/366 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/366 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/366 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 159/525 variables, 79/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/525 variables, 2/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/525 variables, 38/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:36:40] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/525 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/525 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/543 variables, 10/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/543 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/543 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/545 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/545 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/545 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 545/545 variables, and 219 constraints, problems are : Problem set: 0 solved, 1 unsolved in 284 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 58/58 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) 133/178 variables, 45/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 187/365 variables, 16/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/365 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/366 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/366 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/366 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 159/525 variables, 79/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/525 variables, 2/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/525 variables, 38/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/525 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/525 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 18/543 variables, 10/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/543 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/543 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/545 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/545 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/545 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 545/545 variables, and 220 constraints, problems are : Problem set: 0 solved, 1 unsolved in 204 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 495ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 429/429 transitions.
Applied a total of 0 rules in 6 ms. Remains 153 /153 variables (removed 0) and now considering 429/429 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 153/153 places, 429/429 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 429/429 transitions.
Applied a total of 0 rules in 4 ms. Remains 153 /153 variables (removed 0) and now considering 429/429 (removed 0) transitions.
[2024-06-02 18:36:40] [INFO ] Flow matrix only has 392 transitions (discarded 37 similar events)
[2024-06-02 18:36:40] [INFO ] Invariant cache hit.
[2024-06-02 18:36:40] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-02 18:36:40] [INFO ] Flow matrix only has 392 transitions (discarded 37 similar events)
[2024-06-02 18:36:40] [INFO ] Invariant cache hit.
[2024-06-02 18:36:41] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 18:36:41] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
[2024-06-02 18:36:41] [INFO ] Redundant transitions in 4 ms returned []
Running 423 sub problems to find dead transitions.
[2024-06-02 18:36:41] [INFO ] Flow matrix only has 392 transitions (discarded 37 similar events)
[2024-06-02 18:36:41] [INFO ] Invariant cache hit.
[2024-06-02 18:36:41] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-02 18:36:42] [INFO ] Deduced a trap composed of 52 places in 77 ms of which 1 ms to minimize.
[2024-06-02 18:36:42] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-06-02 18:36:43] [INFO ] Deduced a trap composed of 65 places in 72 ms of which 1 ms to minimize.
[2024-06-02 18:36:43] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-06-02 18:36:43] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 0 ms to minimize.
[2024-06-02 18:36:43] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-06-02 18:36:43] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-06-02 18:36:43] [INFO ] Deduced a trap composed of 32 places in 28 ms of which 1 ms to minimize.
[2024-06-02 18:36:44] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 1 ms to minimize.
[2024-06-02 18:36:44] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-06-02 18:36:44] [INFO ] Deduced a trap composed of 51 places in 72 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 3 (OVERLAPS) 392/545 variables, 153/171 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/545 variables, 58/229 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-02 18:36:49] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-02 18:36:55] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 0 ms to minimize.
[2024-06-02 18:36:55] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 2/232 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 8 (OVERLAPS) 0/545 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 423 unsolved
No progress, stopping.
After SMT solving in domain Real declared 545/545 variables, and 232 constraints, problems are : Problem set: 0 solved, 423 unsolved in 24594 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 423/423 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 423 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 3 (OVERLAPS) 392/545 variables, 153/174 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/545 variables, 58/232 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 423/655 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 7 (OVERLAPS) 0/545 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 423 unsolved
No progress, stopping.
After SMT solving in domain Int declared 545/545 variables, and 655 constraints, problems are : Problem set: 0 solved, 423 unsolved in 25153 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 423/423 constraints, Known Traps: 14/14 constraints]
After SMT, in 50033ms problems are : Problem set: 0 solved, 423 unsolved
Search for dead transitions found 0 dead transitions in 50037ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50380 ms. Remains : 153/153 places, 429/429 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 140 edges and 153 vertex of which 29 / 153 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 127 transition count 284
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 127 transition count 275
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 126 transition count 274
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 126 transition count 273
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 125 transition count 272
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 124 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 124 transition count 230
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 28 place count 124 transition count 215
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 40 place count 115 transition count 212
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 115 transition count 212
Applied a total of 46 rules in 15 ms. Remains 115 /153 variables (removed 38) and now considering 212/429 (removed 217) transitions.
Running SMT prover for 1 properties.
[2024-06-02 18:37:31] [INFO ] Flow matrix only has 210 transitions (discarded 2 similar events)
// Phase 1: matrix 210 rows 115 cols
[2024-06-02 18:37:31] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 18:37:31] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 18:37:31] [INFO ] After 40ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 18:37:31] [INFO ] After 49ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-06-02 18:37:31] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 106 ms.
RANDOM walk for 40000 steps (1278 resets) in 94 ms. (421 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (283 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1331172 steps, run timeout after 3001 ms. (steps per millisecond=443 ) properties seen :0 out of 1
Probabilistic random walk after 1331172 steps, saw 317568 distinct states, run finished after 3001 ms. (steps per millisecond=443 ) properties seen :0
[2024-06-02 18:37:34] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
// Phase 1: matrix 480 rows 189 cols
[2024-06-02 18:37:34] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 18:37:34] [INFO ] State equation strengthened by 71 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) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 237/443 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/444 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/444 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/444 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 205/649 variables, 107/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/649 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/649 variables, 48/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/649 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 18/667 variables, 10/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/667 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/667 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/669 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/669 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/669 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 669/669 variables, and 267 constraints, problems are : Problem set: 0 solved, 1 unsolved in 200 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 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) 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) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 237/443 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/443 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/444 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/444 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/444 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 205/649 variables, 107/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/649 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/649 variables, 48/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/649 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/667 variables, 10/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/667 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/667 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/669 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/669 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/669 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 669/669 variables, and 268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 205 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 421ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 514/514 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 186 transition count 508
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 186 transition count 508
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 183 transition count 499
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 183 transition count 499
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 180 transition count 493
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 180 transition count 493
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 177 transition count 484
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 177 transition count 484
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 174 transition count 478
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 174 transition count 478
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 171 transition count 469
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 171 transition count 469
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 168 transition count 463
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 168 transition count 463
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 165 transition count 454
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 165 transition count 454
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 163 transition count 450
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 163 transition count 450
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 161 transition count 444
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 161 transition count 444
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 159 transition count 440
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 159 transition count 440
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 157 transition count 436
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 157 transition count 436
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 66 place count 155 transition count 432
Iterating global reduction 0 with 2 rules applied. Total rules applied 68 place count 155 transition count 432
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 71 place count 155 transition count 438
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 80 place count 152 transition count 432
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 86 place count 152 transition count 426
Applied a total of 86 rules in 39 ms. Remains 152 /189 variables (removed 37) and now considering 426/514 (removed 88) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 152/189 places, 426/514 transitions.
RANDOM walk for 40000 steps (1290 resets) in 83 ms. (476 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (282 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1471950 steps, run timeout after 3001 ms. (steps per millisecond=490 ) properties seen :0 out of 1
Probabilistic random walk after 1471950 steps, saw 358306 distinct states, run finished after 3001 ms. (steps per millisecond=490 ) properties seen :0
[2024-06-02 18:37:37] [INFO ] Flow matrix only has 389 transitions (discarded 37 similar events)
// Phase 1: matrix 389 rows 152 cols
[2024-06-02 18:37:37] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 18:37:37] [INFO ] State equation strengthened by 57 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) 130/174 variables, 44/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 187/361 variables, 16/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 19/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/362 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/362 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/362 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 159/521 variables, 79/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/521 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/521 variables, 38/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/521 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 18/539 variables, 10/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/539 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/539 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/541 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/541 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/541 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 541/541 variables, and 216 constraints, problems are : Problem set: 0 solved, 1 unsolved in 164 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 152/152 constraints, ReadFeed: 57/57 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) 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) 130/174 variables, 44/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 187/361 variables, 16/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 19/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/361 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/362 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/362 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/362 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 159/521 variables, 79/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/521 variables, 2/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/521 variables, 38/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/521 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/539 variables, 10/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/539 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/539 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/541 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/541 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/541 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 541/541 variables, and 217 constraints, problems are : Problem set: 0 solved, 1 unsolved in 184 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 152/152 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 357ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 426/426 transitions.
Applied a total of 0 rules in 6 ms. Remains 152 /152 variables (removed 0) and now considering 426/426 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 152/152 places, 426/426 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 426/426 transitions.
Applied a total of 0 rules in 5 ms. Remains 152 /152 variables (removed 0) and now considering 426/426 (removed 0) transitions.
[2024-06-02 18:37:38] [INFO ] Flow matrix only has 389 transitions (discarded 37 similar events)
[2024-06-02 18:37:38] [INFO ] Invariant cache hit.
[2024-06-02 18:37:38] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-02 18:37:38] [INFO ] Flow matrix only has 389 transitions (discarded 37 similar events)
[2024-06-02 18:37:38] [INFO ] Invariant cache hit.
[2024-06-02 18:37:38] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-06-02 18:37:38] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2024-06-02 18:37:38] [INFO ] Redundant transitions in 3 ms returned []
Running 420 sub problems to find dead transitions.
[2024-06-02 18:37:38] [INFO ] Flow matrix only has 389 transitions (discarded 37 similar events)
[2024-06-02 18:37:38] [INFO ] Invariant cache hit.
[2024-06-02 18:37:38] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-06-02 18:37:40] [INFO ] Deduced a trap composed of 53 places in 77 ms of which 1 ms to minimize.
[2024-06-02 18:37:40] [INFO ] Deduced a trap composed of 52 places in 64 ms of which 1 ms to minimize.
[2024-06-02 18:37:40] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2024-06-02 18:37:40] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 1 ms to minimize.
[2024-06-02 18:37:40] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2024-06-02 18:37:40] [INFO ] Deduced a trap composed of 32 places in 29 ms of which 0 ms to minimize.
[2024-06-02 18:37:41] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-06-02 18:37:41] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-06-02 18:37:41] [INFO ] Deduced a trap composed of 32 places in 29 ms of which 0 ms to minimize.
[2024-06-02 18:37:41] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
[2024-06-02 18:37:41] [INFO ] Deduced a trap composed of 32 places in 28 ms of which 0 ms to minimize.
[2024-06-02 18:37:42] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-06-02 18:37:42] [INFO ] Deduced a trap composed of 51 places in 77 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (OVERLAPS) 389/541 variables, 152/172 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/541 variables, 57/229 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-06-02 18:37:47] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
[2024-06-02 18:37:47] [INFO ] Deduced a trap composed of 60 places in 71 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/541 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-06-02 18:37:50] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
[2024-06-02 18:37:53] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 0 ms to minimize.
[2024-06-02 18:37:53] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/541 variables, 3/234 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/541 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 8 (OVERLAPS) 0/541 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 420 unsolved
No progress, stopping.
After SMT solving in domain Real declared 541/541 variables, and 234 constraints, problems are : Problem set: 0 solved, 420 unsolved in 25365 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 152/152 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 420 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (OVERLAPS) 389/541 variables, 152/177 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/541 variables, 57/234 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/541 variables, 420/654 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/541 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 7 (OVERLAPS) 0/541 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 420 unsolved
No progress, stopping.
After SMT solving in domain Int declared 541/541 variables, and 654 constraints, problems are : Problem set: 0 solved, 420 unsolved in 24646 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 152/152 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 18/18 constraints]
After SMT, in 50291ms problems are : Problem set: 0 solved, 420 unsolved
Search for dead transitions found 0 dead transitions in 50295ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50625 ms. Remains : 152/152 places, 426/426 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 139 edges and 152 vertex of which 29 / 152 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 126 transition count 281
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 126 transition count 272
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 125 transition count 271
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 125 transition count 270
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 124 transition count 269
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 123 transition count 228
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 123 transition count 228
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 28 place count 123 transition count 213
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 40 place count 114 transition count 210
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 114 transition count 210
Applied a total of 46 rules in 18 ms. Remains 114 /152 variables (removed 38) and now considering 210/426 (removed 216) transitions.
Running SMT prover for 1 properties.
[2024-06-02 18:38:28] [INFO ] Flow matrix only has 208 transitions (discarded 2 similar events)
// Phase 1: matrix 208 rows 114 cols
[2024-06-02 18:38:28] [INFO ] Computed 7 invariants in 0 ms
[2024-06-02 18:38:28] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 18:38:29] [INFO ] After 45ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 18:38:29] [INFO ] After 54ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 18:38:29] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 18:38:29] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 18:38:29] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 18:38:29] [INFO ] After 57ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 18:38:29] [INFO ] After 95ms 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 (1324 resets) in 94 ms. (421 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (267 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1327222 steps, run timeout after 3001 ms. (steps per millisecond=442 ) properties seen :0 out of 1
Probabilistic random walk after 1327222 steps, saw 316927 distinct states, run finished after 3001 ms. (steps per millisecond=442 ) properties seen :0
[2024-06-02 18:38:32] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
// Phase 1: matrix 480 rows 189 cols
[2024-06-02 18:38:32] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 18:38:32] [INFO ] State equation strengthened by 71 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) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 237/443 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/444 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/444 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/444 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 205/649 variables, 107/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/649 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/649 variables, 48/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/649 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 18/667 variables, 10/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/667 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/667 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/669 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/669 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/669 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 669/669 variables, and 267 constraints, problems are : Problem set: 0 solved, 1 unsolved in 198 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 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) 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) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 237/443 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/443 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/444 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/444 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/444 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 205/649 variables, 107/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/649 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/649 variables, 48/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/649 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/667 variables, 10/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/667 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/667 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/669 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/669 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/669 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 669/669 variables, and 268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 207 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 415ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 514/514 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 186 transition count 508
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 186 transition count 508
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 183 transition count 499
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 183 transition count 499
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 180 transition count 493
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 180 transition count 493
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 177 transition count 484
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 177 transition count 484
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 174 transition count 478
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 174 transition count 478
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 171 transition count 469
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 171 transition count 469
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 168 transition count 463
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 168 transition count 463
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 165 transition count 454
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 165 transition count 454
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 162 transition count 448
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 162 transition count 448
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 160 transition count 442
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 160 transition count 442
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 158 transition count 438
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 158 transition count 438
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 64 place count 156 transition count 434
Iterating global reduction 0 with 2 rules applied. Total rules applied 66 place count 156 transition count 434
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 68 place count 154 transition count 430
Iterating global reduction 0 with 2 rules applied. Total rules applied 70 place count 154 transition count 430
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 73 place count 154 transition count 436
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 82 place count 151 transition count 430
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 88 place count 151 transition count 424
Applied a total of 88 rules in 39 ms. Remains 151 /189 variables (removed 38) and now considering 424/514 (removed 90) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 151/189 places, 424/514 transitions.
RANDOM walk for 40000 steps (1238 resets) in 75 ms. (526 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (292 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1497630 steps, run timeout after 3001 ms. (steps per millisecond=499 ) properties seen :0 out of 1
Probabilistic random walk after 1497630 steps, saw 365231 distinct states, run finished after 3001 ms. (steps per millisecond=499 ) properties seen :0
[2024-06-02 18:38:35] [INFO ] Flow matrix only has 387 transitions (discarded 37 similar events)
// Phase 1: matrix 387 rows 151 cols
[2024-06-02 18:38:35] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 18:38:35] [INFO ] State equation strengthened by 57 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) 128/171 variables, 43/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 187/358 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/358 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/358 variables, 19/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/358 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/359 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/359 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/359 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 159/518 variables, 79/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/518 variables, 2/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/518 variables, 38/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/518 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 18/536 variables, 10/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/536 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/536 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/538 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/538 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/538 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 538/538 variables, and 215 constraints, problems are : Problem set: 0 solved, 1 unsolved in 172 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 151/151 constraints, ReadFeed: 57/57 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) 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) 128/171 variables, 43/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 187/358 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/358 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/358 variables, 19/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/358 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/358 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/359 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/359 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/359 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 159/518 variables, 79/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/518 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/518 variables, 38/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/518 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/536 variables, 10/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/536 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/536 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/538 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/538 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/538 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 538/538 variables, and 216 constraints, problems are : Problem set: 0 solved, 1 unsolved in 158 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 151/151 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 341ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 424/424 transitions.
Applied a total of 0 rules in 6 ms. Remains 151 /151 variables (removed 0) and now considering 424/424 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 151/151 places, 424/424 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 424/424 transitions.
Applied a total of 0 rules in 3 ms. Remains 151 /151 variables (removed 0) and now considering 424/424 (removed 0) transitions.
[2024-06-02 18:38:36] [INFO ] Flow matrix only has 387 transitions (discarded 37 similar events)
[2024-06-02 18:38:36] [INFO ] Invariant cache hit.
[2024-06-02 18:38:36] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-02 18:38:36] [INFO ] Flow matrix only has 387 transitions (discarded 37 similar events)
[2024-06-02 18:38:36] [INFO ] Invariant cache hit.
[2024-06-02 18:38:36] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-06-02 18:38:36] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
[2024-06-02 18:38:36] [INFO ] Redundant transitions in 3 ms returned []
Running 418 sub problems to find dead transitions.
[2024-06-02 18:38:36] [INFO ] Flow matrix only has 387 transitions (discarded 37 similar events)
[2024-06-02 18:38:36] [INFO ] Invariant cache hit.
[2024-06-02 18:38:36] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 418 unsolved
[2024-06-02 18:38:37] [INFO ] Deduced a trap composed of 54 places in 73 ms of which 2 ms to minimize.
[2024-06-02 18:38:38] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-06-02 18:38:38] [INFO ] Deduced a trap composed of 32 places in 28 ms of which 1 ms to minimize.
[2024-06-02 18:38:38] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-06-02 18:38:38] [INFO ] Deduced a trap composed of 32 places in 29 ms of which 1 ms to minimize.
[2024-06-02 18:38:39] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-06-02 18:38:39] [INFO ] Deduced a trap composed of 32 places in 29 ms of which 0 ms to minimize.
[2024-06-02 18:38:39] [INFO ] Deduced a trap composed of 60 places in 65 ms of which 1 ms to minimize.
[2024-06-02 18:38:39] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2024-06-02 18:38:39] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 0 ms to minimize.
[2024-06-02 18:38:39] [INFO ] Deduced a trap composed of 50 places in 65 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 418 unsolved
[2024-06-02 18:38:40] [INFO ] Deduced a trap composed of 55 places in 66 ms of which 1 ms to minimize.
[2024-06-02 18:38:41] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 4 (OVERLAPS) 387/538 variables, 151/171 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/538 variables, 57/228 constraints. Problems are: Problem set: 0 solved, 418 unsolved
[2024-06-02 18:38:45] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 418 unsolved
[2024-06-02 18:38:53] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2024-06-02 18:38:53] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 9 (OVERLAPS) 0/538 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 418 unsolved
No progress, stopping.
After SMT solving in domain Real declared 538/538 variables, and 231 constraints, problems are : Problem set: 0 solved, 418 unsolved in 27623 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 151/151 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 418/418 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 418 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 3 (OVERLAPS) 387/538 variables, 151/174 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/538 variables, 57/231 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/538 variables, 418/649 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 7 (OVERLAPS) 0/538 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 418 unsolved
No progress, stopping.
After SMT solving in domain Int declared 538/538 variables, and 649 constraints, problems are : Problem set: 0 solved, 418 unsolved in 25414 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 151/151 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 418/418 constraints, Known Traps: 16/16 constraints]
After SMT, in 53350ms problems are : Problem set: 0 solved, 418 unsolved
Search for dead transitions found 0 dead transitions in 53354ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53669 ms. Remains : 151/151 places, 424/424 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 139 edges and 151 vertex of which 29 / 151 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 125 transition count 279
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 125 transition count 270
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 124 transition count 269
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 124 transition count 268
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 123 transition count 267
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 122 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 122 transition count 226
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 28 place count 122 transition count 211
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 40 place count 113 transition count 208
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 113 transition count 208
Applied a total of 46 rules in 19 ms. Remains 113 /151 variables (removed 38) and now considering 208/424 (removed 216) transitions.
Running SMT prover for 1 properties.
[2024-06-02 18:39:29] [INFO ] Flow matrix only has 206 transitions (discarded 2 similar events)
// Phase 1: matrix 206 rows 113 cols
[2024-06-02 18:39:29] [INFO ] Computed 7 invariants in 0 ms
[2024-06-02 18:39:29] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 18:39:29] [INFO ] After 44ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 18:39:29] [INFO ] After 53ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-06-02 18:39:29] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 119 ms.
RANDOM walk for 40000 steps (1294 resets) in 94 ms. (421 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (262 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1342271 steps, run timeout after 3001 ms. (steps per millisecond=447 ) properties seen :0 out of 1
Probabilistic random walk after 1342271 steps, saw 319674 distinct states, run finished after 3001 ms. (steps per millisecond=447 ) properties seen :0
[2024-06-02 18:39:32] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
// Phase 1: matrix 480 rows 189 cols
[2024-06-02 18:39:32] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 18:39:32] [INFO ] State equation strengthened by 71 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) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 237/443 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/444 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/444 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/444 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 205/649 variables, 107/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/649 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/649 variables, 48/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/649 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 18/667 variables, 10/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/667 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/667 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/669 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/669 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/669 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 669/669 variables, and 267 constraints, problems are : Problem set: 0 solved, 1 unsolved in 194 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 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) 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) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 237/443 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/443 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/444 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/444 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/444 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 205/649 variables, 107/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/649 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/649 variables, 48/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/649 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/667 variables, 10/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/667 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/667 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/669 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/669 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/669 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 669/669 variables, and 268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 188 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 393ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 514/514 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 186 transition count 508
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 186 transition count 508
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 183 transition count 499
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 183 transition count 499
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 180 transition count 493
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 180 transition count 493
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 177 transition count 484
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 177 transition count 484
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 174 transition count 478
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 174 transition count 478
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 171 transition count 469
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 171 transition count 469
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 168 transition count 463
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 168 transition count 463
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 165 transition count 454
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 165 transition count 454
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 162 transition count 448
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 162 transition count 448
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 159 transition count 439
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 159 transition count 439
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 157 transition count 435
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 157 transition count 435
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 66 place count 155 transition count 431
Iterating global reduction 0 with 2 rules applied. Total rules applied 68 place count 155 transition count 431
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 70 place count 153 transition count 427
Iterating global reduction 0 with 2 rules applied. Total rules applied 72 place count 153 transition count 427
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 75 place count 153 transition count 433
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 84 place count 150 transition count 427
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 90 place count 150 transition count 421
Applied a total of 90 rules in 37 ms. Remains 150 /189 variables (removed 39) and now considering 421/514 (removed 93) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 150/189 places, 421/514 transitions.
RANDOM walk for 40000 steps (1253 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (277 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1516217 steps, run timeout after 3001 ms. (steps per millisecond=505 ) properties seen :0 out of 1
Probabilistic random walk after 1516217 steps, saw 368807 distinct states, run finished after 3001 ms. (steps per millisecond=505 ) properties seen :0
[2024-06-02 18:39:36] [INFO ] Flow matrix only has 384 transitions (discarded 37 similar events)
// Phase 1: matrix 384 rows 150 cols
[2024-06-02 18:39:36] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 18:39:36] [INFO ] State equation strengthened by 56 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) 125/167 variables, 42/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 187/354 variables, 16/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 18/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/355 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/355 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/355 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 159/514 variables, 79/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/514 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/514 variables, 38/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/514 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 18/532 variables, 10/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/532 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/532 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/534 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/534 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/534 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 534/534 variables, and 213 constraints, problems are : Problem set: 0 solved, 1 unsolved in 153 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 56/56 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) 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) 125/167 variables, 42/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 187/354 variables, 16/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 18/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/354 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/355 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/355 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/355 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 159/514 variables, 79/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/514 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/514 variables, 38/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/514 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/532 variables, 10/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/532 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/532 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/534 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/534 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/534 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 534/534 variables, and 214 constraints, problems are : Problem set: 0 solved, 1 unsolved in 160 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 325ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 421/421 transitions.
Applied a total of 0 rules in 7 ms. Remains 150 /150 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 150/150 places, 421/421 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 421/421 transitions.
Applied a total of 0 rules in 3 ms. Remains 150 /150 variables (removed 0) and now considering 421/421 (removed 0) transitions.
[2024-06-02 18:39:36] [INFO ] Flow matrix only has 384 transitions (discarded 37 similar events)
[2024-06-02 18:39:36] [INFO ] Invariant cache hit.
[2024-06-02 18:39:36] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-02 18:39:36] [INFO ] Flow matrix only has 384 transitions (discarded 37 similar events)
[2024-06-02 18:39:36] [INFO ] Invariant cache hit.
[2024-06-02 18:39:36] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 18:39:36] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
[2024-06-02 18:39:36] [INFO ] Redundant transitions in 6 ms returned []
Running 415 sub problems to find dead transitions.
[2024-06-02 18:39:36] [INFO ] Flow matrix only has 384 transitions (discarded 37 similar events)
[2024-06-02 18:39:36] [INFO ] Invariant cache hit.
[2024-06-02 18:39:37] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2024-06-02 18:39:38] [INFO ] Deduced a trap composed of 55 places in 76 ms of which 1 ms to minimize.
[2024-06-02 18:39:38] [INFO ] Deduced a trap composed of 59 places in 74 ms of which 1 ms to minimize.
[2024-06-02 18:39:38] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-06-02 18:39:38] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 2 ms to minimize.
[2024-06-02 18:39:39] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-06-02 18:39:39] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 0 ms to minimize.
[2024-06-02 18:39:39] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-06-02 18:39:39] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 1 ms to minimize.
[2024-06-02 18:39:39] [INFO ] Deduced a trap composed of 32 places in 27 ms of which 1 ms to minimize.
[2024-06-02 18:39:40] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-06-02 18:39:40] [INFO ] Deduced a trap composed of 51 places in 75 ms of which 4 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2024-06-02 18:39:41] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 4 (OVERLAPS) 384/534 variables, 150/169 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 56/225 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2024-06-02 18:39:45] [INFO ] Deduced a trap composed of 51 places in 71 ms of which 1 ms to minimize.
[2024-06-02 18:39:45] [INFO ] Deduced a trap composed of 40 places in 30 ms of which 1 ms to minimize.
[2024-06-02 18:39:47] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 1 ms to minimize.
[2024-06-02 18:39:47] [INFO ] Deduced a trap composed of 31 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 4/229 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 8 (OVERLAPS) 0/534 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 415 unsolved
No progress, stopping.
After SMT solving in domain Real declared 534/534 variables, and 229 constraints, problems are : Problem set: 0 solved, 415 unsolved in 20935 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 415 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 3 (OVERLAPS) 384/534 variables, 150/173 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/534 variables, 56/229 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 415/644 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2024-06-02 18:40:07] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 1/645 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 8 (OVERLAPS) 0/534 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 415 unsolved
No progress, stopping.
After SMT solving in domain Int declared 534/534 variables, and 645 constraints, problems are : Problem set: 0 solved, 415 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 17/17 constraints]
After SMT, in 51234ms problems are : Problem set: 0 solved, 415 unsolved
Search for dead transitions found 0 dead transitions in 51239ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51562 ms. Remains : 150/150 places, 421/421 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 139 edges and 150 vertex of which 29 / 150 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 124 transition count 276
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 124 transition count 267
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 123 transition count 266
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 123 transition count 265
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 122 transition count 264
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 121 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 121 transition count 224
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 28 place count 121 transition count 209
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 40 place count 112 transition count 206
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 112 transition count 206
Applied a total of 46 rules in 15 ms. Remains 112 /150 variables (removed 38) and now considering 206/421 (removed 215) transitions.
Running SMT prover for 1 properties.
[2024-06-02 18:40:28] [INFO ] Flow matrix only has 204 transitions (discarded 2 similar events)
// Phase 1: matrix 204 rows 112 cols
[2024-06-02 18:40:28] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 18:40:28] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 18:40:28] [INFO ] After 43ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 18:40:28] [INFO ] After 58ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-06-02 18:40:28] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 122 ms.
RANDOM walk for 40000 steps (1274 resets) in 93 ms. (425 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (272 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1330042 steps, run timeout after 3001 ms. (steps per millisecond=443 ) properties seen :0 out of 1
Probabilistic random walk after 1330042 steps, saw 317353 distinct states, run finished after 3001 ms. (steps per millisecond=443 ) properties seen :0
[2024-06-02 18:40:31] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
// Phase 1: matrix 480 rows 189 cols
[2024-06-02 18:40:31] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 18:40:31] [INFO ] State equation strengthened by 71 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) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 237/443 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/444 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/444 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/444 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 205/649 variables, 107/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/649 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/649 variables, 48/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/649 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 18/667 variables, 10/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/667 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/667 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/669 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/669 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/669 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 669/669 variables, and 267 constraints, problems are : Problem set: 0 solved, 1 unsolved in 188 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 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) 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) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 237/443 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/443 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/444 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/444 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/444 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 205/649 variables, 107/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/649 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/649 variables, 48/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/649 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/667 variables, 10/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/667 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/667 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/669 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/669 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/669 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 669/669 variables, and 268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 232 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 435ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 514/514 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 186 transition count 508
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 186 transition count 508
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 183 transition count 499
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 183 transition count 499
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 180 transition count 493
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 180 transition count 493
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 177 transition count 484
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 177 transition count 484
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 174 transition count 478
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 174 transition count 478
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 171 transition count 469
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 171 transition count 469
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 168 transition count 463
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 168 transition count 463
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 165 transition count 454
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 165 transition count 454
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 162 transition count 448
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 162 transition count 448
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 159 transition count 439
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 159 transition count 439
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 63 place count 156 transition count 433
Iterating global reduction 0 with 3 rules applied. Total rules applied 66 place count 156 transition count 433
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 68 place count 154 transition count 429
Iterating global reduction 0 with 2 rules applied. Total rules applied 70 place count 154 transition count 429
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 72 place count 152 transition count 425
Iterating global reduction 0 with 2 rules applied. Total rules applied 74 place count 152 transition count 425
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 77 place count 152 transition count 431
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 86 place count 149 transition count 425
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 92 place count 149 transition count 419
Applied a total of 92 rules in 41 ms. Remains 149 /189 variables (removed 40) and now considering 419/514 (removed 95) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 149/189 places, 419/514 transitions.
RANDOM walk for 40000 steps (1279 resets) in 108 ms. (366 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (283 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1517138 steps, run timeout after 3001 ms. (steps per millisecond=505 ) properties seen :0 out of 1
Probabilistic random walk after 1517138 steps, saw 368896 distinct states, run finished after 3001 ms. (steps per millisecond=505 ) properties seen :0
[2024-06-02 18:40:34] [INFO ] Flow matrix only has 382 transitions (discarded 37 similar events)
// Phase 1: matrix 382 rows 149 cols
[2024-06-02 18:40:34] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 18:40:34] [INFO ] State equation strengthened by 56 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) 123/164 variables, 41/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 187/351 variables, 16/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/351 variables, 18/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/351 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/352 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 159/511 variables, 79/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/511 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/511 variables, 38/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/511 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 18/529 variables, 10/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/529 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/529 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/531 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/531 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/531 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 531/531 variables, and 212 constraints, problems are : Problem set: 0 solved, 1 unsolved in 179 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 149/149 constraints, ReadFeed: 56/56 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) 123/164 variables, 41/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 187/351 variables, 16/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/351 variables, 18/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/351 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/351 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/352 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/352 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 159/511 variables, 79/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/511 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/511 variables, 38/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/511 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/529 variables, 10/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/529 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/529 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/531 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/531 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/531 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 531/531 variables, and 213 constraints, problems are : Problem set: 0 solved, 1 unsolved in 170 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 149/149 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 360ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 149 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 149/149 places, 419/419 transitions.
Applied a total of 0 rules in 4 ms. Remains 149 /149 variables (removed 0) and now considering 419/419 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 149/149 places, 419/419 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 149/149 places, 419/419 transitions.
Applied a total of 0 rules in 4 ms. Remains 149 /149 variables (removed 0) and now considering 419/419 (removed 0) transitions.
[2024-06-02 18:40:35] [INFO ] Flow matrix only has 382 transitions (discarded 37 similar events)
[2024-06-02 18:40:35] [INFO ] Invariant cache hit.
[2024-06-02 18:40:35] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-02 18:40:35] [INFO ] Flow matrix only has 382 transitions (discarded 37 similar events)
[2024-06-02 18:40:35] [INFO ] Invariant cache hit.
[2024-06-02 18:40:35] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 18:40:35] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
[2024-06-02 18:40:35] [INFO ] Redundant transitions in 2 ms returned []
Running 413 sub problems to find dead transitions.
[2024-06-02 18:40:35] [INFO ] Flow matrix only has 382 transitions (discarded 37 similar events)
[2024-06-02 18:40:35] [INFO ] Invariant cache hit.
[2024-06-02 18:40:35] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-02 18:40:37] [INFO ] Deduced a trap composed of 57 places in 72 ms of which 1 ms to minimize.
[2024-06-02 18:40:37] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-06-02 18:40:37] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 1 ms to minimize.
[2024-06-02 18:40:37] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 1 ms to minimize.
[2024-06-02 18:40:37] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 0 ms to minimize.
[2024-06-02 18:40:38] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2024-06-02 18:40:38] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-06-02 18:40:38] [INFO ] Deduced a trap composed of 32 places in 27 ms of which 0 ms to minimize.
[2024-06-02 18:40:38] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-06-02 18:40:38] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-06-02 18:40:39] [INFO ] Deduced a trap composed of 51 places in 73 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 3 (OVERLAPS) 382/531 variables, 149/167 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/531 variables, 56/223 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-02 18:40:43] [INFO ] Deduced a trap composed of 51 places in 77 ms of which 1 ms to minimize.
[2024-06-02 18:40:43] [INFO ] Deduced a trap composed of 40 places in 32 ms of which 0 ms to minimize.
[2024-06-02 18:40:46] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 3/226 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-06-02 18:40:49] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 8 (OVERLAPS) 0/531 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 413 unsolved
No progress, stopping.
After SMT solving in domain Real declared 531/531 variables, and 227 constraints, problems are : Problem set: 0 solved, 413 unsolved in 24004 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 149/149 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 413/413 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 413 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 3 (OVERLAPS) 382/531 variables, 149/171 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/531 variables, 56/227 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 413/640 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 7 (OVERLAPS) 0/531 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 413 unsolved
No progress, stopping.
After SMT solving in domain Int declared 531/531 variables, and 640 constraints, problems are : Problem set: 0 solved, 413 unsolved in 24385 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 149/149 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 413/413 constraints, Known Traps: 15/15 constraints]
After SMT, in 48661ms problems are : Problem set: 0 solved, 413 unsolved
Search for dead transitions found 0 dead transitions in 48665ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48994 ms. Remains : 149/149 places, 419/419 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 139 edges and 149 vertex of which 29 / 149 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 123 transition count 274
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 123 transition count 265
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 122 transition count 264
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 122 transition count 263
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 121 transition count 262
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 120 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 120 transition count 222
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 28 place count 120 transition count 207
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 40 place count 111 transition count 204
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 111 transition count 204
Applied a total of 46 rules in 19 ms. Remains 111 /149 variables (removed 38) and now considering 204/419 (removed 215) transitions.
Running SMT prover for 1 properties.
[2024-06-02 18:41:24] [INFO ] Flow matrix only has 202 transitions (discarded 2 similar events)
// Phase 1: matrix 202 rows 111 cols
[2024-06-02 18:41:24] [INFO ] Computed 7 invariants in 0 ms
[2024-06-02 18:41:24] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 18:41:24] [INFO ] After 48ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 18:41:24] [INFO ] After 59ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-06-02 18:41:24] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 125 ms.
RANDOM walk for 40000 steps (1292 resets) in 94 ms. (421 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (272 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1335943 steps, run timeout after 3001 ms. (steps per millisecond=445 ) properties seen :0 out of 1
Probabilistic random walk after 1335943 steps, saw 318551 distinct states, run finished after 3001 ms. (steps per millisecond=445 ) properties seen :0
[2024-06-02 18:41:27] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
// Phase 1: matrix 480 rows 189 cols
[2024-06-02 18:41:27] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 18:41:27] [INFO ] State equation strengthened by 71 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) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 237/443 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/444 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/444 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/444 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 205/649 variables, 107/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/649 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/649 variables, 48/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/649 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 18/667 variables, 10/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/667 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/667 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/669 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/669 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/669 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 669/669 variables, and 267 constraints, problems are : Problem set: 0 solved, 1 unsolved in 181 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 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) 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) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 237/443 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/443 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/444 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/444 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/444 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 205/649 variables, 107/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/649 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/649 variables, 48/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/649 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/667 variables, 10/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/667 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/667 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/669 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/669 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/669 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 669/669 variables, and 268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 223 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 417ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 514/514 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 186 transition count 508
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 186 transition count 508
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 183 transition count 499
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 183 transition count 499
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 180 transition count 493
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 180 transition count 493
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 177 transition count 484
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 177 transition count 484
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 174 transition count 478
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 174 transition count 478
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 171 transition count 469
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 171 transition count 469
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 168 transition count 463
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 168 transition count 463
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 165 transition count 454
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 165 transition count 454
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 162 transition count 448
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 162 transition count 448
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 159 transition count 439
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 159 transition count 439
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 63 place count 156 transition count 433
Iterating global reduction 0 with 3 rules applied. Total rules applied 66 place count 156 transition count 433
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 69 place count 153 transition count 427
Iterating global reduction 0 with 3 rules applied. Total rules applied 72 place count 153 transition count 427
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 74 place count 151 transition count 423
Iterating global reduction 0 with 2 rules applied. Total rules applied 76 place count 151 transition count 423
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 79 place count 151 transition count 429
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 88 place count 148 transition count 423
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 94 place count 148 transition count 417
Applied a total of 94 rules in 36 ms. Remains 148 /189 variables (removed 41) and now considering 417/514 (removed 97) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 148/189 places, 417/514 transitions.
RANDOM walk for 40000 steps (1313 resets) in 89 ms. (444 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (264 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1532484 steps, run timeout after 3001 ms. (steps per millisecond=510 ) properties seen :0 out of 1
Probabilistic random walk after 1532484 steps, saw 371515 distinct states, run finished after 3001 ms. (steps per millisecond=510 ) properties seen :0
[2024-06-02 18:41:30] [INFO ] Flow matrix only has 380 transitions (discarded 37 similar events)
// Phase 1: matrix 380 rows 148 cols
[2024-06-02 18:41:30] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 18:41:30] [INFO ] State equation strengthened by 56 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) 39/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 121/161 variables, 40/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 187/348 variables, 16/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 18/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/348 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/349 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/349 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/349 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 159/508 variables, 79/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/508 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/508 variables, 38/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/508 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 18/526 variables, 10/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/526 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/526 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/528 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/528 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/528 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 528/528 variables, and 211 constraints, problems are : Problem set: 0 solved, 1 unsolved in 152 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 148/148 constraints, ReadFeed: 56/56 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) 39/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 121/161 variables, 40/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 187/348 variables, 16/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 18/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/348 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/348 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/349 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/349 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/349 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 159/508 variables, 79/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/508 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/508 variables, 38/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/508 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/526 variables, 10/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/526 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/526 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/528 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/528 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/528 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 528/528 variables, and 212 constraints, problems are : Problem set: 0 solved, 1 unsolved in 150 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 148/148 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 310ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 417/417 transitions.
Applied a total of 0 rules in 4 ms. Remains 148 /148 variables (removed 0) and now considering 417/417 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 148/148 places, 417/417 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 417/417 transitions.
Applied a total of 0 rules in 4 ms. Remains 148 /148 variables (removed 0) and now considering 417/417 (removed 0) transitions.
[2024-06-02 18:41:31] [INFO ] Flow matrix only has 380 transitions (discarded 37 similar events)
[2024-06-02 18:41:31] [INFO ] Invariant cache hit.
[2024-06-02 18:41:31] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-02 18:41:31] [INFO ] Flow matrix only has 380 transitions (discarded 37 similar events)
[2024-06-02 18:41:31] [INFO ] Invariant cache hit.
[2024-06-02 18:41:31] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 18:41:31] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
[2024-06-02 18:41:31] [INFO ] Redundant transitions in 2 ms returned []
Running 411 sub problems to find dead transitions.
[2024-06-02 18:41:31] [INFO ] Flow matrix only has 380 transitions (discarded 37 similar events)
[2024-06-02 18:41:31] [INFO ] Invariant cache hit.
[2024-06-02 18:41:31] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 411 unsolved
[2024-06-02 18:41:33] [INFO ] Deduced a trap composed of 57 places in 71 ms of which 1 ms to minimize.
[2024-06-02 18:41:33] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2024-06-02 18:41:33] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-06-02 18:41:33] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 1 ms to minimize.
[2024-06-02 18:41:33] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-06-02 18:41:33] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2024-06-02 18:41:34] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 0 ms to minimize.
[2024-06-02 18:41:34] [INFO ] Deduced a trap composed of 32 places in 25 ms of which 0 ms to minimize.
[2024-06-02 18:41:34] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-06-02 18:41:35] [INFO ] Deduced a trap composed of 85 places in 65 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 3 (OVERLAPS) 380/528 variables, 148/165 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 56/221 constraints. Problems are: Problem set: 0 solved, 411 unsolved
[2024-06-02 18:41:39] [INFO ] Deduced a trap composed of 50 places in 88 ms of which 1 ms to minimize.
[2024-06-02 18:41:39] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/528 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 411 unsolved
[2024-06-02 18:41:45] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 1 ms to minimize.
[2024-06-02 18:41:45] [INFO ] Deduced a trap composed of 31 places in 29 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/528 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 8 (OVERLAPS) 0/528 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 411 unsolved
No progress, stopping.
After SMT solving in domain Real declared 528/528 variables, and 225 constraints, problems are : Problem set: 0 solved, 411 unsolved in 23369 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 148/148 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 411/411 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 411 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 3 (OVERLAPS) 380/528 variables, 148/169 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 56/225 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/528 variables, 411/636 constraints. Problems are: Problem set: 0 solved, 411 unsolved
[2024-06-02 18:42:03] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 1/637 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/528 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 8 (OVERLAPS) 0/528 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 411 unsolved
No progress, stopping.
After SMT solving in domain Int declared 528/528 variables, and 637 constraints, problems are : Problem set: 0 solved, 411 unsolved in 29777 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 148/148 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 411/411 constraints, Known Traps: 15/15 constraints]
After SMT, in 53427ms problems are : Problem set: 0 solved, 411 unsolved
Search for dead transitions found 0 dead transitions in 53430ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53758 ms. Remains : 148/148 places, 417/417 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 139 edges and 148 vertex of which 29 / 148 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 122 transition count 272
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 122 transition count 263
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 121 transition count 262
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 121 transition count 261
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 120 transition count 260
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 119 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 119 transition count 221
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 28 place count 119 transition count 206
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 40 place count 110 transition count 203
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 110 transition count 203
Applied a total of 46 rules in 15 ms. Remains 110 /148 variables (removed 38) and now considering 203/417 (removed 214) transitions.
Running SMT prover for 1 properties.
[2024-06-02 18:42:25] [INFO ] Flow matrix only has 201 transitions (discarded 2 similar events)
// Phase 1: matrix 201 rows 110 cols
[2024-06-02 18:42:25] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 18:42:25] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 18:42:25] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 18:42:25] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 18:42:25] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 18:42:25] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-06-02 18:42:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
TRAPS : Iteration 1
[2024-06-02 18:42:25] [INFO ] After 98ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 18:42:25] [INFO ] After 135ms 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 40000 steps (1313 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (278 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1355246 steps, run timeout after 3001 ms. (steps per millisecond=451 ) properties seen :0 out of 1
Probabilistic random walk after 1355246 steps, saw 322846 distinct states, run finished after 3001 ms. (steps per millisecond=451 ) properties seen :0
[2024-06-02 18:42:28] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
// Phase 1: matrix 480 rows 189 cols
[2024-06-02 18:42:28] [INFO ] Computed 7 invariants in 6 ms
[2024-06-02 18:42:28] [INFO ] State equation strengthened by 71 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) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 237/443 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/444 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/444 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/444 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 205/649 variables, 107/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/649 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/649 variables, 48/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/649 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 18/667 variables, 10/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/667 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/667 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/669 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/669 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/669 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 669/669 variables, and 267 constraints, problems are : Problem set: 0 solved, 1 unsolved in 178 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 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) 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) 153/206 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 237/443 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/443 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/444 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/444 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/444 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 205/649 variables, 107/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/649 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/649 variables, 48/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/649 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/667 variables, 10/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/667 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/667 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/669 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/669 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/669 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 669/669 variables, and 268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 190 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 380ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 514/514 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 186 transition count 508
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 186 transition count 508
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 183 transition count 499
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 183 transition count 499
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 180 transition count 493
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 180 transition count 493
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 177 transition count 484
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 177 transition count 484
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 174 transition count 478
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 174 transition count 478
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 171 transition count 469
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 171 transition count 469
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 168 transition count 463
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 168 transition count 463
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 165 transition count 454
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 165 transition count 454
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 162 transition count 448
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 162 transition count 448
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 159 transition count 439
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 159 transition count 439
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 63 place count 156 transition count 433
Iterating global reduction 0 with 3 rules applied. Total rules applied 66 place count 156 transition count 433
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 69 place count 153 transition count 427
Iterating global reduction 0 with 3 rules applied. Total rules applied 72 place count 153 transition count 427
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 74 place count 151 transition count 423
Iterating global reduction 0 with 2 rules applied. Total rules applied 76 place count 151 transition count 423
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 79 place count 151 transition count 429
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 88 place count 148 transition count 423
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 94 place count 148 transition count 417
Applied a total of 94 rules in 34 ms. Remains 148 /189 variables (removed 41) and now considering 417/514 (removed 97) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 148/189 places, 417/514 transitions.
RANDOM walk for 40000 steps (1288 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (275 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ 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-13"
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-13, 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-171734905800167"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-13.tgz
mv FireWire-PT-13 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 ;