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.r070-smll-174854076400182.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 DES-PT-10b, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r070-smll-174854076400182
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 8.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K 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 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K 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 79K 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 1748651985811

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DES-PT-10b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-31 00:39:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-05-31 00:39:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 00:39:49] [INFO ] Load time of PNML (sax parser for PT used): 197 ms
[2025-05-31 00:39:49] [INFO ] Transformed 320 places.
[2025-05-31 00:39:49] [INFO ] Transformed 271 transitions.
[2025-05-31 00:39:49] [INFO ] Found NUPN structural information;
[2025-05-31 00:39:49] [INFO ] Parsed PT model containing 320 places and 271 transitions and 827 arcs in 601 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 320/320 places, 271/271 transitions.
Reduce places removed 3 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 317 transition count 248
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 49 place count 294 transition count 248
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 49 place count 294 transition count 239
Deduced a syphon composed of 9 places in 5 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 67 place count 285 transition count 239
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 1 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 2 with 182 rules applied. Total rules applied 249 place count 194 transition count 148
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 257 place count 190 transition count 164
Applied a total of 257 rules in 172 ms. Remains 190 /320 variables (removed 130) and now considering 164/271 (removed 107) transitions.
// Phase 1: matrix 164 rows 190 cols
[2025-05-31 00:39:49] [INFO ] Computed 62 invariants in 60 ms
[2025-05-31 00:39:50] [INFO ] Implicit Places using invariants in 1053 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1124 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 189/320 places, 164/271 transitions.
Applied a total of 0 rules in 10 ms. Remains 189 /189 variables (removed 0) and now considering 164/164 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 1345 ms. Remains : 189/320 places, 164/271 transitions.
Discarding 45 transitions out of 164. Remains 119
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (1389 resets) in 3342 ms. (11 steps per ms) remains 29/118 properties
BEST_FIRST walk for 4004 steps (17 resets) in 36 ms. (108 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (19 resets) in 36 ms. (108 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (22 resets) in 29 ms. (133 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (21 resets) in 41 ms. (95 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (21 resets) in 31 ms. (125 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (21 resets) in 23 ms. (166 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (20 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (16 resets) in 48 ms. (81 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (16 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (15 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (16 resets) in 21 ms. (181 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (17 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (18 resets) in 27 ms. (142 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (16 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (16 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (16 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (14 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (18 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (17 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (16 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (16 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (18 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (18 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (19 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (16 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (15 resets) in 13 ms. (285 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (16 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (15 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (18 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
// Phase 1: matrix 164 rows 189 cols
[2025-05-31 00:39:52] [INFO ] Computed 61 invariants in 10 ms
[2025-05-31 00:39:52] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 20/57 variables, 6/43 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 74/131 variables, 26/89 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 74/163 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (OVERLAPS) 48/179 variables, 27/190 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 48/238 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/179 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (OVERLAPS) 4/183 variables, 2/240 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/183 variables, 4/244 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/183 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 14 (OVERLAPS) 164/347 variables, 183/427 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/347 variables, 6/433 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/347 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 17 (OVERLAPS) 6/353 variables, 6/439 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/353 variables, 6/445 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2025-05-31 00:39:55] [INFO ] Deduced a trap composed of 14 places in 162 ms of which 27 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/353 variables, 1/446 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2025-05-31 00:39:56] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 3 ms to minimize.
[2025-05-31 00:39:56] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/353 variables, 2/448 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 21 (INCLUDED_ONLY) 0/353 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 353/353 variables, and 448 constraints, problems are : Problem set: 0 solved, 29 unsolved in 5018 ms.
Refiners :[Domain max(s): 189/189 constraints, Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 189/189 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 20/57 variables, 6/43 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 74/131 variables, 26/89 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 74/163 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (OVERLAPS) 48/179 variables, 27/190 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 48/238 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/179 variables, 3/241 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/179 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (OVERLAPS) 4/183 variables, 2/243 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/183 variables, 4/247 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/183 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 15 (OVERLAPS) 164/347 variables, 183/430 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/347 variables, 6/436 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/347 variables, 10/446 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/347 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 19 (OVERLAPS) 6/353 variables, 6/452 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/353 variables, 6/458 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/353 variables, 19/477 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 353/353 variables, and 477 constraints, problems are : Problem set: 0 solved, 29 unsolved in 5011 ms.
Refiners :[Domain max(s): 189/189 constraints, Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 189/189 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 3/3 constraints]
After SMT, in 10131ms problems are : Problem set: 0 solved, 29 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 37 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 164/164 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 1 place count 189 transition count 163
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 18 place count 172 transition count 126
Iterating global reduction 1 with 17 rules applied. Total rules applied 35 place count 172 transition count 126
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 45 place count 172 transition count 116
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 45 place count 172 transition count 113
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 51 place count 169 transition count 113
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 55 place count 165 transition count 109
Iterating global reduction 2 with 4 rules applied. Total rules applied 59 place count 165 transition count 109
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 63 place count 165 transition count 105
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 65 place count 164 transition count 105
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 66 place count 164 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 67 place count 163 transition count 104
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 68 place count 163 transition count 103
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 69 place count 162 transition count 103
Applied a total of 69 rules in 135 ms. Remains 162 /189 variables (removed 27) and now considering 103/164 (removed 61) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 162/189 places, 103/164 transitions.
RANDOM walk for 4000000 steps (183786 resets) in 34513 ms. (115 steps per ms) remains 24/29 properties
BEST_FIRST walk for 400004 steps (3815 resets) in 733 ms. (544 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400002 steps (4466 resets) in 733 ms. (544 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (4435 resets) in 738 ms. (541 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (4432 resets) in 793 ms. (503 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400002 steps (4450 resets) in 730 ms. (547 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (3598 resets) in 686 ms. (582 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (3488 resets) in 676 ms. (590 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (3572 resets) in 684 ms. (583 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (3461 resets) in 702 ms. (568 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (3592 resets) in 690 ms. (578 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (3880 resets) in 720 ms. (554 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (3809 resets) in 717 ms. (557 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (3810 resets) in 712 ms. (561 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (3798 resets) in 721 ms. (554 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (3806 resets) in 715 ms. (558 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (3826 resets) in 722 ms. (553 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400002 steps (3759 resets) in 749 ms. (533 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (3757 resets) in 715 ms. (558 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (3812 resets) in 712 ms. (561 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (3844 resets) in 715 ms. (558 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (3857 resets) in 711 ms. (561 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (3799 resets) in 710 ms. (562 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (3854 resets) in 721 ms. (554 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (3836 resets) in 711 ms. (561 steps per ms) remains 24/24 properties
// Phase 1: matrix 103 rows 162 cols
[2025-05-31 00:40:19] [INFO ] Computed 62 invariants in 3 ms
[2025-05-31 00:40:19] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 8/40 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 73/113 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 45/158 variables, 28/62 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 103/261 variables, 158/220 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 3/223 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2025-05-31 00:40:20] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2025-05-31 00:40:21] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/261 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 12 (OVERLAPS) 4/265 variables, 4/229 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2025-05-31 00:40:21] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/265 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/265 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 15 (OVERLAPS) 0/265 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 230 constraints, problems are : Problem set: 0 solved, 24 unsolved in 3057 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 162/162 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 8/40 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 73/113 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 45/158 variables, 28/62 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 103/261 variables, 158/222 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 3/225 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 9/234 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/261 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 12 (OVERLAPS) 4/265 variables, 4/238 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/265 variables, 15/253 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/265 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/265 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 16 (OVERLAPS) 0/265 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 254 constraints, problems are : Problem set: 0 solved, 24 unsolved in 4299 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 162/162 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 3/3 constraints]
After SMT, in 7388ms problems are : Problem set: 0 solved, 24 unsolved
Parikh walk visited 3 properties in 3360 ms.
Support contains 29 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 103/103 transitions.
Applied a total of 0 rules in 18 ms. Remains 162 /162 variables (removed 0) and now considering 103/103 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 162/162 places, 103/103 transitions.
RANDOM walk for 4000000 steps (183676 resets) in 22535 ms. (177 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400003 steps (3771 resets) in 733 ms. (544 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400004 steps (4444 resets) in 735 ms. (543 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400004 steps (4436 resets) in 732 ms. (545 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400002 steps (4430 resets) in 748 ms. (534 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400004 steps (4469 resets) in 1020 ms. (391 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400004 steps (3629 resets) in 778 ms. (513 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400003 steps (3563 resets) in 703 ms. (568 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400004 steps (3465 resets) in 706 ms. (565 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400002 steps (3744 resets) in 723 ms. (552 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400003 steps (3893 resets) in 726 ms. (550 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400004 steps (3827 resets) in 732 ms. (545 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400002 steps (3835 resets) in 727 ms. (549 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400003 steps (3850 resets) in 731 ms. (546 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400004 steps (3747 resets) in 1629 ms. (245 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400004 steps (3740 resets) in 1189 ms. (336 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400003 steps (3874 resets) in 995 ms. (401 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400003 steps (3866 resets) in 1102 ms. (362 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400003 steps (3818 resets) in 1026 ms. (389 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400003 steps (3845 resets) in 803 ms. (497 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400002 steps (3805 resets) in 734 ms. (544 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400003 steps (3868 resets) in 744 ms. (536 steps per ms) remains 21/21 properties
Interrupted probabilistic random walk after 5952512 steps, run timeout after 33001 ms. (steps per millisecond=180 ) properties seen :0 out of 21
Probabilistic random walk after 5952512 steps, saw 754152 distinct states, run finished after 33012 ms. (steps per millisecond=180 ) properties seen :0
[2025-05-31 00:41:14] [INFO ] Invariant cache hit.
[2025-05-31 00:41:14] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 8/37 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 73/110 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 48/158 variables, 28/62 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 103/261 variables, 158/220 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 3/223 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2025-05-31 00:41:15] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 4/265 variables, 4/228 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2025-05-31 00:41:16] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
[2025-05-31 00:41:16] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/265 variables, 2/230 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/265 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 14 (OVERLAPS) 0/265 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 230 constraints, problems are : Problem set: 0 solved, 21 unsolved in 2882 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 162/162 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 8/37 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 73/110 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 48/158 variables, 28/62 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 103/261 variables, 158/222 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 3/225 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 8/233 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/261 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 12 (OVERLAPS) 4/265 variables, 4/237 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/265 variables, 13/250 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/265 variables, 1/251 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/265 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 16 (OVERLAPS) 0/265 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 251 constraints, problems are : Problem set: 0 solved, 21 unsolved in 3933 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 162/162 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 3/3 constraints]
After SMT, in 6837ms problems are : Problem set: 0 solved, 21 unsolved
Parikh walk visited 0 properties in 2094 ms.
Support contains 29 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 103/103 transitions.
Applied a total of 0 rules in 8 ms. Remains 162 /162 variables (removed 0) and now considering 103/103 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 162/162 places, 103/103 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 103/103 transitions.
Applied a total of 0 rules in 7 ms. Remains 162 /162 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2025-05-31 00:41:23] [INFO ] Invariant cache hit.
[2025-05-31 00:41:24] [INFO ] Implicit Places using invariants in 202 ms returned []
[2025-05-31 00:41:24] [INFO ] Invariant cache hit.
[2025-05-31 00:41:24] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-31 00:41:24] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
[2025-05-31 00:41:24] [INFO ] Redundant transitions in 3 ms returned []
Running 102 sub problems to find dead transitions.
[2025-05-31 00:41:24] [INFO ] Invariant cache hit.
[2025-05-31 00:41:24] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 1/162 variables, 34/48 constraints. Problems are: Problem set: 0 solved, 102 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (OVERLAPS) 103/265 variables, 162/224 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 3/227 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2025-05-31 00:41:26] [INFO ] Deduced a trap composed of 6 places in 267 ms of which 1 ms to minimize.
[2025-05-31 00:41:26] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 2 ms to minimize.
[2025-05-31 00:41:26] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 2 ms to minimize.
[2025-05-31 00:41:27] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/265 variables, 4/231 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (OVERLAPS) 0/265 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 231 constraints, problems are : Problem set: 0 solved, 102 unsolved in 5086 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 162/162 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 1/162 variables, 34/48 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 4/66 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2025-05-31 00:41:30] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 103/265 variables, 162/229 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 3/232 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/265 variables, 102/334 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2025-05-31 00:41:33] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/265 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2025-05-31 00:41:48] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/265 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/265 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 265/265 variables, and 336 constraints, problems are : Problem set: 0 solved, 102 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 162/162 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 7/7 constraints]
After SMT, in 35141ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 35143ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35611 ms. Remains : 162/162 places, 103/103 transitions.
RANDOM walk for 400000 steps (18397 resets) in 3396 ms. (117 steps per ms) remains 24/29 properties
Running SMT prover for 24 properties.
[2025-05-31 00:42:00] [INFO ] Invariant cache hit.
[2025-05-31 00:42:00] [INFO ] [Real]Absence check using 34 positive place invariants in 8 ms returned sat
[2025-05-31 00:42:00] [INFO ] [Real]Absence check using 34 positive and 28 generalized place invariants in 12 ms returned sat
[2025-05-31 00:42:00] [INFO ] After 86ms SMT Verify possible using state equation in real domain returned unsat :0 sat :24
[2025-05-31 00:42:00] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-31 00:42:00] [INFO ] After 41ms SMT Verify possible using 3 Read/Feed constraints in real domain returned unsat :0 sat :24
TRAPS : Iteration 0
[2025-05-31 00:42:01] [INFO ] After 413ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :23 real:1
[2025-05-31 00:42:01] [INFO ] After 642ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :23 real:1
[2025-05-31 00:42:01] [INFO ] [Nat]Absence check using 34 positive place invariants in 11 ms returned sat
[2025-05-31 00:42:01] [INFO ] [Nat]Absence check using 34 positive and 28 generalized place invariants in 16 ms returned sat
[2025-05-31 00:42:01] [INFO ] After 124ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :24
[2025-05-31 00:42:01] [INFO ] After 47ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :24
TRAPS : Iteration 0
[2025-05-31 00:42:01] [INFO ] After 357ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :24
[2025-05-31 00:42:01] [INFO ] After 641ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :24
RANDOM walk for 4000000 steps (183585 resets) in 24747 ms. (161 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400004 steps (3767 resets) in 752 ms. (531 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400003 steps (4435 resets) in 770 ms. (518 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400004 steps (4427 resets) in 763 ms. (523 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400004 steps (4430 resets) in 759 ms. (526 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400004 steps (4453 resets) in 768 ms. (520 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400003 steps (3595 resets) in 706 ms. (565 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400003 steps (3525 resets) in 706 ms. (565 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400004 steps (3561 resets) in 706 ms. (565 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400003 steps (3757 resets) in 761 ms. (524 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400003 steps (3815 resets) in 755 ms. (529 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400003 steps (3738 resets) in 757 ms. (527 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400004 steps (3749 resets) in 761 ms. (524 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400002 steps (3785 resets) in 756 ms. (528 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400003 steps (3753 resets) in 754 ms. (529 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400004 steps (3767 resets) in 759 ms. (526 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400004 steps (3818 resets) in 761 ms. (524 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400004 steps (3796 resets) in 759 ms. (526 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400003 steps (3860 resets) in 756 ms. (528 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400003 steps (3935 resets) in 765 ms. (522 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400004 steps (3807 resets) in 753 ms. (530 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400004 steps (3697 resets) in 760 ms. (525 steps per ms) remains 21/21 properties
Interrupted probabilistic random walk after 5792776 steps, run timeout after 33001 ms. (steps per millisecond=175 ) properties seen :0 out of 21
Probabilistic random walk after 5792776 steps, saw 732455 distinct states, run finished after 33001 ms. (steps per millisecond=175 ) properties seen :0
[2025-05-31 00:42:45] [INFO ] Invariant cache hit.
[2025-05-31 00:42:45] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 8/37 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 73/110 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 48/158 variables, 28/62 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 103/261 variables, 158/220 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 3/223 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2025-05-31 00:42:46] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 4/265 variables, 4/228 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2025-05-31 00:42:47] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 2 ms to minimize.
[2025-05-31 00:42:47] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/265 variables, 2/230 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/265 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 14 (OVERLAPS) 0/265 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 230 constraints, problems are : Problem set: 0 solved, 21 unsolved in 2132 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 162/162 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 8/37 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 73/110 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 48/158 variables, 28/62 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 103/261 variables, 158/222 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 3/225 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 8/233 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/261 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 12 (OVERLAPS) 4/265 variables, 4/237 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/265 variables, 13/250 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/265 variables, 1/251 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/265 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 16 (OVERLAPS) 0/265 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 251 constraints, problems are : Problem set: 0 solved, 21 unsolved in 3154 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 162/162 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 3/3 constraints]
After SMT, in 5312ms problems are : Problem set: 0 solved, 21 unsolved
Parikh walk visited 0 properties in 2662 ms.
Support contains 29 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 103/103 transitions.
Applied a total of 0 rules in 16 ms. Remains 162 /162 variables (removed 0) and now considering 103/103 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 162/162 places, 103/103 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 103/103 transitions.
Applied a total of 0 rules in 6 ms. Remains 162 /162 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2025-05-31 00:42:53] [INFO ] Invariant cache hit.
[2025-05-31 00:42:54] [INFO ] Implicit Places using invariants in 227 ms returned []
[2025-05-31 00:42:54] [INFO ] Invariant cache hit.
[2025-05-31 00:42:54] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-31 00:42:54] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 566 ms to find 0 implicit places.
[2025-05-31 00:42:54] [INFO ] Redundant transitions in 2 ms returned []
Running 102 sub problems to find dead transitions.
[2025-05-31 00:42:54] [INFO ] Invariant cache hit.
[2025-05-31 00:42:54] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 1/162 variables, 34/48 constraints. Problems are: Problem set: 0 solved, 102 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (OVERLAPS) 103/265 variables, 162/224 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 3/227 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2025-05-31 00:42:56] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 2 ms to minimize.
[2025-05-31 00:42:56] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 2 ms to minimize.
[2025-05-31 00:42:56] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 3 ms to minimize.
[2025-05-31 00:42:57] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/265 variables, 4/231 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (OVERLAPS) 0/265 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 231 constraints, problems are : Problem set: 0 solved, 102 unsolved in 5518 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 162/162 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 1/162 variables, 34/48 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 4/66 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2025-05-31 00:43:01] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 103/265 variables, 162/229 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 3/232 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/265 variables, 102/334 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2025-05-31 00:43:05] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/265 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2025-05-31 00:43:20] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/265 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/265 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 265/265 variables, and 336 constraints, problems are : Problem set: 0 solved, 102 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 162/162 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 7/7 constraints]
After SMT, in 35575ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 35576ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36158 ms. Remains : 162/162 places, 103/103 transitions.
RANDOM walk for 400000 steps (18397 resets) in 2921 ms. (136 steps per ms) remains 24/29 properties
Running SMT prover for 24 properties.
[2025-05-31 00:43:31] [INFO ] Invariant cache hit.
[2025-05-31 00:43:31] [INFO ] [Real]Absence check using 34 positive place invariants in 10 ms returned sat
[2025-05-31 00:43:31] [INFO ] [Real]Absence check using 34 positive and 28 generalized place invariants in 15 ms returned sat
[2025-05-31 00:43:31] [INFO ] After 147ms SMT Verify possible using state equation in real domain returned unsat :0 sat :24
[2025-05-31 00:43:31] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-31 00:43:31] [INFO ] After 70ms SMT Verify possible using 3 Read/Feed constraints in real domain returned unsat :0 sat :24
TRAPS : Iteration 0
[2025-05-31 00:43:31] [INFO ] After 519ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :23 real:1
[2025-05-31 00:43:31] [INFO ] After 817ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :23 real:1
[2025-05-31 00:43:31] [INFO ] [Nat]Absence check using 34 positive place invariants in 16 ms returned sat
[2025-05-31 00:43:31] [INFO ] [Nat]Absence check using 34 positive and 28 generalized place invariants in 23 ms returned sat
[2025-05-31 00:43:32] [INFO ] After 169ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :24
[2025-05-31 00:43:32] [INFO ] After 54ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :24
TRAPS : Iteration 0
[2025-05-31 00:43:32] [INFO ] After 513ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :24
[2025-05-31 00:43:32] [INFO ] After 911ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :24
RANDOM walk for 40000 steps (1839 resets) in 177 ms. (224 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (359 resets) in 211 ms. (188 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1285876 steps, run timeout after 3001 ms. (steps per millisecond=428 ) properties seen :0 out of 1
Probabilistic random walk after 1285876 steps, saw 166014 distinct states, run finished after 3001 ms. (steps per millisecond=428 ) properties seen :0
[2025-05-31 00:43:35] [INFO ] Invariant cache hit.
[2025-05-31 00:43:35] [INFO ] State equation strengthened by 3 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) 70/71 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 57/128 variables, 34/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/158 variables, 19/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 103/261 variables, 158/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 3/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/265 variables, 4/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/265 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 227 constraints, problems are : Problem set: 0 solved, 1 unsolved in 213 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 162/162 constraints, ReadFeed: 3/3 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) 70/71 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 57/128 variables, 34/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/158 variables, 19/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 103/261 variables, 158/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 3/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 00:43:36] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 3 ms to minimize.
[2025-05-31 00:43:36] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/261 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4/265 variables, 4/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/265 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/265 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 230 constraints, problems are : Problem set: 0 solved, 1 unsolved in 348 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 162/162 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 567ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 176 ms.
Support contains 1 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 103/103 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 161 transition count 102
Applied a total of 1 rules in 29 ms. Remains 161 /162 variables (removed 1) and now considering 102/103 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 161/162 places, 102/103 transitions.
RANDOM walk for 40000 steps (1887 resets) in 138 ms. (287 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (393 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1360287 steps, run timeout after 3001 ms. (steps per millisecond=453 ) properties seen :0 out of 1
Probabilistic random walk after 1360287 steps, saw 175156 distinct states, run finished after 3001 ms. (steps per millisecond=453 ) properties seen :0
// Phase 1: matrix 102 rows 161 cols
[2025-05-31 00:43:39] [INFO ] Computed 62 invariants in 3 ms
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) 69/70 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 35/105 variables, 23/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 37/142 variables, 19/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/149 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 97/246 variables, 149/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 15/261 variables, 10/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/261 variables, 4/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/261 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/263 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/263 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/263 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/263 variables, and 223 constraints, problems are : Problem set: 0 solved, 1 unsolved in 151 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 161/161 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) 69/70 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/105 variables, 23/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 37/142 variables, 19/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/149 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 97/246 variables, 149/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 00:43:40] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/246 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 15/261 variables, 10/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/261 variables, 4/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/261 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/263 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/263 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/263 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 263/263 variables, and 225 constraints, problems are : Problem set: 0 solved, 1 unsolved in 273 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 433ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 184 ms.
Support contains 1 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 102/102 transitions.
Applied a total of 0 rules in 11 ms. Remains 161 /161 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 161/161 places, 102/102 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 102/102 transitions.
Applied a total of 0 rules in 11 ms. Remains 161 /161 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2025-05-31 00:43:40] [INFO ] Invariant cache hit.
[2025-05-31 00:43:40] [INFO ] Implicit Places using invariants in 306 ms returned []
[2025-05-31 00:43:40] [INFO ] Invariant cache hit.
[2025-05-31 00:43:41] [INFO ] Implicit Places using invariants and state equation in 432 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 743 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 160/161 places, 102/102 transitions.
Applied a total of 0 rules in 10 ms. Remains 160 /160 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 766 ms. Remains : 160/161 places, 102/102 transitions.
RANDOM walk for 40000 steps (1879 resets) in 123 ms. (322 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (405 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1537934 steps, run timeout after 3001 ms. (steps per millisecond=512 ) properties seen :0 out of 1
Probabilistic random walk after 1537934 steps, saw 198200 distinct states, run finished after 3001 ms. (steps per millisecond=512 ) properties seen :0
// Phase 1: matrix 102 rows 160 cols
[2025-05-31 00:43:44] [INFO ] Computed 61 invariants in 9 ms
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) 69/70 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 35/105 variables, 23/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 36/141 variables, 18/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/148 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 97/245 variables, 148/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 15/260 variables, 10/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/260 variables, 4/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/260 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/262 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/262 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/262 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/262 variables, and 221 constraints, problems are : Problem set: 0 solved, 1 unsolved in 205 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 160/160 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) 69/70 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/105 variables, 23/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 36/141 variables, 18/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/148 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 97/245 variables, 148/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 15/260 variables, 10/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/260 variables, 4/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/260 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/262 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/262 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/262 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/262 variables, and 222 constraints, problems are : Problem set: 0 solved, 1 unsolved in 214 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 433ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 163 ms.
Support contains 1 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 102/102 transitions.
Applied a total of 0 rules in 9 ms. Remains 160 /160 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 160/160 places, 102/102 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 102/102 transitions.
Applied a total of 0 rules in 11 ms. Remains 160 /160 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2025-05-31 00:43:44] [INFO ] Invariant cache hit.
[2025-05-31 00:43:45] [INFO ] Implicit Places using invariants in 300 ms returned []
[2025-05-31 00:43:45] [INFO ] Invariant cache hit.
[2025-05-31 00:43:45] [INFO ] Implicit Places using invariants and state equation in 455 ms returned []
Implicit Place search using SMT with State Equation took 759 ms to find 0 implicit places.
[2025-05-31 00:43:45] [INFO ] Redundant transitions in 4 ms returned []
Running 99 sub problems to find dead transitions.
[2025-05-31 00:43:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 17/51 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 99 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 3/160 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (OVERLAPS) 102/262 variables, 160/221 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2025-05-31 00:43:48] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 4 ms to minimize.
[2025-05-31 00:43:49] [INFO ] Deduced a trap composed of 14 places in 832 ms of which 2 ms to minimize.
[2025-05-31 00:43:49] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 3/224 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (OVERLAPS) 0/262 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/262 variables, and 224 constraints, problems are : Problem set: 0 solved, 99 unsolved in 6183 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 17/51 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 3/160 variables, 10/64 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (OVERLAPS) 102/262 variables, 160/224 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 99/323 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2025-05-31 00:43:56] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2025-05-31 00:43:59] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/262 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/262 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 11 (OVERLAPS) 0/262 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/262 variables, and 325 constraints, problems are : Problem set: 0 solved, 99 unsolved in 21636 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 5/5 constraints]
After SMT, in 27868ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 27871ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28663 ms. Remains : 160/160 places, 102/102 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 6 ms. Remains 160 /160 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Running SMT prover for 1 properties.
[2025-05-31 00:44:13] [INFO ] Invariant cache hit.
[2025-05-31 00:44:13] [INFO ] [Real]Absence check using 34 positive place invariants in 10 ms returned sat
[2025-05-31 00:44:13] [INFO ] [Real]Absence check using 34 positive and 27 generalized place invariants in 15 ms returned sat
[2025-05-31 00:44:13] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 00:44:13] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2025-05-31 00:44:13] [INFO ] [Nat]Absence check using 34 positive and 27 generalized place invariants in 15 ms returned sat
[2025-05-31 00:44:13] [INFO ] After 77ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 00:44:13] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2025-05-31 00:44:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
TRAPS : Iteration 1
[2025-05-31 00:44:13] [INFO ] After 161ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 00:44:13] [INFO ] After 241ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 328 ms.
RANDOM walk for 40000 steps (1845 resets) in 111 ms. (357 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (371 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1459142 steps, run timeout after 3001 ms. (steps per millisecond=486 ) properties seen :0 out of 1
Probabilistic random walk after 1459142 steps, saw 187627 distinct states, run finished after 3001 ms. (steps per millisecond=486 ) properties seen :0
// Phase 1: matrix 103 rows 162 cols
[2025-05-31 00:44:16] [INFO ] Computed 62 invariants in 3 ms
[2025-05-31 00:44:16] [INFO ] State equation strengthened by 3 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) 70/71 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 57/128 variables, 34/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/158 variables, 19/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 103/261 variables, 158/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 3/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/265 variables, 4/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/265 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 227 constraints, problems are : Problem set: 0 solved, 1 unsolved in 159 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 162/162 constraints, ReadFeed: 3/3 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) 70/71 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 57/128 variables, 34/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/158 variables, 19/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 103/261 variables, 158/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 3/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/265 variables, 4/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/265 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/265 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 228 constraints, problems are : Problem set: 0 solved, 1 unsolved in 175 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 162/162 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 344ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 168 ms.
Support contains 1 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 103/103 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 161 transition count 102
Applied a total of 1 rules in 15 ms. Remains 161 /162 variables (removed 1) and now considering 102/103 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 161/162 places, 102/103 transitions.
RANDOM walk for 40000 steps (1906 resets) in 140 ms. (283 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (357 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1427186 steps, run timeout after 3001 ms. (steps per millisecond=475 ) properties seen :0 out of 1
Probabilistic random walk after 1427186 steps, saw 183735 distinct states, run finished after 3001 ms. (steps per millisecond=475 ) properties seen :0
// Phase 1: matrix 102 rows 161 cols
[2025-05-31 00:44:20] [INFO ] Computed 62 invariants in 5 ms
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) 69/70 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/105 variables, 23/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 37/142 variables, 19/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/149 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 97/246 variables, 149/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 15/261 variables, 10/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/261 variables, 4/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/261 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/263 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/263 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/263 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/263 variables, and 223 constraints, problems are : Problem set: 0 solved, 1 unsolved in 168 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 161/161 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) 69/70 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/105 variables, 23/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 00:44:20] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 37/142 variables, 19/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/149 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/149 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 97/246 variables, 149/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/246 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 15/261 variables, 10/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/261 variables, 4/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/261 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/263 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/263 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/263 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 263/263 variables, and 225 constraints, problems are : Problem set: 0 solved, 1 unsolved in 202 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 382ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 96 ms.
Support contains 1 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 102/102 transitions.
Applied a total of 0 rules in 6 ms. Remains 161 /161 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 161/161 places, 102/102 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 102/102 transitions.
Applied a total of 0 rules in 6 ms. Remains 161 /161 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2025-05-31 00:44:20] [INFO ] Invariant cache hit.
[2025-05-31 00:44:21] [INFO ] Implicit Places using invariants in 214 ms returned []
[2025-05-31 00:44:21] [INFO ] Invariant cache hit.
[2025-05-31 00:44:21] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 534 ms to find 0 implicit places.
[2025-05-31 00:44:21] [INFO ] Redundant transitions in 2 ms returned []
Running 99 sub problems to find dead transitions.
[2025-05-31 00:44:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 25/59 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (OVERLAPS) 3/161 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (OVERLAPS) 102/263 variables, 161/223 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2025-05-31 00:44:23] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 2 ms to minimize.
[2025-05-31 00:44:23] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2025-05-31 00:44:23] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 3/226 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (OVERLAPS) 0/263 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/263 variables, and 226 constraints, problems are : Problem set: 0 solved, 99 unsolved in 4569 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 25/59 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 3/161 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (OVERLAPS) 102/263 variables, 161/226 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 99/325 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2025-05-31 00:44:28] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/263 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2025-05-31 00:44:32] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 2 ms to minimize.
[2025-05-31 00:44:32] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 2 ms to minimize.
[2025-05-31 00:44:32] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 2 ms to minimize.
[2025-05-31 00:44:34] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2025-05-31 00:44:34] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2025-05-31 00:44:34] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 6/332 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/263 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 12 (OVERLAPS) 0/263 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 263/263 variables, and 332 constraints, problems are : Problem set: 0 solved, 99 unsolved in 22765 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 10/10 constraints]
After SMT, in 27356ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 27357ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27907 ms. Remains : 161/161 places, 102/102 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 4 ms. Remains 161 /161 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Running SMT prover for 1 properties.
[2025-05-31 00:44:48] [INFO ] Invariant cache hit.
[2025-05-31 00:44:48] [INFO ] [Real]Absence check using 34 positive place invariants in 12 ms returned sat
[2025-05-31 00:44:48] [INFO ] [Real]Absence check using 34 positive and 28 generalized place invariants in 19 ms returned sat
[2025-05-31 00:44:49] [INFO ] After 102ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 00:44:49] [INFO ] After 118ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2025-05-31 00:44:49] [INFO ] After 220ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 230 ms.
RANDOM walk for 40000 steps (1836 resets) in 153 ms. (259 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (365 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1388978 steps, run timeout after 3001 ms. (steps per millisecond=462 ) properties seen :0 out of 1
Probabilistic random walk after 1388978 steps, saw 179050 distinct states, run finished after 3001 ms. (steps per millisecond=462 ) properties seen :0
// Phase 1: matrix 103 rows 162 cols
[2025-05-31 00:44:52] [INFO ] Computed 62 invariants in 2 ms
[2025-05-31 00:44:52] [INFO ] State equation strengthened by 3 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) 43/65 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 69/134 variables, 34/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 24/158 variables, 23/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 103/261 variables, 158/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 3/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/261 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4/265 variables, 4/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/265 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/265 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 227 constraints, problems are : Problem set: 0 solved, 1 unsolved in 159 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 162/162 constraints, ReadFeed: 3/3 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) 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) 43/65 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 69/134 variables, 34/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 24/158 variables, 23/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 103/261 variables, 158/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 3/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/261 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/261 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/265 variables, 4/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 00:44:52] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/265 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/265 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/265 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 229 constraints, problems are : Problem set: 0 solved, 1 unsolved in 273 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 162/162 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 439ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 61 ms.
Support contains 1 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 103/103 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 161 transition count 102
Applied a total of 1 rules in 10 ms. Remains 161 /162 variables (removed 1) and now considering 102/103 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 161/162 places, 102/103 transitions.
RANDOM walk for 40000 steps (1938 resets) in 110 ms. (360 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (398 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1390005 steps, run timeout after 3001 ms. (steps per millisecond=463 ) properties seen :0 out of 1
Probabilistic random walk after 1390005 steps, saw 179209 distinct states, run finished after 3015 ms. (steps per millisecond=461 ) properties seen :0
// Phase 1: matrix 102 rows 161 cols
[2025-05-31 00:44:55] [INFO ] Computed 62 invariants in 3 ms
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) 42/64 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 43/107 variables, 21/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 00:44:55] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 33/140 variables, 23/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 9/149 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/149 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 97/246 variables, 149/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/246 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 15/261 variables, 10/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/261 variables, 4/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/261 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/263 variables, 2/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/263 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/263 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/263 variables, and 224 constraints, problems are : Problem set: 0 solved, 1 unsolved in 294 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 161/161 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) 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) 42/64 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 43/107 variables, 21/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 33/140 variables, 23/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 00:44:56] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/140 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/149 variables, 9/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/149 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 97/246 variables, 149/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/246 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 15/261 variables, 10/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/261 variables, 4/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/261 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/261 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/263 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/263 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/263 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 263/263 variables, and 226 constraints, problems are : Problem set: 0 solved, 1 unsolved in 318 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 624ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 82 ms.
Support contains 1 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 102/102 transitions.
Applied a total of 0 rules in 7 ms. Remains 161 /161 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 161/161 places, 102/102 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 102/102 transitions.
Applied a total of 0 rules in 7 ms. Remains 161 /161 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2025-05-31 00:44:56] [INFO ] Invariant cache hit.
[2025-05-31 00:44:56] [INFO ] Implicit Places using invariants in 318 ms returned []
[2025-05-31 00:44:56] [INFO ] Invariant cache hit.
[2025-05-31 00:44:57] [INFO ] Implicit Places using invariants and state equation in 413 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 741 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 160/161 places, 102/102 transitions.
Applied a total of 0 rules in 12 ms. Remains 160 /160 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 760 ms. Remains : 160/161 places, 102/102 transitions.
RANDOM walk for 40000 steps (1910 resets) in 173 ms. (229 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (408 resets) in 84 ms. (470 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1274426 steps, run timeout after 3001 ms. (steps per millisecond=424 ) properties seen :0 out of 1
Probabilistic random walk after 1274426 steps, saw 164453 distinct states, run finished after 3001 ms. (steps per millisecond=424 ) properties seen :0
// Phase 1: matrix 102 rows 160 cols
[2025-05-31 00:45:00] [INFO ] Computed 61 invariants in 3 ms
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
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 59/81 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 35/116 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 25/141 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/148 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/148 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 97/245 variables, 148/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/245 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 15/260 variables, 10/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/260 variables, 4/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/260 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/262 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/262 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/262 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/262 variables, and 221 constraints, problems are : Problem set: 0 solved, 1 unsolved in 221 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 160/160 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) 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) 59/81 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 35/116 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 25/141 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/148 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/148 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 97/245 variables, 148/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/245 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 15/260 variables, 10/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/260 variables, 4/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/260 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/260 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/262 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/262 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/262 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/262 variables, and 222 constraints, problems are : Problem set: 0 solved, 1 unsolved in 234 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 465ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 93 ms.
Support contains 1 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 102/102 transitions.
Applied a total of 0 rules in 6 ms. Remains 160 /160 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 160/160 places, 102/102 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 102/102 transitions.
Applied a total of 0 rules in 6 ms. Remains 160 /160 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2025-05-31 00:45:00] [INFO ] Invariant cache hit.
[2025-05-31 00:45:01] [INFO ] Implicit Places using invariants in 292 ms returned []
[2025-05-31 00:45:01] [INFO ] Invariant cache hit.
[2025-05-31 00:45:01] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 680 ms to find 0 implicit places.
[2025-05-31 00:45:01] [INFO ] Redundant transitions in 4 ms returned []
Running 99 sub problems to find dead transitions.
[2025-05-31 00:45:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 17/51 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 99 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 3/160 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (OVERLAPS) 102/262 variables, 160/221 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2025-05-31 00:45:03] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 2 ms to minimize.
[2025-05-31 00:45:04] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 2 ms to minimize.
[2025-05-31 00:45:04] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 3/224 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (OVERLAPS) 0/262 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/262 variables, and 224 constraints, problems are : Problem set: 0 solved, 99 unsolved in 5516 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 17/51 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 3/160 variables, 10/64 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (OVERLAPS) 102/262 variables, 160/224 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 99/323 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2025-05-31 00:45:10] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2025-05-31 00:45:12] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/262 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/262 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 11 (OVERLAPS) 0/262 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/262 variables, and 325 constraints, problems are : Problem set: 0 solved, 99 unsolved in 17945 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 5/5 constraints]
After SMT, in 23493ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 23495ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24198 ms. Remains : 160/160 places, 102/102 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 5 ms. Remains 160 /160 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Running SMT prover for 1 properties.
[2025-05-31 00:45:25] [INFO ] Invariant cache hit.
[2025-05-31 00:45:25] [INFO ] [Real]Absence check using 34 positive place invariants in 10 ms returned sat
[2025-05-31 00:45:25] [INFO ] [Real]Absence check using 34 positive and 27 generalized place invariants in 20 ms returned sat
[2025-05-31 00:45:25] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 00:45:25] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2025-05-31 00:45:25] [INFO ] [Nat]Absence check using 34 positive and 27 generalized place invariants in 14 ms returned sat
[2025-05-31 00:45:25] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 00:45:25] [INFO ] After 94ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 00:45:25] [INFO ] After 175ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 306 ms.
RANDOM walk for 40000 steps (1852 resets) in 158 ms. (251 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (402 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1472033 steps, run timeout after 3001 ms. (steps per millisecond=490 ) properties seen :0 out of 1
Probabilistic random walk after 1472033 steps, saw 189240 distinct states, run finished after 3001 ms. (steps per millisecond=490 ) properties seen :0
// Phase 1: matrix 103 rows 162 cols
[2025-05-31 00:45:28] [INFO ] Computed 62 invariants in 2 ms
[2025-05-31 00:45:28] [INFO ] State equation strengthened by 3 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) 64/65 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 69/134 variables, 34/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 24/158 variables, 23/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 103/261 variables, 158/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 3/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/265 variables, 4/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/265 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 227 constraints, problems are : Problem set: 0 solved, 1 unsolved in 169 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 162/162 constraints, ReadFeed: 3/3 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) 64/65 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 69/134 variables, 34/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 24/158 variables, 23/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 103/261 variables, 158/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 3/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/265 variables, 4/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/265 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/265 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 228 constraints, problems are : Problem set: 0 solved, 1 unsolved in 166 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 162/162 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 361ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 102 ms.
Support contains 1 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 103/103 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 161 transition count 102
Applied a total of 1 rules in 8 ms. Remains 161 /162 variables (removed 1) and now considering 102/103 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 161/162 places, 102/103 transitions.
RANDOM walk for 40000 steps (1947 resets) in 101 ms. (392 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (378 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1472084 steps, run timeout after 3001 ms. (steps per millisecond=490 ) properties seen :0 out of 1
Probabilistic random walk after 1472084 steps, saw 189244 distinct states, run finished after 3001 ms. (steps per millisecond=490 ) properties seen :0
// Phase 1: matrix 102 rows 161 cols
[2025-05-31 00:45:31] [INFO ] Computed 62 invariants in 2 ms
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) 63/64 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 43/107 variables, 21/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 33/140 variables, 23/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/149 variables, 9/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 97/246 variables, 149/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 15/261 variables, 10/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/261 variables, 4/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/261 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/263 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/263 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/263 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/263 variables, and 223 constraints, problems are : Problem set: 0 solved, 1 unsolved in 176 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 161/161 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) 63/64 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 43/107 variables, 21/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 33/140 variables, 23/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/149 variables, 9/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 97/246 variables, 149/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 15/261 variables, 10/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/261 variables, 4/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/261 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/263 variables, 2/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/263 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/263 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 263/263 variables, and 224 constraints, problems are : Problem set: 0 solved, 1 unsolved in 176 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 361ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 75 ms.
Support contains 1 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 102/102 transitions.
Applied a total of 0 rules in 5 ms. Remains 161 /161 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 161/161 places, 102/102 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 102/102 transitions.
Applied a total of 0 rules in 4 ms. Remains 161 /161 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2025-05-31 00:45:32] [INFO ] Invariant cache hit.
[2025-05-31 00:45:32] [INFO ] Implicit Places using invariants in 276 ms returned []
[2025-05-31 00:45:32] [INFO ] Invariant cache hit.
[2025-05-31 00:45:33] [INFO ] Implicit Places using invariants and state equation in 345 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 626 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 160/161 places, 102/102 transitions.
Applied a total of 0 rules in 3 ms. Remains 160 /160 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 634 ms. Remains : 160/161 places, 102/102 transitions.
RANDOM walk for 40000 steps (1935 resets) in 133 ms. (298 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (382 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1432653 steps, run timeout after 3001 ms. (steps per millisecond=477 ) properties seen :0 out of 1
Probabilistic random walk after 1432653 steps, saw 184466 distinct states, run finished after 3004 ms. (steps per millisecond=476 ) properties seen :0
// Phase 1: matrix 102 rows 160 cols
[2025-05-31 00:45:36] [INFO ] Computed 61 invariants in 2 ms
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) 80/81 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 35/116 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/141 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/148 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 97/245 variables, 148/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 15/260 variables, 10/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/260 variables, 4/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/260 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/262 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/262 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/262 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/262 variables, and 221 constraints, problems are : Problem set: 0 solved, 1 unsolved in 165 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 160/160 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) 80/81 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/116 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/141 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/148 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 97/245 variables, 148/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 15/260 variables, 10/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/260 variables, 4/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/260 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/262 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/262 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/262 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/262 variables, and 222 constraints, problems are : Problem set: 0 solved, 1 unsolved in 183 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 355ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 88 ms.
Support contains 1 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 102/102 transitions.
Applied a total of 0 rules in 3 ms. Remains 160 /160 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 160/160 places, 102/102 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 102/102 transitions.
Applied a total of 0 rules in 3 ms. Remains 160 /160 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2025-05-31 00:45:36] [INFO ] Invariant cache hit.
[2025-05-31 00:45:36] [INFO ] Implicit Places using invariants in 196 ms returned []
[2025-05-31 00:45:36] [INFO ] Invariant cache hit.
[2025-05-31 00:45:37] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 523 ms to find 0 implicit places.
[2025-05-31 00:45:37] [INFO ] Redundant transitions in 3 ms returned []
Running 99 sub problems to find dead transitions.
[2025-05-31 00:45:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 17/51 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 99 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 3/160 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (OVERLAPS) 102/262 variables, 160/221 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2025-05-31 00:45:38] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 2 ms to minimize.
[2025-05-31 00:45:38] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 2 ms to minimize.
[2025-05-31 00:45:38] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 3/224 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (OVERLAPS) 0/262 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/262 variables, and 224 constraints, problems are : Problem set: 0 solved, 99 unsolved in 3438 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 17/51 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 3/160 variables, 10/64 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (OVERLAPS) 102/262 variables, 160/224 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 99/323 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2025-05-31 00:45:43] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2025-05-31 00:45:46] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/262 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/262 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 11 (OVERLAPS) 0/262 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/262 variables, and 325 constraints, problems are : Problem set: 0 solved, 99 unsolved in 16691 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 5/5 constraints]
After SMT, in 20151ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 20152ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20688 ms. Remains : 160/160 places, 102/102 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 4 ms. Remains 160 /160 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Running SMT prover for 1 properties.
[2025-05-31 00:45:57] [INFO ] Invariant cache hit.
[2025-05-31 00:45:57] [INFO ] [Real]Absence check using 34 positive place invariants in 10 ms returned sat
[2025-05-31 00:45:57] [INFO ] [Real]Absence check using 34 positive and 27 generalized place invariants in 16 ms returned sat
[2025-05-31 00:45:57] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 00:45:57] [INFO ] [Nat]Absence check using 34 positive place invariants in 10 ms returned sat
[2025-05-31 00:45:57] [INFO ] [Nat]Absence check using 34 positive and 27 generalized place invariants in 16 ms returned sat
[2025-05-31 00:45:57] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 00:45:57] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2025-05-31 00:45:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
TRAPS : Iteration 1
[2025-05-31 00:45:57] [INFO ] After 140ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 00:45:57] [INFO ] After 219ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 300 ms.
RANDOM walk for 40000 steps (1891 resets) in 128 ms. (310 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (365 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1447785 steps, run timeout after 3001 ms. (steps per millisecond=482 ) properties seen :0 out of 1
Probabilistic random walk after 1447785 steps, saw 186294 distinct states, run finished after 3001 ms. (steps per millisecond=482 ) properties seen :0
// Phase 1: matrix 103 rows 162 cols
[2025-05-31 00:46:00] [INFO ] Computed 62 invariants in 2 ms
[2025-05-31 00:46:00] [INFO ] State equation strengthened by 3 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) 64/65 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 69/134 variables, 34/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 24/158 variables, 23/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 103/261 variables, 158/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 3/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/265 variables, 4/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/265 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 227 constraints, problems are : Problem set: 0 solved, 1 unsolved in 151 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 162/162 constraints, ReadFeed: 3/3 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) 64/65 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 69/134 variables, 34/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 24/158 variables, 23/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 103/261 variables, 158/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 3/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/265 variables, 4/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/265 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/265 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 228 constraints, problems are : Problem set: 0 solved, 1 unsolved in 144 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 162/162 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 302ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 71 ms.
Support contains 1 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 103/103 transitions.
Graph (complete) has 546 edges and 162 vertex of which 158 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 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 2 place count 158 transition count 102
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 157 transition count 101
Applied a total of 3 rules in 17 ms. Remains 157 /162 variables (removed 5) and now considering 101/103 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 157/162 places, 101/103 transitions.
RANDOM walk for 40000 steps (1935 resets) in 102 ms. (388 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (402 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1486205 steps, run timeout after 3001 ms. (steps per millisecond=495 ) properties seen :0 out of 1
Probabilistic random walk after 1486205 steps, saw 191006 distinct states, run finished after 3001 ms. (steps per millisecond=495 ) properties seen :0
// Phase 1: matrix 101 rows 157 cols
[2025-05-31 00:46:04] [INFO ] Computed 59 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 44/92 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/126 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/135 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 86/221 variables, 135/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 14/235 variables, 8/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/235 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/235 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 14/249 variables, 5/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/249 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/249 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 9/258 variables, 9/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/258 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/258 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 216 constraints, problems are : Problem set: 0 solved, 1 unsolved in 163 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 44/92 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/126 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/135 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 86/221 variables, 135/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/221 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 14/235 variables, 8/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/235 variables, 3/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/235 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 14/249 variables, 5/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/249 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/249 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 9/258 variables, 9/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/258 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/258 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 217 constraints, problems are : Problem set: 0 solved, 1 unsolved in 148 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 316ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 58 ms.
Support contains 1 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 3 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 157/157 places, 101/101 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 3 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2025-05-31 00:46:04] [INFO ] Invariant cache hit.
[2025-05-31 00:46:04] [INFO ] Implicit Places using invariants in 200 ms returned []
[2025-05-31 00:46:04] [INFO ] Invariant cache hit.
[2025-05-31 00:46:04] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
[2025-05-31 00:46:04] [INFO ] Redundant transitions in 1 ms returned []
Running 98 sub problems to find dead transitions.
[2025-05-31 00:46:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 98 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/156 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (OVERLAPS) 101/257 variables, 156/215 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:46:06] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2025-05-31 00:46:06] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 2 ms to minimize.
[2025-05-31 00:46:06] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 3/218 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:46:07] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 1/258 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:46:08] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2025-05-31 00:46:08] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:46:09] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/258 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:46:10] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/258 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:46:11] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/258 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/258 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 16 (OVERLAPS) 0/258 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 225 constraints, problems are : Problem set: 0 solved, 98 unsolved in 8289 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 2/156 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 101/257 variables, 156/224 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 98/322 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (OVERLAPS) 1/258 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:46:23] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2025-05-31 00:46:23] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/258 variables, 2/325 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/258 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 14 (OVERLAPS) 0/258 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 325 constraints, problems are : Problem set: 0 solved, 98 unsolved in 23375 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 11/11 constraints]
After SMT, in 31683ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 31684ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32172 ms. Remains : 157/157 places, 101/101 transitions.
Attempting over-approximation, by ignoring read arcs.
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 157 transition count 101
Applied a total of 1 rules in 6 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 101 rows 157 cols
[2025-05-31 00:46:36] [INFO ] Computed 59 invariants in 1 ms
[2025-05-31 00:46:36] [INFO ] [Real]Absence check using 35 positive place invariants in 8 ms returned sat
[2025-05-31 00:46:36] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 11 ms returned sat
[2025-05-31 00:46:36] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 00:46:36] [INFO ] [Nat]Absence check using 35 positive place invariants in 9 ms returned sat
[2025-05-31 00:46:36] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 11 ms returned sat
[2025-05-31 00:46:36] [INFO ] After 67ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 00:46:36] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2025-05-31 00:46:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
TRAPS : Iteration 1
[2025-05-31 00:46:36] [INFO ] After 117ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 00:46:36] [INFO ] After 189ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 260 ms.
RANDOM walk for 4 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (1819 resets) in 419 ms. (95 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (377 resets) in 130 ms. (305 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1269739 steps, run timeout after 3001 ms. (steps per millisecond=423 ) properties seen :0 out of 1
Probabilistic random walk after 1269739 steps, saw 163863 distinct states, run finished after 3015 ms. (steps per millisecond=421 ) properties seen :0
// Phase 1: matrix 103 rows 162 cols
[2025-05-31 00:46:40] [INFO ] Computed 62 invariants in 2 ms
[2025-05-31 00:46:40] [INFO ] State equation strengthened by 3 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) 64/65 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 69/134 variables, 34/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 24/158 variables, 23/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 103/261 variables, 158/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 3/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/265 variables, 4/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/265 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 227 constraints, problems are : Problem set: 0 solved, 1 unsolved in 185 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 162/162 constraints, ReadFeed: 3/3 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) 64/65 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 69/134 variables, 34/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 24/158 variables, 23/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 103/261 variables, 158/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 3/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/265 variables, 4/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/265 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/265 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 228 constraints, problems are : Problem set: 0 solved, 1 unsolved in 201 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 162/162 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 394ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 48 ms.
Support contains 1 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 103/103 transitions.
Graph (complete) has 546 edges and 162 vertex of which 158 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 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 2 place count 158 transition count 102
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 157 transition count 101
Applied a total of 3 rules in 10 ms. Remains 157 /162 variables (removed 5) and now considering 101/103 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 157/162 places, 101/103 transitions.
RANDOM walk for 40000 steps (1902 resets) in 190 ms. (209 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (379 resets) in 141 ms. (281 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1328734 steps, run timeout after 3001 ms. (steps per millisecond=442 ) properties seen :0 out of 1
Probabilistic random walk after 1328734 steps, saw 171311 distinct states, run finished after 3010 ms. (steps per millisecond=441 ) properties seen :0
// Phase 1: matrix 101 rows 157 cols
[2025-05-31 00:46:43] [INFO ] Computed 59 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 44/92 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/126 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/135 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 86/221 variables, 135/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 14/235 variables, 8/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/235 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/235 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 14/249 variables, 5/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/249 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/249 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 9/258 variables, 9/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/258 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/258 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 216 constraints, problems are : Problem set: 0 solved, 1 unsolved in 189 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 44/92 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/126 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/135 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 86/221 variables, 135/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/221 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 14/235 variables, 8/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/235 variables, 3/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/235 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 14/249 variables, 5/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/249 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/249 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 9/258 variables, 9/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/258 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/258 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 217 constraints, problems are : Problem set: 0 solved, 1 unsolved in 217 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 412ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 40 ms.
Support contains 1 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 3 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 157/157 places, 101/101 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 2 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2025-05-31 00:46:44] [INFO ] Invariant cache hit.
[2025-05-31 00:46:44] [INFO ] Implicit Places using invariants in 213 ms returned []
[2025-05-31 00:46:44] [INFO ] Invariant cache hit.
[2025-05-31 00:46:44] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 625 ms to find 0 implicit places.
[2025-05-31 00:46:44] [INFO ] Redundant transitions in 1 ms returned []
Running 98 sub problems to find dead transitions.
[2025-05-31 00:46:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 98 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/156 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (OVERLAPS) 101/257 variables, 156/215 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:46:47] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 2 ms to minimize.
[2025-05-31 00:46:47] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 2 ms to minimize.
[2025-05-31 00:46:47] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 3/218 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:46:48] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 1/258 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:46:50] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 3 ms to minimize.
[2025-05-31 00:46:50] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:46:52] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/258 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:46:53] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/258 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:46:54] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/258 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/258 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 16 (OVERLAPS) 0/258 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 225 constraints, problems are : Problem set: 0 solved, 98 unsolved in 12514 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 2/156 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 101/257 variables, 156/224 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 98/322 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (OVERLAPS) 1/258 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:47:10] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2025-05-31 00:47:10] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/258 variables, 2/325 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/258 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 14 (OVERLAPS) 0/258 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 325 constraints, problems are : Problem set: 0 solved, 98 unsolved in 25897 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 11/11 constraints]
After SMT, in 38441ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 38443ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39078 ms. Remains : 157/157 places, 101/101 transitions.
Attempting over-approximation, by ignoring read arcs.
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 157 transition count 101
Applied a total of 1 rules in 10 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 101 rows 157 cols
[2025-05-31 00:47:23] [INFO ] Computed 59 invariants in 1 ms
[2025-05-31 00:47:23] [INFO ] [Real]Absence check using 35 positive place invariants in 11 ms returned sat
[2025-05-31 00:47:23] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 13 ms returned sat
[2025-05-31 00:47:23] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 00:47:23] [INFO ] [Nat]Absence check using 35 positive place invariants in 11 ms returned sat
[2025-05-31 00:47:23] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 13 ms returned sat
[2025-05-31 00:47:23] [INFO ] After 79ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 00:47:23] [INFO ] After 92ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 00:47:23] [INFO ] After 172ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 259 ms.
RANDOM walk for 40000 steps (1851 resets) in 136 ms. (291 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (365 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1391411 steps, run timeout after 3001 ms. (steps per millisecond=463 ) properties seen :0 out of 1
Probabilistic random walk after 1391411 steps, saw 179400 distinct states, run finished after 3001 ms. (steps per millisecond=463 ) properties seen :0
// Phase 1: matrix 103 rows 162 cols
[2025-05-31 00:47:26] [INFO ] Computed 62 invariants in 4 ms
[2025-05-31 00:47:26] [INFO ] State equation strengthened by 3 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) 64/65 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 69/134 variables, 34/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 24/158 variables, 23/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 103/261 variables, 158/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 3/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/265 variables, 4/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/265 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 227 constraints, problems are : Problem set: 0 solved, 1 unsolved in 277 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 162/162 constraints, ReadFeed: 3/3 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) 64/65 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 69/134 variables, 34/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 24/158 variables, 23/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 103/261 variables, 158/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 3/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/265 variables, 4/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/265 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/265 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 228 constraints, problems are : Problem set: 0 solved, 1 unsolved in 209 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 162/162 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 496ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 76 ms.
Support contains 1 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 103/103 transitions.
Graph (complete) has 546 edges and 162 vertex of which 158 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 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 2 place count 158 transition count 102
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 157 transition count 101
Applied a total of 3 rules in 14 ms. Remains 157 /162 variables (removed 5) and now considering 101/103 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 157/162 places, 101/103 transitions.
RANDOM walk for 40000 steps (1961 resets) in 146 ms. (272 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (382 resets) in 83 ms. (476 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1381550 steps, run timeout after 3001 ms. (steps per millisecond=460 ) properties seen :0 out of 1
Probabilistic random walk after 1381550 steps, saw 178084 distinct states, run finished after 3001 ms. (steps per millisecond=460 ) properties seen :0
// Phase 1: matrix 101 rows 157 cols
[2025-05-31 00:47:30] [INFO ] Computed 59 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 44/92 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/126 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/135 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 86/221 variables, 135/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 14/235 variables, 8/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/235 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/235 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 14/249 variables, 5/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/249 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/249 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 9/258 variables, 9/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/258 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/258 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 216 constraints, problems are : Problem set: 0 solved, 1 unsolved in 136 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 44/92 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/126 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/135 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 86/221 variables, 135/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/221 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 14/235 variables, 8/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/235 variables, 3/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/235 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 14/249 variables, 5/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/249 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/249 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 9/258 variables, 9/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/258 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/258 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 217 constraints, problems are : Problem set: 0 solved, 1 unsolved in 157 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 301ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 30 ms.
Support contains 1 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 6 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 157/157 places, 101/101 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 3 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2025-05-31 00:47:30] [INFO ] Invariant cache hit.
[2025-05-31 00:47:30] [INFO ] Implicit Places using invariants in 247 ms returned []
[2025-05-31 00:47:30] [INFO ] Invariant cache hit.
[2025-05-31 00:47:31] [INFO ] Implicit Places using invariants and state equation in 421 ms returned []
Implicit Place search using SMT with State Equation took 671 ms to find 0 implicit places.
[2025-05-31 00:47:31] [INFO ] Redundant transitions in 1 ms returned []
Running 98 sub problems to find dead transitions.
[2025-05-31 00:47:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 98 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/156 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (OVERLAPS) 101/257 variables, 156/215 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:47:33] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 2 ms to minimize.
[2025-05-31 00:47:34] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2025-05-31 00:47:34] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 3/218 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:47:35] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 1/258 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:47:36] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 2 ms to minimize.
[2025-05-31 00:47:36] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:47:38] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/258 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:47:39] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/258 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:47:41] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/258 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/258 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 16 (OVERLAPS) 0/258 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 225 constraints, problems are : Problem set: 0 solved, 98 unsolved in 12829 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 2/156 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 101/257 variables, 156/224 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 98/322 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (OVERLAPS) 1/258 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:47:56] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2025-05-31 00:47:56] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/258 variables, 2/325 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/258 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 14 (OVERLAPS) 0/258 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 325 constraints, problems are : Problem set: 0 solved, 98 unsolved in 25906 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 11/11 constraints]
After SMT, in 38763ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 38765ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39448 ms. Remains : 157/157 places, 101/101 transitions.
Attempting over-approximation, by ignoring read arcs.
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 157 transition count 101
Applied a total of 1 rules in 5 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 101 rows 157 cols
[2025-05-31 00:48:09] [INFO ] Computed 59 invariants in 2 ms
[2025-05-31 00:48:10] [INFO ] [Real]Absence check using 35 positive place invariants in 20 ms returned sat
[2025-05-31 00:48:10] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 54 ms returned sat
[2025-05-31 00:48:10] [INFO ] After 185ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 00:48:10] [INFO ] [Nat]Absence check using 35 positive place invariants in 23 ms returned sat
[2025-05-31 00:48:10] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 28 ms returned sat
[2025-05-31 00:48:10] [INFO ] After 188ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 00:48:10] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2025-05-31 00:48:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
TRAPS : Iteration 1
[2025-05-31 00:48:10] [INFO ] After 254ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 00:48:10] [INFO ] After 453ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 651 ms.
RANDOM walk for 40000 steps (1847 resets) in 157 ms. (253 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (383 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1449106 steps, run timeout after 3001 ms. (steps per millisecond=482 ) properties seen :0 out of 1
Probabilistic random walk after 1449106 steps, saw 186431 distinct states, run finished after 3001 ms. (steps per millisecond=482 ) properties seen :0
// Phase 1: matrix 103 rows 162 cols
[2025-05-31 00:48:13] [INFO ] Computed 62 invariants in 1 ms
[2025-05-31 00:48:13] [INFO ] State equation strengthened by 3 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) 64/65 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 69/134 variables, 34/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 24/158 variables, 23/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 103/261 variables, 158/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 3/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/265 variables, 4/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/265 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 227 constraints, problems are : Problem set: 0 solved, 1 unsolved in 156 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 162/162 constraints, ReadFeed: 3/3 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) 64/65 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 69/134 variables, 34/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 24/158 variables, 23/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 103/261 variables, 158/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 3/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/265 variables, 4/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/265 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/265 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 228 constraints, problems are : Problem set: 0 solved, 1 unsolved in 146 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 162/162 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 310ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 38 ms.
Support contains 1 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 103/103 transitions.
Graph (complete) has 546 edges and 162 vertex of which 158 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 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 2 place count 158 transition count 102
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 157 transition count 101
Applied a total of 3 rules in 8 ms. Remains 157 /162 variables (removed 5) and now considering 101/103 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 157/162 places, 101/103 transitions.
RANDOM walk for 40000 steps (1956 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (347 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1423305 steps, run timeout after 3001 ms. (steps per millisecond=474 ) properties seen :0 out of 1
Probabilistic random walk after 1423305 steps, saw 183249 distinct states, run finished after 3001 ms. (steps per millisecond=474 ) properties seen :0
// Phase 1: matrix 101 rows 157 cols
[2025-05-31 00:48:17] [INFO ] Computed 59 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 44/92 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/126 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/135 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 86/221 variables, 135/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 14/235 variables, 8/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/235 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/235 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 14/249 variables, 5/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/249 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/249 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 9/258 variables, 9/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/258 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/258 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 216 constraints, problems are : Problem set: 0 solved, 1 unsolved in 145 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 44/92 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/126 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/135 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 86/221 variables, 135/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/221 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 14/235 variables, 8/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/235 variables, 3/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/235 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 14/249 variables, 5/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/249 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/249 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 9/258 variables, 9/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/258 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/258 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 217 constraints, problems are : Problem set: 0 solved, 1 unsolved in 184 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 335ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 25 ms.
Support contains 1 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 2 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 157/157 places, 101/101 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 2 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2025-05-31 00:48:17] [INFO ] Invariant cache hit.
[2025-05-31 00:48:17] [INFO ] Implicit Places using invariants in 259 ms returned []
[2025-05-31 00:48:17] [INFO ] Invariant cache hit.
[2025-05-31 00:48:18] [INFO ] Implicit Places using invariants and state equation in 427 ms returned []
Implicit Place search using SMT with State Equation took 690 ms to find 0 implicit places.
[2025-05-31 00:48:18] [INFO ] Redundant transitions in 1 ms returned []
Running 98 sub problems to find dead transitions.
[2025-05-31 00:48:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 98 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/156 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (OVERLAPS) 101/257 variables, 156/215 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:48:19] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2025-05-31 00:48:20] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2025-05-31 00:48:20] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 3/218 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:48:20] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 1/258 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:48:21] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 2 ms to minimize.
[2025-05-31 00:48:21] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:48:23] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/258 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:48:24] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/258 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:48:24] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/258 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/258 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 16 (OVERLAPS) 0/258 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 225 constraints, problems are : Problem set: 0 solved, 98 unsolved in 8520 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 2/156 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 101/257 variables, 156/224 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 98/322 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (OVERLAPS) 1/258 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:48:37] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2025-05-31 00:48:37] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/258 variables, 2/325 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/258 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 14 (OVERLAPS) 0/258 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 325 constraints, problems are : Problem set: 0 solved, 98 unsolved in 23192 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 11/11 constraints]
After SMT, in 31733ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 31734ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32432 ms. Remains : 157/157 places, 101/101 transitions.
Attempting over-approximation, by ignoring read arcs.
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 157 transition count 101
Applied a total of 1 rules in 6 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 101 rows 157 cols
[2025-05-31 00:48:49] [INFO ] Computed 59 invariants in 2 ms
[2025-05-31 00:48:49] [INFO ] [Real]Absence check using 35 positive place invariants in 10 ms returned sat
[2025-05-31 00:48:49] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 13 ms returned sat
[2025-05-31 00:48:49] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 00:48:50] [INFO ] [Nat]Absence check using 35 positive place invariants in 10 ms returned sat
[2025-05-31 00:48:50] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 12 ms returned sat
[2025-05-31 00:48:50] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 00:48:50] [INFO ] After 82ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 00:48:50] [INFO ] After 158ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 244 ms.
RANDOM walk for 40000 steps (1801 resets) in 98 ms. (404 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (376 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1511897 steps, run timeout after 3001 ms. (steps per millisecond=503 ) properties seen :0 out of 1
Probabilistic random walk after 1511897 steps, saw 193932 distinct states, run finished after 3001 ms. (steps per millisecond=503 ) properties seen :0
// Phase 1: matrix 103 rows 162 cols
[2025-05-31 00:48:53] [INFO ] Computed 62 invariants in 4 ms
[2025-05-31 00:48:53] [INFO ] State equation strengthened by 3 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) 43/65 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 69/134 variables, 34/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 24/158 variables, 23/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 103/261 variables, 158/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 3/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/261 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4/265 variables, 4/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/265 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/265 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 227 constraints, problems are : Problem set: 0 solved, 1 unsolved in 177 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 162/162 constraints, ReadFeed: 3/3 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) 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) 43/65 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 69/134 variables, 34/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 24/158 variables, 23/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 103/261 variables, 158/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 3/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/261 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/261 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/265 variables, 4/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/265 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/265 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 228 constraints, problems are : Problem set: 0 solved, 1 unsolved in 161 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 162/162 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 349ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 34 ms.
Support contains 1 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 103/103 transitions.
Graph (complete) has 546 edges and 162 vertex of which 158 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 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 2 place count 158 transition count 102
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 157 transition count 101
Applied a total of 3 rules in 8 ms. Remains 157 /162 variables (removed 5) and now considering 101/103 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 157/162 places, 101/103 transitions.
RANDOM walk for 40000 steps (1979 resets) in 101 ms. (392 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (368 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1474637 steps, run timeout after 3001 ms. (steps per millisecond=491 ) properties seen :0 out of 1
Probabilistic random walk after 1474637 steps, saw 189594 distinct states, run finished after 3001 ms. (steps per millisecond=491 ) properties seen :0
// Phase 1: matrix 101 rows 157 cols
[2025-05-31 00:48:56] [INFO ] Computed 59 invariants in 1 ms
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) 12/15 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 13/28 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 15/43 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/43 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/43 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/45 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/45 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/49 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/49 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 46/95 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/95 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 40/135 variables, 20/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/135 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 32/167 variables, 22/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/167 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (OVERLAPS) 9/176 variables, 9/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/176 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 82/258 variables, 135/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/258 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/258 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/258 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 216 constraints, problems are : Problem set: 0 solved, 1 unsolved in 171 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 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) 12/15 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 13/28 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 15/43 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/43 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/43 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/45 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/45 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 4/49 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/49 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 46/95 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/95 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 40/135 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/135 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 32/167 variables, 22/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/167 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 9/176 variables, 9/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/176 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 82/258 variables, 135/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/258 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/258 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/258 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 217 constraints, problems are : Problem set: 0 solved, 1 unsolved in 159 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 336ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 193 steps, including 3 resets, run visited all 1 properties in 1 ms. (steps per millisecond=193 )
Parikh walk visited 1 properties in 10 ms.
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (1839 resets) in 106 ms. (373 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (390 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1466926 steps, run timeout after 3001 ms. (steps per millisecond=488 ) properties seen :0 out of 1
Probabilistic random walk after 1466926 steps, saw 188637 distinct states, run finished after 3001 ms. (steps per millisecond=488 ) properties seen :0
// Phase 1: matrix 103 rows 162 cols
[2025-05-31 00:49:00] [INFO ] Computed 62 invariants in 1 ms
[2025-05-31 00:49:00] [INFO ] State equation strengthened by 3 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) 43/65 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 69/134 variables, 34/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 24/158 variables, 23/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 103/261 variables, 158/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 3/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/261 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4/265 variables, 4/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/265 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/265 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 227 constraints, problems are : Problem set: 0 solved, 1 unsolved in 172 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 162/162 constraints, ReadFeed: 3/3 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) 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) 43/65 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 69/134 variables, 34/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 24/158 variables, 23/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 103/261 variables, 158/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 3/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/261 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/261 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/265 variables, 4/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/265 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/265 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 228 constraints, problems are : Problem set: 0 solved, 1 unsolved in 167 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 162/162 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 346ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 54 ms.
Support contains 1 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 103/103 transitions.
Graph (complete) has 546 edges and 162 vertex of which 158 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 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 2 place count 158 transition count 102
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 157 transition count 101
Applied a total of 3 rules in 15 ms. Remains 157 /162 variables (removed 5) and now considering 101/103 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 157/162 places, 101/103 transitions.
RANDOM walk for 40000 steps (1965 resets) in 109 ms. (363 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (357 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1497780 steps, run timeout after 3001 ms. (steps per millisecond=499 ) properties seen :0 out of 1
Probabilistic random walk after 1497780 steps, saw 192257 distinct states, run finished after 3001 ms. (steps per millisecond=499 ) properties seen :0
// Phase 1: matrix 101 rows 157 cols
[2025-05-31 00:49:03] [INFO ] Computed 59 invariants in 1 ms
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) 13/16 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 12/28 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 15/43 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/43 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/43 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/45 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/45 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/49 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/49 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 46/95 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/95 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 40/135 variables, 20/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/135 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 32/167 variables, 22/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/167 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (OVERLAPS) 9/176 variables, 9/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/176 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 82/258 variables, 135/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/258 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/258 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/258 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 216 constraints, problems are : Problem set: 0 solved, 1 unsolved in 169 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 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) 13/16 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 12/28 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 15/43 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/43 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/43 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/45 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/45 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 4/49 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/49 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 46/95 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/95 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 40/135 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/135 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 32/167 variables, 22/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/167 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 9/176 variables, 9/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/176 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 82/258 variables, 135/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/258 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/258 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/258 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 217 constraints, problems are : Problem set: 0 solved, 1 unsolved in 169 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 344ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 37 ms.
Support contains 1 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 3 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 157/157 places, 101/101 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 2 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2025-05-31 00:49:03] [INFO ] Invariant cache hit.
[2025-05-31 00:49:04] [INFO ] Implicit Places using invariants in 186 ms returned []
[2025-05-31 00:49:04] [INFO ] Invariant cache hit.
[2025-05-31 00:49:04] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
[2025-05-31 00:49:04] [INFO ] Redundant transitions in 0 ms returned []
Running 98 sub problems to find dead transitions.
[2025-05-31 00:49:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 98 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/156 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (OVERLAPS) 101/257 variables, 156/215 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:49:05] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 2 ms to minimize.
[2025-05-31 00:49:06] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2025-05-31 00:49:06] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 3/218 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:49:06] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 1/258 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:49:08] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2025-05-31 00:49:08] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:49:09] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/258 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:49:10] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/258 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:49:10] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/258 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/258 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 16 (OVERLAPS) 0/258 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 225 constraints, problems are : Problem set: 0 solved, 98 unsolved in 8399 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 2/156 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 101/257 variables, 156/224 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 98/322 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (OVERLAPS) 1/258 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:49:23] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2025-05-31 00:49:23] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/258 variables, 2/325 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/258 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 14 (OVERLAPS) 0/258 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 325 constraints, problems are : Problem set: 0 solved, 98 unsolved in 22952 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 11/11 constraints]
After SMT, in 31370ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 31371ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31854 ms. Remains : 157/157 places, 101/101 transitions.
Attempting over-approximation, by ignoring read arcs.
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 157 transition count 101
Applied a total of 1 rules in 11 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 101 rows 157 cols
[2025-05-31 00:49:35] [INFO ] Computed 59 invariants in 2 ms
[2025-05-31 00:49:35] [INFO ] [Real]Absence check using 35 positive place invariants in 14 ms returned sat
[2025-05-31 00:49:35] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 18 ms returned sat
[2025-05-31 00:49:35] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 00:49:35] [INFO ] [Nat]Absence check using 35 positive place invariants in 15 ms returned sat
[2025-05-31 00:49:35] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 18 ms returned sat
[2025-05-31 00:49:36] [INFO ] After 117ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 00:49:36] [INFO ] After 137ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 00:49:36] [INFO ] After 273ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 405 ms.
RANDOM walk for 40000 steps (1832 resets) in 200 ms. (199 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (380 resets) in 96 ms. (412 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1328078 steps, run timeout after 3001 ms. (steps per millisecond=442 ) properties seen :0 out of 1
Probabilistic random walk after 1328078 steps, saw 171245 distinct states, run finished after 3001 ms. (steps per millisecond=442 ) properties seen :0
// Phase 1: matrix 103 rows 162 cols
[2025-05-31 00:49:39] [INFO ] Computed 62 invariants in 1 ms
[2025-05-31 00:49:39] [INFO ] State equation strengthened by 3 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) 43/65 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 69/134 variables, 34/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 24/158 variables, 23/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 103/261 variables, 158/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 3/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/261 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4/265 variables, 4/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/265 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/265 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 227 constraints, problems are : Problem set: 0 solved, 1 unsolved in 164 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 162/162 constraints, ReadFeed: 3/3 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) 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) 43/65 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 69/134 variables, 34/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 24/158 variables, 23/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 103/261 variables, 158/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 3/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/261 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/261 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/265 variables, 4/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/265 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/265 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 228 constraints, problems are : Problem set: 0 solved, 1 unsolved in 153 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 162/162 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 324ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 61 ms.
Support contains 1 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 103/103 transitions.
Graph (complete) has 546 edges and 162 vertex of which 158 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 157 transition count 101
Applied a total of 2 rules in 10 ms. Remains 157 /162 variables (removed 5) and now considering 101/103 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 157/162 places, 101/103 transitions.
RANDOM walk for 40000 steps (1932 resets) in 172 ms. (231 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (368 resets) in 92 ms. (430 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1229904 steps, run timeout after 3001 ms. (steps per millisecond=409 ) properties seen :0 out of 1
Probabilistic random walk after 1229904 steps, saw 158670 distinct states, run finished after 3006 ms. (steps per millisecond=409 ) properties seen :0
// Phase 1: matrix 101 rows 157 cols
[2025-05-31 00:49:42] [INFO ] Computed 59 invariants in 1 ms
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) 12/15 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 13/28 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 15/43 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/43 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/43 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/45 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/45 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/49 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/49 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 46/95 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/95 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 40/135 variables, 20/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/135 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 32/167 variables, 22/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/167 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (OVERLAPS) 9/176 variables, 9/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/176 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 82/258 variables, 135/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/258 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/258 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/258 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 216 constraints, problems are : Problem set: 0 solved, 1 unsolved in 170 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 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) 12/15 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 13/28 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 15/43 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/43 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/43 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/45 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/45 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 4/49 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/49 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 46/95 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/95 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 40/135 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/135 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 32/167 variables, 22/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/167 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 9/176 variables, 9/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/176 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 82/258 variables, 135/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/258 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/258 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/258 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 217 constraints, problems are : Problem set: 0 solved, 1 unsolved in 160 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 335ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 57 ms.
Support contains 1 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 4 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 157/157 places, 101/101 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 3 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2025-05-31 00:49:43] [INFO ] Invariant cache hit.
[2025-05-31 00:49:43] [INFO ] Implicit Places using invariants in 277 ms returned []
[2025-05-31 00:49:43] [INFO ] Invariant cache hit.
[2025-05-31 00:49:43] [INFO ] Implicit Places using invariants and state equation in 407 ms returned []
Implicit Place search using SMT with State Equation took 686 ms to find 0 implicit places.
[2025-05-31 00:49:43] [INFO ] Redundant transitions in 0 ms returned []
Running 98 sub problems to find dead transitions.
[2025-05-31 00:49:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (OVERLAPS) 2/156 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (OVERLAPS) 101/257 variables, 156/215 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:49:46] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 2 ms to minimize.
[2025-05-31 00:49:46] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (OVERLAPS) 1/258 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:49:48] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2025-05-31 00:49:48] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2025-05-31 00:49:48] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2025-05-31 00:49:48] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 4/222 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (OVERLAPS) 0/258 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 222 constraints, problems are : Problem set: 0 solved, 98 unsolved in 6738 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 2/156 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 101/257 variables, 156/221 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 98/319 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:49:53] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 1/320 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/257 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (OVERLAPS) 1/258 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/258 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:50:07] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2025-05-31 00:50:09] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/258 variables, 2/323 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/258 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 15 (OVERLAPS) 0/258 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 323 constraints, problems are : Problem set: 0 solved, 98 unsolved in 29371 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 9/9 constraints]
After SMT, in 36141ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 36143ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36843 ms. Remains : 157/157 places, 101/101 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 4 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Running SMT prover for 1 properties.
[2025-05-31 00:50:19] [INFO ] Invariant cache hit.
[2025-05-31 00:50:20] [INFO ] [Real]Absence check using 35 positive place invariants in 14 ms returned sat
[2025-05-31 00:50:20] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 18 ms returned sat
[2025-05-31 00:50:20] [INFO ] After 219ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 00:50:20] [INFO ] [Nat]Absence check using 35 positive place invariants in 15 ms returned sat
[2025-05-31 00:50:20] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 16 ms returned sat
[2025-05-31 00:50:20] [INFO ] After 114ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 00:50:20] [INFO ] After 134ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 00:50:20] [INFO ] After 252ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 480 ms.
RANDOM walk for 40000 steps (1829 resets) in 216 ms. (184 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (371 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1303462 steps, run timeout after 3001 ms. (steps per millisecond=434 ) properties seen :0 out of 1
Probabilistic random walk after 1303462 steps, saw 168273 distinct states, run finished after 3001 ms. (steps per millisecond=434 ) properties seen :0
// Phase 1: matrix 103 rows 162 cols
[2025-05-31 00:50:23] [INFO ] Computed 62 invariants in 1 ms
[2025-05-31 00:50:23] [INFO ] State equation strengthened by 3 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) 70/71 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 57/128 variables, 34/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/158 variables, 19/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 00:50:23] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 103/261 variables, 158/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 3/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 00:50:23] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/261 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4/265 variables, 4/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/265 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/265 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 229 constraints, problems are : Problem set: 0 solved, 1 unsolved in 264 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 162/162 constraints, ReadFeed: 3/3 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) 70/71 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 57/128 variables, 34/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 00:50:23] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2025-05-31 00:50:23] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 30/158 variables, 19/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 103/261 variables, 158/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 3/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/261 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/261 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/265 variables, 4/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/265 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/265 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 232 constraints, problems are : Problem set: 0 solved, 1 unsolved in 255 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 162/162 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 523ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 113 ms.
Support contains 1 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 103/103 transitions.
Graph (complete) has 546 edges and 162 vertex of which 158 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 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 2 place count 158 transition count 102
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 157 transition count 101
Applied a total of 3 rules in 12 ms. Remains 157 /162 variables (removed 5) and now considering 101/103 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 157/162 places, 101/103 transitions.
RANDOM walk for 40000 steps (1907 resets) in 113 ms. (350 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (392 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1371567 steps, run timeout after 3001 ms. (steps per millisecond=457 ) properties seen :0 out of 1
Probabilistic random walk after 1371567 steps, saw 176758 distinct states, run finished after 3001 ms. (steps per millisecond=457 ) properties seen :0
// Phase 1: matrix 101 rows 157 cols
[2025-05-31 00:50:27] [INFO ] Computed 59 invariants in 1 ms
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) 65/66 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 37/103 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/128 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/135 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 86/221 variables, 135/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 14/235 variables, 8/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/235 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/235 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 14/249 variables, 5/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/249 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/249 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 9/258 variables, 9/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/258 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/258 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 216 constraints, problems are : Problem set: 0 solved, 1 unsolved in 205 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 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) 65/66 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/103 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/128 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/135 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 86/221 variables, 135/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/221 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 14/235 variables, 8/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/235 variables, 3/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/235 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 14/249 variables, 5/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/249 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/249 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 9/258 variables, 9/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/258 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/258 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 217 constraints, problems are : Problem set: 0 solved, 1 unsolved in 168 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 380ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 158 ms.
Support contains 1 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 3 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 157/157 places, 101/101 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 3 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2025-05-31 00:50:27] [INFO ] Invariant cache hit.
[2025-05-31 00:50:28] [INFO ] Implicit Places using invariants in 246 ms returned []
[2025-05-31 00:50:28] [INFO ] Invariant cache hit.
[2025-05-31 00:50:28] [INFO ] Implicit Places using invariants and state equation in 433 ms returned []
Implicit Place search using SMT with State Equation took 681 ms to find 0 implicit places.
[2025-05-31 00:50:28] [INFO ] Redundant transitions in 0 ms returned []
Running 98 sub problems to find dead transitions.
[2025-05-31 00:50:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 98 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/156 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (OVERLAPS) 101/257 variables, 156/215 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:50:30] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 2 ms to minimize.
[2025-05-31 00:50:31] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 2 ms to minimize.
[2025-05-31 00:50:31] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 3/218 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:50:32] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 1/258 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:50:34] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 2 ms to minimize.
[2025-05-31 00:50:34] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:50:36] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 3 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/258 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:50:37] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/258 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:50:38] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/258 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/258 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 16 (OVERLAPS) 0/258 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 225 constraints, problems are : Problem set: 0 solved, 98 unsolved in 12876 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 2/156 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 101/257 variables, 156/224 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 98/322 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (OVERLAPS) 1/258 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:50:53] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2025-05-31 00:50:53] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/258 variables, 2/325 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/258 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 14 (OVERLAPS) 0/258 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 325 constraints, problems are : Problem set: 0 solved, 98 unsolved in 26375 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 11/11 constraints]
After SMT, in 39281ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 39283ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39975 ms. Remains : 157/157 places, 101/101 transitions.
Attempting over-approximation, by ignoring read arcs.
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 157 transition count 101
Applied a total of 1 rules in 7 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 101 rows 157 cols
[2025-05-31 00:51:07] [INFO ] Computed 59 invariants in 2 ms
[2025-05-31 00:51:07] [INFO ] [Real]Absence check using 35 positive place invariants in 15 ms returned sat
[2025-05-31 00:51:07] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 18 ms returned sat
[2025-05-31 00:51:07] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 00:51:07] [INFO ] [Nat]Absence check using 35 positive place invariants in 14 ms returned sat
[2025-05-31 00:51:07] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 20 ms returned sat
[2025-05-31 00:51:08] [INFO ] After 111ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 00:51:08] [INFO ] After 130ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 00:51:08] [INFO ] After 243ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 359 ms.
RANDOM walk for 4246 steps (200 resets) in 22 ms. (184 steps per ms) remains 0/1 properties
RANDOM walk for 238 steps (10 resets) in 4 ms. (47 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (1847 resets) in 170 ms. (233 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (386 resets) in 109 ms. (363 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1374570 steps, run timeout after 3001 ms. (steps per millisecond=458 ) properties seen :0 out of 1
Probabilistic random walk after 1374570 steps, saw 177131 distinct states, run finished after 3002 ms. (steps per millisecond=457 ) properties seen :0
// Phase 1: matrix 103 rows 162 cols
[2025-05-31 00:51:11] [INFO ] Computed 62 invariants in 2 ms
[2025-05-31 00:51:11] [INFO ] State equation strengthened by 3 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) 70/71 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 57/128 variables, 34/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 00:51:11] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 2 ms to minimize.
[2025-05-31 00:51:11] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 30/158 variables, 19/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 103/261 variables, 158/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 3/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/265 variables, 4/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/265 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/265 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 229 constraints, problems are : Problem set: 0 solved, 1 unsolved in 247 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 162/162 constraints, ReadFeed: 3/3 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) 70/71 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 57/128 variables, 34/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 30/158 variables, 19/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 103/261 variables, 158/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 3/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/261 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4/265 variables, 4/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/265 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/265 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 230 constraints, problems are : Problem set: 0 solved, 1 unsolved in 167 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 162/162 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 423ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 170 ms.
Support contains 1 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 103/103 transitions.
Graph (complete) has 546 edges and 162 vertex of which 158 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 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 2 place count 158 transition count 102
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 157 transition count 101
Applied a total of 3 rules in 12 ms. Remains 157 /162 variables (removed 5) and now considering 101/103 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 157/162 places, 101/103 transitions.
RANDOM walk for 40000 steps (1923 resets) in 112 ms. (353 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (383 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1407103 steps, run timeout after 3001 ms. (steps per millisecond=468 ) properties seen :0 out of 1
Probabilistic random walk after 1407103 steps, saw 181379 distinct states, run finished after 3004 ms. (steps per millisecond=468 ) properties seen :0
// Phase 1: matrix 101 rows 157 cols
[2025-05-31 00:51:14] [INFO ] Computed 59 invariants in 2 ms
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) 65/66 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 37/103 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/128 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/135 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 86/221 variables, 135/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 14/235 variables, 8/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/235 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/235 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 14/249 variables, 5/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/249 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/249 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 9/258 variables, 9/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/258 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/258 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 216 constraints, problems are : Problem set: 0 solved, 1 unsolved in 156 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 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) 65/66 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/103 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/128 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/135 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 86/221 variables, 135/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/221 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 14/235 variables, 8/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/235 variables, 3/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/235 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 14/249 variables, 5/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/249 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/249 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 9/258 variables, 9/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 00:51:15] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/258 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/258 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/258 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 218 constraints, problems are : Problem set: 0 solved, 1 unsolved in 236 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 399ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 147 ms.
Support contains 1 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 4 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 157/157 places, 101/101 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 3 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2025-05-31 00:51:15] [INFO ] Invariant cache hit.
[2025-05-31 00:51:15] [INFO ] Implicit Places using invariants in 221 ms returned []
[2025-05-31 00:51:15] [INFO ] Invariant cache hit.
[2025-05-31 00:51:16] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 555 ms to find 0 implicit places.
[2025-05-31 00:51:16] [INFO ] Redundant transitions in 0 ms returned []
Running 98 sub problems to find dead transitions.
[2025-05-31 00:51:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 98 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/156 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (OVERLAPS) 101/257 variables, 156/215 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:51:18] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 2 ms to minimize.
[2025-05-31 00:51:18] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2025-05-31 00:51:18] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 3/218 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:51:19] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 1/258 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:51:21] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2025-05-31 00:51:21] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:51:22] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/258 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:51:23] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/258 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:51:24] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/258 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/258 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 16 (OVERLAPS) 0/258 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 225 constraints, problems are : Problem set: 0 solved, 98 unsolved in 11347 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 2/156 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 101/257 variables, 156/224 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 98/322 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (OVERLAPS) 1/258 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:51:41] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2025-05-31 00:51:41] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/258 variables, 2/325 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/258 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 14 (OVERLAPS) 0/258 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 325 constraints, problems are : Problem set: 0 solved, 98 unsolved in 27659 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 11/11 constraints]
After SMT, in 39040ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 39042ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39605 ms. Remains : 157/157 places, 101/101 transitions.
Attempting over-approximation, by ignoring read arcs.
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 157 transition count 101
Applied a total of 1 rules in 9 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 101 rows 157 cols
[2025-05-31 00:51:55] [INFO ] Computed 59 invariants in 1 ms
[2025-05-31 00:51:55] [INFO ] [Real]Absence check using 35 positive place invariants in 39 ms returned sat
[2025-05-31 00:51:55] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 18 ms returned sat
[2025-05-31 00:51:55] [INFO ] After 126ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 00:51:55] [INFO ] [Nat]Absence check using 35 positive place invariants in 14 ms returned sat
[2025-05-31 00:51:55] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 17 ms returned sat
[2025-05-31 00:51:55] [INFO ] After 114ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 00:51:55] [INFO ] After 143ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 00:51:55] [INFO ] After 274ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 421 ms.
RANDOM walk for 40000 steps (1872 resets) in 214 ms. (186 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (382 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1485741 steps, run timeout after 3001 ms. (steps per millisecond=495 ) properties seen :0 out of 1
Probabilistic random walk after 1485741 steps, saw 190954 distinct states, run finished after 3001 ms. (steps per millisecond=495 ) properties seen :0
// Phase 1: matrix 103 rows 162 cols
[2025-05-31 00:51:58] [INFO ] Computed 62 invariants in 1 ms
[2025-05-31 00:51:58] [INFO ] State equation strengthened by 3 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) 70/71 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 57/128 variables, 34/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/158 variables, 19/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 103/261 variables, 158/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 3/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/265 variables, 4/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/265 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 227 constraints, problems are : Problem set: 0 solved, 1 unsolved in 196 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 162/162 constraints, ReadFeed: 3/3 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) 70/71 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 57/128 variables, 34/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/158 variables, 19/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 103/261 variables, 158/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 3/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 00:51:59] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/261 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4/265 variables, 4/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 00:51:59] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2025-05-31 00:51:59] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2025-05-31 00:51:59] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/265 variables, 3/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/265 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/265 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 232 constraints, problems are : Problem set: 0 solved, 1 unsolved in 488 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 162/162 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 698ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 94 ms.
Support contains 1 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 103/103 transitions.
Graph (complete) has 546 edges and 162 vertex of which 158 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 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 2 place count 158 transition count 102
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 157 transition count 101
Applied a total of 3 rules in 6 ms. Remains 157 /162 variables (removed 5) and now considering 101/103 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 157/162 places, 101/103 transitions.
RANDOM walk for 40000 steps (1959 resets) in 126 ms. (314 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (386 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1603437 steps, run timeout after 3001 ms. (steps per millisecond=534 ) properties seen :0 out of 1
Probabilistic random walk after 1603437 steps, saw 207498 distinct states, run finished after 3001 ms. (steps per millisecond=534 ) properties seen :0
// Phase 1: matrix 101 rows 157 cols
[2025-05-31 00:52:02] [INFO ] Computed 59 invariants in 3 ms
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) 65/66 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 37/103 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/128 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/135 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 86/221 variables, 135/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 14/235 variables, 8/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/235 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/235 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 14/249 variables, 5/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/249 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/249 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 9/258 variables, 9/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/258 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/258 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 216 constraints, problems are : Problem set: 0 solved, 1 unsolved in 207 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 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) 65/66 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/103 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/128 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/135 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 86/221 variables, 135/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/221 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 14/235 variables, 8/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/235 variables, 3/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/235 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 14/249 variables, 5/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/249 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/249 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 9/258 variables, 9/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/258 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/258 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 217 constraints, problems are : Problem set: 0 solved, 1 unsolved in 227 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 451ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 125 ms.
Support contains 1 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 3 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 157/157 places, 101/101 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 2 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2025-05-31 00:52:03] [INFO ] Invariant cache hit.
[2025-05-31 00:52:03] [INFO ] Implicit Places using invariants in 261 ms returned []
[2025-05-31 00:52:03] [INFO ] Invariant cache hit.
[2025-05-31 00:52:03] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 645 ms to find 0 implicit places.
[2025-05-31 00:52:03] [INFO ] Redundant transitions in 0 ms returned []
Running 98 sub problems to find dead transitions.
[2025-05-31 00:52:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 98 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/156 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (OVERLAPS) 101/257 variables, 156/215 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:52:06] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 2 ms to minimize.
[2025-05-31 00:52:06] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 2 ms to minimize.
[2025-05-31 00:52:06] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 3/218 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:52:07] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 1/258 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:52:08] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 2 ms to minimize.
[2025-05-31 00:52:09] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:52:10] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/258 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:52:11] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/258 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:52:12] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/258 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/258 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 16 (OVERLAPS) 0/258 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 225 constraints, problems are : Problem set: 0 solved, 98 unsolved in 11910 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 2/156 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 101/257 variables, 156/224 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 98/322 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (OVERLAPS) 1/258 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:52:27] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2025-05-31 00:52:27] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/258 variables, 2/325 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/258 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 14 (OVERLAPS) 0/258 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 325 constraints, problems are : Problem set: 0 solved, 98 unsolved in 25926 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 11/11 constraints]
After SMT, in 37860ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 37862ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38519 ms. Remains : 157/157 places, 101/101 transitions.
Attempting over-approximation, by ignoring read arcs.
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 157 transition count 101
Applied a total of 1 rules in 6 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 101 rows 157 cols
[2025-05-31 00:52:41] [INFO ] Computed 59 invariants in 1 ms
[2025-05-31 00:52:41] [INFO ] [Real]Absence check using 35 positive place invariants in 7 ms returned sat
[2025-05-31 00:52:41] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 10 ms returned sat
[2025-05-31 00:52:41] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 00:52:41] [INFO ] [Nat]Absence check using 35 positive place invariants in 13 ms returned sat
[2025-05-31 00:52:41] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 16 ms returned sat
[2025-05-31 00:52:41] [INFO ] After 97ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 00:52:41] [INFO ] After 112ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 00:52:41] [INFO ] After 215ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 301 ms.
RANDOM walk for 40000 steps (1824 resets) in 118 ms. (336 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (417 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1428787 steps, run timeout after 3001 ms. (steps per millisecond=476 ) properties seen :0 out of 1
Probabilistic random walk after 1428787 steps, saw 183963 distinct states, run finished after 3001 ms. (steps per millisecond=476 ) properties seen :0
// Phase 1: matrix 103 rows 162 cols
[2025-05-31 00:52:44] [INFO ] Computed 62 invariants in 2 ms
[2025-05-31 00:52:44] [INFO ] State equation strengthened by 3 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) 70/71 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 57/128 variables, 34/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/158 variables, 19/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 103/261 variables, 158/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 3/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 00:52:45] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/265 variables, 4/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/265 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/265 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 228 constraints, problems are : Problem set: 0 solved, 1 unsolved in 224 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 162/162 constraints, ReadFeed: 3/3 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) 70/71 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 57/128 variables, 34/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 00:52:45] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2025-05-31 00:52:45] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 30/158 variables, 19/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 103/261 variables, 158/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 3/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/261 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/261 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/265 variables, 4/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/265 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/265 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 231 constraints, problems are : Problem set: 0 solved, 1 unsolved in 221 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 162/162 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 452ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 75 ms.
Support contains 1 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 103/103 transitions.
Graph (complete) has 546 edges and 162 vertex of which 158 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 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 2 place count 158 transition count 102
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 157 transition count 101
Applied a total of 3 rules in 6 ms. Remains 157 /162 variables (removed 5) and now considering 101/103 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 157/162 places, 101/103 transitions.
RANDOM walk for 40000 steps (1920 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (390 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1463872 steps, run timeout after 3001 ms. (steps per millisecond=487 ) properties seen :0 out of 1
Probabilistic random walk after 1463872 steps, saw 188205 distinct states, run finished after 3001 ms. (steps per millisecond=487 ) properties seen :0
// Phase 1: matrix 101 rows 157 cols
[2025-05-31 00:52:48] [INFO ] Computed 59 invariants in 1 ms
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) 65/66 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 37/103 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/128 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/135 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 86/221 variables, 135/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 14/235 variables, 8/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/235 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/235 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 14/249 variables, 5/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/249 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/249 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 9/258 variables, 9/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/258 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/258 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 216 constraints, problems are : Problem set: 0 solved, 1 unsolved in 224 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 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) 65/66 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/103 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 00:52:48] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 25/128 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/135 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/135 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 86/221 variables, 135/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/221 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/221 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 14/235 variables, 8/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/235 variables, 3/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/235 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 14/249 variables, 5/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/249 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/249 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 9/258 variables, 9/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/258 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/258 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 218 constraints, problems are : Problem set: 0 solved, 1 unsolved in 284 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 541ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 111 ms.
Support contains 1 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 3 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 157/157 places, 101/101 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 3 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2025-05-31 00:52:49] [INFO ] Invariant cache hit.
[2025-05-31 00:52:49] [INFO ] Implicit Places using invariants in 284 ms returned []
[2025-05-31 00:52:49] [INFO ] Invariant cache hit.
[2025-05-31 00:52:49] [INFO ] Implicit Places using invariants and state equation in 370 ms returned []
Implicit Place search using SMT with State Equation took 656 ms to find 0 implicit places.
[2025-05-31 00:52:49] [INFO ] Redundant transitions in 0 ms returned []
Running 98 sub problems to find dead transitions.
[2025-05-31 00:52:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 98 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/156 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (OVERLAPS) 101/257 variables, 156/215 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:52:52] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2025-05-31 00:52:52] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2025-05-31 00:52:52] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 3/218 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:52:53] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 1/258 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:52:54] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 2 ms to minimize.
[2025-05-31 00:52:54] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:52:56] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/258 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:52:57] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/258 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:52:58] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/258 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/258 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 16 (OVERLAPS) 0/258 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 225 constraints, problems are : Problem set: 0 solved, 98 unsolved in 11569 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 2/156 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 101/257 variables, 156/224 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 98/322 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (OVERLAPS) 1/258 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:53:14] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2025-05-31 00:53:15] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/258 variables, 2/325 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/258 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 14 (OVERLAPS) 0/258 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 325 constraints, problems are : Problem set: 0 solved, 98 unsolved in 27709 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 11/11 constraints]
After SMT, in 39312ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 39314ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39980 ms. Remains : 157/157 places, 101/101 transitions.
Attempting over-approximation, by ignoring read arcs.
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 157 transition count 101
Applied a total of 1 rules in 5 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 101 rows 157 cols
[2025-05-31 00:53:29] [INFO ] Computed 59 invariants in 2 ms
[2025-05-31 00:53:29] [INFO ] [Real]Absence check using 35 positive place invariants in 11 ms returned sat
[2025-05-31 00:53:29] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 15 ms returned sat
[2025-05-31 00:53:29] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 00:53:29] [INFO ] [Nat]Absence check using 35 positive place invariants in 13 ms returned sat
[2025-05-31 00:53:29] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 17 ms returned sat
[2025-05-31 00:53:29] [INFO ] After 90ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 00:53:29] [INFO ] After 105ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 00:53:29] [INFO ] After 210ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 328 ms.
RANDOM walk for 40000 steps (1884 resets) in 117 ms. (338 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (367 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1286281 steps, run timeout after 3001 ms. (steps per millisecond=428 ) properties seen :0 out of 1
Probabilistic random walk after 1286281 steps, saw 166071 distinct states, run finished after 3001 ms. (steps per millisecond=428 ) properties seen :0
// Phase 1: matrix 103 rows 162 cols
[2025-05-31 00:53:32] [INFO ] Computed 62 invariants in 3 ms
[2025-05-31 00:53:32] [INFO ] State equation strengthened by 3 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) 70/71 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 57/128 variables, 34/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 00:53:32] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 2 ms to minimize.
[2025-05-31 00:53:32] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 30/158 variables, 19/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 103/261 variables, 158/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 3/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/265 variables, 4/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/265 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/265 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 229 constraints, problems are : Problem set: 0 solved, 1 unsolved in 350 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 162/162 constraints, ReadFeed: 3/3 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) 70/71 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 57/128 variables, 34/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 30/158 variables, 19/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 103/261 variables, 158/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 3/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/261 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4/265 variables, 4/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/265 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/265 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 230 constraints, problems are : Problem set: 0 solved, 1 unsolved in 234 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 162/162 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 591ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 110 ms.
Support contains 1 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 103/103 transitions.
Graph (complete) has 546 edges and 162 vertex of which 158 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 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 2 place count 158 transition count 102
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 157 transition count 101
Applied a total of 3 rules in 10 ms. Remains 157 /162 variables (removed 5) and now considering 101/103 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 157/162 places, 101/103 transitions.
RANDOM walk for 40000 steps (1932 resets) in 149 ms. (266 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (404 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1205551 steps, run timeout after 3001 ms. (steps per millisecond=401 ) properties seen :0 out of 1
Probabilistic random walk after 1205551 steps, saw 155348 distinct states, run finished after 3001 ms. (steps per millisecond=401 ) properties seen :0
// Phase 1: matrix 101 rows 157 cols
[2025-05-31 00:53:36] [INFO ] Computed 59 invariants in 2 ms
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) 65/66 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 37/103 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/128 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/135 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 86/221 variables, 135/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 14/235 variables, 8/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/235 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/235 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 14/249 variables, 5/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/249 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/249 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 9/258 variables, 9/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/258 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/258 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 216 constraints, problems are : Problem set: 0 solved, 1 unsolved in 178 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 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) 65/66 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/103 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 00:53:36] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 25/128 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/135 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/135 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 86/221 variables, 135/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/221 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/221 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 14/235 variables, 8/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/235 variables, 3/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/235 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 14/249 variables, 5/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/249 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/249 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 9/258 variables, 9/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 00:53:36] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/258 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/258 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/258 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 219 constraints, problems are : Problem set: 0 solved, 1 unsolved in 339 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 531ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 97 ms.
Support contains 1 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 3 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 157/157 places, 101/101 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 3 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2025-05-31 00:53:36] [INFO ] Invariant cache hit.
[2025-05-31 00:53:37] [INFO ] Implicit Places using invariants in 214 ms returned []
[2025-05-31 00:53:37] [INFO ] Invariant cache hit.
[2025-05-31 00:53:37] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 624 ms to find 0 implicit places.
[2025-05-31 00:53:37] [INFO ] Redundant transitions in 0 ms returned []
Running 98 sub problems to find dead transitions.
[2025-05-31 00:53:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 98 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/156 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (OVERLAPS) 101/257 variables, 156/215 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:53:39] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 2 ms to minimize.
[2025-05-31 00:53:40] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 2 ms to minimize.
[2025-05-31 00:53:40] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 3/218 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:53:40] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 1/258 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:53:42] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 2 ms to minimize.
[2025-05-31 00:53:42] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:53:44] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/258 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:53:45] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/258 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:53:46] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/258 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/258 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 16 (OVERLAPS) 0/258 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 225 constraints, problems are : Problem set: 0 solved, 98 unsolved in 12210 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 2/156 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 101/257 variables, 156/224 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 98/322 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (OVERLAPS) 1/258 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:54:03] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2025-05-31 00:54:03] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 4 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/258 variables, 2/325 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/258 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 14 (OVERLAPS) 0/258 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 325 constraints, problems are : Problem set: 0 solved, 98 unsolved in 28563 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 11/11 constraints]
After SMT, in 40811ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 40813ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41453 ms. Remains : 157/157 places, 101/101 transitions.
Attempting over-approximation, by ignoring read arcs.
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 157 transition count 101
Applied a total of 1 rules in 4 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 101 rows 157 cols
[2025-05-31 00:54:18] [INFO ] Computed 59 invariants in 1 ms
[2025-05-31 00:54:18] [INFO ] [Real]Absence check using 35 positive place invariants in 9 ms returned sat
[2025-05-31 00:54:18] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 12 ms returned sat
[2025-05-31 00:54:18] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 00:54:18] [INFO ] [Nat]Absence check using 35 positive place invariants in 9 ms returned sat
[2025-05-31 00:54:18] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 11 ms returned sat
[2025-05-31 00:54:18] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 00:54:18] [INFO ] After 86ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 00:54:18] [INFO ] After 157ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 245 ms.
RANDOM walk for 40000 steps (1875 resets) in 104 ms. (380 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (368 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1359903 steps, run timeout after 3001 ms. (steps per millisecond=453 ) properties seen :0 out of 1
Probabilistic random walk after 1359903 steps, saw 175094 distinct states, run finished after 3001 ms. (steps per millisecond=453 ) properties seen :0
// Phase 1: matrix 103 rows 162 cols
[2025-05-31 00:54:21] [INFO ] Computed 62 invariants in 2 ms
[2025-05-31 00:54:21] [INFO ] State equation strengthened by 3 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) 70/71 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 57/128 variables, 34/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/158 variables, 19/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 103/261 variables, 158/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 3/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/265 variables, 4/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/265 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 227 constraints, problems are : Problem set: 0 solved, 1 unsolved in 139 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 162/162 constraints, ReadFeed: 3/3 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) 70/71 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 57/128 variables, 34/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 00:54:21] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2025-05-31 00:54:21] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 30/158 variables, 19/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 103/261 variables, 158/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 3/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 00:54:22] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/261 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/261 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/265 variables, 4/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/265 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/265 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 231 constraints, problems are : Problem set: 0 solved, 1 unsolved in 304 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 162/162 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 454ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 91 ms.
Support contains 1 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 103/103 transitions.
Graph (complete) has 546 edges and 162 vertex of which 158 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 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 2 place count 158 transition count 102
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 157 transition count 101
Applied a total of 3 rules in 9 ms. Remains 157 /162 variables (removed 5) and now considering 101/103 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 157/162 places, 101/103 transitions.
RANDOM walk for 40000 steps (1948 resets) in 183 ms. (217 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (378 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1311844 steps, run timeout after 3001 ms. (steps per millisecond=437 ) properties seen :0 out of 1
Probabilistic random walk after 1311844 steps, saw 169224 distinct states, run finished after 3004 ms. (steps per millisecond=436 ) properties seen :0
// Phase 1: matrix 101 rows 157 cols
[2025-05-31 00:54:25] [INFO ] Computed 59 invariants in 2 ms
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) 65/66 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 37/103 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/128 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/135 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 86/221 variables, 135/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 14/235 variables, 8/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/235 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/235 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 14/249 variables, 5/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/249 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/249 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 9/258 variables, 9/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/258 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/258 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 216 constraints, problems are : Problem set: 0 solved, 1 unsolved in 214 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 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) 65/66 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/103 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 00:54:25] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 25/128 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/135 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/135 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 86/221 variables, 135/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/221 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/221 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 14/235 variables, 8/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/235 variables, 3/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/235 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 14/249 variables, 5/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/249 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/249 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 9/258 variables, 9/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/258 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/258 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 218 constraints, problems are : Problem set: 0 solved, 1 unsolved in 292 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 513ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 70 ms.
Support contains 1 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 4 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 157/157 places, 101/101 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 2 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2025-05-31 00:54:25] [INFO ] Invariant cache hit.
[2025-05-31 00:54:26] [INFO ] Implicit Places using invariants in 288 ms returned []
[2025-05-31 00:54:26] [INFO ] Invariant cache hit.
[2025-05-31 00:54:26] [INFO ] Implicit Places using invariants and state equation in 399 ms returned []
Implicit Place search using SMT with State Equation took 690 ms to find 0 implicit places.
[2025-05-31 00:54:26] [INFO ] Redundant transitions in 1 ms returned []
Running 98 sub problems to find dead transitions.
[2025-05-31 00:54:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 98 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/156 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (OVERLAPS) 101/257 variables, 156/215 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:54:28] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 2 ms to minimize.
[2025-05-31 00:54:29] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 2 ms to minimize.
[2025-05-31 00:54:29] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 3/218 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:54:30] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 1/258 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:54:31] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 2 ms to minimize.
[2025-05-31 00:54:32] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:54:34] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/258 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:54:35] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/258 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:54:36] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/258 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/258 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 16 (OVERLAPS) 0/258 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 225 constraints, problems are : Problem set: 0 solved, 98 unsolved in 12588 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 2/156 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 101/257 variables, 156/224 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 98/322 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (OVERLAPS) 1/258 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:54:51] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2025-05-31 00:54:51] [INFO ] Deduced a trap composed of 17 places in 127 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/258 variables, 2/325 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/258 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 14 (OVERLAPS) 0/258 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 325 constraints, problems are : Problem set: 0 solved, 98 unsolved in 27457 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 11/11 constraints]
After SMT, in 40076ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 40078ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40779 ms. Remains : 157/157 places, 101/101 transitions.
Attempting over-approximation, by ignoring read arcs.
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 157 transition count 101
Applied a total of 1 rules in 4 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 101 rows 157 cols
[2025-05-31 00:55:06] [INFO ] Computed 59 invariants in 2 ms
[2025-05-31 00:55:06] [INFO ] [Real]Absence check using 35 positive place invariants in 10 ms returned sat
[2025-05-31 00:55:06] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 57 ms returned sat
[2025-05-31 00:55:06] [INFO ] After 158ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 00:55:06] [INFO ] [Nat]Absence check using 35 positive place invariants in 10 ms returned sat
[2025-05-31 00:55:06] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 13 ms returned sat
[2025-05-31 00:55:07] [INFO ] After 114ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 00:55:07] [INFO ] After 126ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 00:55:07] [INFO ] After 205ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 374 ms.
RANDOM walk for 40000 steps (1865 resets) in 213 ms. (186 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (369 resets) in 92 ms. (430 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1506021 steps, run timeout after 3001 ms. (steps per millisecond=501 ) properties seen :0 out of 1
Probabilistic random walk after 1506021 steps, saw 193291 distinct states, run finished after 3001 ms. (steps per millisecond=501 ) properties seen :0
// Phase 1: matrix 103 rows 162 cols
[2025-05-31 00:55:10] [INFO ] Computed 62 invariants in 3 ms
[2025-05-31 00:55:10] [INFO ] State equation strengthened by 3 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) 70/71 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 57/128 variables, 34/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/158 variables, 19/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 103/261 variables, 158/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 3/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/265 variables, 4/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/265 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 227 constraints, problems are : Problem set: 0 solved, 1 unsolved in 219 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 162/162 constraints, ReadFeed: 3/3 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) 70/71 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 57/128 variables, 34/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 00:55:10] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2025-05-31 00:55:10] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 30/158 variables, 19/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 103/261 variables, 158/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 3/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/261 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4/265 variables, 4/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/265 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/265 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 230 constraints, problems are : Problem set: 0 solved, 1 unsolved in 349 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 162/162 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 575ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 75 ms.
Support contains 1 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 103/103 transitions.
Graph (complete) has 546 edges and 162 vertex of which 158 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 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 2 place count 158 transition count 102
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 157 transition count 101
Applied a total of 3 rules in 11 ms. Remains 157 /162 variables (removed 5) and now considering 101/103 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 157/162 places, 101/103 transitions.
RANDOM walk for 40000 steps (1949 resets) in 146 ms. (272 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (372 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1438755 steps, run timeout after 3001 ms. (steps per millisecond=479 ) properties seen :0 out of 1
Probabilistic random walk after 1438755 steps, saw 185254 distinct states, run finished after 3001 ms. (steps per millisecond=479 ) properties seen :0
// Phase 1: matrix 101 rows 157 cols
[2025-05-31 00:55:13] [INFO ] Computed 59 invariants in 3 ms
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) 65/66 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 37/103 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/128 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/135 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 86/221 variables, 135/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 14/235 variables, 8/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/235 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/235 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 14/249 variables, 5/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/249 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/249 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 9/258 variables, 9/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/258 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/258 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 216 constraints, problems are : Problem set: 0 solved, 1 unsolved in 213 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 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) 65/66 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/103 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 00:55:14] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 25/128 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/135 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/135 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 86/221 variables, 135/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/221 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/221 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 14/235 variables, 8/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/235 variables, 3/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/235 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 14/249 variables, 5/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/249 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/249 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 9/258 variables, 9/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/258 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/258 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 218 constraints, problems are : Problem set: 0 solved, 1 unsolved in 282 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 508ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 54 ms.
Support contains 1 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 3 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 157/157 places, 101/101 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 3 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2025-05-31 00:55:14] [INFO ] Invariant cache hit.
[2025-05-31 00:55:14] [INFO ] Implicit Places using invariants in 306 ms returned []
[2025-05-31 00:55:14] [INFO ] Invariant cache hit.
[2025-05-31 00:55:15] [INFO ] Implicit Places using invariants and state equation in 424 ms returned []
Implicit Place search using SMT with State Equation took 732 ms to find 0 implicit places.
[2025-05-31 00:55:15] [INFO ] Redundant transitions in 0 ms returned []
Running 98 sub problems to find dead transitions.
[2025-05-31 00:55:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 98 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/156 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (OVERLAPS) 101/257 variables, 156/215 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:55:17] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 2 ms to minimize.
[2025-05-31 00:55:18] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 2 ms to minimize.
[2025-05-31 00:55:18] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 3/218 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:55:19] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 1/258 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:55:20] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 2 ms to minimize.
[2025-05-31 00:55:20] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:55:22] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/258 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:55:23] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/258 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:55:24] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/258 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/258 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 16 (OVERLAPS) 0/258 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 225 constraints, problems are : Problem set: 0 solved, 98 unsolved in 12560 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 2/156 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 101/257 variables, 156/224 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 98/322 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (OVERLAPS) 1/258 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:55:39] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2025-05-31 00:55:39] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/258 variables, 2/325 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/258 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 14 (OVERLAPS) 0/258 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 325 constraints, problems are : Problem set: 0 solved, 98 unsolved in 25825 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 11/11 constraints]
After SMT, in 38413ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 38415ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39157 ms. Remains : 157/157 places, 101/101 transitions.
Attempting over-approximation, by ignoring read arcs.
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 157 transition count 101
Applied a total of 1 rules in 4 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 101 rows 157 cols
[2025-05-31 00:55:53] [INFO ] Computed 59 invariants in 1 ms
[2025-05-31 00:55:53] [INFO ] [Real]Absence check using 35 positive place invariants in 10 ms returned sat
[2025-05-31 00:55:53] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 12 ms returned sat
[2025-05-31 00:55:53] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 00:55:53] [INFO ] [Nat]Absence check using 35 positive place invariants in 14 ms returned sat
[2025-05-31 00:55:53] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 13 ms returned sat
[2025-05-31 00:55:53] [INFO ] After 71ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 00:55:53] [INFO ] After 85ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 00:55:53] [INFO ] After 167ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 246 ms.
RANDOM walk for 40000 steps (1858 resets) in 100 ms. (396 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (399 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1390888 steps, run timeout after 3001 ms. (steps per millisecond=463 ) properties seen :0 out of 1
Probabilistic random walk after 1390888 steps, saw 179324 distinct states, run finished after 3001 ms. (steps per millisecond=463 ) properties seen :0
// Phase 1: matrix 103 rows 162 cols
[2025-05-31 00:55:56] [INFO ] Computed 62 invariants in 7 ms
[2025-05-31 00:55:56] [INFO ] State equation strengthened by 3 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) 70/71 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 57/128 variables, 34/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/158 variables, 19/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 103/261 variables, 158/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 3/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/265 variables, 4/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/265 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 227 constraints, problems are : Problem set: 0 solved, 1 unsolved in 238 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 162/162 constraints, ReadFeed: 3/3 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) 70/71 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 57/128 variables, 34/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/158 variables, 19/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 103/261 variables, 158/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 3/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/265 variables, 4/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/265 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/265 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 228 constraints, problems are : Problem set: 0 solved, 1 unsolved in 240 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 162/162 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 508ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 162 ms.
Support contains 1 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 103/103 transitions.
Graph (complete) has 546 edges and 162 vertex of which 158 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 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 2 place count 158 transition count 102
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 157 transition count 101
Applied a total of 3 rules in 10 ms. Remains 157 /162 variables (removed 5) and now considering 101/103 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 157/162 places, 101/103 transitions.
RANDOM walk for 40000 steps (1922 resets) in 183 ms. (217 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (367 resets) in 84 ms. (470 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1315430 steps, run timeout after 3001 ms. (steps per millisecond=438 ) properties seen :0 out of 1
Probabilistic random walk after 1315430 steps, saw 169669 distinct states, run finished after 3006 ms. (steps per millisecond=437 ) properties seen :0
// Phase 1: matrix 101 rows 157 cols
[2025-05-31 00:56:00] [INFO ] Computed 59 invariants in 1 ms
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) 65/66 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 37/103 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/128 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/135 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 86/221 variables, 135/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 14/235 variables, 8/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/235 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/235 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 14/249 variables, 5/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/249 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/249 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 9/258 variables, 9/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/258 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/258 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 216 constraints, problems are : Problem set: 0 solved, 1 unsolved in 195 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 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) 65/66 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/103 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/128 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/135 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 86/221 variables, 135/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/221 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 14/235 variables, 8/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/235 variables, 3/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/235 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 14/249 variables, 5/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/249 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/249 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 9/258 variables, 9/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/258 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/258 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 217 constraints, problems are : Problem set: 0 solved, 1 unsolved in 233 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 435ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 141 ms.
Support contains 1 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 4 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 157/157 places, 101/101 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 3 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2025-05-31 00:56:01] [INFO ] Invariant cache hit.
[2025-05-31 00:56:01] [INFO ] Implicit Places using invariants in 305 ms returned []
[2025-05-31 00:56:01] [INFO ] Invariant cache hit.
[2025-05-31 00:56:02] [INFO ] Implicit Places using invariants and state equation in 410 ms returned []
Implicit Place search using SMT with State Equation took 718 ms to find 0 implicit places.
[2025-05-31 00:56:02] [INFO ] Redundant transitions in 0 ms returned []
Running 98 sub problems to find dead transitions.
[2025-05-31 00:56:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 98 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/156 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (OVERLAPS) 101/257 variables, 156/215 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:56:04] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 2 ms to minimize.
[2025-05-31 00:56:04] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 2 ms to minimize.
[2025-05-31 00:56:05] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 3/218 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:56:06] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 1/258 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:56:07] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 2 ms to minimize.
[2025-05-31 00:56:07] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:56:10] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/258 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:56:11] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/258 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:56:12] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/258 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/258 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 16 (OVERLAPS) 0/258 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 225 constraints, problems are : Problem set: 0 solved, 98 unsolved in 13209 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 2/156 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 101/257 variables, 156/224 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 98/322 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (OVERLAPS) 1/258 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:56:27] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2025-05-31 00:56:28] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/258 variables, 2/325 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/258 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 14 (OVERLAPS) 0/258 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 325 constraints, problems are : Problem set: 0 solved, 98 unsolved in 27948 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 11/11 constraints]
After SMT, in 41190ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 41192ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41920 ms. Remains : 157/157 places, 101/101 transitions.
Attempting over-approximation, by ignoring read arcs.
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 157 transition count 101
Applied a total of 1 rules in 5 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 101 rows 157 cols
[2025-05-31 00:56:43] [INFO ] Computed 59 invariants in 2 ms
[2025-05-31 00:56:43] [INFO ] [Real]Absence check using 35 positive place invariants in 9 ms returned sat
[2025-05-31 00:56:43] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 12 ms returned sat
[2025-05-31 00:56:43] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 00:56:43] [INFO ] [Nat]Absence check using 35 positive place invariants in 9 ms returned sat
[2025-05-31 00:56:43] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 16 ms returned sat
[2025-05-31 00:56:43] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 00:56:43] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2025-05-31 00:56:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
TRAPS : Iteration 1
[2025-05-31 00:56:43] [INFO ] After 126ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 00:56:43] [INFO ] After 207ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 283 ms.
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (1849 resets) in 141 ms. (281 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (392 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1416394 steps, run timeout after 3001 ms. (steps per millisecond=471 ) properties seen :0 out of 1
Probabilistic random walk after 1416394 steps, saw 182449 distinct states, run finished after 3001 ms. (steps per millisecond=471 ) properties seen :0
// Phase 1: matrix 103 rows 162 cols
[2025-05-31 00:56:46] [INFO ] Computed 62 invariants in 1 ms
[2025-05-31 00:56:46] [INFO ] State equation strengthened by 3 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) 70/71 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 57/128 variables, 34/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/158 variables, 19/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 103/261 variables, 158/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 3/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/265 variables, 4/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/265 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 227 constraints, problems are : Problem set: 0 solved, 1 unsolved in 136 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 162/162 constraints, ReadFeed: 3/3 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) 70/71 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 57/128 variables, 34/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/158 variables, 19/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 103/261 variables, 158/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 3/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/265 variables, 4/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/265 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/265 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 228 constraints, problems are : Problem set: 0 solved, 1 unsolved in 144 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 162/162 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 283ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 83 ms.
Support contains 1 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 103/103 transitions.
Graph (complete) has 546 edges and 162 vertex of which 158 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 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 2 place count 158 transition count 102
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 157 transition count 101
Applied a total of 3 rules in 6 ms. Remains 157 /162 variables (removed 5) and now considering 101/103 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 157/162 places, 101/103 transitions.
RANDOM walk for 40000 steps (1938 resets) in 120 ms. (330 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (404 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1506991 steps, run timeout after 3001 ms. (steps per millisecond=502 ) properties seen :0 out of 1
Probabilistic random walk after 1506991 steps, saw 193391 distinct states, run finished after 3001 ms. (steps per millisecond=502 ) properties seen :0
// Phase 1: matrix 101 rows 157 cols
[2025-05-31 00:56:50] [INFO ] Computed 59 invariants in 1 ms
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) 65/66 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 37/103 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/128 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/135 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 86/221 variables, 135/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 14/235 variables, 8/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/235 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/235 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 14/249 variables, 5/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/249 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/249 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 9/258 variables, 9/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/258 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/258 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 216 constraints, problems are : Problem set: 0 solved, 1 unsolved in 148 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 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) 65/66 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/103 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/128 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/135 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 86/221 variables, 135/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/221 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 14/235 variables, 8/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/235 variables, 3/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/235 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 14/249 variables, 5/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/249 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/249 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 9/258 variables, 9/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 00:56:50] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/258 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/258 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/258 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 218 constraints, problems are : Problem set: 0 solved, 1 unsolved in 191 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 343ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 73 ms.
Support contains 1 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 2 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 157/157 places, 101/101 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 2 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2025-05-31 00:56:50] [INFO ] Invariant cache hit.
[2025-05-31 00:56:50] [INFO ] Implicit Places using invariants in 170 ms returned []
[2025-05-31 00:56:50] [INFO ] Invariant cache hit.
[2025-05-31 00:56:50] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
[2025-05-31 00:56:50] [INFO ] Redundant transitions in 1 ms returned []
Running 98 sub problems to find dead transitions.
[2025-05-31 00:56:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 98 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/156 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (OVERLAPS) 101/257 variables, 156/215 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:56:53] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 2 ms to minimize.
[2025-05-31 00:56:53] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2025-05-31 00:56:53] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 3/218 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:56:54] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 1/258 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:56:56] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 2 ms to minimize.
[2025-05-31 00:56:56] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:56:58] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/258 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:56:59] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/258 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:57:00] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/258 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/258 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 16 (OVERLAPS) 0/258 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 225 constraints, problems are : Problem set: 0 solved, 98 unsolved in 13120 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 2/156 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 101/257 variables, 156/224 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 98/322 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (OVERLAPS) 1/258 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:57:15] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2025-05-31 00:57:15] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/258 variables, 2/325 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/258 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 14 (OVERLAPS) 0/258 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 325 constraints, problems are : Problem set: 0 solved, 98 unsolved in 23956 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 11/11 constraints]
After SMT, in 37107ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 37108ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37635 ms. Remains : 157/157 places, 101/101 transitions.
Attempting over-approximation, by ignoring read arcs.
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 157 transition count 101
Applied a total of 1 rules in 4 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 101 rows 157 cols
[2025-05-31 00:57:28] [INFO ] Computed 59 invariants in 2 ms
[2025-05-31 00:57:28] [INFO ] [Real]Absence check using 35 positive place invariants in 37 ms returned sat
[2025-05-31 00:57:28] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 36 ms returned sat
[2025-05-31 00:57:28] [INFO ] After 158ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 00:57:28] [INFO ] [Nat]Absence check using 35 positive place invariants in 14 ms returned sat
[2025-05-31 00:57:28] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 16 ms returned sat
[2025-05-31 00:57:28] [INFO ] After 113ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 00:57:28] [INFO ] After 129ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 00:57:28] [INFO ] After 251ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 420 ms.
RANDOM walk for 40000 steps (1853 resets) in 119 ms. (333 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (386 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1408958 steps, run timeout after 3001 ms. (steps per millisecond=469 ) properties seen :0 out of 1
Probabilistic random walk after 1408958 steps, saw 181574 distinct states, run finished after 3001 ms. (steps per millisecond=469 ) properties seen :0
// Phase 1: matrix 103 rows 162 cols
[2025-05-31 00:57:31] [INFO ] Computed 62 invariants in 1 ms
[2025-05-31 00:57:31] [INFO ] State equation strengthened by 3 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) 70/71 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 57/128 variables, 34/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/158 variables, 19/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 103/261 variables, 158/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 3/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/265 variables, 4/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/265 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 227 constraints, problems are : Problem set: 0 solved, 1 unsolved in 147 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 162/162 constraints, ReadFeed: 3/3 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) 70/71 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 57/128 variables, 34/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 00:57:31] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 30/158 variables, 19/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 103/261 variables, 158/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 3/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/261 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4/265 variables, 4/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/265 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/265 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 229 constraints, problems are : Problem set: 0 solved, 1 unsolved in 181 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 162/162 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 347ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 71 ms.
Support contains 1 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 103/103 transitions.
Graph (complete) has 546 edges and 162 vertex of which 158 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 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 2 place count 158 transition count 102
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 157 transition count 101
Applied a total of 3 rules in 6 ms. Remains 157 /162 variables (removed 5) and now considering 101/103 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 157/162 places, 101/103 transitions.
RANDOM walk for 40000 steps (1935 resets) in 109 ms. (363 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (376 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1548433 steps, run timeout after 3001 ms. (steps per millisecond=515 ) properties seen :0 out of 1
Probabilistic random walk after 1548433 steps, saw 199814 distinct states, run finished after 3005 ms. (steps per millisecond=515 ) properties seen :0
// Phase 1: matrix 101 rows 157 cols
[2025-05-31 00:57:35] [INFO ] Computed 59 invariants in 2 ms
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) 65/66 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 37/103 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/128 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/135 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 86/221 variables, 135/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 14/235 variables, 8/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/235 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/235 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 14/249 variables, 5/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/249 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/249 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 9/258 variables, 9/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/258 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/258 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 216 constraints, problems are : Problem set: 0 solved, 1 unsolved in 199 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 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) 65/66 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/103 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/128 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/135 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 86/221 variables, 135/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/221 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 14/235 variables, 8/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/235 variables, 3/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/235 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 14/249 variables, 5/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/249 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/249 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 9/258 variables, 9/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/258 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/258 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 217 constraints, problems are : Problem set: 0 solved, 1 unsolved in 241 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 447ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 104 ms.
Support contains 1 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 3 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 157/157 places, 101/101 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 3 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2025-05-31 00:57:35] [INFO ] Invariant cache hit.
[2025-05-31 00:57:35] [INFO ] Implicit Places using invariants in 253 ms returned []
[2025-05-31 00:57:35] [INFO ] Invariant cache hit.
[2025-05-31 00:57:36] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 636 ms to find 0 implicit places.
[2025-05-31 00:57:36] [INFO ] Redundant transitions in 0 ms returned []
Running 98 sub problems to find dead transitions.
[2025-05-31 00:57:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 98 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/156 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (OVERLAPS) 101/257 variables, 156/215 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:57:38] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 3 ms to minimize.
[2025-05-31 00:57:39] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2025-05-31 00:57:39] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 3/218 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:57:39] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 1/258 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:57:40] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2025-05-31 00:57:40] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:57:42] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/258 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:57:42] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/258 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:57:43] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/258 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/258 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 16 (OVERLAPS) 0/258 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 225 constraints, problems are : Problem set: 0 solved, 98 unsolved in 9962 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 2/156 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 101/257 variables, 156/224 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 98/322 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (OVERLAPS) 1/258 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:57:58] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 9 ms to minimize.
[2025-05-31 00:57:58] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/258 variables, 2/325 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/258 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 14 (OVERLAPS) 0/258 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 325 constraints, problems are : Problem set: 0 solved, 98 unsolved in 26365 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 11/11 constraints]
After SMT, in 36353ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 36355ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37002 ms. Remains : 157/157 places, 101/101 transitions.
Attempting over-approximation, by ignoring read arcs.
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 157 transition count 101
Applied a total of 1 rules in 3 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 101 rows 157 cols
[2025-05-31 00:58:12] [INFO ] Computed 59 invariants in 2 ms
[2025-05-31 00:58:12] [INFO ] [Real]Absence check using 35 positive place invariants in 9 ms returned sat
[2025-05-31 00:58:12] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 11 ms returned sat
[2025-05-31 00:58:12] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 00:58:12] [INFO ] [Nat]Absence check using 35 positive place invariants in 10 ms returned sat
[2025-05-31 00:58:12] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 12 ms returned sat
[2025-05-31 00:58:12] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 00:58:12] [INFO ] After 85ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 00:58:12] [INFO ] After 158ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 229 ms.
RANDOM walk for 40000 steps (1814 resets) in 112 ms. (353 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (384 resets) in 58 ms. (678 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1516195 steps, run timeout after 3001 ms. (steps per millisecond=505 ) properties seen :0 out of 1
Probabilistic random walk after 1516195 steps, saw 194384 distinct states, run finished after 3004 ms. (steps per millisecond=504 ) properties seen :0
// Phase 1: matrix 103 rows 162 cols
[2025-05-31 00:58:15] [INFO ] Computed 62 invariants in 1 ms
[2025-05-31 00:58:15] [INFO ] State equation strengthened by 3 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) 70/71 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 57/128 variables, 34/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/158 variables, 19/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 103/261 variables, 158/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 3/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/265 variables, 4/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/265 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 227 constraints, problems are : Problem set: 0 solved, 1 unsolved in 140 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 162/162 constraints, ReadFeed: 3/3 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) 70/71 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 57/128 variables, 34/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 00:58:16] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 30/158 variables, 19/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 103/261 variables, 158/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 3/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/261 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4/265 variables, 4/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/265 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/265 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 229 constraints, problems are : Problem set: 0 solved, 1 unsolved in 289 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 162/162 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 436ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 101 ms.
Support contains 1 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 103/103 transitions.
Graph (complete) has 546 edges and 162 vertex of which 158 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 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 2 place count 158 transition count 102
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 157 transition count 101
Applied a total of 3 rules in 10 ms. Remains 157 /162 variables (removed 5) and now considering 101/103 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 157/162 places, 101/103 transitions.
RANDOM walk for 40000 steps (1925 resets) in 140 ms. (283 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (384 resets) in 72 ms. (547 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1435728 steps, run timeout after 3001 ms. (steps per millisecond=478 ) properties seen :0 out of 1
Probabilistic random walk after 1435728 steps, saw 184854 distinct states, run finished after 3001 ms. (steps per millisecond=478 ) properties seen :0
// Phase 1: matrix 101 rows 157 cols
[2025-05-31 00:58:19] [INFO ] Computed 59 invariants in 1 ms
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) 65/66 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 37/103 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/128 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/135 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 86/221 variables, 135/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 14/235 variables, 8/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/235 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/235 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 14/249 variables, 5/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/249 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/249 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 9/258 variables, 9/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/258 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/258 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 216 constraints, problems are : Problem set: 0 solved, 1 unsolved in 147 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 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) 65/66 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/103 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 00:58:19] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 25/128 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/135 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/135 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 86/221 variables, 135/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/221 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/221 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 14/235 variables, 8/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/235 variables, 3/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/235 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 14/249 variables, 5/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/249 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/249 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 9/258 variables, 9/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/258 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/258 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 218 constraints, problems are : Problem set: 0 solved, 1 unsolved in 194 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 346ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 50 ms.
Support contains 1 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 2 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 157/157 places, 101/101 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 1 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2025-05-31 00:58:19] [INFO ] Invariant cache hit.
[2025-05-31 00:58:20] [INFO ] Implicit Places using invariants in 161 ms returned []
[2025-05-31 00:58:20] [INFO ] Invariant cache hit.
[2025-05-31 00:58:20] [INFO ] Implicit Places using invariants and state equation in 383 ms returned []
Implicit Place search using SMT with State Equation took 545 ms to find 0 implicit places.
[2025-05-31 00:58:20] [INFO ] Redundant transitions in 0 ms returned []
Running 98 sub problems to find dead transitions.
[2025-05-31 00:58:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 98 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/156 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (OVERLAPS) 101/257 variables, 156/215 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:58:22] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 2 ms to minimize.
[2025-05-31 00:58:23] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 2 ms to minimize.
[2025-05-31 00:58:23] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 3/218 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:58:24] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 1/258 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:58:25] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 2 ms to minimize.
[2025-05-31 00:58:26] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:58:28] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/258 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:58:29] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/258 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:58:30] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/258 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/258 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 16 (OVERLAPS) 0/258 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 225 constraints, problems are : Problem set: 0 solved, 98 unsolved in 12081 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 2/156 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 101/257 variables, 156/224 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 98/322 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (OVERLAPS) 1/258 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:58:46] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2025-05-31 00:58:46] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/258 variables, 2/325 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/258 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 14 (OVERLAPS) 0/258 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 325 constraints, problems are : Problem set: 0 solved, 98 unsolved in 29648 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 11/11 constraints]
After SMT, in 41762ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 41764ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42319 ms. Remains : 157/157 places, 101/101 transitions.
Attempting over-approximation, by ignoring read arcs.
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 157 transition count 101
Applied a total of 1 rules in 5 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 101 rows 157 cols
[2025-05-31 00:59:02] [INFO ] Computed 59 invariants in 3 ms
[2025-05-31 00:59:02] [INFO ] [Real]Absence check using 35 positive place invariants in 14 ms returned sat
[2025-05-31 00:59:02] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 18 ms returned sat
[2025-05-31 00:59:02] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 00:59:02] [INFO ] [Nat]Absence check using 35 positive place invariants in 14 ms returned sat
[2025-05-31 00:59:02] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 17 ms returned sat
[2025-05-31 00:59:02] [INFO ] After 100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 00:59:02] [INFO ] After 115ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 00:59:02] [INFO ] After 221ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 337 ms.
RANDOM walk for 40000 steps (1819 resets) in 165 ms. (240 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (389 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1573963 steps, run timeout after 3001 ms. (steps per millisecond=524 ) properties seen :0 out of 1
Probabilistic random walk after 1573963 steps, saw 203364 distinct states, run finished after 3001 ms. (steps per millisecond=524 ) properties seen :0
// Phase 1: matrix 103 rows 162 cols
[2025-05-31 00:59:05] [INFO ] Computed 62 invariants in 2 ms
[2025-05-31 00:59:05] [INFO ] State equation strengthened by 3 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) 70/71 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 57/128 variables, 34/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/158 variables, 19/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 103/261 variables, 158/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 3/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/265 variables, 4/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/265 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 227 constraints, problems are : Problem set: 0 solved, 1 unsolved in 195 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 162/162 constraints, ReadFeed: 3/3 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) 70/71 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 57/128 variables, 34/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 00:59:05] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 30/158 variables, 19/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 103/261 variables, 158/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 3/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/261 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4/265 variables, 4/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/265 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/265 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 229 constraints, problems are : Problem set: 0 solved, 1 unsolved in 276 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 162/162 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 485ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 73 ms.
Support contains 1 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 103/103 transitions.
Graph (complete) has 546 edges and 162 vertex of which 158 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 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 2 place count 158 transition count 102
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 157 transition count 101
Applied a total of 3 rules in 8 ms. Remains 157 /162 variables (removed 5) and now considering 101/103 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 157/162 places, 101/103 transitions.
RANDOM walk for 40000 steps (1944 resets) in 137 ms. (289 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (398 resets) in 71 ms. (555 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1253692 steps, run timeout after 3001 ms. (steps per millisecond=417 ) properties seen :0 out of 1
Probabilistic random walk after 1253692 steps, saw 161613 distinct states, run finished after 3001 ms. (steps per millisecond=417 ) properties seen :0
// Phase 1: matrix 101 rows 157 cols
[2025-05-31 00:59:09] [INFO ] Computed 59 invariants in 1 ms
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) 65/66 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 37/103 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/128 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/135 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 86/221 variables, 135/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 14/235 variables, 8/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/235 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/235 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 14/249 variables, 5/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/249 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/249 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 9/258 variables, 9/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/258 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/258 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 216 constraints, problems are : Problem set: 0 solved, 1 unsolved in 136 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 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) 65/66 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/103 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/128 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/135 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 86/221 variables, 135/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/221 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 14/235 variables, 8/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/235 variables, 3/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/235 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 14/249 variables, 5/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/249 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/249 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 9/258 variables, 9/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-31 00:59:09] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/258 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/258 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/258 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 218 constraints, problems are : Problem set: 0 solved, 1 unsolved in 197 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 338ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 51 ms.
Support contains 1 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 2 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 157/157 places, 101/101 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 101/101 transitions.
Applied a total of 0 rules in 2 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2025-05-31 00:59:09] [INFO ] Invariant cache hit.
[2025-05-31 00:59:09] [INFO ] Implicit Places using invariants in 228 ms returned []
[2025-05-31 00:59:09] [INFO ] Invariant cache hit.
[2025-05-31 00:59:10] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 572 ms to find 0 implicit places.
[2025-05-31 00:59:10] [INFO ] Redundant transitions in 1 ms returned []
Running 98 sub problems to find dead transitions.
[2025-05-31 00:59:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 98 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/156 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (OVERLAPS) 101/257 variables, 156/215 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:59:12] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 2 ms to minimize.
[2025-05-31 00:59:13] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2025-05-31 00:59:13] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 3/218 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:59:14] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 1/258 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:59:15] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 2 ms to minimize.
[2025-05-31 00:59:15] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:59:17] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/258 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:59:18] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/258 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:59:19] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/258 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/258 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 16 (OVERLAPS) 0/258 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 225 constraints, problems are : Problem set: 0 solved, 98 unsolved in 12650 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 2/156 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 101/257 variables, 156/224 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 98/322 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (OVERLAPS) 1/258 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2025-05-31 00:59:35] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2025-05-31 00:59:36] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/258 variables, 2/325 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/258 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 14 (OVERLAPS) 0/258 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 325 constraints, problems are : Problem set: 0 solved, 98 unsolved in 27852 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 11/11 constraints]
After SMT, in 40531ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 40533ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41113 ms. Remains : 157/157 places, 101/101 transitions.
Attempting over-approximation, by ignoring read arcs.
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 157 transition count 101
Applied a total of 1 rules in 6 ms. Remains 157 /157 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 101 rows 157 cols
[2025-05-31 00:59:50] [INFO ] Computed 59 invariants in 1 ms
[2025-05-31 00:59:50] [INFO ] [Real]Absence check using 35 positive place invariants in 15 ms returned sat
[2025-05-31 00:59:50] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 23 ms returned sat
[2025-05-31 00:59:50] [INFO ] After 132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-05-31 00:59:50] [INFO ] [Nat]Absence check using 35 positive place invariants in 13 ms returned sat
[2025-05-31 00:59:50] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 18 ms returned sat
[2025-05-31 00:59:51] [INFO ] After 110ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-31 00:59:51] [INFO ] After 129ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-31 00:59:51] [INFO ] After 266ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 411 ms.
RANDOM walk for 39469 steps (1828 resets) in 353 ms. (111 steps per ms) remains 0/1 properties
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 2 ms. Remains 162 /162 variables (removed 0) and now considering 103/103 (removed 0) transitions.
Running SMT prover for 21 properties.
// Phase 1: matrix 103 rows 162 cols
[2025-05-31 00:59:51] [INFO ] Computed 62 invariants in 2 ms
[2025-05-31 00:59:51] [INFO ] [Real]Absence check using 34 positive place invariants in 18 ms returned sat
[2025-05-31 00:59:51] [INFO ] [Real]Absence check using 34 positive and 28 generalized place invariants in 22 ms returned sat
[2025-05-31 00:59:51] [INFO ] After 607ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:21
[2025-05-31 00:59:52] [INFO ] [Nat]Absence check using 34 positive place invariants in 18 ms returned sat
[2025-05-31 00:59:52] [INFO ] [Nat]Absence check using 34 positive and 28 generalized place invariants in 25 ms returned sat
[2025-05-31 00:59:53] [INFO ] After 704ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :21
TRAPS : Iteration 0
[2025-05-31 00:59:53] [INFO ] Deduced a trap composed of 14 places in 141 ms of which 2 ms to minimize.
[2025-05-31 00:59:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
TRAPS : Iteration 1
[2025-05-31 00:59:54] [INFO ] After 2071ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :21
[2025-05-31 00:59:54] [INFO ] After 2968ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :21
Over-approximation ignoring read arcs solved 0 properties in 3598 ms.
Unable to solve all queries for examination QuasiLiveness. Remains :21 assertions to prove.
No /home/mcc/execution/QuasiLiveness.xml examination file found. Proceeding without properties.
Parsed 21 properties from file /home/mcc/execution/QuasiLiveness.xml in 2 ms.
Working with output stream class java.io.PrintStream
Total runtime 1206362 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DES-PT-10b

IS_COLORED=
IS_NUPN=1

LOADING model.pnml ...
MODEL CLASS: P/T NET WITH NUPN EXTENSION
PLACES: 320
TRANSITIONS: 271
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 827
NUPN UNITS: 107
LOADING TIME: 0.903

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

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

Process ID: 2410
MODEL NAME: /home/mcc/execution/model
320 places, 271 transitions.

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

BK_STOP 1748653292101

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -timeout 180 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-10b"
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 DES-PT-10b, 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 r070-smll-174854076400182"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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