MCC'2025- Execution of r084-tall-174860080400308

About the Execution of 2024-gold for DoubleExponent-PT-010

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
15685.800	1800000.00	2649706.00	2916.70	[undef]	Time out reached

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 169K May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1748736395870

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
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
[2025-06-01 00:06:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-06-01 00:06:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 00:06:37] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2025-06-01 00:06:37] [INFO ] Transformed 534 places.
[2025-06-01 00:06:37] [INFO ] Transformed 498 transitions.
[2025-06-01 00:06:37] [INFO ] Parsed PT model containing 534 places and 498 transitions and 1404 arcs in 219 ms.
Structural test allowed to assert that 11 places are NOT stable. Took 10 ms.
RANDOM walk for 40000 steps (1314 resets) in 2443 ms. (16 steps per ms) remains 479/523 properties
BEST_FIRST walk for 400 steps (12 resets) in 22 ms. (17 steps per ms) remains 479/479 properties
BEST_FIRST walk for 400 steps (12 resets) in 20 ms. (19 steps per ms) remains 479/479 properties
BEST_FIRST walk for 400 steps (12 resets) in 19 ms. (20 steps per ms) remains 479/479 properties
BEST_FIRST walk for 400 steps (11 resets) in 25 ms. (15 steps per ms) remains 479/479 properties
BEST_FIRST walk for 401 steps (10 resets) in 14 ms. (26 steps per ms) remains 479/479 properties
BEST_FIRST walk for 400 steps (12 resets) in 28 ms. (13 steps per ms) remains 479/479 properties
BEST_FIRST walk for 400 steps (12 resets) in 17 ms. (22 steps per ms) remains 479/479 properties
BEST_FIRST walk for 403 steps (10 resets) in 22 ms. (17 steps per ms) remains 479/479 properties
BEST_FIRST walk for 400 steps (10 resets) in 15 ms. (25 steps per ms) remains 479/479 properties
BEST_FIRST walk for 400 steps (12 resets) in 21 ms. (18 steps per ms) remains 479/479 properties
BEST_FIRST walk for 401 steps (10 resets) in 17 ms. (22 steps per ms) remains 479/479 properties
BEST_FIRST walk for 400 steps (12 resets) in 20 ms. (19 steps per ms) remains 479/479 properties
BEST_FIRST walk for 400 steps (11 resets) in 18 ms. (21 steps per ms) remains 479/479 properties
BEST_FIRST walk for 401 steps (12 resets) in 18 ms. (21 steps per ms) remains 479/479 properties
BEST_FIRST walk for 402 steps (10 resets) in 13 ms. (28 steps per ms) remains 479/479 properties
BEST_FIRST walk for 400 steps (10 resets) in 16 ms. (23 steps per ms) remains 479/479 properties
BEST_FIRST walk for 402 steps (11 resets) in 17 ms. (22 steps per ms) remains 479/479 properties
BEST_FIRST walk for 400 steps (12 resets) in 16 ms. (23 steps per ms) remains 479/479 properties
BEST_FIRST walk for 400 steps (11 resets) in 27 ms. (14 steps per ms) remains 479/479 properties
BEST_FIRST walk for 401 steps (11 resets) in 13 ms. (28 steps per ms) remains 479/479 properties
BEST_FIRST walk for 400 steps (10 resets) in 14 ms. (26 steps per ms) remains 479/479 properties
BEST_FIRST walk for 400 steps (12 resets) in 17 ms. (22 steps per ms) remains 479/479 properties
BEST_FIRST walk for 400 steps (12 resets) in 15 ms. (25 steps per ms) remains 479/479 properties
BEST_FIRST walk for 401 steps (11 resets) in 14 ms. (26 steps per ms) remains 479/479 properties
BEST_FIRST walk for 400 steps (12 resets) in 14 ms. (26 steps per ms) remains 479/479 properties
BEST_FIRST walk for 401 steps (11 resets) in 15 ms. (25 steps per ms) remains 479/479 properties
BEST_FIRST walk for 400 steps (11 resets) in 13 ms. (28 steps per ms) remains 479/479 properties
BEST_FIRST walk for 400 steps (12 resets) in 18 ms. (21 steps per ms) remains 479/479 properties
BEST_FIRST walk for 400 steps (12 resets) in 12 ms. (30 steps per ms) remains 479/479 properties
BEST_FIRST walk for 401 steps (10 resets) in 20 ms. (19 steps per ms) remains 479/479 properties
BEST_FIRST walk for 401 steps (11 resets) in 13 ms. (28 steps per ms) remains 479/479 properties
BEST_FIRST walk for 401 steps (11 resets) in 12 ms. (30 steps per ms) remains 479/479 properties
BEST_FIRST walk for 402 steps (10 resets) in 13 ms. (28 steps per ms) remains 479/479 properties
BEST_FIRST walk for 400 steps (10 resets) in 13 ms. (28 steps per ms) remains 479/479 properties
BEST_FIRST walk for 400 steps (12 resets) in 13 ms. (28 steps per ms) remains 479/479 properties
BEST_FIRST walk for 401 steps (11 resets) in 15 ms. (25 steps per ms) remains 479/479 properties
BEST_FIRST walk for 401 steps (11 resets) in 14 ms. (26 steps per ms) remains 479/479 properties
BEST_FIRST walk for 400 steps (12 resets) in 14 ms. (26 steps per ms) remains 479/479 properties
BEST_FIRST walk for 400 steps (12 resets) in 14 ms. (26 steps per ms) remains 479/479 properties
BEST_FIRST walk for 401 steps (11 resets) in 12 ms. (30 steps per ms) remains 479/479 properties
BEST_FIRST walk for 400 steps (12 resets) in 13 ms. (28 steps per ms) remains 479/479 properties
BEST_FIRST walk for 400 steps (11 resets) in 12 ms. (30 steps per ms) remains 479/479 properties
BEST_FIRST walk for 400 steps (11 resets) in 12 ms. (30 steps per ms) remains 479/479 properties
BEST_FIRST walk for 401 steps (11 resets) in 11 ms. (33 steps per ms) remains 479/479 properties
BEST_FIRST walk for 401 steps (11 resets) in 12 ms. (30 steps per ms) remains 479/479 properties
BEST_FIRST walk for 401 steps (11 resets) in 12 ms. (30 steps per ms) remains 479/479 properties
BEST_FIRST walk for 400 steps (11 resets) in 12 ms. (30 steps per ms) remains 479/479 properties
BEST_FIRST walk for 402 steps (11 resets) in 14 ms. (26 steps per ms) remains 479/479 properties
BEST_FIRST walk for 400 steps (11 resets) in 22 ms. (17 steps per ms) remains 479/479 properties
BEST_FIRST walk for 400 steps (12 resets) in 12 ms. (30 steps per ms) remains 479/479 properties
Probabilistic random walk after 100001 steps, saw 50005 distinct states, run finished after 2725 ms. (steps per millisecond=36 ) properties seen :91
// Phase 1: matrix 498 rows 534 cols
[2025-06-01 00:06:41] [INFO ] Computed 54 invariants in 67 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/388 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 388 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 388/1032 variables, and 36 constraints, problems are : Problem set: 0 solved, 388 unsolved in 5057 ms.
Refiners :[Positive P Invariants (semi-flows): 0/3 constraints, Generalized P Invariants (flows): 36/51 constraints, State Equation: 0/534 constraints, PredecessorRefiner: 388/388 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 388 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/388 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/388 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 2 (OVERLAPS) 69/457 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 388 unsolved
[2025-06-01 00:06:51] [INFO ] Deduced a trap composed of 322 places in 181 ms of which 47 ms to minimize.
[2025-06-01 00:06:51] [INFO ] Deduced a trap composed of 325 places in 168 ms of which 3 ms to minimize.
[2025-06-01 00:06:51] [INFO ] Deduced a trap composed of 328 places in 120 ms of which 3 ms to minimize.
[2025-06-01 00:06:51] [INFO ] Deduced a trap composed of 330 places in 118 ms of which 2 ms to minimize.
[2025-06-01 00:06:52] [INFO ] Deduced a trap composed of 333 places in 116 ms of which 3 ms to minimize.
[2025-06-01 00:06:52] [INFO ] Deduced a trap composed of 330 places in 114 ms of which 3 ms to minimize.
SMT process timed out in 10334ms, After SMT, problems are : Problem set: 0 solved, 388 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 388 out of 534 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 534/534 places, 498/498 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 534 transition count 468
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 504 transition count 468
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 60 place count 504 transition count 463
Deduced a syphon composed of 5 places in 14 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 70 place count 499 transition count 463
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 11 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 130 place count 469 transition count 433
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 9 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 140 place count 464 transition count 433
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 146 place count 464 transition count 427
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 152 place count 458 transition count 427
Partial Free-agglomeration rule applied 11 times.
Drop transitions (Partial Free agglomeration) removed 11 transitions
Iterating global reduction 3 with 11 rules applied. Total rules applied 163 place count 458 transition count 427
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 164 place count 457 transition count 426
Applied a total of 164 rules in 155 ms. Remains 457 /534 variables (removed 77) and now considering 426/498 (removed 72) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 457/534 places, 426/498 transitions.
RANDOM walk for 4000000 steps (513305 resets) in 75142 ms. (53 steps per ms) remains 388/388 properties
BEST_FIRST walk for 40002 steps (3402 resets) in 500 ms. (79 steps per ms) remains 388/388 properties
BEST_FIRST walk for 40001 steps (3444 resets) in 496 ms. (80 steps per ms) remains 388/388 properties
BEST_FIRST walk for 40001 steps (3376 resets) in 520 ms. (76 steps per ms) remains 388/388 properties
BEST_FIRST walk for 40000 steps (3397 resets) in 478 ms. (83 steps per ms) remains 388/388 properties
BEST_FIRST walk for 40002 steps (3383 resets) in 474 ms. (84 steps per ms) remains 388/388 properties
BEST_FIRST walk for 40003 steps (3378 resets) in 477 ms. (83 steps per ms) remains 388/388 properties
BEST_FIRST walk for 40001 steps (3411 resets) in 478 ms. (83 steps per ms) remains 388/388 properties
BEST_FIRST walk for 40002 steps (3404 resets) in 484 ms. (82 steps per ms) remains 388/388 properties
BEST_FIRST walk for 40004 steps (3385 resets) in 574 ms. (69 steps per ms) remains 388/388 properties
BEST_FIRST walk for 40002 steps (3385 resets) in 493 ms. (80 steps per ms) remains 388/388 properties
BEST_FIRST walk for 40001 steps (3386 resets) in 476 ms. (83 steps per ms) remains 388/388 properties
BEST_FIRST walk for 40003 steps (3352 resets) in 473 ms. (84 steps per ms) remains 388/388 properties
BEST_FIRST walk for 40002 steps (3379 resets) in 481 ms. (82 steps per ms) remains 388/388 properties
BEST_FIRST walk for 40003 steps (3344 resets) in 482 ms. (82 steps per ms) remains 388/388 properties
BEST_FIRST walk for 40001 steps (3441 resets) in 481 ms. (82 steps per ms) remains 388/388 properties
BEST_FIRST walk for 40002 steps (3440 resets) in 496 ms. (80 steps per ms) remains 388/388 properties
BEST_FIRST walk for 40003 steps (3391 resets) in 496 ms. (80 steps per ms) remains 388/388 properties
BEST_FIRST walk for 40002 steps (3411 resets) in 489 ms. (81 steps per ms) remains 388/388 properties
BEST_FIRST walk for 40002 steps (3448 resets) in 479 ms. (83 steps per ms) remains 388/388 properties
BEST_FIRST walk for 40002 steps (3375 resets) in 480 ms. (83 steps per ms) remains 388/388 properties
BEST_FIRST walk for 40003 steps (3404 resets) in 480 ms. (83 steps per ms) remains 388/388 properties
BEST_FIRST walk for 40001 steps (3372 resets) in 498 ms. (80 steps per ms) remains 388/388 properties
BEST_FIRST walk for 40002 steps (3363 resets) in 491 ms. (81 steps per ms) remains 388/388 properties
BEST_FIRST walk for 40003 steps (3395 resets) in 492 ms. (81 steps per ms) remains 388/388 properties
BEST_FIRST walk for 40001 steps (3407 resets) in 492 ms. (81 steps per ms) remains 388/388 properties
BEST_FIRST walk for 40002 steps (3297 resets) in 482 ms. (82 steps per ms) remains 388/388 properties
BEST_FIRST walk for 40002 steps (3382 resets) in 479 ms. (83 steps per ms) remains 388/388 properties
BEST_FIRST walk for 40001 steps (3412 resets) in 483 ms. (82 steps per ms) remains 388/388 properties
BEST_FIRST walk for 40002 steps (3426 resets) in 481 ms. (82 steps per ms) remains 388/388 properties
BEST_FIRST walk for 40001 steps (3374 resets) in 481 ms. (82 steps per ms) remains 388/388 properties
BEST_FIRST walk for 40001 steps (3351 resets) in 480 ms. (83 steps per ms) remains 388/388 properties
BEST_FIRST walk for 40000 steps (3503 resets) in 493 ms. (80 steps per ms) remains 388/388 properties
BEST_FIRST walk for 40000 steps (3452 resets) in 489 ms. (81 steps per ms) remains 388/388 properties
BEST_FIRST walk for 40001 steps (3378 resets) in 491 ms. (81 steps per ms) remains 388/388 properties
BEST_FIRST walk for 40001 steps (3387 resets) in 478 ms. (83 steps per ms) remains 388/388 properties
BEST_FIRST walk for 40000 steps (3432 resets) in 482 ms. (82 steps per ms) remains 388/388 properties
BEST_FIRST walk for 40001 steps (3408 resets) in 480 ms. (83 steps per ms) remains 388/388 properties
BEST_FIRST walk for 40002 steps (3384 resets) in 482 ms. (82 steps per ms) remains 388/388 properties
BEST_FIRST walk for 40000 steps (3425 resets) in 482 ms. (82 steps per ms) remains 388/388 properties
BEST_FIRST walk for 40001 steps (3377 resets) in 488 ms. (81 steps per ms) remains 388/388 properties
BEST_FIRST walk for 40000 steps (3385 resets) in 489 ms. (81 steps per ms) remains 388/388 properties
BEST_FIRST walk for 40002 steps (3450 resets) in 496 ms. (80 steps per ms) remains 388/388 properties
BEST_FIRST walk for 40002 steps (3397 resets) in 485 ms. (82 steps per ms) remains 388/388 properties
BEST_FIRST walk for 40001 steps (3390 resets) in 484 ms. (82 steps per ms) remains 388/388 properties
BEST_FIRST walk for 40001 steps (3437 resets) in 483 ms. (82 steps per ms) remains 388/388 properties
BEST_FIRST walk for 40002 steps (3364 resets) in 480 ms. (83 steps per ms) remains 388/388 properties
BEST_FIRST walk for 40002 steps (3426 resets) in 482 ms. (82 steps per ms) remains 388/388 properties
BEST_FIRST walk for 40000 steps (3391 resets) in 493 ms. (80 steps per ms) remains 388/388 properties
BEST_FIRST walk for 40001 steps (3334 resets) in 492 ms. (81 steps per ms) remains 388/388 properties
BEST_FIRST walk for 40002 steps (3409 resets) in 487 ms. (81 steps per ms) remains 388/388 properties
Interrupted probabilistic random walk after 3214201 steps, run timeout after 75001 ms. (steps per millisecond=42 ) properties seen :51 out of 388
Probabilistic random walk after 3214201 steps, saw 1606961 distinct states, run finished after 75007 ms. (steps per millisecond=42 ) properties seen :51
// Phase 1: matrix 426 rows 457 cols
[2025-06-01 00:08:32] [INFO ] Computed 54 invariants in 20 ms
[2025-06-01 00:08:32] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/337 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/337 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 2 (OVERLAPS) 94/431 variables, 15/43 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/431 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 4 (OVERLAPS) 20/451 variables, 8/51 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/451 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 6 (OVERLAPS) 2/453 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/453 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 8 (OVERLAPS) 426/879 variables, 453/505 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/879 variables, 8/513 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/879 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 11 (OVERLAPS) 4/883 variables, 4/517 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/883 variables, 2/519 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/883 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 337 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 0.0)
(t1 0.0)
(t2 (/ 75.0 59552.0))
(t3 (/ 75.0 59552.0))
(t4 0.0)
(t5 (/ 75.0 59552.0))
(t6 0.0)
(t7 (/ 3647.0 59552.0))
(t8 (/ 3647.0 59552.0))
(t9 0.0)
(t10 0.0)
(t11 0.0)
(t12 (/ 3647.0 59552.0))
(t13 (/ 3647.0 59552.0))
(t14 (/ 3647.0 59552.0))
(t15 (/ 3647.0 59552.0))
(t16 (/ 3647.0 59552.0))
(t17 0.0)
(t18 (/ 3647.0 59552.0))
(t19 (/ 3647.0 59552.0))
(t20 (/ 3647.0 29776.0))
(t21 (/ 3647.0 29776.0))
(t22 (/ 75.0 59552.0))
(t23 (/ 75.0 59552.0))
(t24 (/ 75.0 59552.0))
(t25 (/ 75.0 59552.0))
(t26 (/ 75.0 59552.0))
(t27 (/ 75.0 59552.0))
(t28 (/ 75.0 59552.0))
(t29 (/ 75.0 59552.0))
(t30 (/ 75.0 59552.0))
(t31 0.0)
(t32 (/ 75.0 59552.0))
(t33 0.0)
(t34 (/ 37.0 29776.0))
(t35 0.0)
(t36 (/ 73.0 59552.0))
(t37 (/ 1787.0 59552.0))
(t38 0.0)
(t39 0.0)
(t40 0.0)
(t41 (/ 1787.0 59552.0))
(t42 (/ 1787.0 59552.0))
(t43 (/ 1787.0 59552.0))
(t44 (/ 1787.0 59552.0))
(t45 (/ 1787.0 59552.0))
(t46 0.0)
(t47 (/ 1787.0 59552.0))
(t48 (/ 1787.0 59552.0))
(t49 (/ 1785.0 59552.0))
(t50 0.0)
(t51 0.0)
(t52 0.0)
(t53 (/ 1785.0 59552.0))
(t54 (/ 1785.0 59552.0))
(t55 (/ 1785.0 59552.0))
(t56 (/ 1785.0 59552.0))
(t57 (/ 1785.0 59552.0))
(t58 0.0)
(t59 (/ 1785.0 59552.0))
(t60 (/ 1785.0 59552.0))
(t61 (/ 893.0 14888.0))
(t62 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 883/883 variables, and 519 constraints, problems are : Problem set: 0 solved, 337 unsolved in 45031 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 52/52 constraints, State Equation: 457/457 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 337/337 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 337 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/337 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/337 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 2 (OVERLAPS) 94/431 variables, 15/43 constraints. Problems are: Problem set: 0 solved, 337 unsolved
[2025-06-01 00:09:20] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 3 ms to minimize.
[2025-06-01 00:09:20] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 3 ms to minimize.
[2025-06-01 00:09:20] [INFO ] Deduced a trap composed of 37 places in 121 ms of which 2 ms to minimize.
[2025-06-01 00:09:20] [INFO ] Deduced a trap composed of 35 places in 113 ms of which 3 ms to minimize.
[2025-06-01 00:09:20] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 3 ms to minimize.
[2025-06-01 00:09:21] [INFO ] Deduced a trap composed of 52 places in 113 ms of which 2 ms to minimize.
[2025-06-01 00:09:21] [INFO ] Deduced a trap composed of 156 places in 116 ms of which 2 ms to minimize.
[2025-06-01 00:09:21] [INFO ] Deduced a trap composed of 181 places in 105 ms of which 2 ms to minimize.
[2025-06-01 00:09:21] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 3 ms to minimize.
[2025-06-01 00:09:21] [INFO ] Deduced a trap composed of 49 places in 130 ms of which 5 ms to minimize.
[2025-06-01 00:09:22] [INFO ] Deduced a trap composed of 47 places in 116 ms of which 2 ms to minimize.
[2025-06-01 00:09:22] [INFO ] Deduced a trap composed of 161 places in 103 ms of which 2 ms to minimize.
[2025-06-01 00:09:22] [INFO ] Deduced a trap composed of 147 places in 105 ms of which 2 ms to minimize.
[2025-06-01 00:09:22] [INFO ] Deduced a trap composed of 155 places in 99 ms of which 2 ms to minimize.
[2025-06-01 00:09:22] [INFO ] Deduced a trap composed of 158 places in 99 ms of which 2 ms to minimize.
[2025-06-01 00:09:23] [INFO ] Deduced a trap composed of 170 places in 115 ms of which 3 ms to minimize.
[2025-06-01 00:09:23] [INFO ] Deduced a trap composed of 175 places in 113 ms of which 2 ms to minimize.
[2025-06-01 00:09:23] [INFO ] Deduced a trap composed of 203 places in 107 ms of which 3 ms to minimize.
[2025-06-01 00:09:24] [INFO ] Deduced a trap composed of 154 places in 109 ms of which 2 ms to minimize.
[2025-06-01 00:09:24] [INFO ] Deduced a trap composed of 169 places in 116 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/431 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 337 unsolved
[2025-06-01 00:09:24] [INFO ] Deduced a trap composed of 171 places in 107 ms of which 2 ms to minimize.
[2025-06-01 00:09:24] [INFO ] Deduced a trap composed of 164 places in 104 ms of which 2 ms to minimize.
[2025-06-01 00:09:25] [INFO ] Deduced a trap composed of 182 places in 112 ms of which 2 ms to minimize.
[2025-06-01 00:09:25] [INFO ] Deduced a trap composed of 174 places in 117 ms of which 2 ms to minimize.
[2025-06-01 00:09:26] [INFO ] Deduced a trap composed of 190 places in 119 ms of which 3 ms to minimize.
[2025-06-01 00:09:27] [INFO ] Deduced a trap composed of 125 places in 83 ms of which 2 ms to minimize.
[2025-06-01 00:09:27] [INFO ] Deduced a trap composed of 59 places in 114 ms of which 3 ms to minimize.
[2025-06-01 00:09:28] [INFO ] Deduced a trap composed of 173 places in 113 ms of which 3 ms to minimize.
[2025-06-01 00:09:28] [INFO ] Deduced a trap composed of 188 places in 108 ms of which 3 ms to minimize.
[2025-06-01 00:09:29] [INFO ] Deduced a trap composed of 173 places in 109 ms of which 2 ms to minimize.
[2025-06-01 00:09:29] [INFO ] Deduced a trap composed of 151 places in 86 ms of which 2 ms to minimize.
[2025-06-01 00:09:30] [INFO ] Deduced a trap composed of 99 places in 59 ms of which 1 ms to minimize.
[2025-06-01 00:09:30] [INFO ] Deduced a trap composed of 85 places in 118 ms of which 2 ms to minimize.
[2025-06-01 00:09:30] [INFO ] Deduced a trap composed of 162 places in 128 ms of which 3 ms to minimize.
[2025-06-01 00:09:30] [INFO ] Deduced a trap composed of 155 places in 119 ms of which 3 ms to minimize.
[2025-06-01 00:09:30] [INFO ] Deduced a trap composed of 168 places in 120 ms of which 2 ms to minimize.
[2025-06-01 00:09:30] [INFO ] Deduced a trap composed of 72 places in 67 ms of which 1 ms to minimize.
[2025-06-01 00:09:30] [INFO ] Deduced a trap composed of 90 places in 72 ms of which 2 ms to minimize.
[2025-06-01 00:09:32] [INFO ] Deduced a trap composed of 173 places in 120 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/431 variables, 19/82 constraints. Problems are: Problem set: 0 solved, 337 unsolved
[2025-06-01 00:09:33] [INFO ] Deduced a trap composed of 172 places in 110 ms of which 2 ms to minimize.
[2025-06-01 00:09:33] [INFO ] Deduced a trap composed of 184 places in 109 ms of which 2 ms to minimize.
[2025-06-01 00:09:33] [INFO ] Deduced a trap composed of 197 places in 112 ms of which 2 ms to minimize.
[2025-06-01 00:09:33] [INFO ] Deduced a trap composed of 183 places in 118 ms of which 2 ms to minimize.
[2025-06-01 00:09:33] [INFO ] Deduced a trap composed of 205 places in 107 ms of which 3 ms to minimize.
[2025-06-01 00:09:33] [INFO ] Deduced a trap composed of 226 places in 102 ms of which 2 ms to minimize.
[2025-06-01 00:09:33] [INFO ] Deduced a trap composed of 206 places in 102 ms of which 2 ms to minimize.
[2025-06-01 00:09:34] [INFO ] Deduced a trap composed of 162 places in 119 ms of which 2 ms to minimize.
[2025-06-01 00:09:34] [INFO ] Deduced a trap composed of 185 places in 124 ms of which 3 ms to minimize.
[2025-06-01 00:09:34] [INFO ] Deduced a trap composed of 195 places in 110 ms of which 2 ms to minimize.
[2025-06-01 00:09:34] [INFO ] Deduced a trap composed of 185 places in 109 ms of which 3 ms to minimize.
[2025-06-01 00:09:34] [INFO ] Deduced a trap composed of 188 places in 118 ms of which 7 ms to minimize.
[2025-06-01 00:09:34] [INFO ] Deduced a trap composed of 183 places in 118 ms of which 3 ms to minimize.
[2025-06-01 00:09:35] [INFO ] Deduced a trap composed of 190 places in 116 ms of which 3 ms to minimize.
[2025-06-01 00:09:35] [INFO ] Deduced a trap composed of 49 places in 122 ms of which 3 ms to minimize.
[2025-06-01 00:09:35] [INFO ] Deduced a trap composed of 53 places in 126 ms of which 3 ms to minimize.
[2025-06-01 00:09:35] [INFO ] Deduced a trap composed of 159 places in 113 ms of which 3 ms to minimize.
[2025-06-01 00:09:35] [INFO ] Deduced a trap composed of 171 places in 119 ms of which 2 ms to minimize.
[2025-06-01 00:09:35] [INFO ] Deduced a trap composed of 175 places in 111 ms of which 3 ms to minimize.
[2025-06-01 00:09:35] [INFO ] Deduced a trap composed of 163 places in 117 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/431 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 337 unsolved
[2025-06-01 00:09:36] [INFO ] Deduced a trap composed of 184 places in 119 ms of which 3 ms to minimize.
[2025-06-01 00:09:36] [INFO ] Deduced a trap composed of 41 places in 121 ms of which 3 ms to minimize.
[2025-06-01 00:09:37] [INFO ] Deduced a trap composed of 189 places in 126 ms of which 2 ms to minimize.
[2025-06-01 00:09:38] [INFO ] Deduced a trap composed of 61 places in 89 ms of which 2 ms to minimize.
[2025-06-01 00:09:40] [INFO ] Deduced a trap composed of 119 places in 74 ms of which 1 ms to minimize.
[2025-06-01 00:09:40] [INFO ] Deduced a trap composed of 83 places in 65 ms of which 1 ms to minimize.
[2025-06-01 00:09:40] [INFO ] Deduced a trap composed of 109 places in 123 ms of which 2 ms to minimize.
[2025-06-01 00:09:41] [INFO ] Deduced a trap composed of 89 places in 116 ms of which 2 ms to minimize.
[2025-06-01 00:09:41] [INFO ] Deduced a trap composed of 122 places in 117 ms of which 3 ms to minimize.
[2025-06-01 00:09:41] [INFO ] Deduced a trap composed of 178 places in 116 ms of which 2 ms to minimize.
[2025-06-01 00:09:41] [INFO ] Deduced a trap composed of 110 places in 61 ms of which 1 ms to minimize.
[2025-06-01 00:09:41] [INFO ] Deduced a trap composed of 211 places in 118 ms of which 3 ms to minimize.
[2025-06-01 00:09:42] [INFO ] Deduced a trap composed of 189 places in 114 ms of which 3 ms to minimize.
[2025-06-01 00:09:42] [INFO ] Deduced a trap composed of 204 places in 113 ms of which 3 ms to minimize.
[2025-06-01 00:09:42] [INFO ] Deduced a trap composed of 207 places in 112 ms of which 2 ms to minimize.
[2025-06-01 00:09:42] [INFO ] Deduced a trap composed of 183 places in 110 ms of which 2 ms to minimize.
[2025-06-01 00:09:42] [INFO ] Deduced a trap composed of 110 places in 67 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/431 variables, 17/119 constraints. Problems are: Problem set: 0 solved, 337 unsolved
[2025-06-01 00:09:46] [INFO ] Deduced a trap composed of 66 places in 96 ms of which 1 ms to minimize.
[2025-06-01 00:09:46] [INFO ] Deduced a trap composed of 65 places in 120 ms of which 2 ms to minimize.
[2025-06-01 00:09:46] [INFO ] Deduced a trap composed of 177 places in 115 ms of which 2 ms to minimize.
[2025-06-01 00:09:47] [INFO ] Deduced a trap composed of 175 places in 120 ms of which 2 ms to minimize.
[2025-06-01 00:09:48] [INFO ] Deduced a trap composed of 170 places in 117 ms of which 2 ms to minimize.
[2025-06-01 00:09:48] [INFO ] Deduced a trap composed of 177 places in 109 ms of which 2 ms to minimize.
[2025-06-01 00:09:50] [INFO ] Deduced a trap composed of 110 places in 117 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/431 variables, 7/126 constraints. Problems are: Problem set: 0 solved, 337 unsolved
[2025-06-01 00:09:51] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 2 ms to minimize.
[2025-06-01 00:09:54] [INFO ] Deduced a trap composed of 137 places in 120 ms of which 2 ms to minimize.
[2025-06-01 00:09:55] [INFO ] Deduced a trap composed of 140 places in 115 ms of which 3 ms to minimize.
[2025-06-01 00:09:57] [INFO ] Deduced a trap composed of 127 places in 119 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/431 variables, 4/130 constraints. Problems are: Problem set: 0 solved, 337 unsolved
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 Int declared 431/883 variables, and 130 constraints, problems are : Problem set: 0 solved, 337 unsolved in 45013 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, Generalized P Invariants (flows): 43/52 constraints, State Equation: 0/457 constraints, ReadFeed: 0/8 constraints, PredecessorRefiner: 0/337 constraints, Known Traps: 87/87 constraints]
After SMT, in 90110ms problems are : Problem set: 0 solved, 337 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 337 out of 457 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 457/457 places, 426/426 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 457 transition count 415
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 446 transition count 415
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 22 place count 446 transition count 413
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 26 place count 444 transition count 413
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 3 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 44 place count 435 transition count 404
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 48 place count 433 transition count 404
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 52 place count 433 transition count 400
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 56 place count 429 transition count 400
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 60 place count 429 transition count 400
Applied a total of 60 rules in 85 ms. Remains 429 /457 variables (removed 28) and now considering 400/426 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 429/457 places, 400/426 transitions.
RANDOM walk for 4000000 steps (512906 resets) in 67889 ms. (58 steps per ms) remains 337/337 properties
BEST_FIRST walk for 40002 steps (3419 resets) in 545 ms. (73 steps per ms) remains 337/337 properties
BEST_FIRST walk for 40002 steps (3388 resets) in 803 ms. (49 steps per ms) remains 337/337 properties
BEST_FIRST walk for 40002 steps (3367 resets) in 771 ms. (51 steps per ms) remains 337/337 properties
BEST_FIRST walk for 40000 steps (3426 resets) in 641 ms. (62 steps per ms) remains 337/337 properties
BEST_FIRST walk for 40002 steps (3401 resets) in 944 ms. (42 steps per ms) remains 337/337 properties
BEST_FIRST walk for 40003 steps (3409 resets) in 918 ms. (43 steps per ms) remains 337/337 properties
BEST_FIRST walk for 40001 steps (3373 resets) in 930 ms. (42 steps per ms) remains 337/337 properties
BEST_FIRST walk for 40000 steps (3488 resets) in 621 ms. (64 steps per ms) remains 337/337 properties
BEST_FIRST walk for 40001 steps (3367 resets) in 678 ms. (58 steps per ms) remains 337/337 properties
BEST_FIRST walk for 40002 steps (3432 resets) in 634 ms. (62 steps per ms) remains 337/337 properties
BEST_FIRST walk for 40004 steps (3380 resets) in 603 ms. (66 steps per ms) remains 337/337 properties
BEST_FIRST walk for 40003 steps (3431 resets) in 634 ms. (62 steps per ms) remains 337/337 properties
BEST_FIRST walk for 40001 steps (3339 resets) in 887 ms. (45 steps per ms) remains 337/337 properties
BEST_FIRST walk for 40002 steps (3342 resets) in 656 ms. (60 steps per ms) remains 337/337 properties
BEST_FIRST walk for 40003 steps (3374 resets) in 930 ms. (42 steps per ms) remains 337/337 properties
BEST_FIRST walk for 40003 steps (3398 resets) in 918 ms. (43 steps per ms) remains 337/337 properties
BEST_FIRST walk for 40001 steps (3343 resets) in 819 ms. (48 steps per ms) remains 337/337 properties
BEST_FIRST walk for 40001 steps (3393 resets) in 624 ms. (64 steps per ms) remains 337/337 properties
BEST_FIRST walk for 40002 steps (3340 resets) in 650 ms. (61 steps per ms) remains 337/337 properties
BEST_FIRST walk for 40003 steps (3406 resets) in 647 ms. (61 steps per ms) remains 337/337 properties
BEST_FIRST walk for 40001 steps (3380 resets) in 887 ms. (45 steps per ms) remains 337/337 properties
BEST_FIRST walk for 40001 steps (3414 resets) in 675 ms. (59 steps per ms) remains 337/337 properties
BEST_FIRST walk for 40000 steps (3403 resets) in 783 ms. (51 steps per ms) remains 337/337 properties
BEST_FIRST walk for 40002 steps (3378 resets) in 628 ms. (63 steps per ms) remains 337/337 properties
BEST_FIRST walk for 40000 steps (3411 resets) in 848 ms. (47 steps per ms) remains 337/337 properties
BEST_FIRST walk for 40000 steps (3418 resets) in 662 ms. (60 steps per ms) remains 337/337 properties
BEST_FIRST walk for 40002 steps (3345 resets) in 617 ms. (64 steps per ms) remains 337/337 properties
BEST_FIRST walk for 40000 steps (3373 resets) in 586 ms. (68 steps per ms) remains 337/337 properties
BEST_FIRST walk for 40002 steps (3419 resets) in 619 ms. (64 steps per ms) remains 337/337 properties
BEST_FIRST walk for 40002 steps (3415 resets) in 651 ms. (61 steps per ms) remains 337/337 properties
BEST_FIRST walk for 40001 steps (3423 resets) in 925 ms. (43 steps per ms) remains 337/337 properties
BEST_FIRST walk for 40002 steps (3337 resets) in 663 ms. (60 steps per ms) remains 337/337 properties
BEST_FIRST walk for 40003 steps (3420 resets) in 912 ms. (43 steps per ms) remains 337/337 properties
BEST_FIRST walk for 40002 steps (3335 resets) in 683 ms. (58 steps per ms) remains 337/337 properties
BEST_FIRST walk for 40000 steps (3399 resets) in 630 ms. (63 steps per ms) remains 337/337 properties
BEST_FIRST walk for 40004 steps (3476 resets) in 797 ms. (50 steps per ms) remains 337/337 properties
BEST_FIRST walk for 40000 steps (3367 resets) in 645 ms. (61 steps per ms) remains 337/337 properties
BEST_FIRST walk for 40000 steps (3360 resets) in 645 ms. (61 steps per ms) remains 337/337 properties
BEST_FIRST walk for 40002 steps (3409 resets) in 674 ms. (59 steps per ms) remains 337/337 properties
BEST_FIRST walk for 40002 steps (3417 resets) in 645 ms. (61 steps per ms) remains 337/337 properties
BEST_FIRST walk for 40002 steps (3411 resets) in 631 ms. (63 steps per ms) remains 337/337 properties
BEST_FIRST walk for 40000 steps (3380 resets) in 625 ms. (63 steps per ms) remains 337/337 properties
BEST_FIRST walk for 40000 steps (3410 resets) in 632 ms. (63 steps per ms) remains 337/337 properties
BEST_FIRST walk for 40000 steps (3382 resets) in 926 ms. (43 steps per ms) remains 337/337 properties
BEST_FIRST walk for 40000 steps (3390 resets) in 891 ms. (44 steps per ms) remains 337/337 properties
BEST_FIRST walk for 40001 steps (3368 resets) in 898 ms. (44 steps per ms) remains 337/337 properties
BEST_FIRST walk for 40003 steps (3366 resets) in 598 ms. (66 steps per ms) remains 337/337 properties
BEST_FIRST walk for 40001 steps (3362 resets) in 623 ms. (64 steps per ms) remains 337/337 properties
BEST_FIRST walk for 40000 steps (3357 resets) in 681 ms. (58 steps per ms) remains 337/337 properties
BEST_FIRST walk for 40002 steps (3392 resets) in 640 ms. (62 steps per ms) remains 337/337 properties
Interrupted probabilistic random walk after 3379611 steps, run timeout after 87001 ms. (steps per millisecond=38 ) properties seen :2 out of 337
Probabilistic random walk after 3379611 steps, saw 1689672 distinct states, run finished after 87001 ms. (steps per millisecond=38 ) properties seen :2
// Phase 1: matrix 400 rows 429 cols
[2025-06-01 00:11:59] [INFO ] Computed 54 invariants in 23 ms
[2025-06-01 00:11:59] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/335 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/335 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 13/348 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/348 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 69/417 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/417 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 6 (OVERLAPS) 8/425 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/425 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (OVERLAPS) 400/825 variables, 425/477 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/825 variables, 12/489 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/825 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 11 (OVERLAPS) 4/829 variables, 4/493 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/829 variables, 2/495 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/829 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 14 (OVERLAPS) 0/829 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 829/829 variables, and 495 constraints, problems are : Problem set: 0 solved, 335 unsolved in 48865 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 429/429 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/335 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/335 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 13/348 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2025-06-01 00:12:50] [INFO ] Deduced a trap composed of 74 places in 66 ms of which 2 ms to minimize.
[2025-06-01 00:12:51] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 2 ms to minimize.
[2025-06-01 00:12:52] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 2 ms to minimize.
[2025-06-01 00:12:53] [INFO ] Deduced a trap composed of 104 places in 68 ms of which 1 ms to minimize.
[2025-06-01 00:12:53] [INFO ] Deduced a trap composed of 167 places in 101 ms of which 2 ms to minimize.
[2025-06-01 00:12:53] [INFO ] Deduced a trap composed of 52 places in 62 ms of which 2 ms to minimize.
[2025-06-01 00:12:53] [INFO ] Deduced a trap composed of 62 places in 61 ms of which 1 ms to minimize.
[2025-06-01 00:12:53] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 2 ms to minimize.
[2025-06-01 00:12:54] [INFO ] Deduced a trap composed of 153 places in 99 ms of which 2 ms to minimize.
[2025-06-01 00:12:54] [INFO ] Deduced a trap composed of 114 places in 66 ms of which 1 ms to minimize.
[2025-06-01 00:12:54] [INFO ] Deduced a trap composed of 113 places in 68 ms of which 1 ms to minimize.
[2025-06-01 00:12:54] [INFO ] Deduced a trap composed of 87 places in 97 ms of which 2 ms to minimize.
[2025-06-01 00:12:55] [INFO ] Deduced a trap composed of 116 places in 64 ms of which 1 ms to minimize.
[2025-06-01 00:12:55] [INFO ] Deduced a trap composed of 122 places in 55 ms of which 1 ms to minimize.
[2025-06-01 00:12:55] [INFO ] Deduced a trap composed of 82 places in 48 ms of which 1 ms to minimize.
[2025-06-01 00:12:55] [INFO ] Deduced a trap composed of 122 places in 58 ms of which 1 ms to minimize.
[2025-06-01 00:12:55] [INFO ] Deduced a trap composed of 103 places in 99 ms of which 2 ms to minimize.
[2025-06-01 00:12:56] [INFO ] Deduced a trap composed of 163 places in 98 ms of which 2 ms to minimize.
[2025-06-01 00:12:56] [INFO ] Deduced a trap composed of 115 places in 68 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/348 variables, 19/50 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2025-06-01 00:12:58] [INFO ] Deduced a trap composed of 68 places in 81 ms of which 2 ms to minimize.
[2025-06-01 00:12:59] [INFO ] Deduced a trap composed of 78 places in 95 ms of which 2 ms to minimize.
[2025-06-01 00:12:59] [INFO ] Deduced a trap composed of 86 places in 101 ms of which 3 ms to minimize.
[2025-06-01 00:13:00] [INFO ] Deduced a trap composed of 88 places in 51 ms of which 0 ms to minimize.
[2025-06-01 00:13:00] [INFO ] Deduced a trap composed of 88 places in 60 ms of which 1 ms to minimize.
[2025-06-01 00:13:00] [INFO ] Deduced a trap composed of 159 places in 98 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 6/56 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 6 (OVERLAPS) 69/417 variables, 18/74 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2025-06-01 00:13:05] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 2 ms to minimize.
[2025-06-01 00:13:05] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 2 ms to minimize.
[2025-06-01 00:13:05] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 3 ms to minimize.
[2025-06-01 00:13:06] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 2 ms to minimize.
[2025-06-01 00:13:06] [INFO ] Deduced a trap composed of 28 places in 105 ms of which 2 ms to minimize.
[2025-06-01 00:13:06] [INFO ] Deduced a trap composed of 47 places in 103 ms of which 3 ms to minimize.
[2025-06-01 00:13:06] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 3 ms to minimize.
[2025-06-01 00:13:06] [INFO ] Deduced a trap composed of 166 places in 105 ms of which 2 ms to minimize.
[2025-06-01 00:13:06] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 2 ms to minimize.
[2025-06-01 00:13:06] [INFO ] Deduced a trap composed of 192 places in 140 ms of which 3 ms to minimize.
[2025-06-01 00:13:07] [INFO ] Deduced a trap composed of 203 places in 127 ms of which 3 ms to minimize.
[2025-06-01 00:13:07] [INFO ] Deduced a trap composed of 26 places in 125 ms of which 3 ms to minimize.
[2025-06-01 00:13:07] [INFO ] Deduced a trap composed of 194 places in 133 ms of which 3 ms to minimize.
[2025-06-01 00:13:07] [INFO ] Deduced a trap composed of 35 places in 97 ms of which 2 ms to minimize.
[2025-06-01 00:13:07] [INFO ] Deduced a trap composed of 196 places in 126 ms of which 3 ms to minimize.
[2025-06-01 00:13:08] [INFO ] Deduced a trap composed of 187 places in 115 ms of which 2 ms to minimize.
[2025-06-01 00:13:08] [INFO ] Deduced a trap composed of 193 places in 121 ms of which 2 ms to minimize.
[2025-06-01 00:13:08] [INFO ] Deduced a trap composed of 187 places in 126 ms of which 3 ms to minimize.
[2025-06-01 00:13:08] [INFO ] Deduced a trap composed of 14 places in 123 ms of which 2 ms to minimize.
[2025-06-01 00:13:08] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/417 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2025-06-01 00:13:09] [INFO ] Deduced a trap composed of 25 places in 141 ms of which 3 ms to minimize.
[2025-06-01 00:13:09] [INFO ] Deduced a trap composed of 149 places in 97 ms of which 2 ms to minimize.
[2025-06-01 00:13:09] [INFO ] Deduced a trap composed of 195 places in 124 ms of which 2 ms to minimize.
[2025-06-01 00:13:09] [INFO ] Deduced a trap composed of 196 places in 122 ms of which 3 ms to minimize.
[2025-06-01 00:13:10] [INFO ] Deduced a trap composed of 177 places in 119 ms of which 3 ms to minimize.
[2025-06-01 00:13:10] [INFO ] Deduced a trap composed of 208 places in 127 ms of which 3 ms to minimize.
[2025-06-01 00:13:10] [INFO ] Deduced a trap composed of 202 places in 129 ms of which 2 ms to minimize.
[2025-06-01 00:13:10] [INFO ] Deduced a trap composed of 198 places in 126 ms of which 3 ms to minimize.
[2025-06-01 00:13:10] [INFO ] Deduced a trap composed of 18 places in 118 ms of which 3 ms to minimize.
[2025-06-01 00:13:10] [INFO ] Deduced a trap composed of 205 places in 112 ms of which 2 ms to minimize.
[2025-06-01 00:13:10] [INFO ] Deduced a trap composed of 201 places in 118 ms of which 3 ms to minimize.
[2025-06-01 00:13:11] [INFO ] Deduced a trap composed of 214 places in 113 ms of which 2 ms to minimize.
[2025-06-01 00:13:11] [INFO ] Deduced a trap composed of 199 places in 130 ms of which 2 ms to minimize.
[2025-06-01 00:13:11] [INFO ] Deduced a trap composed of 178 places in 131 ms of which 3 ms to minimize.
[2025-06-01 00:13:11] [INFO ] Deduced a trap composed of 182 places in 120 ms of which 2 ms to minimize.
[2025-06-01 00:13:11] [INFO ] Deduced a trap composed of 168 places in 117 ms of which 3 ms to minimize.
[2025-06-01 00:13:11] [INFO ] Deduced a trap composed of 176 places in 100 ms of which 2 ms to minimize.
[2025-06-01 00:13:12] [INFO ] Deduced a trap composed of 194 places in 123 ms of which 3 ms to minimize.
[2025-06-01 00:13:12] [INFO ] Deduced a trap composed of 189 places in 126 ms of which 3 ms to minimize.
[2025-06-01 00:13:12] [INFO ] Deduced a trap composed of 178 places in 127 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2025-06-01 00:13:12] [INFO ] Deduced a trap composed of 161 places in 106 ms of which 2 ms to minimize.
[2025-06-01 00:13:13] [INFO ] Deduced a trap composed of 184 places in 128 ms of which 2 ms to minimize.
[2025-06-01 00:13:13] [INFO ] Deduced a trap composed of 205 places in 127 ms of which 3 ms to minimize.
[2025-06-01 00:13:13] [INFO ] Deduced a trap composed of 202 places in 125 ms of which 3 ms to minimize.
[2025-06-01 00:13:13] [INFO ] Deduced a trap composed of 194 places in 121 ms of which 3 ms to minimize.
[2025-06-01 00:13:13] [INFO ] Deduced a trap composed of 191 places in 120 ms of which 3 ms to minimize.
[2025-06-01 00:13:13] [INFO ] Deduced a trap composed of 206 places in 126 ms of which 2 ms to minimize.
[2025-06-01 00:13:13] [INFO ] Deduced a trap composed of 208 places in 122 ms of which 2 ms to minimize.
[2025-06-01 00:13:14] [INFO ] Deduced a trap composed of 159 places in 96 ms of which 2 ms to minimize.
[2025-06-01 00:13:14] [INFO ] Deduced a trap composed of 199 places in 121 ms of which 2 ms to minimize.
[2025-06-01 00:13:14] [INFO ] Deduced a trap composed of 193 places in 113 ms of which 2 ms to minimize.
[2025-06-01 00:13:14] [INFO ] Deduced a trap composed of 187 places in 132 ms of which 3 ms to minimize.
[2025-06-01 00:13:14] [INFO ] Deduced a trap composed of 201 places in 130 ms of which 2 ms to minimize.
[2025-06-01 00:13:14] [INFO ] Deduced a trap composed of 200 places in 130 ms of which 3 ms to minimize.
[2025-06-01 00:13:15] [INFO ] Deduced a trap composed of 210 places in 123 ms of which 3 ms to minimize.
[2025-06-01 00:13:15] [INFO ] Deduced a trap composed of 188 places in 125 ms of which 3 ms to minimize.
[2025-06-01 00:13:15] [INFO ] Deduced a trap composed of 204 places in 119 ms of which 2 ms to minimize.
[2025-06-01 00:13:15] [INFO ] Deduced a trap composed of 203 places in 120 ms of which 3 ms to minimize.
[2025-06-01 00:13:15] [INFO ] Deduced a trap composed of 186 places in 116 ms of which 2 ms to minimize.
[2025-06-01 00:13:15] [INFO ] Deduced a trap composed of 192 places in 123 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/417 variables, 20/134 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2025-06-01 00:13:16] [INFO ] Deduced a trap composed of 182 places in 108 ms of which 2 ms to minimize.
[2025-06-01 00:13:16] [INFO ] Deduced a trap composed of 158 places in 99 ms of which 2 ms to minimize.
[2025-06-01 00:13:16] [INFO ] Deduced a trap composed of 220 places in 122 ms of which 2 ms to minimize.
[2025-06-01 00:13:16] [INFO ] Deduced a trap composed of 191 places in 127 ms of which 3 ms to minimize.
[2025-06-01 00:13:17] [INFO ] Deduced a trap composed of 197 places in 121 ms of which 2 ms to minimize.
[2025-06-01 00:13:17] [INFO ] Deduced a trap composed of 215 places in 127 ms of which 3 ms to minimize.
[2025-06-01 00:13:17] [INFO ] Deduced a trap composed of 184 places in 94 ms of which 2 ms to minimize.
[2025-06-01 00:13:18] [INFO ] Deduced a trap composed of 202 places in 108 ms of which 2 ms to minimize.
[2025-06-01 00:13:18] [INFO ] Deduced a trap composed of 217 places in 121 ms of which 2 ms to minimize.
[2025-06-01 00:13:18] [INFO ] Deduced a trap composed of 222 places in 118 ms of which 2 ms to minimize.
[2025-06-01 00:13:18] [INFO ] Deduced a trap composed of 208 places in 126 ms of which 2 ms to minimize.
[2025-06-01 00:13:18] [INFO ] Deduced a trap composed of 221 places in 118 ms of which 3 ms to minimize.
[2025-06-01 00:13:18] [INFO ] Deduced a trap composed of 220 places in 120 ms of which 3 ms to minimize.
[2025-06-01 00:13:19] [INFO ] Deduced a trap composed of 208 places in 117 ms of which 2 ms to minimize.
[2025-06-01 00:13:19] [INFO ] Deduced a trap composed of 185 places in 95 ms of which 2 ms to minimize.
[2025-06-01 00:13:19] [INFO ] Deduced a trap composed of 202 places in 119 ms of which 3 ms to minimize.
[2025-06-01 00:13:19] [INFO ] Deduced a trap composed of 217 places in 118 ms of which 2 ms to minimize.
[2025-06-01 00:13:19] [INFO ] Deduced a trap composed of 228 places in 123 ms of which 2 ms to minimize.
[2025-06-01 00:13:19] [INFO ] Deduced a trap composed of 214 places in 122 ms of which 2 ms to minimize.
[2025-06-01 00:13:19] [INFO ] Deduced a trap composed of 206 places in 120 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/417 variables, 20/154 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2025-06-01 00:13:20] [INFO ] Deduced a trap composed of 169 places in 104 ms of which 2 ms to minimize.
[2025-06-01 00:13:20] [INFO ] Deduced a trap composed of 177 places in 100 ms of which 2 ms to minimize.
[2025-06-01 00:13:21] [INFO ] Deduced a trap composed of 201 places in 105 ms of which 2 ms to minimize.
[2025-06-01 00:13:21] [INFO ] Deduced a trap composed of 184 places in 99 ms of which 2 ms to minimize.
[2025-06-01 00:13:21] [INFO ] Deduced a trap composed of 201 places in 99 ms of which 2 ms to minimize.
[2025-06-01 00:13:22] [INFO ] Deduced a trap composed of 224 places in 125 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/417 variables, 6/160 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2025-06-01 00:13:28] [INFO ] Deduced a trap composed of 216 places in 127 ms of which 2 ms to minimize.
[2025-06-01 00:13:28] [INFO ] Deduced a trap composed of 193 places in 105 ms of which 3 ms to minimize.
[2025-06-01 00:13:29] [INFO ] Deduced a trap composed of 210 places in 122 ms of which 3 ms to minimize.
[2025-06-01 00:13:29] [INFO ] Deduced a trap composed of 229 places in 126 ms of which 3 ms to minimize.
[2025-06-01 00:13:29] [INFO ] Deduced a trap composed of 231 places in 126 ms of which 3 ms to minimize.
[2025-06-01 00:13:29] [INFO ] Deduced a trap composed of 215 places in 130 ms of which 2 ms to minimize.
[2025-06-01 00:13:30] [INFO ] Deduced a trap composed of 243 places in 131 ms of which 2 ms to minimize.
[2025-06-01 00:13:30] [INFO ] Deduced a trap composed of 219 places in 119 ms of which 3 ms to minimize.
[2025-06-01 00:13:30] [INFO ] Deduced a trap composed of 201 places in 118 ms of which 2 ms to minimize.
[2025-06-01 00:13:30] [INFO ] Deduced a trap composed of 227 places in 122 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/417 variables, 10/170 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2025-06-01 00:13:36] [INFO ] Deduced a trap composed of 214 places in 126 ms of which 2 ms to minimize.
[2025-06-01 00:13:36] [INFO ] Deduced a trap composed of 207 places in 119 ms of which 3 ms to minimize.
[2025-06-01 00:13:36] [INFO ] Deduced a trap composed of 209 places in 120 ms of which 2 ms to minimize.
[2025-06-01 00:13:36] [INFO ] Deduced a trap composed of 215 places in 116 ms of which 2 ms to minimize.
[2025-06-01 00:13:36] [INFO ] Deduced a trap composed of 231 places in 122 ms of which 3 ms to minimize.
[2025-06-01 00:13:36] [INFO ] Deduced a trap composed of 232 places in 127 ms of which 2 ms to minimize.
[2025-06-01 00:13:37] [INFO ] Deduced a trap composed of 226 places in 122 ms of which 2 ms to minimize.
[2025-06-01 00:13:37] [INFO ] Deduced a trap composed of 224 places in 127 ms of which 3 ms to minimize.
[2025-06-01 00:13:37] [INFO ] Deduced a trap composed of 209 places in 120 ms of which 2 ms to minimize.
[2025-06-01 00:13:37] [INFO ] Deduced a trap composed of 206 places in 126 ms of which 2 ms to minimize.
[2025-06-01 00:13:37] [INFO ] Deduced a trap composed of 40 places in 91 ms of which 2 ms to minimize.
[2025-06-01 00:13:38] [INFO ] Deduced a trap composed of 159 places in 130 ms of which 3 ms to minimize.
[2025-06-01 00:13:39] [INFO ] Deduced a trap composed of 139 places in 83 ms of which 2 ms to minimize.
[2025-06-01 00:13:39] [INFO ] Deduced a trap composed of 186 places in 129 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/417 variables, 14/184 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/417 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 15 (OVERLAPS) 8/425 variables, 3/187 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2025-06-01 00:13:49] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 2 ms to minimize.
[2025-06-01 00:13:49] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/425 variables, 2/189 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/425 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 335 unsolved
SMT process timed out in 123942ms, After SMT, problems are : Problem set: 0 solved, 335 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 335 out of 429 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 429/429 places, 400/400 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 428 transition count 399
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 3 place count 428 transition count 399
Applied a total of 3 rules in 36 ms. Remains 428 /429 variables (removed 1) and now considering 399/400 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 428/429 places, 399/400 transitions.
RANDOM walk for 4000000 steps (512472 resets) in 65043 ms. (61 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40000 steps (3360 resets) in 426 ms. (93 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40002 steps (3386 resets) in 432 ms. (92 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3406 resets) in 427 ms. (93 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40000 steps (3385 resets) in 433 ms. (92 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40002 steps (3423 resets) in 427 ms. (93 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3386 resets) in 437 ms. (91 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3387 resets) in 429 ms. (93 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40003 steps (3419 resets) in 431 ms. (92 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40002 steps (3310 resets) in 424 ms. (94 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3374 resets) in 432 ms. (92 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3389 resets) in 480 ms. (83 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3338 resets) in 546 ms. (73 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3379 resets) in 523 ms. (76 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3426 resets) in 732 ms. (54 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40002 steps (3390 resets) in 678 ms. (58 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40002 steps (3374 resets) in 673 ms. (59 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3371 resets) in 668 ms. (59 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40002 steps (3394 resets) in 668 ms. (59 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3382 resets) in 641 ms. (62 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40000 steps (3354 resets) in 673 ms. (59 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3400 resets) in 663 ms. (60 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40002 steps (3383 resets) in 625 ms. (63 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40002 steps (3429 resets) in 681 ms. (58 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40000 steps (3410 resets) in 668 ms. (59 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3395 resets) in 781 ms. (51 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40002 steps (3420 resets) in 658 ms. (60 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40002 steps (3372 resets) in 739 ms. (54 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40002 steps (3376 resets) in 690 ms. (57 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3407 resets) in 692 ms. (57 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40002 steps (3388 resets) in 640 ms. (62 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3429 resets) in 660 ms. (60 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40002 steps (3386 resets) in 650 ms. (61 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40002 steps (3389 resets) in 730 ms. (54 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40003 steps (3475 resets) in 675 ms. (59 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40002 steps (3391 resets) in 621 ms. (64 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40000 steps (3368 resets) in 670 ms. (59 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40000 steps (3421 resets) in 1066 ms. (37 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3426 resets) in 650 ms. (61 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3408 resets) in 648 ms. (61 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40002 steps (3353 resets) in 662 ms. (60 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3429 resets) in 759 ms. (52 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3474 resets) in 633 ms. (63 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40002 steps (3437 resets) in 880 ms. (45 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40000 steps (3386 resets) in 891 ms. (44 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3337 resets) in 778 ms. (51 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3358 resets) in 649 ms. (61 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40003 steps (3372 resets) in 666 ms. (59 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3349 resets) in 700 ms. (57 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40004 steps (3380 resets) in 630 ms. (63 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40000 steps (3396 resets) in 627 ms. (63 steps per ms) remains 335/335 properties
Interrupted probabilistic random walk after 3066555 steps, run timeout after 78001 ms. (steps per millisecond=39 ) properties seen :0 out of 335
Probabilistic random walk after 3066555 steps, saw 1533188 distinct states, run finished after 78001 ms. (steps per millisecond=39 ) properties seen :0
// Phase 1: matrix 399 rows 428 cols
[2025-06-01 00:15:48] [INFO ] Computed 54 invariants in 23 ms
[2025-06-01 00:15:48] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/335 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/335 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 13/348 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/348 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 72/420 variables, 19/50 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/420 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 6 (OVERLAPS) 4/424 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/424 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (OVERLAPS) 399/823 variables, 424/476 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/823 variables, 12/488 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/823 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 11 (OVERLAPS) 4/827 variables, 4/492 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/827 variables, 2/494 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/827 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 14 (OVERLAPS) 0/827 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 827/827 variables, and 494 constraints, problems are : Problem set: 0 solved, 335 unsolved in 50947 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 428/428 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/335 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/335 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 13/348 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2025-06-01 00:16:41] [INFO ] Deduced a trap composed of 84 places in 66 ms of which 1 ms to minimize.
[2025-06-01 00:16:42] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 3 ms to minimize.
[2025-06-01 00:16:44] [INFO ] Deduced a trap composed of 110 places in 54 ms of which 1 ms to minimize.
[2025-06-01 00:16:45] [INFO ] Deduced a trap composed of 81 places in 93 ms of which 2 ms to minimize.
[2025-06-01 00:16:45] [INFO ] Deduced a trap composed of 74 places in 64 ms of which 2 ms to minimize.
[2025-06-01 00:16:45] [INFO ] Deduced a trap composed of 76 places in 80 ms of which 2 ms to minimize.
[2025-06-01 00:16:45] [INFO ] Deduced a trap composed of 82 places in 50 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/348 variables, 7/38 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2025-06-01 00:16:49] [INFO ] Deduced a trap composed of 143 places in 105 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2025-06-01 00:16:55] [INFO ] Deduced a trap composed of 155 places in 99 ms of which 2 ms to minimize.
[2025-06-01 00:16:55] [INFO ] Deduced a trap composed of 80 places in 94 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (OVERLAPS) 72/420 variables, 19/60 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2025-06-01 00:16:59] [INFO ] Deduced a trap composed of 6 places in 129 ms of which 2 ms to minimize.
[2025-06-01 00:17:00] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 2 ms to minimize.
[2025-06-01 00:17:00] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 2 ms to minimize.
[2025-06-01 00:17:00] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 3 ms to minimize.
[2025-06-01 00:17:00] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 2 ms to minimize.
[2025-06-01 00:17:00] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 2 ms to minimize.
[2025-06-01 00:17:00] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 2 ms to minimize.
[2025-06-01 00:17:00] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 3 ms to minimize.
[2025-06-01 00:17:01] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 2 ms to minimize.
[2025-06-01 00:17:01] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 2 ms to minimize.
[2025-06-01 00:17:01] [INFO ] Deduced a trap composed of 159 places in 104 ms of which 2 ms to minimize.
[2025-06-01 00:17:01] [INFO ] Deduced a trap composed of 211 places in 121 ms of which 3 ms to minimize.
[2025-06-01 00:17:01] [INFO ] Deduced a trap composed of 184 places in 127 ms of which 3 ms to minimize.
[2025-06-01 00:17:01] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 3 ms to minimize.
[2025-06-01 00:17:01] [INFO ] Deduced a trap composed of 186 places in 122 ms of which 3 ms to minimize.
[2025-06-01 00:17:01] [INFO ] Deduced a trap composed of 184 places in 123 ms of which 2 ms to minimize.
[2025-06-01 00:17:02] [INFO ] Deduced a trap composed of 202 places in 125 ms of which 3 ms to minimize.
[2025-06-01 00:17:02] [INFO ] Deduced a trap composed of 202 places in 126 ms of which 2 ms to minimize.
[2025-06-01 00:17:02] [INFO ] Deduced a trap composed of 196 places in 127 ms of which 2 ms to minimize.
[2025-06-01 00:17:02] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2025-06-01 00:17:02] [INFO ] Deduced a trap composed of 171 places in 113 ms of which 2 ms to minimize.
[2025-06-01 00:17:02] [INFO ] Deduced a trap composed of 181 places in 110 ms of which 3 ms to minimize.
[2025-06-01 00:17:03] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 2 ms to minimize.
[2025-06-01 00:17:03] [INFO ] Deduced a trap composed of 207 places in 139 ms of which 2 ms to minimize.
[2025-06-01 00:17:03] [INFO ] Deduced a trap composed of 175 places in 124 ms of which 3 ms to minimize.
[2025-06-01 00:17:03] [INFO ] Deduced a trap composed of 198 places in 136 ms of which 3 ms to minimize.
[2025-06-01 00:17:03] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 2 ms to minimize.
[2025-06-01 00:17:04] [INFO ] Deduced a trap composed of 195 places in 135 ms of which 3 ms to minimize.
[2025-06-01 00:17:04] [INFO ] Deduced a trap composed of 183 places in 127 ms of which 3 ms to minimize.
[2025-06-01 00:17:04] [INFO ] Deduced a trap composed of 178 places in 132 ms of which 4 ms to minimize.
[2025-06-01 00:17:04] [INFO ] Deduced a trap composed of 193 places in 129 ms of which 3 ms to minimize.
[2025-06-01 00:17:04] [INFO ] Deduced a trap composed of 164 places in 134 ms of which 3 ms to minimize.
[2025-06-01 00:17:04] [INFO ] Deduced a trap composed of 164 places in 132 ms of which 3 ms to minimize.
[2025-06-01 00:17:04] [INFO ] Deduced a trap composed of 199 places in 138 ms of which 3 ms to minimize.
[2025-06-01 00:17:05] [INFO ] Deduced a trap composed of 200 places in 125 ms of which 2 ms to minimize.
[2025-06-01 00:17:05] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 3 ms to minimize.
[2025-06-01 00:17:05] [INFO ] Deduced a trap composed of 204 places in 128 ms of which 3 ms to minimize.
[2025-06-01 00:17:05] [INFO ] Deduced a trap composed of 187 places in 131 ms of which 3 ms to minimize.
[2025-06-01 00:17:05] [INFO ] Deduced a trap composed of 215 places in 129 ms of which 2 ms to minimize.
[2025-06-01 00:17:05] [INFO ] Deduced a trap composed of 200 places in 119 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/420 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2025-06-01 00:17:06] [INFO ] Deduced a trap composed of 178 places in 107 ms of which 2 ms to minimize.
[2025-06-01 00:17:06] [INFO ] Deduced a trap composed of 167 places in 105 ms of which 2 ms to minimize.
[2025-06-01 00:17:07] [INFO ] Deduced a trap composed of 201 places in 138 ms of which 3 ms to minimize.
[2025-06-01 00:17:10] [INFO ] Deduced a trap composed of 204 places in 128 ms of which 3 ms to minimize.
[2025-06-01 00:17:10] [INFO ] Deduced a trap composed of 163 places in 125 ms of which 3 ms to minimize.
[2025-06-01 00:17:10] [INFO ] Deduced a trap composed of 191 places in 127 ms of which 2 ms to minimize.
[2025-06-01 00:17:10] [INFO ] Deduced a trap composed of 192 places in 119 ms of which 3 ms to minimize.
[2025-06-01 00:17:11] [INFO ] Deduced a trap composed of 189 places in 121 ms of which 3 ms to minimize.
[2025-06-01 00:17:11] [INFO ] Deduced a trap composed of 187 places in 123 ms of which 2 ms to minimize.
[2025-06-01 00:17:11] [INFO ] Deduced a trap composed of 118 places in 127 ms of which 3 ms to minimize.
[2025-06-01 00:17:11] [INFO ] Deduced a trap composed of 187 places in 124 ms of which 2 ms to minimize.
[2025-06-01 00:17:11] [INFO ] Deduced a trap composed of 173 places in 123 ms of which 2 ms to minimize.
[2025-06-01 00:17:12] [INFO ] Deduced a trap composed of 195 places in 132 ms of which 3 ms to minimize.
[2025-06-01 00:17:12] [INFO ] Deduced a trap composed of 180 places in 130 ms of which 3 ms to minimize.
[2025-06-01 00:17:12] [INFO ] Deduced a trap composed of 197 places in 133 ms of which 2 ms to minimize.
[2025-06-01 00:17:12] [INFO ] Deduced a trap composed of 177 places in 125 ms of which 3 ms to minimize.
[2025-06-01 00:17:12] [INFO ] Deduced a trap composed of 205 places in 128 ms of which 3 ms to minimize.
[2025-06-01 00:17:12] [INFO ] Deduced a trap composed of 180 places in 124 ms of which 2 ms to minimize.
[2025-06-01 00:17:12] [INFO ] Deduced a trap composed of 144 places in 127 ms of which 3 ms to minimize.
[2025-06-01 00:17:13] [INFO ] Deduced a trap composed of 121 places in 121 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/420 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2025-06-01 00:17:13] [INFO ] Deduced a trap composed of 198 places in 129 ms of which 2 ms to minimize.
[2025-06-01 00:17:13] [INFO ] Deduced a trap composed of 205 places in 125 ms of which 3 ms to minimize.
[2025-06-01 00:17:13] [INFO ] Deduced a trap composed of 191 places in 115 ms of which 3 ms to minimize.
[2025-06-01 00:17:14] [INFO ] Deduced a trap composed of 188 places in 132 ms of which 3 ms to minimize.
[2025-06-01 00:17:15] [INFO ] Deduced a trap composed of 176 places in 127 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/420 variables, 5/125 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/420 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 13 (OVERLAPS) 4/424 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2025-06-01 00:17:18] [INFO ] Deduced a trap composed of 209 places in 101 ms of which 2 ms to minimize.
[2025-06-01 00:17:18] [INFO ] Deduced a trap composed of 209 places in 95 ms of which 2 ms to minimize.
[2025-06-01 00:17:19] [INFO ] Deduced a trap composed of 170 places in 101 ms of which 2 ms to minimize.
[2025-06-01 00:17:19] [INFO ] Deduced a trap composed of 175 places in 97 ms of which 2 ms to minimize.
[2025-06-01 00:17:19] [INFO ] Deduced a trap composed of 179 places in 96 ms of which 2 ms to minimize.
[2025-06-01 00:17:19] [INFO ] Deduced a trap composed of 184 places in 111 ms of which 2 ms to minimize.
[2025-06-01 00:17:19] [INFO ] Deduced a trap composed of 177 places in 100 ms of which 2 ms to minimize.
[2025-06-01 00:17:19] [INFO ] Deduced a trap composed of 206 places in 129 ms of which 3 ms to minimize.
[2025-06-01 00:17:20] [INFO ] Deduced a trap composed of 196 places in 135 ms of which 2 ms to minimize.
[2025-06-01 00:17:20] [INFO ] Deduced a trap composed of 170 places in 121 ms of which 2 ms to minimize.
[2025-06-01 00:17:20] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 3 ms to minimize.
[2025-06-01 00:17:22] [INFO ] Deduced a trap composed of 203 places in 130 ms of which 3 ms to minimize.
[2025-06-01 00:17:22] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 3 ms to minimize.
[2025-06-01 00:17:22] [INFO ] Deduced a trap composed of 232 places in 127 ms of which 3 ms to minimize.
[2025-06-01 00:17:22] [INFO ] Deduced a trap composed of 195 places in 119 ms of which 2 ms to minimize.
[2025-06-01 00:17:22] [INFO ] Deduced a trap composed of 204 places in 117 ms of which 2 ms to minimize.
[2025-06-01 00:17:22] [INFO ] Deduced a trap composed of 131 places in 125 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/424 variables, 17/144 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2025-06-01 00:17:28] [INFO ] Deduced a trap composed of 130 places in 125 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/424 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2025-06-01 00:17:32] [INFO ] Deduced a trap composed of 205 places in 131 ms of which 3 ms to minimize.
[2025-06-01 00:17:32] [INFO ] Deduced a trap composed of 64 places in 88 ms of which 2 ms to minimize.
[2025-06-01 00:17:34] [INFO ] Deduced a trap composed of 102 places in 66 ms of which 2 ms to minimize.
[2025-06-01 00:17:34] [INFO ] Deduced a trap composed of 196 places in 132 ms of which 2 ms to minimize.
[2025-06-01 00:17:34] [INFO ] Deduced a trap composed of 216 places in 130 ms of which 3 ms to minimize.
[2025-06-01 00:17:34] [INFO ] Deduced a trap composed of 52 places in 72 ms of which 2 ms to minimize.
[2025-06-01 00:17:34] [INFO ] Deduced a trap composed of 69 places in 79 ms of which 1 ms to minimize.
[2025-06-01 00:17:36] [INFO ] Deduced a trap composed of 202 places in 131 ms of which 2 ms to minimize.
[2025-06-01 00:17:36] [INFO ] Deduced a trap composed of 220 places in 127 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/424 variables, 9/154 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2025-06-01 00:17:39] [INFO ] Deduced a trap composed of 18 places in 135 ms of which 2 ms to minimize.
[2025-06-01 00:17:39] [INFO ] Deduced a trap composed of 222 places in 135 ms of which 2 ms to minimize.
[2025-06-01 00:17:39] [INFO ] Deduced a trap composed of 203 places in 141 ms of which 3 ms to minimize.
[2025-06-01 00:17:39] [INFO ] Deduced a trap composed of 188 places in 131 ms of which 3 ms to minimize.
[2025-06-01 00:17:39] [INFO ] Deduced a trap composed of 200 places in 141 ms of which 2 ms to minimize.
[2025-06-01 00:17:40] [INFO ] Deduced a trap composed of 203 places in 128 ms of which 3 ms to minimize.
[2025-06-01 00:17:40] [INFO ] Deduced a trap composed of 201 places in 134 ms of which 2 ms to minimize.
[2025-06-01 00:17:40] [INFO ] Deduced a trap composed of 204 places in 133 ms of which 2 ms to minimize.
[2025-06-01 00:17:40] [INFO ] Deduced a trap composed of 184 places in 128 ms of which 2 ms to minimize.
[2025-06-01 00:17:40] [INFO ] Deduced a trap composed of 175 places in 131 ms of which 3 ms to minimize.
[2025-06-01 00:17:40] [INFO ] Deduced a trap composed of 173 places in 132 ms of which 2 ms to minimize.
[2025-06-01 00:17:40] [INFO ] Deduced a trap composed of 194 places in 132 ms of which 3 ms to minimize.
[2025-06-01 00:17:41] [INFO ] Deduced a trap composed of 175 places in 135 ms of which 2 ms to minimize.
[2025-06-01 00:17:41] [INFO ] Deduced a trap composed of 176 places in 127 ms of which 3 ms to minimize.
[2025-06-01 00:17:41] [INFO ] Deduced a trap composed of 175 places in 134 ms of which 3 ms to minimize.
[2025-06-01 00:17:41] [INFO ] Deduced a trap composed of 172 places in 129 ms of which 2 ms to minimize.
[2025-06-01 00:17:42] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 2 ms to minimize.
[2025-06-01 00:17:43] [INFO ] Deduced a trap composed of 68 places in 71 ms of which 1 ms to minimize.
[2025-06-01 00:17:43] [INFO ] Deduced a trap composed of 62 places in 70 ms of which 1 ms to minimize.
[2025-06-01 00:17:44] [INFO ] Deduced a trap composed of 220 places in 118 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/424 variables, 20/174 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2025-06-01 00:17:44] [INFO ] Deduced a trap composed of 190 places in 125 ms of which 3 ms to minimize.
[2025-06-01 00:17:44] [INFO ] Deduced a trap composed of 198 places in 125 ms of which 3 ms to minimize.
[2025-06-01 00:17:45] [INFO ] Deduced a trap composed of 190 places in 129 ms of which 3 ms to minimize.
[2025-06-01 00:17:45] [INFO ] Deduced a trap composed of 180 places in 130 ms of which 3 ms to minimize.
[2025-06-01 00:17:45] [INFO ] Deduced a trap composed of 175 places in 130 ms of which 2 ms to minimize.
[2025-06-01 00:17:45] [INFO ] Deduced a trap composed of 183 places in 136 ms of which 3 ms to minimize.
[2025-06-01 00:17:45] [INFO ] Deduced a trap composed of 190 places in 122 ms of which 2 ms to minimize.
[2025-06-01 00:17:45] [INFO ] Deduced a trap composed of 195 places in 122 ms of which 3 ms to minimize.
[2025-06-01 00:17:45] [INFO ] Deduced a trap composed of 190 places in 118 ms of which 2 ms to minimize.
[2025-06-01 00:17:46] [INFO ] Deduced a trap composed of 201 places in 135 ms of which 2 ms to minimize.
[2025-06-01 00:17:46] [INFO ] Deduced a trap composed of 206 places in 127 ms of which 3 ms to minimize.
[2025-06-01 00:17:46] [INFO ] Deduced a trap composed of 189 places in 122 ms of which 3 ms to minimize.
[2025-06-01 00:17:46] [INFO ] Deduced a trap composed of 189 places in 123 ms of which 3 ms to minimize.
[2025-06-01 00:17:46] [INFO ] Deduced a trap composed of 199 places in 125 ms of which 3 ms to minimize.
[2025-06-01 00:17:46] [INFO ] Deduced a trap composed of 213 places in 128 ms of which 3 ms to minimize.
[2025-06-01 00:17:46] [INFO ] Deduced a trap composed of 193 places in 126 ms of which 3 ms to minimize.
[2025-06-01 00:17:47] [INFO ] Deduced a trap composed of 189 places in 127 ms of which 2 ms to minimize.
[2025-06-01 00:17:47] [INFO ] Deduced a trap composed of 188 places in 131 ms of which 3 ms to minimize.
[2025-06-01 00:17:47] [INFO ] Deduced a trap composed of 197 places in 120 ms of which 3 ms to minimize.
[2025-06-01 00:17:47] [INFO ] Deduced a trap composed of 191 places in 119 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/424 variables, 20/194 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2025-06-01 00:17:48] [INFO ] Deduced a trap composed of 170 places in 134 ms of which 2 ms to minimize.
[2025-06-01 00:17:48] [INFO ] Deduced a trap composed of 173 places in 130 ms of which 2 ms to minimize.
[2025-06-01 00:17:48] [INFO ] Deduced a trap composed of 185 places in 124 ms of which 3 ms to minimize.
[2025-06-01 00:17:48] [INFO ] Deduced a trap composed of 176 places in 127 ms of which 3 ms to minimize.
[2025-06-01 00:17:49] [INFO ] Deduced a trap composed of 172 places in 124 ms of which 3 ms to minimize.
[2025-06-01 00:17:49] [INFO ] Deduced a trap composed of 198 places in 120 ms of which 3 ms to minimize.
[2025-06-01 00:17:49] [INFO ] Deduced a trap composed of 164 places in 122 ms of which 2 ms to minimize.
[2025-06-01 00:17:49] [INFO ] Deduced a trap composed of 182 places in 124 ms of which 2 ms to minimize.
[2025-06-01 00:17:49] [INFO ] Deduced a trap composed of 187 places in 117 ms of which 3 ms to minimize.
[2025-06-01 00:17:49] [INFO ] Deduced a trap composed of 162 places in 121 ms of which 2 ms to minimize.
[2025-06-01 00:17:49] [INFO ] Deduced a trap composed of 193 places in 119 ms of which 2 ms to minimize.
[2025-06-01 00:17:50] [INFO ] Deduced a trap composed of 170 places in 125 ms of which 2 ms to minimize.
[2025-06-01 00:17:50] [INFO ] Deduced a trap composed of 182 places in 120 ms of which 3 ms to minimize.
[2025-06-01 00:17:50] [INFO ] Deduced a trap composed of 184 places in 120 ms of which 3 ms to minimize.
[2025-06-01 00:17:50] [INFO ] Deduced a trap composed of 198 places in 123 ms of which 2 ms to minimize.
[2025-06-01 00:17:50] [INFO ] Deduced a trap composed of 191 places in 120 ms of which 3 ms to minimize.
[2025-06-01 00:17:50] [INFO ] Deduced a trap composed of 183 places in 117 ms of which 2 ms to minimize.
[2025-06-01 00:17:50] [INFO ] Deduced a trap composed of 208 places in 130 ms of which 3 ms to minimize.
[2025-06-01 00:17:50] [INFO ] Deduced a trap composed of 193 places in 129 ms of which 3 ms to minimize.
[2025-06-01 00:17:51] [INFO ] Deduced a trap composed of 188 places in 120 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/424 variables, 20/214 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2025-06-01 00:17:52] [INFO ] Deduced a trap composed of 182 places in 119 ms of which 2 ms to minimize.
[2025-06-01 00:17:52] [INFO ] Deduced a trap composed of 183 places in 120 ms of which 2 ms to minimize.
[2025-06-01 00:17:52] [INFO ] Deduced a trap composed of 179 places in 117 ms of which 3 ms to minimize.
[2025-06-01 00:17:52] [INFO ] Deduced a trap composed of 177 places in 117 ms of which 2 ms to minimize.
[2025-06-01 00:17:53] [INFO ] Deduced a trap composed of 203 places in 122 ms of which 3 ms to minimize.
[2025-06-01 00:17:53] [INFO ] Deduced a trap composed of 171 places in 121 ms of which 3 ms to minimize.
[2025-06-01 00:17:53] [INFO ] Deduced a trap composed of 176 places in 125 ms of which 2 ms to minimize.
[2025-06-01 00:17:53] [INFO ] Deduced a trap composed of 208 places in 116 ms of which 2 ms to minimize.
[2025-06-01 00:17:53] [INFO ] Deduced a trap composed of 187 places in 114 ms of which 3 ms to minimize.
[2025-06-01 00:17:53] [INFO ] Deduced a trap composed of 190 places in 123 ms of which 2 ms to minimize.
[2025-06-01 00:17:53] [INFO ] Deduced a trap composed of 175 places in 126 ms of which 2 ms to minimize.
[2025-06-01 00:17:53] [INFO ] Deduced a trap composed of 183 places in 138 ms of which 2 ms to minimize.
[2025-06-01 00:17:54] [INFO ] Deduced a trap composed of 186 places in 123 ms of which 2 ms to minimize.
[2025-06-01 00:17:54] [INFO ] Deduced a trap composed of 200 places in 126 ms of which 3 ms to minimize.
[2025-06-01 00:17:54] [INFO ] Deduced a trap composed of 202 places in 124 ms of which 2 ms to minimize.
[2025-06-01 00:17:54] [INFO ] Deduced a trap composed of 196 places in 116 ms of which 3 ms to minimize.
[2025-06-01 00:17:54] [INFO ] Deduced a trap composed of 187 places in 125 ms of which 3 ms to minimize.
[2025-06-01 00:17:54] [INFO ] Deduced a trap composed of 203 places in 122 ms of which 2 ms to minimize.
[2025-06-01 00:17:54] [INFO ] Deduced a trap composed of 193 places in 126 ms of which 2 ms to minimize.
[2025-06-01 00:17:55] [INFO ] Deduced a trap composed of 175 places in 133 ms of which 3 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/424 variables, 20/234 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2025-06-01 00:17:55] [INFO ] Deduced a trap composed of 179 places in 129 ms of which 2 ms to minimize.
[2025-06-01 00:17:56] [INFO ] Deduced a trap composed of 171 places in 122 ms of which 2 ms to minimize.
[2025-06-01 00:17:56] [INFO ] Deduced a trap composed of 175 places in 135 ms of which 2 ms to minimize.
[2025-06-01 00:17:56] [INFO ] Deduced a trap composed of 171 places in 126 ms of which 2 ms to minimize.
[2025-06-01 00:17:56] [INFO ] Deduced a trap composed of 179 places in 123 ms of which 2 ms to minimize.
[2025-06-01 00:17:56] [INFO ] Deduced a trap composed of 192 places in 132 ms of which 3 ms to minimize.
[2025-06-01 00:17:57] [INFO ] Deduced a trap composed of 199 places in 123 ms of which 3 ms to minimize.
[2025-06-01 00:17:57] [INFO ] Deduced a trap composed of 201 places in 121 ms of which 3 ms to minimize.
[2025-06-01 00:17:57] [INFO ] Deduced a trap composed of 189 places in 112 ms of which 2 ms to minimize.
[2025-06-01 00:17:57] [INFO ] Deduced a trap composed of 190 places in 126 ms of which 3 ms to minimize.
[2025-06-01 00:17:58] [INFO ] Deduced a trap composed of 198 places in 121 ms of which 2 ms to minimize.
[2025-06-01 00:17:58] [INFO ] Deduced a trap composed of 184 places in 122 ms of which 2 ms to minimize.
[2025-06-01 00:17:58] [INFO ] Deduced a trap composed of 178 places in 121 ms of which 3 ms to minimize.
[2025-06-01 00:17:58] [INFO ] Deduced a trap composed of 179 places in 122 ms of which 2 ms to minimize.
[2025-06-01 00:17:58] [INFO ] Deduced a trap composed of 187 places in 119 ms of which 3 ms to minimize.
[2025-06-01 00:17:58] [INFO ] Deduced a trap composed of 194 places in 123 ms of which 3 ms to minimize.
[2025-06-01 00:17:59] [INFO ] Deduced a trap composed of 178 places in 125 ms of which 2 ms to minimize.
[2025-06-01 00:17:59] [INFO ] Deduced a trap composed of 194 places in 125 ms of which 2 ms to minimize.
[2025-06-01 00:17:59] [INFO ] Deduced a trap composed of 191 places in 123 ms of which 2 ms to minimize.
[2025-06-01 00:17:59] [INFO ] Deduced a trap composed of 211 places in 127 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/424 variables, 20/254 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2025-06-01 00:18:00] [INFO ] Deduced a trap composed of 199 places in 122 ms of which 3 ms to minimize.
[2025-06-01 00:18:00] [INFO ] Deduced a trap composed of 210 places in 125 ms of which 2 ms to minimize.
[2025-06-01 00:18:00] [INFO ] Deduced a trap composed of 187 places in 129 ms of which 2 ms to minimize.
[2025-06-01 00:18:00] [INFO ] Deduced a trap composed of 188 places in 115 ms of which 2 ms to minimize.
[2025-06-01 00:18:01] [INFO ] Deduced a trap composed of 189 places in 122 ms of which 2 ms to minimize.
[2025-06-01 00:18:01] [INFO ] Deduced a trap composed of 206 places in 127 ms of which 3 ms to minimize.
[2025-06-01 00:18:01] [INFO ] Deduced a trap composed of 208 places in 127 ms of which 2 ms to minimize.
[2025-06-01 00:18:01] [INFO ] Deduced a trap composed of 197 places in 116 ms of which 2 ms to minimize.
[2025-06-01 00:18:01] [INFO ] Deduced a trap composed of 208 places in 114 ms of which 3 ms to minimize.
[2025-06-01 00:18:01] [INFO ] Deduced a trap composed of 197 places in 126 ms of which 2 ms to minimize.
[2025-06-01 00:18:02] [INFO ] Deduced a trap composed of 206 places in 126 ms of which 2 ms to minimize.
[2025-06-01 00:18:02] [INFO ] Deduced a trap composed of 201 places in 128 ms of which 3 ms to minimize.
[2025-06-01 00:18:04] [INFO ] Deduced a trap composed of 210 places in 119 ms of which 2 ms to minimize.
[2025-06-01 00:18:04] [INFO ] Deduced a trap composed of 191 places in 122 ms of which 3 ms to minimize.
[2025-06-01 00:18:04] [INFO ] Deduced a trap composed of 197 places in 122 ms of which 3 ms to minimize.
[2025-06-01 00:18:04] [INFO ] Deduced a trap composed of 172 places in 99 ms of which 2 ms to minimize.
[2025-06-01 00:18:04] [INFO ] Deduced a trap composed of 203 places in 124 ms of which 2 ms to minimize.
[2025-06-01 00:18:04] [INFO ] Deduced a trap composed of 188 places in 120 ms of which 2 ms to minimize.
[2025-06-01 00:18:04] [INFO ] Deduced a trap composed of 179 places in 120 ms of which 2 ms to minimize.
[2025-06-01 00:18:04] [INFO ] Deduced a trap composed of 173 places in 103 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/424 variables, 20/274 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2025-06-01 00:18:07] [INFO ] Deduced a trap composed of 210 places in 128 ms of which 2 ms to minimize.
[2025-06-01 00:18:07] [INFO ] Deduced a trap composed of 196 places in 123 ms of which 3 ms to minimize.
[2025-06-01 00:18:07] [INFO ] Deduced a trap composed of 202 places in 127 ms of which 2 ms to minimize.
[2025-06-01 00:18:07] [INFO ] Deduced a trap composed of 205 places in 119 ms of which 3 ms to minimize.
[2025-06-01 00:18:07] [INFO ] Deduced a trap composed of 180 places in 110 ms of which 2 ms to minimize.
[2025-06-01 00:18:07] [INFO ] Deduced a trap composed of 180 places in 111 ms of which 2 ms to minimize.
[2025-06-01 00:18:07] [INFO ] Deduced a trap composed of 172 places in 98 ms of which 2 ms to minimize.
[2025-06-01 00:18:07] [INFO ] Deduced a trap composed of 193 places in 121 ms of which 2 ms to minimize.
[2025-06-01 00:18:08] [INFO ] Deduced a trap composed of 186 places in 124 ms of which 3 ms to minimize.
[2025-06-01 00:18:08] [INFO ] Deduced a trap composed of 194 places in 124 ms of which 3 ms to minimize.
[2025-06-01 00:18:08] [INFO ] Deduced a trap composed of 177 places in 110 ms of which 2 ms to minimize.
[2025-06-01 00:18:08] [INFO ] Deduced a trap composed of 214 places in 120 ms of which 3 ms to minimize.
[2025-06-01 00:18:08] [INFO ] Deduced a trap composed of 213 places in 120 ms of which 2 ms to minimize.
[2025-06-01 00:18:08] [INFO ] Deduced a trap composed of 237 places in 119 ms of which 2 ms to minimize.
[2025-06-01 00:18:08] [INFO ] Deduced a trap composed of 189 places in 120 ms of which 2 ms to minimize.
[2025-06-01 00:18:09] [INFO ] Deduced a trap composed of 186 places in 130 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 424/827 variables, and 290 constraints, problems are : Problem set: 0 solved, 335 unsolved in 90015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/3 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 0/428 constraints, ReadFeed: 0/12 constraints, PredecessorRefiner: 0/335 constraints, Known Traps: 238/238 constraints]
After SMT, in 141021ms problems are : Problem set: 0 solved, 335 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 335 out of 428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 399/399 transitions.
Applied a total of 0 rules in 9 ms. Remains 428 /428 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 428/428 places, 399/399 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 399/399 transitions.
Applied a total of 0 rules in 9 ms. Remains 428 /428 variables (removed 0) and now considering 399/399 (removed 0) transitions.
[2025-06-01 00:18:09] [INFO ] Invariant cache hit.
[2025-06-01 00:18:09] [INFO ] Implicit Places using invariants in 161 ms returned [20, 26, 221, 346, 419, 425]
[2025-06-01 00:18:09] [INFO ] Actually due to overlaps returned [346, 221]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 170 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 426/428 places, 399/399 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 426 transition count 398
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 425 transition count 398
Applied a total of 2 rules in 17 ms. Remains 425 /426 variables (removed 1) and now considering 398/399 (removed 1) transitions.
// Phase 1: matrix 398 rows 425 cols
[2025-06-01 00:18:09] [INFO ] Computed 52 invariants in 20 ms
[2025-06-01 00:18:09] [INFO ] Implicit Places using invariants in 167 ms returned [20, 26, 416, 422]
[2025-06-01 00:18:09] [INFO ] Actually due to overlaps returned [422, 416]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 168 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 423/428 places, 398/399 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 423 transition count 397
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 422 transition count 397
Applied a total of 2 rules in 16 ms. Remains 422 /423 variables (removed 1) and now considering 397/398 (removed 1) transitions.
// Phase 1: matrix 397 rows 422 cols
[2025-06-01 00:18:09] [INFO ] Computed 50 invariants in 21 ms
[2025-06-01 00:18:09] [INFO ] Implicit Places using invariants in 159 ms returned [20, 26]
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 3 : 420/428 places, 397/399 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 420 transition count 396
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 419 transition count 396
Applied a total of 2 rules in 15 ms. Remains 419 /420 variables (removed 1) and now considering 396/397 (removed 1) transitions.
// Phase 1: matrix 396 rows 419 cols
[2025-06-01 00:18:09] [INFO ] Computed 48 invariants in 21 ms
[2025-06-01 00:18:10] [INFO ] Implicit Places using invariants in 147 ms returned []
[2025-06-01 00:18:10] [INFO ] Invariant cache hit.
[2025-06-01 00:18:10] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-01 00:18:11] [INFO ] Implicit Places using invariants and state equation in 1173 ms returned []
Implicit Place search using SMT with State Equation took 1321 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 419/428 places, 396/399 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 1876 ms. Remains : 419/428 places, 396/399 transitions.
RANDOM walk for 4000000 steps (577002 resets) in 63979 ms. (62 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40000 steps (3623 resets) in 516 ms. (77 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3711 resets) in 519 ms. (76 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40002 steps (3663 resets) in 599 ms. (66 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40002 steps (3706 resets) in 621 ms. (64 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40002 steps (3758 resets) in 841 ms. (47 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3662 resets) in 605 ms. (66 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40002 steps (3672 resets) in 1012 ms. (39 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40000 steps (3605 resets) in 860 ms. (46 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40002 steps (3671 resets) in 631 ms. (63 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40002 steps (3623 resets) in 637 ms. (62 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3715 resets) in 872 ms. (45 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40003 steps (3691 resets) in 636 ms. (62 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40003 steps (3662 resets) in 683 ms. (58 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3615 resets) in 592 ms. (67 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40003 steps (3603 resets) in 596 ms. (67 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40004 steps (3640 resets) in 632 ms. (63 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3636 resets) in 608 ms. (65 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3640 resets) in 607 ms. (65 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40002 steps (3627 resets) in 604 ms. (66 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3694 resets) in 624 ms. (64 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40002 steps (3694 resets) in 607 ms. (65 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3712 resets) in 639 ms. (62 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3663 resets) in 633 ms. (63 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3652 resets) in 627 ms. (63 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40002 steps (3627 resets) in 595 ms. (67 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3638 resets) in 647 ms. (61 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3645 resets) in 1003 ms. (39 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40003 steps (3676 resets) in 1013 ms. (39 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3743 resets) in 834 ms. (47 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40003 steps (3666 resets) in 621 ms. (64 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40000 steps (3673 resets) in 619 ms. (64 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40000 steps (3713 resets) in 607 ms. (65 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3706 resets) in 642 ms. (62 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40003 steps (3735 resets) in 603 ms. (66 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40002 steps (3577 resets) in 610 ms. (65 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40002 steps (3716 resets) in 577 ms. (69 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40002 steps (3625 resets) in 630 ms. (63 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40000 steps (3743 resets) in 651 ms. (61 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40002 steps (3655 resets) in 718 ms. (55 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40002 steps (3597 resets) in 607 ms. (65 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40000 steps (3671 resets) in 842 ms. (47 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40002 steps (3667 resets) in 637 ms. (62 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40002 steps (3698 resets) in 647 ms. (61 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3693 resets) in 640 ms. (62 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3620 resets) in 871 ms. (45 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3644 resets) in 871 ms. (45 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40002 steps (3626 resets) in 746 ms. (53 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3595 resets) in 644 ms. (62 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40000 steps (3645 resets) in 682 ms. (58 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40002 steps (3659 resets) in 610 ms. (65 steps per ms) remains 335/335 properties
Interrupted probabilistic random walk after 3261441 steps, run timeout after 81001 ms. (steps per millisecond=40 ) properties seen :0 out of 335
Probabilistic random walk after 3261441 steps, saw 1630603 distinct states, run finished after 81001 ms. (steps per millisecond=40 ) properties seen :0
[2025-06-01 00:19:59] [INFO ] Invariant cache hit.
[2025-06-01 00:19:59] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/335 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/335 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 56/391 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/391 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 24/415 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/415 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 6 (OVERLAPS) 396/811 variables, 415/461 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/811 variables, 12/473 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/811 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 9 (OVERLAPS) 4/815 variables, 4/477 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/815 variables, 2/479 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/815 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 12 (OVERLAPS) 0/815 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 815/815 variables, and 479 constraints, problems are : Problem set: 0 solved, 335 unsolved in 46672 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 419/419 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/335 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/335 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 56/391 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2025-06-01 00:20:49] [INFO ] Deduced a trap composed of 194 places in 116 ms of which 3 ms to minimize.
[2025-06-01 00:20:49] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 2 ms to minimize.
[2025-06-01 00:20:49] [INFO ] Deduced a trap composed of 130 places in 88 ms of which 1 ms to minimize.
[2025-06-01 00:20:49] [INFO ] Deduced a trap composed of 129 places in 83 ms of which 2 ms to minimize.
[2025-06-01 00:20:49] [INFO ] Deduced a trap composed of 139 places in 85 ms of which 1 ms to minimize.
[2025-06-01 00:20:50] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 1 ms to minimize.
[2025-06-01 00:20:52] [INFO ] Deduced a trap composed of 74 places in 64 ms of which 1 ms to minimize.
[2025-06-01 00:20:52] [INFO ] Deduced a trap composed of 81 places in 59 ms of which 1 ms to minimize.
[2025-06-01 00:20:52] [INFO ] Deduced a trap composed of 116 places in 121 ms of which 2 ms to minimize.
[2025-06-01 00:20:53] [INFO ] Deduced a trap composed of 131 places in 112 ms of which 2 ms to minimize.
[2025-06-01 00:20:53] [INFO ] Deduced a trap composed of 87 places in 115 ms of which 2 ms to minimize.
[2025-06-01 00:20:53] [INFO ] Deduced a trap composed of 88 places in 52 ms of which 0 ms to minimize.
[2025-06-01 00:20:54] [INFO ] Deduced a trap composed of 82 places in 115 ms of which 3 ms to minimize.
[2025-06-01 00:20:54] [INFO ] Deduced a trap composed of 130 places in 116 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/391 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2025-06-01 00:20:55] [INFO ] Deduced a trap composed of 197 places in 126 ms of which 3 ms to minimize.
[2025-06-01 00:20:58] [INFO ] Deduced a trap composed of 76 places in 66 ms of which 1 ms to minimize.
[2025-06-01 00:20:59] [INFO ] Deduced a trap composed of 85 places in 63 ms of which 1 ms to minimize.
[2025-06-01 00:20:59] [INFO ] Deduced a trap composed of 88 places in 125 ms of which 2 ms to minimize.
[2025-06-01 00:21:00] [INFO ] Deduced a trap composed of 91 places in 123 ms of which 3 ms to minimize.
[2025-06-01 00:21:00] [INFO ] Deduced a trap composed of 95 places in 117 ms of which 2 ms to minimize.
[2025-06-01 00:21:00] [INFO ] Deduced a trap composed of 107 places in 123 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/391 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2025-06-01 00:21:01] [INFO ] Deduced a trap composed of 237 places in 116 ms of which 3 ms to minimize.
[2025-06-01 00:21:05] [INFO ] Deduced a trap composed of 202 places in 115 ms of which 2 ms to minimize.
[2025-06-01 00:21:06] [INFO ] Deduced a trap composed of 198 places in 113 ms of which 2 ms to minimize.
[2025-06-01 00:21:06] [INFO ] Deduced a trap composed of 196 places in 111 ms of which 2 ms to minimize.
[2025-06-01 00:21:06] [INFO ] Deduced a trap composed of 109 places in 110 ms of which 2 ms to minimize.
[2025-06-01 00:21:06] [INFO ] Deduced a trap composed of 194 places in 115 ms of which 2 ms to minimize.
[2025-06-01 00:21:06] [INFO ] Deduced a trap composed of 197 places in 121 ms of which 2 ms to minimize.
[2025-06-01 00:21:06] [INFO ] Deduced a trap composed of 101 places in 60 ms of which 1 ms to minimize.
[2025-06-01 00:21:07] [INFO ] Deduced a trap composed of 80 places in 123 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 9/66 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2025-06-01 00:21:07] [INFO ] Deduced a trap composed of 40 places in 118 ms of which 2 ms to minimize.
[2025-06-01 00:21:08] [INFO ] Deduced a trap composed of 180 places in 127 ms of which 3 ms to minimize.
[2025-06-01 00:21:08] [INFO ] Deduced a trap composed of 183 places in 122 ms of which 2 ms to minimize.
[2025-06-01 00:21:08] [INFO ] Deduced a trap composed of 52 places in 86 ms of which 2 ms to minimize.
[2025-06-01 00:21:09] [INFO ] Deduced a trap composed of 57 places in 89 ms of which 2 ms to minimize.
[2025-06-01 00:21:09] [INFO ] Deduced a trap composed of 179 places in 117 ms of which 3 ms to minimize.
[2025-06-01 00:21:10] [INFO ] Deduced a trap composed of 175 places in 118 ms of which 2 ms to minimize.
[2025-06-01 00:21:10] [INFO ] Deduced a trap composed of 103 places in 79 ms of which 2 ms to minimize.
[2025-06-01 00:21:11] [INFO ] Deduced a trap composed of 117 places in 121 ms of which 3 ms to minimize.
[2025-06-01 00:21:11] [INFO ] Deduced a trap composed of 117 places in 127 ms of which 2 ms to minimize.
[2025-06-01 00:21:12] [INFO ] Deduced a trap composed of 194 places in 120 ms of which 2 ms to minimize.
[2025-06-01 00:21:12] [INFO ] Deduced a trap composed of 101 places in 61 ms of which 1 ms to minimize.
[2025-06-01 00:21:14] [INFO ] Deduced a trap composed of 193 places in 126 ms of which 2 ms to minimize.
[2025-06-01 00:21:14] [INFO ] Deduced a trap composed of 195 places in 120 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 14/80 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2025-06-01 00:21:14] [INFO ] Deduced a trap composed of 186 places in 123 ms of which 2 ms to minimize.
[2025-06-01 00:21:14] [INFO ] Deduced a trap composed of 200 places in 116 ms of which 2 ms to minimize.
[2025-06-01 00:21:15] [INFO ] Deduced a trap composed of 212 places in 119 ms of which 3 ms to minimize.
[2025-06-01 00:21:15] [INFO ] Deduced a trap composed of 190 places in 122 ms of which 2 ms to minimize.
[2025-06-01 00:21:15] [INFO ] Deduced a trap composed of 185 places in 125 ms of which 2 ms to minimize.
[2025-06-01 00:21:15] [INFO ] Deduced a trap composed of 200 places in 119 ms of which 2 ms to minimize.
[2025-06-01 00:21:15] [INFO ] Deduced a trap composed of 205 places in 116 ms of which 3 ms to minimize.
[2025-06-01 00:21:15] [INFO ] Deduced a trap composed of 212 places in 127 ms of which 2 ms to minimize.
[2025-06-01 00:21:15] [INFO ] Deduced a trap composed of 201 places in 119 ms of which 3 ms to minimize.
[2025-06-01 00:21:16] [INFO ] Deduced a trap composed of 44 places in 126 ms of which 2 ms to minimize.
[2025-06-01 00:21:16] [INFO ] Deduced a trap composed of 206 places in 112 ms of which 2 ms to minimize.
[2025-06-01 00:21:16] [INFO ] Deduced a trap composed of 212 places in 121 ms of which 2 ms to minimize.
[2025-06-01 00:21:16] [INFO ] Deduced a trap composed of 205 places in 109 ms of which 2 ms to minimize.
[2025-06-01 00:21:16] [INFO ] Deduced a trap composed of 218 places in 113 ms of which 3 ms to minimize.
[2025-06-01 00:21:16] [INFO ] Deduced a trap composed of 205 places in 116 ms of which 3 ms to minimize.
[2025-06-01 00:21:16] [INFO ] Deduced a trap composed of 206 places in 112 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 16/96 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2025-06-01 00:21:25] [INFO ] Deduced a trap composed of 64 places in 84 ms of which 2 ms to minimize.
[2025-06-01 00:21:26] [INFO ] Deduced a trap composed of 187 places in 117 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2025-06-01 00:21:29] [INFO ] Deduced a trap composed of 71 places in 120 ms of which 2 ms to minimize.
[2025-06-01 00:21:29] [INFO ] Deduced a trap composed of 65 places in 115 ms of which 3 ms to minimize.
[2025-06-01 00:21:30] [INFO ] Deduced a trap composed of 62 places in 85 ms of which 1 ms to minimize.
[2025-06-01 00:21:30] [INFO ] Deduced a trap composed of 79 places in 70 ms of which 1 ms to minimize.
[2025-06-01 00:21:31] [INFO ] Deduced a trap composed of 98 places in 67 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/391 variables, 5/103 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2025-06-01 00:21:33] [INFO ] Deduced a trap composed of 198 places in 129 ms of which 2 ms to minimize.
[2025-06-01 00:21:34] [INFO ] Deduced a trap composed of 200 places in 127 ms of which 3 ms to minimize.
[2025-06-01 00:21:34] [INFO ] Deduced a trap composed of 201 places in 124 ms of which 2 ms to minimize.
[2025-06-01 00:21:34] [INFO ] Deduced a trap composed of 205 places in 123 ms of which 2 ms to minimize.
[2025-06-01 00:21:37] [INFO ] Deduced a trap composed of 179 places in 126 ms of which 3 ms to minimize.
[2025-06-01 00:21:37] [INFO ] Deduced a trap composed of 193 places in 123 ms of which 3 ms to minimize.
[2025-06-01 00:21:37] [INFO ] Deduced a trap composed of 184 places in 118 ms of which 3 ms to minimize.
[2025-06-01 00:21:38] [INFO ] Deduced a trap composed of 192 places in 118 ms of which 2 ms to minimize.
[2025-06-01 00:21:38] [INFO ] Deduced a trap composed of 198 places in 114 ms of which 3 ms to minimize.
[2025-06-01 00:21:38] [INFO ] Deduced a trap composed of 107 places in 117 ms of which 2 ms to minimize.
[2025-06-01 00:21:39] [INFO ] Deduced a trap composed of 191 places in 124 ms of which 3 ms to minimize.
[2025-06-01 00:21:39] [INFO ] Deduced a trap composed of 209 places in 120 ms of which 3 ms to minimize.
[2025-06-01 00:21:39] [INFO ] Deduced a trap composed of 132 places in 113 ms of which 3 ms to minimize.
[2025-06-01 00:21:39] [INFO ] Deduced a trap composed of 140 places in 109 ms of which 3 ms to minimize.
[2025-06-01 00:21:39] [INFO ] Deduced a trap composed of 111 places in 65 ms of which 1 ms to minimize.
[2025-06-01 00:21:40] [INFO ] Deduced a trap composed of 110 places in 63 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/391 variables, 16/119 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/391 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 12 (OVERLAPS) 24/415 variables, 10/129 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2025-06-01 00:21:47] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 2 ms to minimize.
[2025-06-01 00:21:47] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 3 ms to minimize.
[2025-06-01 00:21:47] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 2 ms to minimize.
[2025-06-01 00:21:47] [INFO ] Deduced a trap composed of 6 places in 130 ms of which 3 ms to minimize.
[2025-06-01 00:21:47] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 2 ms to minimize.
[2025-06-01 00:21:47] [INFO ] Deduced a trap composed of 186 places in 123 ms of which 2 ms to minimize.
[2025-06-01 00:21:48] [INFO ] Deduced a trap composed of 186 places in 127 ms of which 3 ms to minimize.
[2025-06-01 00:21:48] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 2 ms to minimize.
[2025-06-01 00:21:48] [INFO ] Deduced a trap composed of 34 places in 127 ms of which 3 ms to minimize.
[2025-06-01 00:21:48] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 3 ms to minimize.
[2025-06-01 00:21:48] [INFO ] Deduced a trap composed of 188 places in 124 ms of which 2 ms to minimize.
[2025-06-01 00:21:48] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 2 ms to minimize.
[2025-06-01 00:21:48] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 3 ms to minimize.
[2025-06-01 00:21:49] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 2 ms to minimize.
[2025-06-01 00:21:49] [INFO ] Deduced a trap composed of 28 places in 104 ms of which 2 ms to minimize.
[2025-06-01 00:21:49] [INFO ] Deduced a trap composed of 36 places in 125 ms of which 2 ms to minimize.
[2025-06-01 00:21:49] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 2 ms to minimize.
[2025-06-01 00:21:49] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 3 ms to minimize.
[2025-06-01 00:21:50] [INFO ] Deduced a trap composed of 18 places in 128 ms of which 2 ms to minimize.
[2025-06-01 00:21:50] [INFO ] Deduced a trap composed of 186 places in 123 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/415 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2025-06-01 00:21:50] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 2 ms to minimize.
[2025-06-01 00:21:50] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 2 ms to minimize.
[2025-06-01 00:21:50] [INFO ] Deduced a trap composed of 171 places in 106 ms of which 2 ms to minimize.
[2025-06-01 00:21:51] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 2 ms to minimize.
[2025-06-01 00:21:51] [INFO ] Deduced a trap composed of 182 places in 127 ms of which 2 ms to minimize.
[2025-06-01 00:21:51] [INFO ] Deduced a trap composed of 34 places in 121 ms of which 3 ms to minimize.
[2025-06-01 00:21:51] [INFO ] Deduced a trap composed of 189 places in 124 ms of which 2 ms to minimize.
[2025-06-01 00:21:51] [INFO ] Deduced a trap composed of 179 places in 120 ms of which 2 ms to minimize.
[2025-06-01 00:21:51] [INFO ] Deduced a trap composed of 161 places in 116 ms of which 2 ms to minimize.
[2025-06-01 00:21:52] [INFO ] Deduced a trap composed of 194 places in 120 ms of which 2 ms to minimize.
[2025-06-01 00:21:52] [INFO ] Deduced a trap composed of 184 places in 126 ms of which 2 ms to minimize.
[2025-06-01 00:21:52] [INFO ] Deduced a trap composed of 174 places in 124 ms of which 2 ms to minimize.
[2025-06-01 00:21:52] [INFO ] Deduced a trap composed of 198 places in 120 ms of which 2 ms to minimize.
[2025-06-01 00:21:52] [INFO ] Deduced a trap composed of 181 places in 118 ms of which 3 ms to minimize.
[2025-06-01 00:21:52] [INFO ] Deduced a trap composed of 180 places in 111 ms of which 3 ms to minimize.
[2025-06-01 00:21:52] [INFO ] Deduced a trap composed of 174 places in 115 ms of which 3 ms to minimize.
[2025-06-01 00:21:52] [INFO ] Deduced a trap composed of 172 places in 116 ms of which 3 ms to minimize.
[2025-06-01 00:21:53] [INFO ] Deduced a trap composed of 191 places in 118 ms of which 3 ms to minimize.
[2025-06-01 00:21:53] [INFO ] Deduced a trap composed of 173 places in 113 ms of which 2 ms to minimize.
[2025-06-01 00:21:53] [INFO ] Deduced a trap composed of 152 places in 121 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/415 variables, 20/169 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2025-06-01 00:21:53] [INFO ] Deduced a trap composed of 166 places in 102 ms of which 2 ms to minimize.
[2025-06-01 00:21:54] [INFO ] Deduced a trap composed of 202 places in 127 ms of which 3 ms to minimize.
[2025-06-01 00:21:54] [INFO ] Deduced a trap composed of 194 places in 119 ms of which 2 ms to minimize.
[2025-06-01 00:21:54] [INFO ] Deduced a trap composed of 192 places in 124 ms of which 3 ms to minimize.
[2025-06-01 00:21:54] [INFO ] Deduced a trap composed of 190 places in 118 ms of which 3 ms to minimize.
[2025-06-01 00:21:55] [INFO ] Deduced a trap composed of 212 places in 115 ms of which 2 ms to minimize.
[2025-06-01 00:21:55] [INFO ] Deduced a trap composed of 214 places in 120 ms of which 2 ms to minimize.
[2025-06-01 00:21:55] [INFO ] Deduced a trap composed of 178 places in 123 ms of which 3 ms to minimize.
[2025-06-01 00:21:55] [INFO ] Deduced a trap composed of 193 places in 120 ms of which 2 ms to minimize.
[2025-06-01 00:21:55] [INFO ] Deduced a trap composed of 211 places in 126 ms of which 3 ms to minimize.
[2025-06-01 00:21:55] [INFO ] Deduced a trap composed of 176 places in 98 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/415 variables, 11/180 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2025-06-01 00:22:01] [INFO ] Deduced a trap composed of 203 places in 124 ms of which 3 ms to minimize.
[2025-06-01 00:22:01] [INFO ] Deduced a trap composed of 192 places in 132 ms of which 3 ms to minimize.
[2025-06-01 00:22:01] [INFO ] Deduced a trap composed of 192 places in 124 ms of which 2 ms to minimize.
[2025-06-01 00:22:01] [INFO ] Deduced a trap composed of 188 places in 125 ms of which 3 ms to minimize.
[2025-06-01 00:22:01] [INFO ] Deduced a trap composed of 184 places in 133 ms of which 3 ms to minimize.
[2025-06-01 00:22:02] [INFO ] Deduced a trap composed of 179 places in 120 ms of which 3 ms to minimize.
[2025-06-01 00:22:02] [INFO ] Deduced a trap composed of 199 places in 122 ms of which 3 ms to minimize.
[2025-06-01 00:22:02] [INFO ] Deduced a trap composed of 194 places in 117 ms of which 2 ms to minimize.
[2025-06-01 00:22:02] [INFO ] Deduced a trap composed of 190 places in 113 ms of which 3 ms to minimize.
[2025-06-01 00:22:02] [INFO ] Deduced a trap composed of 200 places in 115 ms of which 3 ms to minimize.
[2025-06-01 00:22:02] [INFO ] Deduced a trap composed of 201 places in 118 ms of which 2 ms to minimize.
[2025-06-01 00:22:02] [INFO ] Deduced a trap composed of 204 places in 117 ms of which 3 ms to minimize.
[2025-06-01 00:22:03] [INFO ] Deduced a trap composed of 196 places in 116 ms of which 2 ms to minimize.
[2025-06-01 00:22:03] [INFO ] Deduced a trap composed of 199 places in 116 ms of which 2 ms to minimize.
[2025-06-01 00:22:03] [INFO ] Deduced a trap composed of 178 places in 123 ms of which 2 ms to minimize.
[2025-06-01 00:22:03] [INFO ] Deduced a trap composed of 208 places in 128 ms of which 3 ms to minimize.
[2025-06-01 00:22:03] [INFO ] Deduced a trap composed of 191 places in 129 ms of which 2 ms to minimize.
[2025-06-01 00:22:03] [INFO ] Deduced a trap composed of 203 places in 123 ms of which 2 ms to minimize.
[2025-06-01 00:22:03] [INFO ] Deduced a trap composed of 199 places in 116 ms of which 2 ms to minimize.
[2025-06-01 00:22:03] [INFO ] Deduced a trap composed of 209 places in 131 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/415 variables, 20/200 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2025-06-01 00:22:04] [INFO ] Deduced a trap composed of 204 places in 131 ms of which 3 ms to minimize.
[2025-06-01 00:22:04] [INFO ] Deduced a trap composed of 204 places in 126 ms of which 2 ms to minimize.
[2025-06-01 00:22:04] [INFO ] Deduced a trap composed of 201 places in 124 ms of which 2 ms to minimize.
[2025-06-01 00:22:04] [INFO ] Deduced a trap composed of 191 places in 128 ms of which 3 ms to minimize.
[2025-06-01 00:22:05] [INFO ] Deduced a trap composed of 189 places in 125 ms of which 3 ms to minimize.
[2025-06-01 00:22:05] [INFO ] Deduced a trap composed of 186 places in 124 ms of which 3 ms to minimize.
[2025-06-01 00:22:05] [INFO ] Deduced a trap composed of 187 places in 125 ms of which 3 ms to minimize.
[2025-06-01 00:22:05] [INFO ] Deduced a trap composed of 192 places in 127 ms of which 2 ms to minimize.
[2025-06-01 00:22:05] [INFO ] Deduced a trap composed of 194 places in 124 ms of which 3 ms to minimize.
[2025-06-01 00:22:05] [INFO ] Deduced a trap composed of 193 places in 130 ms of which 3 ms to minimize.
[2025-06-01 00:22:06] [INFO ] Deduced a trap composed of 199 places in 121 ms of which 2 ms to minimize.
[2025-06-01 00:22:06] [INFO ] Deduced a trap composed of 199 places in 114 ms of which 2 ms to minimize.
[2025-06-01 00:22:06] [INFO ] Deduced a trap composed of 205 places in 126 ms of which 3 ms to minimize.
[2025-06-01 00:22:06] [INFO ] Deduced a trap composed of 193 places in 124 ms of which 3 ms to minimize.
[2025-06-01 00:22:06] [INFO ] Deduced a trap composed of 215 places in 118 ms of which 2 ms to minimize.
[2025-06-01 00:22:06] [INFO ] Deduced a trap composed of 204 places in 119 ms of which 3 ms to minimize.
[2025-06-01 00:22:07] [INFO ] Deduced a trap composed of 168 places in 136 ms of which 2 ms to minimize.
[2025-06-01 00:22:07] [INFO ] Deduced a trap composed of 162 places in 132 ms of which 3 ms to minimize.
[2025-06-01 00:22:07] [INFO ] Deduced a trap composed of 169 places in 128 ms of which 3 ms to minimize.
[2025-06-01 00:22:07] [INFO ] Deduced a trap composed of 178 places in 119 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/415 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2025-06-01 00:22:08] [INFO ] Deduced a trap composed of 126 places in 129 ms of which 3 ms to minimize.
[2025-06-01 00:22:08] [INFO ] Deduced a trap composed of 135 places in 125 ms of which 3 ms to minimize.
[2025-06-01 00:22:08] [INFO ] Deduced a trap composed of 165 places in 120 ms of which 3 ms to minimize.
[2025-06-01 00:22:08] [INFO ] Deduced a trap composed of 134 places in 123 ms of which 3 ms to minimize.
[2025-06-01 00:22:09] [INFO ] Deduced a trap composed of 143 places in 123 ms of which 3 ms to minimize.
[2025-06-01 00:22:09] [INFO ] Deduced a trap composed of 185 places in 122 ms of which 3 ms to minimize.
[2025-06-01 00:22:09] [INFO ] Deduced a trap composed of 173 places in 132 ms of which 3 ms to minimize.
[2025-06-01 00:22:09] [INFO ] Deduced a trap composed of 175 places in 131 ms of which 3 ms to minimize.
[2025-06-01 00:22:09] [INFO ] Deduced a trap composed of 142 places in 129 ms of which 3 ms to minimize.
[2025-06-01 00:22:09] [INFO ] Deduced a trap composed of 141 places in 128 ms of which 3 ms to minimize.
[2025-06-01 00:22:09] [INFO ] Deduced a trap composed of 136 places in 125 ms of which 3 ms to minimize.
[2025-06-01 00:22:10] [INFO ] Deduced a trap composed of 147 places in 122 ms of which 3 ms to minimize.
[2025-06-01 00:22:10] [INFO ] Deduced a trap composed of 195 places in 124 ms of which 3 ms to minimize.
[2025-06-01 00:22:10] [INFO ] Deduced a trap composed of 182 places in 118 ms of which 2 ms to minimize.
[2025-06-01 00:22:10] [INFO ] Deduced a trap composed of 162 places in 119 ms of which 3 ms to minimize.
[2025-06-01 00:22:10] [INFO ] Deduced a trap composed of 146 places in 124 ms of which 2 ms to minimize.
[2025-06-01 00:22:10] [INFO ] Deduced a trap composed of 146 places in 117 ms of which 2 ms to minimize.
[2025-06-01 00:22:10] [INFO ] Deduced a trap composed of 146 places in 123 ms of which 3 ms to minimize.
[2025-06-01 00:22:10] [INFO ] Deduced a trap composed of 160 places in 123 ms of which 2 ms to minimize.
[2025-06-01 00:22:11] [INFO ] Deduced a trap composed of 160 places in 128 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/415 variables, 20/240 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2025-06-01 00:22:12] [INFO ] Deduced a trap composed of 197 places in 125 ms of which 3 ms to minimize.
[2025-06-01 00:22:12] [INFO ] Deduced a trap composed of 186 places in 128 ms of which 3 ms to minimize.
[2025-06-01 00:22:12] [INFO ] Deduced a trap composed of 188 places in 126 ms of which 3 ms to minimize.
[2025-06-01 00:22:12] [INFO ] Deduced a trap composed of 198 places in 130 ms of which 3 ms to minimize.
[2025-06-01 00:22:12] [INFO ] Deduced a trap composed of 191 places in 119 ms of which 2 ms to minimize.
[2025-06-01 00:22:12] [INFO ] Deduced a trap composed of 190 places in 119 ms of which 2 ms to minimize.
[2025-06-01 00:22:13] [INFO ] Deduced a trap composed of 190 places in 114 ms of which 3 ms to minimize.
[2025-06-01 00:22:13] [INFO ] Deduced a trap composed of 189 places in 119 ms of which 2 ms to minimize.
[2025-06-01 00:22:13] [INFO ] Deduced a trap composed of 191 places in 128 ms of which 3 ms to minimize.
[2025-06-01 00:22:13] [INFO ] Deduced a trap composed of 199 places in 121 ms of which 2 ms to minimize.
[2025-06-01 00:22:13] [INFO ] Deduced a trap composed of 183 places in 119 ms of which 2 ms to minimize.
[2025-06-01 00:22:13] [INFO ] Deduced a trap composed of 187 places in 122 ms of which 2 ms to minimize.
[2025-06-01 00:22:13] [INFO ] Deduced a trap composed of 190 places in 125 ms of which 3 ms to minimize.
[2025-06-01 00:22:13] [INFO ] Deduced a trap composed of 186 places in 127 ms of which 3 ms to minimize.
[2025-06-01 00:22:14] [INFO ] Deduced a trap composed of 194 places in 115 ms of which 2 ms to minimize.
[2025-06-01 00:22:14] [INFO ] Deduced a trap composed of 204 places in 127 ms of which 3 ms to minimize.
[2025-06-01 00:22:14] [INFO ] Deduced a trap composed of 187 places in 121 ms of which 2 ms to minimize.
[2025-06-01 00:22:14] [INFO ] Deduced a trap composed of 187 places in 118 ms of which 3 ms to minimize.
[2025-06-01 00:22:14] [INFO ] Deduced a trap composed of 200 places in 122 ms of which 3 ms to minimize.
[2025-06-01 00:22:14] [INFO ] Deduced a trap composed of 190 places in 123 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/415 variables, 20/260 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2025-06-01 00:22:15] [INFO ] Deduced a trap composed of 225 places in 121 ms of which 2 ms to minimize.
[2025-06-01 00:22:15] [INFO ] Deduced a trap composed of 226 places in 123 ms of which 3 ms to minimize.
[2025-06-01 00:22:15] [INFO ] Deduced a trap composed of 208 places in 119 ms of which 2 ms to minimize.
[2025-06-01 00:22:15] [INFO ] Deduced a trap composed of 224 places in 140 ms of which 3 ms to minimize.
[2025-06-01 00:22:16] [INFO ] Deduced a trap composed of 233 places in 114 ms of which 2 ms to minimize.
[2025-06-01 00:22:16] [INFO ] Deduced a trap composed of 197 places in 121 ms of which 2 ms to minimize.
[2025-06-01 00:22:16] [INFO ] Deduced a trap composed of 221 places in 124 ms of which 2 ms to minimize.
[2025-06-01 00:22:16] [INFO ] Deduced a trap composed of 213 places in 127 ms of which 2 ms to minimize.
[2025-06-01 00:22:17] [INFO ] Deduced a trap composed of 198 places in 129 ms of which 3 ms to minimize.
[2025-06-01 00:22:17] [INFO ] Deduced a trap composed of 179 places in 121 ms of which 2 ms to minimize.
[2025-06-01 00:22:17] [INFO ] Deduced a trap composed of 200 places in 120 ms of which 3 ms to minimize.
[2025-06-01 00:22:17] [INFO ] Deduced a trap composed of 213 places in 124 ms of which 2 ms to minimize.
[2025-06-01 00:22:17] [INFO ] Deduced a trap composed of 200 places in 122 ms of which 3 ms to minimize.
[2025-06-01 00:22:17] [INFO ] Deduced a trap composed of 200 places in 121 ms of which 2 ms to minimize.
[2025-06-01 00:22:17] [INFO ] Deduced a trap composed of 197 places in 122 ms of which 2 ms to minimize.
[2025-06-01 00:22:17] [INFO ] Deduced a trap composed of 206 places in 134 ms of which 2 ms to minimize.
[2025-06-01 00:22:18] [INFO ] Deduced a trap composed of 200 places in 118 ms of which 2 ms to minimize.
[2025-06-01 00:22:18] [INFO ] Deduced a trap composed of 195 places in 128 ms of which 2 ms to minimize.
[2025-06-01 00:22:18] [INFO ] Deduced a trap composed of 187 places in 121 ms of which 3 ms to minimize.
[2025-06-01 00:22:18] [INFO ] Deduced a trap composed of 207 places in 123 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/415 variables, 20/280 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2025-06-01 00:22:19] [INFO ] Deduced a trap composed of 185 places in 123 ms of which 3 ms to minimize.
[2025-06-01 00:22:19] [INFO ] Deduced a trap composed of 181 places in 119 ms of which 3 ms to minimize.
[2025-06-01 00:22:20] [INFO ] Deduced a trap composed of 177 places in 130 ms of which 3 ms to minimize.
[2025-06-01 00:22:20] [INFO ] Deduced a trap composed of 188 places in 128 ms of which 3 ms to minimize.
[2025-06-01 00:22:20] [INFO ] Deduced a trap composed of 195 places in 129 ms of which 3 ms to minimize.
[2025-06-01 00:22:20] [INFO ] Deduced a trap composed of 200 places in 124 ms of which 2 ms to minimize.
[2025-06-01 00:22:20] [INFO ] Deduced a trap composed of 188 places in 125 ms of which 3 ms to minimize.
[2025-06-01 00:22:20] [INFO ] Deduced a trap composed of 179 places in 123 ms of which 2 ms to minimize.
[2025-06-01 00:22:20] [INFO ] Deduced a trap composed of 182 places in 118 ms of which 2 ms to minimize.
[2025-06-01 00:22:21] [INFO ] Deduced a trap composed of 179 places in 120 ms of which 2 ms to minimize.
[2025-06-01 00:22:21] [INFO ] Deduced a trap composed of 191 places in 132 ms of which 3 ms to minimize.
[2025-06-01 00:22:21] [INFO ] Deduced a trap composed of 197 places in 131 ms of which 3 ms to minimize.
[2025-06-01 00:22:21] [INFO ] Deduced a trap composed of 185 places in 126 ms of which 3 ms to minimize.
[2025-06-01 00:22:21] [INFO ] Deduced a trap composed of 183 places in 130 ms of which 3 ms to minimize.
[2025-06-01 00:22:21] [INFO ] Deduced a trap composed of 203 places in 130 ms of which 2 ms to minimize.
[2025-06-01 00:22:21] [INFO ] Deduced a trap composed of 192 places in 121 ms of which 3 ms to minimize.
[2025-06-01 00:22:22] [INFO ] Deduced a trap composed of 195 places in 125 ms of which 3 ms to minimize.
[2025-06-01 00:22:22] [INFO ] Deduced a trap composed of 183 places in 122 ms of which 3 ms to minimize.
[2025-06-01 00:22:22] [INFO ] Deduced a trap composed of 190 places in 126 ms of which 2 ms to minimize.
[2025-06-01 00:22:22] [INFO ] Deduced a trap composed of 202 places in 123 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/415 variables, 20/300 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2025-06-01 00:22:24] [INFO ] Deduced a trap composed of 177 places in 127 ms of which 3 ms to minimize.
[2025-06-01 00:22:24] [INFO ] Deduced a trap composed of 194 places in 120 ms of which 3 ms to minimize.
[2025-06-01 00:22:24] [INFO ] Deduced a trap composed of 199 places in 120 ms of which 2 ms to minimize.
[2025-06-01 00:22:24] [INFO ] Deduced a trap composed of 208 places in 118 ms of which 2 ms to minimize.
[2025-06-01 00:22:24] [INFO ] Deduced a trap composed of 185 places in 119 ms of which 2 ms to minimize.
[2025-06-01 00:22:24] [INFO ] Deduced a trap composed of 180 places in 117 ms of which 2 ms to minimize.
[2025-06-01 00:22:24] [INFO ] Deduced a trap composed of 197 places in 121 ms of which 3 ms to minimize.
[2025-06-01 00:22:24] [INFO ] Deduced a trap composed of 180 places in 119 ms of which 3 ms to minimize.
[2025-06-01 00:22:25] [INFO ] Deduced a trap composed of 187 places in 118 ms of which 2 ms to minimize.
[2025-06-01 00:22:25] [INFO ] Deduced a trap composed of 183 places in 128 ms of which 3 ms to minimize.
[2025-06-01 00:22:25] [INFO ] Deduced a trap composed of 187 places in 121 ms of which 2 ms to minimize.
[2025-06-01 00:22:25] [INFO ] Deduced a trap composed of 188 places in 117 ms of which 3 ms to minimize.
[2025-06-01 00:22:25] [INFO ] Deduced a trap composed of 183 places in 118 ms of which 2 ms to minimize.
[2025-06-01 00:22:25] [INFO ] Deduced a trap composed of 199 places in 120 ms of which 2 ms to minimize.
[2025-06-01 00:22:26] [INFO ] Deduced a trap composed of 189 places in 130 ms of which 3 ms to minimize.
[2025-06-01 00:22:26] [INFO ] Deduced a trap composed of 191 places in 126 ms of which 3 ms to minimize.
[2025-06-01 00:22:26] [INFO ] Deduced a trap composed of 178 places in 120 ms of which 3 ms to minimize.
[2025-06-01 00:22:26] [INFO ] Deduced a trap composed of 187 places in 116 ms of which 2 ms to minimize.
[2025-06-01 00:22:27] [INFO ] Deduced a trap composed of 157 places in 130 ms of which 3 ms to minimize.
[2025-06-01 00:22:27] [INFO ] Deduced a trap composed of 165 places in 127 ms of which 3 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/415 variables, 20/320 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2025-06-01 00:22:28] [INFO ] Deduced a trap composed of 156 places in 112 ms of which 3 ms to minimize.
[2025-06-01 00:22:29] [INFO ] Deduced a trap composed of 160 places in 117 ms of which 3 ms to minimize.
[2025-06-01 00:22:29] [INFO ] Deduced a trap composed of 168 places in 99 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s1 0)
(s2 0)
(s3 0)
(s4 1)
(s5 1)
(s7 1)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 2)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 1)
(s31 1)
(s32 1)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 1)
(s122 0)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 1)
(s178 1)
(s179 0)
(s180 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 415/815 variables, and 323 constraints, problems are : Problem set: 0 solved, 335 unsolved in 105012 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/419 constraints, ReadFeed: 0/12 constraints, PredecessorRefiner: 0/335 constraints, Known Traps: 277/277 constraints]
After SMT, in 151715ms problems are : Problem set: 0 solved, 335 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 335 out of 419 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 396/396 transitions.
Applied a total of 0 rules in 8 ms. Remains 419 /419 variables (removed 0) and now considering 396/396 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 419/419 places, 396/396 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 396/396 transitions.
Applied a total of 0 rules in 7 ms. Remains 419 /419 variables (removed 0) and now considering 396/396 (removed 0) transitions.
[2025-06-01 00:22:31] [INFO ] Invariant cache hit.
[2025-06-01 00:22:31] [INFO ] Implicit Places using invariants in 132 ms returned []
[2025-06-01 00:22:31] [INFO ] Invariant cache hit.
[2025-06-01 00:22:31] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-01 00:22:32] [INFO ] Implicit Places using invariants and state equation in 1241 ms returned []
Implicit Place search using SMT with State Equation took 1374 ms to find 0 implicit places.
[2025-06-01 00:22:32] [INFO ] Redundant transitions in 27 ms returned []
Running 395 sub problems to find dead transitions.
[2025-06-01 00:22:32] [INFO ] Invariant cache hit.
[2025-06-01 00:22:32] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/414 variables, 39/41 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/414 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 3 (OVERLAPS) 2/416 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 395 unsolved
[2025-06-01 00:22:40] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 2 ms to minimize.
[2025-06-01 00:22:41] [INFO ] Deduced a trap composed of 50 places in 86 ms of which 2 ms to minimize.
[2025-06-01 00:22:41] [INFO ] Deduced a trap composed of 127 places in 85 ms of which 1 ms to minimize.
[2025-06-01 00:22:42] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 1 ms to minimize.
[2025-06-01 00:22:42] [INFO ] Deduced a trap composed of 45 places in 92 ms of which 2 ms to minimize.
[2025-06-01 00:22:42] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 2 ms to minimize.
[2025-06-01 00:22:42] [INFO ] Deduced a trap composed of 62 places in 84 ms of which 2 ms to minimize.
[2025-06-01 00:22:43] [INFO ] Deduced a trap composed of 138 places in 87 ms of which 2 ms to minimize.
[2025-06-01 00:22:43] [INFO ] Deduced a trap composed of 147 places in 81 ms of which 1 ms to minimize.
[2025-06-01 00:22:43] [INFO ] Deduced a trap composed of 74 places in 70 ms of which 2 ms to minimize.
[2025-06-01 00:22:44] [INFO ] Deduced a trap composed of 52 places in 88 ms of which 1 ms to minimize.
[2025-06-01 00:22:44] [INFO ] Deduced a trap composed of 57 places in 79 ms of which 2 ms to minimize.
[2025-06-01 00:22:45] [INFO ] Deduced a trap composed of 69 places in 78 ms of which 2 ms to minimize.
[2025-06-01 00:22:46] [INFO ] Deduced a trap composed of 110 places in 71 ms of which 1 ms to minimize.
[2025-06-01 00:22:46] [INFO ] Deduced a trap composed of 76 places in 68 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/416 variables, 15/61 constraints. Problems are: Problem set: 0 solved, 395 unsolved
[2025-06-01 00:22:49] [INFO ] Deduced a trap composed of 152 places in 95 ms of which 2 ms to minimize.
[2025-06-01 00:22:49] [INFO ] Deduced a trap composed of 116 places in 76 ms of which 1 ms to minimize.
[2025-06-01 00:22:50] [INFO ] Deduced a trap composed of 112 places in 71 ms of which 1 ms to minimize.
[2025-06-01 00:22:51] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 1 ms to minimize.
[2025-06-01 00:22:51] [INFO ] Deduced a trap composed of 130 places in 69 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/416 variables, 5/66 constraints. Problems are: Problem set: 0 solved, 395 unsolved
[2025-06-01 00:22:53] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 2 ms to minimize.
[2025-06-01 00:22:54] [INFO ] Deduced a trap composed of 35 places in 101 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/416 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 395 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 416/815 variables, and 68 constraints, problems are : Problem set: 0 solved, 395 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 39/41 constraints, State Equation: 0/419 constraints, ReadFeed: 0/12 constraints, PredecessorRefiner: 395/395 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 395 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/414 variables, 39/41 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/414 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 3 (OVERLAPS) 2/416 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/416 variables, 22/68 constraints. Problems are: Problem set: 0 solved, 395 unsolved
[2025-06-01 00:23:10] [INFO ] Deduced a trap composed of 87 places in 54 ms of which 1 ms to minimize.
[2025-06-01 00:23:10] [INFO ] Deduced a trap composed of 82 places in 55 ms of which 1 ms to minimize.
[2025-06-01 00:23:10] [INFO ] Deduced a trap composed of 88 places in 59 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/416 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 395 unsolved
[2025-06-01 00:23:16] [INFO ] Deduced a trap composed of 85 places in 57 ms of which 1 ms to minimize.
[2025-06-01 00:23:16] [INFO ] Deduced a trap composed of 88 places in 66 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/416 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 8 (OVERLAPS) 3/419 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 395 unsolved
[2025-06-01 00:23:27] [INFO ] Deduced a trap composed of 83 places in 55 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/419 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 395 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 419/815 variables, and 76 constraints, problems are : Problem set: 0 solved, 395 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/419 constraints, ReadFeed: 0/12 constraints, PredecessorRefiner: 0/395 constraints, Known Traps: 28/28 constraints]
After SMT, in 60103ms problems are : Problem set: 0 solved, 395 unsolved
Search for dead transitions found 0 dead transitions in 60109ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61530 ms. Remains : 419/419 places, 396/396 transitions.
RANDOM walk for 400000 steps (57507 resets) in 7832 ms. (51 steps per ms) remains 335/335 properties
Running SMT prover for 335 properties.
[2025-06-01 00:23:34] [INFO ] Invariant cache hit.
[2025-06-01 00:23:35] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2025-06-01 00:23:35] [INFO ] [Real]Absence check using 7 positive and 41 generalized place invariants in 11 ms returned sat
[2025-06-01 00:23:36] [INFO ] After 1062ms SMT Verify possible using state equation in real domain returned unsat :0 sat :335
[2025-06-01 00:23:36] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-01 00:23:37] [INFO ] After 1089ms SMT Verify possible using 12 Read/Feed constraints in real domain returned unsat :0 sat :335
TRAPS : Iteration 0
[2025-06-01 00:23:46] [INFO ] After 10399ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:335
[2025-06-01 00:23:46] [INFO ] After 11773ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:335
[2025-06-01 00:23:46] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2025-06-01 00:23:46] [INFO ] [Nat]Absence check using 7 positive and 41 generalized place invariants in 11 ms returned sat
[2025-06-01 00:23:48] [INFO ] After 1185ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :335
[2025-06-01 00:23:49] [INFO ] After 1188ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :335
TRAPS : Iteration 0
[2025-06-01 00:23:49] [INFO ] Deduced a trap composed of 18 places in 127 ms of which 3 ms to minimize.
[2025-06-01 00:23:49] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 2 ms to minimize.
[2025-06-01 00:23:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 302 ms
[2025-06-01 00:23:50] [INFO ] Deduced a trap composed of 166 places in 135 ms of which 3 ms to minimize.
[2025-06-01 00:23:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2025-06-01 00:23:50] [INFO ] Deduced a trap composed of 28 places in 138 ms of which 3 ms to minimize.
[2025-06-01 00:23:50] [INFO ] Deduced a trap composed of 132 places in 130 ms of which 3 ms to minimize.
[2025-06-01 00:23:51] [INFO ] Deduced a trap composed of 147 places in 135 ms of which 3 ms to minimize.
[2025-06-01 00:23:51] [INFO ] Deduced a trap composed of 165 places in 132 ms of which 2 ms to minimize.
[2025-06-01 00:23:51] [INFO ] Deduced a trap composed of 157 places in 128 ms of which 3 ms to minimize.
[2025-06-01 00:23:51] [INFO ] Deduced a trap composed of 153 places in 127 ms of which 3 ms to minimize.
[2025-06-01 00:23:51] [INFO ] Deduced a trap composed of 155 places in 130 ms of which 2 ms to minimize.
[2025-06-01 00:23:51] [INFO ] Deduced a trap composed of 173 places in 126 ms of which 3 ms to minimize.
[2025-06-01 00:23:52] [INFO ] Deduced a trap composed of 123 places in 136 ms of which 3 ms to minimize.
[2025-06-01 00:23:52] [INFO ] Deduced a trap composed of 170 places in 126 ms of which 2 ms to minimize.
[2025-06-01 00:23:52] [INFO ] Deduced a trap composed of 151 places in 121 ms of which 2 ms to minimize.
[2025-06-01 00:23:52] [INFO ] Deduced a trap composed of 133 places in 120 ms of which 3 ms to minimize.
[2025-06-01 00:23:52] [INFO ] Deduced a trap composed of 27 places in 140 ms of which 2 ms to minimize.
[2025-06-01 00:23:52] [INFO ] Deduced a trap composed of 142 places in 132 ms of which 2 ms to minimize.
[2025-06-01 00:23:53] [INFO ] Deduced a trap composed of 168 places in 132 ms of which 2 ms to minimize.
[2025-06-01 00:23:53] [INFO ] Deduced a trap composed of 157 places in 131 ms of which 3 ms to minimize.
[2025-06-01 00:23:53] [INFO ] Deduced a trap composed of 172 places in 132 ms of which 2 ms to minimize.
[2025-06-01 00:23:53] [INFO ] Deduced a trap composed of 147 places in 126 ms of which 3 ms to minimize.
[2025-06-01 00:23:53] [INFO ] Deduced a trap composed of 139 places in 132 ms of which 3 ms to minimize.
[2025-06-01 00:23:53] [INFO ] Deduced a trap composed of 161 places in 133 ms of which 3 ms to minimize.
[2025-06-01 00:23:53] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 3149 ms
[2025-06-01 00:23:54] [INFO ] Deduced a trap composed of 126 places in 106 ms of which 3 ms to minimize.
[2025-06-01 00:23:54] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 2 ms to minimize.
[2025-06-01 00:23:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 257 ms
[2025-06-01 00:23:54] [INFO ] Deduced a trap composed of 126 places in 107 ms of which 2 ms to minimize.
[2025-06-01 00:23:54] [INFO ] Deduced a trap composed of 142 places in 103 ms of which 2 ms to minimize.
[2025-06-01 00:23:55] [INFO ] Deduced a trap composed of 131 places in 104 ms of which 2 ms to minimize.
[2025-06-01 00:23:55] [INFO ] Deduced a trap composed of 38 places in 106 ms of which 2 ms to minimize.
[2025-06-01 00:23:55] [INFO ] Deduced a trap composed of 118 places in 97 ms of which 2 ms to minimize.
[2025-06-01 00:23:55] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 639 ms
[2025-06-01 00:23:55] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 2 ms to minimize.
[2025-06-01 00:23:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 140 ms
[2025-06-01 00:23:56] [INFO ] Deduced a trap composed of 57 places in 85 ms of which 2 ms to minimize.
[2025-06-01 00:23:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2025-06-01 00:23:56] [INFO ] Deduced a trap composed of 50 places in 88 ms of which 1 ms to minimize.
[2025-06-01 00:23:57] [INFO ] Deduced a trap composed of 52 places in 86 ms of which 2 ms to minimize.
[2025-06-01 00:23:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 233 ms
[2025-06-01 00:23:57] [INFO ] Deduced a trap composed of 156 places in 126 ms of which 2 ms to minimize.
[2025-06-01 00:23:57] [INFO ] Deduced a trap composed of 118 places in 127 ms of which 3 ms to minimize.
[2025-06-01 00:23:57] [INFO ] Deduced a trap composed of 161 places in 129 ms of which 2 ms to minimize.
[2025-06-01 00:23:57] [INFO ] Deduced a trap composed of 156 places in 127 ms of which 3 ms to minimize.
[2025-06-01 00:23:58] [INFO ] Deduced a trap composed of 179 places in 137 ms of which 3 ms to minimize.
[2025-06-01 00:23:58] [INFO ] Deduced a trap composed of 156 places in 133 ms of which 2 ms to minimize.
[2025-06-01 00:23:58] [INFO ] Deduced a trap composed of 165 places in 131 ms of which 3 ms to minimize.
[2025-06-01 00:23:58] [INFO ] Deduced a trap composed of 108 places in 130 ms of which 3 ms to minimize.
[2025-06-01 00:23:58] [INFO ] Deduced a trap composed of 155 places in 134 ms of which 2 ms to minimize.
[2025-06-01 00:23:58] [INFO ] Deduced a trap composed of 164 places in 130 ms of which 2 ms to minimize.
[2025-06-01 00:23:59] [INFO ] Deduced a trap composed of 167 places in 138 ms of which 2 ms to minimize.
[2025-06-01 00:23:59] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 3 ms to minimize.
[2025-06-01 00:23:59] [INFO ] Deduced a trap composed of 130 places in 135 ms of which 3 ms to minimize.
[2025-06-01 00:23:59] [INFO ] Deduced a trap composed of 155 places in 124 ms of which 3 ms to minimize.
[2025-06-01 00:23:59] [INFO ] Deduced a trap composed of 159 places in 120 ms of which 3 ms to minimize.
[2025-06-01 00:23:59] [INFO ] Deduced a trap composed of 128 places in 124 ms of which 3 ms to minimize.
[2025-06-01 00:23:59] [INFO ] Deduced a trap composed of 173 places in 119 ms of which 3 ms to minimize.
[2025-06-01 00:24:00] [INFO ] Deduced a trap composed of 130 places in 123 ms of which 3 ms to minimize.
[2025-06-01 00:24:00] [INFO ] Deduced a trap composed of 153 places in 130 ms of which 3 ms to minimize.
[2025-06-01 00:24:00] [INFO ] Deduced a trap composed of 158 places in 138 ms of which 3 ms to minimize.
[2025-06-01 00:24:00] [INFO ] Deduced a trap composed of 166 places in 137 ms of which 3 ms to minimize.
[2025-06-01 00:24:00] [INFO ] Deduced a trap composed of 147 places in 128 ms of which 3 ms to minimize.
[2025-06-01 00:24:00] [INFO ] Deduced a trap composed of 166 places in 128 ms of which 3 ms to minimize.
[2025-06-01 00:24:01] [INFO ] Deduced a trap composed of 164 places in 130 ms of which 2 ms to minimize.
[2025-06-01 00:24:01] [INFO ] Deduced a trap composed of 131 places in 127 ms of which 2 ms to minimize.
[2025-06-01 00:24:01] [INFO ] Deduced a trap composed of 115 places in 122 ms of which 2 ms to minimize.
[2025-06-01 00:24:01] [INFO ] Deduced a trap composed of 157 places in 128 ms of which 2 ms to minimize.
[2025-06-01 00:24:01] [INFO ] Deduced a trap composed of 136 places in 131 ms of which 2 ms to minimize.
[2025-06-01 00:24:01] [INFO ] Deduced a trap composed of 182 places in 126 ms of which 2 ms to minimize.
[2025-06-01 00:24:01] [INFO ] Deduced a trap composed of 164 places in 121 ms of which 3 ms to minimize.
[2025-06-01 00:24:02] [INFO ] Deduced a trap composed of 182 places in 135 ms of which 3 ms to minimize.
[2025-06-01 00:24:02] [INFO ] Deduced a trap composed of 163 places in 128 ms of which 3 ms to minimize.
[2025-06-01 00:24:02] [INFO ] Deduced a trap composed of 124 places in 120 ms of which 2 ms to minimize.
[2025-06-01 00:24:02] [INFO ] Deduced a trap composed of 161 places in 138 ms of which 3 ms to minimize.
[2025-06-01 00:24:02] [INFO ] Deduced a trap composed of 127 places in 122 ms of which 3 ms to minimize.
[2025-06-01 00:24:02] [INFO ] Deduced a trap composed of 162 places in 124 ms of which 3 ms to minimize.
[2025-06-01 00:24:02] [INFO ] Deduced a trap composed of 176 places in 130 ms of which 3 ms to minimize.
[2025-06-01 00:24:03] [INFO ] Deduced a trap composed of 137 places in 127 ms of which 3 ms to minimize.
[2025-06-01 00:24:03] [INFO ] Deduced a trap composed of 130 places in 129 ms of which 2 ms to minimize.
[2025-06-01 00:24:03] [INFO ] Deduced a trap composed of 167 places in 121 ms of which 2 ms to minimize.
[2025-06-01 00:24:03] [INFO ] Deduced a trap composed of 168 places in 123 ms of which 3 ms to minimize.
[2025-06-01 00:24:03] [INFO ] Deduced a trap composed of 129 places in 128 ms of which 3 ms to minimize.
[2025-06-01 00:24:03] [INFO ] Deduced a trap composed of 170 places in 126 ms of which 3 ms to minimize.
[2025-06-01 00:24:04] [INFO ] Deduced a trap composed of 164 places in 140 ms of which 2 ms to minimize.
[2025-06-01 00:24:04] [INFO ] Deduced a trap composed of 176 places in 124 ms of which 2 ms to minimize.
[2025-06-01 00:24:04] [INFO ] Deduced a trap composed of 113 places in 134 ms of which 3 ms to minimize.
[2025-06-01 00:24:04] [INFO ] Deduced a trap composed of 156 places in 124 ms of which 3 ms to minimize.
[2025-06-01 00:24:04] [INFO ] Deduced a trap composed of 159 places in 120 ms of which 2 ms to minimize.
[2025-06-01 00:24:04] [INFO ] Deduced a trap composed of 159 places in 127 ms of which 2 ms to minimize.
[2025-06-01 00:24:04] [INFO ] Trap strengthening (SAT) tested/added 50/49 trap constraints in 7605 ms
[2025-06-01 00:24:05] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 3 ms to minimize.
[2025-06-01 00:24:05] [INFO ] Deduced a trap composed of 3 places in 136 ms of which 2 ms to minimize.
[2025-06-01 00:24:05] [INFO ] Deduced a trap composed of 34 places in 132 ms of which 2 ms to minimize.
[2025-06-01 00:24:05] [INFO ] Deduced a trap composed of 4 places in 133 ms of which 3 ms to minimize.
[2025-06-01 00:24:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 636 ms
[2025-06-01 00:24:06] [INFO ] Deduced a trap composed of 69 places in 84 ms of which 2 ms to minimize.
[2025-06-01 00:24:06] [INFO ] Deduced a trap composed of 105 places in 81 ms of which 2 ms to minimize.
[2025-06-01 00:24:06] [INFO ] Deduced a trap composed of 62 places in 81 ms of which 2 ms to minimize.
[2025-06-01 00:24:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 383 ms
[2025-06-01 00:24:10] [INFO ] Deduced a trap composed of 112 places in 96 ms of which 1 ms to minimize.
[2025-06-01 00:24:11] [INFO ] Deduced a trap composed of 58 places in 95 ms of which 1 ms to minimize.
[2025-06-01 00:24:11] [INFO ] Deduced a trap composed of 64 places in 91 ms of which 2 ms to minimize.
[2025-06-01 00:24:11] [INFO ] Deduced a trap composed of 113 places in 97 ms of which 2 ms to minimize.
[2025-06-01 00:24:11] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 565 ms
[2025-06-01 00:24:11] [INFO ] Deduced a trap composed of 82 places in 68 ms of which 1 ms to minimize.
[2025-06-01 00:24:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2025-06-01 00:24:12] [INFO ] Deduced a trap composed of 45 places in 82 ms of which 2 ms to minimize.
[2025-06-01 00:24:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2025-06-01 00:24:12] [INFO ] Deduced a trap composed of 100 places in 68 ms of which 1 ms to minimize.
[2025-06-01 00:24:12] [INFO ] Deduced a trap composed of 94 places in 67 ms of which 1 ms to minimize.
[2025-06-01 00:24:12] [INFO ] Deduced a trap composed of 76 places in 68 ms of which 1 ms to minimize.
[2025-06-01 00:24:12] [INFO ] Deduced a trap composed of 100 places in 69 ms of which 2 ms to minimize.
[2025-06-01 00:24:13] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 404 ms
[2025-06-01 00:24:14] [INFO ] Deduced a trap composed of 114 places in 82 ms of which 2 ms to minimize.
[2025-06-01 00:24:14] [INFO ] Deduced a trap composed of 101 places in 83 ms of which 1 ms to minimize.
[2025-06-01 00:24:15] [INFO ] Deduced a trap composed of 121 places in 77 ms of which 1 ms to minimize.
[2025-06-01 00:24:15] [INFO ] Deduced a trap composed of 74 places in 78 ms of which 2 ms to minimize.
[2025-06-01 00:24:15] [INFO ] Deduced a trap composed of 127 places in 81 ms of which 1 ms to minimize.
[2025-06-01 00:24:15] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 991 ms
[2025-06-01 00:24:15] [INFO ] Deduced a trap composed of 88 places in 64 ms of which 1 ms to minimize.
[2025-06-01 00:24:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2025-06-01 00:24:17] [INFO ] Deduced a trap composed of 88 places in 63 ms of which 1 ms to minimize.
[2025-06-01 00:24:17] [INFO ] Deduced a trap composed of 91 places in 66 ms of which 1 ms to minimize.
[2025-06-01 00:24:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 202 ms
[2025-06-01 00:24:18] [INFO ] Deduced a trap composed of 109 places in 71 ms of which 1 ms to minimize.
[2025-06-01 00:24:18] [INFO ] Deduced a trap composed of 109 places in 68 ms of which 1 ms to minimize.
[2025-06-01 00:24:18] [INFO ] Deduced a trap composed of 84 places in 59 ms of which 1 ms to minimize.
[2025-06-01 00:24:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 324 ms
[2025-06-01 00:24:19] [INFO ] Deduced a trap composed of 82 places in 53 ms of which 1 ms to minimize.
[2025-06-01 00:24:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2025-06-01 00:24:19] [INFO ] Deduced a trap composed of 80 places in 62 ms of which 1 ms to minimize.
[2025-06-01 00:24:19] [INFO ] Deduced a trap composed of 81 places in 67 ms of which 1 ms to minimize.
[2025-06-01 00:24:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 211 ms
[2025-06-01 00:24:20] [INFO ] Deduced a trap composed of 87 places in 57 ms of which 1 ms to minimize.
[2025-06-01 00:24:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
TRAPS : Iteration 1
[2025-06-01 00:24:22] [INFO ] Deduced a trap composed of 143 places in 117 ms of which 3 ms to minimize.
[2025-06-01 00:24:23] [INFO ] Deduced a trap composed of 137 places in 107 ms of which 2 ms to minimize.
[2025-06-01 00:24:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 317 ms
[2025-06-01 00:24:24] [INFO ] Deduced a trap composed of 134 places in 110 ms of which 2 ms to minimize.
[2025-06-01 00:24:24] [INFO ] Deduced a trap composed of 142 places in 102 ms of which 2 ms to minimize.
[2025-06-01 00:24:25] [INFO ] Deduced a trap composed of 138 places in 95 ms of which 2 ms to minimize.
[2025-06-01 00:24:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 402 ms
[2025-06-01 00:24:28] [INFO ] Deduced a trap composed of 120 places in 91 ms of which 2 ms to minimize.
[2025-06-01 00:24:28] [INFO ] Deduced a trap composed of 123 places in 95 ms of which 2 ms to minimize.
[2025-06-01 00:24:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 253 ms
[2025-06-01 00:24:34] [INFO ] Deduced a trap composed of 57 places in 83 ms of which 2 ms to minimize.
[2025-06-01 00:24:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 147 ms
[2025-06-01 00:24:38] [INFO ] Deduced a trap composed of 85 places in 64 ms of which 1 ms to minimize.
[2025-06-01 00:24:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2025-06-01 00:24:40] [INFO ] Deduced a trap composed of 93 places in 62 ms of which 1 ms to minimize.
[2025-06-01 00:24:40] [INFO ] Deduced a trap composed of 101 places in 60 ms of which 1 ms to minimize.
[2025-06-01 00:24:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 196 ms
TRAPS : Iteration 2
[2025-06-01 00:24:41] [INFO ] Deduced a trap composed of 149 places in 111 ms of which 2 ms to minimize.
[2025-06-01 00:24:41] [INFO ] Deduced a trap composed of 130 places in 106 ms of which 2 ms to minimize.
[2025-06-01 00:24:41] [INFO ] Deduced a trap composed of 146 places in 106 ms of which 3 ms to minimize.
[2025-06-01 00:24:41] [INFO ] Deduced a trap composed of 137 places in 108 ms of which 2 ms to minimize.
[2025-06-01 00:24:41] [INFO ] Deduced a trap composed of 130 places in 109 ms of which 2 ms to minimize.
[2025-06-01 00:24:41] [INFO ] Deduced a trap composed of 135 places in 103 ms of which 3 ms to minimize.
[2025-06-01 00:24:42] [INFO ] Deduced a trap composed of 132 places in 111 ms of which 2 ms to minimize.
[2025-06-01 00:24:42] [INFO ] Deduced a trap composed of 132 places in 115 ms of which 2 ms to minimize.
[2025-06-01 00:24:42] [INFO ] Deduced a trap composed of 145 places in 108 ms of which 3 ms to minimize.
[2025-06-01 00:24:42] [INFO ] Deduced a trap composed of 136 places in 108 ms of which 2 ms to minimize.
[2025-06-01 00:24:42] [INFO ] Deduced a trap composed of 127 places in 111 ms of which 2 ms to minimize.
[2025-06-01 00:24:42] [INFO ] Deduced a trap composed of 131 places in 114 ms of which 2 ms to minimize.
[2025-06-01 00:24:42] [INFO ] Deduced a trap composed of 136 places in 118 ms of which 2 ms to minimize.
[2025-06-01 00:24:43] [INFO ] Deduced a trap composed of 132 places in 108 ms of which 2 ms to minimize.
[2025-06-01 00:24:43] [INFO ] Deduced a trap composed of 131 places in 102 ms of which 2 ms to minimize.
[2025-06-01 00:24:43] [INFO ] Deduced a trap composed of 150 places in 118 ms of which 3 ms to minimize.
[2025-06-01 00:24:43] [INFO ] Deduced a trap composed of 137 places in 109 ms of which 2 ms to minimize.
[2025-06-01 00:24:43] [INFO ] Deduced a trap composed of 135 places in 103 ms of which 2 ms to minimize.
[2025-06-01 00:24:43] [INFO ] Deduced a trap composed of 131 places in 109 ms of which 2 ms to minimize.
[2025-06-01 00:24:43] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2538 ms
[2025-06-01 00:24:44] [INFO ] Deduced a trap composed of 131 places in 105 ms of which 2 ms to minimize.
[2025-06-01 00:24:44] [INFO ] Deduced a trap composed of 136 places in 101 ms of which 2 ms to minimize.
[2025-06-01 00:24:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 277 ms
[2025-06-01 00:24:48] [INFO ] Deduced a trap composed of 130 places in 96 ms of which 2 ms to minimize.
[2025-06-01 00:24:48] [INFO ] Deduced a trap composed of 116 places in 82 ms of which 1 ms to minimize.
[2025-06-01 00:24:48] [INFO ] Deduced a trap composed of 119 places in 92 ms of which 2 ms to minimize.
[2025-06-01 00:24:48] [INFO ] Deduced a trap composed of 124 places in 88 ms of which 2 ms to minimize.
[2025-06-01 00:24:48] [INFO ] Deduced a trap composed of 122 places in 94 ms of which 2 ms to minimize.
[2025-06-01 00:24:48] [INFO ] Deduced a trap composed of 112 places in 94 ms of which 2 ms to minimize.
[2025-06-01 00:24:49] [INFO ] Deduced a trap composed of 140 places in 85 ms of which 2 ms to minimize.
[2025-06-01 00:24:49] [INFO ] Deduced a trap composed of 114 places in 94 ms of which 2 ms to minimize.
[2025-06-01 00:24:49] [INFO ] Deduced a trap composed of 120 places in 87 ms of which 2 ms to minimize.
[2025-06-01 00:24:49] [INFO ] Deduced a trap composed of 120 places in 86 ms of which 2 ms to minimize.
[2025-06-01 00:24:49] [INFO ] Deduced a trap composed of 133 places in 92 ms of which 1 ms to minimize.
[2025-06-01 00:24:49] [INFO ] Deduced a trap composed of 114 places in 89 ms of which 2 ms to minimize.
[2025-06-01 00:24:49] [INFO ] Deduced a trap composed of 124 places in 89 ms of which 2 ms to minimize.
[2025-06-01 00:24:49] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1504 ms
[2025-06-01 00:24:54] [INFO ] Deduced a trap composed of 109 places in 82 ms of which 1 ms to minimize.
[2025-06-01 00:24:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2025-06-01 00:24:59] [INFO ] Deduced a trap composed of 103 places in 66 ms of which 1 ms to minimize.
[2025-06-01 00:24:59] [INFO ] Deduced a trap composed of 101 places in 70 ms of which 2 ms to minimize.
[2025-06-01 00:25:00] [INFO ] Deduced a trap composed of 116 places in 66 ms of which 2 ms to minimize.
[2025-06-01 00:25:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 288 ms
TRAPS : Iteration 3
[2025-06-01 00:25:03] [INFO ] Deduced a trap composed of 153 places in 117 ms of which 2 ms to minimize.
[2025-06-01 00:25:03] [INFO ] Deduced a trap composed of 138 places in 108 ms of which 3 ms to minimize.
[2025-06-01 00:25:03] [INFO ] Deduced a trap composed of 139 places in 111 ms of which 2 ms to minimize.
[2025-06-01 00:25:03] [INFO ] Deduced a trap composed of 155 places in 104 ms of which 3 ms to minimize.
[2025-06-01 00:25:03] [INFO ] Deduced a trap composed of 136 places in 107 ms of which 2 ms to minimize.
[2025-06-01 00:25:04] [INFO ] Deduced a trap composed of 149 places in 104 ms of which 2 ms to minimize.
[2025-06-01 00:25:04] [INFO ] Deduced a trap composed of 140 places in 103 ms of which 2 ms to minimize.
[2025-06-01 00:25:04] [INFO ] Deduced a trap composed of 139 places in 113 ms of which 2 ms to minimize.
[2025-06-01 00:25:04] [INFO ] Deduced a trap composed of 149 places in 117 ms of which 2 ms to minimize.
[2025-06-01 00:25:04] [INFO ] Deduced a trap composed of 144 places in 110 ms of which 2 ms to minimize.
[2025-06-01 00:25:04] [INFO ] Deduced a trap composed of 143 places in 114 ms of which 2 ms to minimize.
[2025-06-01 00:25:04] [INFO ] Deduced a trap composed of 151 places in 116 ms of which 2 ms to minimize.
[2025-06-01 00:25:05] [INFO ] Deduced a trap composed of 157 places in 116 ms of which 2 ms to minimize.
[2025-06-01 00:25:05] [INFO ] Deduced a trap composed of 159 places in 106 ms of which 2 ms to minimize.
[2025-06-01 00:25:05] [INFO ] Deduced a trap composed of 146 places in 108 ms of which 2 ms to minimize.
[2025-06-01 00:25:05] [INFO ] Deduced a trap composed of 150 places in 111 ms of which 3 ms to minimize.
[2025-06-01 00:25:05] [INFO ] Deduced a trap composed of 146 places in 107 ms of which 3 ms to minimize.
[2025-06-01 00:25:05] [INFO ] Deduced a trap composed of 150 places in 100 ms of which 2 ms to minimize.
[2025-06-01 00:25:05] [INFO ] Deduced a trap composed of 153 places in 102 ms of which 2 ms to minimize.
[2025-06-01 00:25:05] [INFO ] Deduced a trap composed of 150 places in 103 ms of which 2 ms to minimize.
[2025-06-01 00:25:06] [INFO ] Deduced a trap composed of 150 places in 103 ms of which 3 ms to minimize.
[2025-06-01 00:25:06] [INFO ] Deduced a trap composed of 163 places in 103 ms of which 3 ms to minimize.
[2025-06-01 00:25:06] [INFO ] Deduced a trap composed of 171 places in 105 ms of which 3 ms to minimize.
[2025-06-01 00:25:06] [INFO ] Deduced a trap composed of 161 places in 103 ms of which 2 ms to minimize.
[2025-06-01 00:25:06] [INFO ] Deduced a trap composed of 158 places in 99 ms of which 2 ms to minimize.
[2025-06-01 00:25:06] [INFO ] Deduced a trap composed of 152 places in 111 ms of which 2 ms to minimize.
[2025-06-01 00:25:06] [INFO ] Deduced a trap composed of 145 places in 103 ms of which 2 ms to minimize.
[2025-06-01 00:25:06] [INFO ] Deduced a trap composed of 153 places in 100 ms of which 2 ms to minimize.
[2025-06-01 00:25:07] [INFO ] Deduced a trap composed of 143 places in 111 ms of which 2 ms to minimize.
[2025-06-01 00:25:07] [INFO ] Deduced a trap composed of 169 places in 109 ms of which 2 ms to minimize.
[2025-06-01 00:25:07] [INFO ] Deduced a trap composed of 141 places in 115 ms of which 2 ms to minimize.
[2025-06-01 00:25:07] [INFO ] Deduced a trap composed of 162 places in 111 ms of which 2 ms to minimize.
[2025-06-01 00:25:07] [INFO ] Deduced a trap composed of 153 places in 118 ms of which 2 ms to minimize.
[2025-06-01 00:25:07] [INFO ] Deduced a trap composed of 144 places in 108 ms of which 2 ms to minimize.
[2025-06-01 00:25:07] [INFO ] Deduced a trap composed of 150 places in 102 ms of which 2 ms to minimize.
[2025-06-01 00:25:08] [INFO ] Deduced a trap composed of 132 places in 112 ms of which 2 ms to minimize.
[2025-06-01 00:25:08] [INFO ] Deduced a trap composed of 139 places in 106 ms of which 2 ms to minimize.
[2025-06-01 00:25:08] [INFO ] Deduced a trap composed of 148 places in 114 ms of which 2 ms to minimize.
[2025-06-01 00:25:08] [INFO ] Deduced a trap composed of 132 places in 114 ms of which 2 ms to minimize.
[2025-06-01 00:25:08] [INFO ] Deduced a trap composed of 125 places in 104 ms of which 3 ms to minimize.
[2025-06-01 00:25:08] [INFO ] Deduced a trap composed of 129 places in 103 ms of which 2 ms to minimize.
[2025-06-01 00:25:08] [INFO ] Deduced a trap composed of 128 places in 101 ms of which 2 ms to minimize.
[2025-06-01 00:25:09] [INFO ] Deduced a trap composed of 134 places in 100 ms of which 2 ms to minimize.
[2025-06-01 00:25:09] [INFO ] Deduced a trap composed of 128 places in 105 ms of which 3 ms to minimize.
[2025-06-01 00:25:09] [INFO ] Deduced a trap composed of 149 places in 107 ms of which 2 ms to minimize.
[2025-06-01 00:25:09] [INFO ] Deduced a trap composed of 128 places in 104 ms of which 2 ms to minimize.
[2025-06-01 00:25:09] [INFO ] Deduced a trap composed of 140 places in 104 ms of which 2 ms to minimize.
[2025-06-01 00:25:09] [INFO ] Deduced a trap composed of 153 places in 101 ms of which 2 ms to minimize.
[2025-06-01 00:25:09] [INFO ] Deduced a trap composed of 152 places in 105 ms of which 2 ms to minimize.
[2025-06-01 00:25:09] [INFO ] Deduced a trap composed of 147 places in 109 ms of which 2 ms to minimize.
[2025-06-01 00:25:10] [INFO ] Deduced a trap composed of 147 places in 106 ms of which 3 ms to minimize.
[2025-06-01 00:25:10] [INFO ] Deduced a trap composed of 141 places in 103 ms of which 2 ms to minimize.
[2025-06-01 00:25:10] [INFO ] Deduced a trap composed of 147 places in 106 ms of which 2 ms to minimize.
[2025-06-01 00:25:10] [INFO ] Deduced a trap composed of 143 places in 100 ms of which 2 ms to minimize.
[2025-06-01 00:25:10] [INFO ] Deduced a trap composed of 149 places in 101 ms of which 2 ms to minimize.
[2025-06-01 00:25:10] [INFO ] Deduced a trap composed of 154 places in 105 ms of which 2 ms to minimize.
[2025-06-01 00:25:10] [INFO ] Deduced a trap composed of 146 places in 98 ms of which 2 ms to minimize.
[2025-06-01 00:25:10] [INFO ] Deduced a trap composed of 149 places in 111 ms of which 2 ms to minimize.
[2025-06-01 00:25:11] [INFO ] Deduced a trap composed of 155 places in 110 ms of which 2 ms to minimize.
[2025-06-01 00:25:11] [INFO ] Deduced a trap composed of 165 places in 113 ms of which 2 ms to minimize.
[2025-06-01 00:25:11] [INFO ] Trap strengthening (SAT) tested/added 61/60 trap constraints in 8114 ms
[2025-06-01 00:25:29] [INFO ] Deduced a trap composed of 172 places in 127 ms of which 2 ms to minimize.
[2025-06-01 00:25:29] [INFO ] Deduced a trap composed of 127 places in 121 ms of which 2 ms to minimize.
[2025-06-01 00:25:29] [INFO ] Deduced a trap composed of 129 places in 117 ms of which 2 ms to minimize.
[2025-06-01 00:25:29] [INFO ] Deduced a trap composed of 177 places in 123 ms of which 3 ms to minimize.
[2025-06-01 00:25:30] [INFO ] Deduced a trap composed of 131 places in 118 ms of which 3 ms to minimize.
[2025-06-01 00:25:30] [INFO ] Deduced a trap composed of 127 places in 125 ms of which 2 ms to minimize.
[2025-06-01 00:25:30] [INFO ] Deduced a trap composed of 127 places in 131 ms of which 2 ms to minimize.
[2025-06-01 00:25:30] [INFO ] Deduced a trap composed of 162 places in 124 ms of which 3 ms to minimize.
[2025-06-01 00:25:30] [INFO ] Deduced a trap composed of 110 places in 120 ms of which 2 ms to minimize.
[2025-06-01 00:25:30] [INFO ] Deduced a trap composed of 119 places in 121 ms of which 2 ms to minimize.
[2025-06-01 00:25:31] [INFO ] Deduced a trap composed of 121 places in 117 ms of which 3 ms to minimize.
[2025-06-01 00:25:31] [INFO ] Deduced a trap composed of 169 places in 122 ms of which 2 ms to minimize.
[2025-06-01 00:25:31] [INFO ] Deduced a trap composed of 118 places in 122 ms of which 2 ms to minimize.
[2025-06-01 00:25:31] [INFO ] Deduced a trap composed of 129 places in 118 ms of which 3 ms to minimize.
[2025-06-01 00:25:32] [INFO ] Deduced a trap composed of 119 places in 121 ms of which 2 ms to minimize.
[2025-06-01 00:25:32] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 3 ms to minimize.
[2025-06-01 00:25:32] [INFO ] Deduced a trap composed of 45 places in 121 ms of which 3 ms to minimize.
[2025-06-01 00:25:32] [INFO ] Deduced a trap composed of 177 places in 117 ms of which 2 ms to minimize.
[2025-06-01 00:25:32] [INFO ] Deduced a trap composed of 184 places in 115 ms of which 2 ms to minimize.
[2025-06-01 00:25:32] [INFO ] Deduced a trap composed of 174 places in 111 ms of which 2 ms to minimize.
[2025-06-01 00:25:33] [INFO ] Deduced a trap composed of 188 places in 119 ms of which 3 ms to minimize.
[2025-06-01 00:25:33] [INFO ] Deduced a trap composed of 205 places in 118 ms of which 2 ms to minimize.
[2025-06-01 00:25:33] [INFO ] Deduced a trap composed of 167 places in 119 ms of which 2 ms to minimize.
[2025-06-01 00:25:33] [INFO ] Deduced a trap composed of 183 places in 122 ms of which 2 ms to minimize.
[2025-06-01 00:25:33] [INFO ] Deduced a trap composed of 130 places in 116 ms of which 2 ms to minimize.
[2025-06-01 00:25:34] [INFO ] Deduced a trap composed of 179 places in 127 ms of which 2 ms to minimize.
[2025-06-01 00:25:34] [INFO ] Deduced a trap composed of 173 places in 118 ms of which 3 ms to minimize.
[2025-06-01 00:25:34] [INFO ] Deduced a trap composed of 199 places in 122 ms of which 3 ms to minimize.
[2025-06-01 00:25:34] [INFO ] Deduced a trap composed of 171 places in 120 ms of which 2 ms to minimize.
[2025-06-01 00:25:34] [INFO ] Deduced a trap composed of 174 places in 126 ms of which 3 ms to minimize.
[2025-06-01 00:25:34] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 5371 ms
[2025-06-01 00:25:41] [INFO ] Deduced a trap composed of 69 places in 69 ms of which 1 ms to minimize.
[2025-06-01 00:25:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
TRAPS : Iteration 4
[2025-06-01 00:25:46] [INFO ] Deduced a trap composed of 146 places in 112 ms of which 2 ms to minimize.
[2025-06-01 00:25:46] [INFO ] Deduced a trap composed of 153 places in 110 ms of which 2 ms to minimize.
[2025-06-01 00:25:47] [INFO ] Deduced a trap composed of 171 places in 113 ms of which 2 ms to minimize.
[2025-06-01 00:25:47] [INFO ] Deduced a trap composed of 167 places in 111 ms of which 3 ms to minimize.
[2025-06-01 00:25:47] [INFO ] Deduced a trap composed of 166 places in 116 ms of which 2 ms to minimize.
[2025-06-01 00:25:47] [INFO ] Deduced a trap composed of 158 places in 112 ms of which 2 ms to minimize.
[2025-06-01 00:25:47] [INFO ] Deduced a trap composed of 170 places in 118 ms of which 3 ms to minimize.
[2025-06-01 00:25:47] [INFO ] Deduced a trap composed of 155 places in 114 ms of which 3 ms to minimize.
[2025-06-01 00:25:47] [INFO ] Deduced a trap composed of 161 places in 108 ms of which 3 ms to minimize.
[2025-06-01 00:25:48] [INFO ] Deduced a trap composed of 165 places in 113 ms of which 2 ms to minimize.
[2025-06-01 00:25:48] [INFO ] Deduced a trap composed of 157 places in 107 ms of which 2 ms to minimize.
[2025-06-01 00:25:48] [INFO ] Deduced a trap composed of 138 places in 111 ms of which 2 ms to minimize.
[2025-06-01 00:25:48] [INFO ] Deduced a trap composed of 135 places in 116 ms of which 3 ms to minimize.
[2025-06-01 00:25:48] [INFO ] Deduced a trap composed of 162 places in 112 ms of which 2 ms to minimize.
[2025-06-01 00:25:48] [INFO ] Deduced a trap composed of 141 places in 106 ms of which 2 ms to minimize.
[2025-06-01 00:25:48] [INFO ] Deduced a trap composed of 150 places in 107 ms of which 2 ms to minimize.
[2025-06-01 00:25:49] [INFO ] Deduced a trap composed of 147 places in 107 ms of which 2 ms to minimize.
[2025-06-01 00:25:49] [INFO ] Deduced a trap composed of 167 places in 123 ms of which 2 ms to minimize.
[2025-06-01 00:25:49] [INFO ] Deduced a trap composed of 153 places in 109 ms of which 2 ms to minimize.
[2025-06-01 00:25:49] [INFO ] Deduced a trap composed of 142 places in 108 ms of which 2 ms to minimize.
[2025-06-01 00:25:49] [INFO ] Deduced a trap composed of 142 places in 107 ms of which 2 ms to minimize.
[2025-06-01 00:25:49] [INFO ] Deduced a trap composed of 150 places in 111 ms of which 2 ms to minimize.
[2025-06-01 00:25:49] [INFO ] Deduced a trap composed of 135 places in 104 ms of which 2 ms to minimize.
[2025-06-01 00:25:50] [INFO ] Deduced a trap composed of 143 places in 107 ms of which 2 ms to minimize.
[2025-06-01 00:25:50] [INFO ] Deduced a trap composed of 137 places in 106 ms of which 3 ms to minimize.
[2025-06-01 00:25:50] [INFO ] Deduced a trap composed of 147 places in 107 ms of which 2 ms to minimize.
[2025-06-01 00:25:50] [INFO ] Deduced a trap composed of 155 places in 109 ms of which 3 ms to minimize.
[2025-06-01 00:25:50] [INFO ] Deduced a trap composed of 159 places in 104 ms of which 2 ms to minimize.
[2025-06-01 00:25:50] [INFO ] Deduced a trap composed of 140 places in 109 ms of which 3 ms to minimize.
[2025-06-01 00:25:50] [INFO ] Deduced a trap composed of 152 places in 105 ms of which 3 ms to minimize.
[2025-06-01 00:25:50] [INFO ] Deduced a trap composed of 148 places in 112 ms of which 2 ms to minimize.
[2025-06-01 00:25:51] [INFO ] Deduced a trap composed of 144 places in 104 ms of which 2 ms to minimize.
[2025-06-01 00:25:51] [INFO ] Deduced a trap composed of 150 places in 113 ms of which 3 ms to minimize.
[2025-06-01 00:25:51] [INFO ] Deduced a trap composed of 147 places in 106 ms of which 2 ms to minimize.
[2025-06-01 00:25:51] [INFO ] Deduced a trap composed of 145 places in 106 ms of which 2 ms to minimize.
[2025-06-01 00:25:51] [INFO ] Deduced a trap composed of 158 places in 111 ms of which 2 ms to minimize.
[2025-06-01 00:25:51] [INFO ] Deduced a trap composed of 166 places in 106 ms of which 2 ms to minimize.
[2025-06-01 00:25:51] [INFO ] Deduced a trap composed of 170 places in 106 ms of which 2 ms to minimize.
[2025-06-01 00:25:51] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 5218 ms
[2025-06-01 00:25:54] [INFO ] Deduced a trap composed of 160 places in 125 ms of which 2 ms to minimize.
[2025-06-01 00:25:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2025-06-01 00:25:55] [INFO ] Deduced a trap composed of 120 places in 95 ms of which 2 ms to minimize.
[2025-06-01 00:25:55] [INFO ] Deduced a trap composed of 127 places in 97 ms of which 2 ms to minimize.
[2025-06-01 00:25:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 304 ms
[2025-06-01 00:25:57] [INFO ] Deduced a trap composed of 119 places in 100 ms of which 1 ms to minimize.
[2025-06-01 00:25:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 200 ms
[2025-06-01 00:26:00] [INFO ] Deduced a trap composed of 128 places in 89 ms of which 1 ms to minimize.
[2025-06-01 00:26:00] [INFO ] Deduced a trap composed of 134 places in 84 ms of which 2 ms to minimize.
[2025-06-01 00:26:00] [INFO ] Deduced a trap composed of 134 places in 91 ms of which 2 ms to minimize.
[2025-06-01 00:26:01] [INFO ] Deduced a trap composed of 120 places in 93 ms of which 2 ms to minimize.
[2025-06-01 00:26:01] [INFO ] Deduced a trap composed of 124 places in 93 ms of which 1 ms to minimize.
[2025-06-01 00:26:01] [INFO ] Deduced a trap composed of 122 places in 87 ms of which 1 ms to minimize.
[2025-06-01 00:26:01] [INFO ] Deduced a trap composed of 124 places in 87 ms of which 2 ms to minimize.
[2025-06-01 00:26:01] [INFO ] Deduced a trap composed of 132 places in 96 ms of which 2 ms to minimize.
[2025-06-01 00:26:02] [INFO ] Deduced a trap composed of 123 places in 89 ms of which 2 ms to minimize.
[2025-06-01 00:26:02] [INFO ] Deduced a trap composed of 124 places in 86 ms of which 2 ms to minimize.
[2025-06-01 00:26:02] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2009 ms
TRAPS : Iteration 5
[2025-06-01 00:26:36] [INFO ] Deduced a trap composed of 142 places in 127 ms of which 2 ms to minimize.
[2025-06-01 00:26:36] [INFO ] Deduced a trap composed of 143 places in 121 ms of which 3 ms to minimize.
[2025-06-01 00:26:37] [INFO ] Deduced a trap composed of 102 places in 119 ms of which 2 ms to minimize.
[2025-06-01 00:26:37] [INFO ] Deduced a trap composed of 174 places in 125 ms of which 3 ms to minimize.
[2025-06-01 00:26:37] [INFO ] Deduced a trap composed of 185 places in 121 ms of which 2 ms to minimize.
[2025-06-01 00:26:37] [INFO ] Deduced a trap composed of 103 places in 113 ms of which 2 ms to minimize.
[2025-06-01 00:26:37] [INFO ] Deduced a trap composed of 159 places in 121 ms of which 3 ms to minimize.
[2025-06-01 00:26:38] [INFO ] Deduced a trap composed of 178 places in 118 ms of which 3 ms to minimize.
[2025-06-01 00:26:38] [INFO ] Deduced a trap composed of 149 places in 118 ms of which 2 ms to minimize.
[2025-06-01 00:26:38] [INFO ] Deduced a trap composed of 160 places in 114 ms of which 2 ms to minimize.
[2025-06-01 00:26:38] [INFO ] Deduced a trap composed of 118 places in 116 ms of which 3 ms to minimize.
[2025-06-01 00:26:40] [INFO ] Deduced a trap composed of 169 places in 119 ms of which 2 ms to minimize.
[2025-06-01 00:26:40] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3578 ms
[2025-06-01 00:26:43] [INFO ] Deduced a trap composed of 155 places in 119 ms of which 3 ms to minimize.
[2025-06-01 00:26:43] [INFO ] Deduced a trap composed of 102 places in 118 ms of which 2 ms to minimize.
[2025-06-01 00:26:43] [INFO ] Deduced a trap composed of 152 places in 134 ms of which 3 ms to minimize.
[2025-06-01 00:26:43] [INFO ] Deduced a trap composed of 172 places in 117 ms of which 2 ms to minimize.
[2025-06-01 00:26:44] [INFO ] Deduced a trap composed of 166 places in 118 ms of which 2 ms to minimize.
[2025-06-01 00:26:44] [INFO ] Deduced a trap composed of 172 places in 117 ms of which 2 ms to minimize.
[2025-06-01 00:26:44] [INFO ] Deduced a trap composed of 180 places in 123 ms of which 3 ms to minimize.
[2025-06-01 00:26:44] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1128 ms
[2025-06-01 00:26:46] [INFO ] Deduced a trap composed of 167 places in 124 ms of which 3 ms to minimize.
[2025-06-01 00:26:46] [INFO ] Deduced a trap composed of 167 places in 118 ms of which 3 ms to minimize.
[2025-06-01 00:26:46] [INFO ] Deduced a trap composed of 155 places in 124 ms of which 3 ms to minimize.
[2025-06-01 00:26:46] [INFO ] Deduced a trap composed of 163 places in 123 ms of which 3 ms to minimize.
[2025-06-01 00:26:46] [INFO ] Deduced a trap composed of 138 places in 120 ms of which 3 ms to minimize.
[2025-06-01 00:26:47] [INFO ] Deduced a trap composed of 190 places in 123 ms of which 3 ms to minimize.
[2025-06-01 00:26:47] [INFO ] Deduced a trap composed of 187 places in 124 ms of which 3 ms to minimize.
[2025-06-01 00:26:47] [INFO ] Deduced a trap composed of 177 places in 115 ms of which 2 ms to minimize.
[2025-06-01 00:26:47] [INFO ] Deduced a trap composed of 180 places in 121 ms of which 2 ms to minimize.
[2025-06-01 00:26:47] [INFO ] Deduced a trap composed of 143 places in 112 ms of which 3 ms to minimize.
[2025-06-01 00:26:47] [INFO ] Deduced a trap composed of 157 places in 116 ms of which 3 ms to minimize.
[2025-06-01 00:26:48] [INFO ] Deduced a trap composed of 195 places in 121 ms of which 3 ms to minimize.
[2025-06-01 00:26:48] [INFO ] Deduced a trap composed of 139 places in 118 ms of which 2 ms to minimize.
[2025-06-01 00:26:49] [INFO ] Deduced a trap composed of 177 places in 122 ms of which 3 ms to minimize.
[2025-06-01 00:26:49] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2819 ms
[2025-06-01 00:26:50] [INFO ] Deduced a trap composed of 190 places in 124 ms of which 3 ms to minimize.
[2025-06-01 00:26:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
TRAPS : Iteration 6
[2025-06-01 00:26:55] [INFO ] Deduced a trap composed of 119 places in 127 ms of which 3 ms to minimize.
[2025-06-01 00:26:55] [INFO ] Deduced a trap composed of 131 places in 123 ms of which 2 ms to minimize.
[2025-06-01 00:26:55] [INFO ] Deduced a trap composed of 137 places in 122 ms of which 3 ms to minimize.
[2025-06-01 00:26:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 512 ms
[2025-06-01 00:26:55] [INFO ] Deduced a trap composed of 140 places in 99 ms of which 2 ms to minimize.
[2025-06-01 00:26:56] [INFO ] Deduced a trap composed of 145 places in 98 ms of which 2 ms to minimize.
[2025-06-01 00:26:56] [INFO ] Deduced a trap composed of 139 places in 98 ms of which 2 ms to minimize.
[2025-06-01 00:26:56] [INFO ] Deduced a trap composed of 136 places in 99 ms of which 2 ms to minimize.
[2025-06-01 00:26:56] [INFO ] Deduced a trap composed of 131 places in 100 ms of which 2 ms to minimize.
[2025-06-01 00:26:56] [INFO ] Deduced a trap composed of 147 places in 102 ms of which 2 ms to minimize.
[2025-06-01 00:26:56] [INFO ] Deduced a trap composed of 129 places in 107 ms of which 2 ms to minimize.
[2025-06-01 00:26:56] [INFO ] Deduced a trap composed of 134 places in 101 ms of which 3 ms to minimize.
[2025-06-01 00:26:57] [INFO ] Deduced a trap composed of 127 places in 105 ms of which 2 ms to minimize.
[2025-06-01 00:26:57] [INFO ] Deduced a trap composed of 129 places in 95 ms of which 2 ms to minimize.
[2025-06-01 00:26:57] [INFO ] Deduced a trap composed of 132 places in 100 ms of which 2 ms to minimize.
[2025-06-01 00:26:57] [INFO ] Deduced a trap composed of 125 places in 98 ms of which 2 ms to minimize.
[2025-06-01 00:26:57] [INFO ] Deduced a trap composed of 130 places in 101 ms of which 2 ms to minimize.
[2025-06-01 00:26:57] [INFO ] Deduced a trap composed of 124 places in 97 ms of which 2 ms to minimize.
[2025-06-01 00:26:57] [INFO ] Deduced a trap composed of 130 places in 99 ms of which 2 ms to minimize.
[2025-06-01 00:26:57] [INFO ] Deduced a trap composed of 133 places in 104 ms of which 2 ms to minimize.
[2025-06-01 00:26:58] [INFO ] Deduced a trap composed of 141 places in 102 ms of which 2 ms to minimize.
[2025-06-01 00:26:58] [INFO ] Deduced a trap composed of 132 places in 94 ms of which 2 ms to minimize.
[2025-06-01 00:26:58] [INFO ] Deduced a trap composed of 130 places in 106 ms of which 2 ms to minimize.
[2025-06-01 00:26:58] [INFO ] Deduced a trap composed of 141 places in 108 ms of which 2 ms to minimize.
[2025-06-01 00:26:58] [INFO ] Deduced a trap composed of 129 places in 99 ms of which 2 ms to minimize.
[2025-06-01 00:26:58] [INFO ] Deduced a trap composed of 147 places in 102 ms of which 2 ms to minimize.
[2025-06-01 00:26:58] [INFO ] Deduced a trap composed of 144 places in 97 ms of which 2 ms to minimize.
[2025-06-01 00:26:58] [INFO ] Deduced a trap composed of 125 places in 98 ms of which 2 ms to minimize.
[2025-06-01 00:26:59] [INFO ] Deduced a trap composed of 143 places in 99 ms of which 3 ms to minimize.
[2025-06-01 00:26:59] [INFO ] Deduced a trap composed of 139 places in 98 ms of which 2 ms to minimize.
[2025-06-01 00:26:59] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 3413 ms
TRAPS : Iteration 7
[2025-06-01 00:27:06] [INFO ] After 198535ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :334
[2025-06-01 00:27:06] [INFO ] After 200019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :334
RANDOM walk for 4000000 steps (577076 resets) in 64919 ms. (61 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40003 steps (3651 resets) in 967 ms. (41 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3638 resets) in 1053 ms. (37 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40003 steps (3623 resets) in 992 ms. (40 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40002 steps (3687 resets) in 883 ms. (45 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3674 resets) in 983 ms. (40 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40002 steps (3702 resets) in 986 ms. (40 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3572 resets) in 981 ms. (40 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40002 steps (3662 resets) in 851 ms. (46 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40002 steps (3676 resets) in 982 ms. (40 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3687 resets) in 989 ms. (40 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40002 steps (3605 resets) in 1021 ms. (39 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40000 steps (3608 resets) in 1016 ms. (39 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3636 resets) in 1001 ms. (39 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3667 resets) in 848 ms. (47 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40003 steps (3682 resets) in 882 ms. (45 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3644 resets) in 1009 ms. (39 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3645 resets) in 995 ms. (40 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40000 steps (3628 resets) in 852 ms. (46 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3630 resets) in 1005 ms. (39 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3679 resets) in 989 ms. (40 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3668 resets) in 869 ms. (45 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40000 steps (3621 resets) in 994 ms. (40 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3678 resets) in 974 ms. (41 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40002 steps (3650 resets) in 967 ms. (41 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40003 steps (3629 resets) in 873 ms. (45 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3645 resets) in 859 ms. (46 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40002 steps (3680 resets) in 847 ms. (47 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3683 resets) in 1063 ms. (37 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3647 resets) in 977 ms. (40 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40000 steps (3656 resets) in 893 ms. (44 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3675 resets) in 892 ms. (44 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40004 steps (3635 resets) in 883 ms. (45 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3667 resets) in 991 ms. (40 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3683 resets) in 1014 ms. (39 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3659 resets) in 880 ms. (45 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3681 resets) in 1050 ms. (38 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40002 steps (3670 resets) in 812 ms. (49 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40000 steps (3643 resets) in 998 ms. (40 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40003 steps (3650 resets) in 845 ms. (47 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40002 steps (3591 resets) in 942 ms. (42 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40003 steps (3653 resets) in 990 ms. (40 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40002 steps (3659 resets) in 1005 ms. (39 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40003 steps (3678 resets) in 899 ms. (44 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40000 steps (3654 resets) in 937 ms. (42 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40002 steps (3662 resets) in 998 ms. (40 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3650 resets) in 990 ms. (40 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40001 steps (3652 resets) in 879 ms. (45 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40003 steps (3570 resets) in 1002 ms. (39 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40000 steps (3607 resets) in 982 ms. (40 steps per ms) remains 335/335 properties
BEST_FIRST walk for 40000 steps (3666 resets) in 949 ms. (42 steps per ms) remains 335/335 properties
Interrupted probabilistic random walk after 2766818 steps, run timeout after 87001 ms. (steps per millisecond=31 ) properties seen :0 out of 335
Probabilistic random walk after 2766818 steps, saw 1383334 distinct states, run finished after 87001 ms. (steps per millisecond=31 ) properties seen :0
[2025-06-01 00:29:03] [INFO ] Invariant cache hit.
[2025-06-01 00:29:03] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/335 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/335 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 56/391 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/391 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 24/415 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/415 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 6 (OVERLAPS) 396/811 variables, 415/461 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/811 variables, 12/473 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/811 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 9 (OVERLAPS) 4/815 variables, 4/477 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/815 variables, 2/479 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/815 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 12 (OVERLAPS) 0/815 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 815/815 variables, and 479 constraints, problems are : Problem set: 0 solved, 335 unsolved in 45236 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 419/419 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/335 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/335 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 56/391 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2025-06-01 00:29:51] [INFO ] Deduced a trap composed of 194 places in 127 ms of which 3 ms to minimize.
[2025-06-01 00:29:51] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 2 ms to minimize.
[2025-06-01 00:29:51] [INFO ] Deduced a trap composed of 130 places in 84 ms of which 1 ms to minimize.
[2025-06-01 00:29:51] [INFO ] Deduced a trap composed of 129 places in 77 ms of which 2 ms to minimize.
[2025-06-01 00:29:51] [INFO ] Deduced a trap composed of 139 places in 81 ms of which 2 ms to minimize.
[2025-06-01 00:29:52] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 2 ms to minimize.
[2025-06-01 00:29:54] [INFO ] Deduced a trap composed of 74 places in 67 ms of which 2 ms to minimize.
[2025-06-01 00:29:54] [INFO ] Deduced a trap composed of 81 places in 61 ms of which 1 ms to minimize.
[2025-06-01 00:29:54] [INFO ] Deduced a trap composed of 116 places in 112 ms of which 3 ms to minimize.
[2025-06-01 00:29:55] [INFO ] Deduced a trap composed of 131 places in 114 ms of which 2 ms to minimize.
[2025-06-01 00:29:55] [INFO ] Deduced a trap composed of 87 places in 123 ms of which 2 ms to minimize.
[2025-06-01 00:29:55] [INFO ] Deduced a trap composed of 88 places in 52 ms of which 0 ms to minimize.
[2025-06-01 00:29:56] [INFO ] Deduced a trap composed of 82 places in 122 ms of which 2 ms to minimize.
[2025-06-01 00:29:56] [INFO ] Deduced a trap composed of 130 places in 119 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/391 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2025-06-01 00:29:57] [INFO ] Deduced a trap composed of 197 places in 137 ms of which 2 ms to minimize.
[2025-06-01 00:30:00] [INFO ] Deduced a trap composed of 76 places in 61 ms of which 1 ms to minimize.
[2025-06-01 00:30:01] [INFO ] Deduced a trap composed of 85 places in 59 ms of which 1 ms to minimize.
[2025-06-01 00:30:02] [INFO ] Deduced a trap composed of 88 places in 115 ms of which 2 ms to minimize.
[2025-06-01 00:30:02] [INFO ] Deduced a trap composed of 91 places in 115 ms of which 3 ms to minimize.
[2025-06-01 00:30:02] [INFO ] Deduced a trap composed of 95 places in 127 ms of which 2 ms to minimize.
[2025-06-01 00:30:02] [INFO ] Deduced a trap composed of 107 places in 121 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/391 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2025-06-01 00:30:04] [INFO ] Deduced a trap composed of 237 places in 113 ms of which 2 ms to minimize.
[2025-06-01 00:30:08] [INFO ] Deduced a trap composed of 202 places in 122 ms of which 3 ms to minimize.
[2025-06-01 00:30:08] [INFO ] Deduced a trap composed of 198 places in 121 ms of which 2 ms to minimize.
[2025-06-01 00:30:08] [INFO ] Deduced a trap composed of 196 places in 117 ms of which 2 ms to minimize.
[2025-06-01 00:30:08] [INFO ] Deduced a trap composed of 109 places in 113 ms of which 3 ms to minimize.
[2025-06-01 00:30:08] [INFO ] Deduced a trap composed of 194 places in 122 ms of which 3 ms to minimize.
[2025-06-01 00:30:09] [INFO ] Deduced a trap composed of 197 places in 116 ms of which 2 ms to minimize.
[2025-06-01 00:30:09] [INFO ] Deduced a trap composed of 101 places in 63 ms of which 1 ms to minimize.
[2025-06-01 00:30:09] [INFO ] Deduced a trap composed of 80 places in 125 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 9/66 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2025-06-01 00:30:10] [INFO ] Deduced a trap composed of 40 places in 124 ms of which 2 ms to minimize.
[2025-06-01 00:30:10] [INFO ] Deduced a trap composed of 180 places in 117 ms of which 2 ms to minimize.
[2025-06-01 00:30:11] [INFO ] Deduced a trap composed of 183 places in 112 ms of which 2 ms to minimize.
[2025-06-01 00:30:11] [INFO ] Deduced a trap composed of 52 places in 84 ms of which 2 ms to minimize.
[2025-06-01 00:30:12] [INFO ] Deduced a trap composed of 57 places in 84 ms of which 2 ms to minimize.
[2025-06-01 00:30:12] [INFO ] Deduced a trap composed of 179 places in 122 ms of which 2 ms to minimize.
[2025-06-01 00:30:12] [INFO ] Deduced a trap composed of 175 places in 114 ms of which 2 ms to minimize.
[2025-06-01 00:30:12] [INFO ] Deduced a trap composed of 103 places in 81 ms of which 1 ms to minimize.
[2025-06-01 00:30:13] [INFO ] Deduced a trap composed of 117 places in 118 ms of which 2 ms to minimize.
[2025-06-01 00:30:13] [INFO ] Deduced a trap composed of 117 places in 118 ms of which 3 ms to minimize.
[2025-06-01 00:30:14] [INFO ] Deduced a trap composed of 194 places in 124 ms of which 2 ms to minimize.
[2025-06-01 00:30:14] [INFO ] Deduced a trap composed of 101 places in 58 ms of which 1 ms to minimize.
[2025-06-01 00:30:16] [INFO ] Deduced a trap composed of 193 places in 114 ms of which 2 ms to minimize.
[2025-06-01 00:30:16] [INFO ] Deduced a trap composed of 195 places in 121 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 14/80 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2025-06-01 00:30:16] [INFO ] Deduced a trap composed of 186 places in 126 ms of which 2 ms to minimize.
[2025-06-01 00:30:17] [INFO ] Deduced a trap composed of 200 places in 121 ms of which 2 ms to minimize.
[2025-06-01 00:30:17] [INFO ] Deduced a trap composed of 212 places in 117 ms of which 2 ms to minimize.
[2025-06-01 00:30:17] [INFO ] Deduced a trap composed of 190 places in 125 ms of which 3 ms to minimize.
[2025-06-01 00:30:17] [INFO ] Deduced a trap composed of 185 places in 114 ms of which 3 ms to minimize.
[2025-06-01 00:30:17] [INFO ] Deduced a trap composed of 200 places in 114 ms of which 3 ms to minimize.
[2025-06-01 00:30:17] [INFO ] Deduced a trap composed of 205 places in 109 ms of which 2 ms to minimize.
[2025-06-01 00:30:17] [INFO ] Deduced a trap composed of 212 places in 115 ms of which 2 ms to minimize.
[2025-06-01 00:30:18] [INFO ] Deduced a trap composed of 201 places in 113 ms of which 3 ms to minimize.
[2025-06-01 00:30:18] [INFO ] Deduced a trap composed of 44 places in 111 ms of which 3 ms to minimize.
[2025-06-01 00:30:18] [INFO ] Deduced a trap composed of 206 places in 121 ms of which 3 ms to minimize.
[2025-06-01 00:30:18] [INFO ] Deduced a trap composed of 212 places in 114 ms of which 3 ms to minimize.
[2025-06-01 00:30:18] [INFO ] Deduced a trap composed of 205 places in 110 ms of which 2 ms to minimize.
[2025-06-01 00:30:18] [INFO ] Deduced a trap composed of 218 places in 111 ms of which 3 ms to minimize.
[2025-06-01 00:30:18] [INFO ] Deduced a trap composed of 205 places in 112 ms of which 2 ms to minimize.
[2025-06-01 00:30:18] [INFO ] Deduced a trap composed of 206 places in 110 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 16/96 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2025-06-01 00:30:27] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 1 ms to minimize.
[2025-06-01 00:30:28] [INFO ] Deduced a trap composed of 187 places in 128 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2025-06-01 00:30:31] [INFO ] Deduced a trap composed of 71 places in 126 ms of which 2 ms to minimize.
[2025-06-01 00:30:31] [INFO ] Deduced a trap composed of 65 places in 118 ms of which 2 ms to minimize.
[2025-06-01 00:30:32] [INFO ] Deduced a trap composed of 62 places in 74 ms of which 2 ms to minimize.
[2025-06-01 00:30:32] [INFO ] Deduced a trap composed of 79 places in 71 ms of which 1 ms to minimize.
[2025-06-01 00:30:33] [INFO ] Deduced a trap composed of 98 places in 63 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/391 variables, 5/103 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2025-06-01 00:30:36] [INFO ] Deduced a trap composed of 198 places in 125 ms of which 2 ms to minimize.
[2025-06-01 00:30:36] [INFO ] Deduced a trap composed of 200 places in 119 ms of which 2 ms to minimize.
[2025-06-01 00:30:36] [INFO ] Deduced a trap composed of 201 places in 114 ms of which 3 ms to minimize.
[2025-06-01 00:30:36] [INFO ] Deduced a trap composed of 205 places in 116 ms of which 2 ms to minimize.
[2025-06-01 00:30:39] [INFO ] Deduced a trap composed of 179 places in 124 ms of which 2 ms to minimize.
[2025-06-01 00:30:39] [INFO ] Deduced a trap composed of 193 places in 120 ms of which 2 ms to minimize.
[2025-06-01 00:30:39] [INFO ] Deduced a trap composed of 184 places in 118 ms of which 2 ms to minimize.
[2025-06-01 00:30:40] [INFO ] Deduced a trap composed of 192 places in 114 ms of which 2 ms to minimize.
[2025-06-01 00:30:40] [INFO ] Deduced a trap composed of 198 places in 109 ms of which 3 ms to minimize.
[2025-06-01 00:30:40] [INFO ] Deduced a trap composed of 107 places in 115 ms of which 2 ms to minimize.
[2025-06-01 00:30:41] [INFO ] Deduced a trap composed of 191 places in 118 ms of which 3 ms to minimize.
[2025-06-01 00:30:41] [INFO ] Deduced a trap composed of 209 places in 118 ms of which 2 ms to minimize.
[2025-06-01 00:30:41] [INFO ] Deduced a trap composed of 132 places in 111 ms of which 2 ms to minimize.
[2025-06-01 00:30:41] [INFO ] Deduced a trap composed of 140 places in 111 ms of which 2 ms to minimize.
[2025-06-01 00:30:41] [INFO ] Deduced a trap composed of 111 places in 67 ms of which 2 ms to minimize.
[2025-06-01 00:30:42] [INFO ] Deduced a trap composed of 110 places in 68 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/391 variables, 16/119 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/391 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 12 (OVERLAPS) 24/415 variables, 10/129 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2025-06-01 00:30:49] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 3 ms to minimize.
[2025-06-01 00:30:49] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 4 ms to minimize.
[2025-06-01 00:30:49] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 3 ms to minimize.
[2025-06-01 00:30:49] [INFO ] Deduced a trap composed of 6 places in 117 ms of which 2 ms to minimize.
[2025-06-01 00:30:49] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 3 ms to minimize.
[2025-06-01 00:30:49] [INFO ] Deduced a trap composed of 186 places in 125 ms of which 3 ms to minimize.
[2025-06-01 00:30:49] [INFO ] Deduced a trap composed of 186 places in 116 ms of which 2 ms to minimize.
[2025-06-01 00:30:50] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 3 ms to minimize.
[2025-06-01 00:30:50] [INFO ] Deduced a trap composed of 34 places in 118 ms of which 2 ms to minimize.
[2025-06-01 00:30:50] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 2 ms to minimize.
[2025-06-01 00:30:50] [INFO ] Deduced a trap composed of 188 places in 113 ms of which 3 ms to minimize.
[2025-06-01 00:30:50] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 2 ms to minimize.
[2025-06-01 00:30:50] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 2 ms to minimize.
[2025-06-01 00:30:50] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 2 ms to minimize.
[2025-06-01 00:30:51] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 3 ms to minimize.
[2025-06-01 00:30:51] [INFO ] Deduced a trap composed of 36 places in 124 ms of which 2 ms to minimize.
[2025-06-01 00:30:51] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 2 ms to minimize.
[2025-06-01 00:30:51] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 2 ms to minimize.
[2025-06-01 00:30:51] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 2 ms to minimize.
[2025-06-01 00:30:51] [INFO ] Deduced a trap composed of 186 places in 115 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/415 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2025-06-01 00:30:52] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 2 ms to minimize.
[2025-06-01 00:30:52] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 3 ms to minimize.
[2025-06-01 00:30:52] [INFO ] Deduced a trap composed of 171 places in 106 ms of which 2 ms to minimize.
[2025-06-01 00:30:52] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 2 ms to minimize.
[2025-06-01 00:30:53] [INFO ] Deduced a trap composed of 182 places in 124 ms of which 3 ms to minimize.
[2025-06-01 00:30:53] [INFO ] Deduced a trap composed of 34 places in 122 ms of which 3 ms to minimize.
[2025-06-01 00:30:53] [INFO ] Deduced a trap composed of 189 places in 122 ms of which 3 ms to minimize.
[2025-06-01 00:30:53] [INFO ] Deduced a trap composed of 179 places in 116 ms of which 2 ms to minimize.
[2025-06-01 00:30:53] [INFO ] Deduced a trap composed of 161 places in 118 ms of which 2 ms to minimize.
[2025-06-01 00:30:53] [INFO ] Deduced a trap composed of 194 places in 117 ms of which 2 ms to minimize.
[2025-06-01 00:30:53] [INFO ] Deduced a trap composed of 184 places in 120 ms of which 2 ms to minimize.
[2025-06-01 00:30:54] [INFO ] Deduced a trap composed of 174 places in 117 ms of which 2 ms to minimize.
[2025-06-01 00:30:54] [INFO ] Deduced a trap composed of 198 places in 119 ms of which 3 ms to minimize.
[2025-06-01 00:30:54] [INFO ] Deduced a trap composed of 181 places in 117 ms of which 2 ms to minimize.
[2025-06-01 00:30:54] [INFO ] Deduced a trap composed of 180 places in 116 ms of which 2 ms to minimize.
[2025-06-01 00:30:54] [INFO ] Deduced a trap composed of 174 places in 119 ms of which 2 ms to minimize.
[2025-06-01 00:30:54] [INFO ] Deduced a trap composed of 172 places in 117 ms of which 3 ms to minimize.
[2025-06-01 00:30:54] [INFO ] Deduced a trap composed of 191 places in 121 ms of which 2 ms to minimize.
[2025-06-01 00:30:54] [INFO ] Deduced a trap composed of 173 places in 120 ms of which 3 ms to minimize.
[2025-06-01 00:30:55] [INFO ] Deduced a trap composed of 152 places in 115 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/415 variables, 20/169 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2025-06-01 00:30:55] [INFO ] Deduced a trap composed of 166 places in 105 ms of which 2 ms to minimize.
[2025-06-01 00:30:55] [INFO ] Deduced a trap composed of 202 places in 128 ms of which 3 ms to minimize.
[2025-06-01 00:30:56] [INFO ] Deduced a trap composed of 194 places in 118 ms of which 3 ms to minimize.
[2025-06-01 00:30:56] [INFO ] Deduced a trap composed of 192 places in 119 ms of which 2 ms to minimize.
[2025-06-01 00:30:56] [INFO ] Deduced a trap composed of 190 places in 114 ms of which 2 ms to minimize.
[2025-06-01 00:30:56] [INFO ] Deduced a trap composed of 212 places in 115 ms of which 2 ms to minimize.
[2025-06-01 00:30:56] [INFO ] Deduced a trap composed of 214 places in 116 ms of which 3 ms to minimize.
[2025-06-01 00:30:57] [INFO ] Deduced a trap composed of 178 places in 115 ms of which 2 ms to minimize.
[2025-06-01 00:30:57] [INFO ] Deduced a trap composed of 193 places in 112 ms of which 2 ms to minimize.
[2025-06-01 00:30:57] [INFO ] Deduced a trap composed of 211 places in 113 ms of which 2 ms to minimize.
[2025-06-01 00:30:57] [INFO ] Deduced a trap composed of 176 places in 96 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/415 variables, 11/180 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2025-06-01 00:31:03] [INFO ] Deduced a trap composed of 203 places in 128 ms of which 2 ms to minimize.
[2025-06-01 00:31:03] [INFO ] Deduced a trap composed of 192 places in 118 ms of which 3 ms to minimize.
[2025-06-01 00:31:03] [INFO ] Deduced a trap composed of 192 places in 116 ms of which 3 ms to minimize.
[2025-06-01 00:31:03] [INFO ] Deduced a trap composed of 188 places in 112 ms of which 2 ms to minimize.
[2025-06-01 00:31:03] [INFO ] Deduced a trap composed of 184 places in 113 ms of which 2 ms to minimize.
[2025-06-01 00:31:03] [INFO ] Deduced a trap composed of 179 places in 114 ms of which 2 ms to minimize.
[2025-06-01 00:31:03] [INFO ] Deduced a trap composed of 199 places in 112 ms of which 2 ms to minimize.
[2025-06-01 00:31:04] [INFO ] Deduced a trap composed of 194 places in 125 ms of which 3 ms to minimize.
[2025-06-01 00:31:04] [INFO ] Deduced a trap composed of 190 places in 126 ms of which 2 ms to minimize.
[2025-06-01 00:31:04] [INFO ] Deduced a trap composed of 200 places in 117 ms of which 3 ms to minimize.
[2025-06-01 00:31:04] [INFO ] Deduced a trap composed of 201 places in 128 ms of which 2 ms to minimize.
[2025-06-01 00:31:04] [INFO ] Deduced a trap composed of 204 places in 121 ms of which 2 ms to minimize.
[2025-06-01 00:31:04] [INFO ] Deduced a trap composed of 196 places in 125 ms of which 3 ms to minimize.
[2025-06-01 00:31:04] [INFO ] Deduced a trap composed of 199 places in 120 ms of which 3 ms to minimize.
[2025-06-01 00:31:04] [INFO ] Deduced a trap composed of 178 places in 119 ms of which 2 ms to minimize.
[2025-06-01 00:31:05] [INFO ] Deduced a trap composed of 208 places in 128 ms of which 2 ms to minimize.
[2025-06-01 00:31:05] [INFO ] Deduced a trap composed of 191 places in 116 ms of which 3 ms to minimize.
[2025-06-01 00:31:05] [INFO ] Deduced a trap composed of 203 places in 130 ms of which 2 ms to minimize.
[2025-06-01 00:31:05] [INFO ] Deduced a trap composed of 199 places in 117 ms of which 2 ms to minimize.
[2025-06-01 00:31:05] [INFO ] Deduced a trap composed of 209 places in 122 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/415 variables, 20/200 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2025-06-01 00:31:06] [INFO ] Deduced a trap composed of 204 places in 121 ms of which 2 ms to minimize.
[2025-06-01 00:31:06] [INFO ] Deduced a trap composed of 204 places in 120 ms of which 3 ms to minimize.
[2025-06-01 00:31:06] [INFO ] Deduced a trap composed of 201 places in 121 ms of which 2 ms to minimize.
[2025-06-01 00:31:06] [INFO ] Deduced a trap composed of 191 places in 116 ms of which 2 ms to minimize.
[2025-06-01 00:31:06] [INFO ] Deduced a trap composed of 189 places in 114 ms of which 2 ms to minimize.
[2025-06-01 00:31:06] [INFO ] Deduced a trap composed of 186 places in 113 ms of which 2 ms to minimize.
[2025-06-01 00:31:06] [INFO ] Deduced a trap composed of 187 places in 116 ms of which 3 ms to minimize.
[2025-06-01 00:31:07] [INFO ] Deduced a trap composed of 192 places in 119 ms of which 2 ms to minimize.
[2025-06-01 00:31:07] [INFO ] Deduced a trap composed of 194 places in 113 ms of which 3 ms to minimize.
[2025-06-01 00:31:07] [INFO ] Deduced a trap composed of 193 places in 123 ms of which 2 ms to minimize.
[2025-06-01 00:31:07] [INFO ] Deduced a trap composed of 199 places in 116 ms of which 3 ms to minimize.
[2025-06-01 00:31:07] [INFO ] Deduced a trap composed of 199 places in 113 ms of which 3 ms to minimize.
[2025-06-01 00:31:08] [INFO ] Deduced a trap composed of 205 places in 111 ms of which 3 ms to minimize.
[2025-06-01 00:31:08] [INFO ] Deduced a trap composed of 193 places in 117 ms of which 3 ms to minimize.
[2025-06-01 00:31:08] [INFO ] Deduced a trap composed of 215 places in 114 ms of which 3 ms to minimize.
[2025-06-01 00:31:08] [INFO ] Deduced a trap composed of 204 places in 110 ms of which 3 ms to minimize.
[2025-06-01 00:31:08] [INFO ] Deduced a trap composed of 168 places in 126 ms of which 3 ms to minimize.
[2025-06-01 00:31:09] [INFO ] Deduced a trap composed of 162 places in 124 ms of which 2 ms to minimize.
[2025-06-01 00:31:09] [INFO ] Deduced a trap composed of 169 places in 129 ms of which 3 ms to minimize.
[2025-06-01 00:31:09] [INFO ] Deduced a trap composed of 178 places in 134 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/415 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2025-06-01 00:31:10] [INFO ] Deduced a trap composed of 126 places in 121 ms of which 2 ms to minimize.
[2025-06-01 00:31:10] [INFO ] Deduced a trap composed of 135 places in 129 ms of which 3 ms to minimize.
[2025-06-01 00:31:10] [INFO ] Deduced a trap composed of 165 places in 121 ms of which 2 ms to minimize.
[2025-06-01 00:31:10] [INFO ] Deduced a trap composed of 134 places in 128 ms of which 2 ms to minimize.
[2025-06-01 00:31:10] [INFO ] Deduced a trap composed of 143 places in 116 ms of which 3 ms to minimize.
[2025-06-01 00:31:10] [INFO ] Deduced a trap composed of 185 places in 129 ms of which 2 ms to minimize.
[2025-06-01 00:31:10] [INFO ] Deduced a trap composed of 173 places in 123 ms of which 2 ms to minimize.
[2025-06-01 00:31:10] [INFO ] Deduced a trap composed of 175 places in 120 ms of which 2 ms to minimize.
[2025-06-01 00:31:11] [INFO ] Deduced a trap composed of 142 places in 127 ms of which 3 ms to minimize.
[2025-06-01 00:31:11] [INFO ] Deduced a trap composed of 141 places in 117 ms of which 3 ms to minimize.
[2025-06-01 00:31:11] [INFO ] Deduced a trap composed of 136 places in 115 ms of which 3 ms to minimize.
[2025-06-01 00:31:11] [INFO ] Deduced a trap composed of 147 places in 113 ms of which 2 ms to minimize.
[2025-06-01 00:31:11] [INFO ] Deduced a trap composed of 195 places in 127 ms of which 3 ms to minimize.
[2025-06-01 00:31:11] [INFO ] Deduced a trap composed of 182 places in 125 ms of which 2 ms to minimize.
[2025-06-01 00:31:11] [INFO ] Deduced a trap composed of 162 places in 123 ms of which 2 ms to minimize.
[2025-06-01 00:31:12] [INFO ] Deduced a trap composed of 146 places in 120 ms of which 3 ms to minimize.
[2025-06-01 00:31:12] [INFO ] Deduced a trap composed of 146 places in 122 ms of which 3 ms to minimize.
[2025-06-01 00:31:12] [INFO ] Deduced a trap composed of 146 places in 120 ms of which 3 ms to minimize.
[2025-06-01 00:31:12] [INFO ] Deduced a trap composed of 160 places in 124 ms of which 3 ms to minimize.
[2025-06-01 00:31:12] [INFO ] Deduced a trap composed of 160 places in 124 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/415 variables, 20/240 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2025-06-01 00:31:13] [INFO ] Deduced a trap composed of 197 places in 126 ms of which 3 ms to minimize.
[2025-06-01 00:31:13] [INFO ] Deduced a trap composed of 186 places in 116 ms of which 2 ms to minimize.
[2025-06-01 00:31:13] [INFO ] Deduced a trap composed of 188 places in 119 ms of which 2 ms to minimize.
[2025-06-01 00:31:14] [INFO ] Deduced a trap composed of 198 places in 116 ms of which 2 ms to minimize.
[2025-06-01 00:31:14] [INFO ] Deduced a trap composed of 191 places in 117 ms of which 3 ms to minimize.
[2025-06-01 00:31:14] [INFO ] Deduced a trap composed of 190 places in 120 ms of which 3 ms to minimize.
[2025-06-01 00:31:14] [INFO ] Deduced a trap composed of 190 places in 118 ms of which 2 ms to minimize.
[2025-06-01 00:31:14] [INFO ] Deduced a trap composed of 189 places in 116 ms of which 2 ms to minimize.
[2025-06-01 00:31:14] [INFO ] Deduced a trap composed of 191 places in 120 ms of which 2 ms to minimize.
[2025-06-01 00:31:14] [INFO ] Deduced a trap composed of 199 places in 117 ms of which 3 ms to minimize.
[2025-06-01 00:31:14] [INFO ] Deduced a trap composed of 183 places in 114 ms of which 2 ms to minimize.
[2025-06-01 00:31:15] [INFO ] Deduced a trap composed of 187 places in 105 ms of which 2 ms to minimize.
[2025-06-01 00:31:15] [INFO ] Deduced a trap composed of 190 places in 114 ms of which 3 ms to minimize.
[2025-06-01 00:31:15] [INFO ] Deduced a trap composed of 186 places in 120 ms of which 2 ms to minimize.
[2025-06-01 00:31:15] [INFO ] Deduced a trap composed of 194 places in 123 ms of which 2 ms to minimize.
[2025-06-01 00:31:15] [INFO ] Deduced a trap composed of 204 places in 122 ms of which 3 ms to minimize.
[2025-06-01 00:31:15] [INFO ] Deduced a trap composed of 187 places in 118 ms of which 2 ms to minimize.
[2025-06-01 00:31:15] [INFO ] Deduced a trap composed of 187 places in 113 ms of which 3 ms to minimize.
[2025-06-01 00:31:15] [INFO ] Deduced a trap composed of 200 places in 121 ms of which 3 ms to minimize.
[2025-06-01 00:31:16] [INFO ] Deduced a trap composed of 190 places in 115 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/415 variables, 20/260 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2025-06-01 00:31:16] [INFO ] Deduced a trap composed of 225 places in 127 ms of which 3 ms to minimize.
[2025-06-01 00:31:17] [INFO ] Deduced a trap composed of 226 places in 124 ms of which 3 ms to minimize.
[2025-06-01 00:31:17] [INFO ] Deduced a trap composed of 208 places in 126 ms of which 2 ms to minimize.
[2025-06-01 00:31:17] [INFO ] Deduced a trap composed of 224 places in 122 ms of which 2 ms to minimize.
[2025-06-01 00:31:17] [INFO ] Deduced a trap composed of 233 places in 122 ms of which 2 ms to minimize.
[2025-06-01 00:31:17] [INFO ] Deduced a trap composed of 197 places in 116 ms of which 2 ms to minimize.
[2025-06-01 00:31:17] [INFO ] Deduced a trap composed of 221 places in 121 ms of which 3 ms to minimize.
[2025-06-01 00:31:17] [INFO ] Deduced a trap composed of 213 places in 123 ms of which 3 ms to minimize.
[2025-06-01 00:31:18] [INFO ] Deduced a trap composed of 198 places in 123 ms of which 3 ms to minimize.
[2025-06-01 00:31:18] [INFO ] Deduced a trap composed of 179 places in 120 ms of which 3 ms to minimize.
[2025-06-01 00:31:18] [INFO ] Deduced a trap composed of 200 places in 116 ms of which 3 ms to minimize.
[2025-06-01 00:31:18] [INFO ] Deduced a trap composed of 213 places in 111 ms of which 2 ms to minimize.
[2025-06-01 00:31:18] [INFO ] Deduced a trap composed of 200 places in 124 ms of which 3 ms to minimize.
[2025-06-01 00:31:19] [INFO ] Deduced a trap composed of 200 places in 122 ms of which 2 ms to minimize.
[2025-06-01 00:31:19] [INFO ] Deduced a trap composed of 197 places in 112 ms of which 3 ms to minimize.
[2025-06-01 00:31:19] [INFO ] Deduced a trap composed of 206 places in 115 ms of which 2 ms to minimize.
[2025-06-01 00:31:19] [INFO ] Deduced a trap composed of 200 places in 113 ms of which 2 ms to minimize.
[2025-06-01 00:31:19] [INFO ] Deduced a trap composed of 195 places in 114 ms of which 2 ms to minimize.
[2025-06-01 00:31:19] [INFO ] Deduced a trap composed of 187 places in 114 ms of which 2 ms to minimize.
[2025-06-01 00:31:19] [INFO ] Deduced a trap composed of 207 places in 118 ms of which 3 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/415 variables, 20/280 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2025-06-01 00:31:21] [INFO ] Deduced a trap composed of 185 places in 123 ms of which 2 ms to minimize.
[2025-06-01 00:31:21] [INFO ] Deduced a trap composed of 181 places in 131 ms of which 3 ms to minimize.
[2025-06-01 00:31:21] [INFO ] Deduced a trap composed of 177 places in 122 ms of which 2 ms to minimize.
[2025-06-01 00:31:21] [INFO ] Deduced a trap composed of 188 places in 124 ms of which 3 ms to minimize.
[2025-06-01 00:31:21] [INFO ] Deduced a trap composed of 195 places in 111 ms of which 2 ms to minimize.
[2025-06-01 00:31:21] [INFO ] Deduced a trap composed of 200 places in 112 ms of which 2 ms to minimize.
[2025-06-01 00:31:21] [INFO ] Deduced a trap composed of 188 places in 118 ms of which 3 ms to minimize.
[2025-06-01 00:31:22] [INFO ] Deduced a trap composed of 179 places in 124 ms of which 3 ms to minimize.
[2025-06-01 00:31:22] [INFO ] Deduced a trap composed of 182 places in 121 ms of which 3 ms to minimize.
[2025-06-01 00:31:22] [INFO ] Deduced a trap composed of 179 places in 120 ms of which 2 ms to minimize.
[2025-06-01 00:31:22] [INFO ] Deduced a trap composed of 191 places in 126 ms of which 3 ms to minimize.
[2025-06-01 00:31:22] [INFO ] Deduced a trap composed of 197 places in 134 ms of which 2 ms to minimize.
[2025-06-01 00:31:22] [INFO ] Deduced a trap composed of 185 places in 123 ms of which 2 ms to minimize.
[2025-06-01 00:31:22] [INFO ] Deduced a trap composed of 183 places in 121 ms of which 2 ms to minimize.
[2025-06-01 00:31:22] [INFO ] Deduced a trap composed of 203 places in 129 ms of which 2 ms to minimize.
[2025-06-01 00:31:23] [INFO ] Deduced a trap composed of 192 places in 113 ms of which 2 ms to minimize.
[2025-06-01 00:31:23] [INFO ] Deduced a trap composed of 195 places in 116 ms of which 2 ms to minimize.
[2025-06-01 00:31:23] [INFO ] Deduced a trap composed of 183 places in 112 ms of which 3 ms to minimize.
[2025-06-01 00:31:23] [INFO ] Deduced a trap composed of 190 places in 124 ms of which 2 ms to minimize.
[2025-06-01 00:31:23] [INFO ] Deduced a trap composed of 202 places in 117 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/415 variables, 20/300 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2025-06-01 00:31:25] [INFO ] Deduced a trap composed of 177 places in 128 ms of which 3 ms to minimize.
[2025-06-01 00:31:25] [INFO ] Deduced a trap composed of 194 places in 116 ms of which 3 ms to minimize.
[2025-06-01 00:31:25] [INFO ] Deduced a trap composed of 199 places in 114 ms of which 3 ms to minimize.
[2025-06-01 00:31:25] [INFO ] Deduced a trap composed of 208 places in 117 ms of which 3 ms to minimize.
[2025-06-01 00:31:25] [INFO ] Deduced a trap composed of 185 places in 120 ms of which 3 ms to minimize.
[2025-06-01 00:31:25] [INFO ] Deduced a trap composed of 180 places in 119 ms of which 3 ms to minimize.
[2025-06-01 00:31:25] [INFO ] Deduced a trap composed of 197 places in 120 ms of which 3 ms to minimize.
[2025-06-01 00:31:26] [INFO ] Deduced a trap composed of 180 places in 115 ms of which 2 ms to minimize.
[2025-06-01 00:31:26] [INFO ] Deduced a trap composed of 187 places in 118 ms of which 2 ms to minimize.
[2025-06-01 00:31:26] [INFO ] Deduced a trap composed of 183 places in 125 ms of which 3 ms to minimize.
[2025-06-01 00:31:26] [INFO ] Deduced a trap composed of 187 places in 114 ms of which 2 ms to minimize.
[2025-06-01 00:31:26] [INFO ] Deduced a trap composed of 188 places in 120 ms of which 3 ms to minimize.
[2025-06-01 00:31:26] [INFO ] Deduced a trap composed of 183 places in 119 ms of which 3 ms to minimize.
[2025-06-01 00:31:26] [INFO ] Deduced a trap composed of 199 places in 127 ms of which 3 ms to minimize.
[2025-06-01 00:31:27] [INFO ] Deduced a trap composed of 189 places in 132 ms of which 3 ms to minimize.
[2025-06-01 00:31:27] [INFO ] Deduced a trap composed of 191 places in 126 ms of which 2 ms to minimize.
[2025-06-01 00:31:27] [INFO ] Deduced a trap composed of 178 places in 124 ms of which 2 ms to minimize.
[2025-06-01 00:31:28] [INFO ] Deduced a trap composed of 187 places in 123 ms of which 2 ms to minimize.
[2025-06-01 00:31:28] [INFO ] Deduced a trap composed of 157 places in 133 ms of which 3 ms to minimize.
[2025-06-01 00:31:28] [INFO ] Deduced a trap composed of 165 places in 126 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/415 variables, 20/320 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2025-06-01 00:31:29] [INFO ] Deduced a trap composed of 156 places in 100 ms of which 2 ms to minimize.
[2025-06-01 00:31:30] [INFO ] Deduced a trap composed of 160 places in 133 ms of which 3 ms to minimize.
[2025-06-01 00:31:30] [INFO ] Deduced a trap composed of 168 places in 102 ms of which 2 ms to minimize.
[2025-06-01 00:31:33] [INFO ] Deduced a trap composed of 200 places in 119 ms of which 2 ms to minimize.
[2025-06-01 00:31:33] [INFO ] Deduced a trap composed of 190 places in 113 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/415 variables, 5/325 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2025-06-01 00:31:41] [INFO ] Deduced a trap composed of 183 places in 125 ms of which 2 ms to minimize.
[2025-06-01 00:31:41] [INFO ] Deduced a trap composed of 182 places in 118 ms of which 2 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/415 variables, 2/327 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2025-06-01 00:31:45] [INFO ] Deduced a trap composed of 184 places in 123 ms of which 4 ms to minimize.
[2025-06-01 00:31:45] [INFO ] Deduced a trap composed of 176 places in 132 ms of which 2 ms to minimize.
[2025-06-01 00:31:45] [INFO ] Deduced a trap composed of 183 places in 116 ms of which 3 ms to minimize.
[2025-06-01 00:31:45] [INFO ] Deduced a trap composed of 177 places in 116 ms of which 2 ms to minimize.
[2025-06-01 00:31:45] [INFO ] Deduced a trap composed of 173 places in 117 ms of which 2 ms to minimize.
[2025-06-01 00:31:45] [INFO ] Deduced a trap composed of 175 places in 111 ms of which 3 ms to minimize.
[2025-06-01 00:31:45] [INFO ] Deduced a trap composed of 202 places in 112 ms of which 2 ms to minimize.
[2025-06-01 00:31:46] [INFO ] Deduced a trap composed of 190 places in 114 ms of which 2 ms to minimize.
[2025-06-01 00:31:46] [INFO ] Deduced a trap composed of 190 places in 113 ms of which 3 ms to minimize.
[2025-06-01 00:31:46] [INFO ] Deduced a trap composed of 174 places in 115 ms of which 2 ms to minimize.
[2025-06-01 00:31:46] [INFO ] Deduced a trap composed of 180 places in 124 ms of which 2 ms to minimize.
[2025-06-01 00:31:46] [INFO ] Deduced a trap composed of 180 places in 118 ms of which 3 ms to minimize.
[2025-06-01 00:31:46] [INFO ] Deduced a trap composed of 191 places in 116 ms of which 2 ms to minimize.
[2025-06-01 00:31:46] [INFO ] Deduced a trap composed of 193 places in 116 ms of which 3 ms to minimize.
[2025-06-01 00:31:46] [INFO ] Deduced a trap composed of 185 places in 123 ms of which 3 ms to minimize.
[2025-06-01 00:31:47] [INFO ] Deduced a trap composed of 184 places in 114 ms of which 2 ms to minimize.
[2025-06-01 00:31:47] [INFO ] Deduced a trap composed of 197 places in 127 ms of which 2 ms to minimize.
[2025-06-01 00:31:47] [INFO ] Deduced a trap composed of 199 places in 116 ms of which 2 ms to minimize.
[2025-06-01 00:31:47] [INFO ] Deduced a trap composed of 202 places in 122 ms of which 3 ms to minimize.
[2025-06-01 00:31:47] [INFO ] Deduced a trap composed of 181 places in 116 ms of which 3 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/415 variables, 20/347 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 415/815 variables, and 347 constraints, problems are : Problem set: 0 solved, 335 unsolved in 120019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/419 constraints, ReadFeed: 0/12 constraints, PredecessorRefiner: 0/335 constraints, Known Traps: 301/301 constraints]
After SMT, in 165283ms problems are : Problem set: 0 solved, 335 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 335 out of 419 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 396/396 transitions.
Applied a total of 0 rules in 12 ms. Remains 419 /419 variables (removed 0) and now considering 396/396 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 419/419 places, 396/396 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 396/396 transitions.
Applied a total of 0 rules in 13 ms. Remains 419 /419 variables (removed 0) and now considering 396/396 (removed 0) transitions.
[2025-06-01 00:31:48] [INFO ] Invariant cache hit.
[2025-06-01 00:31:48] [INFO ] Implicit Places using invariants in 134 ms returned []
[2025-06-01 00:31:48] [INFO ] Invariant cache hit.
[2025-06-01 00:31:48] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-01 00:31:49] [INFO ] Implicit Places using invariants and state equation in 1170 ms returned []
Implicit Place search using SMT with State Equation took 1305 ms to find 0 implicit places.
[2025-06-01 00:31:49] [INFO ] Redundant transitions in 8 ms returned []
Running 395 sub problems to find dead transitions.
[2025-06-01 00:31:49] [INFO ] Invariant cache hit.
[2025-06-01 00:31:49] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/414 variables, 39/41 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/414 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 3 (OVERLAPS) 2/416 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 395 unsolved
[2025-06-01 00:31:57] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 2 ms to minimize.
[2025-06-01 00:31:58] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 2 ms to minimize.
[2025-06-01 00:31:58] [INFO ] Deduced a trap composed of 127 places in 83 ms of which 1 ms to minimize.
[2025-06-01 00:31:59] [INFO ] Deduced a trap composed of 38 places in 84 ms of which 2 ms to minimize.
[2025-06-01 00:31:59] [INFO ] Deduced a trap composed of 45 places in 93 ms of which 1 ms to minimize.
[2025-06-01 00:31:59] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 2 ms to minimize.
[2025-06-01 00:31:59] [INFO ] Deduced a trap composed of 62 places in 75 ms of which 1 ms to minimize.
[2025-06-01 00:32:00] [INFO ] Deduced a trap composed of 138 places in 74 ms of which 2 ms to minimize.
[2025-06-01 00:32:00] [INFO ] Deduced a trap composed of 147 places in 73 ms of which 2 ms to minimize.
[2025-06-01 00:32:00] [INFO ] Deduced a trap composed of 74 places in 72 ms of which 1 ms to minimize.
[2025-06-01 00:32:01] [INFO ] Deduced a trap composed of 52 places in 84 ms of which 2 ms to minimize.
[2025-06-01 00:32:01] [INFO ] Deduced a trap composed of 57 places in 78 ms of which 2 ms to minimize.
[2025-06-01 00:32:02] [INFO ] Deduced a trap composed of 69 places in 71 ms of which 1 ms to minimize.
[2025-06-01 00:32:03] [INFO ] Deduced a trap composed of 110 places in 69 ms of which 1 ms to minimize.
[2025-06-01 00:32:03] [INFO ] Deduced a trap composed of 76 places in 59 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/416 variables, 15/61 constraints. Problems are: Problem set: 0 solved, 395 unsolved
[2025-06-01 00:32:05] [INFO ] Deduced a trap composed of 152 places in 93 ms of which 2 ms to minimize.
[2025-06-01 00:32:06] [INFO ] Deduced a trap composed of 116 places in 74 ms of which 2 ms to minimize.
[2025-06-01 00:32:07] [INFO ] Deduced a trap composed of 112 places in 65 ms of which 1 ms to minimize.
[2025-06-01 00:32:08] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 1 ms to minimize.
[2025-06-01 00:32:08] [INFO ] Deduced a trap composed of 130 places in 63 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/416 variables, 5/66 constraints. Problems are: Problem set: 0 solved, 395 unsolved
[2025-06-01 00:32:10] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 2 ms to minimize.
[2025-06-01 00:32:11] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/416 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 395 unsolved
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 416/815 variables, and 68 constraints, problems are : Problem set: 0 solved, 395 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 39/41 constraints, State Equation: 0/419 constraints, ReadFeed: 0/12 constraints, PredecessorRefiner: 395/395 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 395 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/414 variables, 39/41 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/414 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 3 (OVERLAPS) 2/416 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/416 variables, 22/68 constraints. Problems are: Problem set: 0 solved, 395 unsolved
[2025-06-01 00:32:27] [INFO ] Deduced a trap composed of 87 places in 53 ms of which 0 ms to minimize.
[2025-06-01 00:32:27] [INFO ] Deduced a trap composed of 82 places in 55 ms of which 1 ms to minimize.
[2025-06-01 00:32:27] [INFO ] Deduced a trap composed of 88 places in 56 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/416 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 395 unsolved
[2025-06-01 00:32:33] [INFO ] Deduced a trap composed of 85 places in 60 ms of which 1 ms to minimize.
[2025-06-01 00:32:33] [INFO ] Deduced a trap composed of 88 places in 66 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/416 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 8 (OVERLAPS) 3/419 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 395 unsolved
[2025-06-01 00:32:43] [INFO ] Deduced a trap composed of 83 places in 58 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/419 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 395 unsolved
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 Int declared 419/815 variables, and 76 constraints, problems are : Problem set: 0 solved, 395 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/419 constraints, ReadFeed: 0/12 constraints, PredecessorRefiner: 0/395 constraints, Known Traps: 28/28 constraints]
After SMT, in 60074ms problems are : Problem set: 0 solved, 395 unsolved
Search for dead transitions found 0 dead transitions in 60079ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61417 ms. Remains : 419/419 places, 396/396 transitions.
RANDOM walk for 400000 steps (57843 resets) in 6606 ms. (60 steps per ms) remains 335/335 properties
Running SMT prover for 335 properties.
[2025-06-01 00:32:51] [INFO ] Invariant cache hit.
[2025-06-01 00:32:51] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2025-06-01 00:32:51] [INFO ] [Real]Absence check using 7 positive and 41 generalized place invariants in 11 ms returned sat
[2025-06-01 00:32:52] [INFO ] After 1080ms SMT Verify possible using state equation in real domain returned unsat :0 sat :335
[2025-06-01 00:32:52] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-01 00:32:53] [INFO ] After 1120ms SMT Verify possible using 12 Read/Feed constraints in real domain returned unsat :0 sat :335
TRAPS : Iteration 0
[2025-06-01 00:33:03] [INFO ] After 10697ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:335
[2025-06-01 00:33:03] [INFO ] After 12063ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:335
[2025-06-01 00:33:03] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2025-06-01 00:33:03] [INFO ] [Nat]Absence check using 7 positive and 41 generalized place invariants in 10 ms returned sat
[2025-06-01 00:33:05] [INFO ] After 1211ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :335
[2025-06-01 00:33:06] [INFO ] After 1340ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :335
TRAPS : Iteration 0
[2025-06-01 00:33:06] [INFO ] Deduced a trap composed of 18 places in 123 ms of which 2 ms to minimize.
[2025-06-01 00:33:06] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 2 ms to minimize.
[2025-06-01 00:33:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 283 ms
[2025-06-01 00:33:07] [INFO ] Deduced a trap composed of 166 places in 132 ms of which 3 ms to minimize.
[2025-06-01 00:33:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2025-06-01 00:33:07] [INFO ] Deduced a trap composed of 28 places in 130 ms of which 3 ms to minimize.
[2025-06-01 00:33:07] [INFO ] Deduced a trap composed of 132 places in 128 ms of which 3 ms to minimize.
[2025-06-01 00:33:08] [INFO ] Deduced a trap composed of 147 places in 134 ms of which 3 ms to minimize.
[2025-06-01 00:33:08] [INFO ] Deduced a trap composed of 165 places in 118 ms of which 2 ms to minimize.
[2025-06-01 00:33:08] [INFO ] Deduced a trap composed of 157 places in 120 ms of which 3 ms to minimize.
[2025-06-01 00:33:08] [INFO ] Deduced a trap composed of 153 places in 119 ms of which 3 ms to minimize.
[2025-06-01 00:33:08] [INFO ] Deduced a trap composed of 155 places in 123 ms of which 3 ms to minimize.
[2025-06-01 00:33:08] [INFO ] Deduced a trap composed of 173 places in 127 ms of which 3 ms to minimize.
[2025-06-01 00:33:08] [INFO ] Deduced a trap composed of 123 places in 129 ms of which 3 ms to minimize.
[2025-06-01 00:33:09] [INFO ] Deduced a trap composed of 170 places in 133 ms of which 3 ms to minimize.
[2025-06-01 00:33:09] [INFO ] Deduced a trap composed of 151 places in 126 ms of which 2 ms to minimize.
[2025-06-01 00:33:09] [INFO ] Deduced a trap composed of 133 places in 131 ms of which 3 ms to minimize.
[2025-06-01 00:33:09] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 3 ms to minimize.
[2025-06-01 00:33:09] [INFO ] Deduced a trap composed of 142 places in 120 ms of which 2 ms to minimize.
[2025-06-01 00:33:09] [INFO ] Deduced a trap composed of 168 places in 128 ms of which 2 ms to minimize.
[2025-06-01 00:33:10] [INFO ] Deduced a trap composed of 157 places in 125 ms of which 2 ms to minimize.
[2025-06-01 00:33:10] [INFO ] Deduced a trap composed of 172 places in 125 ms of which 2 ms to minimize.
[2025-06-01 00:33:10] [INFO ] Deduced a trap composed of 147 places in 129 ms of which 2 ms to minimize.
[2025-06-01 00:33:10] [INFO ] Deduced a trap composed of 139 places in 115 ms of which 3 ms to minimize.
[2025-06-01 00:33:10] [INFO ] Deduced a trap composed of 161 places in 121 ms of which 2 ms to minimize.
[2025-06-01 00:33:10] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 3011 ms
[2025-06-01 00:33:10] [INFO ] Deduced a trap composed of 126 places in 101 ms of which 2 ms to minimize.
[2025-06-01 00:33:11] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 2 ms to minimize.
[2025-06-01 00:33:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 257 ms
[2025-06-01 00:33:11] [INFO ] Deduced a trap composed of 126 places in 103 ms of which 2 ms to minimize.
[2025-06-01 00:33:11] [INFO ] Deduced a trap composed of 142 places in 94 ms of which 2 ms to minimize.
[2025-06-01 00:33:11] [INFO ] Deduced a trap composed of 131 places in 98 ms of which 2 ms to minimize.
[2025-06-01 00:33:11] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 2 ms to minimize.
[2025-06-01 00:33:12] [INFO ] Deduced a trap composed of 118 places in 94 ms of which 2 ms to minimize.
[2025-06-01 00:33:12] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 611 ms
[2025-06-01 00:33:12] [INFO ] Deduced a trap composed of 40 places in 97 ms of which 2 ms to minimize.
[2025-06-01 00:33:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 143 ms
[2025-06-01 00:33:13] [INFO ] Deduced a trap composed of 57 places in 95 ms of which 1 ms to minimize.
[2025-06-01 00:33:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2025-06-01 00:33:13] [INFO ] Deduced a trap composed of 50 places in 89 ms of which 2 ms to minimize.
[2025-06-01 00:33:13] [INFO ] Deduced a trap composed of 52 places in 90 ms of which 2 ms to minimize.
[2025-06-01 00:33:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 234 ms
[2025-06-01 00:33:14] [INFO ] Deduced a trap composed of 156 places in 132 ms of which 3 ms to minimize.
[2025-06-01 00:33:14] [INFO ] Deduced a trap composed of 118 places in 126 ms of which 2 ms to minimize.
[2025-06-01 00:33:14] [INFO ] Deduced a trap composed of 161 places in 126 ms of which 3 ms to minimize.
[2025-06-01 00:33:14] [INFO ] Deduced a trap composed of 156 places in 120 ms of which 3 ms to minimize.
[2025-06-01 00:33:14] [INFO ] Deduced a trap composed of 179 places in 126 ms of which 2 ms to minimize.
[2025-06-01 00:33:14] [INFO ] Deduced a trap composed of 156 places in 127 ms of which 3 ms to minimize.
[2025-06-01 00:33:15] [INFO ] Deduced a trap composed of 165 places in 119 ms of which 3 ms to minimize.
[2025-06-01 00:33:15] [INFO ] Deduced a trap composed of 108 places in 125 ms of which 3 ms to minimize.
[2025-06-01 00:33:15] [INFO ] Deduced a trap composed of 155 places in 125 ms of which 2 ms to minimize.
[2025-06-01 00:33:15] [INFO ] Deduced a trap composed of 164 places in 116 ms of which 3 ms to minimize.
[2025-06-01 00:33:15] [INFO ] Deduced a trap composed of 167 places in 123 ms of which 3 ms to minimize.
[2025-06-01 00:33:15] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 2 ms to minimize.
[2025-06-01 00:33:15] [INFO ] Deduced a trap composed of 130 places in 122 ms of which 2 ms to minimize.
[2025-06-01 00:33:16] [INFO ] Deduced a trap composed of 155 places in 123 ms of which 3 ms to minimize.
[2025-06-01 00:33:16] [INFO ] Deduced a trap composed of 159 places in 129 ms of which 2 ms to minimize.
[2025-06-01 00:33:16] [INFO ] Deduced a trap composed of 128 places in 124 ms of which 2 ms to minimize.
[2025-06-01 00:33:16] [INFO ] Deduced a trap composed of 173 places in 121 ms of which 2 ms to minimize.
[2025-06-01 00:33:16] [INFO ] Deduced a trap composed of 130 places in 134 ms of which 2 ms to minimize.
[2025-06-01 00:33:16] [INFO ] Deduced a trap composed of 153 places in 126 ms of which 3 ms to minimize.
[2025-06-01 00:33:17] [INFO ] Deduced a trap composed of 158 places in 123 ms of which 2 ms to minimize.
[2025-06-01 00:33:17] [INFO ] Deduced a trap composed of 166 places in 124 ms of which 3 ms to minimize.
[2025-06-01 00:33:17] [INFO ] Deduced a trap composed of 147 places in 131 ms of which 2 ms to minimize.
[2025-06-01 00:33:17] [INFO ] Deduced a trap composed of 166 places in 129 ms of which 3 ms to minimize.
[2025-06-01 00:33:17] [INFO ] Deduced a trap composed of 164 places in 124 ms of which 2 ms to minimize.
[2025-06-01 00:33:17] [INFO ] Deduced a trap composed of 131 places in 128 ms of which 2 ms to minimize.
[2025-06-01 00:33:17] [INFO ] Deduced a trap composed of 115 places in 120 ms of which 3 ms to minimize.
[2025-06-01 00:33:18] [INFO ] Deduced a trap composed of 157 places in 114 ms of which 6 ms to minimize.
[2025-06-01 00:33:18] [INFO ] Deduced a trap composed of 136 places in 119 ms of which 2 ms to minimize.
[2025-06-01 00:33:18] [INFO ] Deduced a trap composed of 182 places in 129 ms of which 2 ms to minimize.
[2025-06-01 00:33:18] [INFO ] Deduced a trap composed of 164 places in 132 ms of which 6 ms to minimize.
[2025-06-01 00:33:18] [INFO ] Deduced a trap composed of 182 places in 124 ms of which 2 ms to minimize.
[2025-06-01 00:33:18] [INFO ] Deduced a trap composed of 163 places in 122 ms of which 2 ms to minimize.
[2025-06-01 00:33:18] [INFO ] Deduced a trap composed of 124 places in 129 ms of which 3 ms to minimize.
[2025-06-01 00:33:19] [INFO ] Deduced a trap composed of 161 places in 123 ms of which 3 ms to minimize.
[2025-06-01 00:33:19] [INFO ] Deduced a trap composed of 127 places in 116 ms of which 3 ms to minimize.
[2025-06-01 00:33:19] [INFO ] Deduced a trap composed of 162 places in 128 ms of which 3 ms to minimize.
[2025-06-01 00:33:19] [INFO ] Deduced a trap composed of 176 places in 118 ms of which 2 ms to minimize.
[2025-06-01 00:33:19] [INFO ] Deduced a trap composed of 137 places in 124 ms of which 3 ms to minimize.
[2025-06-01 00:33:19] [INFO ] Deduced a trap composed of 130 places in 128 ms of which 3 ms to minimize.
[2025-06-01 00:33:19] [INFO ] Deduced a trap composed of 167 places in 119 ms of which 3 ms to minimize.
[2025-06-01 00:33:20] [INFO ] Deduced a trap composed of 168 places in 124 ms of which 2 ms to minimize.
[2025-06-01 00:33:20] [INFO ] Deduced a trap composed of 129 places in 120 ms of which 2 ms to minimize.
[2025-06-01 00:33:20] [INFO ] Deduced a trap composed of 170 places in 133 ms of which 2 ms to minimize.
[2025-06-01 00:33:20] [INFO ] Deduced a trap composed of 164 places in 127 ms of which 3 ms to minimize.
[2025-06-01 00:33:20] [INFO ] Deduced a trap composed of 176 places in 125 ms of which 2 ms to minimize.
[2025-06-01 00:33:20] [INFO ] Deduced a trap composed of 113 places in 125 ms of which 3 ms to minimize.
[2025-06-01 00:33:21] [INFO ] Deduced a trap composed of 156 places in 127 ms of which 3 ms to minimize.
[2025-06-01 00:33:21] [INFO ] Deduced a trap composed of 159 places in 121 ms of which 3 ms to minimize.
[2025-06-01 00:33:21] [INFO ] Deduced a trap composed of 159 places in 116 ms of which 2 ms to minimize.
[2025-06-01 00:33:21] [INFO ] Trap strengthening (SAT) tested/added 50/49 trap constraints in 7357 ms
[2025-06-01 00:33:22] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 3 ms to minimize.
[2025-06-01 00:33:22] [INFO ] Deduced a trap composed of 3 places in 123 ms of which 2 ms to minimize.
[2025-06-01 00:33:22] [INFO ] Deduced a trap composed of 34 places in 126 ms of which 2 ms to minimize.
[2025-06-01 00:33:22] [INFO ] Deduced a trap composed of 4 places in 133 ms of which 4 ms to minimize.
[2025-06-01 00:33:22] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 579 ms
[2025-06-01 00:33:23] [INFO ] Deduced a trap composed of 69 places in 86 ms of which 2 ms to minimize.
[2025-06-01 00:33:23] [INFO ] Deduced a trap composed of 105 places in 79 ms of which 2 ms to minimize.
[2025-06-01 00:33:23] [INFO ] Deduced a trap composed of 62 places in 88 ms of which 1 ms to minimize.
[2025-06-01 00:33:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 379 ms
[2025-06-01 00:33:27] [INFO ] Deduced a trap composed of 112 places in 95 ms of which 1 ms to minimize.
[2025-06-01 00:33:27] [INFO ] Deduced a trap composed of 58 places in 89 ms of which 2 ms to minimize.
[2025-06-01 00:33:27] [INFO ] Deduced a trap composed of 64 places in 96 ms of which 2 ms to minimize.
[2025-06-01 00:33:27] [INFO ] Deduced a trap composed of 113 places in 88 ms of which 1 ms to minimize.
[2025-06-01 00:33:27] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 536 ms
[2025-06-01 00:33:27] [INFO ] Deduced a trap composed of 82 places in 71 ms of which 1 ms to minimize.
[2025-06-01 00:33:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2025-06-01 00:33:28] [INFO ] Deduced a trap composed of 45 places in 94 ms of which 2 ms to minimize.
[2025-06-01 00:33:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2025-06-01 00:33:28] [INFO ] Deduced a trap composed of 100 places in 73 ms of which 1 ms to minimize.
[2025-06-01 00:33:29] [INFO ] Deduced a trap composed of 94 places in 73 ms of which 2 ms to minimize.
[2025-06-01 00:33:29] [INFO ] Deduced a trap composed of 76 places in 71 ms of which 1 ms to minimize.
[2025-06-01 00:33:29] [INFO ] Deduced a trap composed of 100 places in 71 ms of which 2 ms to minimize.
[2025-06-01 00:33:29] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 412 ms
[2025-06-01 00:33:30] [INFO ] Deduced a trap composed of 114 places in 78 ms of which 2 ms to minimize.
[2025-06-01 00:33:30] [INFO ] Deduced a trap composed of 101 places in 83 ms of which 2 ms to minimize.
[2025-06-01 00:33:31] [INFO ] Deduced a trap composed of 121 places in 79 ms of which 1 ms to minimize.
[2025-06-01 00:33:31] [INFO ] Deduced a trap composed of 74 places in 79 ms of which 1 ms to minimize.
[2025-06-01 00:33:31] [INFO ] Deduced a trap composed of 127 places in 80 ms of which 2 ms to minimize.
[2025-06-01 00:33:31] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 975 ms
[2025-06-01 00:33:31] [INFO ] Deduced a trap composed of 88 places in 61 ms of which 1 ms to minimize.
[2025-06-01 00:33:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2025-06-01 00:33:33] [INFO ] Deduced a trap composed of 88 places in 59 ms of which 1 ms to minimize.
[2025-06-01 00:33:33] [INFO ] Deduced a trap composed of 91 places in 57 ms of which 1 ms to minimize.
[2025-06-01 00:33:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 187 ms
[2025-06-01 00:33:34] [INFO ] Deduced a trap composed of 109 places in 63 ms of which 1 ms to minimize.
[2025-06-01 00:33:34] [INFO ] Deduced a trap composed of 109 places in 66 ms of which 1 ms to minimize.
[2025-06-01 00:33:34] [INFO ] Deduced a trap composed of 84 places in 64 ms of which 1 ms to minimize.
[2025-06-01 00:33:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 306 ms
[2025-06-01 00:33:35] [INFO ] Deduced a trap composed of 82 places in 53 ms of which 1 ms to minimize.
[2025-06-01 00:33:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2025-06-01 00:33:35] [INFO ] Deduced a trap composed of 80 places in 58 ms of which 1 ms to minimize.
[2025-06-01 00:33:35] [INFO ] Deduced a trap composed of 81 places in 57 ms of which 1 ms to minimize.
[2025-06-01 00:33:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 183 ms
[2025-06-01 00:33:36] [INFO ] Deduced a trap composed of 87 places in 53 ms of which 1 ms to minimize.
[2025-06-01 00:33:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
TRAPS : Iteration 1
[2025-06-01 00:33:38] [INFO ] Deduced a trap composed of 143 places in 107 ms of which 2 ms to minimize.
[2025-06-01 00:33:39] [INFO ] Deduced a trap composed of 137 places in 102 ms of which 2 ms to minimize.
[2025-06-01 00:33:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 287 ms
[2025-06-01 00:33:40] [INFO ] Deduced a trap composed of 134 places in 100 ms of which 2 ms to minimize.
[2025-06-01 00:33:40] [INFO ] Deduced a trap composed of 142 places in 99 ms of which 2 ms to minimize.
[2025-06-01 00:33:41] [INFO ] Deduced a trap composed of 138 places in 98 ms of which 2 ms to minimize.
[2025-06-01 00:33:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 393 ms
[2025-06-01 00:33:44] [INFO ] Deduced a trap composed of 120 places in 86 ms of which 2 ms to minimize.
[2025-06-01 00:33:44] [INFO ] Deduced a trap composed of 123 places in 85 ms of which 2 ms to minimize.
[2025-06-01 00:33:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 252 ms
[2025-06-01 00:33:50] [INFO ] Deduced a trap composed of 57 places in 80 ms of which 1 ms to minimize.
[2025-06-01 00:33:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
[2025-06-01 00:33:54] [INFO ] Deduced a trap composed of 85 places in 60 ms of which 0 ms to minimize.
[2025-06-01 00:33:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2025-06-01 00:33:56] [INFO ] Deduced a trap composed of 93 places in 67 ms of which 1 ms to minimize.
[2025-06-01 00:33:56] [INFO ] Deduced a trap composed of 101 places in 56 ms of which 1 ms to minimize.
[2025-06-01 00:33:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 185 ms
TRAPS : Iteration 2
[2025-06-01 00:33:57] [INFO ] Deduced a trap composed of 149 places in 107 ms of which 2 ms to minimize.
[2025-06-01 00:33:57] [INFO ] Deduced a trap composed of 130 places in 103 ms of which 2 ms to minimize.
[2025-06-01 00:33:57] [INFO ] Deduced a trap composed of 146 places in 103 ms of which 2 ms to minimize.
[2025-06-01 00:33:57] [INFO ] Deduced a trap composed of 137 places in 103 ms of which 2 ms to minimize.
[2025-06-01 00:33:57] [INFO ] Deduced a trap composed of 130 places in 104 ms of which 2 ms to minimize.
[2025-06-01 00:33:57] [INFO ] Deduced a trap composed of 135 places in 108 ms of which 3 ms to minimize.
[2025-06-01 00:33:57] [INFO ] Deduced a trap composed of 132 places in 105 ms of which 3 ms to minimize.
[2025-06-01 00:33:58] [INFO ] Deduced a trap composed of 132 places in 109 ms of which 2 ms to minimize.
[2025-06-01 00:33:58] [INFO ] Deduced a trap composed of 145 places in 106 ms of which 3 ms to minimize.
[2025-06-01 00:33:58] [INFO ] Deduced a trap composed of 136 places in 105 ms of which 2 ms to minimize.
[2025-06-01 00:33:58] [INFO ] Deduced a trap composed of 127 places in 105 ms of which 2 ms to minimize.
[2025-06-01 00:33:58] [INFO ] Deduced a trap composed of 131 places in 110 ms of which 2 ms to minimize.
[2025-06-01 00:33:58] [INFO ] Deduced a trap composed of 136 places in 112 ms of which 2 ms to minimize.
[2025-06-01 00:33:58] [INFO ] Deduced a trap composed of 132 places in 111 ms of which 2 ms to minimize.
[2025-06-01 00:33:58] [INFO ] Deduced a trap composed of 131 places in 105 ms of which 2 ms to minimize.
[2025-06-01 00:33:59] [INFO ] Deduced a trap composed of 150 places in 111 ms of which 3 ms to minimize.
[2025-06-01 00:33:59] [INFO ] Deduced a trap composed of 137 places in 110 ms of which 2 ms to minimize.
[2025-06-01 00:33:59] [INFO ] Deduced a trap composed of 135 places in 106 ms of which 2 ms to minimize.
[2025-06-01 00:33:59] [INFO ] Deduced a trap composed of 131 places in 102 ms of which 2 ms to minimize.
[2025-06-01 00:33:59] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2476 ms
[2025-06-01 00:33:59] [INFO ] Deduced a trap composed of 131 places in 112 ms of which 3 ms to minimize.
[2025-06-01 00:33:59] [INFO ] Deduced a trap composed of 136 places in 106 ms of which 2 ms to minimize.
[2025-06-01 00:34:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 292 ms
[2025-06-01 00:34:04] [INFO ] Deduced a trap composed of 130 places in 92 ms of which 2 ms to minimize.
[2025-06-01 00:34:04] [INFO ] Deduced a trap composed of 116 places in 87 ms of which 2 ms to minimize.
[2025-06-01 00:34:04] [INFO ] Deduced a trap composed of 119 places in 86 ms of which 2 ms to minimize.
[2025-06-01 00:34:04] [INFO ] Deduced a trap composed of 124 places in 87 ms of which 2 ms to minimize.
[2025-06-01 00:34:04] [INFO ] Deduced a trap composed of 122 places in 88 ms of which 2 ms to minimize.
[2025-06-01 00:34:04] [INFO ] Deduced a trap composed of 112 places in 86 ms of which 1 ms to minimize.
[2025-06-01 00:34:04] [INFO ] Deduced a trap composed of 140 places in 84 ms of which 2 ms to minimize.
[2025-06-01 00:34:04] [INFO ] Deduced a trap composed of 114 places in 83 ms of which 2 ms to minimize.
[2025-06-01 00:34:05] [INFO ] Deduced a trap composed of 120 places in 83 ms of which 2 ms to minimize.
[2025-06-01 00:34:05] [INFO ] Deduced a trap composed of 120 places in 84 ms of which 2 ms to minimize.
[2025-06-01 00:34:05] [INFO ] Deduced a trap composed of 133 places in 95 ms of which 2 ms to minimize.
[2025-06-01 00:34:05] [INFO ] Deduced a trap composed of 114 places in 87 ms of which 2 ms to minimize.
[2025-06-01 00:34:05] [INFO ] Deduced a trap composed of 124 places in 82 ms of which 2 ms to minimize.
[2025-06-01 00:34:05] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1443 ms
[2025-06-01 00:34:10] [INFO ] Deduced a trap composed of 109 places in 86 ms of which 2 ms to minimize.
[2025-06-01 00:34:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2025-06-01 00:34:15] [INFO ] Deduced a trap composed of 103 places in 74 ms of which 1 ms to minimize.
[2025-06-01 00:34:15] [INFO ] Deduced a trap composed of 101 places in 68 ms of which 2 ms to minimize.
[2025-06-01 00:34:15] [INFO ] Deduced a trap composed of 116 places in 67 ms of which 1 ms to minimize.
[2025-06-01 00:34:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 303 ms
TRAPS : Iteration 3
[2025-06-01 00:34:19] [INFO ] Deduced a trap composed of 153 places in 113 ms of which 2 ms to minimize.
[2025-06-01 00:34:19] [INFO ] Deduced a trap composed of 138 places in 107 ms of which 3 ms to minimize.
[2025-06-01 00:34:19] [INFO ] Deduced a trap composed of 139 places in 109 ms of which 2 ms to minimize.
[2025-06-01 00:34:19] [INFO ] Deduced a trap composed of 155 places in 107 ms of which 2 ms to minimize.
[2025-06-01 00:34:19] [INFO ] Deduced a trap composed of 136 places in 111 ms of which 2 ms to minimize.
[2025-06-01 00:34:19] [INFO ] Deduced a trap composed of 149 places in 107 ms of which 2 ms to minimize.
[2025-06-01 00:34:19] [INFO ] Deduced a trap composed of 140 places in 107 ms of which 2 ms to minimize.
[2025-06-01 00:34:20] [INFO ] Deduced a trap composed of 139 places in 109 ms of which 2 ms to minimize.
[2025-06-01 00:34:20] [INFO ] Deduced a trap composed of 149 places in 114 ms of which 3 ms to minimize.
[2025-06-01 00:34:20] [INFO ] Deduced a trap composed of 144 places in 106 ms of which 2 ms to minimize.
[2025-06-01 00:34:20] [INFO ] Deduced a trap composed of 143 places in 105 ms of which 2 ms to minimize.
[2025-06-01 00:34:20] [INFO ] Deduced a trap composed of 151 places in 108 ms of which 2 ms to minimize.
[2025-06-01 00:34:20] [INFO ] Deduced a trap composed of 157 places in 108 ms of which 2 ms to minimize.
[2025-06-01 00:34:20] [INFO ] Deduced a trap composed of 159 places in 104 ms of which 2 ms to minimize.
[2025-06-01 00:34:21] [INFO ] Deduced a trap composed of 146 places in 107 ms of which 2 ms to minimize.
[2025-06-01 00:34:21] [INFO ] Deduced a trap composed of 150 places in 121 ms of which 2 ms to minimize.
[2025-06-01 00:34:21] [INFO ] Deduced a trap composed of 146 places in 108 ms of which 2 ms to minimize.
[2025-06-01 00:34:21] [INFO ] Deduced a trap composed of 150 places in 105 ms of which 2 ms to minimize.
[2025-06-01 00:34:21] [INFO ] Deduced a trap composed of 153 places in 102 ms of which 2 ms to minimize.
[2025-06-01 00:34:21] [INFO ] Deduced a trap composed of 150 places in 102 ms of which 3 ms to minimize.
[2025-06-01 00:34:21] [INFO ] Deduced a trap composed of 150 places in 106 ms of which 2 ms to minimize.
[2025-06-01 00:34:21] [INFO ] Deduced a trap composed of 163 places in 106 ms of which 2 ms to minimize.
[2025-06-01 00:34:22] [INFO ] Deduced a trap composed of 171 places in 102 ms of which 3 ms to minimize.
[2025-06-01 00:34:22] [INFO ] Deduced a trap composed of 161 places in 105 ms of which 3 ms to minimize.
[2025-06-01 00:34:22] [INFO ] Deduced a trap composed of 158 places in 106 ms of which 2 ms to minimize.
[2025-06-01 00:34:22] [INFO ] Deduced a trap composed of 152 places in 109 ms of which 2 ms to minimize.
[2025-06-01 00:34:22] [INFO ] Deduced a trap composed of 145 places in 112 ms of which 2 ms to minimize.
[2025-06-01 00:34:22] [INFO ] Deduced a trap composed of 153 places in 106 ms of which 2 ms to minimize.
[2025-06-01 00:34:22] [INFO ] Deduced a trap composed of 143 places in 97 ms of which 2 ms to minimize.
[2025-06-01 00:34:22] [INFO ] Deduced a trap composed of 169 places in 101 ms of which 2 ms to minimize.
[2025-06-01 00:34:23] [INFO ] Deduced a trap composed of 141 places in 102 ms of which 2 ms to minimize.
[2025-06-01 00:34:23] [INFO ] Deduced a trap composed of 162 places in 100 ms of which 2 ms to minimize.
[2025-06-01 00:34:23] [INFO ] Deduced a trap composed of 153 places in 98 ms of which 2 ms to minimize.
[2025-06-01 00:34:23] [INFO ] Deduced a trap composed of 144 places in 101 ms of which 2 ms to minimize.
[2025-06-01 00:34:23] [INFO ] Deduced a trap composed of 150 places in 104 ms of which 3 ms to minimize.
[2025-06-01 00:34:23] [INFO ] Deduced a trap composed of 132 places in 106 ms of which 2 ms to minimize.
[2025-06-01 00:34:23] [INFO ] Deduced a trap composed of 139 places in 99 ms of which 2 ms to minimize.
[2025-06-01 00:34:23] [INFO ] Deduced a trap composed of 148 places in 102 ms of which 3 ms to minimize.
[2025-06-01 00:34:24] [INFO ] Deduced a trap composed of 132 places in 100 ms of which 2 ms to minimize.
[2025-06-01 00:34:24] [INFO ] Deduced a trap composed of 125 places in 104 ms of which 2 ms to minimize.
[2025-06-01 00:34:24] [INFO ] Deduced a trap composed of 129 places in 101 ms of which 2 ms to minimize.
[2025-06-01 00:34:24] [INFO ] Deduced a trap composed of 128 places in 99 ms of which 3 ms to minimize.
[2025-06-01 00:34:24] [INFO ] Deduced a trap composed of 134 places in 102 ms of which 2 ms to minimize.
[2025-06-01 00:34:24] [INFO ] Deduced a trap composed of 128 places in 96 ms of which 2 ms to minimize.
[2025-06-01 00:34:24] [INFO ] Deduced a trap composed of 149 places in 101 ms of which 2 ms to minimize.
[2025-06-01 00:34:25] [INFO ] Deduced a trap composed of 128 places in 101 ms of which 2 ms to minimize.
[2025-06-01 00:34:25] [INFO ] Deduced a trap composed of 140 places in 113 ms of which 2 ms to minimize.
[2025-06-01 00:34:25] [INFO ] Deduced a trap composed of 153 places in 105 ms of which 2 ms to minimize.
[2025-06-01 00:34:25] [INFO ] Deduced a trap composed of 152 places in 107 ms of which 2 ms to minimize.
[2025-06-01 00:34:25] [INFO ] Deduced a trap composed of 147 places in 106 ms of which 2 ms to minimize.
[2025-06-01 00:34:25] [INFO ] Deduced a trap composed of 147 places in 106 ms of which 3 ms to minimize.
[2025-06-01 00:34:25] [INFO ] Deduced a trap composed of 141 places in 109 ms of which 2 ms to minimize.
[2025-06-01 00:34:25] [INFO ] Deduced a trap composed of 147 places in 101 ms of which 2 ms to minimize.
[2025-06-01 00:34:26] [INFO ] Deduced a trap composed of 143 places in 102 ms of which 2 ms to minimize.
[2025-06-01 00:34:26] [INFO ] Deduced a trap composed of 149 places in 98 ms of which 2 ms to minimize.
[2025-06-01 00:34:26] [INFO ] Deduced a trap composed of 154 places in 98 ms of which 2 ms to minimize.
[2025-06-01 00:34:26] [INFO ] Deduced a trap composed of 146 places in 101 ms of which 2 ms to minimize.
[2025-06-01 00:34:26] [INFO ] Deduced a trap composed of 149 places in 99 ms of which 2 ms to minimize.
[2025-06-01 00:34:26] [INFO ] Deduced a trap composed of 155 places in 96 ms of which 2 ms to minimize.
[2025-06-01 00:34:26] [INFO ] Deduced a trap composed of 165 places in 99 ms of which 2 ms to minimize.
[2025-06-01 00:34:26] [INFO ] Trap strengthening (SAT) tested/added 61/60 trap constraints in 7919 ms
[2025-06-01 00:34:44] [INFO ] Deduced a trap composed of 172 places in 127 ms of which 2 ms to minimize.
[2025-06-01 00:34:44] [INFO ] Deduced a trap composed of 127 places in 133 ms of which 2 ms to minimize.
[2025-06-01 00:34:44] [INFO ] Deduced a trap composed of 129 places in 120 ms of which 2 ms to minimize.
[2025-06-01 00:34:45] [INFO ] Deduced a trap composed of 177 places in 119 ms of which 2 ms to minimize.
[2025-06-01 00:34:45] [INFO ] Deduced a trap composed of 131 places in 118 ms of which 3 ms to minimize.
[2025-06-01 00:34:45] [INFO ] Deduced a trap composed of 127 places in 123 ms of which 3 ms to minimize.
[2025-06-01 00:34:45] [INFO ] Deduced a trap composed of 127 places in 120 ms of which 2 ms to minimize.
[2025-06-01 00:34:45] [INFO ] Deduced a trap composed of 162 places in 132 ms of which 3 ms to minimize.
[2025-06-01 00:34:45] [INFO ] Deduced a trap composed of 110 places in 122 ms of which 2 ms to minimize.
[2025-06-01 00:34:45] [INFO ] Deduced a trap composed of 119 places in 121 ms of which 2 ms to minimize.
[2025-06-01 00:34:46] [INFO ] Deduced a trap composed of 121 places in 129 ms of which 2 ms to minimize.
[2025-06-01 00:34:46] [INFO ] Deduced a trap composed of 169 places in 120 ms of which 2 ms to minimize.
[2025-06-01 00:34:46] [INFO ] Deduced a trap composed of 118 places in 119 ms of which 2 ms to minimize.
[2025-06-01 00:34:46] [INFO ] Deduced a trap composed of 129 places in 116 ms of which 2 ms to minimize.
[2025-06-01 00:34:47] [INFO ] Deduced a trap composed of 119 places in 120 ms of which 2 ms to minimize.
[2025-06-01 00:34:47] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 3 ms to minimize.
[2025-06-01 00:34:47] [INFO ] Deduced a trap composed of 45 places in 121 ms of which 2 ms to minimize.
[2025-06-01 00:34:47] [INFO ] Deduced a trap composed of 177 places in 122 ms of which 3 ms to minimize.
[2025-06-01 00:34:47] [INFO ] Deduced a trap composed of 184 places in 116 ms of which 2 ms to minimize.
[2025-06-01 00:34:48] [INFO ] Deduced a trap composed of 174 places in 119 ms of which 3 ms to minimize.
[2025-06-01 00:34:48] [INFO ] Deduced a trap composed of 188 places in 117 ms of which 2 ms to minimize.
[2025-06-01 00:34:48] [INFO ] Deduced a trap composed of 205 places in 115 ms of which 2 ms to minimize.
[2025-06-01 00:34:48] [INFO ] Deduced a trap composed of 167 places in 113 ms of which 3 ms to minimize.
[2025-06-01 00:34:48] [INFO ] Deduced a trap composed of 183 places in 119 ms of which 3 ms to minimize.
[2025-06-01 00:34:48] [INFO ] Deduced a trap composed of 130 places in 114 ms of which 2 ms to minimize.
[2025-06-01 00:34:49] [INFO ] Deduced a trap composed of 179 places in 124 ms of which 3 ms to minimize.
[2025-06-01 00:34:49] [INFO ] Deduced a trap composed of 173 places in 115 ms of which 2 ms to minimize.
[2025-06-01 00:34:49] [INFO ] Deduced a trap composed of 199 places in 120 ms of which 2 ms to minimize.
[2025-06-01 00:34:49] [INFO ] Deduced a trap composed of 171 places in 114 ms of which 3 ms to minimize.
[2025-06-01 00:34:49] [INFO ] Deduced a trap composed of 174 places in 116 ms of which 2 ms to minimize.
[2025-06-01 00:34:49] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 5339 ms
[2025-06-01 00:34:56] [INFO ] Deduced a trap composed of 69 places in 67 ms of which 1 ms to minimize.
[2025-06-01 00:34:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
TRAPS : Iteration 4
[2025-06-01 00:35:01] [INFO ] Deduced a trap composed of 146 places in 110 ms of which 2 ms to minimize.
[2025-06-01 00:35:02] [INFO ] Deduced a trap composed of 153 places in 113 ms of which 2 ms to minimize.
[2025-06-01 00:35:02] [INFO ] Deduced a trap composed of 171 places in 106 ms of which 2 ms to minimize.
[2025-06-01 00:35:02] [INFO ] Deduced a trap composed of 167 places in 100 ms of which 2 ms to minimize.
[2025-06-01 00:35:02] [INFO ] Deduced a trap composed of 166 places in 115 ms of which 3 ms to minimize.
[2025-06-01 00:35:02] [INFO ] Deduced a trap composed of 158 places in 99 ms of which 2 ms to minimize.
[2025-06-01 00:35:02] [INFO ] Deduced a trap composed of 170 places in 101 ms of which 2 ms to minimize.
[2025-06-01 00:35:02] [INFO ] Deduced a trap composed of 155 places in 101 ms of which 2 ms to minimize.
[2025-06-01 00:35:02] [INFO ] Deduced a trap composed of 161 places in 104 ms of which 2 ms to minimize.
[2025-06-01 00:35:03] [INFO ] Deduced a trap composed of 165 places in 97 ms of which 2 ms to minimize.
[2025-06-01 00:35:03] [INFO ] Deduced a trap composed of 157 places in 106 ms of which 2 ms to minimize.
[2025-06-01 00:35:03] [INFO ] Deduced a trap composed of 138 places in 106 ms of which 2 ms to minimize.
[2025-06-01 00:35:03] [INFO ] Deduced a trap composed of 135 places in 102 ms of which 2 ms to minimize.
[2025-06-01 00:35:03] [INFO ] Deduced a trap composed of 162 places in 106 ms of which 2 ms to minimize.
[2025-06-01 00:35:03] [INFO ] Deduced a trap composed of 141 places in 104 ms of which 2 ms to minimize.
[2025-06-01 00:35:03] [INFO ] Deduced a trap composed of 150 places in 101 ms of which 2 ms to minimize.
[2025-06-01 00:35:04] [INFO ] Deduced a trap composed of 147 places in 101 ms of which 2 ms to minimize.
[2025-06-01 00:35:04] [INFO ] Deduced a trap composed of 167 places in 108 ms of which 2 ms to minimize.
[2025-06-01 00:35:04] [INFO ] Deduced a trap composed of 153 places in 106 ms of which 2 ms to minimize.
[2025-06-01 00:35:04] [INFO ] Deduced a trap composed of 142 places in 102 ms of which 2 ms to minimize.
[2025-06-01 00:35:04] [INFO ] Deduced a trap composed of 142 places in 100 ms of which 2 ms to minimize.
[2025-06-01 00:35:04] [INFO ] Deduced a trap composed of 150 places in 100 ms of which 2 ms to minimize.
[2025-06-01 00:35:04] [INFO ] Deduced a trap composed of 135 places in 97 ms of which 2 ms to minimize.
[2025-06-01 00:35:05] [INFO ] Deduced a trap composed of 143 places in 96 ms of which 2 ms to minimize.
[2025-06-01 00:35:05] [INFO ] Deduced a trap composed of 137 places in 101 ms of which 2 ms to minimize.
[2025-06-01 00:35:05] [INFO ] Deduced a trap composed of 147 places in 107 ms of which 3 ms to minimize.
[2025-06-01 00:35:05] [INFO ] Deduced a trap composed of 155 places in 102 ms of which 2 ms to minimize.
[2025-06-01 00:35:05] [INFO ] Deduced a trap composed of 159 places in 104 ms of which 2 ms to minimize.
[2025-06-01 00:35:05] [INFO ] Deduced a trap composed of 140 places in 99 ms of which 2 ms to minimize.
[2025-06-01 00:35:05] [INFO ] Deduced a trap composed of 152 places in 101 ms of which 2 ms to minimize.
[2025-06-01 00:35:05] [INFO ] Deduced a trap composed of 148 places in 106 ms of which 2 ms to minimize.
[2025-06-01 00:35:06] [INFO ] Deduced a trap composed of 144 places in 105 ms of which 2 ms to minimize.
[2025-06-01 00:35:06] [INFO ] Deduced a trap composed of 150 places in 107 ms of which 3 ms to minimize.
[2025-06-01 00:35:06] [INFO ] Deduced a trap composed of 147 places in 106 ms of which 2 ms to minimize.
[2025-06-01 00:35:06] [INFO ] Deduced a trap composed of 145 places in 104 ms of which 2 ms to minimize.
[2025-06-01 00:35:06] [INFO ] Deduced a trap composed of 158 places in 103 ms of which 2 ms to minimize.
[2025-06-01 00:35:06] [INFO ] Deduced a trap composed of 166 places in 104 ms of which 3 ms to minimize.
[2025-06-01 00:35:06] [INFO ] Deduced a trap composed of 170 places in 111 ms of which 2 ms to minimize.
[2025-06-01 00:35:06] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 5002 ms
[2025-06-01 00:35:09] [INFO ] Deduced a trap composed of 160 places in 125 ms of which 2 ms to minimize.
[2025-06-01 00:35:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2025-06-01 00:35:10] [INFO ] Deduced a trap composed of 120 places in 100 ms of which 2 ms to minimize.
[2025-06-01 00:35:10] [INFO ] Deduced a trap composed of 127 places in 98 ms of which 2 ms to minimize.
[2025-06-01 00:35:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 297 ms
[2025-06-01 00:35:12] [INFO ] Deduced a trap composed of 119 places in 101 ms of which 2 ms to minimize.
[2025-06-01 00:35:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
[2025-06-01 00:35:15] [INFO ] Deduced a trap composed of 128 places in 91 ms of which 2 ms to minimize.
[2025-06-01 00:35:15] [INFO ] Deduced a trap composed of 134 places in 89 ms of which 1 ms to minimize.
[2025-06-01 00:35:15] [INFO ] Deduced a trap composed of 134 places in 90 ms of which 1 ms to minimize.
[2025-06-01 00:35:15] [INFO ] Deduced a trap composed of 120 places in 90 ms of which 1 ms to minimize.
[2025-06-01 00:35:15] [INFO ] Deduced a trap composed of 124 places in 95 ms of which 2 ms to minimize.
[2025-06-01 00:35:16] [INFO ] Deduced a trap composed of 122 places in 84 ms of which 1 ms to minimize.
[2025-06-01 00:35:16] [INFO ] Deduced a trap composed of 124 places in 92 ms of which 2 ms to minimize.
[2025-06-01 00:35:16] [INFO ] Deduced a trap composed of 132 places in 87 ms of which 2 ms to minimize.
[2025-06-01 00:35:17] [INFO ] Deduced a trap composed of 123 places in 86 ms of which 2 ms to minimize.
[2025-06-01 00:35:17] [INFO ] Deduced a trap composed of 124 places in 92 ms of which 2 ms to minimize.
[2025-06-01 00:35:17] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1986 ms
TRAPS : Iteration 5
[2025-06-01 00:35:51] [INFO ] Deduced a trap composed of 142 places in 117 ms of which 2 ms to minimize.
[2025-06-01 00:35:51] [INFO ] Deduced a trap composed of 143 places in 122 ms of which 2 ms to minimize.
[2025-06-01 00:35:51] [INFO ] Deduced a trap composed of 102 places in 119 ms of which 2 ms to minimize.
[2025-06-01 00:35:51] [INFO ] Deduced a trap composed of 174 places in 118 ms of which 3 ms to minimize.
[2025-06-01 00:35:52] [INFO ] Deduced a trap composed of 185 places in 136 ms of which 2 ms to minimize.
[2025-06-01 00:35:52] [INFO ] Deduced a trap composed of 103 places in 124 ms of which 2 ms to minimize.
[2025-06-01 00:35:52] [INFO ] Deduced a trap composed of 159 places in 128 ms of which 3 ms to minimize.
[2025-06-01 00:35:52] [INFO ] Deduced a trap composed of 178 places in 126 ms of which 3 ms to minimize.
[2025-06-01 00:35:52] [INFO ] Deduced a trap composed of 149 places in 127 ms of which 3 ms to minimize.
[2025-06-01 00:35:53] [INFO ] Deduced a trap composed of 160 places in 122 ms of which 3 ms to minimize.
[2025-06-01 00:35:53] [INFO ] Deduced a trap composed of 118 places in 129 ms of which 3 ms to minimize.
[2025-06-01 00:35:54] [INFO ] Deduced a trap composed of 169 places in 121 ms of which 2 ms to minimize.
[2025-06-01 00:35:54] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3614 ms
[2025-06-01 00:35:58] [INFO ] Deduced a trap composed of 155 places in 131 ms of which 2 ms to minimize.
[2025-06-01 00:35:58] [INFO ] Deduced a trap composed of 102 places in 127 ms of which 2 ms to minimize.
[2025-06-01 00:35:58] [INFO ] Deduced a trap composed of 152 places in 131 ms of which 3 ms to minimize.
[2025-06-01 00:35:58] [INFO ] Deduced a trap composed of 172 places in 130 ms of which 3 ms to minimize.
[2025-06-01 00:35:58] [INFO ] Deduced a trap composed of 166 places in 128 ms of which 3 ms to minimize.
[2025-06-01 00:35:58] [INFO ] Deduced a trap composed of 172 places in 121 ms of which 3 ms to minimize.
[2025-06-01 00:35:59] [INFO ] Deduced a trap composed of 180 places in 119 ms of which 2 ms to minimize.
[2025-06-01 00:35:59] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1139 ms
[2025-06-01 00:36:01] [INFO ] Deduced a trap composed of 167 places in 117 ms of which 3 ms to minimize.
[2025-06-01 00:36:01] [INFO ] Deduced a trap composed of 167 places in 120 ms of which 3 ms to minimize.
[2025-06-01 00:36:01] [INFO ] Deduced a trap composed of 155 places in 125 ms of which 2 ms to minimize.
[2025-06-01 00:36:01] [INFO ] Deduced a trap composed of 163 places in 128 ms of which 2 ms to minimize.
[2025-06-01 00:36:01] [INFO ] Deduced a trap composed of 138 places in 122 ms of which 3 ms to minimize.
[2025-06-01 00:36:01] [INFO ] Deduced a trap composed of 190 places in 130 ms of which 2 ms to minimize.
[2025-06-01 00:36:01] [INFO ] Deduced a trap composed of 187 places in 122 ms of which 2 ms to minimize.
[2025-06-01 00:36:02] [INFO ] Deduced a trap composed of 177 places in 126 ms of which 3 ms to minimize.
[2025-06-01 00:36:02] [INFO ] Deduced a trap composed of 180 places in 129 ms of which 3 ms to minimize.
[2025-06-01 00:36:02] [INFO ] Deduced a trap composed of 143 places in 125 ms of which 2 ms to minimize.
[2025-06-01 00:36:02] [INFO ] Deduced a trap composed of 157 places in 124 ms of which 3 ms to minimize.
[2025-06-01 00:36:03] [INFO ] Deduced a trap composed of 195 places in 124 ms of which 3 ms to minimize.
[2025-06-01 00:36:03] [INFO ] Deduced a trap composed of 139 places in 136 ms of which 2 ms to minimize.
[2025-06-01 00:36:03] [INFO ] Deduced a trap composed of 177 places in 115 ms of which 2 ms to minimize.
[2025-06-01 00:36:03] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2871 ms
[2025-06-01 00:36:05] [INFO ] Deduced a trap composed of 190 places in 116 ms of which 2 ms to minimize.
[2025-06-01 00:36:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 167 ms
TRAPS : Iteration 6
[2025-06-01 00:36:09] [INFO ] Deduced a trap composed of 119 places in 131 ms of which 3 ms to minimize.
[2025-06-01 00:36:10] [INFO ] Deduced a trap composed of 131 places in 130 ms of which 3 ms to minimize.
[2025-06-01 00:36:10] [INFO ] Deduced a trap composed of 137 places in 126 ms of which 2 ms to minimize.
[2025-06-01 00:36:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 539 ms
[2025-06-01 00:36:10] [INFO ] Deduced a trap composed of 140 places in 100 ms of which 2 ms to minimize.
[2025-06-01 00:36:10] [INFO ] Deduced a trap composed of 145 places in 92 ms of which 2 ms to minimize.
[2025-06-01 00:36:10] [INFO ] Deduced a trap composed of 139 places in 91 ms of which 2 ms to minimize.
[2025-06-01 00:36:11] [INFO ] Deduced a trap composed of 136 places in 92 ms of which 2 ms to minimize.
[2025-06-01 00:36:11] [INFO ] Deduced a trap composed of 131 places in 100 ms of which 2 ms to minimize.
[2025-06-01 00:36:11] [INFO ] Deduced a trap composed of 147 places in 95 ms of which 2 ms to minimize.
[2025-06-01 00:36:11] [INFO ] Deduced a trap composed of 129 places in 98 ms of which 2 ms to minimize.
[2025-06-01 00:36:11] [INFO ] Deduced a trap composed of 134 places in 99 ms of which 2 ms to minimize.
[2025-06-01 00:36:11] [INFO ] Deduced a trap composed of 127 places in 103 ms of which 2 ms to minimize.
[2025-06-01 00:36:11] [INFO ] Deduced a trap composed of 129 places in 99 ms of which 1 ms to minimize.
[2025-06-01 00:36:11] [INFO ] Deduced a trap composed of 132 places in 99 ms of which 2 ms to minimize.
[2025-06-01 00:36:12] [INFO ] Deduced a trap composed of 125 places in 100 ms of which 2 ms to minimize.
[2025-06-01 00:36:12] [INFO ] Deduced a trap composed of 130 places in 105 ms of which 2 ms to minimize.
[2025-06-01 00:36:12] [INFO ] Deduced a trap composed of 124 places in 102 ms of which 2 ms to minimize.
[2025-06-01 00:36:12] [INFO ] Deduced a trap composed of 130 places in 98 ms of which 2 ms to minimize.
[2025-06-01 00:36:12] [INFO ] Deduced a trap composed of 133 places in 91 ms of which 2 ms to minimize.
[2025-06-01 00:36:12] [INFO ] Deduced a trap composed of 141 places in 95 ms of which 2 ms to minimize.
[2025-06-01 00:36:12] [INFO ] Deduced a trap composed of 132 places in 92 ms of which 2 ms to minimize.
[2025-06-01 00:36:12] [INFO ] Deduced a trap composed of 130 places in 95 ms of which 2 ms to minimize.
[2025-06-01 00:36:13] [INFO ] Deduced a trap composed of 141 places in 98 ms of which 2 ms to minimize.
[2025-06-01 00:36:13] [INFO ] Deduced a trap composed of 129 places in 92 ms of which 2 ms to minimize.
[2025-06-01 00:36:13] [INFO ] Deduced a trap composed of 147 places in 100 ms of which 2 ms to minimize.
[2025-06-01 00:36:13] [INFO ] Deduced a trap composed of 144 places in 97 ms of which 2 ms to minimize.
[2025-06-01 00:36:13] [INFO ] Deduced a trap composed of 125 places in 87 ms of which 2 ms to minimize.
[2025-06-01 00:36:13] [INFO ] Deduced a trap composed of 143 places in 93 ms of which 2 ms to minimize.
[2025-06-01 00:36:13] [INFO ] Deduced a trap composed of 139 places in 90 ms of which 2 ms to minimize.
[2025-06-01 00:36:13] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 3307 ms
[2025-06-01 00:36:21] [INFO ] Deduced a trap composed of 167 places in 130 ms of which 2 ms to minimize.
[2025-06-01 00:36:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
TRAPS : Iteration 7
[2025-06-01 00:36:23] [INFO ] After 198518ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :334 real:1
[2025-06-01 00:36:23] [INFO ] After 200023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :334 real:1
RANDOM walk for 40000 steps (5820 resets) in 108 ms. (366 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3663 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 467382 steps, run timeout after 3001 ms. (steps per millisecond=155 ) properties seen :0 out of 1
Probabilistic random walk after 467382 steps, saw 233933 distinct states, run finished after 3001 ms. (steps per millisecond=155 ) properties seen :0
[2025-06-01 00:36:26] [INFO ] Invariant cache hit.
[2025-06-01 00:36:26] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 319/320 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/320 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 95/415 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/415 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 396/811 variables, 415/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/811 variables, 12/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/811 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/815 variables, 4/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/815 variables, 2/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/815 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/815 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 815/815 variables, and 479 constraints, problems are : Problem set: 0 solved, 1 unsolved in 314 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 419/419 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 319/320 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:36:27] [INFO ] Deduced a trap composed of 3 places in 99 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/320 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/320 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 95/415 variables, 41/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:36:27] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 3 ms to minimize.
[2025-06-01 00:36:27] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 3 ms to minimize.
[2025-06-01 00:36:27] [INFO ] Deduced a trap composed of 8 places in 122 ms of which 3 ms to minimize.
[2025-06-01 00:36:27] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 3 ms to minimize.
[2025-06-01 00:36:27] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 2 ms to minimize.
[2025-06-01 00:36:27] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 2 ms to minimize.
[2025-06-01 00:36:28] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/415 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/415 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 396/811 variables, 415/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/811 variables, 12/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/811 variables, 1/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/811 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/815 variables, 4/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/815 variables, 2/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/815 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/815 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 815/815 variables, and 488 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1426 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 419/419 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 1747ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 92 ms.
Support contains 1 out of 419 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 396/396 transitions.
Graph (complete) has 893 edges and 419 vertex of which 413 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 81 rules applied. Total rules applied 82 place count 412 transition count 316
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 160 place count 334 transition count 316
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 160 place count 334 transition count 303
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 186 place count 321 transition count 303
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 298 place count 265 transition count 247
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 320 place count 254 transition count 247
Free-agglomeration rule (complex) applied 27 times.
Iterating global reduction 2 with 27 rules applied. Total rules applied 347 place count 254 transition count 220
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 2 with 27 rules applied. Total rules applied 374 place count 227 transition count 220
Partial Free-agglomeration rule applied 26 times.
Drop transitions (Partial Free agglomeration) removed 26 transitions
Iterating global reduction 3 with 26 rules applied. Total rules applied 400 place count 227 transition count 220
Applied a total of 400 rules in 54 ms. Remains 227 /419 variables (removed 192) and now considering 220/396 (removed 176) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 227/419 places, 220/396 transitions.
RANDOM walk for 40000 steps (5747 resets) in 134 ms. (296 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3643 resets) in 82 ms. (481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 616584 steps, run timeout after 3001 ms. (steps per millisecond=205 ) properties seen :0 out of 1
Probabilistic random walk after 616584 steps, saw 308610 distinct states, run finished after 3001 ms. (steps per millisecond=205 ) properties seen :0
// Phase 1: matrix 220 rows 227 cols
[2025-06-01 00:36:31] [INFO ] Computed 44 invariants in 23 ms
[2025-06-01 00:36:31] [INFO ] State equation strengthened by 38 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 148/149 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 74/223 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 220/443 variables, 223/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 38/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/447 variables, 4/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 2/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/447 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/447 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 447/447 variables, and 309 constraints, problems are : Problem set: 0 solved, 1 unsolved in 214 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: 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) 148/149 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 74/223 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 00:36:31] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 1 ms to minimize.
[2025-06-01 00:36:32] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 2 ms to minimize.
[2025-06-01 00:36:32] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 1 ms to minimize.
[2025-06-01 00:36:32] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 1 ms to minimize.
[2025-06-01 00:36:32] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
[2025-06-01 00:36:32] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 6/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 220/443 variables, 223/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 38/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/443 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/447 variables, 4/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/447 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/447 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/447 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 447/447 variables, and 316 constraints, problems are : Problem set: 0 solved, 1 unsolved in 820 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: 6/6 constraints]
After SMT, in 1062ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 75 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 5 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 5 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.
[2025-06-01 00:36:32] [INFO ] Invariant cache hit.
[2025-06-01 00:36:32] [INFO ] Implicit Places using invariants in 251 ms returned [44, 49, 70, 75, 95, 101, 122, 127, 147, 152, 173, 179, 193, 198]
[2025-06-01 00:36:32] [INFO ] Actually due to overlaps returned [49, 44]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 252 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 225/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 225 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 224 transition count 219
Applied a total of 2 rules in 11 ms. Remains 224 /225 variables (removed 1) and now considering 219/220 (removed 1) transitions.
// Phase 1: matrix 219 rows 224 cols
[2025-06-01 00:36:33] [INFO ] Computed 42 invariants in 16 ms
[2025-06-01 00:36:33] [INFO ] Implicit Places using invariants in 240 ms returned [67, 72, 92, 98, 119, 124, 144, 149, 170, 176, 190, 195]
[2025-06-01 00:36:33] [INFO ] Actually due to overlaps returned [72, 67]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 241 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 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 9 ms. Remains 221 /222 variables (removed 1) and now considering 218/219 (removed 1) transitions.
// Phase 1: matrix 218 rows 221 cols
[2025-06-01 00:36:33] [INFO ] Computed 40 invariants in 11 ms
[2025-06-01 00:36:33] [INFO ] Implicit Places using invariants in 200 ms returned [89, 95, 116, 121, 141, 146, 167, 173, 187, 192]
[2025-06-01 00:36:33] [INFO ] Actually due to overlaps returned [95, 89]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 202 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 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 9 ms. Remains 218 /219 variables (removed 1) and now considering 217/218 (removed 1) transitions.
// Phase 1: matrix 217 rows 218 cols
[2025-06-01 00:36:33] [INFO ] Computed 38 invariants in 13 ms
[2025-06-01 00:36:33] [INFO ] Implicit Places using invariants in 193 ms returned [113, 118, 138, 143, 164, 170, 184, 189]
[2025-06-01 00:36:33] [INFO ] Actually due to overlaps returned [118, 113]
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 4 : 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 9 ms. Remains 215 /216 variables (removed 1) and now considering 216/217 (removed 1) transitions.
// Phase 1: matrix 216 rows 215 cols
[2025-06-01 00:36:33] [INFO ] Computed 36 invariants in 14 ms
[2025-06-01 00:36:33] [INFO ] Implicit Places using invariants in 184 ms returned [135, 140, 161, 167, 181, 186]
[2025-06-01 00:36:33] [INFO ] Actually due to overlaps returned [140, 135]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 186 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 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 8 ms. Remains 212 /213 variables (removed 1) and now considering 215/216 (removed 1) transitions.
// Phase 1: matrix 215 rows 212 cols
[2025-06-01 00:36:33] [INFO ] Computed 34 invariants in 15 ms
[2025-06-01 00:36:34] [INFO ] Implicit Places using invariants in 177 ms returned [158, 164, 178, 183]
[2025-06-01 00:36:34] [INFO ] Actually due to overlaps returned [158, 164]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 179 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 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 8 ms. Remains 209 /210 variables (removed 1) and now considering 214/215 (removed 1) transitions.
// Phase 1: matrix 214 rows 209 cols
[2025-06-01 00:36:34] [INFO ] Computed 32 invariants in 12 ms
[2025-06-01 00:36:34] [INFO ] Implicit Places using invariants in 165 ms returned [175, 180]
[2025-06-01 00:36:34] [INFO ] Actually due to overlaps returned [175]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 166 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 208/227 places, 214/220 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 207 transition count 213
Applied a total of 2 rules in 16 ms. Remains 207 /208 variables (removed 1) and now considering 213/214 (removed 1) transitions.
// Phase 1: matrix 213 rows 207 cols
[2025-06-01 00:36:34] [INFO ] Computed 31 invariants in 13 ms
[2025-06-01 00:36:34] [INFO ] Implicit Places using invariants in 166 ms returned []
[2025-06-01 00:36:34] [INFO ] Invariant cache hit.
[2025-06-01 00:36:34] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-06-01 00:36:35] [INFO ] Implicit Places using invariants and state equation in 1405 ms returned []
Implicit Place search using SMT with State Equation took 1573 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 207/227 places, 213/220 transitions.
Finished structural reductions in REACHABILITY mode , in 8 iterations and 3070 ms. Remains : 207/227 places, 213/220 transitions.
RANDOM walk for 40000 steps (5827 resets) in 108 ms. (366 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3647 resets) in 65 ms. (606 steps per ms) remains 1/1 properties

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ 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 StableMarking -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="StableMarking"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool gold2024"
echo " Input is DoubleExponent-PT-010, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r084-tall-174860080400308"
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 [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;