Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 169K May 18 16:42 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 1716406370060

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DoubleExponent-PT-010
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 19:32:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-22 19:32:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 19:32:51] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2024-05-22 19:32:51] [INFO ] Transformed 534 places.
[2024-05-22 19:32:51] [INFO ] Transformed 498 transitions.
[2024-05-22 19:32:51] [INFO ] Parsed PT model containing 534 places and 498 transitions and 1404 arcs in 184 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 534/534 places, 498/498 transitions.
Reduce places removed 4 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 124 rules applied. Total rules applied 124 place count 530 transition count 378
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 244 place count 410 transition count 378
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 244 place count 410 transition count 358
Deduced a syphon composed of 20 places in 18 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 284 place count 390 transition count 358
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 94
Deduced a syphon composed of 94 places in 2 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 2 with 188 rules applied. Total rules applied 472 place count 296 transition count 264
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 508 place count 278 transition count 264
Applied a total of 508 rules in 118 ms. Remains 278 /534 variables (removed 256) and now considering 264/498 (removed 234) transitions.
// Phase 1: matrix 264 rows 278 cols
[2024-05-22 19:32:51] [INFO ] Computed 51 invariants in 48 ms
[2024-05-22 19:32:52] [INFO ] Implicit Places using invariants in 446 ms returned [229, 230]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 482 ms to find 2 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 276/534 places, 264/498 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 276 transition count 263
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 275 transition count 263
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 8 place count 272 transition count 260
Applied a total of 8 rules in 11 ms. Remains 272 /276 variables (removed 4) and now considering 260/264 (removed 4) transitions.
// Phase 1: matrix 260 rows 272 cols
[2024-05-22 19:32:52] [INFO ] Computed 49 invariants in 18 ms
[2024-05-22 19:32:52] [INFO ] Implicit Places using invariants in 197 ms returned []
[2024-05-22 19:32:52] [INFO ] Invariant cache hit.
[2024-05-22 19:32:52] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-22 19:32:53] [INFO ] Implicit Places using invariants and state equation in 847 ms returned []
Implicit Place search using SMT with State Equation took 1054 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 272/534 places, 260/498 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 1684 ms. Remains : 272/534 places, 260/498 transitions.
Discarding 58 transitions out of 260. Remains 202
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (4830 resets) in 1759 ms. (22 steps per ms) remains 187/201 properties
BEST_FIRST walk for 401 steps (33 resets) in 9 ms. (40 steps per ms) remains 187/187 properties
BEST_FIRST walk for 402 steps (29 resets) in 9 ms. (40 steps per ms) remains 187/187 properties
BEST_FIRST walk for 402 steps (29 resets) in 8 ms. (44 steps per ms) remains 187/187 properties
BEST_FIRST walk for 402 steps (31 resets) in 22 ms. (17 steps per ms) remains 187/187 properties
BEST_FIRST walk for 400 steps (28 resets) in 10 ms. (36 steps per ms) remains 187/187 properties
BEST_FIRST walk for 401 steps (26 resets) in 29 ms. (13 steps per ms) remains 187/187 properties
BEST_FIRST walk for 402 steps (31 resets) in 31 ms. (12 steps per ms) remains 187/187 properties
BEST_FIRST walk for 403 steps (28 resets) in 30 ms. (13 steps per ms) remains 187/187 properties
BEST_FIRST walk for 402 steps (28 resets) in 25 ms. (15 steps per ms) remains 187/187 properties
BEST_FIRST walk for 402 steps (27 resets) in 20 ms. (19 steps per ms) remains 187/187 properties
BEST_FIRST walk for 401 steps (26 resets) in 9 ms. (40 steps per ms) remains 187/187 properties
BEST_FIRST walk for 403 steps (30 resets) in 9 ms. (40 steps per ms) remains 187/187 properties
BEST_FIRST walk for 401 steps (33 resets) in 10 ms. (36 steps per ms) remains 187/187 properties
BEST_FIRST walk for 402 steps (26 resets) in 8 ms. (44 steps per ms) remains 187/187 properties
BEST_FIRST walk for 400 steps (31 resets) in 9 ms. (40 steps per ms) remains 187/187 properties
BEST_FIRST walk for 403 steps (27 resets) in 17 ms. (22 steps per ms) remains 187/187 properties
BEST_FIRST walk for 401 steps (29 resets) in 13 ms. (28 steps per ms) remains 187/187 properties
BEST_FIRST walk for 400 steps (32 resets) in 14 ms. (26 steps per ms) remains 187/187 properties
BEST_FIRST walk for 402 steps (29 resets) in 11 ms. (33 steps per ms) remains 187/187 properties
BEST_FIRST walk for 401 steps (30 resets) in 17 ms. (22 steps per ms) remains 187/187 properties
BEST_FIRST walk for 401 steps (27 resets) in 14 ms. (26 steps per ms) remains 187/187 properties
BEST_FIRST walk for 401 steps (29 resets) in 7 ms. (50 steps per ms) remains 187/187 properties
BEST_FIRST walk for 402 steps (30 resets) in 13 ms. (28 steps per ms) remains 187/187 properties
BEST_FIRST walk for 402 steps (25 resets) in 12 ms. (30 steps per ms) remains 187/187 properties
BEST_FIRST walk for 401 steps (30 resets) in 11 ms. (33 steps per ms) remains 187/187 properties
BEST_FIRST walk for 400 steps (32 resets) in 9 ms. (40 steps per ms) remains 187/187 properties
BEST_FIRST walk for 401 steps (26 resets) in 13 ms. (28 steps per ms) remains 187/187 properties
BEST_FIRST walk for 401 steps (29 resets) in 8 ms. (44 steps per ms) remains 187/187 properties
BEST_FIRST walk for 400 steps (31 resets) in 11 ms. (33 steps per ms) remains 187/187 properties
BEST_FIRST walk for 403 steps (33 resets) in 9 ms. (40 steps per ms) remains 187/187 properties
BEST_FIRST walk for 401 steps (28 resets) in 11 ms. (33 steps per ms) remains 187/187 properties
BEST_FIRST walk for 401 steps (28 resets) in 8 ms. (44 steps per ms) remains 187/187 properties
BEST_FIRST walk for 401 steps (27 resets) in 11 ms. (33 steps per ms) remains 187/187 properties
BEST_FIRST walk for 401 steps (30 resets) in 10 ms. (36 steps per ms) remains 187/187 properties
BEST_FIRST walk for 400 steps (32 resets) in 11 ms. (33 steps per ms) remains 187/187 properties
BEST_FIRST walk for 400 steps (28 resets) in 9 ms. (40 steps per ms) remains 187/187 properties
BEST_FIRST walk for 401 steps (32 resets) in 9 ms. (40 steps per ms) remains 187/187 properties
BEST_FIRST walk for 402 steps (26 resets) in 9 ms. (40 steps per ms) remains 187/187 properties
BEST_FIRST walk for 400 steps (29 resets) in 8 ms. (44 steps per ms) remains 187/187 properties
BEST_FIRST walk for 402 steps (31 resets) in 8 ms. (44 steps per ms) remains 187/187 properties
BEST_FIRST walk for 401 steps (27 resets) in 10 ms. (36 steps per ms) remains 187/187 properties
BEST_FIRST walk for 400 steps (30 resets) in 8 ms. (44 steps per ms) remains 187/187 properties
BEST_FIRST walk for 400 steps (28 resets) in 9 ms. (40 steps per ms) remains 187/187 properties
BEST_FIRST walk for 400 steps (30 resets) in 6 ms. (57 steps per ms) remains 187/187 properties
BEST_FIRST walk for 402 steps (30 resets) in 6 ms. (57 steps per ms) remains 187/187 properties
BEST_FIRST walk for 403 steps (27 resets) in 8 ms. (44 steps per ms) remains 187/187 properties
BEST_FIRST walk for 401 steps (30 resets) in 8 ms. (44 steps per ms) remains 187/187 properties
BEST_FIRST walk for 402 steps (31 resets) in 5 ms. (67 steps per ms) remains 187/187 properties
BEST_FIRST walk for 401 steps (26 resets) in 25 ms. (15 steps per ms) remains 187/187 properties
BEST_FIRST walk for 402 steps (32 resets) in 10 ms. (36 steps per ms) remains 187/187 properties
Probabilistic random walk after 100000 steps, saw 50010 distinct states, run finished after 2192 ms. (steps per millisecond=45 ) properties seen :35
[2024-05-22 19:32:56] [INFO ] Invariant cache hit.
[2024-05-22 19:32:56] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 21/229 variables, 6/39 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 29/258 variables, 6/45 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 4/262 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 8 (OVERLAPS) 4/266 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-22 19:33:01] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 6 ms to minimize.
[2024-05-22 19:33:01] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 266/532 variables, and 51 constraints, problems are : Problem set: 0 solved, 152 unsolved in 5019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 0/272 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 21/229 variables, 6/39 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 29/258 variables, 6/45 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 4/262 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-22 19:33:03] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 9 (OVERLAPS) 4/266 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/266 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/266 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 12 (OVERLAPS) 260/526 variables, 266/318 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/526 variables, 20/338 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 526/532 variables, and 481 constraints, problems are : Problem set: 0 solved, 152 unsolved in 5017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 266/272 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 143/152 constraints, Known Traps: 3/3 constraints]
After SMT, in 10110ms problems are : Problem set: 0 solved, 152 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 208 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 260/260 transitions.
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 272 transition count 255
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 10 place count 267 transition count 255
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 267 transition count 255
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 266 transition count 254
Applied a total of 19 rules in 34 ms. Remains 266 /272 variables (removed 6) and now considering 254/260 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 266/272 places, 254/260 transitions.
RANDOM walk for 4000000 steps (513100 resets) in 36434 ms. (109 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40001 steps (3362 resets) in 284 ms. (140 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40001 steps (3405 resets) in 237 ms. (168 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40002 steps (3425 resets) in 240 ms. (165 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40002 steps (3306 resets) in 235 ms. (169 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40001 steps (3385 resets) in 238 ms. (167 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40002 steps (3408 resets) in 299 ms. (133 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40000 steps (3383 resets) in 230 ms. (173 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40001 steps (3377 resets) in 233 ms. (170 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40001 steps (3382 resets) in 234 ms. (170 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40002 steps (3428 resets) in 235 ms. (169 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40001 steps (3394 resets) in 235 ms. (169 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40002 steps (3396 resets) in 234 ms. (170 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40001 steps (3416 resets) in 238 ms. (167 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40002 steps (3400 resets) in 233 ms. (170 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40001 steps (3377 resets) in 235 ms. (169 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40000 steps (3402 resets) in 243 ms. (163 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40001 steps (3436 resets) in 235 ms. (169 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40002 steps (3356 resets) in 234 ms. (170 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40001 steps (3418 resets) in 230 ms. (173 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40000 steps (3411 resets) in 238 ms. (167 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40003 steps (3361 resets) in 236 ms. (168 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40002 steps (3376 resets) in 235 ms. (169 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40002 steps (3388 resets) in 235 ms. (169 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40001 steps (3432 resets) in 236 ms. (168 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40001 steps (3323 resets) in 236 ms. (168 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40001 steps (3378 resets) in 286 ms. (139 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40002 steps (3387 resets) in 236 ms. (168 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40002 steps (3358 resets) in 234 ms. (170 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40002 steps (3354 resets) in 237 ms. (168 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40002 steps (3440 resets) in 259 ms. (153 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40002 steps (3351 resets) in 236 ms. (168 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40003 steps (3405 resets) in 235 ms. (169 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40002 steps (3368 resets) in 235 ms. (169 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40000 steps (3412 resets) in 236 ms. (168 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40000 steps (3436 resets) in 233 ms. (170 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40001 steps (3379 resets) in 237 ms. (168 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40002 steps (3368 resets) in 232 ms. (171 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40001 steps (3373 resets) in 234 ms. (170 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40002 steps (3436 resets) in 236 ms. (168 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40002 steps (3357 resets) in 235 ms. (169 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40000 steps (3426 resets) in 246 ms. (161 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40001 steps (3433 resets) in 234 ms. (170 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40002 steps (3427 resets) in 237 ms. (168 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40001 steps (3434 resets) in 244 ms. (163 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40000 steps (3371 resets) in 239 ms. (166 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40001 steps (3417 resets) in 243 ms. (163 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40003 steps (3392 resets) in 239 ms. (166 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40002 steps (3401 resets) in 236 ms. (168 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40002 steps (3369 resets) in 239 ms. (166 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40000 steps (3425 resets) in 233 ms. (170 steps per ms) remains 152/152 properties
Probably explored full state space saw : 430257 states, properties seen :7
Probabilistic random walk after 860541 steps, saw 430257 distinct states, run finished after 14289 ms. (steps per millisecond=60 ) properties seen :7
Interrupted probabilistic random walk after 2201467 steps, run timeout after 39001 ms. (steps per millisecond=56 ) properties seen :12 out of 145
Exhaustive walk after 2201467 steps, saw 1100943 distinct states, run finished after 39013 ms. (steps per millisecond=56 ) properties seen :12
// Phase 1: matrix 254 rows 266 cols
[2024-05-22 19:34:12] [INFO ] Computed 49 invariants in 18 ms
[2024-05-22 19:34:12] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (OVERLAPS) 34/217 variables, 7/36 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (OVERLAPS) 35/252 variables, 9/45 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (OVERLAPS) 3/255 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 133 unsolved
[2024-05-22 19:34:15] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/255 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (OVERLAPS) 253/508 variables, 255/303 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/508 variables, 22/325 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/508 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 133 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 11/519 variables, 10/335 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/519 variables, 2/337 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/519 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 15 (OVERLAPS) 1/520 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/520 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 17 (OVERLAPS) 0/520 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 338 constraints, problems are : Problem set: 0 solved, 133 unsolved in 22749 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 266/266 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (OVERLAPS) 34/217 variables, 7/36 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (OVERLAPS) 35/252 variables, 9/45 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (OVERLAPS) 3/255 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/255 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (OVERLAPS) 253/508 variables, 255/303 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/508 variables, 22/325 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/508 variables, 123/448 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/508 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 13 (OVERLAPS) 11/519 variables, 10/458 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/519 variables, 2/460 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/519 variables, 10/470 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/519 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 133 unsolved
SMT process timed out in 67811ms, After SMT, problems are : Problem set: 0 solved, 133 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 183 out of 266 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 254/254 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 266 transition count 252
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 264 transition count 252
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 8 place count 264 transition count 252
Applied a total of 8 rules in 26 ms. Remains 264 /266 variables (removed 2) and now considering 252/254 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 264/266 places, 252/254 transitions.
RANDOM walk for 4000000 steps (513229 resets) in 33171 ms. (120 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40000 steps (3403 resets) in 229 ms. (173 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3379 resets) in 225 ms. (176 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (3406 resets) in 226 ms. (176 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (3300 resets) in 222 ms. (179 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (3390 resets) in 225 ms. (177 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (3361 resets) in 228 ms. (174 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (3333 resets) in 221 ms. (180 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (3373 resets) in 237 ms. (168 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (3466 resets) in 224 ms. (177 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3341 resets) in 229 ms. (173 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40000 steps (3366 resets) in 223 ms. (178 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3342 resets) in 224 ms. (177 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (3414 resets) in 232 ms. (171 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3436 resets) in 226 ms. (176 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (3358 resets) in 227 ms. (175 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40000 steps (3382 resets) in 229 ms. (173 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (3377 resets) in 224 ms. (177 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40000 steps (3321 resets) in 224 ms. (177 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3339 resets) in 228 ms. (174 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (3396 resets) in 225 ms. (177 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40000 steps (3348 resets) in 231 ms. (172 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40000 steps (3375 resets) in 231 ms. (172 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (3365 resets) in 222 ms. (179 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40000 steps (3366 resets) in 229 ms. (173 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3360 resets) in 228 ms. (174 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (3327 resets) in 223 ms. (178 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (3359 resets) in 228 ms. (174 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3432 resets) in 222 ms. (179 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3368 resets) in 222 ms. (179 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (3364 resets) in 226 ms. (176 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3441 resets) in 225 ms. (176 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3299 resets) in 228 ms. (174 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40000 steps (3436 resets) in 234 ms. (170 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40000 steps (3376 resets) in 230 ms. (173 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (3401 resets) in 228 ms. (174 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3366 resets) in 229 ms. (173 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (3407 resets) in 228 ms. (174 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (3348 resets) in 222 ms. (179 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3329 resets) in 226 ms. (176 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (3416 resets) in 228 ms. (174 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3393 resets) in 225 ms. (176 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (3413 resets) in 226 ms. (176 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (3385 resets) in 229 ms. (173 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40000 steps (3313 resets) in 226 ms. (176 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (3393 resets) in 223 ms. (178 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (3460 resets) in 226 ms. (176 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40000 steps (3359 resets) in 227 ms. (175 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3398 resets) in 224 ms. (177 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3400 resets) in 228 ms. (174 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40000 steps (3407 resets) in 224 ms. (177 steps per ms) remains 133/133 properties
Probably explored full state space saw : 656378 states, properties seen :0
Probabilistic random walk after 1312810 steps, saw 656378 distinct states, run finished after 22523 ms. (steps per millisecond=58 ) properties seen :0
Interrupted probabilistic random walk after 2241002 steps, run timeout after 36001 ms. (steps per millisecond=62 ) properties seen :0 out of 133
Exhaustive walk after 2241002 steps, saw 1120692 distinct states, run finished after 36004 ms. (steps per millisecond=62 ) properties seen :0
// Phase 1: matrix 252 rows 264 cols
[2024-05-22 19:36:31] [INFO ] Computed 49 invariants in 15 ms
[2024-05-22 19:36:31] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (OVERLAPS) 34/217 variables, 12/36 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (OVERLAPS) 31/248 variables, 8/44 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (OVERLAPS) 5/253 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 133 unsolved
[2024-05-22 19:36:34] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/253 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (OVERLAPS) 251/504 variables, 253/301 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/504 variables, 24/325 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/504 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 133 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 11/515 variables, 10/335 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/515 variables, 2/337 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/515 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 15 (OVERLAPS) 1/516 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/516 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 17 (OVERLAPS) 0/516 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 516/516 variables, and 338 constraints, problems are : Problem set: 0 solved, 133 unsolved in 17602 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 264/264 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (OVERLAPS) 34/217 variables, 12/36 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (OVERLAPS) 31/248 variables, 8/44 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (OVERLAPS) 5/253 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/253 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (OVERLAPS) 251/504 variables, 253/301 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/504 variables, 24/325 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/504 variables, 123/448 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/504 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 13 (OVERLAPS) 11/515 variables, 10/458 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/515 variables, 2/460 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/515 variables, 10/470 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/515 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 17 (OVERLAPS) 1/516 variables, 1/471 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/516 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 133 unsolved
[2024-05-22 19:37:53] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 2 ms to minimize.
[2024-05-22 19:37:53] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-05-22 19:37:53] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 2 ms to minimize.
[2024-05-22 19:37:53] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 1 ms to minimize.
[2024-05-22 19:37:53] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-05-22 19:37:54] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
At refinement iteration 19 (OVERLAPS) 0/516 variables, 6/477 constraints. Problems are: Problem set: 0 solved, 133 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 516/516 variables, and 477 constraints, problems are : Problem set: 0 solved, 133 unsolved in 75019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 264/264 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 7/7 constraints]
After SMT, in 92666ms problems are : Problem set: 0 solved, 133 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 183 out of 264 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 264/264 places, 252/252 transitions.
Applied a total of 0 rules in 12 ms. Remains 264 /264 variables (removed 0) and now considering 252/252 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 264/264 places, 252/252 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 264/264 places, 252/252 transitions.
Applied a total of 0 rules in 7 ms. Remains 264 /264 variables (removed 0) and now considering 252/252 (removed 0) transitions.
[2024-05-22 19:38:03] [INFO ] Invariant cache hit.
[2024-05-22 19:38:03] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-22 19:38:03] [INFO ] Invariant cache hit.
[2024-05-22 19:38:04] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-22 19:38:04] [INFO ] Implicit Places using invariants and state equation in 567 ms returned [146, 216, 255, 261]
[2024-05-22 19:38:04] [INFO ] Actually due to overlaps returned [216, 146]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 657 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 262/264 places, 252/252 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 262 transition count 251
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 261 transition count 251
Applied a total of 2 rules in 17 ms. Remains 261 /262 variables (removed 1) and now considering 251/252 (removed 1) transitions.
// Phase 1: matrix 251 rows 261 cols
[2024-05-22 19:38:04] [INFO ] Computed 47 invariants in 20 ms
[2024-05-22 19:38:04] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-22 19:38:04] [INFO ] Invariant cache hit.
[2024-05-22 19:38:04] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-22 19:38:05] [INFO ] Implicit Places using invariants and state equation in 442 ms returned [252, 258]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 546 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 259/264 places, 251/252 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 259 transition count 250
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 258 transition count 250
Applied a total of 2 rules in 23 ms. Remains 258 /259 variables (removed 1) and now considering 250/251 (removed 1) transitions.
// Phase 1: matrix 250 rows 258 cols
[2024-05-22 19:38:05] [INFO ] Computed 45 invariants in 13 ms
[2024-05-22 19:38:05] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-22 19:38:05] [INFO ] Invariant cache hit.
[2024-05-22 19:38:05] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-22 19:38:05] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 468 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 258/264 places, 250/252 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1718 ms. Remains : 258/264 places, 250/252 transitions.
RANDOM walk for 4000000 steps (577454 resets) in 73865 ms. (54 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3618 resets) in 629 ms. (63 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40000 steps (3641 resets) in 553 ms. (72 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3687 resets) in 598 ms. (66 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (3618 resets) in 626 ms. (63 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (3689 resets) in 704 ms. (56 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40000 steps (3659 resets) in 497 ms. (80 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (3642 resets) in 435 ms. (91 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3686 resets) in 416 ms. (95 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (3653 resets) in 599 ms. (66 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40000 steps (3702 resets) in 427 ms. (93 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3648 resets) in 500 ms. (79 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3659 resets) in 453 ms. (88 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (3640 resets) in 682 ms. (58 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (3626 resets) in 605 ms. (66 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3637 resets) in 595 ms. (67 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (3599 resets) in 524 ms. (76 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (3642 resets) in 471 ms. (84 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3642 resets) in 494 ms. (80 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (3626 resets) in 433 ms. (92 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (3569 resets) in 486 ms. (82 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (3614 resets) in 679 ms. (58 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3620 resets) in 626 ms. (63 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3668 resets) in 625 ms. (63 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3715 resets) in 456 ms. (87 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40000 steps (3641 resets) in 558 ms. (71 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3690 resets) in 511 ms. (78 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (3599 resets) in 499 ms. (80 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3655 resets) in 440 ms. (90 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3690 resets) in 577 ms. (69 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (3577 resets) in 444 ms. (89 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3682 resets) in 472 ms. (84 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3716 resets) in 647 ms. (61 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40000 steps (3658 resets) in 494 ms. (80 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3613 resets) in 628 ms. (63 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3690 resets) in 555 ms. (71 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3706 resets) in 648 ms. (61 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3669 resets) in 448 ms. (89 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (3641 resets) in 658 ms. (60 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (3635 resets) in 691 ms. (57 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (3652 resets) in 649 ms. (61 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40000 steps (3611 resets) in 431 ms. (92 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (3673 resets) in 499 ms. (80 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (3632 resets) in 463 ms. (86 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3647 resets) in 474 ms. (84 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (3697 resets) in 385 ms. (103 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (3660 resets) in 379 ms. (105 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (3699 resets) in 477 ms. (83 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (3635 resets) in 665 ms. (60 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40000 steps (3658 resets) in 531 ms. (75 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (3728 resets) in 478 ms. (83 steps per ms) remains 133/133 properties
Interrupted probabilistic random walk after 3980236 steps, run timeout after 87001 ms. (steps per millisecond=45 ) properties seen :2 out of 133
Probabilistic random walk after 3980236 steps, saw 1989948 distinct states, run finished after 87001 ms. (steps per millisecond=45 ) properties seen :2
[2024-05-22 19:40:02] [INFO ] Invariant cache hit.
[2024-05-22 19:40:02] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 42/222 variables, 10/34 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 25/247 variables, 9/43 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-22 19:40:04] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 249/496 variables, 247/291 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 24/315 constraints. Problems are: Problem set: 0 solved, 131 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (OVERLAPS) 11/507 variables, 10/325 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/507 variables, 2/327 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/507 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 13 (OVERLAPS) 1/508 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/508 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 15 (OVERLAPS) 0/508 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 508/508 variables, and 328 constraints, problems are : Problem set: 0 solved, 131 unsolved in 16957 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 258/258 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 42/222 variables, 10/34 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 25/247 variables, 9/43 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 249/496 variables, 247/291 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 24/315 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 122/437 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/496 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (OVERLAPS) 11/507 variables, 10/447 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/507 variables, 2/449 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/507 variables, 9/458 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-22 19:41:15] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/507 variables, 1/459 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/507 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 131 unsolved
SMT process timed out in 106997ms, After SMT, problems are : Problem set: 0 solved, 131 unsolved
Fused 131 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 12005 ms.
Support contains 180 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 250/250 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 258 transition count 248
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 256 transition count 248
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 256 transition count 248
Applied a total of 5 rules in 15 ms. Remains 256 /258 variables (removed 2) and now considering 248/250 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 256/258 places, 248/250 transitions.
RANDOM walk for 4000000 steps (576849 resets) in 85386 ms. (46 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40000 steps (3633 resets) in 590 ms. (67 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3632 resets) in 626 ms. (63 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3623 resets) in 587 ms. (68 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3670 resets) in 546 ms. (73 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40000 steps (3712 resets) in 488 ms. (81 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40000 steps (3629 resets) in 581 ms. (68 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40003 steps (3678 resets) in 522 ms. (76 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3648 resets) in 826 ms. (48 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3688 resets) in 738 ms. (54 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3624 resets) in 505 ms. (79 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3645 resets) in 522 ms. (76 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40003 steps (3636 resets) in 728 ms. (54 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3657 resets) in 553 ms. (72 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3697 resets) in 536 ms. (74 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3734 resets) in 536 ms. (74 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3675 resets) in 401 ms. (99 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3708 resets) in 501 ms. (79 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3668 resets) in 519 ms. (76 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3639 resets) in 557 ms. (71 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3650 resets) in 600 ms. (66 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40000 steps (3702 resets) in 445 ms. (89 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40003 steps (3708 resets) in 365 ms. (109 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3630 resets) in 589 ms. (67 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40004 steps (3678 resets) in 541 ms. (73 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3643 resets) in 631 ms. (63 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3668 resets) in 430 ms. (92 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3642 resets) in 658 ms. (60 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40003 steps (3668 resets) in 598 ms. (66 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3587 resets) in 461 ms. (86 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3664 resets) in 572 ms. (69 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3628 resets) in 421 ms. (94 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3662 resets) in 372 ms. (107 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40004 steps (3665 resets) in 602 ms. (66 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3583 resets) in 641 ms. (62 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3713 resets) in 573 ms. (69 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40000 steps (3668 resets) in 598 ms. (66 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40000 steps (3692 resets) in 441 ms. (90 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3647 resets) in 391 ms. (102 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3688 resets) in 455 ms. (87 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3659 resets) in 421 ms. (94 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40003 steps (3656 resets) in 636 ms. (62 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3619 resets) in 395 ms. (101 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3607 resets) in 587 ms. (68 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40000 steps (3664 resets) in 592 ms. (67 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3634 resets) in 435 ms. (91 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3665 resets) in 561 ms. (71 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40003 steps (3651 resets) in 491 ms. (81 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3690 resets) in 412 ms. (96 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3709 resets) in 679 ms. (58 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40003 steps (3677 resets) in 423 ms. (94 steps per ms) remains 131/131 properties
Probably explored full state space saw : 259289 states, properties seen :0
Probabilistic random walk after 518586 steps, saw 259289 distinct states, run finished after 12436 ms. (steps per millisecond=41 ) properties seen :0
Interrupted probabilistic random walk after 4224380 steps, run timeout after 102001 ms. (steps per millisecond=41 ) properties seen :0 out of 131
Exhaustive walk after 4224380 steps, saw 2112258 distinct states, run finished after 102001 ms. (steps per millisecond=41 ) properties seen :0
// Phase 1: matrix 248 rows 256 cols
[2024-05-22 19:44:30] [INFO ] Computed 45 invariants in 15 ms
[2024-05-22 19:44:30] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 42/222 variables, 14/34 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 24/246 variables, 9/43 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-22 19:44:32] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 247/493 variables, 246/290 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/493 variables, 24/314 constraints. Problems are: Problem set: 0 solved, 131 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/493 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (OVERLAPS) 10/503 variables, 9/323 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/503 variables, 2/325 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/503 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 13 (OVERLAPS) 1/504 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/504 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 15 (OVERLAPS) 0/504 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 504/504 variables, and 326 constraints, problems are : Problem set: 0 solved, 131 unsolved in 17282 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 256/256 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 42/222 variables, 14/34 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 24/246 variables, 9/43 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 247/493 variables, 246/290 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/493 variables, 24/314 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/493 variables, 122/436 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/493 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (OVERLAPS) 10/503 variables, 9/445 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/503 variables, 2/447 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/503 variables, 9/456 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/503 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 15 (OVERLAPS) 1/504 variables, 1/457 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-22 19:45:46] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 5 ms to minimize.
[2024-05-22 19:45:48] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-05-22 19:45:48] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/504 variables, 3/460 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-22 19:45:55] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/504 variables, 1/461 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/504 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 19 (OVERLAPS) 0/504 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 504/504 variables, and 461 constraints, problems are : Problem set: 0 solved, 131 unsolved in 97087 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 256/256 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 5/5 constraints]
After SMT, in 114416ms problems are : Problem set: 0 solved, 131 unsolved
Parikh walk visited 0 properties in 30004 ms.
Support contains 180 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 248/248 transitions.
Applied a total of 0 rules in 6 ms. Remains 256 /256 variables (removed 0) and now considering 248/248 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 256/256 places, 248/248 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 248/248 transitions.
Applied a total of 0 rules in 5 ms. Remains 256 /256 variables (removed 0) and now considering 248/248 (removed 0) transitions.
[2024-05-22 19:46:55] [INFO ] Invariant cache hit.
[2024-05-22 19:46:55] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-22 19:46:55] [INFO ] Invariant cache hit.
[2024-05-22 19:46:55] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-22 19:46:55] [INFO ] Implicit Places using invariants and state equation in 416 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 503 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 255/256 places, 248/248 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 255 transition count 248
Applied a total of 1 rules in 15 ms. Remains 255 /255 variables (removed 0) and now considering 248/248 (removed 0) transitions.
// Phase 1: matrix 248 rows 255 cols
[2024-05-22 19:46:55] [INFO ] Computed 44 invariants in 16 ms
[2024-05-22 19:46:55] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-22 19:46:55] [INFO ] Invariant cache hit.
[2024-05-22 19:46:56] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-22 19:46:56] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 440 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 255/256 places, 248/248 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 963 ms. Remains : 255/256 places, 248/248 transitions.
RANDOM walk for 4000000 steps (577326 resets) in 91165 ms. (43 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3653 resets) in 389 ms. (102 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3725 resets) in 410 ms. (97 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3642 resets) in 568 ms. (70 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40000 steps (3694 resets) in 590 ms. (67 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3627 resets) in 656 ms. (60 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3601 resets) in 511 ms. (78 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3646 resets) in 655 ms. (60 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3688 resets) in 425 ms. (93 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40000 steps (3656 resets) in 690 ms. (57 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40003 steps (3670 resets) in 430 ms. (92 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3647 resets) in 457 ms. (87 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3703 resets) in 578 ms. (69 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40000 steps (3662 resets) in 443 ms. (90 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3637 resets) in 448 ms. (89 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40000 steps (3656 resets) in 411 ms. (97 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40000 steps (3715 resets) in 413 ms. (96 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40003 steps (3653 resets) in 495 ms. (80 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3595 resets) in 442 ms. (90 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40000 steps (3631 resets) in 633 ms. (63 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40000 steps (3686 resets) in 420 ms. (95 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40000 steps (3715 resets) in 518 ms. (77 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3576 resets) in 376 ms. (106 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3685 resets) in 584 ms. (68 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3578 resets) in 564 ms. (70 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3663 resets) in 511 ms. (78 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3625 resets) in 572 ms. (69 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40003 steps (3679 resets) in 409 ms. (97 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40000 steps (3617 resets) in 615 ms. (64 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3668 resets) in 522 ms. (76 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3649 resets) in 487 ms. (81 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3686 resets) in 562 ms. (71 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3664 resets) in 649 ms. (61 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40003 steps (3621 resets) in 414 ms. (96 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40003 steps (3692 resets) in 494 ms. (80 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3631 resets) in 443 ms. (90 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3615 resets) in 627 ms. (63 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3664 resets) in 386 ms. (103 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3615 resets) in 465 ms. (85 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40003 steps (3678 resets) in 442 ms. (90 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40004 steps (3671 resets) in 424 ms. (94 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3652 resets) in 481 ms. (82 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3623 resets) in 429 ms. (93 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3681 resets) in 614 ms. (65 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3628 resets) in 418 ms. (95 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40000 steps (3616 resets) in 461 ms. (86 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3706 resets) in 585 ms. (68 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3643 resets) in 425 ms. (93 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3668 resets) in 453 ms. (88 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3626 resets) in 446 ms. (89 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40003 steps (3668 resets) in 422 ms. (94 steps per ms) remains 131/131 properties
Interrupted probabilistic random walk after 4623570 steps, run timeout after 96001 ms. (steps per millisecond=48 ) properties seen :0 out of 131
Probabilistic random walk after 4623570 steps, saw 2311531 distinct states, run finished after 96001 ms. (steps per millisecond=48 ) properties seen :0
[2024-05-22 19:49:05] [INFO ] Invariant cache hit.
[2024-05-22 19:49:05] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 46/226 variables, 11/34 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 19/245 variables, 8/42 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 247/492 variables, 245/287 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/492 variables, 24/311 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/492 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 131 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 10/502 variables, 9/320 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/502 variables, 2/322 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/502 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 12 (OVERLAPS) 1/503 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/503 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 14 (OVERLAPS) 0/503 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 503/503 variables, and 323 constraints, problems are : Problem set: 0 solved, 131 unsolved in 16884 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 255/255 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 46/226 variables, 11/34 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 19/245 variables, 8/42 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-22 19:49:23] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 247/492 variables, 245/288 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/492 variables, 24/312 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/492 variables, 122/434 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/492 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (OVERLAPS) 10/502 variables, 9/443 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/502 variables, 2/445 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/502 variables, 9/454 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/502 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 15 (OVERLAPS) 1/503 variables, 1/455 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-22 19:50:18] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 2 ms to minimize.
[2024-05-22 19:50:18] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 1 ms to minimize.
[2024-05-22 19:50:18] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/503 variables, 3/458 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/503 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 18 (OVERLAPS) 0/503 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 503/503 variables, and 458 constraints, problems are : Problem set: 0 solved, 131 unsolved in 87465 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 255/255 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 4/4 constraints]
After SMT, in 104376ms problems are : Problem set: 0 solved, 131 unsolved
Parikh walk visited 0 properties in 30007 ms.
Support contains 180 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Applied a total of 0 rules in 7 ms. Remains 255 /255 variables (removed 0) and now considering 248/248 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 255/255 places, 248/248 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Applied a total of 0 rules in 18 ms. Remains 255 /255 variables (removed 0) and now considering 248/248 (removed 0) transitions.
[2024-05-22 19:51:19] [INFO ] Invariant cache hit.
[2024-05-22 19:51:19] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-22 19:51:19] [INFO ] Invariant cache hit.
[2024-05-22 19:51:19] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-22 19:51:19] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
[2024-05-22 19:51:19] [INFO ] Redundant transitions in 14 ms returned []
Running 247 sub problems to find dead transitions.
[2024-05-22 19:51:19] [INFO ] Invariant cache hit.
[2024-05-22 19:51:19] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/254 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (OVERLAPS) 248/502 variables, 254/298 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/502 variables, 24/322 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/502 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 247 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/503 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 8 (OVERLAPS) 0/503 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Real declared 503/503 variables, and 323 constraints, problems are : Problem set: 0 solved, 247 unsolved in 15696 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 255/255 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 247 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/254 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (OVERLAPS) 248/502 variables, 254/298 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/502 variables, 24/322 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/502 variables, 247/569 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 7 (OVERLAPS) 1/503 variables, 1/570 constraints. Problems are: Problem set: 0 solved, 247 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 503/503 variables, and 570 constraints, problems are : Problem set: 0 solved, 247 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 255/255 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 0/0 constraints]
After SMT, in 45782ms problems are : Problem set: 0 solved, 247 unsolved
Search for dead transitions found 0 dead transitions in 45785ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46281 ms. Remains : 255/255 places, 248/248 transitions.
RANDOM walk for 400000 steps (57656 resets) in 10932 ms. (36 steps per ms) remains 180/180 properties
Running SMT prover for 180 properties.
[2024-05-22 19:52:08] [INFO ] Invariant cache hit.
[2024-05-22 19:52:08] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 19:52:08] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 12 ms returned sat
[2024-05-22 19:52:09] [INFO ] After 610ms SMT Verify possible using state equation in real domain returned unsat :0 sat :180
[2024-05-22 19:52:09] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-22 19:52:10] [INFO ] After 759ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :180
TRAPS : Iteration 0
[2024-05-22 19:52:14] [INFO ] After 5261ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:180
[2024-05-22 19:52:14] [INFO ] After 6045ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:180
[2024-05-22 19:52:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 19:52:14] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 39 ms returned sat
[2024-05-22 19:52:15] [INFO ] After 593ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :180
[2024-05-22 19:52:16] [INFO ] After 1461ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :180
TRAPS : Iteration 0
[2024-05-22 19:52:17] [INFO ] Deduced a trap composed of 12 places in 154 ms of which 2 ms to minimize.
[2024-05-22 19:52:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
[2024-05-22 19:52:17] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 1 ms to minimize.
[2024-05-22 19:52:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2024-05-22 19:52:17] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 1 ms to minimize.
[2024-05-22 19:52:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2024-05-22 19:52:18] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 1 ms to minimize.
[2024-05-22 19:52:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2024-05-22 19:52:18] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 2 ms to minimize.
[2024-05-22 19:52:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2024-05-22 19:52:19] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 3 ms to minimize.
[2024-05-22 19:52:19] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-22 19:52:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 213 ms
[2024-05-22 19:52:19] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 1 ms to minimize.
[2024-05-22 19:52:19] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-05-22 19:52:19] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-05-22 19:52:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 242 ms
[2024-05-22 19:52:19] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-22 19:52:19] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 2 ms to minimize.
[2024-05-22 19:52:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 131 ms
[2024-05-22 19:52:19] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 4 ms to minimize.
[2024-05-22 19:52:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2024-05-22 19:52:20] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 0 ms to minimize.
[2024-05-22 19:52:20] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2024-05-22 19:52:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 121 ms
[2024-05-22 19:52:20] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2024-05-22 19:52:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2024-05-22 19:52:20] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-05-22 19:52:21] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 2 ms to minimize.
[2024-05-22 19:52:21] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2024-05-22 19:52:21] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
[2024-05-22 19:52:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 279 ms
[2024-05-22 19:52:21] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 0 ms to minimize.
[2024-05-22 19:52:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2024-05-22 19:52:22] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-05-22 19:52:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2024-05-22 19:52:22] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-22 19:52:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2024-05-22 19:52:22] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 3 ms to minimize.
[2024-05-22 19:52:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2024-05-22 19:52:22] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 0 ms to minimize.
[2024-05-22 19:52:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2024-05-22 19:52:23] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2024-05-22 19:52:23] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2024-05-22 19:52:23] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2024-05-22 19:52:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 249 ms
[2024-05-22 19:52:24] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-05-22 19:52:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2024-05-22 19:52:24] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 0 ms to minimize.
[2024-05-22 19:52:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
TRAPS : Iteration 1
[2024-05-22 19:52:29] [INFO ] After 13644ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :180
[2024-05-22 19:52:31] [INFO ] After 16799ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :180
RANDOM walk for 4000000 steps (576861 resets) in 90377 ms. (44 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3622 resets) in 496 ms. (80 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3695 resets) in 497 ms. (80 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40003 steps (3673 resets) in 565 ms. (70 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3625 resets) in 545 ms. (73 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3672 resets) in 516 ms. (77 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3596 resets) in 663 ms. (60 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3657 resets) in 520 ms. (76 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3636 resets) in 625 ms. (63 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40000 steps (3678 resets) in 562 ms. (71 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40003 steps (3618 resets) in 422 ms. (94 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3687 resets) in 520 ms. (76 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40000 steps (3688 resets) in 615 ms. (64 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3659 resets) in 540 ms. (73 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3636 resets) in 698 ms. (57 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3645 resets) in 556 ms. (71 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3699 resets) in 514 ms. (77 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3679 resets) in 641 ms. (62 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3658 resets) in 499 ms. (80 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3598 resets) in 512 ms. (77 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3590 resets) in 512 ms. (77 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3651 resets) in 513 ms. (77 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3698 resets) in 561 ms. (71 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3671 resets) in 586 ms. (68 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3651 resets) in 510 ms. (78 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3609 resets) in 540 ms. (73 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40003 steps (3653 resets) in 630 ms. (63 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3521 resets) in 575 ms. (69 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3681 resets) in 564 ms. (70 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3637 resets) in 535 ms. (74 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3661 resets) in 671 ms. (59 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3572 resets) in 560 ms. (71 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3671 resets) in 621 ms. (64 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3656 resets) in 457 ms. (87 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3709 resets) in 518 ms. (77 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3596 resets) in 576 ms. (69 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40003 steps (3670 resets) in 632 ms. (63 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3665 resets) in 536 ms. (74 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3677 resets) in 476 ms. (83 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3688 resets) in 614 ms. (65 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3644 resets) in 523 ms. (76 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3626 resets) in 450 ms. (88 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3630 resets) in 548 ms. (72 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40000 steps (3746 resets) in 498 ms. (80 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3695 resets) in 572 ms. (69 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3622 resets) in 462 ms. (86 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3637 resets) in 448 ms. (89 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40003 steps (3624 resets) in 615 ms. (64 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40002 steps (3693 resets) in 480 ms. (83 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40001 steps (3585 resets) in 427 ms. (93 steps per ms) remains 131/131 properties
BEST_FIRST walk for 40000 steps (3668 resets) in 573 ms. (69 steps per ms) remains 131/131 properties
Interrupted probabilistic random walk after 4203937 steps, run timeout after 99001 ms. (steps per millisecond=42 ) properties seen :0 out of 131
Probabilistic random walk after 4203937 steps, saw 2101780 distinct states, run finished after 99001 ms. (steps per millisecond=42 ) properties seen :0
[2024-05-22 19:54:44] [INFO ] Invariant cache hit.
[2024-05-22 19:54:44] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 46/226 variables, 11/34 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 19/245 variables, 8/42 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 247/492 variables, 245/287 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/492 variables, 24/311 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/492 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 131 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 10/502 variables, 9/320 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/502 variables, 2/322 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/502 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 12 (OVERLAPS) 1/503 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/503 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 14 (OVERLAPS) 0/503 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 503/503 variables, and 323 constraints, problems are : Problem set: 0 solved, 131 unsolved in 15343 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 255/255 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 46/226 variables, 11/34 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 19/245 variables, 8/42 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-22 19:55:00] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 247/492 variables, 245/288 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/492 variables, 24/312 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/492 variables, 122/434 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/492 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (OVERLAPS) 10/502 variables, 9/443 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/502 variables, 2/445 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/502 variables, 9/454 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/502 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 15 (OVERLAPS) 1/503 variables, 1/455 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-22 19:55:55] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 1 ms to minimize.
[2024-05-22 19:55:55] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 1 ms to minimize.
[2024-05-22 19:55:56] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 6 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/503 variables, 3/458 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/503 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 18 (OVERLAPS) 0/503 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 503/503 variables, and 458 constraints, problems are : Problem set: 0 solved, 131 unsolved in 87657 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 255/255 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 4/4 constraints]
After SMT, in 103064ms problems are : Problem set: 0 solved, 131 unsolved
Parikh walk visited 0 properties in 30017 ms.
Support contains 180 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Applied a total of 0 rules in 6 ms. Remains 255 /255 variables (removed 0) and now considering 248/248 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 255/255 places, 248/248 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Applied a total of 0 rules in 5 ms. Remains 255 /255 variables (removed 0) and now considering 248/248 (removed 0) transitions.
[2024-05-22 19:56:57] [INFO ] Invariant cache hit.
[2024-05-22 19:56:57] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-22 19:56:57] [INFO ] Invariant cache hit.
[2024-05-22 19:56:57] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-22 19:56:57] [INFO ] Implicit Places using invariants and state equation in 347 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
[2024-05-22 19:56:57] [INFO ] Redundant transitions in 8 ms returned []
Running 247 sub problems to find dead transitions.
[2024-05-22 19:56:57] [INFO ] Invariant cache hit.
[2024-05-22 19:56:57] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/254 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (OVERLAPS) 248/502 variables, 254/298 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/502 variables, 24/322 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/502 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 247 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/503 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 8 (OVERLAPS) 0/503 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Real declared 503/503 variables, and 323 constraints, problems are : Problem set: 0 solved, 247 unsolved in 15480 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 255/255 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 247 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/254 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (OVERLAPS) 248/502 variables, 254/298 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/502 variables, 24/322 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/502 variables, 247/569 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 7 (OVERLAPS) 1/503 variables, 1/570 constraints. Problems are: Problem set: 0 solved, 247 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 503/503 variables, and 570 constraints, problems are : Problem set: 0 solved, 247 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 255/255 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 0/0 constraints]
After SMT, in 45542ms problems are : Problem set: 0 solved, 247 unsolved
Search for dead transitions found 0 dead transitions in 45546ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46009 ms. Remains : 255/255 places, 248/248 transitions.
RANDOM walk for 400000 steps (57728 resets) in 9718 ms. (41 steps per ms) remains 180/180 properties
Running SMT prover for 180 properties.
[2024-05-22 19:57:46] [INFO ] Invariant cache hit.
[2024-05-22 19:57:46] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-22 19:57:46] [INFO ] [Real]Absence check using 2 positive and 42 generalized place invariants in 11 ms returned sat
[2024-05-22 19:57:47] [INFO ] After 592ms SMT Verify possible using state equation in real domain returned unsat :0 sat :180
[2024-05-22 19:57:47] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-22 19:57:47] [INFO ] After 763ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :180
TRAPS : Iteration 0
[2024-05-22 19:57:51] [INFO ] After 4922ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:180
[2024-05-22 19:57:51] [INFO ] After 5662ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:180
[2024-05-22 19:57:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 19:57:52] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 12 ms returned sat
[2024-05-22 19:57:52] [INFO ] After 606ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :180
[2024-05-22 19:57:54] [INFO ] After 1400ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :180
TRAPS : Iteration 0
[2024-05-22 19:57:54] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-05-22 19:57:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2024-05-22 19:57:54] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 2 ms to minimize.
[2024-05-22 19:57:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2024-05-22 19:57:54] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-05-22 19:57:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2024-05-22 19:57:54] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-22 19:57:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2024-05-22 19:57:54] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-22 19:57:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2024-05-22 19:57:55] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-22 19:57:55] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-22 19:57:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 139 ms
[2024-05-22 19:57:55] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2024-05-22 19:57:55] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-22 19:57:55] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-05-22 19:57:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 200 ms
[2024-05-22 19:57:55] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-22 19:57:55] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-05-22 19:57:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 118 ms
[2024-05-22 19:57:55] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-22 19:57:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2024-05-22 19:57:56] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-05-22 19:57:56] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 0 ms to minimize.
[2024-05-22 19:57:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 126 ms
[2024-05-22 19:57:56] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
[2024-05-22 19:57:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2024-05-22 19:57:56] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
[2024-05-22 19:57:56] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2024-05-22 19:57:56] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 0 ms to minimize.
[2024-05-22 19:57:56] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
[2024-05-22 19:57:57] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 275 ms
[2024-05-22 19:57:57] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-05-22 19:57:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2024-05-22 19:57:58] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-05-22 19:57:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2024-05-22 19:57:58] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-22 19:57:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2024-05-22 19:57:58] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-05-22 19:57:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2024-05-22 19:57:58] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-22 19:57:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2024-05-22 19:57:59] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 0 ms to minimize.
[2024-05-22 19:57:59] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2024-05-22 19:57:59] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-05-22 19:57:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 243 ms
[2024-05-22 19:57:59] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-05-22 19:57:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2024-05-22 19:58:00] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 1 ms to minimize.
[2024-05-22 19:58:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
TRAPS : Iteration 1
[2024-05-22 19:58:04] [INFO ] After 11902ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :180
[2024-05-22 19:58:06] [INFO ] After 14983ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :180
RANDOM walk for 40000 steps (5780 resets) in 105 ms. (377 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3643 resets) in 98 ms. (404 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 914110 steps, run timeout after 3001 ms. (steps per millisecond=304 ) properties seen :0 out of 1
Probabilistic random walk after 914110 steps, saw 457158 distinct states, run finished after 3002 ms. (steps per millisecond=304 ) properties seen :0
[2024-05-22 19:58:10] [INFO ] Invariant cache hit.
[2024-05-22 19:58:10] [INFO ] State equation strengthened by 24 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) 99/100 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 93/193 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 28/221 variables, 9/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 238/459 variables, 221/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/459 variables, 22/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/459 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 37/496 variables, 28/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/496 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/496 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/496 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/498 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/498 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/498 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 5/503 variables, 4/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/503 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/503 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/503 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 503/503 variables, and 323 constraints, problems are : Problem set: 0 solved, 1 unsolved in 315 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 255/255 constraints, ReadFeed: 24/24 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) 99/100 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 93/193 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 19:58:10] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 28/221 variables, 9/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 238/459 variables, 221/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/459 variables, 22/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/459 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 37/496 variables, 28/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/496 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/496 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/496 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/496 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/498 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/498 variables, 2/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/498 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 5/503 variables, 4/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/503 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/503 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/503 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 503/503 variables, and 325 constraints, problems are : Problem set: 0 solved, 1 unsolved in 401 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 255/255 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 747ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 35 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 26 times.
Iterating global reduction 1 with 26 rules applied. Total rules applied 28 place count 254 transition count 221
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 54 place count 228 transition count 221
Partial Free-agglomeration rule applied 30 times.
Drop transitions (Partial Free agglomeration) removed 30 transitions
Iterating global reduction 2 with 30 rules applied. Total rules applied 84 place count 228 transition count 221
Applied a total of 84 rules in 37 ms. Remains 228 /255 variables (removed 27) and now considering 221/248 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 228/255 places, 221/248 transitions.
RANDOM walk for 40000 steps (5758 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3738 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 927193 steps, run timeout after 3001 ms. (steps per millisecond=308 ) properties seen :0 out of 1
Probabilistic random walk after 927193 steps, saw 463700 distinct states, run finished after 3002 ms. (steps per millisecond=308 ) properties seen :0
// Phase 1: matrix 221 rows 228 cols
[2024-05-22 19:58:13] [INFO ] Computed 44 invariants in 17 ms
[2024-05-22 19:58:13] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 137/178 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 45/223 variables, 16/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 19:58:14] [INFO ] Deduced a trap composed of 4 places in 649 ms of which 1 ms to minimize.
[2024-05-22 19:58:14] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 1 ms to minimize.
[2024-05-22 19:58:14] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 2 ms to minimize.
[2024-05-22 19:58:14] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 221/444 variables, 223/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/444 variables, 38/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/444 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/449 variables, 5/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/449 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/449 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/449 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 449/449 variables, and 314 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1164 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 228/228 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 137/178 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 45/223 variables, 16/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 19:58:15] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 1 ms to minimize.
[2024-05-22 19:58:15] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 1 ms to minimize.
[2024-05-22 19:58:15] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 1 ms to minimize.
[2024-05-22 19:58:15] [INFO ] Deduced a trap composed of 41 places in 102 ms of which 2 ms to minimize.
[2024-05-22 19:58:15] [INFO ] Deduced a trap composed of 68 places in 103 ms of which 2 ms to minimize.
[2024-05-22 19:58:15] [INFO ] Deduced a trap composed of 73 places in 107 ms of which 2 ms to minimize.
[2024-05-22 19:58:15] [INFO ] Deduced a trap composed of 64 places in 101 ms of which 2 ms to minimize.
[2024-05-22 19:58:16] [INFO ] Deduced a trap composed of 76 places in 96 ms of which 2 ms to minimize.
[2024-05-22 19:58:16] [INFO ] Deduced a trap composed of 71 places in 107 ms of which 1 ms to minimize.
[2024-05-22 19:58:16] [INFO ] Deduced a trap composed of 65 places in 101 ms of which 1 ms to minimize.
[2024-05-22 19:58:16] [INFO ] Deduced a trap composed of 74 places in 117 ms of which 1 ms to minimize.
[2024-05-22 19:58:16] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 1 ms to minimize.
[2024-05-22 19:58:16] [INFO ] Deduced a trap composed of 61 places in 112 ms of which 1 ms to minimize.
[2024-05-22 19:58:16] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 1 ms to minimize.
[2024-05-22 19:58:16] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 2 ms to minimize.
[2024-05-22 19:58:16] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 2 ms to minimize.
[2024-05-22 19:58:17] [INFO ] Deduced a trap composed of 70 places in 94 ms of which 1 ms to minimize.
[2024-05-22 19:58:17] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 2 ms to minimize.
[2024-05-22 19:58:17] [INFO ] Deduced a trap composed of 65 places in 112 ms of which 1 ms to minimize.
[2024-05-22 19:58:17] [INFO ] Deduced a trap composed of 60 places in 91 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 19:58:17] [INFO ] Deduced a trap composed of 63 places in 107 ms of which 1 ms to minimize.
[2024-05-22 19:58:17] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 2 ms to minimize.
[2024-05-22 19:58:17] [INFO ] Deduced a trap composed of 74 places in 105 ms of which 1 ms to minimize.
[2024-05-22 19:58:17] [INFO ] Deduced a trap composed of 80 places in 99 ms of which 1 ms to minimize.
[2024-05-22 19:58:17] [INFO ] Deduced a trap composed of 59 places in 90 ms of which 2 ms to minimize.
[2024-05-22 19:58:18] [INFO ] Deduced a trap composed of 69 places in 103 ms of which 1 ms to minimize.
[2024-05-22 19:58:18] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 1 ms to minimize.
[2024-05-22 19:58:18] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 2 ms to minimize.
[2024-05-22 19:58:18] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 9/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/223 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 221/444 variables, 223/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/444 variables, 38/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/444 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/444 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/449 variables, 5/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/449 variables, 2/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/449 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/449 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 449/449 variables, and 344 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3555 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 228/228 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 33/33 constraints]
After SMT, in 4786ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 26 ms.
Support contains 1 out of 228 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 228/228 places, 221/221 transitions.
Applied a total of 0 rules in 6 ms. Remains 228 /228 variables (removed 0) and now considering 221/221 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 228/228 places, 221/221 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 228/228 places, 221/221 transitions.
Applied a total of 0 rules in 6 ms. Remains 228 /228 variables (removed 0) and now considering 221/221 (removed 0) transitions.
[2024-05-22 19:58:18] [INFO ] Invariant cache hit.
[2024-05-22 19:58:19] [INFO ] Implicit Places using invariants in 358 ms returned [25, 46, 51, 73, 78, 98, 104, 125, 130, 150, 155, 176, 182]
[2024-05-22 19:58:19] [INFO ] Actually due to overlaps returned [25]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 362 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 227/228 places, 221/221 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 227 transition count 220
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 226 transition count 220
Applied a total of 2 rules in 10 ms. Remains 226 /227 variables (removed 1) and now considering 220/221 (removed 1) transitions.
// Phase 1: matrix 220 rows 226 cols
[2024-05-22 19:58:19] [INFO ] Computed 43 invariants in 10 ms
[2024-05-22 19:58:19] [INFO ] Implicit Places using invariants in 337 ms returned [44, 49, 71, 76, 96, 102, 123, 128, 148, 153, 174, 180]
[2024-05-22 19:58:19] [INFO ] Actually due to overlaps returned [49, 44]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 339 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 224/228 places, 220/221 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 224 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 223 transition count 219
Applied a total of 2 rules in 11 ms. Remains 223 /224 variables (removed 1) and now considering 219/220 (removed 1) transitions.
// Phase 1: matrix 219 rows 223 cols
[2024-05-22 19:58:19] [INFO ] Computed 41 invariants in 13 ms
[2024-05-22 19:58:19] [INFO ] Implicit Places using invariants in 269 ms returned [68, 73, 93, 99, 120, 125, 145, 150, 171, 177]
[2024-05-22 19:58:19] [INFO ] Actually due to overlaps returned [73, 68]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 283 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 221/228 places, 219/221 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 221 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 220 transition count 218
Applied a total of 2 rules in 24 ms. Remains 220 /221 variables (removed 1) and now considering 218/219 (removed 1) transitions.
// Phase 1: matrix 218 rows 220 cols
[2024-05-22 19:58:19] [INFO ] Computed 39 invariants in 9 ms
[2024-05-22 19:58:20] [INFO ] Implicit Places using invariants in 288 ms returned [90, 96, 117, 122, 142, 147, 168, 174]
[2024-05-22 19:58:20] [INFO ] Actually due to overlaps returned [96, 90]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 303 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 218/228 places, 218/221 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 218 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 217 transition count 217
Applied a total of 2 rules in 9 ms. Remains 217 /218 variables (removed 1) and now considering 217/218 (removed 1) transitions.
// Phase 1: matrix 217 rows 217 cols
[2024-05-22 19:58:20] [INFO ] Computed 37 invariants in 10 ms
[2024-05-22 19:58:20] [INFO ] Implicit Places using invariants in 247 ms returned [114, 119, 139, 144, 165, 171]
[2024-05-22 19:58:20] [INFO ] Actually due to overlaps returned [119, 114]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 255 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 215/228 places, 217/221 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 215 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 214 transition count 216
Applied a total of 2 rules in 9 ms. Remains 214 /215 variables (removed 1) and now considering 216/217 (removed 1) transitions.
// Phase 1: matrix 216 rows 214 cols
[2024-05-22 19:58:20] [INFO ] Computed 35 invariants in 10 ms
[2024-05-22 19:58:20] [INFO ] Implicit Places using invariants in 404 ms returned [136, 141, 162, 168]
[2024-05-22 19:58:20] [INFO ] Actually due to overlaps returned [141, 136]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 417 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 212/228 places, 216/221 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 212 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 211 transition count 215
Applied a total of 2 rules in 17 ms. Remains 211 /212 variables (removed 1) and now considering 215/216 (removed 1) transitions.
// Phase 1: matrix 215 rows 211 cols
[2024-05-22 19:58:20] [INFO ] Computed 33 invariants in 15 ms
[2024-05-22 19:58:21] [INFO ] Implicit Places using invariants in 250 ms returned [159, 165]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 251 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 209/228 places, 215/221 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 209 transition count 214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 208 transition count 214
Applied a total of 2 rules in 8 ms. Remains 208 /209 variables (removed 1) and now considering 214/215 (removed 1) transitions.
// Phase 1: matrix 214 rows 208 cols
[2024-05-22 19:58:21] [INFO ] Computed 31 invariants in 9 ms
[2024-05-22 19:58:21] [INFO ] Implicit Places using invariants in 225 ms returned []
[2024-05-22 19:58:21] [INFO ] Invariant cache hit.
[2024-05-22 19:58:21] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-22 19:58:23] [INFO ] Implicit Places using invariants and state equation in 1795 ms returned []
Implicit Place search using SMT with State Equation took 2041 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 208/228 places, 214/221 transitions.
Finished structural reductions in REACHABILITY mode , in 8 iterations and 4347 ms. Remains : 208/228 places, 214/221 transitions.
RANDOM walk for 40000 steps (5785 resets) in 72 ms. (547 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3738 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 936706 steps, run timeout after 3001 ms. (steps per millisecond=312 ) properties seen :0 out of 1
Probabilistic random walk after 936706 steps, saw 468462 distinct states, run finished after 3001 ms. (steps per millisecond=312 ) properties seen :0
[2024-05-22 19:58:26] [INFO ] Invariant cache hit.
[2024-05-22 19:58:26] [INFO ] State equation strengthened by 38 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) 100/101 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 48/149 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 54/203 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 19:58:26] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-05-22 19:58:26] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 1 ms to minimize.
[2024-05-22 19:58:26] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 2 ms to minimize.
[2024-05-22 19:58:26] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 214/417 variables, 203/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/417 variables, 38/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/417 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/422 variables, 5/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/422 variables, 2/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/422 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/422 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 281 constraints, problems are : Problem set: 0 solved, 1 unsolved in 611 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 100/101 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 48/149 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 19:58:26] [INFO ] Deduced a trap composed of 90 places in 78 ms of which 1 ms to minimize.
[2024-05-22 19:58:26] [INFO ] Deduced a trap composed of 93 places in 75 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 54/203 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 19:58:27] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 1 ms to minimize.
[2024-05-22 19:58:27] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 214/417 variables, 203/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/417 variables, 38/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/417 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/417 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/422 variables, 5/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/422 variables, 2/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/422 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/422 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 422/422 variables, and 286 constraints, problems are : Problem set: 0 solved, 1 unsolved in 709 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 1359ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 26 ms.
Support contains 1 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 208/208 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2024-05-22 19:58:27] [INFO ] Invariant cache hit.
[2024-05-22 19:58:27] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-22 19:58:27] [INFO ] Invariant cache hit.
[2024-05-22 19:58:27] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-22 19:58:29] [INFO ] Implicit Places using invariants and state equation in 1788 ms returned []
Implicit Place search using SMT with State Equation took 1957 ms to find 0 implicit places.
[2024-05-22 19:58:29] [INFO ] Redundant transitions in 1 ms returned []
Running 213 sub problems to find dead transitions.
[2024-05-22 19:58:29] [INFO ] Invariant cache hit.
[2024-05-22 19:58:29] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 1/208 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 214/422 variables, 208/239 constraints. Problems are: Problem set: 0 solved, 213 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 38/277 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (OVERLAPS) 0/422 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 277 constraints, problems are : Problem set: 0 solved, 213 unsolved in 8973 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 1/208 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 214/422 variables, 208/239 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 38/277 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 213/490 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 19:58:46] [INFO ] Deduced a trap composed of 81 places in 76 ms of which 2 ms to minimize.
[2024-05-22 19:58:46] [INFO ] Deduced a trap composed of 86 places in 95 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 2/492 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 19:58:54] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 0 ms to minimize.
[2024-05-22 19:58:54] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 0 ms to minimize.
[2024-05-22 19:58:58] [INFO ] Deduced a trap composed of 75 places in 69 ms of which 1 ms to minimize.
[2024-05-22 19:58:58] [INFO ] Deduced a trap composed of 87 places in 68 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 4/496 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 19:59:04] [INFO ] Deduced a trap composed of 83 places in 69 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/422 variables, 1/497 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 422/422 variables, and 497 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 7/7 constraints]
After SMT, in 39064ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 39067ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41052 ms. Remains : 208/208 places, 214/214 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 208 transition count 196
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 190 transition count 196
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 181 transition count 187
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 181 transition count 187
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 180 transition count 186
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 180 transition count 184
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 178 transition count 184
Applied a total of 60 rules in 24 ms. Remains 178 /208 variables (removed 30) and now considering 184/214 (removed 30) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 184 rows 178 cols
[2024-05-22 19:59:08] [INFO ] Computed 31 invariants in 8 ms
[2024-05-22 19:59:08] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-22 19:59:08] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-22 19:59:08] [INFO ] After 70ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-22 19:59:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 19:59:08] [INFO ] After 14ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 19:59:08] [INFO ] After 28ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-05-22 19:59:08] [INFO ] After 152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 187 ms.
RANDOM walk for 40000 steps (5820 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3673 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 923448 steps, run timeout after 3001 ms. (steps per millisecond=307 ) properties seen :0 out of 1
Probabilistic random walk after 923448 steps, saw 461826 distinct states, run finished after 3001 ms. (steps per millisecond=307 ) properties seen :0
// Phase 1: matrix 248 rows 255 cols
[2024-05-22 19:59:11] [INFO ] Computed 44 invariants in 15 ms
[2024-05-22 19:59:11] [INFO ] State equation strengthened by 24 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) 99/100 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 93/193 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 28/221 variables, 9/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 238/459 variables, 221/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/459 variables, 22/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/459 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 37/496 variables, 28/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/496 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/496 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/496 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/498 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/498 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/498 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 5/503 variables, 4/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/503 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/503 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/503 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 503/503 variables, and 323 constraints, problems are : Problem set: 0 solved, 1 unsolved in 355 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 255/255 constraints, ReadFeed: 24/24 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) 99/100 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 93/193 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 28/221 variables, 9/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 238/459 variables, 221/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/459 variables, 22/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/459 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 37/496 variables, 28/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/496 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/496 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/496 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/496 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/498 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/498 variables, 2/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/498 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 5/503 variables, 4/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/503 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/503 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/503 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 503/503 variables, and 324 constraints, problems are : Problem set: 0 solved, 1 unsolved in 236 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 255/255 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 632ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 29 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 27 times.
Iterating global reduction 1 with 27 rules applied. Total rules applied 29 place count 254 transition count 220
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 56 place count 227 transition count 220
Partial Free-agglomeration rule applied 28 times.
Drop transitions (Partial Free agglomeration) removed 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 84 place count 227 transition count 220
Applied a total of 84 rules in 27 ms. Remains 227 /255 variables (removed 28) and now considering 220/248 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 227/255 places, 220/248 transitions.
RANDOM walk for 40000 steps (5737 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3665 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 941695 steps, run timeout after 3001 ms. (steps per millisecond=313 ) properties seen :0 out of 1
Probabilistic random walk after 941695 steps, saw 470947 distinct states, run finished after 3001 ms. (steps per millisecond=313 ) properties seen :0
// Phase 1: matrix 220 rows 227 cols
[2024-05-22 19:59:15] [INFO ] Computed 44 invariants in 15 ms
[2024-05-22 19:59:15] [INFO ] State equation strengthened by 38 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) 79/80 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 19:59:15] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 114/194 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 28/222 variables, 9/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 220/442 variables, 222/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/442 variables, 38/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 19:59:15] [INFO ] Deduced a trap composed of 68 places in 90 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/442 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/442 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 5/447 variables, 5/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/447 variables, 2/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/447 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/447 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 447/447 variables, and 311 constraints, problems are : Problem set: 0 solved, 1 unsolved in 318 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 227/227 constraints, ReadFeed: 38/38 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) 79/80 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 114/194 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 28/222 variables, 9/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 220/442 variables, 222/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/442 variables, 38/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/442 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/442 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/447 variables, 5/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/447 variables, 2/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/447 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/447 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 447/447 variables, and 312 constraints, problems are : Problem set: 0 solved, 1 unsolved in 285 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 227/227 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 633ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 30 ms.
Support contains 1 out of 227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 4 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 227/227 places, 220/220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 4 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
[2024-05-22 19:59:16] [INFO ] Invariant cache hit.
[2024-05-22 19:59:16] [INFO ] Implicit Places using invariants in 283 ms returned [25, 46, 51, 72, 77, 97, 103, 124, 129, 149, 154, 175, 181]
[2024-05-22 19:59:16] [INFO ] Actually due to overlaps returned [25]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 284 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 226/227 places, 220/220 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 226 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 225 transition count 219
Applied a total of 2 rules in 8 ms. Remains 225 /226 variables (removed 1) and now considering 219/220 (removed 1) transitions.
// Phase 1: matrix 219 rows 225 cols
[2024-05-22 19:59:16] [INFO ] Computed 43 invariants in 9 ms
[2024-05-22 19:59:16] [INFO ] Implicit Places using invariants in 213 ms returned [44, 49, 70, 75, 95, 101, 122, 127, 147, 152, 173, 179]
[2024-05-22 19:59:16] [INFO ] Actually due to overlaps returned [49, 44]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 214 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 223/227 places, 219/220 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 223 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 222 transition count 218
Applied a total of 2 rules in 17 ms. Remains 222 /223 variables (removed 1) and now considering 218/219 (removed 1) transitions.
// Phase 1: matrix 218 rows 222 cols
[2024-05-22 19:59:16] [INFO ] Computed 41 invariants in 14 ms
[2024-05-22 19:59:16] [INFO ] Implicit Places using invariants in 214 ms returned [67, 72, 92, 98, 119, 124, 144, 149, 170, 176]
[2024-05-22 19:59:16] [INFO ] Actually due to overlaps returned [72, 67]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 216 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 220/227 places, 218/220 transitions.
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 220 transition count 218
Applied a total of 2 rules in 7 ms. Remains 220 /220 variables (removed 0) and now considering 218/218 (removed 0) transitions.
// Phase 1: matrix 218 rows 220 cols
[2024-05-22 19:59:16] [INFO ] Computed 39 invariants in 6 ms
[2024-05-22 19:59:17] [INFO ] Implicit Places using invariants in 285 ms returned [90, 96, 117, 122, 142, 147, 168, 174]
[2024-05-22 19:59:17] [INFO ] Actually due to overlaps returned [96, 90]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 296 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 218/227 places, 218/220 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 218 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 217 transition count 217
Applied a total of 2 rules in 11 ms. Remains 217 /218 variables (removed 1) and now considering 217/218 (removed 1) transitions.
// Phase 1: matrix 217 rows 217 cols
[2024-05-22 19:59:17] [INFO ] Computed 37 invariants in 9 ms
[2024-05-22 19:59:17] [INFO ] Implicit Places using invariants in 227 ms returned [114, 119, 139, 144, 165, 171]
[2024-05-22 19:59:17] [INFO ] Actually due to overlaps returned [119, 114]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 237 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 215/227 places, 217/220 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 215 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 214 transition count 216
Applied a total of 2 rules in 7 ms. Remains 214 /215 variables (removed 1) and now considering 216/217 (removed 1) transitions.
// Phase 1: matrix 216 rows 214 cols
[2024-05-22 19:59:17] [INFO ] Computed 35 invariants in 14 ms
[2024-05-22 19:59:17] [INFO ] Implicit Places using invariants in 193 ms returned [136, 141, 162, 168]
[2024-05-22 19:59:17] [INFO ] Actually due to overlaps returned [141, 136]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 193 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 212/227 places, 216/220 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 212 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 211 transition count 215
Applied a total of 2 rules in 6 ms. Remains 211 /212 variables (removed 1) and now considering 215/216 (removed 1) transitions.
// Phase 1: matrix 215 rows 211 cols
[2024-05-22 19:59:17] [INFO ] Computed 33 invariants in 13 ms
[2024-05-22 19:59:17] [INFO ] Implicit Places using invariants in 150 ms returned [159, 165]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 160 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 209/227 places, 215/220 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 209 transition count 214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 208 transition count 214
Applied a total of 2 rules in 6 ms. Remains 208 /209 variables (removed 1) and now considering 214/215 (removed 1) transitions.
// Phase 1: matrix 214 rows 208 cols
[2024-05-22 19:59:17] [INFO ] Computed 31 invariants in 10 ms
[2024-05-22 19:59:18] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-05-22 19:59:18] [INFO ] Invariant cache hit.
[2024-05-22 19:59:18] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-22 19:59:19] [INFO ] Implicit Places using invariants and state equation in 1732 ms returned []
Implicit Place search using SMT with State Equation took 1894 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 208/227 places, 214/220 transitions.
Finished structural reductions in REACHABILITY mode , in 8 iterations and 3562 ms. Remains : 208/227 places, 214/220 transitions.
RANDOM walk for 40000 steps (5740 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3662 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 937528 steps, run timeout after 3001 ms. (steps per millisecond=312 ) properties seen :0 out of 1
Probabilistic random walk after 937528 steps, saw 468870 distinct states, run finished after 3001 ms. (steps per millisecond=312 ) properties seen :0
[2024-05-22 19:59:22] [INFO ] Invariant cache hit.
[2024-05-22 19:59:22] [INFO ] State equation strengthened by 38 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) 124/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 19:59:22] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 24/149 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 19:59:22] [INFO ] Deduced a trap composed of 93 places in 61 ms of which 1 ms to minimize.
[2024-05-22 19:59:23] [INFO ] Deduced a trap composed of 93 places in 59 ms of which 1 ms to minimize.
[2024-05-22 19:59:23] [INFO ] Deduced a trap composed of 96 places in 58 ms of which 1 ms to minimize.
[2024-05-22 19:59:23] [INFO ] Deduced a trap composed of 84 places in 64 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 54/203 variables, 18/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 214/417 variables, 203/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/417 variables, 38/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/417 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 5/422 variables, 5/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/422 variables, 2/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/422 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/422 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 282 constraints, problems are : Problem set: 0 solved, 1 unsolved in 540 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 124/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 24/149 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 54/203 variables, 18/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 19:59:23] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 2 ms to minimize.
[2024-05-22 19:59:23] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
[2024-05-22 19:59:23] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 1 ms to minimize.
[2024-05-22 19:59:23] [INFO ] Deduced a trap composed of 52 places in 70 ms of which 1 ms to minimize.
[2024-05-22 19:59:23] [INFO ] Deduced a trap composed of 54 places in 69 ms of which 2 ms to minimize.
[2024-05-22 19:59:23] [INFO ] Deduced a trap composed of 55 places in 72 ms of which 1 ms to minimize.
[2024-05-22 19:59:23] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 2 ms to minimize.
[2024-05-22 19:59:23] [INFO ] Deduced a trap composed of 69 places in 77 ms of which 2 ms to minimize.
[2024-05-22 19:59:24] [INFO ] Deduced a trap composed of 65 places in 74 ms of which 2 ms to minimize.
[2024-05-22 19:59:24] [INFO ] Deduced a trap composed of 57 places in 74 ms of which 2 ms to minimize.
[2024-05-22 19:59:24] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 1 ms to minimize.
[2024-05-22 19:59:24] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 2 ms to minimize.
[2024-05-22 19:59:24] [INFO ] Deduced a trap composed of 61 places in 72 ms of which 2 ms to minimize.
[2024-05-22 19:59:24] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 2 ms to minimize.
[2024-05-22 19:59:24] [INFO ] Deduced a trap composed of 59 places in 72 ms of which 2 ms to minimize.
[2024-05-22 19:59:24] [INFO ] Deduced a trap composed of 69 places in 71 ms of which 1 ms to minimize.
[2024-05-22 19:59:24] [INFO ] Deduced a trap composed of 61 places in 70 ms of which 2 ms to minimize.
[2024-05-22 19:59:24] [INFO ] Deduced a trap composed of 62 places in 69 ms of which 1 ms to minimize.
[2024-05-22 19:59:24] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2024-05-22 19:59:24] [INFO ] Deduced a trap composed of 65 places in 76 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 19:59:24] [INFO ] Deduced a trap composed of 67 places in 67 ms of which 1 ms to minimize.
[2024-05-22 19:59:25] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 1 ms to minimize.
[2024-05-22 19:59:25] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
[2024-05-22 19:59:25] [INFO ] Deduced a trap composed of 69 places in 79 ms of which 1 ms to minimize.
[2024-05-22 19:59:25] [INFO ] Deduced a trap composed of 62 places in 76 ms of which 1 ms to minimize.
[2024-05-22 19:59:25] [INFO ] Deduced a trap composed of 62 places in 74 ms of which 2 ms to minimize.
[2024-05-22 19:59:25] [INFO ] Deduced a trap composed of 67 places in 76 ms of which 1 ms to minimize.
[2024-05-22 19:59:25] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 1 ms to minimize.
[2024-05-22 19:59:25] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2024-05-22 19:59:25] [INFO ] Deduced a trap composed of 59 places in 79 ms of which 1 ms to minimize.
[2024-05-22 19:59:25] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 2 ms to minimize.
[2024-05-22 19:59:25] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
[2024-05-22 19:59:25] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 13/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 214/417 variables, 203/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/417 variables, 38/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/417 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 19:59:26] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/417 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/417 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 5/422 variables, 5/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/422 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/422 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/422 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 422/422 variables, and 317 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3243 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 39/39 constraints]
After SMT, in 3788ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 43 ms.
Support contains 1 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 208/208 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2024-05-22 19:59:26] [INFO ] Invariant cache hit.
[2024-05-22 19:59:26] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-22 19:59:26] [INFO ] Invariant cache hit.
[2024-05-22 19:59:26] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-22 19:59:28] [INFO ] Implicit Places using invariants and state equation in 1702 ms returned []
Implicit Place search using SMT with State Equation took 1841 ms to find 0 implicit places.
[2024-05-22 19:59:28] [INFO ] Redundant transitions in 1 ms returned []
Running 213 sub problems to find dead transitions.
[2024-05-22 19:59:28] [INFO ] Invariant cache hit.
[2024-05-22 19:59:28] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 1/208 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 214/422 variables, 208/239 constraints. Problems are: Problem set: 0 solved, 213 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 38/277 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (OVERLAPS) 0/422 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 277 constraints, problems are : Problem set: 0 solved, 213 unsolved in 9155 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 1/208 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 214/422 variables, 208/239 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 38/277 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 213/490 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 19:59:54] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 2 ms to minimize.
[2024-05-22 19:59:54] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 1 ms to minimize.
[2024-05-22 19:59:54] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 1 ms to minimize.
[2024-05-22 19:59:55] [INFO ] Deduced a trap composed of 55 places in 93 ms of which 1 ms to minimize.
[2024-05-22 19:59:55] [INFO ] Deduced a trap composed of 63 places in 79 ms of which 2 ms to minimize.
[2024-05-22 19:59:55] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 2 ms to minimize.
[2024-05-22 19:59:55] [INFO ] Deduced a trap composed of 63 places in 78 ms of which 1 ms to minimize.
[2024-05-22 19:59:56] [INFO ] Deduced a trap composed of 65 places in 74 ms of which 1 ms to minimize.
[2024-05-22 19:59:56] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2024-05-22 19:59:56] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 2 ms to minimize.
[2024-05-22 19:59:56] [INFO ] Deduced a trap composed of 63 places in 75 ms of which 1 ms to minimize.
[2024-05-22 19:59:56] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2024-05-22 19:59:56] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 2 ms to minimize.
[2024-05-22 19:59:57] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 2 ms to minimize.
[2024-05-22 19:59:57] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 1 ms to minimize.
[2024-05-22 19:59:57] [INFO ] Deduced a trap composed of 66 places in 88 ms of which 1 ms to minimize.
[2024-05-22 19:59:57] [INFO ] Deduced a trap composed of 76 places in 77 ms of which 1 ms to minimize.
[2024-05-22 19:59:57] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-05-22 19:59:57] [INFO ] Deduced a trap composed of 82 places in 60 ms of which 1 ms to minimize.
[2024-05-22 19:59:57] [INFO ] Deduced a trap composed of 71 places in 62 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/422 variables, 20/510 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 20:00:01] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-22 20:00:02] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 4 ms to minimize.
[2024-05-22 20:00:03] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-22 20:00:03] [INFO ] Deduced a trap composed of 53 places in 65 ms of which 1 ms to minimize.
[2024-05-22 20:00:03] [INFO ] Deduced a trap composed of 74 places in 79 ms of which 1 ms to minimize.
[2024-05-22 20:00:04] [INFO ] Deduced a trap composed of 96 places in 85 ms of which 1 ms to minimize.
[2024-05-22 20:00:04] [INFO ] Deduced a trap composed of 98 places in 79 ms of which 1 ms to minimize.
[2024-05-22 20:00:05] [INFO ] Deduced a trap composed of 102 places in 69 ms of which 1 ms to minimize.
[2024-05-22 20:00:05] [INFO ] Deduced a trap composed of 98 places in 67 ms of which 1 ms to minimize.
[2024-05-22 20:00:05] [INFO ] Deduced a trap composed of 99 places in 77 ms of which 1 ms to minimize.
[2024-05-22 20:00:05] [INFO ] Deduced a trap composed of 99 places in 59 ms of which 1 ms to minimize.
[2024-05-22 20:00:05] [INFO ] Deduced a trap composed of 100 places in 53 ms of which 1 ms to minimize.
[2024-05-22 20:00:05] [INFO ] Deduced a trap composed of 100 places in 63 ms of which 1 ms to minimize.
[2024-05-22 20:00:05] [INFO ] Deduced a trap composed of 104 places in 75 ms of which 1 ms to minimize.
[2024-05-22 20:00:05] [INFO ] Deduced a trap composed of 102 places in 58 ms of which 1 ms to minimize.
[2024-05-22 20:00:05] [INFO ] Deduced a trap composed of 104 places in 72 ms of which 1 ms to minimize.
[2024-05-22 20:00:05] [INFO ] Deduced a trap composed of 106 places in 71 ms of which 1 ms to minimize.
[2024-05-22 20:00:06] [INFO ] Deduced a trap composed of 100 places in 74 ms of which 1 ms to minimize.
[2024-05-22 20:00:06] [INFO ] Deduced a trap composed of 98 places in 78 ms of which 1 ms to minimize.
[2024-05-22 20:00:06] [INFO ] Deduced a trap composed of 87 places in 73 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/422 variables, 20/530 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 422/422 variables, and 530 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 40/40 constraints]
After SMT, in 39251ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 39253ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41105 ms. Remains : 208/208 places, 214/214 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 208 transition count 197
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 191 transition count 197
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 182 transition count 188
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 182 transition count 188
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 181 transition count 187
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 181 transition count 185
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 179 transition count 185
Applied a total of 58 rules in 12 ms. Remains 179 /208 variables (removed 29) and now considering 185/214 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 185 rows 179 cols
[2024-05-22 20:00:07] [INFO ] Computed 31 invariants in 12 ms
[2024-05-22 20:00:07] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-22 20:00:07] [INFO ] [Real]Absence check using 5 positive and 26 generalized place invariants in 15 ms returned sat
[2024-05-22 20:00:07] [INFO ] After 86ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-22 20:00:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 20:00:07] [INFO ] After 8ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 20:00:07] [INFO ] After 21ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-05-22 20:00:07] [INFO ] After 177ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 205 ms.
RANDOM walk for 40000 steps (5721 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3698 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 926250 steps, run timeout after 3001 ms. (steps per millisecond=308 ) properties seen :0 out of 1
Probabilistic random walk after 926250 steps, saw 463232 distinct states, run finished after 3001 ms. (steps per millisecond=308 ) properties seen :0
// Phase 1: matrix 248 rows 255 cols
[2024-05-22 20:00:10] [INFO ] Computed 44 invariants in 15 ms
[2024-05-22 20:00:10] [INFO ] State equation strengthened by 24 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) 99/100 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 93/193 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 28/221 variables, 9/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 238/459 variables, 221/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/459 variables, 22/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/459 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 37/496 variables, 28/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/496 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/496 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/496 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/498 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/498 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/498 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 5/503 variables, 4/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/503 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/503 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/503 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 503/503 variables, and 323 constraints, problems are : Problem set: 0 solved, 1 unsolved in 296 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 255/255 constraints, ReadFeed: 24/24 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) 99/100 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 93/193 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 28/221 variables, 9/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 238/459 variables, 221/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/459 variables, 22/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/459 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 37/496 variables, 28/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/496 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/496 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/496 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/496 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/498 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/498 variables, 2/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/498 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 5/503 variables, 4/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/503 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/503 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/503 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 503/503 variables, and 324 constraints, problems are : Problem set: 0 solved, 1 unsolved in 280 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 255/255 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 611ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 37 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 25 times.
Iterating global reduction 1 with 25 rules applied. Total rules applied 27 place count 254 transition count 222
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 52 place count 229 transition count 222
Partial Free-agglomeration rule applied 29 times.
Drop transitions (Partial Free agglomeration) removed 29 transitions
Iterating global reduction 2 with 29 rules applied. Total rules applied 81 place count 229 transition count 222
Applied a total of 81 rules in 12 ms. Remains 229 /255 variables (removed 26) and now considering 222/248 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 229/255 places, 222/248 transitions.
RANDOM walk for 40000 steps (5791 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3618 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 923582 steps, run timeout after 3001 ms. (steps per millisecond=307 ) properties seen :0 out of 1
Probabilistic random walk after 923582 steps, saw 461892 distinct states, run finished after 3002 ms. (steps per millisecond=307 ) properties seen :0
// Phase 1: matrix 222 rows 229 cols
[2024-05-22 20:00:14] [INFO ] Computed 44 invariants in 20 ms
[2024-05-22 20:00:14] [INFO ] State equation strengthened by 38 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) 133/134 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 20:00:14] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 29/163 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 61/224 variables, 24/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 20:00:14] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2024-05-22 20:00:14] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 1 ms to minimize.
[2024-05-22 20:00:15] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2024-05-22 20:00:15] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 2 ms to minimize.
[2024-05-22 20:00:15] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 2 ms to minimize.
[2024-05-22 20:00:15] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-22 20:00:15] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 1 ms to minimize.
[2024-05-22 20:00:15] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 5 ms to minimize.
[2024-05-22 20:00:15] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-22 20:00:15] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 1 ms to minimize.
[2024-05-22 20:00:15] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2024-05-22 20:00:15] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-22 20:00:15] [INFO ] Deduced a trap composed of 47 places in 78 ms of which 1 ms to minimize.
[2024-05-22 20:00:15] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 1 ms to minimize.
[2024-05-22 20:00:15] [INFO ] Deduced a trap composed of 49 places in 84 ms of which 2 ms to minimize.
[2024-05-22 20:00:16] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-05-22 20:00:16] [INFO ] Deduced a trap composed of 50 places in 66 ms of which 1 ms to minimize.
[2024-05-22 20:00:16] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 18/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 222/446 variables, 224/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/446 variables, 38/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/446 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/451 variables, 5/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/451 variables, 2/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/451 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/451 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 451/451 variables, and 330 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1741 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 229/229 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 133/134 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 29/163 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 61/224 variables, 24/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 18/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 222/446 variables, 224/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/446 variables, 38/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/446 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/446 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/451 variables, 5/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/451 variables, 2/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/451 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/451 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 451/451 variables, and 331 constraints, problems are : Problem set: 0 solved, 1 unsolved in 366 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 229/229 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 19/19 constraints]
After SMT, in 2156ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 34 ms.
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 222/222 transitions.
Applied a total of 0 rules in 3 ms. Remains 229 /229 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 229/229 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 222/222 transitions.
Applied a total of 0 rules in 3 ms. Remains 229 /229 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2024-05-22 20:00:16] [INFO ] Invariant cache hit.
[2024-05-22 20:00:17] [INFO ] Implicit Places using invariants in 229 ms returned [25, 45, 73, 78, 99, 105, 126, 131, 151, 156, 177, 183]
[2024-05-22 20:00:17] [INFO ] Actually due to overlaps returned [78, 25, 73]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 247 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 226/229 places, 222/222 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 226 transition count 220
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 224 transition count 220
Applied a total of 4 rules in 6 ms. Remains 224 /226 variables (removed 2) and now considering 220/222 (removed 2) transitions.
// Phase 1: matrix 220 rows 224 cols
[2024-05-22 20:00:17] [INFO ] Computed 41 invariants in 7 ms
[2024-05-22 20:00:17] [INFO ] Implicit Places using invariants in 171 ms returned [43, 94, 100, 121, 126, 146, 151, 172, 178]
[2024-05-22 20:00:17] [INFO ] Actually due to overlaps returned [100, 43, 94]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 197 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 221/229 places, 220/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 221 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 220 transition count 219
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 220 transition count 219
Applied a total of 3 rules in 21 ms. Remains 220 /221 variables (removed 1) and now considering 219/220 (removed 1) transitions.
// Phase 1: matrix 219 rows 220 cols
[2024-05-22 20:00:17] [INFO ] Computed 38 invariants in 9 ms
[2024-05-22 20:00:17] [INFO ] Implicit Places using invariants in 196 ms returned [117, 122, 142, 147, 168, 174]
[2024-05-22 20:00:17] [INFO ] Actually due to overlaps returned [122, 117]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 212 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 218/229 places, 219/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 218 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 217 transition count 218
Applied a total of 2 rules in 6 ms. Remains 217 /218 variables (removed 1) and now considering 218/219 (removed 1) transitions.
// Phase 1: matrix 218 rows 217 cols
[2024-05-22 20:00:17] [INFO ] Computed 36 invariants in 11 ms
[2024-05-22 20:00:17] [INFO ] Implicit Places using invariants in 148 ms returned [139, 144, 165, 171]
[2024-05-22 20:00:17] [INFO ] Actually due to overlaps returned [144, 139]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 165 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 215/229 places, 218/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 215 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 214 transition count 217
Applied a total of 2 rules in 6 ms. Remains 214 /215 variables (removed 1) and now considering 217/218 (removed 1) transitions.
// Phase 1: matrix 217 rows 214 cols
[2024-05-22 20:00:17] [INFO ] Computed 34 invariants in 11 ms
[2024-05-22 20:00:17] [INFO ] Implicit Places using invariants in 143 ms returned [162, 168]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 163 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 212/229 places, 217/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 212 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 211 transition count 216
Applied a total of 2 rules in 6 ms. Remains 211 /212 variables (removed 1) and now considering 216/217 (removed 1) transitions.
// Phase 1: matrix 216 rows 211 cols
[2024-05-22 20:00:17] [INFO ] Computed 32 invariants in 9 ms
[2024-05-22 20:00:18] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-22 20:00:18] [INFO ] Invariant cache hit.
[2024-05-22 20:00:18] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-22 20:00:19] [INFO ] Implicit Places using invariants and state equation in 1076 ms returned []
Implicit Place search using SMT with State Equation took 1253 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 211/229 places, 216/222 transitions.
Finished structural reductions in REACHABILITY mode , in 6 iterations and 2287 ms. Remains : 211/229 places, 216/222 transitions.
RANDOM walk for 40000 steps (5777 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3716 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 950540 steps, run timeout after 3001 ms. (steps per millisecond=316 ) properties seen :0 out of 1
Probabilistic random walk after 950540 steps, saw 475370 distinct states, run finished after 3001 ms. (steps per millisecond=316 ) properties seen :0
[2024-05-22 20:00:22] [INFO ] Invariant cache hit.
[2024-05-22 20:00:22] [INFO ] State equation strengthened by 38 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) 129/130 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/152 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 54/206 variables, 18/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 20:00:22] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 1 ms to minimize.
[2024-05-22 20:00:22] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 1 ms to minimize.
[2024-05-22 20:00:22] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 2 ms to minimize.
[2024-05-22 20:00:22] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 216/422 variables, 206/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 38/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/422 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/427 variables, 5/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/427 variables, 2/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/427 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/427 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 427/427 variables, and 285 constraints, problems are : Problem set: 0 solved, 1 unsolved in 636 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 211/211 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 129/130 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/152 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 54/206 variables, 18/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 216/422 variables, 206/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 38/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/422 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/422 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/427 variables, 5/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/427 variables, 2/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/427 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/427 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 427/427 variables, and 286 constraints, problems are : Problem set: 0 solved, 1 unsolved in 200 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 211/211 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 884ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 32 ms.
Support contains 1 out of 211 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 216/216 transitions.
Applied a total of 0 rules in 7 ms. Remains 211 /211 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 211/211 places, 216/216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 216/216 transitions.
Applied a total of 0 rules in 6 ms. Remains 211 /211 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-22 20:00:23] [INFO ] Invariant cache hit.
[2024-05-22 20:00:23] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-22 20:00:23] [INFO ] Invariant cache hit.
[2024-05-22 20:00:23] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-22 20:00:24] [INFO ] Implicit Places using invariants and state equation in 1072 ms returned []
Implicit Place search using SMT with State Equation took 1235 ms to find 0 implicit places.
[2024-05-22 20:00:24] [INFO ] Redundant transitions in 1 ms returned []
Running 215 sub problems to find dead transitions.
[2024-05-22 20:00:24] [INFO ] Invariant cache hit.
[2024-05-22 20:00:24] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 1/211 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (OVERLAPS) 216/427 variables, 211/243 constraints. Problems are: Problem set: 0 solved, 215 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/427 variables, 38/281 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/427 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (OVERLAPS) 0/427 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 427/427 variables, and 281 constraints, problems are : Problem set: 0 solved, 215 unsolved in 9277 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 211/211 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 1/211 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (OVERLAPS) 216/427 variables, 211/243 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/427 variables, 38/281 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/427 variables, 215/496 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-05-22 20:00:41] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2024-05-22 20:00:42] [INFO ] Deduced a trap composed of 88 places in 67 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/427 variables, 2/498 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-05-22 20:00:47] [INFO ] Deduced a trap composed of 77 places in 77 ms of which 2 ms to minimize.
[2024-05-22 20:00:47] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 2 ms to minimize.
[2024-05-22 20:00:47] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-05-22 20:00:47] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 1 ms to minimize.
[2024-05-22 20:00:47] [INFO ] Deduced a trap composed of 45 places in 74 ms of which 1 ms to minimize.
[2024-05-22 20:00:47] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 2 ms to minimize.
[2024-05-22 20:00:47] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 1 ms to minimize.
[2024-05-22 20:00:47] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 3 ms to minimize.
[2024-05-22 20:00:48] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2024-05-22 20:00:48] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 1 ms to minimize.
[2024-05-22 20:00:48] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-05-22 20:00:48] [INFO ] Deduced a trap composed of 59 places in 78 ms of which 1 ms to minimize.
[2024-05-22 20:00:48] [INFO ] Deduced a trap composed of 59 places in 77 ms of which 1 ms to minimize.
[2024-05-22 20:00:49] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 2 ms to minimize.
[2024-05-22 20:00:49] [INFO ] Deduced a trap composed of 72 places in 74 ms of which 4 ms to minimize.
[2024-05-22 20:00:49] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2024-05-22 20:00:49] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-05-22 20:00:49] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 2 ms to minimize.
[2024-05-22 20:00:49] [INFO ] Deduced a trap composed of 65 places in 69 ms of which 1 ms to minimize.
[2024-05-22 20:00:49] [INFO ] Deduced a trap composed of 59 places in 74 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/427 variables, 20/518 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-05-22 20:00:55] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 0 ms to minimize.
[2024-05-22 20:00:55] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/427 variables, 2/520 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 427/427 variables, and 520 constraints, problems are : Problem set: 0 solved, 215 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 211/211 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 24/24 constraints]
After SMT, in 39372ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 39393ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40640 ms. Remains : 211/211 places, 216/216 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 211 transition count 198
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 193 transition count 198
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 185 transition count 190
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 185 transition count 190
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 184 transition count 189
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 184 transition count 187
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 182 transition count 187
Applied a total of 58 rules in 13 ms. Remains 182 /211 variables (removed 29) and now considering 187/216 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 187 rows 182 cols
[2024-05-22 20:01:03] [INFO ] Computed 32 invariants in 6 ms
[2024-05-22 20:01:03] [INFO ] [Real]Absence check using 7 positive place invariants in 35 ms returned sat
[2024-05-22 20:01:03] [INFO ] [Real]Absence check using 7 positive and 25 generalized place invariants in 5 ms returned sat
[2024-05-22 20:01:04] [INFO ] After 104ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-22 20:01:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 20:01:04] [INFO ] After 7ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 20:01:04] [INFO ] After 17ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-05-22 20:01:04] [INFO ] After 279ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 306 ms.
RANDOM walk for 40000 steps (5754 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3655 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 924546 steps, run timeout after 3001 ms. (steps per millisecond=308 ) properties seen :0 out of 1
Probabilistic random walk after 924546 steps, saw 462375 distinct states, run finished after 3001 ms. (steps per millisecond=308 ) properties seen :0
// Phase 1: matrix 248 rows 255 cols
[2024-05-22 20:01:07] [INFO ] Computed 44 invariants in 17 ms
[2024-05-22 20:01:07] [INFO ] State equation strengthened by 24 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) 106/107 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 86/193 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 28/221 variables, 9/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 238/459 variables, 221/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/459 variables, 22/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/459 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 37/496 variables, 28/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/496 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/496 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/496 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/498 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/498 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/498 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 5/503 variables, 4/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/503 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/503 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/503 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 503/503 variables, and 323 constraints, problems are : Problem set: 0 solved, 1 unsolved in 381 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 255/255 constraints, ReadFeed: 24/24 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) 106/107 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 86/193 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 28/221 variables, 9/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 238/459 variables, 221/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/459 variables, 22/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/459 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/459 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 37/496 variables, 28/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/496 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/496 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/496 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/498 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/498 variables, 2/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/498 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 5/503 variables, 4/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/503 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/503 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/503 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 503/503 variables, and 324 constraints, problems are : Problem set: 0 solved, 1 unsolved in 444 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 255/255 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 880ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 27 times.
Iterating global reduction 1 with 27 rules applied. Total rules applied 29 place count 254 transition count 220
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 56 place count 227 transition count 220
Partial Free-agglomeration rule applied 28 times.
Drop transitions (Partial Free agglomeration) removed 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 84 place count 227 transition count 220
Applied a total of 84 rules in 12 ms. Remains 227 /255 variables (removed 28) and now considering 220/248 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 227/255 places, 220/248 transitions.
RANDOM walk for 40000 steps (5721 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3605 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 933308 steps, run timeout after 3001 ms. (steps per millisecond=310 ) properties seen :0 out of 1
Probabilistic random walk after 933308 steps, saw 466757 distinct states, run finished after 3001 ms. (steps per millisecond=310 ) properties seen :0
// Phase 1: matrix 220 rows 227 cols
[2024-05-22 20:01:11] [INFO ] Computed 44 invariants in 16 ms
[2024-05-22 20:01:11] [INFO ] State equation strengthened by 38 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) 30/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/184 variables, 29/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 20:01:11] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 1 ms to minimize.
[2024-05-22 20:01:11] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 1 ms to minimize.
[2024-05-22 20:01:11] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 1 ms to minimize.
[2024-05-22 20:01:11] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 2 ms to minimize.
[2024-05-22 20:01:11] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2024-05-22 20:01:11] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 1 ms to minimize.
[2024-05-22 20:01:11] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 1 ms to minimize.
[2024-05-22 20:01:11] [INFO ] Deduced a trap composed of 49 places in 99 ms of which 1 ms to minimize.
[2024-05-22 20:01:11] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2024-05-22 20:01:12] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
[2024-05-22 20:01:12] [INFO ] Deduced a trap composed of 88 places in 76 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 11/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 36/220 variables, 11/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 20:01:12] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 1 ms to minimize.
[2024-05-22 20:01:12] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/220 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/222 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 220/442 variables, 222/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/442 variables, 38/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/442 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/447 variables, 5/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/447 variables, 2/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/447 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/447 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 447/447 variables, and 322 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1480 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 227/227 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 13/13 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) 30/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/184 variables, 29/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 11/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 20:01:12] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-05-22 20:01:12] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-05-22 20:01:12] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 36/220 variables, 11/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/220 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 20:01:12] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-22 20:01:12] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/220 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/220 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/222 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 220/442 variables, 222/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/442 variables, 38/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/442 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/442 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 5/447 variables, 5/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/447 variables, 2/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/447 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/447 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 447/447 variables, and 328 constraints, problems are : Problem set: 0 solved, 1 unsolved in 645 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 227/227 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 18/18 constraints]
After SMT, in 2164ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 1 out of 227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 3 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 227/227 places, 220/220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 3 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
[2024-05-22 20:01:13] [INFO ] Invariant cache hit.
[2024-05-22 20:01:13] [INFO ] Implicit Places using invariants in 236 ms returned [25, 51, 72, 77, 97, 103, 124, 129, 149, 154, 175, 181]
[2024-05-22 20:01:13] [INFO ] Actually due to overlaps returned [25]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 252 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 226/227 places, 220/220 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 226 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 225 transition count 219
Applied a total of 2 rules in 6 ms. Remains 225 /226 variables (removed 1) and now considering 219/220 (removed 1) transitions.
// Phase 1: matrix 219 rows 225 cols
[2024-05-22 20:01:13] [INFO ] Computed 43 invariants in 6 ms
[2024-05-22 20:01:13] [INFO ] Implicit Places using invariants in 247 ms returned [49, 70, 75, 95, 101, 122, 127, 147, 152, 173, 179]
[2024-05-22 20:01:13] [INFO ] Actually due to overlaps returned [49]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 261 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 224/227 places, 219/220 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 224 transition count 219
Applied a total of 1 rules in 6 ms. Remains 224 /224 variables (removed 0) and now considering 219/219 (removed 0) transitions.
// Phase 1: matrix 219 rows 224 cols
[2024-05-22 20:01:13] [INFO ] Computed 42 invariants in 9 ms
[2024-05-22 20:01:14] [INFO ] Implicit Places using invariants in 287 ms returned [69, 74, 94, 100, 121, 126, 146, 151, 172, 178]
[2024-05-22 20:01:14] [INFO ] Actually due to overlaps returned [74, 69]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 300 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 222/227 places, 219/220 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 222 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 221 transition count 218
Applied a total of 2 rules in 12 ms. Remains 221 /222 variables (removed 1) and now considering 218/219 (removed 1) transitions.
// Phase 1: matrix 218 rows 221 cols
[2024-05-22 20:01:14] [INFO ] Computed 40 invariants in 8 ms
[2024-05-22 20:01:14] [INFO ] Implicit Places using invariants in 180 ms returned [91, 97, 118, 123, 143, 148, 169, 175]
[2024-05-22 20:01:14] [INFO ] Actually due to overlaps returned [97, 91]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 206 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 219/227 places, 218/220 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 219 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 218 transition count 217
Applied a total of 2 rules in 6 ms. Remains 218 /219 variables (removed 1) and now considering 217/218 (removed 1) transitions.
// Phase 1: matrix 217 rows 218 cols
[2024-05-22 20:01:14] [INFO ] Computed 38 invariants in 10 ms
[2024-05-22 20:01:14] [INFO ] Implicit Places using invariants in 198 ms returned [115, 120, 140, 145, 166, 172]
[2024-05-22 20:01:14] [INFO ] Actually due to overlaps returned [120, 115]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 209 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 216/227 places, 217/220 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 216 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 215 transition count 216
Applied a total of 2 rules in 10 ms. Remains 215 /216 variables (removed 1) and now considering 216/217 (removed 1) transitions.
// Phase 1: matrix 216 rows 215 cols
[2024-05-22 20:01:14] [INFO ] Computed 36 invariants in 8 ms
[2024-05-22 20:01:14] [INFO ] Implicit Places using invariants in 163 ms returned [137, 142, 163, 169]
[2024-05-22 20:01:14] [INFO ] Actually due to overlaps returned [142, 137]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 173 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 213/227 places, 216/220 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 213 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 212 transition count 215
Applied a total of 2 rules in 6 ms. Remains 212 /213 variables (removed 1) and now considering 215/216 (removed 1) transitions.
// Phase 1: matrix 215 rows 212 cols
[2024-05-22 20:01:14] [INFO ] Computed 34 invariants in 7 ms
[2024-05-22 20:01:14] [INFO ] Implicit Places using invariants in 189 ms returned [160, 166]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 192 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 210/227 places, 215/220 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 210 transition count 214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 209 transition count 214
Applied a total of 2 rules in 6 ms. Remains 209 /210 variables (removed 1) and now considering 214/215 (removed 1) transitions.
// Phase 1: matrix 214 rows 209 cols
[2024-05-22 20:01:14] [INFO ] Computed 32 invariants in 9 ms
[2024-05-22 20:01:14] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-05-22 20:01:15] [INFO ] Invariant cache hit.
[2024-05-22 20:01:15] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-22 20:01:16] [INFO ] Implicit Places using invariants and state equation in 1237 ms returned []
Implicit Place search using SMT with State Equation took 1426 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 209/227 places, 214/220 transitions.
Finished structural reductions in REACHABILITY mode , in 8 iterations and 3075 ms. Remains : 209/227 places, 214/220 transitions.
RANDOM walk for 40000 steps (5795 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3611 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 936909 steps, run timeout after 3001 ms. (steps per millisecond=312 ) properties seen :0 out of 1
Probabilistic random walk after 936909 steps, saw 468563 distinct states, run finished after 3001 ms. (steps per millisecond=312 ) properties seen :0
[2024-05-22 20:01:19] [INFO ] Invariant cache hit.
[2024-05-22 20:01:19] [INFO ] State equation strengthened by 38 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) 82/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/150 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 54/204 variables, 18/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 20:01:19] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 214/418 variables, 204/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/418 variables, 38/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/418 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/423 variables, 5/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 2/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/423 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 280 constraints, problems are : Problem set: 0 solved, 1 unsolved in 331 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 209/209 constraints, ReadFeed: 38/38 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) 82/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/150 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 20:01:19] [INFO ] Deduced a trap composed of 100 places in 63 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 54/204 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 214/418 variables, 204/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/418 variables, 38/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/418 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 20:01:20] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/418 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/418 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/423 variables, 5/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/423 variables, 2/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/423 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/423 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 423/423 variables, and 283 constraints, problems are : Problem set: 0 solved, 1 unsolved in 467 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 209/209 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 839ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 23 ms.
Support contains 1 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 209/209 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2024-05-22 20:01:20] [INFO ] Invariant cache hit.
[2024-05-22 20:01:20] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-22 20:01:20] [INFO ] Invariant cache hit.
[2024-05-22 20:01:20] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-22 20:01:21] [INFO ] Implicit Places using invariants and state equation in 1230 ms returned []
Implicit Place search using SMT with State Equation took 1374 ms to find 0 implicit places.
[2024-05-22 20:01:21] [INFO ] Redundant transitions in 2 ms returned []
Running 213 sub problems to find dead transitions.
[2024-05-22 20:01:21] [INFO ] Invariant cache hit.
[2024-05-22 20:01:21] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 1/209 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 214/423 variables, 209/241 constraints. Problems are: Problem set: 0 solved, 213 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/423 variables, 38/279 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/423 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (OVERLAPS) 0/423 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 279 constraints, problems are : Problem set: 0 solved, 213 unsolved in 9215 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 209/209 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 1/209 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 214/423 variables, 209/241 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/423 variables, 38/279 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/423 variables, 213/492 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 20:01:38] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-22 20:01:39] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-22 20:01:39] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-22 20:01:39] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 0 ms to minimize.
[2024-05-22 20:01:39] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-05-22 20:01:44] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-05-22 20:01:44] [INFO ] Deduced a trap composed of 58 places in 93 ms of which 2 ms to minimize.
[2024-05-22 20:01:44] [INFO ] Deduced a trap composed of 63 places in 96 ms of which 1 ms to minimize.
[2024-05-22 20:01:44] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 1 ms to minimize.
[2024-05-22 20:01:44] [INFO ] Deduced a trap composed of 66 places in 104 ms of which 2 ms to minimize.
[2024-05-22 20:01:44] [INFO ] Deduced a trap composed of 64 places in 110 ms of which 1 ms to minimize.
[2024-05-22 20:01:45] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 1 ms to minimize.
[2024-05-22 20:01:45] [INFO ] Deduced a trap composed of 66 places in 86 ms of which 2 ms to minimize.
[2024-05-22 20:01:45] [INFO ] Deduced a trap composed of 65 places in 90 ms of which 1 ms to minimize.
[2024-05-22 20:01:45] [INFO ] Deduced a trap composed of 71 places in 84 ms of which 2 ms to minimize.
[2024-05-22 20:01:45] [INFO ] Deduced a trap composed of 71 places in 76 ms of which 1 ms to minimize.
[2024-05-22 20:01:45] [INFO ] Deduced a trap composed of 75 places in 77 ms of which 1 ms to minimize.
[2024-05-22 20:01:45] [INFO ] Deduced a trap composed of 75 places in 82 ms of which 1 ms to minimize.
[2024-05-22 20:01:45] [INFO ] Deduced a trap composed of 69 places in 91 ms of which 1 ms to minimize.
[2024-05-22 20:01:46] [INFO ] Deduced a trap composed of 76 places in 69 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/423 variables, 20/512 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 20:01:50] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 423/423 variables, and 513 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 209/209 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 21/21 constraints]
After SMT, in 39317ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 39320ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40707 ms. Remains : 209/209 places, 214/214 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 209 transition count 196
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 191 transition count 196
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 183 transition count 188
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 183 transition count 188
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 182 transition count 187
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 182 transition count 185
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 180 transition count 185
Applied a total of 58 rules in 12 ms. Remains 180 /209 variables (removed 29) and now considering 185/214 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 185 rows 180 cols
[2024-05-22 20:02:00] [INFO ] Computed 32 invariants in 9 ms
[2024-05-22 20:02:00] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2024-05-22 20:02:00] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-22 20:02:01] [INFO ] After 146ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-22 20:02:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 20:02:01] [INFO ] After 6ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 20:02:01] [INFO ] After 18ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-05-22 20:02:01] [INFO ] After 232ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 255 ms.
RANDOM walk for 40000 steps (5722 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3651 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 926823 steps, run timeout after 3001 ms. (steps per millisecond=308 ) properties seen :0 out of 1
Probabilistic random walk after 926823 steps, saw 463515 distinct states, run finished after 3001 ms. (steps per millisecond=308 ) properties seen :0
// Phase 1: matrix 248 rows 255 cols
[2024-05-22 20:02:04] [INFO ] Computed 44 invariants in 14 ms
[2024-05-22 20:02:04] [INFO ] State equation strengthened by 24 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) 100/101 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 92/193 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 28/221 variables, 9/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 238/459 variables, 221/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/459 variables, 22/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/459 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 37/496 variables, 28/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/496 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/496 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/496 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/498 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/498 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/498 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 5/503 variables, 4/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/503 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/503 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/503 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 503/503 variables, and 323 constraints, problems are : Problem set: 0 solved, 1 unsolved in 347 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 255/255 constraints, ReadFeed: 24/24 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) 100/101 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 92/193 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 20:02:04] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 28/221 variables, 9/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 238/459 variables, 221/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/459 variables, 22/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/459 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/459 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 37/496 variables, 28/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/496 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/496 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/496 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/498 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/498 variables, 2/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/498 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 5/503 variables, 4/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/503 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/503 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/503 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 503/503 variables, and 325 constraints, problems are : Problem set: 0 solved, 1 unsolved in 388 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 255/255 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 774ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 27 ms.
Support contains 1 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 248/248 transitions.
Graph (complete) has 830 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 254 transition count 247
Free-agglomeration rule (complex) applied 25 times.
Iterating global reduction 1 with 25 rules applied. Total rules applied 27 place count 254 transition count 222
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 52 place count 229 transition count 222
Partial Free-agglomeration rule applied 28 times.
Drop transitions (Partial Free agglomeration) removed 28 transitions
Iterating global reduction 2 with 28 rules applied. Total rules applied 80 place count 229 transition count 222
Applied a total of 80 rules in 10 ms. Remains 229 /255 variables (removed 26) and now considering 222/248 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 229/255 places, 222/248 transitions.
RANDOM walk for 40000 steps (5851 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3647 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 956517 steps, run timeout after 3001 ms. (steps per millisecond=318 ) properties seen :0 out of 1
Probabilistic random walk after 956517 steps, saw 478363 distinct states, run finished after 3001 ms. (steps per millisecond=318 ) properties seen :0
// Phase 1: matrix 222 rows 229 cols
[2024-05-22 20:02:08] [INFO ] Computed 44 invariants in 17 ms
[2024-05-22 20:02:08] [INFO ] State equation strengthened by 38 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) 132/133 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 91/224 variables, 36/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 20:02:08] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 1 ms to minimize.
[2024-05-22 20:02:08] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/224 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 222/446 variables, 224/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/446 variables, 38/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/446 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/451 variables, 5/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/451 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/451 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/451 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 451/451 variables, and 313 constraints, problems are : Problem set: 0 solved, 1 unsolved in 413 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 229/229 constraints, ReadFeed: 38/38 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) 132/133 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 20:02:08] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 91/224 variables, 36/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/224 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 20:02:08] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 1 ms to minimize.
[2024-05-22 20:02:08] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 222/446 variables, 224/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/446 variables, 38/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/446 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/446 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/451 variables, 5/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/451 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/451 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/451 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 451/451 variables, and 317 constraints, problems are : Problem set: 0 solved, 1 unsolved in 546 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 229/229 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 992ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 24 ms.
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 222/222 transitions.
Applied a total of 0 rules in 3 ms. Remains 229 /229 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 229/229 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 222/222 transitions.
Applied a total of 0 rules in 3 ms. Remains 229 /229 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2024-05-22 20:02:09] [INFO ] Invariant cache hit.
[2024-05-22 20:02:09] [INFO ] Implicit Places using invariants in 179 ms returned [25, 74, 79, 99, 105, 126, 131, 151, 156, 177, 183]
[2024-05-22 20:02:09] [INFO ] Actually due to overlaps returned [79, 74, 25]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 204 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 226/229 places, 222/222 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 226 transition count 220
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 224 transition count 220
Applied a total of 4 rules in 6 ms. Remains 224 /226 variables (removed 2) and now considering 220/222 (removed 2) transitions.
// Phase 1: matrix 220 rows 224 cols
[2024-05-22 20:02:09] [INFO ] Computed 41 invariants in 11 ms
[2024-05-22 20:02:09] [INFO ] Implicit Places using invariants in 177 ms returned [94, 100, 121, 126, 146, 151, 172, 178]
[2024-05-22 20:02:09] [INFO ] Actually due to overlaps returned [100, 94]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 194 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 222/229 places, 220/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 222 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 221 transition count 219
Applied a total of 2 rules in 6 ms. Remains 221 /222 variables (removed 1) and now considering 219/220 (removed 1) transitions.
// Phase 1: matrix 219 rows 221 cols
[2024-05-22 20:02:09] [INFO ] Computed 39 invariants in 6 ms
[2024-05-22 20:02:09] [INFO ] Implicit Places using invariants in 157 ms returned [118, 123, 143, 148, 169, 175]
[2024-05-22 20:02:09] [INFO ] Actually due to overlaps returned [123, 118]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 167 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 219/229 places, 219/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 219 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 218 transition count 218
Applied a total of 2 rules in 6 ms. Remains 218 /219 variables (removed 1) and now considering 218/219 (removed 1) transitions.
// Phase 1: matrix 218 rows 218 cols
[2024-05-22 20:02:09] [INFO ] Computed 37 invariants in 9 ms
[2024-05-22 20:02:09] [INFO ] Implicit Places using invariants in 222 ms returned [140, 145, 166, 172]
[2024-05-22 20:02:09] [INFO ] Actually due to overlaps returned [145, 140]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 237 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 216/229 places, 218/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 216 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 215 transition count 217
Applied a total of 2 rules in 11 ms. Remains 215 /216 variables (removed 1) and now considering 217/218 (removed 1) transitions.
// Phase 1: matrix 217 rows 215 cols
[2024-05-22 20:02:09] [INFO ] Computed 35 invariants in 9 ms
[2024-05-22 20:02:10] [INFO ] Implicit Places using invariants in 211 ms returned [163, 169]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 225 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 213/229 places, 217/222 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 213 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 212 transition count 216
Applied a total of 2 rules in 5 ms. Remains 212 /213 variables (removed 1) and now considering 216/217 (removed 1) transitions.
// Phase 1: matrix 216 rows 212 cols
[2024-05-22 20:02:10] [INFO ] Computed 33 invariants in 9 ms
[2024-05-22 20:02:10] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-22 20:02:10] [INFO ] Invariant cache hit.
[2024-05-22 20:02:10] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-22 20:02:11] [INFO ] Implicit Places using invariants and state equation in 1045 ms returned []
Implicit Place search using SMT with State Equation took 1208 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 212/229 places, 216/222 transitions.
Finished structural reductions in REACHABILITY mode , in 6 iterations and 2272 ms. Remains : 212/229 places, 216/222 transitions.
RANDOM walk for 40000 steps (5760 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3704 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 952896 steps, run timeout after 3001 ms. (steps per millisecond=317 ) properties seen :0 out of 1
Probabilistic random walk after 952896 steps, saw 476551 distinct states, run finished after 3001 ms. (steps per millisecond=317 ) properties seen :0
[2024-05-22 20:02:14] [INFO ] Invariant cache hit.
[2024-05-22 20:02:14] [INFO ] State equation strengthened by 38 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) 112/113 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 78/207 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 20:02:14] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 1 ms to minimize.
[2024-05-22 20:02:14] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 2 ms to minimize.
[2024-05-22 20:02:14] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 1 ms to minimize.
[2024-05-22 20:02:14] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 1 ms to minimize.
[2024-05-22 20:02:14] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 2 ms to minimize.
[2024-05-22 20:02:15] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2024-05-22 20:02:15] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
[2024-05-22 20:02:15] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
[2024-05-22 20:02:15] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 1 ms to minimize.
[2024-05-22 20:02:15] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 10/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 216/423 variables, 207/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 38/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/423 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/428 variables, 5/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/428 variables, 2/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/428 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/428 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 428/428 variables, and 293 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1091 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 212/212 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 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) 112/113 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 78/207 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 10/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 20:02:15] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 216/423 variables, 207/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/423 variables, 38/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/428 variables, 5/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/428 variables, 2/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/428 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/428 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 428/428 variables, and 295 constraints, problems are : Problem set: 0 solved, 1 unsolved in 393 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 212/212 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 11/11 constraints]
After SMT, in 1521ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 23 ms.
Support contains 1 out of 212 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 212 /212 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 212/212 places, 216/216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 212 /212 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-22 20:02:15] [INFO ] Invariant cache hit.
[2024-05-22 20:02:16] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-22 20:02:16] [INFO ] Invariant cache hit.
[2024-05-22 20:02:16] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-22 20:02:17] [INFO ] Implicit Places using invariants and state equation in 1009 ms returned []
Implicit Place search using SMT with State Equation took 1178 ms to find 0 implicit places.
[2024-05-22 20:02:17] [INFO ] Redundant transitions in 0 ms returned []
Running 215 sub problems to find dead transitions.
[2024-05-22 20:02:17] [INFO ] Invariant cache hit.
[2024-05-22 20:02:17] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/211 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 1/212 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (OVERLAPS) 216/428 variables, 212/245 constraints. Problems are: Problem set: 0 solved, 215 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/428 variables, 38/283 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/428 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (OVERLAPS) 0/428 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 428/428 variables, and 283 constraints, problems are : Problem set: 0 solved, 215 unsolved in 9282 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 212/212 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/211 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 1/212 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (OVERLAPS) 216/428 variables, 212/245 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/428 variables, 38/283 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/428 variables, 215/498 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-05-22 20:02:34] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-22 20:02:35] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/428 variables, 2/500 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-05-22 20:02:46] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-05-22 20:02:46] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 1 ms to minimize.

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DoubleExponent-PT-010"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is DoubleExponent-PT-010, 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 r144-tall-171631144000347"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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