Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r084-tall-174860080300302.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is DoubleExponent-PT-004, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r084-tall-174860080300302
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 67K May 29 14:32 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 1748736307764

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DoubleExponent-PT-004
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-01 00:05:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-06-01 00:05:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 00:05:09] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2025-06-01 00:05:09] [INFO ] Transformed 216 places.
[2025-06-01 00:05:09] [INFO ] Transformed 198 transitions.
[2025-06-01 00:05:09] [INFO ] Parsed PT model containing 216 places and 198 transitions and 558 arcs in 192 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 216/216 places, 198/198 transitions.
Reduce places removed 4 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 212 transition count 150
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 100 place count 164 transition count 150
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 100 place count 164 transition count 142
Deduced a syphon composed of 8 places in 4 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 116 place count 156 transition count 142
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 196 place count 116 transition count 102
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 208 place count 110 transition count 102
Applied a total of 208 rules in 63 ms. Remains 110 /216 variables (removed 106) and now considering 102/198 (removed 96) transitions.
// Phase 1: matrix 102 rows 110 cols
[2025-06-01 00:05:09] [INFO ] Computed 21 invariants in 25 ms
[2025-06-01 00:05:09] [INFO ] Implicit Places using invariants in 296 ms returned [47, 48]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 329 ms to find 2 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 108/216 places, 102/198 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 108 transition count 101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 107 transition count 101
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 104 transition count 98
Applied a total of 8 rules in 8 ms. Remains 104 /108 variables (removed 4) and now considering 98/102 (removed 4) transitions.
// Phase 1: matrix 98 rows 104 cols
[2025-06-01 00:05:09] [INFO ] Computed 19 invariants in 2 ms
[2025-06-01 00:05:09] [INFO ] Implicit Places using invariants in 125 ms returned []
[2025-06-01 00:05:09] [INFO ] Invariant cache hit.
[2025-06-01 00:05:10] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-01 00:05:10] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 104/216 places, 98/198 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 798 ms. Remains : 104/216 places, 98/198 transitions.
Discarding 22 transitions out of 98. Remains 76
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (4903 resets) in 1684 ms. (23 steps per ms) remains 61/75 properties
BEST_FIRST walk for 4002 steps (289 resets) in 130 ms. (30 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (303 resets) in 70 ms. (56 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (312 resets) in 27 ms. (142 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4001 steps (311 resets) in 73 ms. (54 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (314 resets) in 47 ms. (83 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (285 resets) in 43 ms. (90 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4001 steps (294 resets) in 28 ms. (137 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (308 resets) in 42 ms. (93 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (298 resets) in 24 ms. (160 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (300 resets) in 26 ms. (148 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (282 resets) in 21 ms. (181 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4001 steps (297 resets) in 30 ms. (129 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4001 steps (293 resets) in 21 ms. (181 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4001 steps (310 resets) in 47 ms. (83 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4001 steps (294 resets) in 27 ms. (142 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4001 steps (296 resets) in 26 ms. (148 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (300 resets) in 26 ms. (148 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4001 steps (303 resets) in 30 ms. (129 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (287 resets) in 31 ms. (125 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4001 steps (285 resets) in 28 ms. (137 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (302 resets) in 24 ms. (160 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (298 resets) in 24 ms. (160 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (304 resets) in 32 ms. (121 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (299 resets) in 40 ms. (97 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4001 steps (294 resets) in 51 ms. (76 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (299 resets) in 27 ms. (142 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (312 resets) in 38 ms. (102 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (302 resets) in 33 ms. (117 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4001 steps (303 resets) in 42 ms. (93 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4001 steps (301 resets) in 33 ms. (117 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (311 resets) in 38 ms. (102 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (307 resets) in 42 ms. (93 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (293 resets) in 42 ms. (93 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4001 steps (294 resets) in 30 ms. (129 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (295 resets) in 36 ms. (108 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (291 resets) in 45 ms. (86 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (293 resets) in 40 ms. (97 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4001 steps (295 resets) in 31 ms. (125 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (293 resets) in 34 ms. (114 steps per ms) remains 55/61 properties
BEST_FIRST walk for 4000 steps (312 resets) in 30 ms. (129 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (309 resets) in 26 ms. (148 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (293 resets) in 28 ms. (138 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (298 resets) in 25 ms. (153 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (304 resets) in 34 ms. (114 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (282 resets) in 27 ms. (142 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (303 resets) in 24 ms. (160 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (284 resets) in 29 ms. (133 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (302 resets) in 38 ms. (102 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (315 resets) in 22 ms. (174 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (289 resets) in 23 ms. (166 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (307 resets) in 26 ms. (148 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (295 resets) in 30 ms. (129 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (298 resets) in 30 ms. (129 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (303 resets) in 22 ms. (174 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (274 resets) in 20 ms. (190 steps per ms) remains 51/55 properties
BEST_FIRST walk for 4002 steps (301 resets) in 33 ms. (117 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (298 resets) in 23 ms. (166 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4000 steps (301 resets) in 21 ms. (181 steps per ms) remains 51/51 properties
[2025-06-01 00:05:11] [INFO ] Invariant cache hit.
[2025-06-01 00:05:11] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (OVERLAPS) 21/93 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (OVERLAPS) 3/96 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2025-06-01 00:05:12] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (OVERLAPS) 4/100 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 9 (OVERLAPS) 98/198 variables, 100/120 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 8/128 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/198 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 12 (OVERLAPS) 4/202 variables, 4/132 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/202 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 14 (OVERLAPS) 0/202 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 132 constraints, problems are : Problem set: 0 solved, 51 unsolved in 2322 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 104/104 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 51 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (OVERLAPS) 21/93 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (OVERLAPS) 3/96 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (OVERLAPS) 4/100 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2025-06-01 00:05:14] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/100 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 10 (OVERLAPS) 98/198 variables, 100/121 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/198 variables, 8/129 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/198 variables, 40/169 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/198 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 14 (OVERLAPS) 4/202 variables, 4/173 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/202 variables, 11/184 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/202 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 17 (OVERLAPS) 0/202 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 184 constraints, problems are : Problem set: 0 solved, 51 unsolved in 2895 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 104/104 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 2/2 constraints]
After SMT, in 5289ms problems are : Problem set: 0 solved, 51 unsolved
Parikh walk visited 2 properties in 7462 ms.
Support contains 71 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 98/98 transitions.
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 104 transition count 98
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 103 transition count 97
Applied a total of 3 rules in 18 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 103/104 places, 97/98 transitions.
RANDOM walk for 4000000 steps (499772 resets) in 23844 ms. (167 steps per ms) remains 47/49 properties
BEST_FIRST walk for 400002 steps (33172 resets) in 2180 ms. (183 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400001 steps (33182 resets) in 1537 ms. (260 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400002 steps (33193 resets) in 1536 ms. (260 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400000 steps (33387 resets) in 1528 ms. (261 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400001 steps (33263 resets) in 1534 ms. (260 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400002 steps (33378 resets) in 1537 ms. (260 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400002 steps (33348 resets) in 1511 ms. (264 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400001 steps (33328 resets) in 1507 ms. (265 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400000 steps (33381 resets) in 1493 ms. (267 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400001 steps (33271 resets) in 1495 ms. (267 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400001 steps (33261 resets) in 1664 ms. (240 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400002 steps (33319 resets) in 1563 ms. (255 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400002 steps (33021 resets) in 1553 ms. (257 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400001 steps (33311 resets) in 1588 ms. (251 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400003 steps (33250 resets) in 1562 ms. (255 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400002 steps (33206 resets) in 1554 ms. (257 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400001 steps (33193 resets) in 1548 ms. (258 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400001 steps (33530 resets) in 1553 ms. (257 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400000 steps (33226 resets) in 1508 ms. (265 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400003 steps (33416 resets) in 1502 ms. (266 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400001 steps (33433 resets) in 1522 ms. (262 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400001 steps (33409 resets) in 1508 ms. (265 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400002 steps (33337 resets) in 1494 ms. (267 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400002 steps (33474 resets) in 1487 ms. (268 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400002 steps (33361 resets) in 1553 ms. (257 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400001 steps (33225 resets) in 1504 ms. (265 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400003 steps (33415 resets) in 1522 ms. (262 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400003 steps (33103 resets) in 1522 ms. (262 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400002 steps (33180 resets) in 1513 ms. (264 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400001 steps (33421 resets) in 1505 ms. (265 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400001 steps (33185 resets) in 1519 ms. (263 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400000 steps (33195 resets) in 1518 ms. (263 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400002 steps (33401 resets) in 1513 ms. (264 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400001 steps (33371 resets) in 1520 ms. (262 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400000 steps (33263 resets) in 1512 ms. (264 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400001 steps (33270 resets) in 1508 ms. (265 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400000 steps (33275 resets) in 1529 ms. (261 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400001 steps (33421 resets) in 1536 ms. (260 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400000 steps (33225 resets) in 1521 ms. (262 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400000 steps (33474 resets) in 1538 ms. (259 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400002 steps (33338 resets) in 1564 ms. (255 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400001 steps (33285 resets) in 1558 ms. (256 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400002 steps (33201 resets) in 1540 ms. (259 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400001 steps (33326 resets) in 1542 ms. (259 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400001 steps (33251 resets) in 1543 ms. (259 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400001 steps (33424 resets) in 1505 ms. (265 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400001 steps (33092 resets) in 1546 ms. (258 steps per ms) remains 47/47 properties
Probably explored full state space saw : 882644 states, properties seen :28
Probabilistic random walk after 1765367 steps, saw 882644 distinct states, run finished after 18956 ms. (steps per millisecond=93 ) properties seen :28
Interrupted probabilistic random walk after 8945548 steps, run timeout after 78001 ms. (steps per millisecond=114 ) properties seen :13 out of 19
Exhaustive walk after 8945548 steps, saw 4473120 distinct states, run finished after 78007 ms. (steps per millisecond=114 ) properties seen :13
// Phase 1: matrix 97 rows 103 cols
[2025-06-01 00:07:27] [INFO ] Computed 19 invariants in 8 ms
[2025-06-01 00:07:27] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 21/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 46/78 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 11/89 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2025-06-01 00:07:27] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 95/184 variables, 89/107 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 7/114 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/184 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 16/200 variables, 14/128 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/200 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/200 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/200 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/200 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 131 constraints, problems are : Problem set: 0 solved, 6 unsolved in 298 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 103/103 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 21/32 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 46/78 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 11/89 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 95/184 variables, 89/107 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 7/114 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/184 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/184 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 16/200 variables, 14/130 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/200 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/200 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/200 variables, 4/137 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2025-06-01 00:07:28] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2025-06-01 00:07:28] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2025-06-01 00:07:28] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/200 variables, 3/140 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/200 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 0/200 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 140 constraints, problems are : Problem set: 0 solved, 6 unsolved in 460 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 103/103 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 4/4 constraints]
After SMT, in 777ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 3959 ms.
Support contains 11 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 97/97 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 103 transition count 88
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 94 transition count 88
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 1 with 9 rules applied. Total rules applied 27 place count 94 transition count 88
Applied a total of 27 rules in 14 ms. Remains 94 /103 variables (removed 9) and now considering 88/97 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 94/103 places, 88/97 transitions.
RANDOM walk for 4000000 steps (508932 resets) in 13470 ms. (296 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000000 steps (337858 resets) in 8114 ms. (492 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000000 steps (337044 resets) in 7967 ms. (502 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000001 steps (337365 resets) in 8107 ms. (493 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000003 steps (336745 resets) in 7993 ms. (500 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000002 steps (337241 resets) in 7854 ms. (509 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000003 steps (337483 resets) in 8036 ms. (497 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 5330658 steps, run timeout after 48001 ms. (steps per millisecond=111 ) properties seen :0 out of 6
Probabilistic random walk after 5330658 steps, saw 2665238 distinct states, run finished after 48002 ms. (steps per millisecond=111 ) properties seen :0
// Phase 1: matrix 88 rows 94 cols
[2025-06-01 00:08:36] [INFO ] Computed 19 invariants in 3 ms
[2025-06-01 00:08:36] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 31/42 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 35/77 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 5/82 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 86/168 variables, 82/99 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 11/110 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/168 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 14/182 variables, 12/122 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/182 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/182 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/182 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 125 constraints, problems are : Problem set: 0 solved, 6 unsolved in 215 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 94/94 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 31/42 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 35/77 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 5/82 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2025-06-01 00:08:36] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 86/168 variables, 82/100 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/168 variables, 11/111 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/168 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/168 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 14/182 variables, 12/125 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/182 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/182 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/182 variables, 4/132 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2025-06-01 00:08:37] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2025-06-01 00:08:37] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2025-06-01 00:08:37] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/182 variables, 3/135 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2025-06-01 00:08:37] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/182 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/182 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 0/182 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 136 constraints, problems are : Problem set: 0 solved, 6 unsolved in 632 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 94/94 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 5/5 constraints]
After SMT, in 861ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 3801 ms.
Support contains 11 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 88/88 transitions.
Applied a total of 0 rules in 5 ms. Remains 94 /94 variables (removed 0) and now considering 88/88 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 94/94 places, 88/88 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 88/88 transitions.
Applied a total of 0 rules in 4 ms. Remains 94 /94 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2025-06-01 00:08:41] [INFO ] Invariant cache hit.
[2025-06-01 00:08:41] [INFO ] Implicit Places using invariants in 77 ms returned []
[2025-06-01 00:08:41] [INFO ] Invariant cache hit.
[2025-06-01 00:08:41] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-01 00:08:41] [INFO ] Implicit Places using invariants and state equation in 224 ms returned [20, 62, 67, 85, 91]
[2025-06-01 00:08:41] [INFO ] Actually due to overlaps returned [67, 62]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 306 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 92/94 places, 88/88 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 92 transition count 87
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 91 transition count 87
Applied a total of 2 rules in 10 ms. Remains 91 /92 variables (removed 1) and now considering 87/88 (removed 1) transitions.
// Phase 1: matrix 87 rows 91 cols
[2025-06-01 00:08:41] [INFO ] Computed 17 invariants in 4 ms
[2025-06-01 00:08:41] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-06-01 00:08:41] [INFO ] Invariant cache hit.
[2025-06-01 00:08:41] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-01 00:08:41] [INFO ] Implicit Places using invariants and state equation in 203 ms returned [20, 82, 88]
[2025-06-01 00:08:41] [INFO ] Actually due to overlaps returned [88, 82]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 278 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 89/94 places, 87/88 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 89 transition count 86
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 88 transition count 86
Applied a total of 2 rules in 10 ms. Remains 88 /89 variables (removed 1) and now considering 86/87 (removed 1) transitions.
// Phase 1: matrix 86 rows 88 cols
[2025-06-01 00:08:41] [INFO ] Computed 15 invariants in 2 ms
[2025-06-01 00:08:42] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-06-01 00:08:42] [INFO ] Invariant cache hit.
[2025-06-01 00:08:42] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-01 00:08:42] [INFO ] Implicit Places using invariants and state equation in 172 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 243 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 87/94 places, 86/88 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 87 transition count 86
Applied a total of 1 rules in 8 ms. Remains 87 /87 variables (removed 0) and now considering 86/86 (removed 0) transitions.
// Phase 1: matrix 86 rows 87 cols
[2025-06-01 00:08:42] [INFO ] Computed 14 invariants in 3 ms
[2025-06-01 00:08:42] [INFO ] Implicit Places using invariants in 61 ms returned []
[2025-06-01 00:08:42] [INFO ] Invariant cache hit.
[2025-06-01 00:08:42] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-01 00:08:42] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 87/94 places, 86/88 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 1110 ms. Remains : 87/94 places, 86/88 transitions.
RANDOM walk for 4000000 steps (573278 resets) in 11371 ms. (351 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000002 steps (363354 resets) in 7522 ms. (531 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000001 steps (364041 resets) in 7593 ms. (526 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000001 steps (363406 resets) in 7524 ms. (531 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000001 steps (363576 resets) in 7541 ms. (530 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000001 steps (364294 resets) in 7433 ms. (538 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000001 steps (364230 resets) in 7594 ms. (526 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 5049914 steps, run timeout after 42001 ms. (steps per millisecond=120 ) properties seen :0 out of 6
Probabilistic random walk after 5049914 steps, saw 2524689 distinct states, run finished after 42002 ms. (steps per millisecond=120 ) properties seen :0
[2025-06-01 00:09:39] [INFO ] Invariant cache hit.
[2025-06-01 00:09:39] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 45/56 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 19/75 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2025-06-01 00:09:39] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 84/159 variables, 75/88 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 11/99 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 14/173 variables, 12/111 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/173 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/173 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/173 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/173 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 173/173 variables, and 114 constraints, problems are : Problem set: 0 solved, 6 unsolved in 281 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 87/87 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 45/56 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 19/75 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 84/159 variables, 75/88 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 11/99 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 14/173 variables, 12/113 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/173 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/173 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/173 variables, 4/120 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2025-06-01 00:09:39] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2025-06-01 00:09:39] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/173 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/173 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/173 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 173/173 variables, and 122 constraints, problems are : Problem set: 0 solved, 6 unsolved in 345 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 87/87 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 3/3 constraints]
After SMT, in 634ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 4657 ms.
Support contains 11 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 86/86 transitions.
Applied a total of 0 rules in 4 ms. Remains 87 /87 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 87/87 places, 86/86 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 86/86 transitions.
Applied a total of 0 rules in 3 ms. Remains 87 /87 variables (removed 0) and now considering 86/86 (removed 0) transitions.
[2025-06-01 00:09:44] [INFO ] Invariant cache hit.
[2025-06-01 00:09:44] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-06-01 00:09:44] [INFO ] Invariant cache hit.
[2025-06-01 00:09:44] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-01 00:09:44] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
[2025-06-01 00:09:44] [INFO ] Redundant transitions in 1 ms returned []
Running 85 sub problems to find dead transitions.
[2025-06-01 00:09:44] [INFO ] Invariant cache hit.
[2025-06-01 00:09:44] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (OVERLAPS) 86/172 variables, 86/100 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 12/112 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 85 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/173 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (OVERLAPS) 0/173 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 173/173 variables, and 113 constraints, problems are : Problem set: 0 solved, 85 unsolved in 1693 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 87/87 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (OVERLAPS) 86/172 variables, 86/100 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 12/112 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 82/194 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (OVERLAPS) 1/173 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 3/198 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2025-06-01 00:09:49] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/173 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/173 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 11 (OVERLAPS) 0/173 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 173/173 variables, and 199 constraints, problems are : Problem set: 0 solved, 85 unsolved in 4772 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 87/87 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 1/1 constraints]
After SMT, in 6488ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 6491ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6738 ms. Remains : 87/87 places, 86/86 transitions.
RANDOM walk for 400000 steps (57164 resets) in 3059 ms. (130 steps per ms) remains 11/11 properties
Running SMT prover for 11 properties.
[2025-06-01 00:09:52] [INFO ] Invariant cache hit.
[2025-06-01 00:09:52] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 00:09:52] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 4 ms returned sat
[2025-06-01 00:09:52] [INFO ] After 43ms SMT Verify possible using state equation in real domain returned unsat :0 sat :11
[2025-06-01 00:09:52] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-01 00:09:52] [INFO ] After 22ms SMT Verify possible using 12 Read/Feed constraints in real domain returned unsat :0 sat :11
TRAPS : Iteration 0
[2025-06-01 00:09:52] [INFO ] After 113ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:11
[2025-06-01 00:09:52] [INFO ] After 209ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2025-06-01 00:09:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 00:09:52] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 3 ms returned sat
[2025-06-01 00:09:52] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2025-06-01 00:09:52] [INFO ] After 29ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :11
TRAPS : Iteration 0
[2025-06-01 00:09:52] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2025-06-01 00:09:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
TRAPS : Iteration 1
[2025-06-01 00:09:53] [INFO ] After 248ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
[2025-06-01 00:09:53] [INFO ] After 353ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
RANDOM walk for 4000000 steps (571104 resets) in 12148 ms. (329 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000002 steps (363736 resets) in 7566 ms. (528 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000002 steps (363481 resets) in 7609 ms. (525 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000004 steps (364107 resets) in 7635 ms. (523 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000000 steps (363748 resets) in 7669 ms. (521 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000001 steps (363507 resets) in 7740 ms. (516 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000002 steps (363429 resets) in 7735 ms. (517 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 5355760 steps, run timeout after 45001 ms. (steps per millisecond=119 ) properties seen :0 out of 6
Probabilistic random walk after 5355760 steps, saw 2677554 distinct states, run finished after 45001 ms. (steps per millisecond=119 ) properties seen :0
[2025-06-01 00:10:53] [INFO ] Invariant cache hit.
[2025-06-01 00:10:53] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 45/56 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 19/75 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2025-06-01 00:10:53] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 84/159 variables, 75/88 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 11/99 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 14/173 variables, 12/111 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/173 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/173 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/173 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/173 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 173/173 variables, and 114 constraints, problems are : Problem set: 0 solved, 6 unsolved in 272 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 87/87 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 45/56 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 19/75 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 84/159 variables, 75/88 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 11/99 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 14/173 variables, 12/113 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/173 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/173 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/173 variables, 4/120 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2025-06-01 00:10:53] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2025-06-01 00:10:53] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/173 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/173 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/173 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 173/173 variables, and 122 constraints, problems are : Problem set: 0 solved, 6 unsolved in 316 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 87/87 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 3/3 constraints]
After SMT, in 594ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 3504 ms.
Support contains 11 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 86/86 transitions.
Applied a total of 0 rules in 4 ms. Remains 87 /87 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 87/87 places, 86/86 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 86/86 transitions.
Applied a total of 0 rules in 3 ms. Remains 87 /87 variables (removed 0) and now considering 86/86 (removed 0) transitions.
[2025-06-01 00:10:57] [INFO ] Invariant cache hit.
[2025-06-01 00:10:57] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-01 00:10:57] [INFO ] Invariant cache hit.
[2025-06-01 00:10:57] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-01 00:10:57] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
[2025-06-01 00:10:57] [INFO ] Redundant transitions in 1 ms returned []
Running 85 sub problems to find dead transitions.
[2025-06-01 00:10:57] [INFO ] Invariant cache hit.
[2025-06-01 00:10:57] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (OVERLAPS) 86/172 variables, 86/100 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 12/112 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 85 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/173 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (OVERLAPS) 0/173 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 173/173 variables, and 113 constraints, problems are : Problem set: 0 solved, 85 unsolved in 1725 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 87/87 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (OVERLAPS) 86/172 variables, 86/100 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 12/112 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 82/194 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (OVERLAPS) 1/173 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 3/198 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2025-06-01 00:11:01] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/173 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/173 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 11 (OVERLAPS) 0/173 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 173/173 variables, and 199 constraints, problems are : Problem set: 0 solved, 85 unsolved in 4545 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 87/87 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 1/1 constraints]
After SMT, in 6295ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 6299ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6550 ms. Remains : 87/87 places, 86/86 transitions.
RANDOM walk for 400000 steps (57038 resets) in 1409 ms. (283 steps per ms) remains 11/11 properties
Running SMT prover for 11 properties.
[2025-06-01 00:11:04] [INFO ] Invariant cache hit.
[2025-06-01 00:11:04] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2025-06-01 00:11:04] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 3 ms returned sat
[2025-06-01 00:11:04] [INFO ] After 40ms SMT Verify possible using state equation in real domain returned unsat :0 sat :11
[2025-06-01 00:11:04] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-01 00:11:04] [INFO ] After 27ms SMT Verify possible using 12 Read/Feed constraints in real domain returned unsat :0 sat :11
TRAPS : Iteration 0
[2025-06-01 00:11:04] [INFO ] After 121ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:11
[2025-06-01 00:11:04] [INFO ] After 210ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2025-06-01 00:11:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2025-06-01 00:11:04] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 3 ms returned sat
[2025-06-01 00:11:04] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2025-06-01 00:11:04] [INFO ] After 28ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :11
TRAPS : Iteration 0
[2025-06-01 00:11:04] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2025-06-01 00:11:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
TRAPS : Iteration 1
[2025-06-01 00:11:04] [INFO ] After 235ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
[2025-06-01 00:11:04] [INFO ] After 334ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
RANDOM walk for 40000 steps (5749 resets) in 150 ms. (264 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3627 resets) in 166 ms. (239 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1075093 steps, run timeout after 3001 ms. (steps per millisecond=358 ) properties seen :0 out of 1
Probabilistic random walk after 1075093 steps, saw 537668 distinct states, run finished after 3001 ms. (steps per millisecond=358 ) properties seen :0
[2025-06-01 00:11:07] [INFO ] Invariant cache hit.
[2025-06-01 00:11:07] [INFO ] State equation strengthened by 12 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) 21/65 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 76/141 variables, 65/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 10/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 26/167 variables, 17/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/167 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/167 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/167 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/169 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/169 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/169 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/173 variables, 3/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/173 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/173 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/173 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 173/173 variables, and 113 constraints, problems are : Problem set: 0 solved, 1 unsolved in 127 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 87/87 constraints, ReadFeed: 12/12 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) 21/65 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 76/141 variables, 65/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 10/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 26/167 variables, 17/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/167 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/167 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:11:08] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/167 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/167 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/169 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/169 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:11:08] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2025-06-01 00:11:08] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/169 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/169 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 4/173 variables, 3/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/173 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/173 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/173 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 173/173 variables, and 117 constraints, problems are : Problem set: 0 solved, 1 unsolved in 254 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 87/87 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 390ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 61 ms.
Support contains 1 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 86/86 transitions.
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 87 transition count 82
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 8 place count 83 transition count 82
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 11 place count 83 transition count 82
Applied a total of 11 rules in 20 ms. Remains 83 /87 variables (removed 4) and now considering 82/86 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 83/87 places, 82/86 transitions.
RANDOM walk for 40000 steps (5736 resets) in 164 ms. (242 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3634 resets) in 94 ms. (421 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1086961 steps, run timeout after 3001 ms. (steps per millisecond=362 ) properties seen :0 out of 1
Probabilistic random walk after 1086961 steps, saw 543596 distinct states, run finished after 3001 ms. (steps per millisecond=362 ) properties seen :0
// Phase 1: matrix 82 rows 83 cols
[2025-06-01 00:11:11] [INFO ] Computed 14 invariants in 3 ms
[2025-06-01 00:11:11] [INFO ] State equation strengthened by 14 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) 21/63 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 74/137 variables, 63/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 10/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 25/162 variables, 17/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/162 variables, 4/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/162 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/163 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/163 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/163 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/165 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/165 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/165 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 165/165 variables, and 111 constraints, problems are : Problem set: 0 solved, 1 unsolved in 94 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 83/83 constraints, ReadFeed: 14/14 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) 21/63 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 74/137 variables, 63/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 10/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 25/162 variables, 17/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/162 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/162 variables, 4/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/162 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/163 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/163 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/163 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/165 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:11:11] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/165 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/165 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/165 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 165/165 variables, and 113 constraints, problems are : Problem set: 0 solved, 1 unsolved in 181 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 83/83 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 281ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 55 ms.
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 82/82 transitions.
Applied a total of 0 rules in 3 ms. Remains 83 /83 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 83/83 places, 82/82 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 82/82 transitions.
Applied a total of 0 rules in 3 ms. Remains 83 /83 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2025-06-01 00:11:11] [INFO ] Invariant cache hit.
[2025-06-01 00:11:11] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-01 00:11:11] [INFO ] Invariant cache hit.
[2025-06-01 00:11:12] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-01 00:11:12] [INFO ] Implicit Places using invariants and state equation in 176 ms returned [25]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 243 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 82/83 places, 82/82 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 82 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 81 transition count 81
Applied a total of 2 rules in 7 ms. Remains 81 /82 variables (removed 1) and now considering 81/82 (removed 1) transitions.
// Phase 1: matrix 81 rows 81 cols
[2025-06-01 00:11:12] [INFO ] Computed 13 invariants in 4 ms
[2025-06-01 00:11:12] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-06-01 00:11:12] [INFO ] Invariant cache hit.
[2025-06-01 00:11:12] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-01 00:11:12] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 81/83 places, 81/82 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 505 ms. Remains : 81/83 places, 81/82 transitions.
RANDOM walk for 40000 steps (5717 resets) in 127 ms. (312 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3610 resets) in 94 ms. (421 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1082474 steps, run timeout after 3001 ms. (steps per millisecond=360 ) properties seen :0 out of 1
Probabilistic random walk after 1082474 steps, saw 541350 distinct states, run finished after 3001 ms. (steps per millisecond=360 ) properties seen :0
[2025-06-01 00:11:15] [INFO ] Invariant cache hit.
[2025-06-01 00:11:15] [INFO ] State equation strengthened by 14 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) 20/61 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 73/134 variables, 61/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 10/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 25/159 variables, 17/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/159 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/159 variables, 4/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/159 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/160 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/160 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/160 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/162 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/162 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/162 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 108 constraints, problems are : Problem set: 0 solved, 1 unsolved in 88 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 81/81 constraints, ReadFeed: 14/14 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) 20/61 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:11:15] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 73/134 variables, 61/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 10/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/134 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 25/159 variables, 17/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/159 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/159 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/159 variables, 4/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/159 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/160 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/160 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/160 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/162 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:11:15] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/162 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/162 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/162 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 111 constraints, problems are : Problem set: 0 solved, 1 unsolved in 169 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 81/81 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 259ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 56 ms.
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 3 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 81/81 places, 81/81 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2025-06-01 00:11:15] [INFO ] Invariant cache hit.
[2025-06-01 00:11:15] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-01 00:11:15] [INFO ] Invariant cache hit.
[2025-06-01 00:11:15] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-01 00:11:16] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
[2025-06-01 00:11:16] [INFO ] Redundant transitions in 1 ms returned []
Running 80 sub problems to find dead transitions.
[2025-06-01 00:11:16] [INFO ] Invariant cache hit.
[2025-06-01 00:11:16] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 81/161 variables, 80/93 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 14/107 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 80 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/162 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 0/162 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 108 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1550 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 81/81 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 81/161 variables, 80/93 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 14/107 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 77/184 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (OVERLAPS) 1/162 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 3/188 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2025-06-01 00:11:20] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 10 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/162 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2025-06-01 00:11:21] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/162 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/162 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 13 (OVERLAPS) 0/162 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 190 constraints, problems are : Problem set: 0 solved, 80 unsolved in 6170 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 81/81 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 2/2 constraints]
After SMT, in 7740ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 7743ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7992 ms. Remains : 81/81 places, 81/81 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 81 transition count 75
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 75 transition count 75
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 72 transition count 72
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 72 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 71 transition count 71
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 71 transition count 69
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 69 transition count 69
Applied a total of 24 rules in 11 ms. Remains 69 /81 variables (removed 12) and now considering 69/81 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 69 rows 69 cols
[2025-06-01 00:11:23] [INFO ] Computed 13 invariants in 1 ms
[2025-06-01 00:11:23] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 00:11:23] [INFO ] [Real]Absence check using 2 positive and 11 generalized place invariants in 2 ms returned sat
[2025-06-01 00:11:23] [INFO ] After 21ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2025-06-01 00:11:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 00:11:23] [INFO ] After 5ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 00:11:23] [INFO ] After 11ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2025-06-01 00:11:23] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 75 ms.
RANDOM walk for 40000 steps (5781 resets) in 119 ms. (333 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3657 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1069424 steps, run timeout after 3001 ms. (steps per millisecond=356 ) properties seen :0 out of 1
Probabilistic random walk after 1069424 steps, saw 534816 distinct states, run finished after 3001 ms. (steps per millisecond=356 ) properties seen :0
// Phase 1: matrix 86 rows 87 cols
[2025-06-01 00:11:26] [INFO ] Computed 14 invariants in 4 ms
[2025-06-01 00:11:26] [INFO ] State equation strengthened by 12 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) 21/65 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:11:26] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 76/141 variables, 65/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 10/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 26/167 variables, 17/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/167 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/167 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/167 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/169 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/169 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/169 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/173 variables, 3/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/173 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/173 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/173 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 173/173 variables, and 114 constraints, problems are : Problem set: 0 solved, 1 unsolved in 122 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 87/87 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/65 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 76/141 variables, 65/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 10/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 26/167 variables, 17/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/167 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/167 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/167 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/167 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/169 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/169 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/169 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/173 variables, 3/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/173 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/173 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/173 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 173/173 variables, and 115 constraints, problems are : Problem set: 0 solved, 1 unsolved in 97 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 87/87 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 235ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 54 ms.
Support contains 1 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 86/86 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 87 transition count 85
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 86 transition count 85
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 6 place count 86 transition count 85
Applied a total of 6 rules in 7 ms. Remains 86 /87 variables (removed 1) and now considering 85/86 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 86/87 places, 85/86 transitions.
RANDOM walk for 40000 steps (5792 resets) in 160 ms. (248 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3620 resets) in 129 ms. (307 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1059281 steps, run timeout after 3001 ms. (steps per millisecond=352 ) properties seen :0 out of 1
Probabilistic random walk after 1059281 steps, saw 529744 distinct states, run finished after 3001 ms. (steps per millisecond=352 ) properties seen :0
// Phase 1: matrix 85 rows 86 cols
[2025-06-01 00:11:30] [INFO ] Computed 14 invariants in 3 ms
[2025-06-01 00:11:30] [INFO ] State equation strengthened by 14 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) 21/64 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:11:30] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 75/139 variables, 64/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 10/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 28/167 variables, 18/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/167 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/167 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/167 variables, 4/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/167 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/168 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/168 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/168 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3/171 variables, 3/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/171 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/171 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 171/171 variables, and 115 constraints, problems are : Problem set: 0 solved, 1 unsolved in 133 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 86/86 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 42/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/64 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 75/139 variables, 64/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 10/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 28/167 variables, 18/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/167 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/167 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/167 variables, 4/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/167 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:11:30] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2025-06-01 00:11:30] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/167 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/167 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/168 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/168 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:11:30] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/168 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/168 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 3/171 variables, 3/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:11:30] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 3 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/171 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/171 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/171 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 171/171 variables, and 120 constraints, problems are : Problem set: 0 solved, 1 unsolved in 225 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 86/86 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 366ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 59 ms.
Support contains 1 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 85/85 transitions.
Applied a total of 0 rules in 2 ms. Remains 86 /86 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 86/86 places, 85/85 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 85/85 transitions.
Applied a total of 0 rules in 2 ms. Remains 86 /86 variables (removed 0) and now considering 85/85 (removed 0) transitions.
[2025-06-01 00:11:30] [INFO ] Invariant cache hit.
[2025-06-01 00:11:30] [INFO ] Implicit Places using invariants in 99 ms returned []
[2025-06-01 00:11:30] [INFO ] Invariant cache hit.
[2025-06-01 00:11:30] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-01 00:11:30] [INFO ] Implicit Places using invariants and state equation in 152 ms returned [25]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 263 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 85/86 places, 85/85 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 85 transition count 84
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 84 transition count 84
Applied a total of 2 rules in 6 ms. Remains 84 /85 variables (removed 1) and now considering 84/85 (removed 1) transitions.
// Phase 1: matrix 84 rows 84 cols
[2025-06-01 00:11:30] [INFO ] Computed 13 invariants in 1 ms
[2025-06-01 00:11:31] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-01 00:11:31] [INFO ] Invariant cache hit.
[2025-06-01 00:11:31] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-01 00:11:31] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 84/86 places, 84/85 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 500 ms. Remains : 84/86 places, 84/85 transitions.
RANDOM walk for 40000 steps (5743 resets) in 125 ms. (317 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3599 resets) in 75 ms. (526 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1075210 steps, run timeout after 3001 ms. (steps per millisecond=358 ) properties seen :0 out of 1
Probabilistic random walk after 1075210 steps, saw 537725 distinct states, run finished after 3002 ms. (steps per millisecond=358 ) properties seen :0
[2025-06-01 00:11:34] [INFO ] Invariant cache hit.
[2025-06-01 00:11:34] [INFO ] State equation strengthened by 14 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, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/62 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 74/136 variables, 62/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 10/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 28/164 variables, 18/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/164 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/164 variables, 4/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/164 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/165 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/165 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/165 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3/168 variables, 3/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/168 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/168 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 111 constraints, problems are : Problem set: 0 solved, 1 unsolved in 119 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 84/84 constraints, ReadFeed: 14/14 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, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/62 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:11:34] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 74/136 variables, 62/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 10/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 28/164 variables, 18/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/164 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/164 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/164 variables, 4/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/164 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:11:34] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/164 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/164 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/165 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/165 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/165 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 3/168 variables, 3/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/168 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/168 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 114 constraints, problems are : Problem set: 0 solved, 1 unsolved in 157 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 84/84 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 281ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 100 ms.
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 84/84 transitions.
Applied a total of 0 rules in 2 ms. Remains 84 /84 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 84/84 places, 84/84 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 84/84 transitions.
Applied a total of 0 rules in 2 ms. Remains 84 /84 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2025-06-01 00:11:34] [INFO ] Invariant cache hit.
[2025-06-01 00:11:34] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-06-01 00:11:34] [INFO ] Invariant cache hit.
[2025-06-01 00:11:34] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-01 00:11:34] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
[2025-06-01 00:11:34] [INFO ] Redundant transitions in 1 ms returned []
Running 83 sub problems to find dead transitions.
[2025-06-01 00:11:34] [INFO ] Invariant cache hit.
[2025-06-01 00:11:34] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (OVERLAPS) 84/167 variables, 83/96 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 14/110 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 83 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/168 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (OVERLAPS) 0/168 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 111 constraints, problems are : Problem set: 0 solved, 83 unsolved in 1723 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 84/84 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (OVERLAPS) 84/167 variables, 83/96 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 14/110 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 80/190 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (OVERLAPS) 1/168 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 3/194 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/168 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 10 (OVERLAPS) 0/168 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 194 constraints, problems are : Problem set: 0 solved, 83 unsolved in 4380 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 84/84 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints]
After SMT, in 6138ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 6140ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6389 ms. Remains : 84/84 places, 84/84 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 84 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 83 transition count 83
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2 place count 83 transition count 77
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 77 transition count 77
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 17 place count 74 transition count 74
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 place count 74 transition count 74
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 73 transition count 73
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 73 transition count 72
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 72 transition count 72
Applied a total of 24 rules in 11 ms. Remains 72 /84 variables (removed 12) and now considering 72/84 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 72 rows 72 cols
[2025-06-01 00:11:41] [INFO ] Computed 13 invariants in 1 ms
[2025-06-01 00:11:41] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2025-06-01 00:11:41] [INFO ] [Real]Absence check using 2 positive and 11 generalized place invariants in 3 ms returned sat
[2025-06-01 00:11:41] [INFO ] After 25ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2025-06-01 00:11:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 00:11:41] [INFO ] After 5ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 00:11:41] [INFO ] After 13ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2025-06-01 00:11:41] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 89 ms.
RANDOM walk for 40000 steps (5727 resets) in 111 ms. (357 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3629 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1064748 steps, run timeout after 3001 ms. (steps per millisecond=354 ) properties seen :0 out of 1
Probabilistic random walk after 1064748 steps, saw 532482 distinct states, run finished after 3001 ms. (steps per millisecond=354 ) properties seen :0
// Phase 1: matrix 86 rows 87 cols
[2025-06-01 00:11:44] [INFO ] Computed 14 invariants in 3 ms
[2025-06-01 00:11:44] [INFO ] State equation strengthened by 12 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, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/65 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:11:44] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 76/141 variables, 65/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 10/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 26/167 variables, 17/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/167 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/167 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/167 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/169 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/169 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/169 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/173 variables, 3/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/173 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/173 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/173 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 173/173 variables, and 114 constraints, problems are : Problem set: 0 solved, 1 unsolved in 134 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 87/87 constraints, ReadFeed: 12/12 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/65 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 76/141 variables, 65/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 10/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 26/167 variables, 17/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/167 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/167 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/167 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:11:44] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/167 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/167 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/169 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/169 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/169 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 4/173 variables, 3/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/173 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/173 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/173 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 173/173 variables, and 116 constraints, problems are : Problem set: 0 solved, 1 unsolved in 159 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 87/87 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 307ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 33 ms.
Support contains 1 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 86/86 transitions.
Graph (complete) has 319 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 86 transition count 85
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 86 transition count 83
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 84 transition count 83
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 9 place count 84 transition count 83
Applied a total of 9 rules in 19 ms. Remains 84 /87 variables (removed 3) and now considering 83/86 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 84/87 places, 83/86 transitions.
RANDOM walk for 40000 steps (5704 resets) in 108 ms. (366 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3668 resets) in 84 ms. (470 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1068058 steps, run timeout after 3001 ms. (steps per millisecond=355 ) properties seen :0 out of 1
Probabilistic random walk after 1068058 steps, saw 534139 distinct states, run finished after 3001 ms. (steps per millisecond=355 ) properties seen :0
// Phase 1: matrix 83 rows 84 cols
[2025-06-01 00:11:47] [INFO ] Computed 14 invariants in 2 ms
[2025-06-01 00:11:47] [INFO ] State equation strengthened by 14 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) 58/59 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:11:47] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 2/61 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 18/79 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:11:47] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 83/162 variables, 79/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 14/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/162 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 5/167 variables, 5/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/167 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/167 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/167 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 114 constraints, problems are : Problem set: 0 solved, 1 unsolved in 162 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 84/84 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 58/59 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 2/61 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 18/79 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 83/162 variables, 79/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 14/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/162 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/162 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/167 variables, 5/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/167 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/167 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/167 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 115 constraints, problems are : Problem set: 0 solved, 1 unsolved in 77 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 84/84 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 244ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 31 ms.
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 83/83 transitions.
Applied a total of 0 rules in 2 ms. Remains 84 /84 variables (removed 0) and now considering 83/83 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 84/84 places, 83/83 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 83/83 transitions.
Applied a total of 0 rules in 2 ms. Remains 84 /84 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2025-06-01 00:11:47] [INFO ] Invariant cache hit.
[2025-06-01 00:11:48] [INFO ] Implicit Places using invariants in 78 ms returned []
[2025-06-01 00:11:48] [INFO ] Invariant cache hit.
[2025-06-01 00:11:48] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-01 00:11:48] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
[2025-06-01 00:11:48] [INFO ] Redundant transitions in 1 ms returned []
Running 82 sub problems to find dead transitions.
[2025-06-01 00:11:48] [INFO ] Invariant cache hit.
[2025-06-01 00:11:48] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (OVERLAPS) 1/84 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (OVERLAPS) 83/167 variables, 84/98 constraints. Problems are: Problem set: 0 solved, 82 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 14/112 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (OVERLAPS) 0/167 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 112 constraints, problems are : Problem set: 0 solved, 82 unsolved in 1323 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 84/84 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (OVERLAPS) 1/84 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (OVERLAPS) 83/167 variables, 84/98 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 14/112 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 82/194 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2025-06-01 00:11:50] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/167 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2025-06-01 00:11:52] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 3 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/167 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/167 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 12 (OVERLAPS) 0/167 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 196 constraints, problems are : Problem set: 0 solved, 82 unsolved in 4843 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 84/84 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 2/2 constraints]
After SMT, in 6186ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 6188ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6462 ms. Remains : 84/84 places, 83/83 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 84 transition count 77
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 78 transition count 77
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 76 transition count 75
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 76 transition count 75
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 18 place count 75 transition count 74
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 75 transition count 73
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 20 place count 74 transition count 73
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 74 transition count 73
Applied a total of 21 rules in 6 ms. Remains 74 /84 variables (removed 10) and now considering 73/83 (removed 10) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 73 rows 74 cols
[2025-06-01 00:11:54] [INFO ] Computed 14 invariants in 1 ms
[2025-06-01 00:11:54] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-01 00:11:54] [INFO ] [Real]Absence check using 4 positive and 10 generalized place invariants in 2 ms returned sat
[2025-06-01 00:11:54] [INFO ] After 25ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2025-06-01 00:11:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 00:11:54] [INFO ] After 4ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 00:11:54] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 00:11:54] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-01 00:11:54] [INFO ] [Nat]Absence check using 4 positive and 10 generalized place invariants in 2 ms returned sat
[2025-06-01 00:11:54] [INFO ] After 28ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 00:11:54] [INFO ] After 3ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 00:11:54] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 00:11:54] [INFO ] After 75ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 138 ms.
RANDOM walk for 40000 steps (5690 resets) in 104 ms. (380 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3683 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1052690 steps, run timeout after 3001 ms. (steps per millisecond=350 ) properties seen :0 out of 1
Probabilistic random walk after 1052690 steps, saw 526453 distinct states, run finished after 3001 ms. (steps per millisecond=350 ) properties seen :0
// Phase 1: matrix 86 rows 87 cols
[2025-06-01 00:11:57] [INFO ] Computed 14 invariants in 4 ms
[2025-06-01 00:11:57] [INFO ] State equation strengthened by 12 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) 25/65 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:11:57] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 76/141 variables, 65/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 10/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 26/167 variables, 17/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/167 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/167 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/167 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/169 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/169 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/169 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/173 variables, 3/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/173 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/173 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/173 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 173/173 variables, and 114 constraints, problems are : Problem set: 0 solved, 1 unsolved in 132 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 87/87 constraints, ReadFeed: 12/12 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) 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) 25/65 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 76/141 variables, 65/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 10/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/141 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 26/167 variables, 17/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/167 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/167 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:11:57] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
[2025-06-01 00:11:57] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/167 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/167 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/169 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/169 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/169 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 4/173 variables, 3/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/173 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/173 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/173 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 173/173 variables, and 117 constraints, problems are : Problem set: 0 solved, 1 unsolved in 180 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 87/87 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 321ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 47 ms.
Support contains 1 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 86/86 transitions.
Graph (complete) has 319 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 86 transition count 85
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 5 place count 86 transition count 82
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 83 transition count 82
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 11 place count 83 transition count 82
Applied a total of 11 rules in 7 ms. Remains 83 /87 variables (removed 4) and now considering 82/86 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 83/87 places, 82/86 transitions.
RANDOM walk for 40000 steps (5794 resets) in 133 ms. (298 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3667 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1056484 steps, run timeout after 3001 ms. (steps per millisecond=352 ) properties seen :0 out of 1
Probabilistic random walk after 1056484 steps, saw 528346 distinct states, run finished after 3003 ms. (steps per millisecond=351 ) properties seen :0
// Phase 1: matrix 82 rows 83 cols
[2025-06-01 00:12:01] [INFO ] Computed 14 invariants in 4 ms
[2025-06-01 00:12:01] [INFO ] State equation strengthened by 14 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) 21/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 38/60 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:12:01] [INFO ] Deduced a trap composed of 42 places in 34 ms of which 1 ms to minimize.
[2025-06-01 00:12:01] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 18/78 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:12:01] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2025-06-01 00:12:01] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2025-06-01 00:12:01] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2025-06-01 00:12:01] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2025-06-01 00:12:01] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/78 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 82/160 variables, 78/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/160 variables, 14/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/160 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 5/165 variables, 5/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/165 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/165 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/165 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 165/165 variables, and 118 constraints, problems are : Problem set: 0 solved, 1 unsolved in 383 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 83/83 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 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) 21/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 38/60 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:12:01] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 0 ms to minimize.
[2025-06-01 00:12:01] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 18/78 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/78 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/78 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 82/160 variables, 78/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/160 variables, 14/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/160 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/160 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/165 variables, 5/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/165 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/165 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/165 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 165/165 variables, and 121 constraints, problems are : Problem set: 0 solved, 1 unsolved in 180 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 83/83 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 576ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 44 ms.
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 82/82 transitions.
Applied a total of 0 rules in 2 ms. Remains 83 /83 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 83/83 places, 82/82 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 82/82 transitions.
Applied a total of 0 rules in 5 ms. Remains 83 /83 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2025-06-01 00:12:01] [INFO ] Invariant cache hit.
[2025-06-01 00:12:01] [INFO ] Implicit Places using invariants in 73 ms returned [25]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 74 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 82/83 places, 82/82 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 82 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 81 transition count 81
Applied a total of 2 rules in 6 ms. Remains 81 /82 variables (removed 1) and now considering 81/82 (removed 1) transitions.
// Phase 1: matrix 81 rows 81 cols
[2025-06-01 00:12:01] [INFO ] Computed 13 invariants in 1 ms
[2025-06-01 00:12:01] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-01 00:12:01] [INFO ] Invariant cache hit.
[2025-06-01 00:12:01] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-01 00:12:01] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 81/83 places, 81/82 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 304 ms. Remains : 81/83 places, 81/82 transitions.
RANDOM walk for 40000 steps (5768 resets) in 126 ms. (314 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3658 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1058964 steps, run timeout after 3001 ms. (steps per millisecond=352 ) properties seen :0 out of 1
Probabilistic random walk after 1058964 steps, saw 529586 distinct states, run finished after 3001 ms. (steps per millisecond=352 ) properties seen :0
[2025-06-01 00:12:05] [INFO ] Invariant cache hit.
[2025-06-01 00:12:05] [INFO ] State equation strengthened by 14 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) 21/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/58 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 18/76 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:12:05] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2025-06-01 00:12:05] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 81/157 variables, 76/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 14/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:12:05] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/157 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/157 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 5/162 variables, 5/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/162 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/162 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/162 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 111 constraints, problems are : Problem set: 0 solved, 1 unsolved in 302 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/58 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:12:05] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 0 ms to minimize.
[2025-06-01 00:12:05] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 18/76 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:12:05] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2025-06-01 00:12:05] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2025-06-01 00:12:05] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2025-06-01 00:12:05] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/76 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 81/157 variables, 76/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/157 variables, 14/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/157 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/157 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/162 variables, 5/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/162 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/162 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/162 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 118 constraints, problems are : Problem set: 0 solved, 1 unsolved in 326 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 632ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 43 ms.
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 81/81 places, 81/81 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2025-06-01 00:12:05] [INFO ] Invariant cache hit.
[2025-06-01 00:12:05] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-06-01 00:12:05] [INFO ] Invariant cache hit.
[2025-06-01 00:12:05] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-01 00:12:05] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
[2025-06-01 00:12:05] [INFO ] Redundant transitions in 1 ms returned []
Running 80 sub problems to find dead transitions.
[2025-06-01 00:12:05] [INFO ] Invariant cache hit.
[2025-06-01 00:12:05] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 81/162 variables, 81/94 constraints. Problems are: Problem set: 0 solved, 80 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 14/108 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 0/162 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 108 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1305 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 81/162 variables, 81/94 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 14/108 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 80/188 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2025-06-01 00:12:08] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2025-06-01 00:12:08] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 0 ms to minimize.
[2025-06-01 00:12:08] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2025-06-01 00:12:08] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2025-06-01 00:12:08] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2025-06-01 00:12:08] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2025-06-01 00:12:09] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 0 ms to minimize.
[2025-06-01 00:12:09] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 0 ms to minimize.
[2025-06-01 00:12:09] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 3/197 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (OVERLAPS) 0/162 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 197 constraints, problems are : Problem set: 0 solved, 80 unsolved in 3809 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 9/9 constraints]
After SMT, in 5134ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 5135ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5373 ms. Remains : 81/81 places, 81/81 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 81 transition count 75
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 75 transition count 75
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 72 transition count 72
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 72 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 71 transition count 71
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 71 transition count 69
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 69 transition count 69
Applied a total of 24 rules in 10 ms. Remains 69 /81 variables (removed 12) and now considering 69/81 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 69 rows 69 cols
[2025-06-01 00:12:11] [INFO ] Computed 13 invariants in 1 ms
[2025-06-01 00:12:11] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 00:12:11] [INFO ] [Real]Absence check using 3 positive and 10 generalized place invariants in 3 ms returned sat
[2025-06-01 00:12:11] [INFO ] After 22ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2025-06-01 00:12:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 00:12:11] [INFO ] After 4ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 00:12:11] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 00:12:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 00:12:11] [INFO ] [Nat]Absence check using 3 positive and 10 generalized place invariants in 3 ms returned sat
[2025-06-01 00:12:11] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 00:12:11] [INFO ] After 4ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 00:12:11] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 00:12:11] [INFO ] After 74ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 145 ms.
RANDOM walk for 40000 steps (5710 resets) in 104 ms. (380 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3584 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1077569 steps, run timeout after 3001 ms. (steps per millisecond=359 ) properties seen :0 out of 1
Probabilistic random walk after 1077569 steps, saw 538909 distinct states, run finished after 3001 ms. (steps per millisecond=359 ) properties seen :0
// Phase 1: matrix 86 rows 87 cols
[2025-06-01 00:12:14] [INFO ] Computed 14 invariants in 3 ms
[2025-06-01 00:12:14] [INFO ] State equation strengthened by 12 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) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/8 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/21 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 38/59 variables, 16/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/59 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/59 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 41/100 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/100 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/100 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 14/114 variables, 6/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/114 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 52/166 variables, 54/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/166 variables, 8/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/166 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 7/173 variables, 6/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/173 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/173 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/173 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 173/173 variables, and 113 constraints, problems are : Problem set: 0 solved, 1 unsolved in 98 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 87/87 constraints, ReadFeed: 12/12 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) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/8 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/21 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 38/59 variables, 16/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/59 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/59 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/59 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 41/100 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/100 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/100 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 14/114 variables, 6/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/114 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 52/166 variables, 54/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/166 variables, 8/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/166 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 7/173 variables, 6/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/173 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/173 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/173 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 173/173 variables, and 114 constraints, problems are : Problem set: 0 solved, 1 unsolved in 93 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 87/87 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 204ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 34 ms.
Support contains 1 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 86/86 transitions.
Graph (complete) has 319 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 86 transition count 85
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 6 place count 86 transition count 81
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 10 place count 82 transition count 81
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 82 transition count 81
Applied a total of 14 rules in 5 ms. Remains 82 /87 variables (removed 5) and now considering 81/86 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 82/87 places, 81/86 transitions.
RANDOM walk for 40000 steps (5679 resets) in 98 ms. (404 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3606 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1070253 steps, run timeout after 3001 ms. (steps per millisecond=356 ) properties seen :0 out of 1
Probabilistic random walk after 1070253 steps, saw 535233 distinct states, run finished after 3001 ms. (steps per millisecond=356 ) properties seen :0
// Phase 1: matrix 81 rows 82 cols
[2025-06-01 00:12:17] [INFO ] Computed 14 invariants in 2 ms
[2025-06-01 00:12:17] [INFO ] State equation strengthened by 14 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) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 57/63 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:12:17] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 1 ms to minimize.
[2025-06-01 00:12:17] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2025-06-01 00:12:17] [INFO ] Deduced a trap composed of 37 places in 30 ms of which 0 ms to minimize.
[2025-06-01 00:12:17] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 1 ms to minimize.
[2025-06-01 00:12:17] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2025-06-01 00:12:17] [INFO ] Deduced a trap composed of 41 places in 28 ms of which 1 ms to minimize.
[2025-06-01 00:12:17] [INFO ] Deduced a trap composed of 43 places in 28 ms of which 1 ms to minimize.
[2025-06-01 00:12:17] [INFO ] Deduced a trap composed of 38 places in 26 ms of which 1 ms to minimize.
[2025-06-01 00:12:17] [INFO ] Deduced a trap composed of 40 places in 28 ms of which 1 ms to minimize.
[2025-06-01 00:12:17] [INFO ] Deduced a trap composed of 40 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 14/77 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:12:17] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2025-06-01 00:12:18] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2025-06-01 00:12:18] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2025-06-01 00:12:18] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2025-06-01 00:12:18] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 5/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 81/158 variables, 77/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 14/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 5/163 variables, 5/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/163 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/163 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/163 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 125 constraints, problems are : Problem set: 0 solved, 1 unsolved in 645 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 82/82 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 15/15 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) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 57/63 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:12:18] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 14/77 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/77 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 81/158 variables, 77/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 14/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/158 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/158 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/163 variables, 5/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/163 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/163 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/163 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 127 constraints, problems are : Problem set: 0 solved, 1 unsolved in 130 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 82/82 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 16/16 constraints]
After SMT, in 784ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 34 ms.
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 82/82 places, 81/81 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 82 /82 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2025-06-01 00:12:18] [INFO ] Invariant cache hit.
[2025-06-01 00:12:18] [INFO ] Implicit Places using invariants in 74 ms returned [25]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 75 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 81/82 places, 81/81 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 81 transition count 80
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 80 transition count 80
Applied a total of 2 rules in 4 ms. Remains 80 /81 variables (removed 1) and now considering 80/81 (removed 1) transitions.
// Phase 1: matrix 80 rows 80 cols
[2025-06-01 00:12:18] [INFO ] Computed 13 invariants in 1 ms
[2025-06-01 00:12:18] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-01 00:12:18] [INFO ] Invariant cache hit.
[2025-06-01 00:12:18] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-01 00:12:18] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 80/82 places, 80/81 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 327 ms. Remains : 80/82 places, 80/81 transitions.
RANDOM walk for 40000 steps (5652 resets) in 98 ms. (404 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3637 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1091011 steps, run timeout after 3001 ms. (steps per millisecond=363 ) properties seen :0 out of 1
Probabilistic random walk after 1091011 steps, saw 545624 distinct states, run finished after 3001 ms. (steps per millisecond=363 ) properties seen :0
[2025-06-01 00:12:21] [INFO ] Invariant cache hit.
[2025-06-01 00:12:21] [INFO ] State equation strengthened by 14 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) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 55/61 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:12:21] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2025-06-01 00:12:21] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2025-06-01 00:12:21] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 14/75 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:12:21] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2025-06-01 00:12:21] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2025-06-01 00:12:21] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2025-06-01 00:12:22] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
[2025-06-01 00:12:22] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 80/155 variables, 75/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/155 variables, 14/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/155 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 5/160 variables, 5/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/160 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/160 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/160 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 160/160 variables, and 115 constraints, problems are : Problem set: 0 solved, 1 unsolved in 372 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 80/80 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 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) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 55/61 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:12:22] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 14/75 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/75 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 80/155 variables, 75/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/155 variables, 14/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/155 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:12:22] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/155 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/155 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/160 variables, 5/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/160 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/160 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/160 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 160/160 variables, and 118 constraints, problems are : Problem set: 0 solved, 1 unsolved in 185 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 80/80 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 561ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 38 ms.
Support contains 1 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 80/80 transitions.
Applied a total of 0 rules in 3 ms. Remains 80 /80 variables (removed 0) and now considering 80/80 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 80/80 places, 80/80 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 80/80 transitions.
Applied a total of 0 rules in 2 ms. Remains 80 /80 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2025-06-01 00:12:22] [INFO ] Invariant cache hit.
[2025-06-01 00:12:22] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-01 00:12:22] [INFO ] Invariant cache hit.
[2025-06-01 00:12:22] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-01 00:12:22] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
[2025-06-01 00:12:22] [INFO ] Redundant transitions in 2 ms returned []
Running 79 sub problems to find dead transitions.
[2025-06-01 00:12:22] [INFO ] Invariant cache hit.
[2025-06-01 00:12:22] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (OVERLAPS) 1/80 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 80/160 variables, 80/93 constraints. Problems are: Problem set: 0 solved, 79 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 14/107 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 0/160 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 160/160 variables, and 107 constraints, problems are : Problem set: 0 solved, 79 unsolved in 1269 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 80/80 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (OVERLAPS) 1/80 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 80/160 variables, 80/93 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 14/107 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 79/186 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2025-06-01 00:12:24] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 0 ms to minimize.
[2025-06-01 00:12:24] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 0 ms to minimize.
[2025-06-01 00:12:25] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 0 ms to minimize.
[2025-06-01 00:12:25] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 1 ms to minimize.
[2025-06-01 00:12:25] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 0 ms to minimize.
[2025-06-01 00:12:25] [INFO ] Deduced a trap composed of 40 places in 32 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 6/192 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (OVERLAPS) 0/160 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 160/160 variables, and 192 constraints, problems are : Problem set: 0 solved, 79 unsolved in 3258 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 80/80 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 6/6 constraints]
After SMT, in 4546ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 4548ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4798 ms. Remains : 80/80 places, 80/80 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 80 transition count 74
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 74 transition count 74
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 71 transition count 71
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 71 transition count 71
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 70 transition count 70
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 70 transition count 68
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 68 transition count 68
Applied a total of 24 rules in 9 ms. Remains 68 /80 variables (removed 12) and now considering 68/80 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 68 rows 68 cols
[2025-06-01 00:12:27] [INFO ] Computed 13 invariants in 1 ms
[2025-06-01 00:12:27] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 00:12:27] [INFO ] [Real]Absence check using 3 positive and 10 generalized place invariants in 2 ms returned sat
[2025-06-01 00:12:27] [INFO ] After 24ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2025-06-01 00:12:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 00:12:27] [INFO ] After 3ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 00:12:27] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
TRAPS : Iteration 1
[2025-06-01 00:12:27] [INFO ] After 44ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 00:12:27] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 00:12:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 00:12:27] [INFO ] [Nat]Absence check using 3 positive and 10 generalized place invariants in 3 ms returned sat
[2025-06-01 00:12:27] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 00:12:27] [INFO ] After 3ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 00:12:27] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2025-06-01 00:12:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
TRAPS : Iteration 1
[2025-06-01 00:12:27] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 00:12:27] [INFO ] After 116ms 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 (5688 resets) in 104 ms. (380 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3607 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1069126 steps, run timeout after 3001 ms. (steps per millisecond=356 ) properties seen :0 out of 1
Probabilistic random walk after 1069126 steps, saw 534673 distinct states, run finished after 3001 ms. (steps per millisecond=356 ) properties seen :0
// Phase 1: matrix 86 rows 87 cols
[2025-06-01 00:12:30] [INFO ] Computed 14 invariants in 1 ms
[2025-06-01 00:12:30] [INFO ] State equation strengthened by 12 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) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/23 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 45/68 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 21/89 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:12:30] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/89 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/89 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 75/164 variables, 69/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/164 variables, 12/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/164 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 9/173 variables, 8/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/173 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/173 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/173 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 173/173 variables, and 114 constraints, problems are : Problem set: 0 solved, 1 unsolved in 119 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 87/87 constraints, ReadFeed: 12/12 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) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/23 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 45/68 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/68 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 21/89 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/89 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/89 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 75/164 variables, 69/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/164 variables, 12/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/164 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 9/173 variables, 8/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/173 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/173 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/173 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 173/173 variables, and 115 constraints, problems are : Problem set: 0 solved, 1 unsolved in 91 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 87/87 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 216ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 55 ms.
Support contains 1 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 86/86 transitions.
Graph (complete) has 319 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 86 transition count 85
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 5 place count 86 transition count 82
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 83 transition count 82
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 83 transition count 82
Applied a total of 12 rules in 4 ms. Remains 83 /87 variables (removed 4) and now considering 82/86 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 83/87 places, 82/86 transitions.
RANDOM walk for 40000 steps (5623 resets) in 158 ms. (251 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3594 resets) in 86 ms. (459 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1056581 steps, run timeout after 3001 ms. (steps per millisecond=352 ) properties seen :0 out of 1
Probabilistic random walk after 1056581 steps, saw 528395 distinct states, run finished after 3001 ms. (steps per millisecond=352 ) properties seen :0
// Phase 1: matrix 82 rows 83 cols
[2025-06-01 00:12:33] [INFO ] Computed 14 invariants in 3 ms
[2025-06-01 00:12:33] [INFO ] State equation strengthened by 13 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) 59/60 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:12:33] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/78 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:12:33] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2025-06-01 00:12:33] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2025-06-01 00:12:33] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2025-06-01 00:12:33] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2025-06-01 00:12:34] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2025-06-01 00:12:34] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 82/160 variables, 78/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 13/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/165 variables, 5/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/165 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/165 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/165 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 165/165 variables, and 117 constraints, problems are : Problem set: 0 solved, 1 unsolved in 309 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 83/83 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 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) 59/60 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/78 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:12:34] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 82/160 variables, 78/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 13/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/160 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/160 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/165 variables, 5/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/165 variables, 2/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/165 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/165 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 165/165 variables, and 119 constraints, problems are : Problem set: 0 solved, 1 unsolved in 126 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 83/83 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 441ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 53 ms.
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 82/82 transitions.
Applied a total of 0 rules in 2 ms. Remains 83 /83 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 83/83 places, 82/82 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 82/82 transitions.
Applied a total of 0 rules in 1 ms. Remains 83 /83 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2025-06-01 00:12:34] [INFO ] Invariant cache hit.
[2025-06-01 00:12:34] [INFO ] Implicit Places using invariants in 72 ms returned [25]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 85 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 82/83 places, 82/82 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 82 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 81 transition count 81
Applied a total of 2 rules in 4 ms. Remains 81 /82 variables (removed 1) and now considering 81/82 (removed 1) transitions.
// Phase 1: matrix 81 rows 81 cols
[2025-06-01 00:12:34] [INFO ] Computed 13 invariants in 1 ms
[2025-06-01 00:12:34] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-01 00:12:34] [INFO ] Invariant cache hit.
[2025-06-01 00:12:34] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-01 00:12:34] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 81/83 places, 81/82 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 345 ms. Remains : 81/83 places, 81/82 transitions.
RANDOM walk for 40000 steps (5678 resets) in 143 ms. (277 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3677 resets) in 89 ms. (444 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1060872 steps, run timeout after 3001 ms. (steps per millisecond=353 ) properties seen :0 out of 1
Probabilistic random walk after 1060872 steps, saw 530543 distinct states, run finished after 3001 ms. (steps per millisecond=353 ) properties seen :0
[2025-06-01 00:12:37] [INFO ] Invariant cache hit.
[2025-06-01 00:12:37] [INFO ] State equation strengthened by 13 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) 57/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/76 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:12:37] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2025-06-01 00:12:37] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2025-06-01 00:12:37] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2025-06-01 00:12:37] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 81/157 variables, 76/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 13/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/162 variables, 5/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/162 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/162 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 111 constraints, problems are : Problem set: 0 solved, 1 unsolved in 241 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:12:37] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/76 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 81/157 variables, 76/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 13/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/157 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/162 variables, 5/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/162 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/162 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/162 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 113 constraints, problems are : Problem set: 0 solved, 1 unsolved in 117 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 367ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 54 ms.
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 81/81 places, 81/81 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2025-06-01 00:12:38] [INFO ] Invariant cache hit.
[2025-06-01 00:12:38] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-01 00:12:38] [INFO ] Invariant cache hit.
[2025-06-01 00:12:38] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-01 00:12:38] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
[2025-06-01 00:12:38] [INFO ] Redundant transitions in 1 ms returned []
Running 80 sub problems to find dead transitions.
[2025-06-01 00:12:38] [INFO ] Invariant cache hit.
[2025-06-01 00:12:38] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 81/162 variables, 81/94 constraints. Problems are: Problem set: 0 solved, 80 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 13/107 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 0/162 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 107 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1269 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 81/162 variables, 81/94 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 13/107 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 80/187 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2025-06-01 00:12:40] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2025-06-01 00:12:41] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2025-06-01 00:12:41] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2025-06-01 00:12:42] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2025-06-01 00:12:42] [INFO ] Deduced a trap composed of 39 places in 30 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 2/192 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2025-06-01 00:12:42] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 0 ms to minimize.
[2025-06-01 00:12:42] [INFO ] Deduced a trap composed of 41 places in 29 ms of which 1 ms to minimize.
[2025-06-01 00:12:42] [INFO ] Deduced a trap composed of 41 places in 31 ms of which 1 ms to minimize.
[2025-06-01 00:12:42] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/162 variables, 4/196 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/162 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 13 (OVERLAPS) 0/162 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 196 constraints, problems are : Problem set: 0 solved, 80 unsolved in 5560 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 9/9 constraints]
After SMT, in 6857ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 6859ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7108 ms. Remains : 81/81 places, 81/81 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 81 transition count 75
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 75 transition count 75
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 72 transition count 72
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 72 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 71 transition count 71
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 71 transition count 69
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 69 transition count 69
Applied a total of 24 rules in 10 ms. Remains 69 /81 variables (removed 12) and now considering 69/81 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 69 rows 69 cols
[2025-06-01 00:12:45] [INFO ] Computed 13 invariants in 1 ms
[2025-06-01 00:12:45] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 00:12:45] [INFO ] [Real]Absence check using 3 positive and 10 generalized place invariants in 3 ms returned sat
[2025-06-01 00:12:45] [INFO ] After 26ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2025-06-01 00:12:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 00:12:45] [INFO ] After 3ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 00:12:45] [INFO ] After 9ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2025-06-01 00:12:45] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 92 ms.
RANDOM walk for 40000 steps (5718 resets) in 129 ms. (307 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3625 resets) in 101 ms. (392 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2057 steps, run visited all 1 properties in 8 ms. (steps per millisecond=257 )
Probabilistic random walk after 2057 steps, saw 1043 distinct states, run finished after 12 ms. (steps per millisecond=171 ) properties seen :1
RANDOM walk for 40000 steps (5743 resets) in 305 ms. (130 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3643 resets) in 177 ms. (224 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1073661 steps, run timeout after 3001 ms. (steps per millisecond=357 ) properties seen :0 out of 1
Probabilistic random walk after 1073661 steps, saw 536937 distinct states, run finished after 3001 ms. (steps per millisecond=357 ) properties seen :0
// Phase 1: matrix 86 rows 87 cols
[2025-06-01 00:12:48] [INFO ] Computed 14 invariants in 1 ms
[2025-06-01 00:12:48] [INFO ] State equation strengthened by 12 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) 7/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/21 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 38/59 variables, 16/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 41/100 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/100 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/100 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 14/114 variables, 6/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/114 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 52/166 variables, 54/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/166 variables, 8/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/166 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 7/173 variables, 6/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/173 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/173 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/173 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 173/173 variables, and 113 constraints, problems are : Problem set: 0 solved, 1 unsolved in 82 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 87/87 constraints, ReadFeed: 12/12 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) 7/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/21 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 38/59 variables, 16/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/59 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 41/100 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/100 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/100 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 14/114 variables, 6/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:12:48] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/114 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/114 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 52/166 variables, 54/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/166 variables, 8/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/166 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 7/173 variables, 6/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/173 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/173 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/173 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 173/173 variables, and 115 constraints, problems are : Problem set: 0 solved, 1 unsolved in 121 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 87/87 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 209ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 53 ms.
Support contains 1 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 86/86 transitions.
Graph (complete) has 319 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 86 transition count 85
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 5 place count 86 transition count 82
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 83 transition count 82
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 83 transition count 82
Applied a total of 12 rules in 4 ms. Remains 83 /87 variables (removed 4) and now considering 82/86 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 83/87 places, 82/86 transitions.
RANDOM walk for 40000 steps (5697 resets) in 118 ms. (336 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3641 resets) in 81 ms. (487 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1085178 steps, run timeout after 3001 ms. (steps per millisecond=361 ) properties seen :0 out of 1
Probabilistic random walk after 1085178 steps, saw 542704 distinct states, run finished after 3001 ms. (steps per millisecond=361 ) properties seen :0
// Phase 1: matrix 82 rows 83 cols
[2025-06-01 00:12:51] [INFO ] Computed 14 invariants in 3 ms
[2025-06-01 00:12:51] [INFO ] State equation strengthened by 13 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) 59/60 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:12:51] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/78 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 82/160 variables, 78/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 13/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/165 variables, 5/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/165 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/165 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/165 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 165/165 variables, and 111 constraints, problems are : Problem set: 0 solved, 1 unsolved in 115 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 83/83 constraints, ReadFeed: 13/13 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) 59/60 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/78 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 82/160 variables, 78/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 13/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/165 variables, 5/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/165 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:12:52] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/165 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/165 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/165 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 165/165 variables, and 113 constraints, problems are : Problem set: 0 solved, 1 unsolved in 103 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 83/83 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 224ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 85 ms.
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 82/82 transitions.
Applied a total of 0 rules in 1 ms. Remains 83 /83 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 83/83 places, 82/82 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 82/82 transitions.
Applied a total of 0 rules in 1 ms. Remains 83 /83 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2025-06-01 00:12:52] [INFO ] Invariant cache hit.
[2025-06-01 00:12:52] [INFO ] Implicit Places using invariants in 65 ms returned [25]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 66 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 82/83 places, 82/82 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 82 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 81 transition count 81
Applied a total of 2 rules in 2 ms. Remains 81 /82 variables (removed 1) and now considering 81/82 (removed 1) transitions.
// Phase 1: matrix 81 rows 81 cols
[2025-06-01 00:12:52] [INFO ] Computed 13 invariants in 1 ms
[2025-06-01 00:12:52] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-01 00:12:52] [INFO ] Invariant cache hit.
[2025-06-01 00:12:52] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-01 00:12:52] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 81/83 places, 81/82 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 323 ms. Remains : 81/83 places, 81/82 transitions.
RANDOM walk for 40000 steps (5698 resets) in 109 ms. (363 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3671 resets) in 102 ms. (388 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1081948 steps, run timeout after 3001 ms. (steps per millisecond=360 ) properties seen :0 out of 1
Probabilistic random walk after 1081948 steps, saw 541087 distinct states, run finished after 3002 ms. (steps per millisecond=360 ) properties seen :0
[2025-06-01 00:12:55] [INFO ] Invariant cache hit.
[2025-06-01 00:12:55] [INFO ] State equation strengthened by 13 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) 57/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/76 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:12:55] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2025-06-01 00:12:55] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2025-06-01 00:12:55] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 0 ms to minimize.
[2025-06-01 00:12:55] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 0 ms to minimize.
[2025-06-01 00:12:55] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2025-06-01 00:12:55] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2025-06-01 00:12:55] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2025-06-01 00:12:55] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2025-06-01 00:12:55] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2025-06-01 00:12:55] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 2 ms to minimize.
[2025-06-01 00:12:56] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2025-06-01 00:12:56] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2025-06-01 00:12:56] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2025-06-01 00:12:56] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2025-06-01 00:12:56] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2025-06-01 00:12:56] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2025-06-01 00:12:56] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2025-06-01 00:12:56] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2025-06-01 00:12:56] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 19/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 81/157 variables, 76/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 13/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/162 variables, 5/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/162 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/162 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 126 constraints, problems are : Problem set: 0 solved, 1 unsolved in 768 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 19/19 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) 57/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:12:56] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/76 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 19/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:12:56] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 81/157 variables, 76/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 13/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/157 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/157 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/162 variables, 5/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/162 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/162 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/162 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 129 constraints, problems are : Problem set: 0 solved, 1 unsolved in 182 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 21/21 constraints]
After SMT, in 955ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 53 ms.
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 81/81 places, 81/81 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2025-06-01 00:12:56] [INFO ] Invariant cache hit.
[2025-06-01 00:12:56] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-01 00:12:56] [INFO ] Invariant cache hit.
[2025-06-01 00:12:56] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-01 00:12:56] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
[2025-06-01 00:12:56] [INFO ] Redundant transitions in 4 ms returned []
Running 80 sub problems to find dead transitions.
[2025-06-01 00:12:56] [INFO ] Invariant cache hit.
[2025-06-01 00:12:56] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 81/162 variables, 81/94 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 13/107 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 0/162 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 107 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1308 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 81/162 variables, 81/94 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 13/107 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 80/187 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (OVERLAPS) 0/162 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 187 constraints, problems are : Problem set: 0 solved, 80 unsolved in 2505 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
After SMT, in 3833ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 3834ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4088 ms. Remains : 81/81 places, 81/81 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 81 transition count 75
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 75 transition count 75
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 72 transition count 72
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 72 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 71 transition count 71
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 71 transition count 69
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 69 transition count 69
Applied a total of 24 rules in 6 ms. Remains 69 /81 variables (removed 12) and now considering 69/81 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 69 rows 69 cols
[2025-06-01 00:13:00] [INFO ] Computed 13 invariants in 2 ms
[2025-06-01 00:13:00] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2025-06-01 00:13:00] [INFO ] [Real]Absence check using 3 positive and 10 generalized place invariants in 2 ms returned sat
[2025-06-01 00:13:00] [INFO ] After 27ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2025-06-01 00:13:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 00:13:00] [INFO ] After 4ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 00:13:00] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 00:13:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 00:13:00] [INFO ] [Nat]Absence check using 3 positive and 10 generalized place invariants in 2 ms returned sat
[2025-06-01 00:13:00] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 00:13:00] [INFO ] After 3ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 00:13:00] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2025-06-01 00:13:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
TRAPS : Iteration 1
[2025-06-01 00:13:00] [INFO ] After 45ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 00:13:00] [INFO ] After 109ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 178 ms.
RANDOM walk for 40000 steps (5745 resets) in 102 ms. (388 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3629 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1042812 steps, run timeout after 3001 ms. (steps per millisecond=347 ) properties seen :0 out of 1
Probabilistic random walk after 1042812 steps, saw 521517 distinct states, run finished after 3001 ms. (steps per millisecond=347 ) properties seen :0
// Phase 1: matrix 86 rows 87 cols
[2025-06-01 00:13:03] [INFO ] Computed 14 invariants in 3 ms
[2025-06-01 00:13:03] [INFO ] State equation strengthened by 12 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) 21/65 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 76/141 variables, 65/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 10/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 26/167 variables, 17/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/167 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/167 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/167 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/169 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/169 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/169 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/173 variables, 3/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/173 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/173 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/173 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 173/173 variables, and 113 constraints, problems are : Problem set: 0 solved, 1 unsolved in 104 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 87/87 constraints, ReadFeed: 12/12 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) 21/65 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 76/141 variables, 65/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 10/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 26/167 variables, 17/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/167 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/167 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/167 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:13:04] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/167 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/167 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/169 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/169 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/169 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/173 variables, 3/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/173 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/173 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/173 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 173/173 variables, and 115 constraints, problems are : Problem set: 0 solved, 1 unsolved in 115 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 87/87 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 234ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 37 ms.
Support contains 1 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 86/86 transitions.
Graph (complete) has 319 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 86 transition count 85
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 86 transition count 83
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 84 transition count 83
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 11 place count 84 transition count 83
Applied a total of 11 rules in 4 ms. Remains 84 /87 variables (removed 3) and now considering 83/86 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 84/87 places, 83/86 transitions.
RANDOM walk for 40000 steps (5629 resets) in 138 ms. (287 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3664 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1063128 steps, run timeout after 3001 ms. (steps per millisecond=354 ) properties seen :0 out of 1
Probabilistic random walk after 1063128 steps, saw 531665 distinct states, run finished after 3001 ms. (steps per millisecond=354 ) properties seen :0
// Phase 1: matrix 83 rows 84 cols
[2025-06-01 00:13:07] [INFO ] Computed 14 invariants in 3 ms
[2025-06-01 00:13:07] [INFO ] State equation strengthened by 14 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) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 41/45 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 52/97 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:13:07] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2025-06-01 00:13:07] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/97 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/97 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 17/114 variables, 6/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/114 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/114 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 51/165 variables, 69/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/165 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/165 variables, 11/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/165 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/167 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/167 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/167 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/167 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 114 constraints, problems are : Problem set: 0 solved, 1 unsolved in 168 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 84/84 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 41/45 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 52/97 variables, 6/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/97 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/97 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/97 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 17/114 variables, 6/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/114 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:13:07] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 0 ms to minimize.
[2025-06-01 00:13:07] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
[2025-06-01 00:13:07] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2025-06-01 00:13:07] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2025-06-01 00:13:07] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2025-06-01 00:13:07] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2025-06-01 00:13:07] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2025-06-01 00:13:07] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/114 variables, 8/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/114 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 51/165 variables, 69/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/165 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/165 variables, 11/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/165 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/167 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/167 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/167 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/167 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 123 constraints, problems are : Problem set: 0 solved, 1 unsolved in 389 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 84/84 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 567ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 37 ms.
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 83/83 transitions.
Applied a total of 0 rules in 1 ms. Remains 84 /84 variables (removed 0) and now considering 83/83 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 84/84 places, 83/83 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 83/83 transitions.
Applied a total of 0 rules in 1 ms. Remains 84 /84 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2025-06-01 00:13:07] [INFO ] Invariant cache hit.
[2025-06-01 00:13:07] [INFO ] Implicit Places using invariants in 66 ms returned [25]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 67 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 83/84 places, 83/83 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 83 transition count 82
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 82 transition count 82
Applied a total of 2 rules in 2 ms. Remains 82 /83 variables (removed 1) and now considering 82/83 (removed 1) transitions.
// Phase 1: matrix 82 rows 82 cols
[2025-06-01 00:13:07] [INFO ] Computed 13 invariants in 1 ms
[2025-06-01 00:13:08] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-01 00:13:08] [INFO ] Invariant cache hit.
[2025-06-01 00:13:08] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-01 00:13:08] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 82/84 places, 82/83 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 287 ms. Remains : 82/84 places, 82/83 transitions.
RANDOM walk for 40000 steps (5799 resets) in 108 ms. (366 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3661 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1053213 steps, run timeout after 3001 ms. (steps per millisecond=350 ) properties seen :0 out of 1
Probabilistic random walk after 1053213 steps, saw 526713 distinct states, run finished after 3001 ms. (steps per millisecond=350 ) properties seen :0
[2025-06-01 00:13:11] [INFO ] Invariant cache hit.
[2025-06-01 00:13:11] [INFO ] State equation strengthened by 14 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) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/43 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 51/94 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:13:11] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2025-06-01 00:13:11] [INFO ] Deduced a trap composed of 39 places in 31 ms of which 1 ms to minimize.
[2025-06-01 00:13:11] [INFO ] Deduced a trap composed of 40 places in 29 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/94 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/94 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 17/111 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/111 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/111 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 51/162 variables, 68/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/162 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/162 variables, 11/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/162 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/164 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/164 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/164 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/164 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 164/164 variables, and 112 constraints, problems are : Problem set: 0 solved, 1 unsolved in 201 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 82/82 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/43 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 51/94 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/94 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/94 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:13:11] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/94 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/94 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 17/111 variables, 6/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/111 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/111 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 51/162 variables, 68/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/162 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/162 variables, 11/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/162 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/164 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/164 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/164 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/164 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 164/164 variables, and 114 constraints, problems are : Problem set: 0 solved, 1 unsolved in 120 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 82/82 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 341ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 30 ms.
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 82/82 transitions.
Applied a total of 0 rules in 1 ms. Remains 82 /82 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 82/82 places, 82/82 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 82/82 transitions.
Applied a total of 0 rules in 1 ms. Remains 82 /82 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2025-06-01 00:13:11] [INFO ] Invariant cache hit.
[2025-06-01 00:13:11] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-06-01 00:13:11] [INFO ] Invariant cache hit.
[2025-06-01 00:13:11] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-01 00:13:11] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
[2025-06-01 00:13:11] [INFO ] Redundant transitions in 2 ms returned []
Running 81 sub problems to find dead transitions.
[2025-06-01 00:13:11] [INFO ] Invariant cache hit.
[2025-06-01 00:13:11] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (OVERLAPS) 1/82 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 82/164 variables, 82/95 constraints. Problems are: Problem set: 0 solved, 81 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 14/109 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (OVERLAPS) 0/164 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 164/164 variables, and 109 constraints, problems are : Problem set: 0 solved, 81 unsolved in 1342 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 82/82 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (OVERLAPS) 1/82 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 82/164 variables, 82/95 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 14/109 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 81/190 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2025-06-01 00:13:14] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2025-06-01 00:13:14] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 1 ms to minimize.
[2025-06-01 00:13:14] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 1 ms to minimize.
[2025-06-01 00:13:14] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 0 ms to minimize.
[2025-06-01 00:13:14] [INFO ] Deduced a trap composed of 39 places in 30 ms of which 1 ms to minimize.
[2025-06-01 00:13:14] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 1 ms to minimize.
[2025-06-01 00:13:14] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2025-06-01 00:13:14] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 8/198 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2025-06-01 00:13:15] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 0 ms to minimize.
[2025-06-01 00:13:15] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/164 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 11 (OVERLAPS) 0/164 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 164/164 variables, and 200 constraints, problems are : Problem set: 0 solved, 81 unsolved in 4228 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 82/82 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 10/10 constraints]
After SMT, in 5591ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 5595ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5838 ms. Remains : 82/82 places, 82/82 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 82 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 81 transition count 81
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2 place count 81 transition count 75
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 75 transition count 75
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 17 place count 72 transition count 72
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 place count 72 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 71 transition count 71
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 71 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 70 transition count 70
Applied a total of 24 rules in 12 ms. Remains 70 /82 variables (removed 12) and now considering 70/82 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 70 rows 70 cols
[2025-06-01 00:13:17] [INFO ] Computed 13 invariants in 1 ms
[2025-06-01 00:13:17] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-01 00:13:17] [INFO ] [Real]Absence check using 5 positive and 8 generalized place invariants in 1 ms returned sat
[2025-06-01 00:13:17] [INFO ] After 30ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2025-06-01 00:13:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 00:13:17] [INFO ] After 5ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 00:13:17] [INFO ] After 11ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2025-06-01 00:13:17] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 96 ms.
RANDOM walk for 40000 steps (5763 resets) in 119 ms. (333 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3625 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2057 steps, run visited all 1 properties in 8 ms. (steps per millisecond=257 )
Probabilistic random walk after 2057 steps, saw 1043 distinct states, run finished after 8 ms. (steps per millisecond=257 ) properties seen :1
RANDOM walk for 40000 steps (5690 resets) in 117 ms. (338 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3691 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1050853 steps, run timeout after 3001 ms. (steps per millisecond=350 ) properties seen :0 out of 1
Probabilistic random walk after 1050853 steps, saw 525532 distinct states, run finished after 3002 ms. (steps per millisecond=350 ) properties seen :0
// Phase 1: matrix 86 rows 87 cols
[2025-06-01 00:13:20] [INFO ] Computed 14 invariants in 4 ms
[2025-06-01 00:13:20] [INFO ] State equation strengthened by 12 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/12 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 42/54 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 21/75 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 83/158 variables, 69/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 12/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 4/162 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/162 variables, 4/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/162 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 11/173 variables, 10/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/173 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/173 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/173 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 173/173 variables, and 113 constraints, problems are : Problem set: 0 solved, 1 unsolved in 104 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 87/87 constraints, ReadFeed: 12/12 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/12 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 42/54 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 21/75 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 83/158 variables, 69/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 12/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/158 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/162 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/162 variables, 4/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/162 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 11/173 variables, 10/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/173 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:13:20] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/173 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/173 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/173 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 173/173 variables, and 115 constraints, problems are : Problem set: 0 solved, 1 unsolved in 125 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 87/87 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 236ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 56 ms.
Support contains 1 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 86/86 transitions.
Graph (complete) has 319 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 86 transition count 85
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 5 place count 86 transition count 82
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 83 transition count 82
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 83 transition count 82
Applied a total of 12 rules in 5 ms. Remains 83 /87 variables (removed 4) and now considering 82/86 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 83/87 places, 82/86 transitions.
RANDOM walk for 40000 steps (5732 resets) in 107 ms. (370 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3633 resets) in 58 ms. (677 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1071268 steps, run timeout after 3001 ms. (steps per millisecond=356 ) properties seen :0 out of 1
Probabilistic random walk after 1071268 steps, saw 535757 distinct states, run finished after 3001 ms. (steps per millisecond=356 ) properties seen :0
// Phase 1: matrix 82 rows 83 cols
[2025-06-01 00:13:24] [INFO ] Computed 14 invariants in 4 ms
[2025-06-01 00:13:24] [INFO ] State equation strengthened by 14 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) 59/60 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:13:24] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/78 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:13:24] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2025-06-01 00:13:24] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2025-06-01 00:13:24] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2025-06-01 00:13:24] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 82/160 variables, 78/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 14/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/165 variables, 5/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/165 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/165 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/165 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 165/165 variables, and 116 constraints, problems are : Problem set: 0 solved, 1 unsolved in 256 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 83/83 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 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) 59/60 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/78 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 82/160 variables, 78/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 14/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/160 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/165 variables, 5/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/165 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/165 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/165 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 165/165 variables, and 117 constraints, problems are : Problem set: 0 solved, 1 unsolved in 97 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 83/83 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 362ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 54 ms.
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 82/82 transitions.
Applied a total of 0 rules in 2 ms. Remains 83 /83 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 83/83 places, 82/82 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 82/82 transitions.
Applied a total of 0 rules in 1 ms. Remains 83 /83 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2025-06-01 00:13:24] [INFO ] Invariant cache hit.
[2025-06-01 00:13:24] [INFO ] Implicit Places using invariants in 69 ms returned [25]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 70 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 82/83 places, 82/82 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 82 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 81 transition count 81
Applied a total of 2 rules in 2 ms. Remains 81 /82 variables (removed 1) and now considering 81/82 (removed 1) transitions.
// Phase 1: matrix 81 rows 81 cols
[2025-06-01 00:13:24] [INFO ] Computed 13 invariants in 1 ms
[2025-06-01 00:13:24] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-01 00:13:24] [INFO ] Invariant cache hit.
[2025-06-01 00:13:24] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-01 00:13:24] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 81/83 places, 81/82 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 338 ms. Remains : 81/83 places, 81/82 transitions.
RANDOM walk for 40000 steps (5782 resets) in 103 ms. (384 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3603 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1065341 steps, run timeout after 3001 ms. (steps per millisecond=354 ) properties seen :0 out of 1
Probabilistic random walk after 1065341 steps, saw 532776 distinct states, run finished after 3001 ms. (steps per millisecond=354 ) properties seen :0
[2025-06-01 00:13:27] [INFO ] Invariant cache hit.
[2025-06-01 00:13:27] [INFO ] State equation strengthened by 14 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) 57/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/76 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:13:27] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2025-06-01 00:13:27] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
[2025-06-01 00:13:28] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 81/157 variables, 76/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 14/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/162 variables, 5/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/162 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/162 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 111 constraints, problems are : Problem set: 0 solved, 1 unsolved in 190 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:13:28] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/76 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 81/157 variables, 76/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 14/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/157 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/162 variables, 5/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/162 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/162 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/162 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 113 constraints, problems are : Problem set: 0 solved, 1 unsolved in 120 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 315ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 54 ms.
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 81/81 places, 81/81 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2025-06-01 00:13:28] [INFO ] Invariant cache hit.
[2025-06-01 00:13:28] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-01 00:13:28] [INFO ] Invariant cache hit.
[2025-06-01 00:13:28] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-01 00:13:28] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
[2025-06-01 00:13:28] [INFO ] Redundant transitions in 0 ms returned []
Running 80 sub problems to find dead transitions.
[2025-06-01 00:13:28] [INFO ] Invariant cache hit.
[2025-06-01 00:13:28] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 81/162 variables, 81/94 constraints. Problems are: Problem set: 0 solved, 80 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 14/108 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 0/162 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 108 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1368 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 81/162 variables, 81/94 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 14/108 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 80/188 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2025-06-01 00:13:30] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2025-06-01 00:13:31] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 1 ms to minimize.
[2025-06-01 00:13:31] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2025-06-01 00:13:31] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 1 ms to minimize.
[2025-06-01 00:13:31] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
[2025-06-01 00:13:31] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 1 ms to minimize.
[2025-06-01 00:13:31] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 7/195 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2025-06-01 00:13:32] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2025-06-01 00:13:32] [INFO ] Deduced a trap composed of 34 places in 30 ms of which 1 ms to minimize.
[2025-06-01 00:13:32] [INFO ] Deduced a trap composed of 40 places in 31 ms of which 0 ms to minimize.
[2025-06-01 00:13:32] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 4/199 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (OVERLAPS) 0/162 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 199 constraints, problems are : Problem set: 0 solved, 80 unsolved in 4151 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 81/81 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 11/11 constraints]
After SMT, in 5537ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 5538ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5850 ms. Remains : 81/81 places, 81/81 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 81 transition count 75
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 75 transition count 75
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 72 transition count 72
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 72 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 71 transition count 71
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 21 place count 71 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 22 place count 70 transition count 70
Applied a total of 22 rules in 7 ms. Remains 70 /81 variables (removed 11) and now considering 70/81 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 70 rows 70 cols
[2025-06-01 00:13:34] [INFO ] Computed 13 invariants in 1 ms
[2025-06-01 00:13:34] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-01 00:13:34] [INFO ] [Real]Absence check using 5 positive and 8 generalized place invariants in 2 ms returned sat
[2025-06-01 00:13:34] [INFO ] After 22ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2025-06-01 00:13:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 00:13:34] [INFO ] After 3ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 00:13:34] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 00:13:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-01 00:13:34] [INFO ] [Nat]Absence check using 5 positive and 8 generalized place invariants in 2 ms returned sat
[2025-06-01 00:13:34] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 00:13:34] [INFO ] After 3ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 00:13:34] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2025-06-01 00:13:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
TRAPS : Iteration 1
[2025-06-01 00:13:34] [INFO ] After 48ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 00:13:34] [INFO ] After 108ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 171 ms.
Attempting over-approximation, by ignoring read arcs.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 87 transition count 80
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 81 transition count 80
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 79 transition count 78
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 79 transition count 78
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 18 place count 78 transition count 77
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 78 transition count 76
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 20 place count 77 transition count 76
Applied a total of 20 rules in 10 ms. Remains 77 /87 variables (removed 10) and now considering 76/86 (removed 10) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 76 rows 77 cols
[2025-06-01 00:13:34] [INFO ] Computed 14 invariants in 1 ms
[2025-06-01 00:13:34] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 00:13:34] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 3 ms returned sat
[2025-06-01 00:13:34] [INFO ] After 52ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:5
[2025-06-01 00:13:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 00:13:34] [INFO ] After 9ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2025-06-01 00:13:34] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2025-06-01 00:13:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-01 00:13:34] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 3 ms returned sat
[2025-06-01 00:13:34] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2025-06-01 00:13:34] [INFO ] After 24ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2025-06-01 00:13:34] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2025-06-01 00:13:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2025-06-01 00:13:34] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 1 ms to minimize.
[2025-06-01 00:13:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
TRAPS : Iteration 1
[2025-06-01 00:13:34] [INFO ] After 162ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2025-06-01 00:13:34] [INFO ] After 278ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 404 ms.
Unable to solve all queries for examination QuasiLiveness. Remains :6 assertions to prove.
No /home/mcc/execution/QuasiLiveness.xml examination file found. Proceeding without properties.
Parsed 6 properties from file /home/mcc/execution/QuasiLiveness.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 505531 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DoubleExponent-PT-004

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 216
TRANSITIONS: 198
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.003s, Sys 0.001s]


SAVING FILE /home/mcc/execution/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

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

Process ID: 1764
MODEL NAME: /home/mcc/execution/model
216 places, 198 transitions.
Enabling coverability test.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
Start RS construction.
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
Start RS construction.
Convergence in 55 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 55 steps.
Creating all event NSFs..
Convergence in 55 steps.
Building monolithic NSF...
Creating all event NSFs..
Start RS construction.
Convergence in 55 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Building monolithic NSF...
Start RS construction.
Convergence in 130 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 130 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 130 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 130 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 246 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 246 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 246 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 246 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 682 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 682 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 682 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 682 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 1149 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 1149 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 2257 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 1149 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 1149 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 2257 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 4348 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 4348 steps.
Creating all event NSFs..
Building monolithic NSF...
Convergence in 2257 steps.
Creating all event NSFs..
Start RS construction.
Building monolithic NSF...
Start RS construction.
Convergence in 2257 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------

BK_STOP 1748737018579

--------------------
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
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 4194304 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DoubleExponent-PT-004"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is DoubleExponent-PT-004, 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 r084-tall-174860080300302"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-004.tgz
mv DoubleExponent-PT-004 execution
cd execution
if [ "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.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 ;