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.r564-tall-171734907700167.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 ltsminxred
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 r564-tall-171734907700167
=====================================================================

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

Invoking MCC driver with
BK_TOOL=ltsminxred
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 ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 20:57:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-06-02 20:57:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:57:58] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2024-06-02 20:57:58] [INFO ] Transformed 205 places.
[2024-06-02 20:57:58] [INFO ] Transformed 610 transitions.
[2024-06-02 20:57:58] [INFO ] Found NUPN structural information;
[2024-06-02 20:57:58] [INFO ] Parsed PT model containing 205 places and 610 transitions and 2309 arcs in 179 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 8 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 4 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 67 ms. Remains 196 /205 variables (removed 9) and now considering 542/610 (removed 68) transitions.
[2024-06-02 20:57:58] [INFO ] Flow matrix only has 494 transitions (discarded 48 similar events)
// Phase 1: matrix 494 rows 196 cols
[2024-06-02 20:57:58] [INFO ] Computed 10 invariants in 27 ms
[2024-06-02 20:57:58] [INFO ] Implicit Places using invariants in 313 ms returned []
[2024-06-02 20:57:58] [INFO ] Flow matrix only has 494 transitions (discarded 48 similar events)
[2024-06-02 20:57:58] [INFO ] Invariant cache hit.
[2024-06-02 20:57:59] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-02 20:57:59] [INFO ] Implicit Places using invariants and state equation in 605 ms returned [19, 80, 141]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 949 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 1041 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 (1254 resets) in 2538 ms. (15 steps per ms) remains 165/382 properties
BEST_FIRST walk for 403 steps (8 resets) in 15 ms. (25 steps per ms) remains 165/165 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 165/165 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 165/165 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 165/165 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 165/165 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 165/165 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 165/165 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 165/165 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 165/165 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 165/165 properties
BEST_FIRST walk for 402 steps (8 resets) in 13 ms. (28 steps per ms) remains 165/165 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 165/165 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 165/165 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 165/165 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 165/165 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 165/165 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 165/165 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 165/165 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 165/165 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 165/165 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 165/165 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 165/165 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 165/165 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 165/165 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 165/165 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 165/165 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 165/165 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 165/165 properties
BEST_FIRST walk for 403 steps (8 resets) in 4 ms. (80 steps per ms) remains 165/165 properties
BEST_FIRST walk for 403 steps (8 resets) in 4 ms. (80 steps per ms) remains 165/165 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 165/165 properties
BEST_FIRST walk for 401 steps (8 resets) in 8 ms. (44 steps per ms) remains 165/165 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 165/165 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 165/165 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 165/165 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 165/165 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 165/165 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 165/165 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 165/165 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 165/165 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 165/165 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 165/165 properties
BEST_FIRST walk for 403 steps (8 resets) in 4 ms. (80 steps per ms) remains 165/165 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 165/165 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 165/165 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 165/165 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 165/165 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 165/165 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 165/165 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 165/165 properties
[2024-06-02 20:58:00] [INFO ] Flow matrix only has 494 transitions (discarded 48 similar events)
// Phase 1: matrix 494 rows 193 cols
[2024-06-02 20:58:00] [INFO ] Computed 7 invariants in 6 ms
[2024-06-02 20:58:00] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 83/193 variables, 7/117 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 83/200 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-06-02 20:58:02] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 13 ms to minimize.
[2024-06-02 20:58:02] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 1 ms to minimize.
[2024-06-02 20:58:02] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 0 ms to minimize.
[2024-06-02 20:58:02] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 1 ms to minimize.
[2024-06-02 20:58:02] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 2 ms to minimize.
[2024-06-02 20:58:04] [INFO ] Deduced a trap composed of 71 places in 93 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 6/206 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 165 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 493/686 variables, 193/399 constraints. Problems are: Problem set: 0 solved, 165 unsolved
SMT process timed out in 5326ms, After SMT, problems are : Problem set: 0 solved, 165 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 110 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
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 192 transition count 531
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 192 transition count 531
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 192 transition count 530
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 21 place count 192 transition count 521
Applied a total of 21 rules in 54 ms. Remains 192 /193 variables (removed 1) and now considering 521/542 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 192/193 places, 521/542 transitions.
RANDOM walk for 4000000 steps (124764 resets) in 37945 ms. (105 steps per ms) remains 117/165 properties
BEST_FIRST walk for 40004 steps (281 resets) in 288 ms. (138 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40001 steps (40 resets) in 126 ms. (314 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40002 steps (279 resets) in 118 ms. (336 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40003 steps (378 resets) in 88 ms. (449 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40004 steps (274 resets) in 86 ms. (459 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40002 steps (29 resets) in 143 ms. (277 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40003 steps (257 resets) in 88 ms. (449 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40003 steps (390 resets) in 88 ms. (449 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40002 steps (264 resets) in 86 ms. (459 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40002 steps (48 resets) in 81 ms. (487 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40002 steps (249 resets) in 93 ms. (425 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40004 steps (387 resets) in 122 ms. (325 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40002 steps (280 resets) in 107 ms. (370 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40003 steps (43 resets) in 117 ms. (339 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40003 steps (265 resets) in 103 ms. (384 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40001 steps (380 resets) in 84 ms. (470 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40004 steps (272 resets) in 84 ms. (470 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40004 steps (52 resets) in 81 ms. (487 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40004 steps (267 resets) in 89 ms. (444 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40004 steps (378 resets) in 85 ms. (465 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40004 steps (295 resets) in 89 ms. (444 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40002 steps (33 resets) in 92 ms. (430 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40003 steps (272 resets) in 87 ms. (454 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40004 steps (387 resets) in 86 ms. (459 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40003 steps (277 resets) in 86 ms. (459 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40004 steps (54 resets) in 92 ms. (430 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40004 steps (263 resets) in 98 ms. (404 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40003 steps (385 resets) in 85 ms. (465 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40003 steps (284 resets) in 88 ms. (449 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40004 steps (40 resets) in 81 ms. (487 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40003 steps (276 resets) in 89 ms. (444 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40002 steps (369 resets) in 83 ms. (476 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40003 steps (273 resets) in 87 ms. (454 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40003 steps (48 resets) in 79 ms. (500 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40004 steps (274 resets) in 87 ms. (454 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40004 steps (35 resets) in 112 ms. (354 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40002 steps (264 resets) in 85 ms. (465 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40004 steps (278 resets) in 83 ms. (476 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40003 steps (283 resets) in 90 ms. (439 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40003 steps (256 resets) in 87 ms. (454 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40004 steps (272 resets) in 81 ms. (487 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40002 steps (44 resets) in 90 ms. (439 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40003 steps (259 resets) in 101 ms. (392 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40004 steps (380 resets) in 83 ms. (476 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40003 steps (284 resets) in 84 ms. (470 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40002 steps (55 resets) in 79 ms. (500 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40003 steps (254 resets) in 84 ms. (470 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40003 steps (380 resets) in 83 ms. (476 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40003 steps (282 resets) in 91 ms. (434 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40004 steps (48 resets) in 116 ms. (341 steps per ms) remains 117/117 properties
[2024-06-02 20:58:17] [INFO ] Flow matrix only has 487 transitions (discarded 34 similar events)
// Phase 1: matrix 487 rows 192 cols
[2024-06-02 20:58:17] [INFO ] Computed 7 invariants in 9 ms
[2024-06-02 20:58:17] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 113/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-06-02 20:58:18] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 2 ms to minimize.
[2024-06-02 20:58:18] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-06-02 20:58:18] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 1 ms to minimize.
[2024-06-02 20:58:18] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 2 ms to minimize.
[2024-06-02 20:58:18] [INFO ] Deduced a trap composed of 67 places in 94 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 487/676 variables, 189/201 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/676 variables, 74/275 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/676 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (OVERLAPS) 3/679 variables, 3/278 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/679 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 9 (OVERLAPS) 0/679 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 679/679 variables, and 278 constraints, problems are : Problem set: 0 solved, 117 unsolved in 9169 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 192/192 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 113/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 487/676 variables, 189/201 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/676 variables, 74/275 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/676 variables, 117/392 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-06-02 20:58:30] [INFO ] Deduced a trap composed of 43 places in 56 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/676 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-06-02 20:58:35] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 0 ms to minimize.
[2024-06-02 20:58:36] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/676 variables, 2/395 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/676 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 10 (OVERLAPS) 3/679 variables, 3/398 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/679 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 12 (OVERLAPS) 0/679 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 679/679 variables, and 398 constraints, problems are : Problem set: 0 solved, 117 unsolved in 39267 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 192/192 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 8/8 constraints]
After SMT, in 48607ms problems are : Problem set: 0 solved, 117 unsolved
Parikh walk visited 0 properties in 1702 ms.
Support contains 76 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 521/521 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 190 transition count 517
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 190 transition count 517
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 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 7 place count 189 transition count 514
Applied a total of 7 rules in 42 ms. Remains 189 /192 variables (removed 3) and now considering 514/521 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 189/192 places, 514/521 transitions.
RANDOM walk for 4000000 steps (127953 resets) in 41859 ms. (95 steps per ms) remains 109/117 properties
BEST_FIRST walk for 40004 steps (262 resets) in 150 ms. (264 steps per ms) remains 109/109 properties
BEST_FIRST walk for 40003 steps (46 resets) in 100 ms. (396 steps per ms) remains 109/109 properties
BEST_FIRST walk for 40003 steps (250 resets) in 103 ms. (384 steps per ms) remains 109/109 properties
BEST_FIRST walk for 40003 steps (377 resets) in 113 ms. (350 steps per ms) remains 109/109 properties
BEST_FIRST walk for 40003 steps (290 resets) in 99 ms. (400 steps per ms) remains 109/109 properties
BEST_FIRST walk for 40003 steps (45 resets) in 76 ms. (519 steps per ms) remains 109/109 properties
BEST_FIRST walk for 40002 steps (278 resets) in 80 ms. (493 steps per ms) remains 109/109 properties
BEST_FIRST walk for 40004 steps (366 resets) in 84 ms. (470 steps per ms) remains 109/109 properties
BEST_FIRST walk for 40003 steps (262 resets) in 80 ms. (493 steps per ms) remains 109/109 properties
BEST_FIRST walk for 40001 steps (39 resets) in 106 ms. (373 steps per ms) remains 109/109 properties
BEST_FIRST walk for 40002 steps (277 resets) in 101 ms. (392 steps per ms) remains 109/109 properties
BEST_FIRST walk for 40004 steps (386 resets) in 82 ms. (481 steps per ms) remains 109/109 properties
BEST_FIRST walk for 40003 steps (266 resets) in 81 ms. (487 steps per ms) remains 109/109 properties
BEST_FIRST walk for 40003 steps (42 resets) in 79 ms. (500 steps per ms) remains 109/109 properties
BEST_FIRST walk for 40004 steps (276 resets) in 93 ms. (425 steps per ms) remains 109/109 properties
BEST_FIRST walk for 40002 steps (380 resets) in 78 ms. (506 steps per ms) remains 109/109 properties
BEST_FIRST walk for 40004 steps (285 resets) in 81 ms. (487 steps per ms) remains 109/109 properties
BEST_FIRST walk for 40003 steps (45 resets) in 82 ms. (481 steps per ms) remains 109/109 properties
BEST_FIRST walk for 40003 steps (259 resets) in 83 ms. (476 steps per ms) remains 109/109 properties
BEST_FIRST walk for 40003 steps (386 resets) in 79 ms. (500 steps per ms) remains 109/109 properties
BEST_FIRST walk for 40003 steps (277 resets) in 78 ms. (506 steps per ms) remains 109/109 properties
BEST_FIRST walk for 40003 steps (52 resets) in 76 ms. (519 steps per ms) remains 109/109 properties
BEST_FIRST walk for 40003 steps (277 resets) in 81 ms. (487 steps per ms) remains 109/109 properties
BEST_FIRST walk for 40004 steps (383 resets) in 77 ms. (512 steps per ms) remains 109/109 properties
BEST_FIRST walk for 40003 steps (279 resets) in 77 ms. (512 steps per ms) remains 109/109 properties
BEST_FIRST walk for 40004 steps (57 resets) in 75 ms. (526 steps per ms) remains 109/109 properties
BEST_FIRST walk for 40004 steps (276 resets) in 82 ms. (481 steps per ms) remains 109/109 properties
BEST_FIRST walk for 40003 steps (369 resets) in 86 ms. (459 steps per ms) remains 109/109 properties
BEST_FIRST walk for 40004 steps (284 resets) in 80 ms. (493 steps per ms) remains 109/109 properties
BEST_FIRST walk for 40003 steps (285 resets) in 78 ms. (506 steps per ms) remains 109/109 properties
BEST_FIRST walk for 40004 steps (278 resets) in 81 ms. (487 steps per ms) remains 109/109 properties
BEST_FIRST walk for 40004 steps (274 resets) in 77 ms. (512 steps per ms) remains 109/109 properties
BEST_FIRST walk for 40004 steps (280 resets) in 78 ms. (506 steps per ms) remains 109/109 properties
BEST_FIRST walk for 40003 steps (273 resets) in 79 ms. (500 steps per ms) remains 108/109 properties
BEST_FIRST walk for 40004 steps (278 resets) in 79 ms. (500 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (247 resets) in 80 ms. (493 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (282 resets) in 80 ms. (493 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (56 resets) in 85 ms. (465 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (252 resets) in 82 ms. (481 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (383 resets) in 77 ms. (512 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (272 resets) in 78 ms. (506 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (39 resets) in 83 ms. (476 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (264 resets) in 83 ms. (476 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (376 resets) in 80 ms. (493 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (275 resets) in 82 ms. (481 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (52 resets) in 74 ms. (533 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (253 resets) in 81 ms. (487 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (386 resets) in 81 ms. (487 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (290 resets) in 79 ms. (500 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (35 resets) in 101 ms. (392 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (261 resets) in 91 ms. (434 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (394 resets) in 80 ms. (493 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (296 resets) in 77 ms. (512 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (42 resets) in 93 ms. (425 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (253 resets) in 80 ms. (493 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (387 resets) in 78 ms. (506 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (287 resets) in 80 ms. (493 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (51 resets) in 88 ms. (449 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (260 resets) in 88 ms. (449 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (393 resets) in 79 ms. (500 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (273 resets) in 83 ms. (476 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (52 resets) in 76 ms. (519 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (256 resets) in 79 ms. (500 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (388 resets) in 79 ms. (500 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (266 resets) in 81 ms. (487 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (47 resets) in 101 ms. (392 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (49 resets) in 92 ms. (430 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (272 resets) in 86 ms. (459 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (261 resets) in 79 ms. (500 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (273 resets) in 79 ms. (500 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (291 resets) in 79 ms. (500 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (49 resets) in 80 ms. (493 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (272 resets) in 87 ms. (454 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (405 resets) in 77 ms. (512 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (281 resets) in 79 ms. (500 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (56 resets) in 81 ms. (487 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (279 resets) in 82 ms. (481 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (375 resets) in 81 ms. (487 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (278 resets) in 78 ms. (506 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (45 resets) in 90 ms. (439 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (285 resets) in 88 ms. (449 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (372 resets) in 79 ms. (500 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (279 resets) in 81 ms. (487 steps per ms) remains 108/108 properties
Interrupted probabilistic random walk after 5747887 steps, run timeout after 45001 ms. (steps per millisecond=127 ) properties seen :27 out of 108
Probabilistic random walk after 5747887 steps, saw 1226715 distinct states, run finished after 45015 ms. (steps per millisecond=127 ) properties seen :27
[2024-06-02 21:00:08] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
// Phase 1: matrix 480 rows 189 cols
[2024-06-02 21:00:08] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 21:00:08] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 128/186 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-06-02 21:00:08] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 1 ms to minimize.
[2024-06-02 21:00:08] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 0 ms to minimize.
[2024-06-02 21:00:08] [INFO ] Deduced a trap composed of 33 places in 28 ms of which 0 ms to minimize.
[2024-06-02 21:00:09] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 1 ms to minimize.
[2024-06-02 21:00:09] [INFO ] Deduced a trap composed of 65 places in 92 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (OVERLAPS) 480/666 variables, 186/198 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/666 variables, 71/269 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/666 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (OVERLAPS) 3/669 variables, 3/272 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/669 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-06-02 21:00:13] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 1 ms to minimize.
[2024-06-02 21:00:13] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/669 variables, 2/274 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/669 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-06-02 21:00:15] [INFO ] Deduced a trap composed of 45 places in 42 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/669 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/669 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 13 (OVERLAPS) 0/669 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 669/669 variables, and 275 constraints, problems are : Problem set: 0 solved, 81 unsolved in 9549 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 128/186 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (OVERLAPS) 480/666 variables, 186/201 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/666 variables, 71/272 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/666 variables, 81/353 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/666 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (OVERLAPS) 3/669 variables, 3/356 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/669 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-06-02 21:00:26] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 1 ms to minimize.
[2024-06-02 21:00:27] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/669 variables, 2/358 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-06-02 21:00:31] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/669 variables, 1/359 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/669 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 13 (OVERLAPS) 0/669 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 669/669 variables, and 359 constraints, problems are : Problem set: 0 solved, 81 unsolved in 24572 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 11/11 constraints]
After SMT, in 34253ms problems are : Problem set: 0 solved, 81 unsolved
Parikh walk visited 1 properties in 7000 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 26 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 26 ms. Remains : 189/189 places, 514/514 transitions.
RANDOM walk for 4000000 steps (128408 resets) in 37628 ms. (106 steps per ms) remains 79/80 properties
BEST_FIRST walk for 400003 steps (2785 resets) in 745 ms. (536 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400002 steps (196 resets) in 2182 ms. (183 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (2729 resets) in 751 ms. (531 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (3861 resets) in 707 ms. (564 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (2806 resets) in 712 ms. (561 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400002 steps (88 resets) in 1506 ms. (265 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (2603 resets) in 1100 ms. (363 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (3907 resets) in 1198 ms. (333 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (2783 resets) in 1244 ms. (321 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400001 steps (196 resets) in 2162 ms. (184 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (2663 resets) in 1248 ms. (320 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (3817 resets) in 937 ms. (426 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (2762 resets) in 939 ms. (425 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400002 steps (147 resets) in 2184 ms. (183 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400002 steps (2727 resets) in 887 ms. (450 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (3914 resets) in 1333 ms. (299 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (2798 resets) in 1339 ms. (298 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400002 steps (102 resets) in 2298 ms. (173 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (2700 resets) in 1058 ms. (377 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (3855 resets) in 895 ms. (446 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400002 steps (2842 resets) in 716 ms. (557 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400002 steps (162 resets) in 1366 ms. (292 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (2660 resets) in 714 ms. (559 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (3849 resets) in 697 ms. (573 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (2715 resets) in 713 ms. (560 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (3856 resets) in 693 ms. (576 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (2854 resets) in 708 ms. (564 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (125 resets) in 1571 ms. (254 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (2667 resets) in 703 ms. (568 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (3857 resets) in 695 ms. (574 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (2796 resets) in 684 ms. (583 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (165 resets) in 1225 ms. (326 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (2699 resets) in 711 ms. (561 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (3852 resets) in 680 ms. (587 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (2760 resets) in 705 ms. (566 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400002 steps (187 resets) in 1324 ms. (301 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (2653 resets) in 728 ms. (548 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (3867 resets) in 862 ms. (463 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400002 steps (2813 resets) in 837 ms. (477 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400001 steps (259 resets) in 1395 ms. (286 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (2713 resets) in 693 ms. (576 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (3871 resets) in 659 ms. (606 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (2819 resets) in 664 ms. (601 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400002 steps (180 resets) in 1409 ms. (283 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (2709 resets) in 670 ms. (596 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (3849 resets) in 650 ms. (614 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (2740 resets) in 650 ms. (614 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400002 steps (168 resets) in 1342 ms. (297 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (2708 resets) in 688 ms. (580 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (3872 resets) in 656 ms. (608 steps per ms) remains 79/79 properties
Interrupted probabilistic random walk after 10737968 steps, run timeout after 78001 ms. (steps per millisecond=137 ) properties seen :0 out of 79
Probabilistic random walk after 10737968 steps, saw 2336398 distinct states, run finished after 78002 ms. (steps per millisecond=137 ) properties seen :0
[2024-06-02 21:02:34] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
[2024-06-02 21:02:34] [INFO ] Invariant cache hit.
[2024-06-02 21:02: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, 79 unsolved
At refinement iteration 1 (OVERLAPS) 126/180 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-06-02 21:02:34] [INFO ] Deduced a trap composed of 33 places in 30 ms of which 1 ms to minimize.
[2024-06-02 21:02:34] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 1 ms to minimize.
[2024-06-02 21:02:35] [INFO ] Deduced a trap composed of 69 places in 91 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (OVERLAPS) 478/658 variables, 180/188 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/658 variables, 71/259 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/658 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (OVERLAPS) 11/669 variables, 9/268 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/669 variables, 2/270 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-06-02 21:02:38] [INFO ] Deduced a trap composed of 67 places in 94 ms of which 3 ms to minimize.
[2024-06-02 21:02:38] [INFO ] Deduced a trap composed of 65 places in 86 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/669 variables, 2/272 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/669 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 11 (OVERLAPS) 0/669 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 669/669 variables, and 272 constraints, problems are : Problem set: 0 solved, 79 unsolved in 7173 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 126/180 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (OVERLAPS) 478/658 variables, 180/190 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/658 variables, 71/261 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/658 variables, 77/338 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/658 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 11/669 variables, 9/347 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/669 variables, 2/349 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/669 variables, 2/351 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-06-02 21:02:46] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 1 ms to minimize.
[2024-06-02 21:02:46] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-06-02 21:02:46] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/669 variables, 3/354 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-06-02 21:02:50] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/669 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/669 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 14 (OVERLAPS) 0/669 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 669/669 variables, and 355 constraints, problems are : Problem set: 0 solved, 79 unsolved in 15012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 9/9 constraints]
After SMT, in 22279ms problems are : Problem set: 0 solved, 79 unsolved
Parikh walk visited 0 properties in 4639 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 11 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.
RANDOM walk for 4000000 steps (128255 resets) in 33401 ms. (119 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (2761 resets) in 697 ms. (573 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (246 resets) in 1309 ms. (305 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400002 steps (2782 resets) in 716 ms. (557 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (3885 resets) in 693 ms. (576 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400001 steps (2816 resets) in 717 ms. (557 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400002 steps (193 resets) in 1521 ms. (262 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (2654 resets) in 720 ms. (554 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (3859 resets) in 665 ms. (600 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (2802 resets) in 699 ms. (571 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400002 steps (55 resets) in 1581 ms. (252 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (2754 resets) in 710 ms. (562 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (3879 resets) in 686 ms. (582 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400002 steps (2760 resets) in 673 ms. (593 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (152 resets) in 1344 ms. (297 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400002 steps (2640 resets) in 698 ms. (572 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (3833 resets) in 683 ms. (584 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (2768 resets) in 691 ms. (578 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (113 resets) in 1541 ms. (259 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (2683 resets) in 694 ms. (575 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (3864 resets) in 668 ms. (597 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (2769 resets) in 722 ms. (553 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400001 steps (60 resets) in 1488 ms. (268 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (2725 resets) in 711 ms. (561 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (3878 resets) in 665 ms. (600 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (2647 resets) in 682 ms. (585 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (3847 resets) in 668 ms. (597 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (2792 resets) in 685 ms. (583 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (121 resets) in 1465 ms. (272 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400002 steps (2734 resets) in 690 ms. (578 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (3825 resets) in 664 ms. (601 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (2812 resets) in 656 ms. (608 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400001 steps (183 resets) in 1364 ms. (293 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (2670 resets) in 708 ms. (564 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400002 steps (3890 resets) in 669 ms. (597 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (2704 resets) in 671 ms. (595 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (60 resets) in 1440 ms. (277 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (2685 resets) in 706 ms. (565 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (3823 resets) in 659 ms. (606 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (2845 resets) in 669 ms. (597 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400000 steps (167 resets) in 1441 ms. (277 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (2721 resets) in 674 ms. (592 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (3869 resets) in 1241 ms. (322 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400002 steps (2816 resets) in 1515 ms. (263 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (105 resets) in 2718 ms. (147 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (2712 resets) in 1268 ms. (315 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (3892 resets) in 1229 ms. (325 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (2785 resets) in 1264 ms. (316 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (91 resets) in 2648 ms. (151 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (2641 resets) in 1246 ms. (320 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (3868 resets) in 1258 ms. (317 steps per ms) remains 79/79 properties
Interrupted probabilistic random walk after 10637899 steps, run timeout after 75001 ms. (steps per millisecond=141 ) properties seen :0 out of 79
Probabilistic random walk after 10637899 steps, saw 2312291 distinct states, run finished after 75003 ms. (steps per millisecond=141 ) properties seen :0
[2024-06-02 21:04:42] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
[2024-06-02 21:04:42] [INFO ] Invariant cache hit.
[2024-06-02 21:04:42] [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, 79 unsolved
At refinement iteration 1 (OVERLAPS) 126/180 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-06-02 21:04:42] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 5 ms to minimize.
[2024-06-02 21:04:42] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 2 ms to minimize.
[2024-06-02 21:04:43] [INFO ] Deduced a trap composed of 69 places in 94 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (OVERLAPS) 478/658 variables, 180/188 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/658 variables, 71/259 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/658 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (OVERLAPS) 11/669 variables, 9/268 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/669 variables, 2/270 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-06-02 21:04:46] [INFO ] Deduced a trap composed of 67 places in 102 ms of which 1 ms to minimize.
[2024-06-02 21:04:46] [INFO ] Deduced a trap composed of 65 places in 92 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/669 variables, 2/272 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/669 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 11 (OVERLAPS) 0/669 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 669/669 variables, and 272 constraints, problems are : Problem set: 0 solved, 79 unsolved in 7391 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 126/180 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (OVERLAPS) 478/658 variables, 180/190 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/658 variables, 71/261 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/658 variables, 77/338 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/658 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 11/669 variables, 9/347 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/669 variables, 2/349 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/669 variables, 2/351 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-06-02 21:04:54] [INFO ] Deduced a trap composed of 33 places in 85 ms of which 2 ms to minimize.
[2024-06-02 21:04:54] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-06-02 21:04:54] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/669 variables, 3/354 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-06-02 21:04:58] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/669 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/669 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 14 (OVERLAPS) 0/669 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 669/669 variables, and 355 constraints, problems are : Problem set: 0 solved, 79 unsolved in 15456 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 9/9 constraints]
After SMT, in 22976ms problems are : Problem set: 0 solved, 79 unsolved
Parikh walk visited 0 properties in 5236 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 11 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 11 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 8 ms. Remains 189 /189 variables (removed 0) and now considering 514/514 (removed 0) transitions.
[2024-06-02 21:05:10] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
[2024-06-02 21:05:10] [INFO ] Invariant cache hit.
[2024-06-02 21:05:10] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-02 21:05:10] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
[2024-06-02 21:05:10] [INFO ] Invariant cache hit.
[2024-06-02 21:05:10] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-06-02 21:05:10] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
[2024-06-02 21:05:10] [INFO ] Redundant transitions in 29 ms returned []
Running 508 sub problems to find dead transitions.
[2024-06-02 21:05:10] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
[2024-06-02 21:05:10] [INFO ] Invariant cache hit.
[2024-06-02 21:05: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 21:05:13] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 0 ms to minimize.
[2024-06-02 21:05:13] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
[2024-06-02 21:05:13] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 0 ms to minimize.
[2024-06-02 21:05:13] [INFO ] Deduced a trap composed of 71 places in 97 ms of which 2 ms to minimize.
[2024-06-02 21:05:13] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 2 ms to minimize.
[2024-06-02 21:05:13] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 1 ms to minimize.
[2024-06-02 21:05:14] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 3 ms to minimize.
[2024-06-02 21:05:14] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 1 ms to minimize.
[2024-06-02 21:05:16] [INFO ] Deduced a trap composed of 17 places in 85 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 21:05:27] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 1 ms to minimize.
[2024-06-02 21:05:27] [INFO ] Deduced a trap composed of 45 places in 42 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 29927 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 21:05:48] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 0 ms to minimize.
[2024-06-02 21:05:48] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 0 ms to minimize.
[2024-06-02 21:05:49] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 9 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 30032 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 60526ms problems are : Problem set: 0 solved, 508 unsolved
Search for dead transitions found 0 dead transitions in 60535ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60962 ms. Remains : 189/189 places, 514/514 transitions.
RANDOM walk for 400000 steps (12887 resets) in 3223 ms. (124 steps per ms) remains 43/54 properties
Running SMT prover for 43 properties.
[2024-06-02 21:06:12] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
[2024-06-02 21:06:12] [INFO ] Invariant cache hit.
[2024-06-02 21:06:12] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 21:06:12] [INFO ] After 125ms SMT Verify possible using state equation in real domain returned unsat :0 sat :43
[2024-06-02 21:06:12] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-06-02 21:06:12] [INFO ] After 89ms SMT Verify possible using 71 Read/Feed constraints in real domain returned unsat :0 sat :43
TRAPS : Iteration 0
[2024-06-02 21:06:13] [INFO ] After 1104ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:43
[2024-06-02 21:06:13] [INFO ] After 1302ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:43
[2024-06-02 21:06:13] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2024-06-02 21:06:13] [INFO ] After 121ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :43
[2024-06-02 21:06:13] [INFO ] After 87ms SMT Verify possible using 71 Read/Feed constraints in natural domain returned unsat :0 sat :43
TRAPS : Iteration 0
[2024-06-02 21:06:13] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2024-06-02 21:06:14] [INFO ] Deduced a trap composed of 41 places in 34 ms of which 1 ms to minimize.
[2024-06-02 21:06:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 143 ms
[2024-06-02 21:06:14] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
[2024-06-02 21:06:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2024-06-02 21:06:14] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
[2024-06-02 21:06:14] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
[2024-06-02 21:06:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 121 ms
TRAPS : Iteration 1
[2024-06-02 21:06:15] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 2 ms to minimize.
[2024-06-02 21:06:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2024-06-02 21:06:16] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 3 ms to minimize.
[2024-06-02 21:06:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2024-06-02 21:06:16] [INFO ] Deduced a trap composed of 71 places in 99 ms of which 1 ms to minimize.
[2024-06-02 21:06:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
TRAPS : Iteration 2
[2024-06-02 21:06:16] [INFO ] Deduced a trap composed of 54 places in 94 ms of which 1 ms to minimize.
[2024-06-02 21:06:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
TRAPS : Iteration 3
[2024-06-02 21:06:18] [INFO ] After 4862ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :43
[2024-06-02 21:06:18] [INFO ] After 5122ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :43
RANDOM walk for 4000000 steps (128407 resets) in 46301 ms. (86 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (2732 resets) in 1073 ms. (372 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400002 steps (269 resets) in 1919 ms. (208 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (2638 resets) in 1234 ms. (323 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (3860 resets) in 1096 ms. (364 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400001 steps (2734 resets) in 1053 ms. (379 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (83 resets) in 2204 ms. (181 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400002 steps (2768 resets) in 1016 ms. (393 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (3867 resets) in 1106 ms. (361 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (2791 resets) in 1148 ms. (348 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400001 steps (182 resets) in 2362 ms. (169 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (2708 resets) in 1043 ms. (383 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (3872 resets) in 1115 ms. (358 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (2813 resets) in 993 ms. (402 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400002 steps (145 resets) in 2064 ms. (193 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (2671 resets) in 1364 ms. (293 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (3821 resets) in 1193 ms. (335 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400002 steps (2792 resets) in 1038 ms. (384 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400002 steps (159 resets) in 2175 ms. (183 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (2705 resets) in 1109 ms. (360 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400000 steps (3821 resets) in 1066 ms. (374 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (2791 resets) in 1298 ms. (307 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (78 resets) in 1990 ms. (200 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (2669 resets) in 1007 ms. (396 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (3878 resets) in 1059 ms. (377 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (2674 resets) in 1031 ms. (387 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400002 steps (3859 resets) in 884 ms. (451 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400002 steps (2722 resets) in 1263 ms. (316 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (160 resets) in 2068 ms. (193 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (2714 resets) in 966 ms. (413 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (3855 resets) in 1090 ms. (366 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400002 steps (2842 resets) in 1102 ms. (362 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400002 steps (105 resets) in 1906 ms. (209 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (2753 resets) in 1046 ms. (382 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (3873 resets) in 984 ms. (406 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (2775 resets) in 1321 ms. (302 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (179 resets) in 2164 ms. (184 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (2657 resets) in 1047 ms. (381 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (3851 resets) in 1104 ms. (361 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (2859 resets) in 1300 ms. (307 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400002 steps (116 resets) in 1766 ms. (226 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400002 steps (2718 resets) in 1024 ms. (390 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (3879 resets) in 1107 ms. (361 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400001 steps (2781 resets) in 1280 ms. (312 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400000 steps (137 resets) in 1816 ms. (220 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (2659 resets) in 1014 ms. (394 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400002 steps (3861 resets) in 1299 ms. (307 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (2783 resets) in 1061 ms. (376 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400002 steps (159 resets) in 2123 ms. (188 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400004 steps (2711 resets) in 880 ms. (454 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (3813 resets) in 1080 ms. (370 steps per ms) remains 79/79 properties
Interrupted probabilistic random walk after 15029838 steps, run timeout after 111001 ms. (steps per millisecond=135 ) properties seen :0 out of 79
Probabilistic random walk after 15029838 steps, saw 3296617 distinct states, run finished after 111002 ms. (steps per millisecond=135 ) properties seen :0
[2024-06-02 21:08:46] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
[2024-06-02 21:08:46] [INFO ] Invariant cache hit.
[2024-06-02 21:08:46] [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, 79 unsolved
At refinement iteration 1 (OVERLAPS) 126/180 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-06-02 21:08:47] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
[2024-06-02 21:08:47] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 1 ms to minimize.
[2024-06-02 21:08:47] [INFO ] Deduced a trap composed of 69 places in 91 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (OVERLAPS) 478/658 variables, 180/188 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/658 variables, 71/259 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/658 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (OVERLAPS) 11/669 variables, 9/268 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/669 variables, 2/270 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-06-02 21:08:50] [INFO ] Deduced a trap composed of 67 places in 93 ms of which 1 ms to minimize.
[2024-06-02 21:08:51] [INFO ] Deduced a trap composed of 65 places in 95 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/669 variables, 2/272 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/669 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 11 (OVERLAPS) 0/669 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 669/669 variables, and 272 constraints, problems are : Problem set: 0 solved, 79 unsolved in 7193 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 126/180 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (OVERLAPS) 478/658 variables, 180/190 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/658 variables, 71/261 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/658 variables, 77/338 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/658 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 11/669 variables, 9/347 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/669 variables, 2/349 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/669 variables, 2/351 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-06-02 21:08:58] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2024-06-02 21:08:59] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2024-06-02 21:08:59] [INFO ] Deduced a trap composed of 41 places in 38 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/669 variables, 3/354 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-06-02 21:09:02] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/669 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/669 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 14 (OVERLAPS) 0/669 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 669/669 variables, and 355 constraints, problems are : Problem set: 0 solved, 79 unsolved in 15621 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 9/9 constraints]
After SMT, in 22928ms problems are : Problem set: 0 solved, 79 unsolved
Parikh walk visited 0 properties in 4706 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 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 8 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 8 ms. Remains 189 /189 variables (removed 0) and now considering 514/514 (removed 0) transitions.
[2024-06-02 21:09:14] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
[2024-06-02 21:09:14] [INFO ] Invariant cache hit.
[2024-06-02 21:09:14] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-02 21:09:14] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
[2024-06-02 21:09:14] [INFO ] Invariant cache hit.
[2024-06-02 21:09:14] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-06-02 21:09:14] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
[2024-06-02 21:09:14] [INFO ] Redundant transitions in 7 ms returned []
Running 508 sub problems to find dead transitions.
[2024-06-02 21:09:14] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
[2024-06-02 21:09:14] [INFO ] Invariant cache hit.
[2024-06-02 21:09:14] [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 21:09:17] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-06-02 21:09:17] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 0 ms to minimize.
[2024-06-02 21:09:17] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-06-02 21:09:17] [INFO ] Deduced a trap composed of 71 places in 142 ms of which 1 ms to minimize.
[2024-06-02 21:09:17] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 2 ms to minimize.
[2024-06-02 21:09:17] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 2 ms to minimize.
[2024-06-02 21:09:18] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 2 ms to minimize.
[2024-06-02 21:09:18] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 2 ms to minimize.
[2024-06-02 21:09:19] [INFO ] Deduced a trap composed of 17 places in 81 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 21:09:30] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 1 ms to minimize.
[2024-06-02 21:09:30] [INFO ] Deduced a trap composed of 45 places in 42 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 29674 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 21:09:52] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 0 ms to minimize.
[2024-06-02 21:09:52] [INFO ] Deduced a trap composed of 41 places in 36 ms of which 0 ms to minimize.
[2024-06-02 21:09:52] [INFO ] Deduced a trap composed of 41 places in 40 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 30023 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 60207ms problems are : Problem set: 0 solved, 508 unsolved
Search for dead transitions found 0 dead transitions in 60212ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60611 ms. Remains : 189/189 places, 514/514 transitions.
RANDOM walk for 400000 steps (12925 resets) in 3263 ms. (122 steps per ms) remains 43/54 properties
Running SMT prover for 43 properties.
[2024-06-02 21:10:16] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
[2024-06-02 21:10:16] [INFO ] Invariant cache hit.
[2024-06-02 21:10:16] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 21:10:16] [INFO ] After 128ms SMT Verify possible using state equation in real domain returned unsat :0 sat :43
[2024-06-02 21:10:16] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-06-02 21:10:16] [INFO ] After 92ms SMT Verify possible using 71 Read/Feed constraints in real domain returned unsat :0 sat :43
TRAPS : Iteration 0
[2024-06-02 21:10:17] [INFO ] After 1122ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:43
[2024-06-02 21:10:17] [INFO ] After 1326ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:43
[2024-06-02 21:10:17] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 21:10:17] [INFO ] After 126ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :43
[2024-06-02 21:10:17] [INFO ] After 85ms SMT Verify possible using 71 Read/Feed constraints in natural domain returned unsat :0 sat :43
TRAPS : Iteration 0
[2024-06-02 21:10:17] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-06-02 21:10:17] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 1 ms to minimize.
[2024-06-02 21:10:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 131 ms
[2024-06-02 21:10:18] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 1 ms to minimize.
[2024-06-02 21:10:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2024-06-02 21:10:18] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 0 ms to minimize.
[2024-06-02 21:10:18] [INFO ] Deduced a trap composed of 41 places in 38 ms of which 1 ms to minimize.
[2024-06-02 21:10:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 131 ms
TRAPS : Iteration 1
[2024-06-02 21:10:19] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 1 ms to minimize.
[2024-06-02 21:10:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2024-06-02 21:10:19] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 1 ms to minimize.
[2024-06-02 21:10:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2024-06-02 21:10:20] [INFO ] Deduced a trap composed of 71 places in 98 ms of which 1 ms to minimize.
[2024-06-02 21:10:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
TRAPS : Iteration 2
[2024-06-02 21:10:20] [INFO ] Deduced a trap composed of 54 places in 96 ms of which 1 ms to minimize.
[2024-06-02 21:10:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
TRAPS : Iteration 3
[2024-06-02 21:10:22] [INFO ] After 4770ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :43
[2024-06-02 21:10:22] [INFO ] After 5025ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :43
RANDOM walk for 86 steps (0 resets) in 5 ms. (14 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (1226 resets) in 287 ms. (138 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (268 resets) in 100 ms. (396 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1275117 steps, run timeout after 3001 ms. (steps per millisecond=424 ) properties seen :0 out of 1
Probabilistic random walk after 1275117 steps, saw 305628 distinct states, run finished after 3001 ms. (steps per millisecond=424 ) properties seen :0
[2024-06-02 21:10:25] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
[2024-06-02 21:10:25] [INFO ] Invariant cache hit.
[2024-06-02 21:10:25] [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 226 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 236 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 469ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 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 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 184 transition count 502
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 184 transition count 502
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 182 transition count 498
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 182 transition count 498
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 180 transition count 492
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 180 transition count 492
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 178 transition count 488
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 178 transition count 488
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 176 transition count 482
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 176 transition count 482
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 174 transition count 478
Iterating global reduction 0 with 2 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 454
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 164 transition count 454
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 162 transition count 450
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 162 transition count 450
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 57 place count 162 transition count 456
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 66 place count 159 transition count 450
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 72 place count 159 transition count 444
Applied a total of 72 rules in 64 ms. Remains 159 /189 variables (removed 30) and now considering 444/514 (removed 70) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 159/189 places, 444/514 transitions.
RANDOM walk for 40000 steps (1270 resets) in 370 ms. (107 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (279 resets) in 89 ms. (444 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1327124 steps, run timeout after 3001 ms. (steps per millisecond=442 ) properties seen :0 out of 1
Probabilistic random walk after 1327124 steps, saw 323594 distinct states, run finished after 3001 ms. (steps per millisecond=442 ) properties seen :0
[2024-06-02 21:10:29] [INFO ] Flow matrix only has 407 transitions (discarded 37 similar events)
// Phase 1: matrix 407 rows 159 cols
[2024-06-02 21:10:29] [INFO ] Computed 7 invariants in 8 ms
[2024-06-02 21:10:29] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 148/199 variables, 51/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 187/386 variables, 16/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 23/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/387 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/387 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/387 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 159/546 variables, 79/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/546 variables, 2/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/546 variables, 38/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/546 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 18/564 variables, 10/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/564 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/564 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/566 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 227 constraints, problems are : Problem set: 0 solved, 1 unsolved in 196 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 61/61 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) 50/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 148/199 variables, 51/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 187/386 variables, 16/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 23/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/386 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/387 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/387 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/387 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 159/546 variables, 79/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/546 variables, 2/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/546 variables, 38/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/546 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/564 variables, 10/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/564 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/564 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/566 variables, 2/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/566 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/566 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 566/566 variables, and 228 constraints, problems are : Problem set: 0 solved, 1 unsolved in 188 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 396ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 444/444 transitions.
Applied a total of 0 rules in 9 ms. Remains 159 /159 variables (removed 0) and now considering 444/444 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 159/159 places, 444/444 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 444/444 transitions.
Applied a total of 0 rules in 7 ms. Remains 159 /159 variables (removed 0) and now considering 444/444 (removed 0) transitions.
[2024-06-02 21:10:29] [INFO ] Flow matrix only has 407 transitions (discarded 37 similar events)
[2024-06-02 21:10:29] [INFO ] Invariant cache hit.
[2024-06-02 21:10:29] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-02 21:10:29] [INFO ] Flow matrix only has 407 transitions (discarded 37 similar events)
[2024-06-02 21:10:29] [INFO ] Invariant cache hit.
[2024-06-02 21:10:29] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 21:10:29] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
[2024-06-02 21:10:29] [INFO ] Redundant transitions in 2 ms returned []
Running 438 sub problems to find dead transitions.
[2024-06-02 21:10:29] [INFO ] Flow matrix only has 407 transitions (discarded 37 similar events)
[2024-06-02 21:10:29] [INFO ] Invariant cache hit.
[2024-06-02 21:10:29] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-02 21:10:31] [INFO ] Deduced a trap composed of 59 places in 81 ms of which 1 ms to minimize.
[2024-06-02 21:10:31] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2024-06-02 21:10:31] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 1 ms to minimize.
[2024-06-02 21:10:32] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
[2024-06-02 21:10:32] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2024-06-02 21:10:32] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
[2024-06-02 21:10:32] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 0 ms to minimize.
[2024-06-02 21:10:33] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 1 ms to minimize.
[2024-06-02 21:10:33] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-06-02 21:10:33] [INFO ] Deduced a trap composed of 103 places in 84 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 3 (OVERLAPS) 407/566 variables, 159/176 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/566 variables, 61/237 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-02 21:10:38] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/566 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-02 21:10:45] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-06-02 21:10:45] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 0 ms to minimize.
[2024-06-02 21:10:45] [INFO ] Deduced a trap composed of 61 places in 90 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/566 variables, 3/241 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-02 21:10:49] [INFO ] Deduced a trap composed of 96 places in 91 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/566 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 9 (OVERLAPS) 0/566 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 438 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 242 constraints, problems are : Problem set: 0 solved, 438 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 438/438 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 438 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 3 (OVERLAPS) 407/566 variables, 159/181 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/566 variables, 61/242 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/566 variables, 438/680 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/566 variables, 0/680 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 7 (OVERLAPS) 0/566 variables, 0/680 constraints. Problems are: Problem set: 0 solved, 438 unsolved
No progress, stopping.
After SMT solving in domain Int declared 566/566 variables, and 680 constraints, problems are : Problem set: 0 solved, 438 unsolved in 29228 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 159/159 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 438/438 constraints, Known Traps: 15/15 constraints]
After SMT, in 59642ms problems are : Problem set: 0 solved, 438 unsolved
Search for dead transitions found 0 dead transitions in 59648ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59996 ms. Remains : 159/159 places, 444/444 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 143 edges and 159 vertex of which 29 / 159 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 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 133 transition count 299
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 133 transition count 290
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 132 transition count 289
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 132 transition count 288
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 131 transition count 287
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 130 transition count 242
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 130 transition count 242
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 130 transition count 227
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 121 transition count 224
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 121 transition count 224
Applied a total of 46 rules in 66 ms. Remains 121 /159 variables (removed 38) and now considering 224/444 (removed 220) transitions.
Running SMT prover for 1 properties.
[2024-06-02 21:11:29] [INFO ] Flow matrix only has 222 transitions (discarded 2 similar events)
// Phase 1: matrix 222 rows 121 cols
[2024-06-02 21:11:29] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 21:11:29] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 21:11:29] [INFO ] After 118ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:11:29] [INFO ] After 128ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-06-02 21:11:29] [INFO ] After 203ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 273 ms.
RANDOM walk for 153 steps (5 resets) in 4 ms. (30 steps per ms) remains 0/1 properties
RANDOM walk for 3495 steps (114 resets) in 13 ms. (249 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (1306 resets) in 165 ms. (240 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (288 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1228076 steps, run timeout after 3001 ms. (steps per millisecond=409 ) properties seen :0 out of 1
Probabilistic random walk after 1228076 steps, saw 296377 distinct states, run finished after 3001 ms. (steps per millisecond=409 ) properties seen :0
[2024-06-02 21:11:32] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
// Phase 1: matrix 480 rows 189 cols
[2024-06-02 21:11:33] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 21:11:33] [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 278 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 255 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 571ms 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 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 75 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 75 ms. Remains : 158/189 places, 441/514 transitions.
RANDOM walk for 40000 steps (1264 resets) in 145 ms. (273 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (273 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1407556 steps, run timeout after 3001 ms. (steps per millisecond=469 ) properties seen :0 out of 1
Probabilistic random walk after 1407556 steps, saw 341489 distinct states, run finished after 3001 ms. (steps per millisecond=469 ) properties seen :0
[2024-06-02 21:11:36] [INFO ] Flow matrix only has 404 transitions (discarded 37 similar events)
// Phase 1: matrix 404 rows 158 cols
[2024-06-02 21:11:36] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 21:11:36] [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 180 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 198 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 4 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 5 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 5 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 5 ms. Remains 158 /158 variables (removed 0) and now considering 441/441 (removed 0) transitions.
[2024-06-02 21:11:37] [INFO ] Flow matrix only has 404 transitions (discarded 37 similar events)
[2024-06-02 21:11:37] [INFO ] Invariant cache hit.
[2024-06-02 21:11:37] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-06-02 21:11:37] [INFO ] Flow matrix only has 404 transitions (discarded 37 similar events)
[2024-06-02 21:11:37] [INFO ] Invariant cache hit.
[2024-06-02 21:11:37] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 21:11:37] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
[2024-06-02 21:11:37] [INFO ] Redundant transitions in 3 ms returned []
Running 435 sub problems to find dead transitions.
[2024-06-02 21:11:37] [INFO ] Flow matrix only has 404 transitions (discarded 37 similar events)
[2024-06-02 21:11:37] [INFO ] Invariant cache hit.
[2024-06-02 21:11:37] [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 21:11:39] [INFO ] Deduced a trap composed of 56 places in 96 ms of which 1 ms to minimize.
[2024-06-02 21:11:39] [INFO ] Deduced a trap composed of 57 places in 90 ms of which 1 ms to minimize.
[2024-06-02 21:11:39] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2024-06-02 21:11:39] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 1 ms to minimize.
[2024-06-02 21:11:39] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 1 ms to minimize.
[2024-06-02 21:11:40] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2024-06-02 21:11:40] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 1 ms to minimize.
[2024-06-02 21:11:40] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-06-02 21:11:40] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 1 ms to minimize.
[2024-06-02 21:11:41] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
[2024-06-02 21:11:41] [INFO ] Deduced a trap composed of 50 places in 94 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 21:11:52] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 1 ms to minimize.
[2024-06-02 21:11:52] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 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 24735 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 21:12:08] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-06-02 21:12:14] [INFO ] Deduced a trap composed of 42 places in 43 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 30020 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 55146ms problems are : Problem set: 0 solved, 435 unsolved
Search for dead transitions found 0 dead transitions in 55151ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55540 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 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 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 22 ms. Remains 120 /158 variables (removed 38) and now considering 222/441 (removed 219) transitions.
Running SMT prover for 1 properties.
[2024-06-02 21:12:32] [INFO ] Flow matrix only has 220 transitions (discarded 2 similar events)
// Phase 1: matrix 220 rows 120 cols
[2024-06-02 21:12:32] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 21:12:32] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 21:12:32] [INFO ] After 49ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:12:32] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 0 ms to minimize.
TRAPS : Iteration 1
[2024-06-02 21:12:32] [INFO ] After 114ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:12:32] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:12:32] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 21:12:32] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:12:32] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2024-06-02 21:12:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
TRAPS : Iteration 1
[2024-06-02 21:12:33] [INFO ] After 120ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 21:12:33] [INFO ] After 162ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 342 ms.
RANDOM walk for 31 steps (0 resets) in 4 ms. (6 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (1293 resets) in 119 ms. (333 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (287 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1297227 steps, run timeout after 3001 ms. (steps per millisecond=432 ) properties seen :0 out of 1
Probabilistic random walk after 1297227 steps, saw 311597 distinct states, run finished after 3003 ms. (steps per millisecond=431 ) properties seen :0
[2024-06-02 21:12:36] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
// Phase 1: matrix 480 rows 189 cols
[2024-06-02 21:12:36] [INFO ] Computed 7 invariants in 6 ms
[2024-06-02 21:12: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
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 341 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 567ms 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 43 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 43 ms. Remains : 157/189 places, 439/514 transitions.
RANDOM walk for 40000 steps (1288 resets) in 139 ms. (285 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (280 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1383575 steps, run timeout after 3001 ms. (steps per millisecond=461 ) properties seen :0 out of 1
Probabilistic random walk after 1383575 steps, saw 335927 distinct states, run finished after 3002 ms. (steps per millisecond=460 ) properties seen :0
[2024-06-02 21:12:39] [INFO ] Flow matrix only has 402 transitions (discarded 37 similar events)
// Phase 1: matrix 402 rows 157 cols
[2024-06-02 21:12:39] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 21:12:39] [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 198 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 179 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 387ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 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 4 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 4 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 4 ms. Remains 157 /157 variables (removed 0) and now considering 439/439 (removed 0) transitions.
[2024-06-02 21:12:40] [INFO ] Flow matrix only has 402 transitions (discarded 37 similar events)
[2024-06-02 21:12:40] [INFO ] Invariant cache hit.
[2024-06-02 21:12:40] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-06-02 21:12:40] [INFO ] Flow matrix only has 402 transitions (discarded 37 similar events)
[2024-06-02 21:12:40] [INFO ] Invariant cache hit.
[2024-06-02 21:12:40] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 21:12:40] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
[2024-06-02 21:12:40] [INFO ] Redundant transitions in 4 ms returned []
Running 433 sub problems to find dead transitions.
[2024-06-02 21:12:40] [INFO ] Flow matrix only has 402 transitions (discarded 37 similar events)
[2024-06-02 21:12:40] [INFO ] Invariant cache hit.
[2024-06-02 21:12:40] [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 21:12:42] [INFO ] Deduced a trap composed of 58 places in 82 ms of which 1 ms to minimize.
[2024-06-02 21:12:42] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2024-06-02 21:12:42] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 1 ms to minimize.
[2024-06-02 21:12:42] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 0 ms to minimize.
[2024-06-02 21:12:43] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 1 ms to minimize.
[2024-06-02 21:12:43] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 1 ms to minimize.
[2024-06-02 21:12:43] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
[2024-06-02 21:12:43] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 1 ms to minimize.
[2024-06-02 21:12:44] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
[2024-06-02 21:12:44] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2024-06-02 21:12:44] [INFO ] Deduced a trap composed of 51 places in 76 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 21:12:49] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 2 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 21:12:53] [INFO ] Deduced a trap composed of 57 places in 81 ms of which 1 ms to minimize.
[2024-06-02 21:12:55] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 0 ms to minimize.
[2024-06-02 21:12:56] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 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 26334 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 30022 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 56715ms problems are : Problem set: 0 solved, 433 unsolved
Search for dead transitions found 0 dead transitions in 56720ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57109 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 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 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 25 ms. Remains 119 /157 variables (removed 38) and now considering 220/439 (removed 219) transitions.
Running SMT prover for 1 properties.
[2024-06-02 21:13:37] [INFO ] Flow matrix only has 218 transitions (discarded 2 similar events)
// Phase 1: matrix 218 rows 119 cols
[2024-06-02 21:13:37] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 21:13:37] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 21:13:37] [INFO ] After 85ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:13:37] [INFO ] After 116ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-06-02 21:13:37] [INFO ] After 185ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 219 ms.
RANDOM walk for 40000 steps (1298 resets) in 105 ms. (377 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (282 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1231066 steps, run timeout after 3001 ms. (steps per millisecond=410 ) properties seen :0 out of 1
Probabilistic random walk after 1231066 steps, saw 296651 distinct states, run finished after 3001 ms. (steps per millisecond=410 ) properties seen :0
[2024-06-02 21:13:40] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
// Phase 1: matrix 480 rows 189 cols
[2024-06-02 21:13:40] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 21:13:40] [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 221 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 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]
After SMT, in 441ms 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 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 42 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 42 ms. Remains : 156/189 places, 436/514 transitions.
RANDOM walk for 40000 steps (1276 resets) in 90 ms. (439 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (271 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1418358 steps, run timeout after 3001 ms. (steps per millisecond=472 ) properties seen :0 out of 1
Probabilistic random walk after 1418358 steps, saw 344301 distinct states, run finished after 3001 ms. (steps per millisecond=472 ) properties seen :0
[2024-06-02 21:13:44] [INFO ] Flow matrix only has 399 transitions (discarded 37 similar events)
// Phase 1: matrix 399 rows 156 cols
[2024-06-02 21:13:44] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 21:13:44] [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 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]
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 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]
After SMT, in 445ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 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 5 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 21:13:44] [INFO ] Flow matrix only has 399 transitions (discarded 37 similar events)
[2024-06-02 21:13:44] [INFO ] Invariant cache hit.
[2024-06-02 21:13:44] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-02 21:13:44] [INFO ] Flow matrix only has 399 transitions (discarded 37 similar events)
[2024-06-02 21:13:44] [INFO ] Invariant cache hit.
[2024-06-02 21:13:44] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-06-02 21:13:44] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
[2024-06-02 21:13:44] [INFO ] Redundant transitions in 4 ms returned []
Running 430 sub problems to find dead transitions.
[2024-06-02 21:13:44] [INFO ] Flow matrix only has 399 transitions (discarded 37 similar events)
[2024-06-02 21:13:44] [INFO ] Invariant cache hit.
[2024-06-02 21:13:44] [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 21:13:46] [INFO ] Deduced a trap composed of 58 places in 82 ms of which 2 ms to minimize.
[2024-06-02 21:13:46] [INFO ] Deduced a trap composed of 59 places in 82 ms of which 1 ms to minimize.
[2024-06-02 21:13:46] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-06-02 21:13:46] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 0 ms to minimize.
[2024-06-02 21:13:47] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 1 ms to minimize.
[2024-06-02 21:13:47] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2024-06-02 21:13:47] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2024-06-02 21:13:47] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 1 ms to minimize.
[2024-06-02 21:13:48] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-06-02 21:13:48] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-06-02 21:13:48] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 1 ms to minimize.
[2024-06-02 21:13:48] [INFO ] Deduced a trap composed of 51 places in 80 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 21:13:49] [INFO ] Deduced a trap composed of 17 places in 67 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 21:13:54] [INFO ] Deduced a trap composed of 54 places in 83 ms of which 1 ms to minimize.
[2024-06-02 21:13:54] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 0 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 21:14:02] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 0 ms to minimize.
[2024-06-02 21:14:03] [INFO ] Deduced a trap composed of 31 places in 39 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 29144 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 30016 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 59502ms problems are : Problem set: 0 solved, 430 unsolved
Search for dead transitions found 0 dead transitions in 59507ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59888 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 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 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 20 ms. Remains 118 /156 variables (removed 38) and now considering 218/436 (removed 218) transitions.
Running SMT prover for 1 properties.
[2024-06-02 21:14:44] [INFO ] Flow matrix only has 216 transitions (discarded 2 similar events)
// Phase 1: matrix 216 rows 118 cols
[2024-06-02 21:14:44] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 21:14:44] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 21:14:44] [INFO ] After 44ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:14:44] [INFO ] After 64ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:14:44] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:14:44] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 21:14:44] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:14:44] [INFO ] After 51ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 21:14:44] [INFO ] After 90ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 221 ms.
RANDOM walk for 40000 steps (1303 resets) in 115 ms. (344 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (276 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1280808 steps, run timeout after 3001 ms. (steps per millisecond=426 ) properties seen :0 out of 1
Probabilistic random walk after 1280808 steps, saw 306829 distinct states, run finished after 3001 ms. (steps per millisecond=426 ) properties seen :0
[2024-06-02 21:14:47] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
// Phase 1: matrix 480 rows 189 cols
[2024-06-02 21:14:47] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 21:14:47] [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 197 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 242 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 448ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 9 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 34 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 34 ms. Remains : 155/189 places, 434/514 transitions.
RANDOM walk for 40000 steps (1260 resets) in 89 ms. (444 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 1426383 steps, run timeout after 3001 ms. (steps per millisecond=475 ) properties seen :0 out of 1
Probabilistic random walk after 1426383 steps, saw 346370 distinct states, run finished after 3001 ms. (steps per millisecond=475 ) properties seen :0
[2024-06-02 21:14:51] [INFO ] Flow matrix only has 397 transitions (discarded 37 similar events)
// Phase 1: matrix 397 rows 155 cols
[2024-06-02 21:14:51] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 21:14:51] [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 197 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 177 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 384ms 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 5 ms. Remains 155 /155 variables (removed 0) and now considering 434/434 (removed 0) transitions.
[2024-06-02 21:14:51] [INFO ] Flow matrix only has 397 transitions (discarded 37 similar events)
[2024-06-02 21:14:51] [INFO ] Invariant cache hit.
[2024-06-02 21:14:51] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-02 21:14:51] [INFO ] Flow matrix only has 397 transitions (discarded 37 similar events)
[2024-06-02 21:14:51] [INFO ] Invariant cache hit.
[2024-06-02 21:14:51] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-06-02 21:14:51] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
[2024-06-02 21:14:51] [INFO ] Redundant transitions in 4 ms returned []
Running 428 sub problems to find dead transitions.
[2024-06-02 21:14:51] [INFO ] Flow matrix only has 397 transitions (discarded 37 similar events)
[2024-06-02 21:14:51] [INFO ] Invariant cache hit.
[2024-06-02 21:14:51] [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 21:14:53] [INFO ] Deduced a trap composed of 59 places in 80 ms of which 1 ms to minimize.
[2024-06-02 21:14:53] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2024-06-02 21:14:53] [INFO ] Deduced a trap composed of 66 places in 68 ms of which 1 ms to minimize.
[2024-06-02 21:14:53] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 2 ms to minimize.
[2024-06-02 21:14:54] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 0 ms to minimize.
[2024-06-02 21:14:54] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2024-06-02 21:14:54] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 1 ms to minimize.
[2024-06-02 21:14:55] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 1 ms to minimize.
[2024-06-02 21:14:55] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 0 ms to minimize.
[2024-06-02 21:14:55] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-06-02 21:14:55] [INFO ] Deduced a trap composed of 62 places in 77 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 21:14:56] [INFO ] Deduced a trap composed of 92 places in 87 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 21:14:59] [INFO ] Deduced a trap composed of 51 places in 75 ms of which 2 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 21:15:05] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-06-02 21:15:07] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-06-02 21:15:07] [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 21:15:08] [INFO ] Deduced a trap composed of 55 places in 88 ms of which 1 ms to minimize.
[2024-06-02 21:15:08] [INFO ] Deduced a trap composed of 53 places in 72 ms of which 2 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 30016 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 27249 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 57587ms problems are : Problem set: 0 solved, 428 unsolved
Search for dead transitions found 0 dead transitions in 57593ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57957 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 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 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 18 ms. Remains 117 /155 variables (removed 38) and now considering 216/434 (removed 218) transitions.
Running SMT prover for 1 properties.
[2024-06-02 21:15:49] [INFO ] Flow matrix only has 214 transitions (discarded 2 similar events)
// Phase 1: matrix 214 rows 117 cols
[2024-06-02 21:15:49] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 21:15:49] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 21:15:49] [INFO ] After 46ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:15:49] [INFO ] After 56ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-06-02 21:15:49] [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 (1335 resets) in 120 ms. (330 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (270 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1272519 steps, run timeout after 3001 ms. (steps per millisecond=424 ) properties seen :0 out of 1
Probabilistic random walk after 1272519 steps, saw 304867 distinct states, run finished after 3001 ms. (steps per millisecond=424 ) properties seen :0
[2024-06-02 21:15:52] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
// Phase 1: matrix 480 rows 189 cols
[2024-06-02 21:15:52] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 21:15:52] [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 183 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 235 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 428ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 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 38 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 39 ms. Remains : 154/189 places, 431/514 transitions.
RANDOM walk for 40000 steps (1289 resets) in 108 ms. (366 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (250 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1398303 steps, run timeout after 3001 ms. (steps per millisecond=465 ) properties seen :0 out of 1
Probabilistic random walk after 1398303 steps, saw 339138 distinct states, run finished after 3002 ms. (steps per millisecond=465 ) properties seen :0
[2024-06-02 21:15:56] [INFO ] Flow matrix only has 394 transitions (discarded 37 similar events)
// Phase 1: matrix 394 rows 154 cols
[2024-06-02 21:15:56] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 21:15:56] [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 163 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 384ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 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 4 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 4 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 21:15:56] [INFO ] Flow matrix only has 394 transitions (discarded 37 similar events)
[2024-06-02 21:15:56] [INFO ] Invariant cache hit.
[2024-06-02 21:15:56] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-02 21:15:56] [INFO ] Flow matrix only has 394 transitions (discarded 37 similar events)
[2024-06-02 21:15:56] [INFO ] Invariant cache hit.
[2024-06-02 21:15:56] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 21:15:57] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
[2024-06-02 21:15:57] [INFO ] Redundant transitions in 4 ms returned []
Running 425 sub problems to find dead transitions.
[2024-06-02 21:15:57] [INFO ] Flow matrix only has 394 transitions (discarded 37 similar events)
[2024-06-02 21:15:57] [INFO ] Invariant cache hit.
[2024-06-02 21:15:57] [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 21:15:58] [INFO ] Deduced a trap composed of 57 places in 74 ms of which 1 ms to minimize.
[2024-06-02 21:15:58] [INFO ] Deduced a trap composed of 32 places in 25 ms of which 1 ms to minimize.
[2024-06-02 21:15:58] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 1 ms to minimize.
[2024-06-02 21:15:59] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2024-06-02 21:15:59] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 1 ms to minimize.
[2024-06-02 21:15:59] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-06-02 21:15:59] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-06-02 21:15:59] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 2 ms to minimize.
[2024-06-02 21:15:59] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-06-02 21:16:00] [INFO ] Deduced a trap composed of 62 places in 79 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 21:16:05] [INFO ] Deduced a trap composed of 53 places in 88 ms of which 2 ms to minimize.
[2024-06-02 21:16:05] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 0 ms to minimize.
[2024-06-02 21:16:08] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 0 ms to minimize.
[2024-06-02 21:16:08] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-06-02 21:16:08] [INFO ] Deduced a trap composed of 89 places in 87 ms of which 2 ms to minimize.
[2024-06-02 21:16:09] [INFO ] Deduced a trap composed of 50 places in 83 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 22092 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 25385 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 47814ms problems are : Problem set: 0 solved, 425 unsolved
Search for dead transitions found 0 dead transitions in 47819ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48171 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 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 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 22 ms. Remains 116 /154 variables (removed 38) and now considering 214/431 (removed 217) transitions.
Running SMT prover for 1 properties.
[2024-06-02 21:16:44] [INFO ] Flow matrix only has 212 transitions (discarded 2 similar events)
// Phase 1: matrix 212 rows 116 cols
[2024-06-02 21:16:44] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 21:16:44] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 21:16:44] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:16:44] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 21:16:45] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:16:45] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 0 ms to minimize.
[2024-06-02 21:16:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
TRAPS : Iteration 1
[2024-06-02 21:16:45] [INFO ] After 116ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 21:16:45] [INFO ] After 163ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 274 ms.
RANDOM walk for 40000 steps (1297 resets) in 98 ms. (404 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (264 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1297245 steps, run timeout after 3001 ms. (steps per millisecond=432 ) properties seen :0 out of 1
Probabilistic random walk after 1297245 steps, saw 311604 distinct states, run finished after 3001 ms. (steps per millisecond=432 ) properties seen :0
[2024-06-02 21:16:48] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
// Phase 1: matrix 480 rows 189 cols
[2024-06-02 21:16:48] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 21:16:48] [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 21:16:48] [INFO ] Deduced a trap composed of 54 places in 99 ms of which 1 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 328 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 294 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 639ms 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 36 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 37 ms. Remains : 153/189 places, 429/514 transitions.
RANDOM walk for 40000 steps (1303 resets) in 120 ms. (330 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (273 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1407212 steps, run timeout after 3001 ms. (steps per millisecond=468 ) properties seen :0 out of 1
Probabilistic random walk after 1407212 steps, saw 341373 distinct states, run finished after 3001 ms. (steps per millisecond=468 ) properties seen :0
[2024-06-02 21:16:51] [INFO ] Flow matrix only has 392 transitions (discarded 37 similar events)
// Phase 1: matrix 392 rows 153 cols
[2024-06-02 21:16:51] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 21:16:51] [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 21:16:52] [INFO ] Deduced a trap composed of 17 places in 75 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 285 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 180 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 483ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 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 4 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 4 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 3 ms. Remains 153 /153 variables (removed 0) and now considering 429/429 (removed 0) transitions.
[2024-06-02 21:16:52] [INFO ] Flow matrix only has 392 transitions (discarded 37 similar events)
[2024-06-02 21:16:52] [INFO ] Invariant cache hit.
[2024-06-02 21:16:52] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-02 21:16:52] [INFO ] Flow matrix only has 392 transitions (discarded 37 similar events)
[2024-06-02 21:16:52] [INFO ] Invariant cache hit.
[2024-06-02 21:16:52] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 21:16:52] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2024-06-02 21:16:52] [INFO ] Redundant transitions in 4 ms returned []
Running 423 sub problems to find dead transitions.
[2024-06-02 21:16:52] [INFO ] Flow matrix only has 392 transitions (discarded 37 similar events)
[2024-06-02 21:16:52] [INFO ] Invariant cache hit.
[2024-06-02 21:16:52] [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 21:16:54] [INFO ] Deduced a trap composed of 52 places in 81 ms of which 1 ms to minimize.
[2024-06-02 21:16:54] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2024-06-02 21:16:54] [INFO ] Deduced a trap composed of 65 places in 78 ms of which 2 ms to minimize.
[2024-06-02 21:16:54] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-06-02 21:16:54] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 1 ms to minimize.
[2024-06-02 21:16:55] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-06-02 21:16:55] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-06-02 21:16:55] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 0 ms to minimize.
[2024-06-02 21:16:55] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 1 ms to minimize.
[2024-06-02 21:16:56] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2024-06-02 21:16:56] [INFO ] Deduced a trap composed of 51 places in 81 ms of which 2 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 21:17:01] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 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 21:17:07] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-06-02 21:17:07] [INFO ] Deduced a trap composed of 31 places in 44 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 23943 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 24683 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 48964ms problems are : Problem set: 0 solved, 423 unsolved
Search for dead transitions found 0 dead transitions in 48970ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49315 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 21:17:41] [INFO ] Flow matrix only has 210 transitions (discarded 2 similar events)
// Phase 1: matrix 210 rows 115 cols
[2024-06-02 21:17:41] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 21:17:41] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 21:17:41] [INFO ] After 46ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:17:41] [INFO ] After 57ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-06-02 21:17:41] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 118 ms.
RANDOM walk for 40000 steps (1285 resets) in 93 ms. (425 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 1268712 steps, run timeout after 3001 ms. (steps per millisecond=422 ) properties seen :0 out of 1
Probabilistic random walk after 1268712 steps, saw 303860 distinct states, run finished after 3001 ms. (steps per millisecond=422 ) properties seen :0
[2024-06-02 21:17:44] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
// Phase 1: matrix 480 rows 189 cols
[2024-06-02 21:17:44] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 21:17:44] [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 209 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 418ms 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 38 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 (1242 resets) in 92 ms. (430 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (260 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1401616 steps, run timeout after 3001 ms. (steps per millisecond=467 ) properties seen :0 out of 1
Probabilistic random walk after 1401616 steps, saw 340027 distinct states, run finished after 3001 ms. (steps per millisecond=467 ) properties seen :0
[2024-06-02 21:17:48] [INFO ] Flow matrix only has 389 transitions (discarded 37 similar events)
// Phase 1: matrix 389 rows 152 cols
[2024-06-02 21:17:48] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 21:17:48] [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 174 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 192 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 377ms 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 4 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 4 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 21:17:48] [INFO ] Flow matrix only has 389 transitions (discarded 37 similar events)
[2024-06-02 21:17:48] [INFO ] Invariant cache hit.
[2024-06-02 21:17:48] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-02 21:17:48] [INFO ] Flow matrix only has 389 transitions (discarded 37 similar events)
[2024-06-02 21:17:48] [INFO ] Invariant cache hit.
[2024-06-02 21:17:48] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-06-02 21:17:49] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
[2024-06-02 21:17:49] [INFO ] Redundant transitions in 4 ms returned []
Running 420 sub problems to find dead transitions.
[2024-06-02 21:17:49] [INFO ] Flow matrix only has 389 transitions (discarded 37 similar events)
[2024-06-02 21:17:49] [INFO ] Invariant cache hit.
[2024-06-02 21:17:49] [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 21:17:50] [INFO ] Deduced a trap composed of 53 places in 80 ms of which 1 ms to minimize.
[2024-06-02 21:17:50] [INFO ] Deduced a trap composed of 52 places in 76 ms of which 1 ms to minimize.
[2024-06-02 21:17:50] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2024-06-02 21:17:51] [INFO ] Deduced a trap composed of 64 places in 105 ms of which 1 ms to minimize.
[2024-06-02 21:17:51] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 1 ms to minimize.
[2024-06-02 21:17:51] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 0 ms to minimize.
[2024-06-02 21:17:51] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-06-02 21:17:51] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 2 ms to minimize.
[2024-06-02 21:17:51] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2024-06-02 21:17:52] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 1 ms to minimize.
[2024-06-02 21:17:52] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 1 ms to minimize.
[2024-06-02 21:17:52] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-06-02 21:17:52] [INFO ] Deduced a trap composed of 51 places in 81 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 21:17:57] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2024-06-02 21:17:58] [INFO ] Deduced a trap composed of 60 places in 75 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 21:18:01] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
[2024-06-02 21:18:03] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 0 ms to minimize.
[2024-06-02 21:18:03] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 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 25011 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 25522 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 50841ms problems are : Problem set: 0 solved, 420 unsolved
Search for dead transitions found 0 dead transitions in 50846ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51212 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 14 ms. Remains 114 /152 variables (removed 38) and now considering 210/426 (removed 216) transitions.
Running SMT prover for 1 properties.
[2024-06-02 21:18:39] [INFO ] Flow matrix only has 208 transitions (discarded 2 similar events)
// Phase 1: matrix 208 rows 114 cols
[2024-06-02 21:18:39] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 21:18:40] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 21:18:40] [INFO ] After 49ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:18:40] [INFO ] After 59ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:18:40] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:18:40] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 21:18:40] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:18:40] [INFO ] After 51ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 21:18:40] [INFO ] After 92ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 215 ms.
RANDOM walk for 40000 steps (1264 resets) in 94 ms. (421 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (275 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1259368 steps, run timeout after 3001 ms. (steps per millisecond=419 ) properties seen :0 out of 1
Probabilistic random walk after 1259368 steps, saw 301497 distinct states, run finished after 3003 ms. (steps per millisecond=419 ) properties seen :0
[2024-06-02 21:18:43] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
// Phase 1: matrix 480 rows 189 cols
[2024-06-02 21:18:43] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 21:18:43] [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 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 421ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 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 32 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 33 ms. Remains : 151/189 places, 424/514 transitions.
RANDOM walk for 40000 steps (1276 resets) in 89 ms. (444 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (281 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1443284 steps, run timeout after 3001 ms. (steps per millisecond=480 ) properties seen :0 out of 1
Probabilistic random walk after 1443284 steps, saw 351047 distinct states, run finished after 3001 ms. (steps per millisecond=480 ) properties seen :0
[2024-06-02 21:18:46] [INFO ] Flow matrix only has 387 transitions (discarded 37 similar events)
// Phase 1: matrix 387 rows 151 cols
[2024-06-02 21:18:46] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 21:18:46] [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 169 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 169 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 346ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 4 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 5 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 5 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 4 ms. Remains 151 /151 variables (removed 0) and now considering 424/424 (removed 0) transitions.
[2024-06-02 21:18:47] [INFO ] Flow matrix only has 387 transitions (discarded 37 similar events)
[2024-06-02 21:18:47] [INFO ] Invariant cache hit.
[2024-06-02 21:18:47] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-02 21:18:47] [INFO ] Flow matrix only has 387 transitions (discarded 37 similar events)
[2024-06-02 21:18:47] [INFO ] Invariant cache hit.
[2024-06-02 21:18:47] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-06-02 21:18:47] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
[2024-06-02 21:18:47] [INFO ] Redundant transitions in 4 ms returned []
Running 418 sub problems to find dead transitions.
[2024-06-02 21:18:47] [INFO ] Flow matrix only has 387 transitions (discarded 37 similar events)
[2024-06-02 21:18:47] [INFO ] Invariant cache hit.
[2024-06-02 21:18:47] [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 21:18:49] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 2 ms to minimize.
[2024-06-02 21:18:49] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2024-06-02 21:18:49] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 0 ms to minimize.
[2024-06-02 21:18:49] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2024-06-02 21:18:49] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 0 ms to minimize.
[2024-06-02 21:18:50] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2024-06-02 21:18:50] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 1 ms to minimize.
[2024-06-02 21:18:50] [INFO ] Deduced a trap composed of 60 places in 70 ms of which 1 ms to minimize.
[2024-06-02 21:18:50] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-06-02 21:18:50] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-06-02 21:18:51] [INFO ] Deduced a trap composed of 50 places in 81 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 21:18:51] [INFO ] Deduced a trap composed of 55 places in 89 ms of which 1 ms to minimize.
[2024-06-02 21:18:52] [INFO ] Deduced a trap composed of 16 places in 77 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 21:18:56] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 0 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 21:19:04] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-06-02 21:19:04] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 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 27417 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 25605 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 53315ms problems are : Problem set: 0 solved, 418 unsolved
Search for dead transitions found 0 dead transitions in 53320ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53663 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 0 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 15 ms. Remains 113 /151 variables (removed 38) and now considering 208/424 (removed 216) transitions.
Running SMT prover for 1 properties.
[2024-06-02 21:19:40] [INFO ] Flow matrix only has 206 transitions (discarded 2 similar events)
// Phase 1: matrix 206 rows 113 cols
[2024-06-02 21:19:40] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 21:19:40] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 21:19:40] [INFO ] After 43ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:19:40] [INFO ] After 53ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-06-02 21:19:40] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 116 ms.
RANDOM walk for 40000 steps (1234 resets) in 89 ms. (444 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (273 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1305932 steps, run timeout after 3001 ms. (steps per millisecond=435 ) properties seen :0 out of 1
Probabilistic random walk after 1305932 steps, saw 313863 distinct states, run finished after 3001 ms. (steps per millisecond=435 ) properties seen :0
[2024-06-02 21:19:43] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
// Phase 1: matrix 480 rows 189 cols
[2024-06-02 21:19:43] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 21:19:43] [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 201 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 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 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 35 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 36 ms. Remains : 150/189 places, 421/514 transitions.
RANDOM walk for 40000 steps (1261 resets) in 103 ms. (384 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (270 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1437505 steps, run timeout after 3001 ms. (steps per millisecond=479 ) properties seen :0 out of 1
Probabilistic random walk after 1437505 steps, saw 349385 distinct states, run finished after 3001 ms. (steps per millisecond=479 ) properties seen :0
[2024-06-02 21:19:47] [INFO ] Flow matrix only has 384 transitions (discarded 37 similar events)
// Phase 1: matrix 384 rows 150 cols
[2024-06-02 21:19:47] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 21:19:47] [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 158 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 161 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 329ms 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 4 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 4 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 5 ms. Remains 150 /150 variables (removed 0) and now considering 421/421 (removed 0) transitions.
[2024-06-02 21:19:47] [INFO ] Flow matrix only has 384 transitions (discarded 37 similar events)
[2024-06-02 21:19:47] [INFO ] Invariant cache hit.
[2024-06-02 21:19:47] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-02 21:19:47] [INFO ] Flow matrix only has 384 transitions (discarded 37 similar events)
[2024-06-02 21:19:47] [INFO ] Invariant cache hit.
[2024-06-02 21:19:47] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 21:19:48] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
[2024-06-02 21:19:48] [INFO ] Redundant transitions in 3 ms returned []
Running 415 sub problems to find dead transitions.
[2024-06-02 21:19:48] [INFO ] Flow matrix only has 384 transitions (discarded 37 similar events)
[2024-06-02 21:19:48] [INFO ] Invariant cache hit.
[2024-06-02 21:19:48] [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 21:19:49] [INFO ] Deduced a trap composed of 55 places in 83 ms of which 1 ms to minimize.
[2024-06-02 21:19:49] [INFO ] Deduced a trap composed of 59 places in 77 ms of which 1 ms to minimize.
[2024-06-02 21:19:49] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-06-02 21:19:49] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 1 ms to minimize.
[2024-06-02 21:19:50] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
[2024-06-02 21:19:50] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 0 ms to minimize.
[2024-06-02 21:19:50] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-06-02 21:19:51] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 2 ms to minimize.
[2024-06-02 21:19:51] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 1 ms to minimize.
[2024-06-02 21:19:51] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-06-02 21:19:51] [INFO ] Deduced a trap composed of 51 places in 72 ms of which 1 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 21:19:53] [INFO ] Deduced a trap composed of 16 places in 72 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 21:19:56] [INFO ] Deduced a trap composed of 51 places in 88 ms of which 2 ms to minimize.
[2024-06-02 21:19:57] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
[2024-06-02 21:19:59] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-06-02 21:19:59] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 0 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 21439 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 21:20:19] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 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 30024 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 51789ms problems are : Problem set: 0 solved, 415 unsolved
Search for dead transitions found 0 dead transitions in 51793ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52107 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 14 ms. Remains 112 /150 variables (removed 38) and now considering 206/421 (removed 215) transitions.
Running SMT prover for 1 properties.
[2024-06-02 21:20:39] [INFO ] Flow matrix only has 204 transitions (discarded 2 similar events)
// Phase 1: matrix 204 rows 112 cols
[2024-06-02 21:20:39] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 21:20:39] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 21:20:39] [INFO ] After 43ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:20:39] [INFO ] After 52ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-06-02 21:20:39] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 117 ms.
RANDOM walk for 40000 steps (1240 resets) in 98 ms. (404 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (282 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1292592 steps, run timeout after 3001 ms. (steps per millisecond=430 ) properties seen :0 out of 1
Probabilistic random walk after 1292592 steps, saw 310319 distinct states, run finished after 3001 ms. (steps per millisecond=430 ) properties seen :0
[2024-06-02 21:20:42] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
// Phase 1: matrix 480 rows 189 cols
[2024-06-02 21:20:42] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 21:20: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 193 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 227 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 430ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 9 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 32 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 32 ms. Remains : 149/189 places, 419/514 transitions.
RANDOM walk for 40000 steps (1254 resets) in 102 ms. (388 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (267 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1458225 steps, run timeout after 3001 ms. (steps per millisecond=485 ) properties seen :0 out of 1
Probabilistic random walk after 1458225 steps, saw 354489 distinct states, run finished after 3001 ms. (steps per millisecond=485 ) properties seen :0
[2024-06-02 21:20:46] [INFO ] Flow matrix only has 382 transitions (discarded 37 similar events)
// Phase 1: matrix 382 rows 149 cols
[2024-06-02 21:20:46] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 21:20:46] [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 184 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 153 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 344ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 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 5 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 5 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 3 ms. Remains 149 /149 variables (removed 0) and now considering 419/419 (removed 0) transitions.
[2024-06-02 21:20:46] [INFO ] Flow matrix only has 382 transitions (discarded 37 similar events)
[2024-06-02 21:20:46] [INFO ] Invariant cache hit.
[2024-06-02 21:20:46] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-02 21:20:46] [INFO ] Flow matrix only has 382 transitions (discarded 37 similar events)
[2024-06-02 21:20:46] [INFO ] Invariant cache hit.
[2024-06-02 21:20:47] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 21:20:47] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
[2024-06-02 21:20:47] [INFO ] Redundant transitions in 3 ms returned []
Running 413 sub problems to find dead transitions.
[2024-06-02 21:20:47] [INFO ] Flow matrix only has 382 transitions (discarded 37 similar events)
[2024-06-02 21:20:47] [INFO ] Invariant cache hit.
[2024-06-02 21:20:47] [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 21:20:48] [INFO ] Deduced a trap composed of 57 places in 75 ms of which 1 ms to minimize.
[2024-06-02 21:20:48] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2024-06-02 21:20:48] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 1 ms to minimize.
[2024-06-02 21:20:49] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 1 ms to minimize.
[2024-06-02 21:20:49] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 0 ms to minimize.
[2024-06-02 21:20:49] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2024-06-02 21:20:50] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-06-02 21:20:50] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 0 ms to minimize.
[2024-06-02 21:20:50] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-06-02 21:20:50] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-06-02 21:20:50] [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 21:20:55] [INFO ] Deduced a trap composed of 51 places in 84 ms of which 1 ms to minimize.
[2024-06-02 21:20:55] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-06-02 21:20:57] [INFO ] Deduced a trap composed of 31 places in 36 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 21:21:00] [INFO ] Deduced a trap composed of 31 places in 39 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 23476 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 24802 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 48604ms problems are : Problem set: 0 solved, 413 unsolved
Search for dead transitions found 0 dead transitions in 48609ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48935 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 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 1 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 1 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 29 ms. Remains 111 /149 variables (removed 38) and now considering 204/419 (removed 215) transitions.
Running SMT prover for 1 properties.
[2024-06-02 21:21:35] [INFO ] Flow matrix only has 202 transitions (discarded 2 similar events)
// Phase 1: matrix 202 rows 111 cols
[2024-06-02 21:21:35] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 21:21:35] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 21:21:35] [INFO ] After 42ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:21:35] [INFO ] After 58ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-06-02 21:21:35] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 136 ms.
RANDOM walk for 40000 steps (1261 resets) in 97 ms. (408 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (286 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1272097 steps, run timeout after 3001 ms. (steps per millisecond=423 ) properties seen :0 out of 1
Probabilistic random walk after 1272097 steps, saw 304745 distinct states, run finished after 3001 ms. (steps per millisecond=423 ) properties seen :0
[2024-06-02 21:21:38] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
// Phase 1: matrix 480 rows 189 cols
[2024-06-02 21:21:38] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 21:21:38] [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 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 447ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 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 (1290 resets) in 100 ms. (396 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (298 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1450053 steps, run timeout after 3001 ms. (steps per millisecond=483 ) properties seen :0 out of 1
Probabilistic random walk after 1450053 steps, saw 352511 distinct states, run finished after 3002 ms. (steps per millisecond=483 ) properties seen :0
[2024-06-02 21:21:42] [INFO ] Flow matrix only has 380 transitions (discarded 37 similar events)
// Phase 1: matrix 380 rows 148 cols
[2024-06-02 21:21:42] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 21:21:42] [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 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]
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 151 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 326ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3 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 10 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 10 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 6 ms. Remains 148 /148 variables (removed 0) and now considering 417/417 (removed 0) transitions.
[2024-06-02 21:21:42] [INFO ] Flow matrix only has 380 transitions (discarded 37 similar events)
[2024-06-02 21:21:42] [INFO ] Invariant cache hit.
[2024-06-02 21:21:42] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-02 21:21:42] [INFO ] Flow matrix only has 380 transitions (discarded 37 similar events)
[2024-06-02 21:21:42] [INFO ] Invariant cache hit.
[2024-06-02 21:21:42] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 21:21:43] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
[2024-06-02 21:21:43] [INFO ] Redundant transitions in 3 ms returned []
Running 411 sub problems to find dead transitions.
[2024-06-02 21:21:43] [INFO ] Flow matrix only has 380 transitions (discarded 37 similar events)
[2024-06-02 21:21:43] [INFO ] Invariant cache hit.
[2024-06-02 21:21:43] [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 21:21:44] [INFO ] Deduced a trap composed of 57 places in 83 ms of which 1 ms to minimize.
[2024-06-02 21:21:44] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-06-02 21:21:44] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-06-02 21:21:45] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 1 ms to minimize.
[2024-06-02 21:21:45] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 1 ms to minimize.
[2024-06-02 21:21:45] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-06-02 21:21:45] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 1 ms to minimize.
[2024-06-02 21:21:45] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 0 ms to minimize.
[2024-06-02 21:21:46] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-06-02 21:21:46] [INFO ] Deduced a trap composed of 85 places in 76 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 21:21:51] [INFO ] Deduced a trap composed of 50 places in 72 ms of which 1 ms to minimize.
[2024-06-02 21:21:51] [INFO ] Deduced a trap composed of 40 places in 30 ms of which 0 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 21:21:56] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2024-06-02 21:21:56] [INFO ] Deduced a trap composed of 31 places in 44 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 23529 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 21:22:15] [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 30014 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 53828ms problems are : Problem set: 0 solved, 411 unsolved
Search for dead transitions found 0 dead transitions in 53832ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54167 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 1 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 17 ms. Remains 110 /148 variables (removed 38) and now considering 203/417 (removed 214) transitions.
Running SMT prover for 1 properties.
[2024-06-02 21:22:36] [INFO ] Flow matrix only has 201 transitions (discarded 2 similar events)
// Phase 1: matrix 201 rows 110 cols
[2024-06-02 21:22:37] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 21:22:37] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 21:22:37] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:22:37] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 21:22:37] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:22:37] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-06-02 21:22:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
TRAPS : Iteration 1
[2024-06-02 21:22:37] [INFO ] After 111ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 21:22:37] [INFO ] After 154ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 258 ms.
RANDOM walk for 40000 steps (1247 resets) in 108 ms. (366 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (269 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1275517 steps, run timeout after 3001 ms. (steps per millisecond=425 ) properties seen :0 out of 1
Probabilistic random walk after 1275517 steps, saw 305736 distinct states, run finished after 3001 ms. (steps per millisecond=425 ) properties seen :0
[2024-06-02 21:22:40] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
// Phase 1: matrix 480 rows 189 cols
[2024-06-02 21:22:40] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 21:22:40] [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 201 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 224 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 12 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 33 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 33 ms. Remains : 148/189 places, 417/514 transitions.
RANDOM walk for 40000 steps (1262 resets) in 109 ms. (363 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (275 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1436470 steps, run timeout after 3001 ms. (steps per millisecond=478 ) properties seen :0 out of 1
Probabilistic random walk after 1436470 steps, saw 349080 distinct states, run finished after 3002 ms. (steps per millisecond=478 ) properties seen :0
[2024-06-02 21:22:43] [INFO ] Flow matrix only has 380 transitions (discarded 37 similar events)
// Phase 1: matrix 380 rows 148 cols
[2024-06-02 21:22:43] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 21:22:43] [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 159 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 167 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 336ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 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 5 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 7 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 3 ms. Remains 148 /148 variables (removed 0) and now considering 417/417 (removed 0) transitions.
[2024-06-02 21:22:44] [INFO ] Flow matrix only has 380 transitions (discarded 37 similar events)
[2024-06-02 21:22:44] [INFO ] Invariant cache hit.
[2024-06-02 21:22:44] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-02 21:22:44] [INFO ] Flow matrix only has 380 transitions (discarded 37 similar events)
[2024-06-02 21:22:44] [INFO ] Invariant cache hit.
[2024-06-02 21:22:44] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 21:22:44] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
[2024-06-02 21:22:44] [INFO ] Redundant transitions in 3 ms returned []
Running 411 sub problems to find dead transitions.
[2024-06-02 21:22:44] [INFO ] Flow matrix only has 380 transitions (discarded 37 similar events)
[2024-06-02 21:22:44] [INFO ] Invariant cache hit.
[2024-06-02 21:22:44] [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 21:22:46] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 1 ms to minimize.
[2024-06-02 21:22:46] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 0 ms to minimize.
[2024-06-02 21:22:46] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 1 ms to minimize.
[2024-06-02 21:22:46] [INFO ] Deduced a trap composed of 58 places in 78 ms of which 1 ms to minimize.
[2024-06-02 21:22:46] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-06-02 21:22:46] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-06-02 21:22:46] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2024-06-02 21:22:47] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 1 ms to minimize.
[2024-06-02 21:22:47] [INFO ] Deduced a trap composed of 85 places in 76 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 411 unsolved
[2024-06-02 21:22:49] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-06-02 21:22:49] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 4 (OVERLAPS) 380/528 variables, 148/166 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/528 variables, 56/222 constraints. Problems are: Problem set: 0 solved, 411 unsolved
[2024-06-02 21:22:54] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 0 ms to minimize.
[2024-06-02 21:22:55] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-06-02 21:22:55] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 3/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 19954 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
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 0/636 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 7 (OVERLAPS) 0/528 variables, 0/636 constraints. Problems are: Problem set: 0 solved, 411 unsolved
No progress, stopping.
After SMT solving in domain Int declared 528/528 variables, and 636 constraints, problems are : Problem set: 0 solved, 411 unsolved in 21111 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]
After SMT, in 41405ms problems are : Problem set: 0 solved, 411 unsolved
Search for dead transitions found 0 dead transitions in 41409ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41738 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 14 ms. Remains 110 /148 variables (removed 38) and now considering 203/417 (removed 214) transitions.
Running SMT prover for 1 properties.
[2024-06-02 21:23:25] [INFO ] Flow matrix only has 201 transitions (discarded 2 similar events)
// Phase 1: matrix 201 rows 110 cols
[2024-06-02 21:23:25] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 21:23:25] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 21:23:26] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:23:26] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 21:23:26] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:23:26] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-06-02 21:23:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
TRAPS : Iteration 1
[2024-06-02 21:23:26] [INFO ] After 102ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 21:23:26] [INFO ] After 148ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 245 ms.
RANDOM walk for 40000 steps (1284 resets) in 115 ms. (344 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (257 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1316176 steps, run timeout after 3001 ms. (steps per millisecond=438 ) properties seen :0 out of 1
Probabilistic random walk after 1316176 steps, saw 315771 distinct states, run finished after 3001 ms. (steps per millisecond=438 ) properties seen :0
[2024-06-02 21:23:29] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
// Phase 1: matrix 480 rows 189 cols
[2024-06-02 21:23:29] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 21:23: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
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 217 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 230 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 456ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 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 35 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 36 ms. Remains : 149/189 places, 419/514 transitions.
RANDOM walk for 40000 steps (1324 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (263 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1488416 steps, run timeout after 3001 ms. (steps per millisecond=495 ) properties seen :0 out of 1
Probabilistic random walk after 1488416 steps, saw 363001 distinct states, run finished after 3001 ms. (steps per millisecond=495 ) properties seen :0
[2024-06-02 21:23:32] [INFO ] Flow matrix only has 382 transitions (discarded 37 similar events)
// Phase 1: matrix 382 rows 149 cols
[2024-06-02 21:23:32] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 21:23:32] [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
All remaining problems are real, not stopping.
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 157 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 164 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 329ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 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 5 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 5 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 21:23:33] [INFO ] Flow matrix only has 382 transitions (discarded 37 similar events)
[2024-06-02 21:23:33] [INFO ] Invariant cache hit.
[2024-06-02 21:23:33] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-02 21:23:33] [INFO ] Flow matrix only has 382 transitions (discarded 37 similar events)
[2024-06-02 21:23:33] [INFO ] Invariant cache hit.
[2024-06-02 21:23:33] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 21:23:33] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
[2024-06-02 21:23:33] [INFO ] Redundant transitions in 2 ms returned []
Running 413 sub problems to find dead transitions.
[2024-06-02 21:23:33] [INFO ] Flow matrix only has 382 transitions (discarded 37 similar events)
[2024-06-02 21:23:33] [INFO ] Invariant cache hit.
[2024-06-02 21:23:33] [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 21:23:35] [INFO ] Deduced a trap composed of 57 places in 78 ms of which 1 ms to minimize.
[2024-06-02 21:23:35] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2024-06-02 21:23:35] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 1 ms to minimize.
[2024-06-02 21:23:35] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 1 ms to minimize.
[2024-06-02 21:23:35] [INFO ] Deduced a trap composed of 32 places in 25 ms of which 1 ms to minimize.
[2024-06-02 21:23:35] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
[2024-06-02 21:23:36] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2024-06-02 21:23:36] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 0 ms to minimize.
[2024-06-02 21:23:36] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 1 ms to minimize.
[2024-06-02 21:23:36] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-06-02 21:23:37] [INFO ] Deduced a trap composed of 51 places in 74 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 21:23:41] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 1 ms to minimize.
[2024-06-02 21:23:42] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 0 ms to minimize.
[2024-06-02 21:23:43] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-06-02 21:23:43] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 4/227 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 7 (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 19524 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
[2024-06-02 21:24:02] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 1/641 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 8 (OVERLAPS) 0/531 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 413 unsolved
No progress, stopping.
After SMT solving in domain Int declared 531/531 variables, and 641 constraints, problems are : Problem set: 0 solved, 413 unsolved in 30017 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: 16/16 constraints]
After SMT, in 49872ms problems are : Problem set: 0 solved, 413 unsolved
Search for dead transitions found 0 dead transitions in 49877ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50227 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 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 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 38 ms. Remains 111 /149 variables (removed 38) and now considering 204/419 (removed 215) transitions.
Running SMT prover for 1 properties.
[2024-06-02 21:24:23] [INFO ] Flow matrix only has 202 transitions (discarded 2 similar events)
// Phase 1: matrix 202 rows 111 cols
[2024-06-02 21:24:23] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 21:24:23] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 21:24:23] [INFO ] After 43ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:24:23] [INFO ] After 53ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-06-02 21:24:23] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 143 ms.
RANDOM walk for 40000 steps (1255 resets) in 107 ms. (370 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (260 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1292695 steps, run timeout after 3001 ms. (steps per millisecond=430 ) properties seen :0 out of 1
Probabilistic random walk after 1292695 steps, saw 310357 distinct states, run finished after 3001 ms. (steps per millisecond=430 ) properties seen :0
[2024-06-02 21:24:26] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
// Phase 1: matrix 480 rows 189 cols
[2024-06-02 21:24:26] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 21:24:26] [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 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 410ms 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 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 43 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 43 ms. Remains : 150/189 places, 421/514 transitions.
RANDOM walk for 40000 steps (1331 resets) in 90 ms. (439 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (270 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1499107 steps, run timeout after 3001 ms. (steps per millisecond=499 ) properties seen :0 out of 1
Probabilistic random walk after 1499107 steps, saw 365613 distinct states, run finished after 3001 ms. (steps per millisecond=499 ) properties seen :0
[2024-06-02 21:24:29] [INFO ] Flow matrix only has 384 transitions (discarded 37 similar events)
// Phase 1: matrix 384 rows 150 cols
[2024-06-02 21:24:29] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 21:24: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) 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
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
All remaining problems are real, not stopping.
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 172 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 178 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 360ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 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 6 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 5 ms. Remains 150 /150 variables (removed 0) and now considering 421/421 (removed 0) transitions.
[2024-06-02 21:24:30] [INFO ] Flow matrix only has 384 transitions (discarded 37 similar events)
[2024-06-02 21:24:30] [INFO ] Invariant cache hit.
[2024-06-02 21:24:30] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-02 21:24:30] [INFO ] Flow matrix only has 384 transitions (discarded 37 similar events)
[2024-06-02 21:24:30] [INFO ] Invariant cache hit.
[2024-06-02 21:24:30] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 21:24:30] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
[2024-06-02 21:24:30] [INFO ] Redundant transitions in 4 ms returned []
Running 415 sub problems to find dead transitions.
[2024-06-02 21:24:30] [INFO ] Flow matrix only has 384 transitions (discarded 37 similar events)
[2024-06-02 21:24:30] [INFO ] Invariant cache hit.
[2024-06-02 21:24:30] [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 21:24:32] [INFO ] Deduced a trap composed of 55 places in 76 ms of which 1 ms to minimize.
[2024-06-02 21:24:32] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2024-06-02 21:24:32] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 2 ms to minimize.
[2024-06-02 21:24:32] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 0 ms to minimize.
[2024-06-02 21:24:33] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 1 ms to minimize.
[2024-06-02 21:24:33] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 0 ms to minimize.
[2024-06-02 21:24:33] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
[2024-06-02 21:24:33] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 1 ms to minimize.
[2024-06-02 21:24:33] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2024-06-02 21:24:34] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-06-02 21:24:34] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-06-02 21:24:34] [INFO ] Deduced a trap composed of 50 places in 76 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 3 (OVERLAPS) 384/534 variables, 150/169 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/534 variables, 56/225 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2024-06-02 21:24:38] [INFO ] Deduced a trap composed of 53 places in 82 ms of which 1 ms to minimize.
[2024-06-02 21:24:40] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2024-06-02 21:24:44] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 1 ms to minimize.
[2024-06-02 21:24:44] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 2/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 24159 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 21:25:04] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 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 30012 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 54488ms problems are : Problem set: 0 solved, 415 unsolved
Search for dead transitions found 0 dead transitions in 54494ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54817 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 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 1 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 17 ms. Remains 112 /150 variables (removed 38) and now considering 206/421 (removed 215) transitions.
Running SMT prover for 1 properties.
[2024-06-02 21:25:25] [INFO ] Flow matrix only has 204 transitions (discarded 2 similar events)
// Phase 1: matrix 204 rows 112 cols
[2024-06-02 21:25:25] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 21:25:25] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 21:25:25] [INFO ] After 48ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:25:25] [INFO ] After 58ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-06-02 21:25:25] [INFO ] After 128ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 150 ms.
RANDOM walk for 40000 steps (1332 resets) in 110 ms. (360 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (280 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1289435 steps, run timeout after 3001 ms. (steps per millisecond=429 ) properties seen :0 out of 1
Probabilistic random walk after 1289435 steps, saw 309357 distinct states, run finished after 3001 ms. (steps per millisecond=429 ) properties seen :0
[2024-06-02 21:25:28] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
// Phase 1: matrix 480 rows 189 cols
[2024-06-02 21:25:28] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 21:25: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
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 225 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 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]
After SMT, in 440ms 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 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 34 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 35 ms. Remains : 151/189 places, 424/514 transitions.
RANDOM walk for 40000 steps (1298 resets) in 93 ms. (425 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (273 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1462026 steps, run timeout after 3001 ms. (steps per millisecond=487 ) properties seen :0 out of 1
Probabilistic random walk after 1462026 steps, saw 355788 distinct states, run finished after 3001 ms. (steps per millisecond=487 ) properties seen :0
[2024-06-02 21:25:31] [INFO ] Flow matrix only has 387 transitions (discarded 37 similar events)
// Phase 1: matrix 387 rows 151 cols
[2024-06-02 21:25:31] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 21:25:31] [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
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 190 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 157 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 356ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 4 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 4 ms. Remains 151 /151 variables (removed 0) and now considering 424/424 (removed 0) transitions.
[2024-06-02 21:25:32] [INFO ] Flow matrix only has 387 transitions (discarded 37 similar events)
[2024-06-02 21:25:32] [INFO ] Invariant cache hit.
[2024-06-02 21:25:32] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-02 21:25:32] [INFO ] Flow matrix only has 387 transitions (discarded 37 similar events)
[2024-06-02 21:25:32] [INFO ] Invariant cache hit.
[2024-06-02 21:25:32] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-06-02 21:25:32] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
[2024-06-02 21:25:32] [INFO ] Redundant transitions in 3 ms returned []
Running 418 sub problems to find dead transitions.
[2024-06-02 21:25:32] [INFO ] Flow matrix only has 387 transitions (discarded 37 similar events)
[2024-06-02 21:25:32] [INFO ] Invariant cache hit.
[2024-06-02 21:25:32] [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 21:25:34] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 1 ms to minimize.
[2024-06-02 21:25:34] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-06-02 21:25:34] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
[2024-06-02 21:25:34] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 0 ms to minimize.
[2024-06-02 21:25:34] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 2 ms to minimize.
[2024-06-02 21:25:35] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2024-06-02 21:25:35] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 0 ms to minimize.
[2024-06-02 21:25:35] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2024-06-02 21:25:35] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-06-02 21:25:36] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2024-06-02 21:25:36] [INFO ] Deduced a trap composed of 50 places in 79 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 21:25:37] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 4 (OVERLAPS) 387/538 variables, 151/170 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/538 variables, 57/227 constraints. Problems are: Problem set: 0 solved, 418 unsolved
[2024-06-02 21:25:42] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 418 unsolved
[2024-06-02 21:25:49] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 0 ms to minimize.
[2024-06-02 21:25:49] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 2/230 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 9 (OVERLAPS) 0/538 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 418 unsolved
No progress, stopping.
After SMT solving in domain Real declared 538/538 variables, and 230 constraints, problems are : Problem set: 0 solved, 418 unsolved in 27097 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: 15/15 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, 15/22 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 3 (OVERLAPS) 387/538 variables, 151/173 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/538 variables, 57/230 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/538 variables, 418/648 constraints. Problems are: Problem set: 0 solved, 418 unsolved
[2024-06-02 21:26:05] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 1/649 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 8 (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 30014 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 57426ms problems are : Problem set: 0 solved, 418 unsolved
Search for dead transitions found 0 dead transitions in 57431ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57771 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 0 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 17 ms. Remains 113 /151 variables (removed 38) and now considering 208/424 (removed 216) transitions.
Running SMT prover for 1 properties.
[2024-06-02 21:26:30] [INFO ] Flow matrix only has 206 transitions (discarded 2 similar events)
// Phase 1: matrix 206 rows 113 cols
[2024-06-02 21:26:30] [INFO ] Computed 7 invariants in 0 ms
[2024-06-02 21:26:30] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 21:26:30] [INFO ] After 42ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:26:30] [INFO ] After 51ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-06-02 21:26:30] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 144 ms.
RANDOM walk for 40000 steps (1259 resets) in 92 ms. (430 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (279 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1328483 steps, run timeout after 3001 ms. (steps per millisecond=442 ) properties seen :0 out of 1
Probabilistic random walk after 1328483 steps, saw 317034 distinct states, run finished after 3001 ms. (steps per millisecond=442 ) properties seen :0
[2024-06-02 21:26:33] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
// Phase 1: matrix 480 rows 189 cols
[2024-06-02 21:26:33] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 21:26:33] [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 189 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 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]
After SMT, in 410ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 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 (1264 resets) in 100 ms. (396 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (278 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1340225 steps, run timeout after 3001 ms. (steps per millisecond=446 ) properties seen :0 out of 1
Probabilistic random walk after 1340225 steps, saw 326808 distinct states, run finished after 3003 ms. (steps per millisecond=446 ) properties seen :0
[2024-06-02 21:26:36] [INFO ] Flow matrix only has 389 transitions (discarded 37 similar events)
// Phase 1: matrix 389 rows 152 cols
[2024-06-02 21:26:36] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 21:26:36] [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
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
All remaining problems are real, not stopping.
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 161 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 176 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 388ms 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 3 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 4 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 3 ms. Remains 152 /152 variables (removed 0) and now considering 426/426 (removed 0) transitions.
[2024-06-02 21:26:37] [INFO ] Flow matrix only has 389 transitions (discarded 37 similar events)
[2024-06-02 21:26:37] [INFO ] Invariant cache hit.
[2024-06-02 21:26:37] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-02 21:26:37] [INFO ] Flow matrix only has 389 transitions (discarded 37 similar events)
[2024-06-02 21:26:37] [INFO ] Invariant cache hit.
[2024-06-02 21:26:37] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-06-02 21:26:37] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
[2024-06-02 21:26:37] [INFO ] Redundant transitions in 4 ms returned []
Running 420 sub problems to find dead transitions.
[2024-06-02 21:26:37] [INFO ] Flow matrix only has 389 transitions (discarded 37 similar events)
[2024-06-02 21:26:37] [INFO ] Invariant cache hit.
[2024-06-02 21:26:37] [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 21:26:39] [INFO ] Deduced a trap composed of 53 places in 85 ms of which 1 ms to minimize.
[2024-06-02 21:26:39] [INFO ] Deduced a trap composed of 89 places in 88 ms of which 1 ms to minimize.
[2024-06-02 21:26:39] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 0 ms to minimize.
[2024-06-02 21:26:39] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 2 ms to minimize.
[2024-06-02 21:26:39] [INFO ] Deduced a trap composed of 64 places in 105 ms of which 1 ms to minimize.
[2024-06-02 21:26:39] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 0 ms to minimize.
[2024-06-02 21:26:40] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-06-02 21:26:40] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 1 ms to minimize.
[2024-06-02 21:26:40] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2024-06-02 21:26:40] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 1 ms to minimize.
[2024-06-02 21:26:41] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-06-02 21:26:41] [INFO ] Deduced a trap composed of 51 places in 92 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (OVERLAPS) 389/541 variables, 152/171 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/541 variables, 57/228 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-06-02 21:26:47] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 0 ms to minimize.
[2024-06-02 21:26:48] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-02 21:26:48] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/541 variables, 3/231 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/541 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 7 (OVERLAPS) 0/541 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 420 unsolved
No progress, stopping.
After SMT solving in domain Real declared 541/541 variables, and 231 constraints, problems are : Problem set: 0 solved, 420 unsolved in 20734 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: 15/15 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, 15/22 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (OVERLAPS) 389/541 variables, 152/174 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/541 variables, 57/231 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/541 variables, 420/651 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/541 variables, 0/651 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 7 (OVERLAPS) 0/541 variables, 0/651 constraints. Problems are: Problem set: 0 solved, 420 unsolved
No progress, stopping.
After SMT solving in domain Int declared 541/541 variables, and 651 constraints, problems are : Problem set: 0 solved, 420 unsolved in 25778 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: 15/15 constraints]
After SMT, in 46848ms problems are : Problem set: 0 solved, 420 unsolved
Search for dead transitions found 0 dead transitions in 46853ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47216 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 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 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 1 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 20 ms. Remains 114 /152 variables (removed 38) and now considering 210/426 (removed 216) transitions.
Running SMT prover for 1 properties.
[2024-06-02 21:27:24] [INFO ] Flow matrix only has 208 transitions (discarded 2 similar events)
// Phase 1: matrix 208 rows 114 cols
[2024-06-02 21:27:24] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 21:27:24] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 21:27:24] [INFO ] After 46ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:27:24] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
TRAPS : Iteration 1
[2024-06-02 21:27:24] [INFO ] After 95ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:27:24] [INFO ] After 135ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:27:24] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 21:27:24] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 21:27:24] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-06-02 21:27:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
TRAPS : Iteration 1
[2024-06-02 21:27:24] [INFO ] After 100ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 21:27:24] [INFO ] After 143ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 306 ms.
RANDOM walk for 40000 steps (1301 resets) in 106 ms. (373 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (283 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1223137 steps, run timeout after 3001 ms. (steps per millisecond=407 ) properties seen :0 out of 1
Probabilistic random walk after 1223137 steps, saw 295568 distinct states, run finished after 3001 ms. (steps per millisecond=407 ) properties seen :0
[2024-06-02 21:27:27] [INFO ] Flow matrix only has 480 transitions (discarded 34 similar events)
// Phase 1: matrix 480 rows 189 cols
[2024-06-02 21:27:27] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 21:27: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
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 228 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 219 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 457ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 10 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 (1293 resets) in 89 ms. (444 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (285 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1387669 steps, run timeout after 3001 ms. (steps per millisecond=462 ) properties seen :0 out of 1
Probabilistic random walk after 1387669 steps, saw 336704 distinct states, run finished after 3002 ms. (steps per millisecond=462 ) properties seen :0
[2024-06-02 21:27:31] [INFO ] Flow matrix only has 392 transitions (discarded 37 similar events)
// Phase 1: matrix 392 rows 153 cols
[2024-06-02 21:27:31] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 21:27:31] [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
All remaining problems are real, not stopping.
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
At refinement iteration 15 (INCLUDED_ONLY) 0/525 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 18/543 variables, 10/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/543 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/543 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/545 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/545 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/545 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 545/545 variables, and 218 constraints, problems are : Problem set: 0 solved, 1 unsolved in 162 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: 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) 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, 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
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 Int declared 545/545 variables, and 219 constraints, problems are : Problem set: 0 solved, 1 unsolved in 170 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: 0/0 constraints]
After SMT, in 341ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 4 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 5 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 5 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 5 ms. Remains 153 /153 variables (removed 0) and now considering 429/429 (removed 0) transitions.
[2024-06-02 21:27:31] [INFO ] Flow matrix only has 392 transitions (discarded 37 similar events)
[2024-06-02 21:27:31] [INFO ] Invariant cache hit.
[2024-06-02 21:27:31] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-02 21:27:31] [INFO ] Flow matrix only has 392 transitions (discarded 37 similar events)
[2024-06-02 21:27:31] [INFO ] Invariant cache hit.
[2024-06-02 21:27:31] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 21:27:31] [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 21:27:31] [INFO ] Redundant transitions in 3 ms returned []
Running 423 sub problems to find dead transitions.
[2024-06-02 21:27:31] [INFO ] Flow matrix only has 392 transitions (discarded 37 similar events)
[2024-06-02 21:27:31] [INFO ] Invariant cache hit.
[2024-06-02 21:27:31] [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 21:27:33] [INFO ] Deduced a trap composed of 52 places in 79 ms of which 1 ms to minimize.
[2024-06-02 21:27:33] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2024-06-02 21:27:33] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 1 ms to minimize.
[2024-06-02 21:27:33] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
[2024-06-02 21:27:34] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 1 ms to minimize.
[2024-06-02 21:27:34] [INFO ] Deduced a trap composed of 55 places in 74 ms of which 1 ms to minimize.
[2024-06-02 21:27:34] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 1 ms to minimize.
[2024-06-02 21:27:34] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-06-02 21:27:34] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
[2024-06-02 21:27:35] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2024-06-02 21:27:35] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-06-02 21:27:35] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 1 ms to minimize.
[2024-06-02 21:27:35] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-06-02 21:27:35] [INFO ] Deduced a trap composed of 51 places in 79 ms of which 1 ms to minimize.
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
[2024-06-02 21:27:41] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-02 21:27:46] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
[2024-06-02 21:27:46] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 8 (OVERLAPS) 0/545 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 423 unsolved
No progress, stopping.
After SMT solving in domain Real declared 545/545 variables, and 235 constraints, problems are : Problem set: 0 solved, 423 unsolved in 24325 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: 17/17 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, 17/24 constraints. Problems are: Problem set: 0 solved, 423 unsolved

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ 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="ltsminxred"
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 ltsminxred"
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 r564-tall-171734907700167"
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 ;