MCC'2024- Execution of r466-smll-171620124700227

About the Execution of LTSMin+red for Anderson-PT-10

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
3654.779	1448455.00	3023774.00	2709.70	T	normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 8.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 15:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 12 15:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 15:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 12 15:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.3M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1717201577932

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Anderson-PT-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:26:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-06-01 00:26:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:26:21] [INFO ] Load time of PNML (sax parser for PT used): 463 ms
[2024-06-01 00:26:21] [INFO ] Transformed 621 places.
[2024-06-01 00:26:21] [INFO ] Transformed 2480 transitions.
[2024-06-01 00:26:21] [INFO ] Found NUPN structural information;
[2024-06-01 00:26:21] [INFO ] Parsed PT model containing 621 places and 2480 transitions and 9560 arcs in 845 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 621/621 places, 2480/2480 transitions.
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 90 Pre rules applied. Total rules applied 0 place count 621 transition count 2390
Deduced a syphon composed of 90 places in 33 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 0 with 180 rules applied. Total rules applied 180 place count 531 transition count 2390
Applied a total of 180 rules in 212 ms. Remains 531 /621 variables (removed 90) and now considering 2390/2480 (removed 90) transitions.
// Phase 1: matrix 2390 rows 531 cols
[2024-06-01 00:26:21] [INFO ] Computed 23 invariants in 121 ms
[2024-06-01 00:26:25] [INFO ] Implicit Places using invariants in 3990 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 4061 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 530/621 places, 2390/2480 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 530 transition count 2290
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 200 place count 430 transition count 2290
Applied a total of 200 rules in 31 ms. Remains 430 /530 variables (removed 100) and now considering 2290/2390 (removed 100) transitions.
// Phase 1: matrix 2290 rows 430 cols
[2024-06-01 00:26:25] [INFO ] Computed 22 invariants in 36 ms
[2024-06-01 00:26:27] [INFO ] Implicit Places using invariants in 1763 ms returned []
[2024-06-01 00:26:27] [INFO ] Invariant cache hit.
[2024-06-01 00:26:28] [INFO ] State equation strengthened by 170 read => feed constraints.
[2024-06-01 00:26:34] [INFO ] Implicit Places using invariants and state equation in 6615 ms returned []
Implicit Place search using SMT with State Equation took 8387 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 430/621 places, 2290/2480 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 12752 ms. Remains : 430/621 places, 2290/2480 transitions.
Initial state reduction rules removed 10 formulas.
RANDOM walk for 40000 steps (8 resets) in 7542 ms. (5 steps per ms) remains 1245/2280 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1245/1245 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1245/1245 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1245/1245 properties
BEST_FIRST walk for 124 steps (8 resets) in 15 ms. (7 steps per ms) remains 1245/1245 properties
BEST_FIRST walk for 124 steps (8 resets) in 27 ms. (4 steps per ms) remains 1245/1245 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1245/1245 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1245/1245 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1245/1245 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1245/1245 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1245/1245 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1245/1245 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1245/1245 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1245/1245 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1245/1245 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1245/1245 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 1245/1245 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1245/1245 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1245/1245 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1245/1245 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1245/1245 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1245/1245 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1245/1245 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1245/1245 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1245/1245 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1245/1245 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1245/1245 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1245/1245 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 1245/1245 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1245/1245 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1245/1245 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1245/1245 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1245/1245 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1245/1245 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1245/1245 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1245/1245 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1245/1245 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1245/1245 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1245/1245 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1245/1245 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1245/1245 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1245/1245 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1245/1245 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1245/1245 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1245/1245 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1245/1245 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1245/1245 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1245/1245 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1245/1245 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1245/1245 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1245/1245 properties
[2024-06-01 00:26:36] [INFO ] Invariant cache hit.
[2024-06-01 00:26:36] [INFO ] State equation strengthened by 170 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 195/195 constraints. Problems are: Problem set: 0 solved, 1245 unsolved
SMT process timed out in 10900ms, After SMT, problems are : Problem set: 0 solved, 1245 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 195 out of 430 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 430/430 places, 2290/2290 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 398 transition count 2258
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 398 transition count 2258
Applied a total of 64 rules in 436 ms. Remains 398 /430 variables (removed 32) and now considering 2258/2290 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 437 ms. Remains : 398/430 places, 2258/2290 transitions.
RANDOM walk for 1581085 steps (4 resets) in 120004 ms. (13 steps per ms) remains 640/1245 properties
BEST_FIRST walk for 4003 steps (8 resets) in 85 ms. (46 steps per ms) remains 640/640 properties
BEST_FIRST walk for 4003 steps (8 resets) in 68 ms. (58 steps per ms) remains 639/640 properties
BEST_FIRST walk for 4002 steps (8 resets) in 97 ms. (40 steps per ms) remains 633/639 properties
BEST_FIRST walk for 4004 steps (8 resets) in 102 ms. (38 steps per ms) remains 633/633 properties
BEST_FIRST walk for 4003 steps (8 resets) in 88 ms. (44 steps per ms) remains 625/633 properties
BEST_FIRST walk for 4002 steps (8 resets) in 69 ms. (57 steps per ms) remains 624/625 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 624/624 properties
BEST_FIRST walk for 4002 steps (8 resets) in 65 ms. (60 steps per ms) remains 622/624 properties
BEST_FIRST walk for 4002 steps (8 resets) in 67 ms. (58 steps per ms) remains 622/622 properties
BEST_FIRST walk for 4001 steps (8 resets) in 65 ms. (60 steps per ms) remains 622/622 properties
BEST_FIRST walk for 4003 steps (8 resets) in 67 ms. (58 steps per ms) remains 621/622 properties
BEST_FIRST walk for 4002 steps (8 resets) in 70 ms. (56 steps per ms) remains 621/621 properties
BEST_FIRST walk for 4002 steps (8 resets) in 101 ms. (39 steps per ms) remains 621/621 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 621/621 properties
BEST_FIRST walk for 4002 steps (8 resets) in 85 ms. (46 steps per ms) remains 621/621 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 515/621 properties
BEST_FIRST walk for 4002 steps (8 resets) in 74 ms. (53 steps per ms) remains 515/515 properties
BEST_FIRST walk for 4002 steps (8 resets) in 71 ms. (55 steps per ms) remains 515/515 properties
BEST_FIRST walk for 4003 steps (8 resets) in 73 ms. (54 steps per ms) remains 515/515 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 492/515 properties
BEST_FIRST walk for 4002 steps (8 resets) in 75 ms. (52 steps per ms) remains 490/492 properties
BEST_FIRST walk for 4003 steps (8 resets) in 67 ms. (58 steps per ms) remains 489/490 properties
BEST_FIRST walk for 4003 steps (8 resets) in 67 ms. (58 steps per ms) remains 488/489 properties
BEST_FIRST walk for 4003 steps (8 resets) in 64 ms. (61 steps per ms) remains 488/488 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 462/488 properties
BEST_FIRST walk for 4002 steps (8 resets) in 64 ms. (61 steps per ms) remains 451/462 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 450/451 properties
BEST_FIRST walk for 4001 steps (8 resets) in 64 ms. (61 steps per ms) remains 450/450 properties
BEST_FIRST walk for 4002 steps (8 resets) in 78 ms. (50 steps per ms) remains 450/450 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 450/450 properties
BEST_FIRST walk for 4002 steps (8 resets) in 48 ms. (81 steps per ms) remains 414/450 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 393/414 properties
BEST_FIRST walk for 4001 steps (8 resets) in 41 ms. (95 steps per ms) remains 393/393 properties
BEST_FIRST walk for 4000 steps (8 resets) in 44 ms. (88 steps per ms) remains 393/393 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 393/393 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 393/393 properties
BEST_FIRST walk for 4002 steps (8 resets) in 54 ms. (72 steps per ms) remains 393/393 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 391/393 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 391/391 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 391/391 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 391/391 properties
BEST_FIRST walk for 4001 steps (8 resets) in 44 ms. (88 steps per ms) remains 391/391 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 380/391 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 380/380 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 379/380 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 379/379 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 379/379 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 378/379 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 378/378 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 378/378 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 378/378 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 376/378 properties
BEST_FIRST walk for 4002 steps (8 resets) in 49 ms. (80 steps per ms) remains 376/376 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 338/376 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 338/338 properties
BEST_FIRST walk for 4001 steps (8 resets) in 39 ms. (100 steps per ms) remains 338/338 properties
BEST_FIRST walk for 4001 steps (8 resets) in 38 ms. (102 steps per ms) remains 338/338 properties
BEST_FIRST walk for 4001 steps (8 resets) in 38 ms. (102 steps per ms) remains 338/338 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 338/338 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 338/338 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 338/338 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 338/338 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 338/338 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 338/338 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 338/338 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 338/338 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 338/338 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 338/338 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 338/338 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 338/338 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 333/338 properties
BEST_FIRST walk for 4001 steps (8 resets) in 37 ms. (105 steps per ms) remains 333/333 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 333/333 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 333/333 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 333/333 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 333/333 properties
BEST_FIRST walk for 4001 steps (8 resets) in 45 ms. (86 steps per ms) remains 333/333 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 333/333 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 333/333 properties
BEST_FIRST walk for 4001 steps (8 resets) in 37 ms. (105 steps per ms) remains 333/333 properties
BEST_FIRST walk for 4001 steps (8 resets) in 50 ms. (78 steps per ms) remains 333/333 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 327/333 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 327/327 properties
BEST_FIRST walk for 4001 steps (8 resets) in 37 ms. (105 steps per ms) remains 327/327 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 327/327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 327/327 properties
BEST_FIRST walk for 4002 steps (8 resets) in 44 ms. (88 steps per ms) remains 327/327 properties
BEST_FIRST walk for 4001 steps (8 resets) in 38 ms. (102 steps per ms) remains 327/327 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 327/327 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 319/327 properties
BEST_FIRST walk for 4002 steps (8 resets) in 46 ms. (85 steps per ms) remains 319/319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 319/319 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 319/319 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 319/319 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 315/319 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 315/315 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 315/315 properties
BEST_FIRST walk for 4001 steps (8 resets) in 37 ms. (105 steps per ms) remains 315/315 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 315/315 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 315/315 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 303/315 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 303/303 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 303/303 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 303/303 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 303/303 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 279/303 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 278/279 properties
BEST_FIRST walk for 4001 steps (8 resets) in 33 ms. (117 steps per ms) remains 278/278 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 278/278 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 278/278 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 278/278 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 277/278 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 277/277 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 277/277 properties
BEST_FIRST walk for 4000 steps (8 resets) in 42 ms. (93 steps per ms) remains 275/277 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 275/275 properties
BEST_FIRST walk for 4003 steps (8 resets) in 51 ms. (76 steps per ms) remains 273/275 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 273/273 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 273/273 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 273/273 properties
BEST_FIRST walk for 4001 steps (8 resets) in 42 ms. (93 steps per ms) remains 273/273 properties
BEST_FIRST walk for 4001 steps (8 resets) in 33 ms. (117 steps per ms) remains 272/273 properties
BEST_FIRST walk for 4001 steps (8 resets) in 34 ms. (114 steps per ms) remains 272/272 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 272/272 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 272/272 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 272/272 properties
BEST_FIRST walk for 4001 steps (8 resets) in 32 ms. (121 steps per ms) remains 268/272 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 265/268 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 264/265 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 264/264 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 264/264 properties
BEST_FIRST walk for 4001 steps (8 resets) in 40 ms. (97 steps per ms) remains 264/264 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 264/264 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 264/264 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 264/264 properties
BEST_FIRST walk for 4001 steps (8 resets) in 41 ms. (95 steps per ms) remains 264/264 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 264/264 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 264/264 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 264/264 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 264/264 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 264/264 properties
BEST_FIRST walk for 4001 steps (8 resets) in 39 ms. (100 steps per ms) remains 264/264 properties
BEST_FIRST walk for 4001 steps (8 resets) in 41 ms. (95 steps per ms) remains 264/264 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 264/264 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 264/264 properties
BEST_FIRST walk for 4001 steps (8 resets) in 40 ms. (97 steps per ms) remains 264/264 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 264/264 properties
BEST_FIRST walk for 4001 steps (8 resets) in 37 ms. (105 steps per ms) remains 264/264 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 264/264 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 264/264 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 264/264 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 264/264 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 261/264 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 261/261 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 261/261 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 261/261 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 261/261 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 261/261 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 261/261 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 260/261 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 260/260 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 260/260 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 260/260 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 260/260 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 260/260 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 260/260 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 260/260 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 260/260 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 260/260 properties
BEST_FIRST walk for 4002 steps (8 resets) in 48 ms. (81 steps per ms) remains 260/260 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 260/260 properties
BEST_FIRST walk for 4003 steps (8 resets) in 51 ms. (76 steps per ms) remains 259/260 properties
BEST_FIRST walk for 4002 steps (8 resets) in 46 ms. (85 steps per ms) remains 259/259 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 259/259 properties
BEST_FIRST walk for 4001 steps (8 resets) in 48 ms. (81 steps per ms) remains 259/259 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 259/259 properties
BEST_FIRST walk for 4002 steps (8 resets) in 44 ms. (88 steps per ms) remains 259/259 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 259/259 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 259/259 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 257/259 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 253/257 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 253/253 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 253/253 properties
BEST_FIRST walk for 4001 steps (8 resets) in 46 ms. (85 steps per ms) remains 253/253 properties
BEST_FIRST walk for 4002 steps (8 resets) in 46 ms. (85 steps per ms) remains 253/253 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 253/253 properties
BEST_FIRST walk for 4002 steps (8 resets) in 46 ms. (85 steps per ms) remains 253/253 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 253/253 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 253/253 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 253/253 properties
BEST_FIRST walk for 4002 steps (8 resets) in 46 ms. (85 steps per ms) remains 253/253 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 253/253 properties
BEST_FIRST walk for 4002 steps (8 resets) in 51 ms. (76 steps per ms) remains 253/253 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 253/253 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 253/253 properties
BEST_FIRST walk for 4003 steps (8 resets) in 49 ms. (80 steps per ms) remains 253/253 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 253/253 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 253/253 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 245/253 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 245/245 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 245/245 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 245/245 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 245/245 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 245/245 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 245/245 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 245/245 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 245/245 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 245/245 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 245/245 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 245/245 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 245/245 properties
BEST_FIRST walk for 4001 steps (8 resets) in 40 ms. (97 steps per ms) remains 245/245 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 245/245 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 245/245 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 245/245 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 220/245 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 220/220 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 220/220 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 220/220 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 220/220 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 220/220 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 220/220 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 220/220 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 218/220 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 218/218 properties
BEST_FIRST walk for 4000 steps (8 resets) in 44 ms. (88 steps per ms) remains 218/218 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 218/218 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 218/218 properties
BEST_FIRST walk for 4001 steps (8 resets) in 40 ms. (97 steps per ms) remains 218/218 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 218/218 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 218/218 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 218/218 properties
BEST_FIRST walk for 4001 steps (8 resets) in 39 ms. (100 steps per ms) remains 218/218 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 218/218 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 218/218 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 218/218 properties
BEST_FIRST walk for 4001 steps (8 resets) in 38 ms. (102 steps per ms) remains 218/218 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 218/218 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 218/218 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 218/218 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 218/218 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 218/218 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 218/218 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 218/218 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 218/218 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 218/218 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 218/218 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 218/218 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 218/218 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 218/218 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 218/218 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 218/218 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 218/218 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 218/218 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 218/218 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 218/218 properties
BEST_FIRST walk for 4003 steps (8 resets) in 56 ms. (70 steps per ms) remains 217/218 properties
BEST_FIRST walk for 4001 steps (8 resets) in 41 ms. (95 steps per ms) remains 217/217 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 217/217 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 217/217 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 217/217 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 217/217 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 214/217 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 204/214 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 204/204 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 204/204 properties
BEST_FIRST walk for 4001 steps (8 resets) in 38 ms. (102 steps per ms) remains 204/204 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 204/204 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 204/204 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 204/204 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 204/204 properties
// Phase 1: matrix 2258 rows 398 cols
[2024-06-01 00:27:21] [INFO ] Computed 22 invariants in 26 ms
[2024-06-01 00:27:21] [INFO ] State equation strengthened by 148 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (OVERLAPS) 290/385 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-06-01 00:27:27] [INFO ] Deduced a trap composed of 296 places in 636 ms of which 68 ms to minimize.
[2024-06-01 00:27:27] [INFO ] Deduced a trap composed of 312 places in 548 ms of which 5 ms to minimize.
[2024-06-01 00:27:28] [INFO ] Deduced a trap composed of 276 places in 465 ms of which 6 ms to minimize.
[2024-06-01 00:27:28] [INFO ] Deduced a trap composed of 258 places in 594 ms of which 7 ms to minimize.
[2024-06-01 00:27:29] [INFO ] Deduced a trap composed of 239 places in 381 ms of which 4 ms to minimize.
[2024-06-01 00:27:29] [INFO ] Deduced a trap composed of 258 places in 419 ms of which 3 ms to minimize.
[2024-06-01 00:27:30] [INFO ] Deduced a trap composed of 295 places in 354 ms of which 6 ms to minimize.
[2024-06-01 00:27:30] [INFO ] Deduced a trap composed of 312 places in 579 ms of which 5 ms to minimize.
[2024-06-01 00:27:31] [INFO ] Deduced a trap composed of 256 places in 573 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/385 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-06-01 00:27:36] [INFO ] Deduced a trap composed of 296 places in 657 ms of which 7 ms to minimize.
[2024-06-01 00:27:36] [INFO ] Deduced a trap composed of 294 places in 593 ms of which 6 ms to minimize.
[2024-06-01 00:27:37] [INFO ] Deduced a trap composed of 293 places in 631 ms of which 6 ms to minimize.
[2024-06-01 00:27:38] [INFO ] Deduced a trap composed of 273 places in 563 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/385 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-06-01 00:27:41] [INFO ] Deduced a trap composed of 255 places in 653 ms of which 6 ms to minimize.
[2024-06-01 00:27:42] [INFO ] Deduced a trap composed of 276 places in 674 ms of which 7 ms to minimize.
[2024-06-01 00:27:43] [INFO ] Deduced a trap composed of 292 places in 616 ms of which 6 ms to minimize.
[2024-06-01 00:27:43] [INFO ] Deduced a trap composed of 294 places in 653 ms of which 7 ms to minimize.
[2024-06-01 00:27:44] [INFO ] Deduced a trap composed of 277 places in 639 ms of which 6 ms to minimize.
[2024-06-01 00:27:45] [INFO ] Deduced a trap composed of 255 places in 551 ms of which 6 ms to minimize.
[2024-06-01 00:27:45] [INFO ] Deduced a trap composed of 297 places in 679 ms of which 6 ms to minimize.
[2024-06-01 00:27:46] [INFO ] Deduced a trap composed of 298 places in 680 ms of which 6 ms to minimize.
[2024-06-01 00:27:47] [INFO ] Deduced a trap composed of 269 places in 620 ms of which 6 ms to minimize.
[2024-06-01 00:27:47] [INFO ] Deduced a trap composed of 276 places in 676 ms of which 7 ms to minimize.
[2024-06-01 00:27:48] [INFO ] Deduced a trap composed of 293 places in 679 ms of which 7 ms to minimize.
[2024-06-01 00:27:49] [INFO ] Deduced a trap composed of 299 places in 582 ms of which 6 ms to minimize.
[2024-06-01 00:27:49] [INFO ] Deduced a trap composed of 275 places in 667 ms of which 6 ms to minimize.
[2024-06-01 00:27:50] [INFO ] Deduced a trap composed of 293 places in 558 ms of which 6 ms to minimize.
[2024-06-01 00:27:51] [INFO ] Deduced a trap composed of 294 places in 640 ms of which 6 ms to minimize.
[2024-06-01 00:27:51] [INFO ] Deduced a trap composed of 295 places in 664 ms of which 6 ms to minimize.
[2024-06-01 00:27:52] [INFO ] Deduced a trap composed of 277 places in 633 ms of which 6 ms to minimize.
[2024-06-01 00:27:53] [INFO ] Deduced a trap composed of 297 places in 661 ms of which 6 ms to minimize.
[2024-06-01 00:27:53] [INFO ] Deduced a trap composed of 274 places in 675 ms of which 6 ms to minimize.
[2024-06-01 00:27:54] [INFO ] Deduced a trap composed of 303 places in 547 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/385 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-06-01 00:27:55] [INFO ] Deduced a trap composed of 220 places in 682 ms of which 6 ms to minimize.
[2024-06-01 00:27:56] [INFO ] Deduced a trap composed of 235 places in 612 ms of which 6 ms to minimize.
[2024-06-01 00:27:56] [INFO ] Deduced a trap composed of 273 places in 666 ms of which 6 ms to minimize.
[2024-06-01 00:27:57] [INFO ] Deduced a trap composed of 273 places in 625 ms of which 6 ms to minimize.
[2024-06-01 00:27:58] [INFO ] Deduced a trap composed of 219 places in 564 ms of which 6 ms to minimize.
[2024-06-01 00:27:58] [INFO ] Deduced a trap composed of 256 places in 634 ms of which 7 ms to minimize.
[2024-06-01 00:27:59] [INFO ] Deduced a trap composed of 269 places in 626 ms of which 7 ms to minimize.
[2024-06-01 00:28:00] [INFO ] Deduced a trap composed of 269 places in 671 ms of which 6 ms to minimize.
[2024-06-01 00:28:00] [INFO ] Deduced a trap composed of 268 places in 656 ms of which 6 ms to minimize.
[2024-06-01 00:28:01] [INFO ] Deduced a trap composed of 269 places in 620 ms of which 6 ms to minimize.
[2024-06-01 00:28:02] [INFO ] Deduced a trap composed of 239 places in 620 ms of which 6 ms to minimize.
[2024-06-01 00:28:03] [INFO ] Deduced a trap composed of 285 places in 662 ms of which 6 ms to minimize.
[2024-06-01 00:28:03] [INFO ] Deduced a trap composed of 282 places in 622 ms of which 6 ms to minimize.
[2024-06-01 00:28:04] [INFO ] Deduced a trap composed of 286 places in 601 ms of which 6 ms to minimize.
[2024-06-01 00:28:04] [INFO ] Deduced a trap composed of 263 places in 602 ms of which 6 ms to minimize.
[2024-06-01 00:28:05] [INFO ] Deduced a trap composed of 279 places in 620 ms of which 7 ms to minimize.
[2024-06-01 00:28:06] [INFO ] Deduced a trap composed of 240 places in 571 ms of which 6 ms to minimize.
[2024-06-01 00:28:06] [INFO ] Deduced a trap composed of 239 places in 648 ms of which 7 ms to minimize.
[2024-06-01 00:28:07] [INFO ] Deduced a trap composed of 258 places in 636 ms of which 7 ms to minimize.
[2024-06-01 00:28:08] [INFO ] Deduced a trap composed of 284 places in 644 ms of which 7 ms to minimize.
SMT process timed out in 46405ms, After SMT, problems are : Problem set: 0 solved, 204 unsolved
Fused 204 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 95 out of 398 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 398/398 places, 2258/2258 transitions.
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 64 place count 334 transition count 1960
Iterating global reduction 0 with 64 rules applied. Total rules applied 128 place count 334 transition count 1960
Applied a total of 128 rules in 152 ms. Remains 334 /398 variables (removed 64) and now considering 1960/2258 (removed 298) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 334/398 places, 1960/2258 transitions.
RANDOM walk for 4000000 steps (8 resets) in 71701 ms. (55 steps per ms) remains 197/204 properties
BEST_FIRST walk for 40003 steps (8 resets) in 191 ms. (208 steps per ms) remains 197/197 properties
BEST_FIRST walk for 40002 steps (8 resets) in 250 ms. (159 steps per ms) remains 194/197 properties
BEST_FIRST walk for 40001 steps (8 resets) in 255 ms. (156 steps per ms) remains 194/194 properties
BEST_FIRST walk for 40003 steps (8 resets) in 254 ms. (156 steps per ms) remains 194/194 properties
BEST_FIRST walk for 40003 steps (8 resets) in 255 ms. (156 steps per ms) remains 194/194 properties
BEST_FIRST walk for 40003 steps (8 resets) in 255 ms. (156 steps per ms) remains 194/194 properties
BEST_FIRST walk for 40002 steps (8 resets) in 274 ms. (145 steps per ms) remains 194/194 properties
BEST_FIRST walk for 40002 steps (8 resets) in 285 ms. (139 steps per ms) remains 194/194 properties
BEST_FIRST walk for 40003 steps (8 resets) in 257 ms. (155 steps per ms) remains 194/194 properties
BEST_FIRST walk for 40002 steps (8 resets) in 244 ms. (163 steps per ms) remains 194/194 properties
BEST_FIRST walk for 40001 steps (8 resets) in 248 ms. (160 steps per ms) remains 183/194 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 182/183 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 182/182 properties
BEST_FIRST walk for 40002 steps (8 resets) in 185 ms. (215 steps per ms) remains 181/182 properties
BEST_FIRST walk for 40004 steps (8 resets) in 186 ms. (213 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (8 resets) in 236 ms. (168 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40002 steps (8 resets) in 257 ms. (155 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40002 steps (8 resets) in 251 ms. (158 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40003 steps (8 resets) in 222 ms. (179 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (8 resets) in 245 ms. (162 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40003 steps (8 resets) in 253 ms. (157 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40003 steps (8 resets) in 250 ms. (159 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40003 steps (8 resets) in 260 ms. (153 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40003 steps (8 resets) in 239 ms. (166 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40003 steps (8 resets) in 253 ms. (157 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40001 steps (8 resets) in 248 ms. (160 steps per ms) remains 177/181 properties
BEST_FIRST walk for 40000 steps (8 resets) in 241 ms. (165 steps per ms) remains 177/177 properties
BEST_FIRST walk for 40004 steps (8 resets) in 248 ms. (160 steps per ms) remains 174/177 properties
BEST_FIRST walk for 40003 steps (8 resets) in 227 ms. (175 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40003 steps (8 resets) in 234 ms. (170 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40003 steps (8 resets) in 228 ms. (174 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40002 steps (8 resets) in 227 ms. (175 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40002 steps (8 resets) in 211 ms. (188 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40003 steps (8 resets) in 225 ms. (177 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40002 steps (8 resets) in 242 ms. (164 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40003 steps (8 resets) in 229 ms. (173 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40003 steps (8 resets) in 223 ms. (178 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (8 resets) in 223 ms. (178 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40002 steps (8 resets) in 217 ms. (183 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40002 steps (8 resets) in 229 ms. (173 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40001 steps (8 resets) in 238 ms. (167 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40003 steps (8 resets) in 241 ms. (165 steps per ms) remains 173/174 properties
BEST_FIRST walk for 40003 steps (8 resets) in 232 ms. (171 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40003 steps (8 resets) in 241 ms. (165 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40004 steps (8 resets) in 250 ms. (159 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40003 steps (8 resets) in 249 ms. (160 steps per ms) remains 173/173 properties
BEST_FIRST walk for 40003 steps (8 resets) in 253 ms. (157 steps per ms) remains 166/173 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40003 steps (8 resets) in 216 ms. (184 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (8 resets) in 233 ms. (170 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40003 steps (8 resets) in 258 ms. (154 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40003 steps (8 resets) in 203 ms. (196 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40002 steps (8 resets) in 211 ms. (188 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (8 resets) in 216 ms. (184 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40003 steps (8 resets) in 201 ms. (198 steps per ms) remains 165/166 properties
BEST_FIRST walk for 40003 steps (8 resets) in 224 ms. (177 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40002 steps (8 resets) in 220 ms. (181 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40003 steps (8 resets) in 224 ms. (177 steps per ms) remains 165/165 properties
BEST_FIRST walk for 40004 steps (8 resets) in 226 ms. (176 steps per ms) remains 161/165 properties
BEST_FIRST walk for 40004 steps (8 resets) in 236 ms. (168 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 161/161 properties
BEST_FIRST walk for 40003 steps (8 resets) in 234 ms. (170 steps per ms) remains 158/161 properties
BEST_FIRST walk for 40002 steps (8 resets) in 228 ms. (174 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40003 steps (8 resets) in 199 ms. (200 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40002 steps (8 resets) in 225 ms. (177 steps per ms) remains 157/158 properties
BEST_FIRST walk for 40001 steps (8 resets) in 220 ms. (181 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40003 steps (8 resets) in 227 ms. (175 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40002 steps (8 resets) in 220 ms. (181 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40003 steps (8 resets) in 235 ms. (169 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40002 steps (8 resets) in 222 ms. (179 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40002 steps (8 resets) in 228 ms. (174 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40003 steps (8 resets) in 216 ms. (184 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40004 steps (8 resets) in 222 ms. (179 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40003 steps (8 resets) in 222 ms. (179 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40002 steps (8 resets) in 220 ms. (181 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40004 steps (8 resets) in 217 ms. (183 steps per ms) remains 155/157 properties
BEST_FIRST walk for 40003 steps (8 resets) in 207 ms. (192 steps per ms) remains 154/155 properties
BEST_FIRST walk for 40004 steps (8 resets) in 236 ms. (168 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40003 steps (8 resets) in 259 ms. (153 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40002 steps (8 resets) in 194 ms. (205 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40003 steps (8 resets) in 262 ms. (152 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40004 steps (8 resets) in 256 ms. (155 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40002 steps (8 resets) in 239 ms. (166 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40002 steps (8 resets) in 236 ms. (168 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40003 steps (8 resets) in 220 ms. (181 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40002 steps (8 resets) in 205 ms. (194 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40002 steps (8 resets) in 218 ms. (182 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40003 steps (8 resets) in 217 ms. (183 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40002 steps (8 resets) in 220 ms. (181 steps per ms) remains 153/154 properties
BEST_FIRST walk for 40002 steps (8 resets) in 209 ms. (190 steps per ms) remains 153/153 properties
BEST_FIRST walk for 40003 steps (8 resets) in 217 ms. (183 steps per ms) remains 153/153 properties
BEST_FIRST walk for 40002 steps (8 resets) in 203 ms. (196 steps per ms) remains 153/153 properties
BEST_FIRST walk for 40002 steps (8 resets) in 165 ms. (240 steps per ms) remains 153/153 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 153/153 properties
BEST_FIRST walk for 40001 steps (8 resets) in 213 ms. (186 steps per ms) remains 153/153 properties
BEST_FIRST walk for 40001 steps (8 resets) in 216 ms. (184 steps per ms) remains 153/153 properties
BEST_FIRST walk for 40002 steps (8 resets) in 204 ms. (195 steps per ms) remains 153/153 properties
BEST_FIRST walk for 40004 steps (8 resets) in 216 ms. (184 steps per ms) remains 153/153 properties
BEST_FIRST walk for 40003 steps (8 resets) in 213 ms. (186 steps per ms) remains 153/153 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 153/153 properties
BEST_FIRST walk for 40003 steps (8 resets) in 240 ms. (165 steps per ms) remains 153/153 properties
BEST_FIRST walk for 40003 steps (8 resets) in 256 ms. (155 steps per ms) remains 153/153 properties
BEST_FIRST walk for 40004 steps (8 resets) in 268 ms. (148 steps per ms) remains 153/153 properties
BEST_FIRST walk for 40004 steps (8 resets) in 254 ms. (156 steps per ms) remains 153/153 properties
BEST_FIRST walk for 40002 steps (8 resets) in 213 ms. (186 steps per ms) remains 153/153 properties
BEST_FIRST walk for 40003 steps (8 resets) in 211 ms. (188 steps per ms) remains 153/153 properties
BEST_FIRST walk for 40004 steps (8 resets) in 220 ms. (181 steps per ms) remains 153/153 properties
BEST_FIRST walk for 40003 steps (8 resets) in 215 ms. (185 steps per ms) remains 150/153 properties
BEST_FIRST walk for 40002 steps (8 resets) in 219 ms. (181 steps per ms) remains 150/150 properties
BEST_FIRST walk for 40003 steps (8 resets) in 214 ms. (186 steps per ms) remains 149/150 properties
BEST_FIRST walk for 40003 steps (8 resets) in 219 ms. (181 steps per ms) remains 149/149 properties
BEST_FIRST walk for 40003 steps (8 resets) in 207 ms. (192 steps per ms) remains 149/149 properties
BEST_FIRST walk for 40002 steps (8 resets) in 173 ms. (229 steps per ms) remains 146/149 properties
BEST_FIRST walk for 40000 steps (8 resets) in 190 ms. (209 steps per ms) remains 146/146 properties
BEST_FIRST walk for 40002 steps (8 resets) in 243 ms. (163 steps per ms) remains 143/146 properties
BEST_FIRST walk for 40003 steps (8 resets) in 254 ms. (156 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40002 steps (8 resets) in 226 ms. (176 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40003 steps (8 resets) in 276 ms. (144 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40003 steps (8 resets) in 216 ms. (184 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40001 steps (8 resets) in 201 ms. (198 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40004 steps (8 resets) in 205 ms. (194 steps per ms) remains 138/143 properties
BEST_FIRST walk for 40003 steps (8 resets) in 153 ms. (259 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (8 resets) in 192 ms. (207 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (8 resets) in 203 ms. (196 steps per ms) remains 137/138 properties
BEST_FIRST walk for 40003 steps (8 resets) in 199 ms. (200 steps per ms) remains 137/137 properties
BEST_FIRST walk for 40003 steps (8 resets) in 183 ms. (217 steps per ms) remains 137/137 properties
BEST_FIRST walk for 40002 steps (8 resets) in 192 ms. (207 steps per ms) remains 137/137 properties
BEST_FIRST walk for 40003 steps (8 resets) in 199 ms. (200 steps per ms) remains 137/137 properties
BEST_FIRST walk for 40003 steps (8 resets) in 205 ms. (194 steps per ms) remains 137/137 properties
BEST_FIRST walk for 40003 steps (8 resets) in 192 ms. (207 steps per ms) remains 137/137 properties
BEST_FIRST walk for 40002 steps (8 resets) in 206 ms. (193 steps per ms) remains 134/137 properties
BEST_FIRST walk for 40003 steps (8 resets) in 193 ms. (206 steps per ms) remains 133/134 properties
BEST_FIRST walk for 40004 steps (8 resets) in 203 ms. (196 steps per ms) remains 132/133 properties
BEST_FIRST walk for 40002 steps (8 resets) in 220 ms. (181 steps per ms) remains 130/132 properties
BEST_FIRST walk for 40003 steps (8 resets) in 210 ms. (189 steps per ms) remains 130/130 properties
BEST_FIRST walk for 40001 steps (8 resets) in 172 ms. (231 steps per ms) remains 130/130 properties
BEST_FIRST walk for 40003 steps (8 resets) in 181 ms. (219 steps per ms) remains 130/130 properties
BEST_FIRST walk for 40003 steps (8 resets) in 217 ms. (183 steps per ms) remains 129/130 properties
BEST_FIRST walk for 40003 steps (8 resets) in 202 ms. (197 steps per ms) remains 128/129 properties
BEST_FIRST walk for 40004 steps (8 resets) in 216 ms. (184 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40002 steps (8 resets) in 231 ms. (172 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40001 steps (8 resets) in 251 ms. (158 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40004 steps (8 resets) in 194 ms. (205 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40003 steps (8 resets) in 201 ms. (198 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40003 steps (8 resets) in 209 ms. (190 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40001 steps (8 resets) in 192 ms. (207 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40002 steps (8 resets) in 207 ms. (192 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40003 steps (8 resets) in 200 ms. (199 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40002 steps (8 resets) in 204 ms. (195 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40004 steps (8 resets) in 202 ms. (197 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40003 steps (8 resets) in 228 ms. (174 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40003 steps (8 resets) in 202 ms. (197 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40004 steps (8 resets) in 220 ms. (181 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40003 steps (8 resets) in 238 ms. (167 steps per ms) remains 127/128 properties
BEST_FIRST walk for 40003 steps (8 resets) in 231 ms. (172 steps per ms) remains 126/127 properties
BEST_FIRST walk for 40003 steps (8 resets) in 204 ms. (195 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40002 steps (8 resets) in 209 ms. (190 steps per ms) remains 126/126 properties
// Phase 1: matrix 1960 rows 334 cols
[2024-06-01 00:28:39] [INFO ] Computed 22 invariants in 14 ms
[2024-06-01 00:28:39] [INFO ] State equation strengthened by 97 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 238/308 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (OVERLAPS) 25/333 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-06-01 00:28:45] [INFO ] Deduced a trap composed of 104 places in 735 ms of which 6 ms to minimize.
[2024-06-01 00:28:46] [INFO ] Deduced a trap composed of 70 places in 754 ms of which 6 ms to minimize.
[2024-06-01 00:28:47] [INFO ] Deduced a trap composed of 93 places in 769 ms of which 5 ms to minimize.
[2024-06-01 00:28:47] [INFO ] Deduced a trap composed of 81 places in 775 ms of which 6 ms to minimize.
[2024-06-01 00:28:48] [INFO ] Deduced a trap composed of 64 places in 709 ms of which 5 ms to minimize.
[2024-06-01 00:28:49] [INFO ] Deduced a trap composed of 60 places in 659 ms of which 5 ms to minimize.
[2024-06-01 00:28:50] [INFO ] Deduced a trap composed of 72 places in 693 ms of which 5 ms to minimize.
[2024-06-01 00:28:50] [INFO ] Deduced a trap composed of 95 places in 755 ms of which 5 ms to minimize.
[2024-06-01 00:28:51] [INFO ] Deduced a trap composed of 86 places in 802 ms of which 5 ms to minimize.
[2024-06-01 00:28:52] [INFO ] Deduced a trap composed of 114 places in 784 ms of which 6 ms to minimize.
[2024-06-01 00:28:53] [INFO ] Deduced a trap composed of 83 places in 644 ms of which 5 ms to minimize.
[2024-06-01 00:28:54] [INFO ] Deduced a trap composed of 154 places in 582 ms of which 5 ms to minimize.
[2024-06-01 00:28:54] [INFO ] Deduced a trap composed of 108 places in 650 ms of which 5 ms to minimize.
[2024-06-01 00:28:55] [INFO ] Deduced a trap composed of 102 places in 806 ms of which 6 ms to minimize.
[2024-06-01 00:28:56] [INFO ] Deduced a trap composed of 70 places in 737 ms of which 5 ms to minimize.
[2024-06-01 00:28:57] [INFO ] Deduced a trap composed of 51 places in 814 ms of which 5 ms to minimize.
[2024-06-01 00:28:58] [INFO ] Deduced a trap composed of 128 places in 813 ms of which 5 ms to minimize.
[2024-06-01 00:28:58] [INFO ] Deduced a trap composed of 97 places in 819 ms of which 6 ms to minimize.
[2024-06-01 00:28:59] [INFO ] Deduced a trap composed of 56 places in 827 ms of which 5 ms to minimize.
[2024-06-01 00:29:00] [INFO ] Deduced a trap composed of 103 places in 725 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/333 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-06-01 00:29:03] [INFO ] Deduced a trap composed of 123 places in 777 ms of which 6 ms to minimize.
[2024-06-01 00:29:04] [INFO ] Deduced a trap composed of 83 places in 807 ms of which 5 ms to minimize.
[2024-06-01 00:29:04] [INFO ] Deduced a trap composed of 127 places in 774 ms of which 11 ms to minimize.
[2024-06-01 00:29:05] [INFO ] Deduced a trap composed of 87 places in 821 ms of which 6 ms to minimize.
[2024-06-01 00:29:06] [INFO ] Deduced a trap composed of 108 places in 792 ms of which 6 ms to minimize.
[2024-06-01 00:29:07] [INFO ] Deduced a trap composed of 89 places in 768 ms of which 5 ms to minimize.
[2024-06-01 00:29:08] [INFO ] Deduced a trap composed of 82 places in 769 ms of which 6 ms to minimize.
[2024-06-01 00:29:09] [INFO ] Deduced a trap composed of 90 places in 701 ms of which 6 ms to minimize.
[2024-06-01 00:29:10] [INFO ] Deduced a trap composed of 92 places in 755 ms of which 6 ms to minimize.
[2024-06-01 00:29:10] [INFO ] Deduced a trap composed of 90 places in 654 ms of which 4 ms to minimize.
[2024-06-01 00:29:11] [INFO ] Deduced a trap composed of 104 places in 547 ms of which 4 ms to minimize.
[2024-06-01 00:29:11] [INFO ] Deduced a trap composed of 114 places in 641 ms of which 5 ms to minimize.
[2024-06-01 00:29:12] [INFO ] Deduced a trap composed of 84 places in 771 ms of which 6 ms to minimize.
[2024-06-01 00:29:13] [INFO ] Deduced a trap composed of 80 places in 796 ms of which 6 ms to minimize.
[2024-06-01 00:29:14] [INFO ] Deduced a trap composed of 76 places in 532 ms of which 3 ms to minimize.
[2024-06-01 00:29:14] [INFO ] Deduced a trap composed of 73 places in 536 ms of which 4 ms to minimize.
[2024-06-01 00:29:15] [INFO ] Deduced a trap composed of 75 places in 474 ms of which 4 ms to minimize.
[2024-06-01 00:29:15] [INFO ] Deduced a trap composed of 55 places in 558 ms of which 4 ms to minimize.
[2024-06-01 00:29:16] [INFO ] Deduced a trap composed of 93 places in 539 ms of which 4 ms to minimize.
[2024-06-01 00:29:16] [INFO ] Deduced a trap composed of 88 places in 559 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-06-01 00:29:18] [INFO ] Deduced a trap composed of 142 places in 554 ms of which 4 ms to minimize.
[2024-06-01 00:29:18] [INFO ] Deduced a trap composed of 56 places in 549 ms of which 3 ms to minimize.
[2024-06-01 00:29:19] [INFO ] Deduced a trap composed of 119 places in 550 ms of which 3 ms to minimize.
[2024-06-01 00:29:19] [INFO ] Deduced a trap composed of 106 places in 536 ms of which 4 ms to minimize.
[2024-06-01 00:29:20] [INFO ] Deduced a trap composed of 99 places in 543 ms of which 3 ms to minimize.
[2024-06-01 00:29:20] [INFO ] Deduced a trap composed of 121 places in 542 ms of which 4 ms to minimize.
[2024-06-01 00:29:21] [INFO ] Deduced a trap composed of 102 places in 545 ms of which 4 ms to minimize.
[2024-06-01 00:29:22] [INFO ] Deduced a trap composed of 123 places in 554 ms of which 3 ms to minimize.
[2024-06-01 00:29:22] [INFO ] Deduced a trap composed of 101 places in 560 ms of which 4 ms to minimize.
[2024-06-01 00:29:23] [INFO ] Deduced a trap composed of 106 places in 564 ms of which 4 ms to minimize.
[2024-06-01 00:29:23] [INFO ] Deduced a trap composed of 124 places in 597 ms of which 4 ms to minimize.
[2024-06-01 00:29:24] [INFO ] Deduced a trap composed of 125 places in 694 ms of which 4 ms to minimize.
[2024-06-01 00:29:25] [INFO ] Deduced a trap composed of 104 places in 552 ms of which 5 ms to minimize.
[2024-06-01 00:29:25] [INFO ] Deduced a trap composed of 111 places in 688 ms of which 5 ms to minimize.
[2024-06-01 00:29:26] [INFO ] Deduced a trap composed of 112 places in 784 ms of which 5 ms to minimize.
[2024-06-01 00:29:27] [INFO ] Deduced a trap composed of 101 places in 806 ms of which 5 ms to minimize.
[2024-06-01 00:29:28] [INFO ] Deduced a trap composed of 99 places in 725 ms of which 5 ms to minimize.
[2024-06-01 00:29:29] [INFO ] Deduced a trap composed of 91 places in 735 ms of which 6 ms to minimize.
[2024-06-01 00:29:29] [INFO ] Deduced a trap composed of 64 places in 709 ms of which 5 ms to minimize.
[2024-06-01 00:29:30] [INFO ] Deduced a trap composed of 66 places in 702 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-06-01 00:29:35] [INFO ] Deduced a trap composed of 119 places in 806 ms of which 5 ms to minimize.
[2024-06-01 00:29:36] [INFO ] Deduced a trap composed of 73 places in 783 ms of which 5 ms to minimize.
[2024-06-01 00:29:37] [INFO ] Deduced a trap composed of 52 places in 790 ms of which 6 ms to minimize.
[2024-06-01 00:29:39] [INFO ] Deduced a trap composed of 56 places in 771 ms of which 6 ms to minimize.
[2024-06-01 00:29:40] [INFO ] Deduced a trap composed of 82 places in 707 ms of which 5 ms to minimize.
[2024-06-01 00:29:41] [INFO ] Deduced a trap composed of 90 places in 747 ms of which 5 ms to minimize.
[2024-06-01 00:29:42] [INFO ] Deduced a trap composed of 77 places in 754 ms of which 6 ms to minimize.
[2024-06-01 00:29:42] [INFO ] Deduced a trap composed of 50 places in 793 ms of which 6 ms to minimize.
[2024-06-01 00:29:43] [INFO ] Deduced a trap composed of 99 places in 714 ms of which 5 ms to minimize.
[2024-06-01 00:29:44] [INFO ] Deduced a trap composed of 62 places in 657 ms of which 6 ms to minimize.
[2024-06-01 00:29:45] [INFO ] Deduced a trap composed of 106 places in 781 ms of which 5 ms to minimize.
[2024-06-01 00:29:46] [INFO ] Deduced a trap composed of 77 places in 786 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/333 variables, 12/93 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/333 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 9 (OVERLAPS) 1/334 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 126 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 334/2294 variables, and 94 constraints, problems are : Problem set: 0 solved, 126 unsolved in 75012 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/334 constraints, ReadFeed: 0/97 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 72/72 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 238/308 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (OVERLAPS) 25/333 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/333 variables, 72/93 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-06-01 00:29:58] [INFO ] Deduced a trap composed of 105 places in 476 ms of which 4 ms to minimize.
[2024-06-01 00:29:58] [INFO ] Deduced a trap composed of 102 places in 482 ms of which 4 ms to minimize.
[2024-06-01 00:29:59] [INFO ] Deduced a trap composed of 105 places in 486 ms of which 3 ms to minimize.
[2024-06-01 00:29:59] [INFO ] Deduced a trap composed of 112 places in 510 ms of which 3 ms to minimize.
[2024-06-01 00:30:00] [INFO ] Deduced a trap composed of 114 places in 528 ms of which 4 ms to minimize.
[2024-06-01 00:30:01] [INFO ] Deduced a trap composed of 101 places in 658 ms of which 4 ms to minimize.
[2024-06-01 00:30:01] [INFO ] Deduced a trap composed of 125 places in 593 ms of which 5 ms to minimize.
[2024-06-01 00:30:02] [INFO ] Deduced a trap composed of 87 places in 570 ms of which 3 ms to minimize.
[2024-06-01 00:30:03] [INFO ] Deduced a trap composed of 106 places in 693 ms of which 4 ms to minimize.
[2024-06-01 00:30:03] [INFO ] Deduced a trap composed of 138 places in 697 ms of which 5 ms to minimize.
[2024-06-01 00:30:04] [INFO ] Deduced a trap composed of 93 places in 740 ms of which 4 ms to minimize.
[2024-06-01 00:30:05] [INFO ] Deduced a trap composed of 96 places in 577 ms of which 3 ms to minimize.
[2024-06-01 00:30:05] [INFO ] Deduced a trap composed of 117 places in 538 ms of which 3 ms to minimize.
[2024-06-01 00:30:06] [INFO ] Deduced a trap composed of 109 places in 520 ms of which 4 ms to minimize.
[2024-06-01 00:30:06] [INFO ] Deduced a trap composed of 154 places in 447 ms of which 3 ms to minimize.
[2024-06-01 00:30:07] [INFO ] Deduced a trap composed of 69 places in 569 ms of which 3 ms to minimize.
[2024-06-01 00:30:08] [INFO ] Deduced a trap composed of 97 places in 556 ms of which 4 ms to minimize.
[2024-06-01 00:30:08] [INFO ] Deduced a trap composed of 96 places in 549 ms of which 4 ms to minimize.
[2024-06-01 00:30:09] [INFO ] Deduced a trap composed of 98 places in 538 ms of which 4 ms to minimize.
[2024-06-01 00:30:09] [INFO ] Deduced a trap composed of 107 places in 508 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 20/113 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-06-01 00:30:12] [INFO ] Deduced a trap composed of 87 places in 529 ms of which 3 ms to minimize.
[2024-06-01 00:30:12] [INFO ] Deduced a trap composed of 91 places in 540 ms of which 4 ms to minimize.
[2024-06-01 00:30:13] [INFO ] Deduced a trap composed of 85 places in 530 ms of which 4 ms to minimize.
[2024-06-01 00:30:14] [INFO ] Deduced a trap composed of 80 places in 547 ms of which 4 ms to minimize.
[2024-06-01 00:30:14] [INFO ] Deduced a trap composed of 92 places in 552 ms of which 4 ms to minimize.
[2024-06-01 00:30:15] [INFO ] Deduced a trap composed of 80 places in 551 ms of which 3 ms to minimize.
[2024-06-01 00:30:15] [INFO ] Deduced a trap composed of 81 places in 634 ms of which 5 ms to minimize.
[2024-06-01 00:30:16] [INFO ] Deduced a trap composed of 84 places in 502 ms of which 4 ms to minimize.
[2024-06-01 00:30:16] [INFO ] Deduced a trap composed of 82 places in 537 ms of which 4 ms to minimize.
[2024-06-01 00:30:17] [INFO ] Deduced a trap composed of 73 places in 548 ms of which 4 ms to minimize.
[2024-06-01 00:30:19] [INFO ] Deduced a trap composed of 72 places in 545 ms of which 3 ms to minimize.
[2024-06-01 00:30:20] [INFO ] Deduced a trap composed of 97 places in 703 ms of which 4 ms to minimize.
[2024-06-01 00:30:21] [INFO ] Deduced a trap composed of 80 places in 541 ms of which 4 ms to minimize.
[2024-06-01 00:30:21] [INFO ] Deduced a trap composed of 93 places in 537 ms of which 4 ms to minimize.
[2024-06-01 00:30:22] [INFO ] Deduced a trap composed of 90 places in 541 ms of which 4 ms to minimize.
[2024-06-01 00:30:23] [INFO ] Deduced a trap composed of 83 places in 617 ms of which 4 ms to minimize.
[2024-06-01 00:30:23] [INFO ] Deduced a trap composed of 95 places in 538 ms of which 4 ms to minimize.
[2024-06-01 00:30:24] [INFO ] Deduced a trap composed of 114 places in 536 ms of which 3 ms to minimize.
[2024-06-01 00:30:25] [INFO ] Deduced a trap composed of 100 places in 622 ms of which 3 ms to minimize.
[2024-06-01 00:30:25] [INFO ] Deduced a trap composed of 89 places in 555 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 20/133 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-06-01 00:30:33] [INFO ] Deduced a trap composed of 117 places in 536 ms of which 3 ms to minimize.
[2024-06-01 00:30:34] [INFO ] Deduced a trap composed of 99 places in 532 ms of which 4 ms to minimize.
[2024-06-01 00:30:34] [INFO ] Deduced a trap composed of 89 places in 533 ms of which 4 ms to minimize.
[2024-06-01 00:30:35] [INFO ] Deduced a trap composed of 90 places in 586 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/333 variables, 4/137 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-06-01 00:30:45] [INFO ] Deduced a trap composed of 92 places in 613 ms of which 5 ms to minimize.
[2024-06-01 00:30:46] [INFO ] Deduced a trap composed of 96 places in 771 ms of which 6 ms to minimize.
[2024-06-01 00:30:52] [INFO ] Deduced a trap composed of 106 places in 540 ms of which 5 ms to minimize.
[2024-06-01 00:30:53] [INFO ] Deduced a trap composed of 103 places in 716 ms of which 5 ms to minimize.
[2024-06-01 00:30:53] [INFO ] Deduced a trap composed of 90 places in 789 ms of which 6 ms to minimize.
[2024-06-01 00:30:57] [INFO ] Deduced a trap composed of 79 places in 706 ms of which 6 ms to minimize.
[2024-06-01 00:30:58] [INFO ] Deduced a trap composed of 80 places in 813 ms of which 5 ms to minimize.
[2024-06-01 00:30:59] [INFO ] Deduced a trap composed of 67 places in 775 ms of which 5 ms to minimize.
[2024-06-01 00:31:00] [INFO ] Deduced a trap composed of 89 places in 727 ms of which 5 ms to minimize.
[2024-06-01 00:31:01] [INFO ] Deduced a trap composed of 108 places in 664 ms of which 6 ms to minimize.
[2024-06-01 00:31:02] [INFO ] Deduced a trap composed of 98 places in 750 ms of which 5 ms to minimize.
[2024-06-01 00:31:02] [INFO ] Deduced a trap composed of 67 places in 655 ms of which 4 ms to minimize.
[2024-06-01 00:31:03] [INFO ] Deduced a trap composed of 86 places in 596 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/333 variables, 13/150 constraints. Problems are: Problem set: 0 solved, 126 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 333/2294 variables, and 150 constraints, problems are : Problem set: 0 solved, 126 unsolved in 75012 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/334 constraints, ReadFeed: 0/97 constraints, PredecessorRefiner: 0/126 constraints, Known Traps: 129/129 constraints]
After SMT, in 150454ms problems are : Problem set: 0 solved, 126 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 70 out of 334 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 334/334 places, 1960/1960 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 316 transition count 1744
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 316 transition count 1744
Applied a total of 36 rules in 60 ms. Remains 316 /334 variables (removed 18) and now considering 1744/1960 (removed 216) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 316/334 places, 1744/1960 transitions.
RANDOM walk for 4000000 steps (8 resets) in 52220 ms. (76 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40002 steps (8 resets) in 397 ms. (100 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40003 steps (8 resets) in 198 ms. (201 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40003 steps (8 resets) in 187 ms. (212 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40003 steps (8 resets) in 178 ms. (223 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (8 resets) in 258 ms. (154 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40003 steps (8 resets) in 343 ms. (116 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40002 steps (8 resets) in 393 ms. (101 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40002 steps (8 resets) in 356 ms. (112 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40003 steps (8 resets) in 359 ms. (111 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (8 resets) in 362 ms. (110 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40004 steps (8 resets) in 304 ms. (131 steps per ms) remains 126/126 properties
BEST_FIRST walk for 40003 steps (8 resets) in 377 ms. (105 steps per ms) remains 125/126 properties
BEST_FIRST walk for 40003 steps (8 resets) in 365 ms. (109 steps per ms) remains 122/125 properties
BEST_FIRST walk for 40004 steps (8 resets) in 294 ms. (135 steps per ms) remains 122/122 properties
BEST_FIRST walk for 40003 steps (8 resets) in 433 ms. (92 steps per ms) remains 122/122 properties
BEST_FIRST walk for 40003 steps (8 resets) in 319 ms. (125 steps per ms) remains 122/122 properties
BEST_FIRST walk for 40002 steps (8 resets) in 323 ms. (123 steps per ms) remains 122/122 properties
BEST_FIRST walk for 40002 steps (8 resets) in 339 ms. (117 steps per ms) remains 122/122 properties
BEST_FIRST walk for 40003 steps (8 resets) in 276 ms. (144 steps per ms) remains 117/122 properties
BEST_FIRST walk for 40002 steps (8 resets) in 299 ms. (133 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40004 steps (8 resets) in 381 ms. (104 steps per ms) remains 116/117 properties
BEST_FIRST walk for 40003 steps (8 resets) in 320 ms. (124 steps per ms) remains 116/116 properties
BEST_FIRST walk for 40002 steps (8 resets) in 320 ms. (124 steps per ms) remains 115/116 properties
BEST_FIRST walk for 40003 steps (8 resets) in 259 ms. (153 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40003 steps (8 resets) in 265 ms. (150 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40003 steps (8 resets) in 393 ms. (101 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40002 steps (8 resets) in 278 ms. (143 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40004 steps (8 resets) in 372 ms. (107 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40003 steps (8 resets) in 270 ms. (147 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40002 steps (8 resets) in 322 ms. (123 steps per ms) remains 115/115 properties
BEST_FIRST walk for 40003 steps (8 resets) in 329 ms. (121 steps per ms) remains 114/115 properties
BEST_FIRST walk for 40003 steps (8 resets) in 385 ms. (103 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40002 steps (8 resets) in 294 ms. (135 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40002 steps (8 resets) in 271 ms. (147 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40004 steps (8 resets) in 261 ms. (152 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40003 steps (8 resets) in 263 ms. (151 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40004 steps (8 resets) in 310 ms. (128 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40002 steps (8 resets) in 322 ms. (123 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40003 steps (8 resets) in 454 ms. (87 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40003 steps (8 resets) in 280 ms. (142 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40003 steps (8 resets) in 249 ms. (160 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40002 steps (8 resets) in 301 ms. (132 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40003 steps (8 resets) in 313 ms. (127 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40001 steps (8 resets) in 288 ms. (138 steps per ms) remains 114/114 properties
BEST_FIRST walk for 40003 steps (8 resets) in 378 ms. (105 steps per ms) remains 113/114 properties
BEST_FIRST walk for 40004 steps (8 resets) in 238 ms. (167 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40002 steps (8 resets) in 257 ms. (155 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40003 steps (8 resets) in 354 ms. (112 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40000 steps (8 resets) in 274 ms. (145 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40003 steps (8 resets) in 310 ms. (128 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40004 steps (8 resets) in 358 ms. (111 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40003 steps (8 resets) in 306 ms. (130 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40003 steps (8 resets) in 330 ms. (120 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40003 steps (8 resets) in 341 ms. (116 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40004 steps (8 resets) in 282 ms. (141 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40003 steps (8 resets) in 314 ms. (126 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40004 steps (8 resets) in 295 ms. (135 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40001 steps (8 resets) in 277 ms. (143 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40002 steps (8 resets) in 301 ms. (132 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40002 steps (8 resets) in 390 ms. (102 steps per ms) remains 112/113 properties
BEST_FIRST walk for 40003 steps (8 resets) in 366 ms. (109 steps per ms) remains 108/112 properties
BEST_FIRST walk for 40003 steps (8 resets) in 195 ms. (204 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 260 ms. (153 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (8 resets) in 310 ms. (128 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (8 resets) in 296 ms. (134 steps per ms) remains 106/108 properties
BEST_FIRST walk for 40003 steps (8 resets) in 359 ms. (111 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40003 steps (8 resets) in 287 ms. (138 steps per ms) remains 105/106 properties
BEST_FIRST walk for 40001 steps (8 resets) in 278 ms. (143 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40002 steps (8 resets) in 303 ms. (131 steps per ms) remains 103/105 properties
BEST_FIRST walk for 40001 steps (8 resets) in 245 ms. (162 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (8 resets) in 379 ms. (105 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (8 resets) in 328 ms. (121 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (8 resets) in 267 ms. (149 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (8 resets) in 365 ms. (109 steps per ms) remains 102/103 properties
BEST_FIRST walk for 40001 steps (8 resets) in 300 ms. (132 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40002 steps (8 resets) in 291 ms. (136 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (8 resets) in 252 ms. (158 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (8 resets) in 312 ms. (127 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40003 steps (8 resets) in 297 ms. (134 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40002 steps (8 resets) in 308 ms. (129 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40003 steps (8 resets) in 257 ms. (155 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (8 resets) in 284 ms. (140 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (8 resets) in 313 ms. (127 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40003 steps (8 resets) in 342 ms. (116 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40003 steps (8 resets) in 288 ms. (138 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40001 steps (8 resets) in 362 ms. (110 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (8 resets) in 438 ms. (91 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40003 steps (8 resets) in 239 ms. (166 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40002 steps (8 resets) in 254 ms. (156 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40003 steps (8 resets) in 273 ms. (145 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40002 steps (8 resets) in 349 ms. (114 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40003 steps (8 resets) in 191 ms. (208 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (8 resets) in 198 ms. (201 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40002 steps (8 resets) in 349 ms. (114 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40003 steps (8 resets) in 277 ms. (143 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40003 steps (8 resets) in 369 ms. (108 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (8 resets) in 262 ms. (152 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40002 steps (8 resets) in 383 ms. (104 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40002 steps (8 resets) in 265 ms. (150 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40002 steps (8 resets) in 269 ms. (148 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40002 steps (8 resets) in 395 ms. (101 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40003 steps (8 resets) in 414 ms. (96 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40002 steps (8 resets) in 263 ms. (151 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40003 steps (8 resets) in 270 ms. (147 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40002 steps (8 resets) in 445 ms. (89 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40003 steps (8 resets) in 252 ms. (158 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (8 resets) in 222 ms. (179 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40003 steps (8 resets) in 288 ms. (138 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40003 steps (8 resets) in 293 ms. (136 steps per ms) remains 102/102 properties
// Phase 1: matrix 1744 rows 316 cols
[2024-06-01 00:31:38] [INFO ] Computed 22 invariants in 10 ms
[2024-06-01 00:31:38] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 229/290 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/290 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 25/315 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-06-01 00:31:41] [INFO ] Deduced a trap composed of 142 places in 509 ms of which 4 ms to minimize.
[2024-06-01 00:31:41] [INFO ] Deduced a trap composed of 104 places in 473 ms of which 3 ms to minimize.
[2024-06-01 00:31:42] [INFO ] Deduced a trap composed of 120 places in 484 ms of which 4 ms to minimize.
[2024-06-01 00:31:42] [INFO ] Deduced a trap composed of 108 places in 472 ms of which 4 ms to minimize.
[2024-06-01 00:31:43] [INFO ] Deduced a trap composed of 110 places in 464 ms of which 3 ms to minimize.
[2024-06-01 00:31:43] [INFO ] Deduced a trap composed of 92 places in 467 ms of which 4 ms to minimize.
[2024-06-01 00:31:44] [INFO ] Deduced a trap composed of 118 places in 468 ms of which 4 ms to minimize.
[2024-06-01 00:31:44] [INFO ] Deduced a trap composed of 90 places in 467 ms of which 3 ms to minimize.
[2024-06-01 00:31:45] [INFO ] Deduced a trap composed of 101 places in 476 ms of which 3 ms to minimize.
[2024-06-01 00:31:45] [INFO ] Deduced a trap composed of 94 places in 474 ms of which 4 ms to minimize.
[2024-06-01 00:31:46] [INFO ] Deduced a trap composed of 80 places in 476 ms of which 3 ms to minimize.
[2024-06-01 00:31:46] [INFO ] Deduced a trap composed of 92 places in 480 ms of which 3 ms to minimize.
[2024-06-01 00:31:47] [INFO ] Deduced a trap composed of 76 places in 468 ms of which 3 ms to minimize.
[2024-06-01 00:31:47] [INFO ] Deduced a trap composed of 73 places in 472 ms of which 3 ms to minimize.
[2024-06-01 00:31:48] [INFO ] Deduced a trap composed of 106 places in 474 ms of which 4 ms to minimize.
[2024-06-01 00:31:48] [INFO ] Deduced a trap composed of 92 places in 487 ms of which 3 ms to minimize.
[2024-06-01 00:31:49] [INFO ] Deduced a trap composed of 132 places in 477 ms of which 3 ms to minimize.
[2024-06-01 00:31:49] [INFO ] Deduced a trap composed of 71 places in 475 ms of which 3 ms to minimize.
[2024-06-01 00:31:50] [INFO ] Deduced a trap composed of 71 places in 443 ms of which 3 ms to minimize.
[2024-06-01 00:31:50] [INFO ] Deduced a trap composed of 97 places in 485 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-06-01 00:31:51] [INFO ] Deduced a trap composed of 127 places in 643 ms of which 6 ms to minimize.
[2024-06-01 00:31:52] [INFO ] Deduced a trap composed of 78 places in 761 ms of which 7 ms to minimize.
[2024-06-01 00:31:53] [INFO ] Deduced a trap composed of 90 places in 678 ms of which 5 ms to minimize.
[2024-06-01 00:31:54] [INFO ] Deduced a trap composed of 85 places in 676 ms of which 5 ms to minimize.
[2024-06-01 00:31:54] [INFO ] Deduced a trap composed of 83 places in 727 ms of which 5 ms to minimize.
[2024-06-01 00:31:55] [INFO ] Deduced a trap composed of 107 places in 783 ms of which 5 ms to minimize.
[2024-06-01 00:31:56] [INFO ] Deduced a trap composed of 83 places in 720 ms of which 5 ms to minimize.
[2024-06-01 00:31:57] [INFO ] Deduced a trap composed of 85 places in 721 ms of which 5 ms to minimize.
[2024-06-01 00:31:57] [INFO ] Deduced a trap composed of 70 places in 684 ms of which 5 ms to minimize.
[2024-06-01 00:31:58] [INFO ] Deduced a trap composed of 77 places in 708 ms of which 5 ms to minimize.
[2024-06-01 00:31:59] [INFO ] Deduced a trap composed of 88 places in 748 ms of which 5 ms to minimize.
[2024-06-01 00:32:00] [INFO ] Deduced a trap composed of 52 places in 735 ms of which 5 ms to minimize.
[2024-06-01 00:32:01] [INFO ] Deduced a trap composed of 67 places in 706 ms of which 5 ms to minimize.
[2024-06-01 00:32:02] [INFO ] Deduced a trap composed of 79 places in 724 ms of which 6 ms to minimize.
[2024-06-01 00:32:02] [INFO ] Deduced a trap composed of 86 places in 676 ms of which 5 ms to minimize.
[2024-06-01 00:32:03] [INFO ] Deduced a trap composed of 77 places in 725 ms of which 6 ms to minimize.
[2024-06-01 00:32:04] [INFO ] Deduced a trap composed of 88 places in 716 ms of which 6 ms to minimize.
[2024-06-01 00:32:04] [INFO ] Deduced a trap composed of 79 places in 714 ms of which 5 ms to minimize.
[2024-06-01 00:32:05] [INFO ] Deduced a trap composed of 103 places in 690 ms of which 6 ms to minimize.
[2024-06-01 00:32:06] [INFO ] Deduced a trap composed of 129 places in 655 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-06-01 00:32:08] [INFO ] Deduced a trap composed of 103 places in 723 ms of which 6 ms to minimize.
[2024-06-01 00:32:09] [INFO ] Deduced a trap composed of 86 places in 740 ms of which 5 ms to minimize.
[2024-06-01 00:32:10] [INFO ] Deduced a trap composed of 89 places in 678 ms of which 5 ms to minimize.
[2024-06-01 00:32:10] [INFO ] Deduced a trap composed of 125 places in 599 ms of which 5 ms to minimize.
[2024-06-01 00:32:11] [INFO ] Deduced a trap composed of 59 places in 653 ms of which 3 ms to minimize.
[2024-06-01 00:32:12] [INFO ] Deduced a trap composed of 83 places in 458 ms of which 4 ms to minimize.
[2024-06-01 00:32:12] [INFO ] Deduced a trap composed of 47 places in 487 ms of which 4 ms to minimize.
[2024-06-01 00:32:13] [INFO ] Deduced a trap composed of 132 places in 574 ms of which 5 ms to minimize.
[2024-06-01 00:32:13] [INFO ] Deduced a trap composed of 80 places in 518 ms of which 3 ms to minimize.
[2024-06-01 00:32:14] [INFO ] Deduced a trap composed of 93 places in 476 ms of which 4 ms to minimize.
[2024-06-01 00:32:14] [INFO ] Deduced a trap composed of 111 places in 493 ms of which 4 ms to minimize.
[2024-06-01 00:32:15] [INFO ] Deduced a trap composed of 113 places in 464 ms of which 4 ms to minimize.
[2024-06-01 00:32:15] [INFO ] Deduced a trap composed of 127 places in 486 ms of which 4 ms to minimize.
[2024-06-01 00:32:16] [INFO ] Deduced a trap composed of 102 places in 483 ms of which 3 ms to minimize.
[2024-06-01 00:32:16] [INFO ] Deduced a trap composed of 82 places in 470 ms of which 4 ms to minimize.
[2024-06-01 00:32:17] [INFO ] Deduced a trap composed of 87 places in 485 ms of which 3 ms to minimize.
[2024-06-01 00:32:17] [INFO ] Deduced a trap composed of 70 places in 482 ms of which 3 ms to minimize.
[2024-06-01 00:32:18] [INFO ] Deduced a trap composed of 88 places in 488 ms of which 3 ms to minimize.
[2024-06-01 00:32:18] [INFO ] Deduced a trap composed of 96 places in 480 ms of which 3 ms to minimize.
[2024-06-01 00:32:19] [INFO ] Deduced a trap composed of 99 places in 493 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-06-01 00:32:21] [INFO ] Deduced a trap composed of 85 places in 392 ms of which 4 ms to minimize.
[2024-06-01 00:32:22] [INFO ] Deduced a trap composed of 87 places in 493 ms of which 3 ms to minimize.
[2024-06-01 00:32:22] [INFO ] Deduced a trap composed of 100 places in 500 ms of which 3 ms to minimize.
[2024-06-01 00:32:23] [INFO ] Deduced a trap composed of 94 places in 467 ms of which 3 ms to minimize.
[2024-06-01 00:32:24] [INFO ] Deduced a trap composed of 59 places in 660 ms of which 4 ms to minimize.
[2024-06-01 00:32:24] [INFO ] Deduced a trap composed of 73 places in 494 ms of which 3 ms to minimize.
[2024-06-01 00:32:25] [INFO ] Deduced a trap composed of 66 places in 493 ms of which 5 ms to minimize.
[2024-06-01 00:32:25] [INFO ] Deduced a trap composed of 95 places in 527 ms of which 6 ms to minimize.
[2024-06-01 00:32:26] [INFO ] Deduced a trap composed of 53 places in 620 ms of which 4 ms to minimize.
[2024-06-01 00:32:26] [INFO ] Deduced a trap composed of 79 places in 467 ms of which 3 ms to minimize.
[2024-06-01 00:32:27] [INFO ] Deduced a trap composed of 53 places in 479 ms of which 3 ms to minimize.
[2024-06-01 00:32:27] [INFO ] Deduced a trap composed of 100 places in 488 ms of which 3 ms to minimize.
[2024-06-01 00:32:28] [INFO ] Deduced a trap composed of 113 places in 600 ms of which 5 ms to minimize.
[2024-06-01 00:32:28] [INFO ] Deduced a trap composed of 101 places in 512 ms of which 6 ms to minimize.
[2024-06-01 00:32:29] [INFO ] Deduced a trap composed of 102 places in 619 ms of which 3 ms to minimize.
[2024-06-01 00:32:30] [INFO ] Deduced a trap composed of 93 places in 472 ms of which 4 ms to minimize.
[2024-06-01 00:32:30] [INFO ] Deduced a trap composed of 98 places in 527 ms of which 4 ms to minimize.
[2024-06-01 00:32:31] [INFO ] Deduced a trap composed of 95 places in 605 ms of which 4 ms to minimize.
[2024-06-01 00:32:31] [INFO ] Deduced a trap composed of 119 places in 545 ms of which 5 ms to minimize.
[2024-06-01 00:32:32] [INFO ] Deduced a trap composed of 86 places in 545 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/315 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-06-01 00:32:35] [INFO ] Deduced a trap composed of 111 places in 389 ms of which 4 ms to minimize.
[2024-06-01 00:32:35] [INFO ] Deduced a trap composed of 46 places in 488 ms of which 3 ms to minimize.
[2024-06-01 00:32:36] [INFO ] Deduced a trap composed of 84 places in 478 ms of which 3 ms to minimize.
[2024-06-01 00:32:36] [INFO ] Deduced a trap composed of 97 places in 492 ms of which 3 ms to minimize.
[2024-06-01 00:32:37] [INFO ] Deduced a trap composed of 59 places in 461 ms of which 3 ms to minimize.
[2024-06-01 00:32:37] [INFO ] Deduced a trap composed of 76 places in 519 ms of which 5 ms to minimize.
[2024-06-01 00:32:38] [INFO ] Deduced a trap composed of 82 places in 551 ms of which 3 ms to minimize.
[2024-06-01 00:32:38] [INFO ] Deduced a trap composed of 50 places in 454 ms of which 3 ms to minimize.
[2024-06-01 00:32:39] [INFO ] Deduced a trap composed of 84 places in 382 ms of which 3 ms to minimize.
[2024-06-01 00:32:39] [INFO ] Deduced a trap composed of 92 places in 459 ms of which 3 ms to minimize.
[2024-06-01 00:32:40] [INFO ] Deduced a trap composed of 82 places in 454 ms of which 3 ms to minimize.
[2024-06-01 00:32:40] [INFO ] Deduced a trap composed of 80 places in 476 ms of which 3 ms to minimize.
[2024-06-01 00:32:41] [INFO ] Deduced a trap composed of 98 places in 482 ms of which 4 ms to minimize.
[2024-06-01 00:32:42] [INFO ] Deduced a trap composed of 90 places in 489 ms of which 3 ms to minimize.
[2024-06-01 00:32:42] [INFO ] Deduced a trap composed of 69 places in 474 ms of which 3 ms to minimize.
[2024-06-01 00:32:43] [INFO ] Deduced a trap composed of 77 places in 432 ms of which 3 ms to minimize.
[2024-06-01 00:32:43] [INFO ] Deduced a trap composed of 75 places in 475 ms of which 3 ms to minimize.
[2024-06-01 00:32:44] [INFO ] Deduced a trap composed of 49 places in 482 ms of which 3 ms to minimize.
[2024-06-01 00:32:44] [INFO ] Deduced a trap composed of 70 places in 441 ms of which 3 ms to minimize.
[2024-06-01 00:32:45] [INFO ] Deduced a trap composed of 67 places in 536 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/315 variables, 20/121 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-06-01 00:32:47] [INFO ] Deduced a trap composed of 122 places in 438 ms of which 3 ms to minimize.
[2024-06-01 00:32:48] [INFO ] Deduced a trap composed of 40 places in 385 ms of which 3 ms to minimize.
[2024-06-01 00:32:49] [INFO ] Deduced a trap composed of 88 places in 475 ms of which 4 ms to minimize.
[2024-06-01 00:32:50] [INFO ] Deduced a trap composed of 125 places in 495 ms of which 4 ms to minimize.
[2024-06-01 00:32:50] [INFO ] Deduced a trap composed of 121 places in 477 ms of which 3 ms to minimize.
[2024-06-01 00:32:51] [INFO ] Deduced a trap composed of 97 places in 482 ms of which 3 ms to minimize.
[2024-06-01 00:32:51] [INFO ] Deduced a trap composed of 82 places in 490 ms of which 4 ms to minimize.
[2024-06-01 00:32:52] [INFO ] Deduced a trap composed of 90 places in 443 ms of which 3 ms to minimize.
[2024-06-01 00:32:52] [INFO ] Deduced a trap composed of 129 places in 487 ms of which 3 ms to minimize.
[2024-06-01 00:32:53] [INFO ] Deduced a trap composed of 71 places in 485 ms of which 4 ms to minimize.
[2024-06-01 00:32:53] [INFO ] Deduced a trap composed of 80 places in 480 ms of which 3 ms to minimize.
[2024-06-01 00:32:54] [INFO ] Deduced a trap composed of 88 places in 470 ms of which 3 ms to minimize.
[2024-06-01 00:32:54] [INFO ] Deduced a trap composed of 105 places in 478 ms of which 3 ms to minimize.
[2024-06-01 00:32:55] [INFO ] Deduced a trap composed of 83 places in 478 ms of which 4 ms to minimize.
[2024-06-01 00:32:55] [INFO ] Deduced a trap composed of 113 places in 442 ms of which 3 ms to minimize.
[2024-06-01 00:32:55] [INFO ] Deduced a trap composed of 66 places in 433 ms of which 3 ms to minimize.
[2024-06-01 00:32:56] [INFO ] Deduced a trap composed of 65 places in 638 ms of which 3 ms to minimize.
[2024-06-01 00:32:57] [INFO ] Deduced a trap composed of 89 places in 464 ms of which 3 ms to minimize.
[2024-06-01 00:32:58] [INFO ] Deduced a trap composed of 99 places in 436 ms of which 3 ms to minimize.
[2024-06-01 00:32:58] [INFO ] Deduced a trap composed of 41 places in 437 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/315 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-06-01 00:33:05] [INFO ] Deduced a trap composed of 84 places in 634 ms of which 5 ms to minimize.
[2024-06-01 00:33:06] [INFO ] Deduced a trap composed of 69 places in 709 ms of which 5 ms to minimize.
[2024-06-01 00:33:07] [INFO ] Deduced a trap composed of 95 places in 729 ms of which 5 ms to minimize.
[2024-06-01 00:33:08] [INFO ] Deduced a trap composed of 98 places in 710 ms of which 5 ms to minimize.
SMT process timed out in 90755ms, After SMT, problems are : Problem set: 0 solved, 102 unsolved
Fused 102 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 61 out of 316 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 1744/1744 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 307 transition count 1573
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 307 transition count 1573
Applied a total of 18 rules in 75 ms. Remains 307 /316 variables (removed 9) and now considering 1573/1744 (removed 171) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 307/316 places, 1573/1744 transitions.
RANDOM walk for 4000000 steps (8 resets) in 77690 ms. (51 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (8 resets) in 203 ms. (196 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40002 steps (8 resets) in 319 ms. (125 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40002 steps (8 resets) in 419 ms. (95 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40003 steps (8 resets) in 329 ms. (121 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40003 steps (8 resets) in 414 ms. (96 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40001 steps (8 resets) in 311 ms. (128 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (8 resets) in 262 ms. (152 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40002 steps (8 resets) in 275 ms. (144 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (8 resets) in 199 ms. (200 steps per ms) remains 100/102 properties
BEST_FIRST walk for 40004 steps (8 resets) in 206 ms. (193 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40001 steps (8 resets) in 266 ms. (149 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40002 steps (8 resets) in 482 ms. (82 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 330 ms. (120 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40003 steps (8 resets) in 346 ms. (115 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40002 steps (8 resets) in 274 ms. (145 steps per ms) remains 100/100 properties
BEST_FIRST walk for 40003 steps (8 resets) in 230 ms. (173 steps per ms) remains 98/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 255 ms. (156 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40002 steps (8 resets) in 323 ms. (123 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40002 steps (8 resets) in 235 ms. (169 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40002 steps (8 resets) in 367 ms. (108 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40002 steps (8 resets) in 423 ms. (94 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40003 steps (8 resets) in 431 ms. (92 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40002 steps (8 resets) in 276 ms. (144 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40003 steps (8 resets) in 291 ms. (136 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40001 steps (8 resets) in 282 ms. (141 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40002 steps (8 resets) in 265 ms. (150 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40004 steps (8 resets) in 292 ms. (136 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40003 steps (8 resets) in 345 ms. (115 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40004 steps (8 resets) in 341 ms. (116 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40001 steps (8 resets) in 454 ms. (87 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40001 steps (8 resets) in 399 ms. (100 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40004 steps (8 resets) in 430 ms. (92 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40004 steps (8 resets) in 352 ms. (113 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40003 steps (8 resets) in 302 ms. (132 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40001 steps (8 resets) in 229 ms. (173 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40003 steps (8 resets) in 298 ms. (133 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40003 steps (8 resets) in 254 ms. (156 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40002 steps (8 resets) in 299 ms. (133 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40004 steps (8 resets) in 269 ms. (148 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40004 steps (8 resets) in 224 ms. (177 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40002 steps (8 resets) in 480 ms. (83 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40003 steps (8 resets) in 429 ms. (93 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40002 steps (8 resets) in 386 ms. (103 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40002 steps (8 resets) in 492 ms. (81 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40002 steps (8 resets) in 380 ms. (104 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40003 steps (8 resets) in 340 ms. (117 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40003 steps (8 resets) in 402 ms. (99 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40002 steps (8 resets) in 367 ms. (108 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40003 steps (8 resets) in 349 ms. (114 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40000 steps (8 resets) in 348 ms. (114 steps per ms) remains 95/98 properties
BEST_FIRST walk for 40002 steps (8 resets) in 386 ms. (103 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40002 steps (8 resets) in 353 ms. (113 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40004 steps (8 resets) in 250 ms. (159 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40003 steps (8 resets) in 268 ms. (148 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40003 steps (8 resets) in 338 ms. (118 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40004 steps (8 resets) in 294 ms. (135 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40003 steps (8 resets) in 324 ms. (123 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40003 steps (8 resets) in 359 ms. (111 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40004 steps (8 resets) in 322 ms. (123 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40003 steps (8 resets) in 340 ms. (117 steps per ms) remains 95/95 properties
BEST_FIRST walk for 40004 steps (8 resets) in 387 ms. (103 steps per ms) remains 93/95 properties
BEST_FIRST walk for 40002 steps (8 resets) in 450 ms. (88 steps per ms) remains 93/93 properties
BEST_FIRST walk for 40003 steps (8 resets) in 300 ms. (132 steps per ms) remains 89/93 properties
BEST_FIRST walk for 40003 steps (8 resets) in 292 ms. (136 steps per ms) remains 89/89 properties
BEST_FIRST walk for 40002 steps (8 resets) in 296 ms. (134 steps per ms) remains 88/89 properties
BEST_FIRST walk for 40003 steps (8 resets) in 281 ms. (141 steps per ms) remains 88/88 properties
BEST_FIRST walk for 40004 steps (8 resets) in 272 ms. (146 steps per ms) remains 88/88 properties
BEST_FIRST walk for 40003 steps (8 resets) in 308 ms. (129 steps per ms) remains 88/88 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 88/88 properties
BEST_FIRST walk for 40002 steps (8 resets) in 274 ms. (145 steps per ms) remains 88/88 properties
BEST_FIRST walk for 40003 steps (8 resets) in 376 ms. (106 steps per ms) remains 88/88 properties
BEST_FIRST walk for 40003 steps (8 resets) in 395 ms. (101 steps per ms) remains 88/88 properties
BEST_FIRST walk for 40003 steps (8 resets) in 307 ms. (129 steps per ms) remains 88/88 properties
BEST_FIRST walk for 40003 steps (8 resets) in 381 ms. (104 steps per ms) remains 88/88 properties
BEST_FIRST walk for 40003 steps (8 resets) in 312 ms. (127 steps per ms) remains 88/88 properties
BEST_FIRST walk for 40003 steps (8 resets) in 333 ms. (119 steps per ms) remains 88/88 properties
BEST_FIRST walk for 40003 steps (8 resets) in 361 ms. (110 steps per ms) remains 88/88 properties
BEST_FIRST walk for 40001 steps (8 resets) in 256 ms. (155 steps per ms) remains 88/88 properties
BEST_FIRST walk for 40003 steps (8 resets) in 202 ms. (197 steps per ms) remains 88/88 properties
BEST_FIRST walk for 40003 steps (8 resets) in 338 ms. (118 steps per ms) remains 88/88 properties
BEST_FIRST walk for 40004 steps (8 resets) in 356 ms. (112 steps per ms) remains 88/88 properties
BEST_FIRST walk for 40002 steps (8 resets) in 316 ms. (126 steps per ms) remains 88/88 properties
BEST_FIRST walk for 40004 steps (8 resets) in 322 ms. (123 steps per ms) remains 88/88 properties
BEST_FIRST walk for 40002 steps (8 resets) in 333 ms. (119 steps per ms) remains 88/88 properties
BEST_FIRST walk for 40003 steps (8 resets) in 355 ms. (112 steps per ms) remains 88/88 properties
BEST_FIRST walk for 40004 steps (8 resets) in 304 ms. (131 steps per ms) remains 87/88 properties
BEST_FIRST walk for 40003 steps (8 resets) in 447 ms. (89 steps per ms) remains 87/87 properties
BEST_FIRST walk for 40003 steps (8 resets) in 305 ms. (130 steps per ms) remains 86/87 properties
BEST_FIRST walk for 40003 steps (8 resets) in 314 ms. (126 steps per ms) remains 86/86 properties
BEST_FIRST walk for 40002 steps (8 resets) in 282 ms. (141 steps per ms) remains 86/86 properties
BEST_FIRST walk for 40002 steps (8 resets) in 341 ms. (116 steps per ms) remains 86/86 properties
BEST_FIRST walk for 40001 steps (8 resets) in 337 ms. (118 steps per ms) remains 86/86 properties
BEST_FIRST walk for 40002 steps (8 resets) in 267 ms. (149 steps per ms) remains 86/86 properties
BEST_FIRST walk for 40003 steps (8 resets) in 321 ms. (124 steps per ms) remains 86/86 properties
BEST_FIRST walk for 40001 steps (8 resets) in 259 ms. (153 steps per ms) remains 86/86 properties
// Phase 1: matrix 1573 rows 307 cols
[2024-06-01 00:33:43] [INFO ] Computed 22 invariants in 11 ms
[2024-06-01 00:33:43] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 225/281 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/281 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (OVERLAPS) 25/306 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-06-01 00:33:47] [INFO ] Deduced a trap composed of 97 places in 656 ms of which 5 ms to minimize.
[2024-06-01 00:33:47] [INFO ] Deduced a trap composed of 96 places in 656 ms of which 5 ms to minimize.
[2024-06-01 00:33:48] [INFO ] Deduced a trap composed of 72 places in 663 ms of which 5 ms to minimize.
[2024-06-01 00:33:49] [INFO ] Deduced a trap composed of 65 places in 696 ms of which 5 ms to minimize.
[2024-06-01 00:33:50] [INFO ] Deduced a trap composed of 75 places in 681 ms of which 5 ms to minimize.
[2024-06-01 00:33:50] [INFO ] Deduced a trap composed of 57 places in 686 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-06-01 00:33:52] [INFO ] Deduced a trap composed of 56 places in 663 ms of which 6 ms to minimize.
[2024-06-01 00:33:53] [INFO ] Deduced a trap composed of 117 places in 664 ms of which 5 ms to minimize.
[2024-06-01 00:33:54] [INFO ] Deduced a trap composed of 122 places in 654 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-06-01 00:33:57] [INFO ] Deduced a trap composed of 119 places in 657 ms of which 5 ms to minimize.
[2024-06-01 00:33:58] [INFO ] Deduced a trap composed of 60 places in 663 ms of which 5 ms to minimize.
[2024-06-01 00:33:59] [INFO ] Deduced a trap composed of 79 places in 631 ms of which 5 ms to minimize.
[2024-06-01 00:33:59] [INFO ] Deduced a trap composed of 91 places in 652 ms of which 5 ms to minimize.
[2024-06-01 00:34:00] [INFO ] Deduced a trap composed of 80 places in 678 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-06-01 00:34:02] [INFO ] Deduced a trap composed of 39 places in 633 ms of which 5 ms to minimize.
[2024-06-01 00:34:03] [INFO ] Deduced a trap composed of 94 places in 679 ms of which 5 ms to minimize.
[2024-06-01 00:34:04] [INFO ] Deduced a trap composed of 90 places in 684 ms of which 5 ms to minimize.
[2024-06-01 00:34:04] [INFO ] Deduced a trap composed of 71 places in 424 ms of which 4 ms to minimize.
[2024-06-01 00:34:05] [INFO ] Deduced a trap composed of 105 places in 332 ms of which 3 ms to minimize.
[2024-06-01 00:34:05] [INFO ] Deduced a trap composed of 125 places in 542 ms of which 3 ms to minimize.
[2024-06-01 00:34:06] [INFO ] Deduced a trap composed of 128 places in 547 ms of which 3 ms to minimize.
[2024-06-01 00:34:06] [INFO ] Deduced a trap composed of 111 places in 390 ms of which 4 ms to minimize.
[2024-06-01 00:34:07] [INFO ] Deduced a trap composed of 113 places in 381 ms of which 3 ms to minimize.
[2024-06-01 00:34:07] [INFO ] Deduced a trap composed of 109 places in 380 ms of which 3 ms to minimize.
[2024-06-01 00:34:07] [INFO ] Deduced a trap composed of 141 places in 384 ms of which 3 ms to minimize.
[2024-06-01 00:34:08] [INFO ] Deduced a trap composed of 118 places in 381 ms of which 4 ms to minimize.
[2024-06-01 00:34:08] [INFO ] Deduced a trap composed of 124 places in 380 ms of which 3 ms to minimize.
[2024-06-01 00:34:09] [INFO ] Deduced a trap composed of 80 places in 455 ms of which 5 ms to minimize.
[2024-06-01 00:34:09] [INFO ] Deduced a trap composed of 67 places in 402 ms of which 3 ms to minimize.
[2024-06-01 00:34:10] [INFO ] Deduced a trap composed of 58 places in 385 ms of which 3 ms to minimize.
[2024-06-01 00:34:10] [INFO ] Deduced a trap composed of 88 places in 540 ms of which 4 ms to minimize.
[2024-06-01 00:34:11] [INFO ] Deduced a trap composed of 80 places in 390 ms of which 3 ms to minimize.
[2024-06-01 00:34:11] [INFO ] Deduced a trap composed of 102 places in 384 ms of which 3 ms to minimize.
[2024-06-01 00:34:11] [INFO ] Deduced a trap composed of 88 places in 382 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-06-01 00:34:13] [INFO ] Deduced a trap composed of 55 places in 401 ms of which 3 ms to minimize.
[2024-06-01 00:34:13] [INFO ] Deduced a trap composed of 71 places in 409 ms of which 3 ms to minimize.
[2024-06-01 00:34:14] [INFO ] Deduced a trap composed of 82 places in 385 ms of which 3 ms to minimize.
[2024-06-01 00:34:14] [INFO ] Deduced a trap composed of 79 places in 376 ms of which 3 ms to minimize.
[2024-06-01 00:34:14] [INFO ] Deduced a trap composed of 69 places in 490 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 5/60 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-06-01 00:34:17] [INFO ] Deduced a trap composed of 61 places in 661 ms of which 6 ms to minimize.
[2024-06-01 00:34:17] [INFO ] Deduced a trap composed of 99 places in 634 ms of which 5 ms to minimize.
[2024-06-01 00:34:18] [INFO ] Deduced a trap composed of 114 places in 637 ms of which 5 ms to minimize.
[2024-06-01 00:34:19] [INFO ] Deduced a trap composed of 108 places in 646 ms of which 5 ms to minimize.
[2024-06-01 00:34:20] [INFO ] Deduced a trap composed of 95 places in 620 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/306 variables, 5/65 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-06-01 00:34:23] [INFO ] Deduced a trap composed of 75 places in 649 ms of which 4 ms to minimize.
[2024-06-01 00:34:24] [INFO ] Deduced a trap composed of 119 places in 501 ms of which 3 ms to minimize.
[2024-06-01 00:34:24] [INFO ] Deduced a trap composed of 89 places in 551 ms of which 5 ms to minimize.
[2024-06-01 00:34:25] [INFO ] Deduced a trap composed of 109 places in 621 ms of which 5 ms to minimize.
[2024-06-01 00:34:25] [INFO ] Deduced a trap composed of 86 places in 658 ms of which 6 ms to minimize.
[2024-06-01 00:34:26] [INFO ] Deduced a trap composed of 108 places in 718 ms of which 5 ms to minimize.
[2024-06-01 00:34:28] [INFO ] Deduced a trap composed of 67 places in 664 ms of which 5 ms to minimize.
[2024-06-01 00:34:29] [INFO ] Deduced a trap composed of 111 places in 595 ms of which 5 ms to minimize.
[2024-06-01 00:34:30] [INFO ] Deduced a trap composed of 78 places in 619 ms of which 5 ms to minimize.
[2024-06-01 00:34:30] [INFO ] Deduced a trap composed of 101 places in 569 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/306 variables, 10/75 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/306 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 12 (OVERLAPS) 1/307 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-06-01 00:34:37] [INFO ] Deduced a trap composed of 108 places in 583 ms of which 5 ms to minimize.
[2024-06-01 00:34:38] [INFO ] Deduced a trap composed of 73 places in 618 ms of which 5 ms to minimize.
[2024-06-01 00:34:38] [INFO ] Deduced a trap composed of 60 places in 652 ms of which 5 ms to minimize.
[2024-06-01 00:34:39] [INFO ] Deduced a trap composed of 60 places in 659 ms of which 5 ms to minimize.
[2024-06-01 00:34:40] [INFO ] Deduced a trap composed of 77 places in 635 ms of which 5 ms to minimize.
[2024-06-01 00:34:41] [INFO ] Deduced a trap composed of 80 places in 648 ms of which 5 ms to minimize.
[2024-06-01 00:34:42] [INFO ] Deduced a trap composed of 83 places in 655 ms of which 5 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/307 variables, 7/83 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-06-01 00:34:44] [INFO ] Deduced a trap composed of 102 places in 444 ms of which 3 ms to minimize.
[2024-06-01 00:34:44] [INFO ] Deduced a trap composed of 140 places in 438 ms of which 3 ms to minimize.
[2024-06-01 00:34:45] [INFO ] Deduced a trap composed of 109 places in 436 ms of which 4 ms to minimize.
[2024-06-01 00:34:45] [INFO ] Deduced a trap composed of 107 places in 441 ms of which 3 ms to minimize.
[2024-06-01 00:34:46] [INFO ] Deduced a trap composed of 83 places in 457 ms of which 3 ms to minimize.
[2024-06-01 00:34:46] [INFO ] Deduced a trap composed of 113 places in 450 ms of which 4 ms to minimize.
[2024-06-01 00:34:47] [INFO ] Deduced a trap composed of 54 places in 406 ms of which 3 ms to minimize.
[2024-06-01 00:34:47] [INFO ] Deduced a trap composed of 93 places in 450 ms of which 3 ms to minimize.
[2024-06-01 00:34:48] [INFO ] Deduced a trap composed of 116 places in 391 ms of which 3 ms to minimize.
[2024-06-01 00:34:48] [INFO ] Deduced a trap composed of 127 places in 460 ms of which 3 ms to minimize.
[2024-06-01 00:34:49] [INFO ] Deduced a trap composed of 75 places in 415 ms of which 3 ms to minimize.
[2024-06-01 00:34:49] [INFO ] Deduced a trap composed of 108 places in 442 ms of which 3 ms to minimize.
[2024-06-01 00:34:49] [INFO ] Deduced a trap composed of 99 places in 436 ms of which 4 ms to minimize.
[2024-06-01 00:34:50] [INFO ] Deduced a trap composed of 85 places in 471 ms of which 3 ms to minimize.
[2024-06-01 00:34:50] [INFO ] Deduced a trap composed of 96 places in 452 ms of which 3 ms to minimize.
[2024-06-01 00:34:51] [INFO ] Deduced a trap composed of 103 places in 456 ms of which 3 ms to minimize.
[2024-06-01 00:34:51] [INFO ] Deduced a trap composed of 130 places in 444 ms of which 4 ms to minimize.
[2024-06-01 00:34:52] [INFO ] Deduced a trap composed of 135 places in 451 ms of which 3 ms to minimize.
[2024-06-01 00:34:52] [INFO ] Deduced a trap composed of 111 places in 449 ms of which 4 ms to minimize.
[2024-06-01 00:34:53] [INFO ] Deduced a trap composed of 124 places in 381 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/307 variables, 20/103 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-06-01 00:34:54] [INFO ] Deduced a trap composed of 117 places in 351 ms of which 3 ms to minimize.
[2024-06-01 00:34:55] [INFO ] Deduced a trap composed of 83 places in 445 ms of which 3 ms to minimize.
[2024-06-01 00:34:55] [INFO ] Deduced a trap composed of 123 places in 455 ms of which 3 ms to minimize.
[2024-06-01 00:34:56] [INFO ] Deduced a trap composed of 122 places in 463 ms of which 3 ms to minimize.
[2024-06-01 00:34:56] [INFO ] Deduced a trap composed of 100 places in 439 ms of which 3 ms to minimize.
[2024-06-01 00:34:57] [INFO ] Deduced a trap composed of 86 places in 425 ms of which 4 ms to minimize.
[2024-06-01 00:34:57] [INFO ] Deduced a trap composed of 93 places in 456 ms of which 3 ms to minimize.
[2024-06-01 00:34:58] [INFO ] Deduced a trap composed of 80 places in 448 ms of which 3 ms to minimize.
[2024-06-01 00:34:58] [INFO ] Deduced a trap composed of 65 places in 452 ms of which 3 ms to minimize.
[2024-06-01 00:34:59] [INFO ] Deduced a trap composed of 84 places in 392 ms of which 3 ms to minimize.
[2024-06-01 00:34:59] [INFO ] Deduced a trap composed of 66 places in 441 ms of which 4 ms to minimize.
[2024-06-01 00:35:00] [INFO ] Deduced a trap composed of 99 places in 457 ms of which 3 ms to minimize.
[2024-06-01 00:35:00] [INFO ] Deduced a trap composed of 49 places in 444 ms of which 3 ms to minimize.
[2024-06-01 00:35:01] [INFO ] Deduced a trap composed of 81 places in 449 ms of which 3 ms to minimize.
[2024-06-01 00:35:02] [INFO ] Deduced a trap composed of 81 places in 447 ms of which 3 ms to minimize.
[2024-06-01 00:35:02] [INFO ] Deduced a trap composed of 77 places in 440 ms of which 3 ms to minimize.
[2024-06-01 00:35:02] [INFO ] Deduced a trap composed of 76 places in 437 ms of which 4 ms to minimize.
[2024-06-01 00:35:03] [INFO ] Deduced a trap composed of 133 places in 453 ms of which 4 ms to minimize.
[2024-06-01 00:35:03] [INFO ] Deduced a trap composed of 89 places in 445 ms of which 3 ms to minimize.
[2024-06-01 00:35:04] [INFO ] Deduced a trap composed of 81 places in 403 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/307 variables, 20/123 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-06-01 00:35:07] [INFO ] Deduced a trap composed of 74 places in 442 ms of which 4 ms to minimize.
[2024-06-01 00:35:08] [INFO ] Deduced a trap composed of 96 places in 435 ms of which 3 ms to minimize.
[2024-06-01 00:35:09] [INFO ] Deduced a trap composed of 62 places in 442 ms of which 3 ms to minimize.
[2024-06-01 00:35:09] [INFO ] Deduced a trap composed of 89 places in 437 ms of which 3 ms to minimize.
[2024-06-01 00:35:10] [INFO ] Deduced a trap composed of 106 places in 422 ms of which 3 ms to minimize.
[2024-06-01 00:35:10] [INFO ] Deduced a trap composed of 64 places in 453 ms of which 3 ms to minimize.
[2024-06-01 00:35:11] [INFO ] Deduced a trap composed of 94 places in 441 ms of which 4 ms to minimize.
[2024-06-01 00:35:11] [INFO ] Deduced a trap composed of 75 places in 449 ms of which 3 ms to minimize.
[2024-06-01 00:35:12] [INFO ] Deduced a trap composed of 98 places in 428 ms of which 3 ms to minimize.
[2024-06-01 00:35:12] [INFO ] Deduced a trap composed of 103 places in 439 ms of which 3 ms to minimize.
[2024-06-01 00:35:13] [INFO ] Deduced a trap composed of 100 places in 373 ms of which 3 ms to minimize.
[2024-06-01 00:35:13] [INFO ] Deduced a trap composed of 97 places in 442 ms of which 3 ms to minimize.
[2024-06-01 00:35:14] [INFO ] Deduced a trap composed of 121 places in 433 ms of which 5 ms to minimize.
[2024-06-01 00:35:14] [INFO ] Deduced a trap composed of 67 places in 652 ms of which 5 ms to minimize.
[2024-06-01 00:35:15] [INFO ] Deduced a trap composed of 47 places in 556 ms of which 5 ms to minimize.
[2024-06-01 00:35:15] [INFO ] Deduced a trap composed of 95 places in 560 ms of which 4 ms to minimize.
[2024-06-01 00:35:16] [INFO ] Deduced a trap composed of 92 places in 563 ms of which 4 ms to minimize.
[2024-06-01 00:35:17] [INFO ] Deduced a trap composed of 53 places in 626 ms of which 5 ms to minimize.
[2024-06-01 00:35:17] [INFO ] Deduced a trap composed of 55 places in 664 ms of which 5 ms to minimize.
[2024-06-01 00:35:18] [INFO ] Deduced a trap composed of 59 places in 618 ms of which 5 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/307 variables, 20/143 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-06-01 00:35:21] [INFO ] Deduced a trap composed of 91 places in 663 ms of which 5 ms to minimize.
[2024-06-01 00:35:22] [INFO ] Deduced a trap composed of 93 places in 599 ms of which 5 ms to minimize.
[2024-06-01 00:35:23] [INFO ] Deduced a trap composed of 67 places in 667 ms of which 5 ms to minimize.
[2024-06-01 00:35:24] [INFO ] Deduced a trap composed of 82 places in 664 ms of which 5 ms to minimize.
[2024-06-01 00:35:25] [INFO ] Deduced a trap composed of 107 places in 672 ms of which 5 ms to minimize.
[2024-06-01 00:35:26] [INFO ] Deduced a trap composed of 75 places in 682 ms of which 5 ms to minimize.
[2024-06-01 00:35:26] [INFO ] Deduced a trap composed of 58 places in 662 ms of which 5 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/307 variables, 7/150 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 307/1880 variables, and 150 constraints, problems are : Problem set: 0 solved, 86 unsolved in 105012 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/307 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 128/128 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 225/281 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/281 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (OVERLAPS) 25/306 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 115/136 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-06-01 00:35:38] [INFO ] Deduced a trap composed of 48 places in 332 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (OVERLAPS) 1/307 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/307 variables, 13/151 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-06-01 00:35:57] [INFO ] Deduced a trap composed of 103 places in 671 ms of which 5 ms to minimize.
[2024-06-01 00:35:58] [INFO ] Deduced a trap composed of 115 places in 677 ms of which 5 ms to minimize.
[2024-06-01 00:35:59] [INFO ] Deduced a trap composed of 39 places in 652 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/307 variables, 3/154 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-06-01 00:36:04] [INFO ] Deduced a trap composed of 150 places in 437 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/307 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/307 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 12 (OVERLAPS) 1573/1880 variables, 307/462 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1880 variables, 90/552 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1880 variables, 86/638 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1880 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1880/1880 variables, and 638 constraints, problems are : Problem set: 0 solved, 86 unsolved in 105017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 307/307 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 133/133 constraints]
After SMT, in 210384ms problems are : Problem set: 0 solved, 86 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 56 out of 307 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 307/307 places, 1573/1573 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 302 transition count 1478
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 302 transition count 1478
Applied a total of 10 rules in 29 ms. Remains 302 /307 variables (removed 5) and now considering 1478/1573 (removed 95) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 302/307 places, 1478/1573 transitions.
RANDOM walk for 4000000 steps (8 resets) in 43797 ms. (91 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3712 ms. (107 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3762 ms. (106 steps per ms) remains 81/86 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3850 ms. (103 steps per ms) remains 78/81 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3500 ms. (114 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3578 ms. (111 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3767 ms. (106 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3665 ms. (109 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3340 ms. (119 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3174 ms. (125 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3767 ms. (106 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3580 ms. (111 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400002 steps (8 resets) in 3068 ms. (130 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3926 ms. (101 steps per ms) remains 78/78 properties
BEST_FIRST walk for 400002 steps (8 resets) in 3775 ms. (105 steps per ms) remains 73/78 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3543 ms. (112 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400002 steps (8 resets) in 3778 ms. (105 steps per ms) remains 73/73 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3452 ms. (115 steps per ms) remains 70/73 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3274 ms. (122 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3147 ms. (127 steps per ms) remains 69/70 properties
BEST_FIRST walk for 400001 steps (8 resets) in 3667 ms. (109 steps per ms) remains 67/69 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3155 ms. (126 steps per ms) remains 66/67 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3668 ms. (109 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (8 resets) in 3370 ms. (118 steps per ms) remains 63/66 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3679 ms. (108 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400002 steps (8 resets) in 3710 ms. (107 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3770 ms. (106 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400001 steps (8 resets) in 3938 ms. (101 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3670 ms. (108 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3167 ms. (126 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3578 ms. (111 steps per ms) remains 63/63 properties
BEST_FIRST walk for 400002 steps (8 resets) in 3929 ms. (101 steps per ms) remains 60/63 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3076 ms. (129 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3477 ms. (115 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3565 ms. (112 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2886 ms. (138 steps per ms) remains 60/60 properties
BEST_FIRST walk for 400001 steps (8 resets) in 3918 ms. (102 steps per ms) remains 59/60 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3241 ms. (123 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3726 ms. (107 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3282 ms. (121 steps per ms) remains 57/59 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3223 ms. (124 steps per ms) remains 56/57 properties
BEST_FIRST walk for 400002 steps (8 resets) in 3823 ms. (104 steps per ms) remains 56/56 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2676 ms. (149 steps per ms) remains 55/56 properties
BEST_FIRST walk for 400002 steps (8 resets) in 3491 ms. (114 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3988 ms. (100 steps per ms) remains 53/55 properties
BEST_FIRST walk for 400002 steps (8 resets) in 3768 ms. (106 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3258 ms. (122 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3733 ms. (107 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3205 ms. (124 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3358 ms. (119 steps per ms) remains 50/53 properties
BEST_FIRST walk for 400002 steps (8 resets) in 3657 ms. (109 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3889 ms. (102 steps per ms) remains 48/50 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2852 ms. (140 steps per ms) remains 47/48 properties
BEST_FIRST walk for 400002 steps (8 resets) in 3021 ms. (132 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3426 ms. (116 steps per ms) remains 47/47 properties
BEST_FIRST walk for 400001 steps (8 resets) in 3787 ms. (105 steps per ms) remains 46/47 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2727 ms. (146 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3503 ms. (114 steps per ms) remains 45/46 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3165 ms. (126 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3005 ms. (133 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3312 ms. (120 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400002 steps (8 resets) in 3265 ms. (122 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400004 steps (8 resets) in 4021 ms. (99 steps per ms) remains 44/45 properties
BEST_FIRST walk for 400002 steps (8 resets) in 3262 ms. (122 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3832 ms. (104 steps per ms) remains 44/44 properties
// Phase 1: matrix 1478 rows 302 cols
[2024-06-01 00:38:51] [INFO ] Computed 22 invariants in 8 ms
[2024-06-01 00:38:51] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (OVERLAPS) 236/275 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 26/301 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-06-01 00:38:53] [INFO ] Deduced a trap composed of 113 places in 646 ms of which 6 ms to minimize.
[2024-06-01 00:38:54] [INFO ] Deduced a trap composed of 121 places in 643 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-06-01 00:38:55] [INFO ] Deduced a trap composed of 133 places in 534 ms of which 5 ms to minimize.
[2024-06-01 00:38:56] [INFO ] Deduced a trap composed of 133 places in 572 ms of which 5 ms to minimize.
[2024-06-01 00:38:56] [INFO ] Deduced a trap composed of 143 places in 632 ms of which 5 ms to minimize.
[2024-06-01 00:38:57] [INFO ] Deduced a trap composed of 48 places in 609 ms of which 5 ms to minimize.
[2024-06-01 00:38:58] [INFO ] Deduced a trap composed of 116 places in 608 ms of which 5 ms to minimize.
[2024-06-01 00:38:58] [INFO ] Deduced a trap composed of 61 places in 582 ms of which 5 ms to minimize.
[2024-06-01 00:38:59] [INFO ] Deduced a trap composed of 87 places in 634 ms of which 5 ms to minimize.
[2024-06-01 00:39:00] [INFO ] Deduced a trap composed of 125 places in 642 ms of which 5 ms to minimize.
[2024-06-01 00:39:01] [INFO ] Deduced a trap composed of 110 places in 638 ms of which 5 ms to minimize.
[2024-06-01 00:39:01] [INFO ] Deduced a trap composed of 122 places in 588 ms of which 5 ms to minimize.
[2024-06-01 00:39:02] [INFO ] Deduced a trap composed of 88 places in 615 ms of which 5 ms to minimize.
[2024-06-01 00:39:02] [INFO ] Deduced a trap composed of 119 places in 608 ms of which 5 ms to minimize.
[2024-06-01 00:39:03] [INFO ] Deduced a trap composed of 88 places in 628 ms of which 5 ms to minimize.
[2024-06-01 00:39:04] [INFO ] Deduced a trap composed of 71 places in 646 ms of which 5 ms to minimize.
[2024-06-01 00:39:04] [INFO ] Deduced a trap composed of 99 places in 632 ms of which 5 ms to minimize.
[2024-06-01 00:39:05] [INFO ] Deduced a trap composed of 62 places in 634 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 16/39 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-06-01 00:39:06] [INFO ] Deduced a trap composed of 57 places in 651 ms of which 5 ms to minimize.
[2024-06-01 00:39:07] [INFO ] Deduced a trap composed of 65 places in 577 ms of which 5 ms to minimize.
[2024-06-01 00:39:07] [INFO ] Deduced a trap composed of 67 places in 604 ms of which 5 ms to minimize.
[2024-06-01 00:39:08] [INFO ] Deduced a trap composed of 86 places in 609 ms of which 4 ms to minimize.
[2024-06-01 00:39:09] [INFO ] Deduced a trap composed of 95 places in 535 ms of which 4 ms to minimize.
[2024-06-01 00:39:09] [INFO ] Deduced a trap composed of 72 places in 571 ms of which 5 ms to minimize.
[2024-06-01 00:39:10] [INFO ] Deduced a trap composed of 104 places in 518 ms of which 4 ms to minimize.
[2024-06-01 00:39:10] [INFO ] Deduced a trap composed of 87 places in 589 ms of which 5 ms to minimize.
[2024-06-01 00:39:11] [INFO ] Deduced a trap composed of 70 places in 632 ms of which 5 ms to minimize.
[2024-06-01 00:39:12] [INFO ] Deduced a trap composed of 77 places in 581 ms of which 5 ms to minimize.
[2024-06-01 00:39:12] [INFO ] Deduced a trap composed of 129 places in 641 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 11/50 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-06-01 00:39:14] [INFO ] Deduced a trap composed of 97 places in 623 ms of which 5 ms to minimize.
[2024-06-01 00:39:15] [INFO ] Deduced a trap composed of 94 places in 614 ms of which 5 ms to minimize.
[2024-06-01 00:39:16] [INFO ] Deduced a trap composed of 92 places in 639 ms of which 5 ms to minimize.
[2024-06-01 00:39:16] [INFO ] Deduced a trap composed of 89 places in 596 ms of which 5 ms to minimize.
[2024-06-01 00:39:17] [INFO ] Deduced a trap composed of 84 places in 608 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 5/55 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-06-01 00:39:18] [INFO ] Deduced a trap composed of 78 places in 638 ms of which 5 ms to minimize.
[2024-06-01 00:39:19] [INFO ] Deduced a trap composed of 57 places in 614 ms of which 5 ms to minimize.
[2024-06-01 00:39:20] [INFO ] Deduced a trap composed of 66 places in 531 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/301 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 10 (OVERLAPS) 1/302 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-06-01 00:39:23] [INFO ] Deduced a trap composed of 88 places in 641 ms of which 5 ms to minimize.
[2024-06-01 00:39:23] [INFO ] Deduced a trap composed of 77 places in 644 ms of which 5 ms to minimize.
[2024-06-01 00:39:24] [INFO ] Deduced a trap composed of 122 places in 556 ms of which 5 ms to minimize.
[2024-06-01 00:39:25] [INFO ] Deduced a trap composed of 65 places in 640 ms of which 5 ms to minimize.
[2024-06-01 00:39:25] [INFO ] Deduced a trap composed of 74 places in 630 ms of which 5 ms to minimize.
[2024-06-01 00:39:26] [INFO ] Deduced a trap composed of 58 places in 632 ms of which 5 ms to minimize.
[2024-06-01 00:39:27] [INFO ] Deduced a trap composed of 97 places in 602 ms of which 4 ms to minimize.
[2024-06-01 00:39:27] [INFO ] Deduced a trap composed of 114 places in 482 ms of which 3 ms to minimize.
[2024-06-01 00:39:28] [INFO ] Deduced a trap composed of 113 places in 467 ms of which 5 ms to minimize.
[2024-06-01 00:39:29] [INFO ] Deduced a trap composed of 61 places in 625 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/302 variables, 10/69 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-06-01 00:39:30] [INFO ] Deduced a trap composed of 117 places in 543 ms of which 5 ms to minimize.
[2024-06-01 00:39:30] [INFO ] Deduced a trap composed of 80 places in 628 ms of which 5 ms to minimize.
[2024-06-01 00:39:31] [INFO ] Deduced a trap composed of 131 places in 622 ms of which 5 ms to minimize.
[2024-06-01 00:39:32] [INFO ] Deduced a trap composed of 80 places in 568 ms of which 5 ms to minimize.
[2024-06-01 00:39:32] [INFO ] Deduced a trap composed of 84 places in 579 ms of which 4 ms to minimize.
[2024-06-01 00:39:33] [INFO ] Deduced a trap composed of 85 places in 476 ms of which 4 ms to minimize.
[2024-06-01 00:39:33] [INFO ] Deduced a trap composed of 62 places in 550 ms of which 5 ms to minimize.
[2024-06-01 00:39:34] [INFO ] Deduced a trap composed of 114 places in 524 ms of which 5 ms to minimize.
[2024-06-01 00:39:34] [INFO ] Deduced a trap composed of 51 places in 634 ms of which 5 ms to minimize.
[2024-06-01 00:39:35] [INFO ] Deduced a trap composed of 62 places in 620 ms of which 5 ms to minimize.
[2024-06-01 00:39:36] [INFO ] Deduced a trap composed of 97 places in 651 ms of which 5 ms to minimize.
[2024-06-01 00:39:37] [INFO ] Deduced a trap composed of 72 places in 648 ms of which 5 ms to minimize.
[2024-06-01 00:39:38] [INFO ] Deduced a trap composed of 99 places in 654 ms of which 5 ms to minimize.
[2024-06-01 00:39:38] [INFO ] Deduced a trap composed of 95 places in 633 ms of which 5 ms to minimize.
[2024-06-01 00:39:39] [INFO ] Deduced a trap composed of 70 places in 652 ms of which 5 ms to minimize.
[2024-06-01 00:39:40] [INFO ] Deduced a trap composed of 113 places in 629 ms of which 5 ms to minimize.
[2024-06-01 00:39:40] [INFO ] Deduced a trap composed of 69 places in 526 ms of which 3 ms to minimize.
[2024-06-01 00:39:41] [INFO ] Deduced a trap composed of 64 places in 443 ms of which 5 ms to minimize.
[2024-06-01 00:39:41] [INFO ] Deduced a trap composed of 56 places in 575 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/302 variables, 19/88 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-06-01 00:39:43] [INFO ] Deduced a trap composed of 97 places in 624 ms of which 5 ms to minimize.
[2024-06-01 00:39:44] [INFO ] Deduced a trap composed of 84 places in 643 ms of which 5 ms to minimize.
[2024-06-01 00:39:44] [INFO ] Deduced a trap composed of 117 places in 630 ms of which 5 ms to minimize.
[2024-06-01 00:39:45] [INFO ] Deduced a trap composed of 126 places in 617 ms of which 5 ms to minimize.
[2024-06-01 00:39:46] [INFO ] Deduced a trap composed of 106 places in 645 ms of which 5 ms to minimize.
[2024-06-01 00:39:46] [INFO ] Deduced a trap composed of 110 places in 592 ms of which 5 ms to minimize.
[2024-06-01 00:39:47] [INFO ] Deduced a trap composed of 127 places in 639 ms of which 12 ms to minimize.
[2024-06-01 00:39:48] [INFO ] Deduced a trap composed of 131 places in 613 ms of which 6 ms to minimize.
[2024-06-01 00:39:49] [INFO ] Deduced a trap composed of 73 places in 625 ms of which 5 ms to minimize.
[2024-06-01 00:39:49] [INFO ] Deduced a trap composed of 92 places in 641 ms of which 5 ms to minimize.
[2024-06-01 00:39:50] [INFO ] Deduced a trap composed of 110 places in 622 ms of which 5 ms to minimize.
[2024-06-01 00:39:51] [INFO ] Deduced a trap composed of 111 places in 611 ms of which 5 ms to minimize.
[2024-06-01 00:39:51] [INFO ] Deduced a trap composed of 56 places in 616 ms of which 5 ms to minimize.
[2024-06-01 00:39:52] [INFO ] Deduced a trap composed of 92 places in 625 ms of which 5 ms to minimize.
[2024-06-01 00:39:53] [INFO ] Deduced a trap composed of 92 places in 602 ms of which 5 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/302 variables, 15/103 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/302 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 15 (OVERLAPS) 1478/1780 variables, 302/405 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1780 variables, 90/495 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1780 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 18 (OVERLAPS) 0/1780 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1780/1780 variables, and 495 constraints, problems are : Problem set: 0 solved, 44 unsolved in 76545 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 302/302 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 81/81 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (OVERLAPS) 236/275 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 26/301 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 78/99 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-06-01 00:40:09] [INFO ] Deduced a trap composed of 72 places in 393 ms of which 3 ms to minimize.
[2024-06-01 00:40:10] [INFO ] Deduced a trap composed of 147 places in 406 ms of which 3 ms to minimize.
[2024-06-01 00:40:10] [INFO ] Deduced a trap composed of 106 places in 398 ms of which 3 ms to minimize.
[2024-06-01 00:40:11] [INFO ] Deduced a trap composed of 109 places in 355 ms of which 3 ms to minimize.
[2024-06-01 00:40:11] [INFO ] Deduced a trap composed of 93 places in 419 ms of which 4 ms to minimize.
[2024-06-01 00:40:12] [INFO ] Deduced a trap composed of 103 places in 567 ms of which 4 ms to minimize.
[2024-06-01 00:40:12] [INFO ] Deduced a trap composed of 85 places in 497 ms of which 3 ms to minimize.
[2024-06-01 00:40:13] [INFO ] Deduced a trap composed of 98 places in 424 ms of which 5 ms to minimize.
[2024-06-01 00:40:13] [INFO ] Deduced a trap composed of 85 places in 588 ms of which 4 ms to minimize.
[2024-06-01 00:40:14] [INFO ] Deduced a trap composed of 66 places in 593 ms of which 4 ms to minimize.
[2024-06-01 00:40:14] [INFO ] Deduced a trap composed of 65 places in 461 ms of which 4 ms to minimize.
[2024-06-01 00:40:15] [INFO ] Deduced a trap composed of 59 places in 590 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 12/111 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 1/302 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/302 variables, 3/115 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-06-01 00:40:18] [INFO ] Deduced a trap composed of 67 places in 559 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/302 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-06-01 00:40:20] [INFO ] Deduced a trap composed of 65 places in 424 ms of which 4 ms to minimize.
[2024-06-01 00:40:21] [INFO ] Deduced a trap composed of 119 places in 534 ms of which 4 ms to minimize.
[2024-06-01 00:40:22] [INFO ] Deduced a trap composed of 89 places in 609 ms of which 4 ms to minimize.
[2024-06-01 00:40:22] [INFO ] Deduced a trap composed of 97 places in 564 ms of which 4 ms to minimize.
[2024-06-01 00:40:23] [INFO ] Deduced a trap composed of 86 places in 543 ms of which 4 ms to minimize.
[2024-06-01 00:40:23] [INFO ] Deduced a trap composed of 81 places in 510 ms of which 3 ms to minimize.
[2024-06-01 00:40:24] [INFO ] Deduced a trap composed of 79 places in 463 ms of which 4 ms to minimize.
[2024-06-01 00:40:24] [INFO ] Deduced a trap composed of 39 places in 490 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/302 variables, 8/124 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/302 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 12 (OVERLAPS) 1478/1780 variables, 302/426 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1780 variables, 90/516 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1780 variables, 44/560 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1780 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 16 (OVERLAPS) 0/1780 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1780/1780 variables, and 560 constraints, problems are : Problem set: 0 solved, 44 unsolved in 49148 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 302/302 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 102/102 constraints]
After SMT, in 125818ms problems are : Problem set: 0 solved, 44 unsolved
Parikh walk visited 2 properties in 10165 ms.
Support contains 38 out of 302 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 302/302 places, 1478/1478 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 285 transition count 1155
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 285 transition count 1155
Applied a total of 34 rules in 24 ms. Remains 285 /302 variables (removed 17) and now considering 1155/1478 (removed 323) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 285/302 places, 1155/1478 transitions.
RANDOM walk for 3975196 steps (8 resets) in 102739 ms. (38 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400002 steps (8 resets) in 3001 ms. (133 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2965 ms. (134 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2651 ms. (150 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3216 ms. (124 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3501 ms. (114 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2893 ms. (138 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3154 ms. (126 steps per ms) remains 41/42 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3272 ms. (122 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3339 ms. (119 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400002 steps (8 resets) in 3532 ms. (113 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400002 steps (8 resets) in 3542 ms. (112 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3566 ms. (112 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2692 ms. (148 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3299 ms. (121 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3078 ms. (129 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2713 ms. (147 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400002 steps (8 resets) in 3131 ms. (127 steps per ms) remains 40/41 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3381 ms. (118 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400002 steps (8 resets) in 3192 ms. (125 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3169 ms. (126 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3146 ms. (127 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2837 ms. (140 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2684 ms. (148 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2870 ms. (139 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3226 ms. (123 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400001 steps (8 resets) in 2885 ms. (138 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3102 ms. (128 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400002 steps (8 resets) in 3767 ms. (106 steps per ms) remains 40/40 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3633 ms. (110 steps per ms) remains 39/40 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3324 ms. (120 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3509 ms. (113 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3189 ms. (125 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2597 ms. (153 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3210 ms. (124 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400001 steps (8 resets) in 3462 ms. (115 steps per ms) remains 36/39 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3094 ms. (129 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3095 ms. (129 steps per ms) remains 36/36 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3098 ms. (129 steps per ms) remains 34/36 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3068 ms. (130 steps per ms) remains 34/34 properties
// Phase 1: matrix 1155 rows 285 cols
[2024-06-01 00:42:24] [INFO ] Computed 22 invariants in 10 ms
[2024-06-01 00:42:24] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 225/257 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/257 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (OVERLAPS) 27/284 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-06-01 00:42:26] [INFO ] Deduced a trap composed of 68 places in 519 ms of which 6 ms to minimize.
[2024-06-01 00:42:26] [INFO ] Deduced a trap composed of 72 places in 523 ms of which 4 ms to minimize.
[2024-06-01 00:42:27] [INFO ] Deduced a trap composed of 93 places in 519 ms of which 5 ms to minimize.
[2024-06-01 00:42:28] [INFO ] Deduced a trap composed of 72 places in 525 ms of which 5 ms to minimize.
[2024-06-01 00:42:28] [INFO ] Deduced a trap composed of 111 places in 548 ms of which 5 ms to minimize.
[2024-06-01 00:42:29] [INFO ] Deduced a trap composed of 87 places in 508 ms of which 5 ms to minimize.
[2024-06-01 00:42:29] [INFO ] Deduced a trap composed of 120 places in 527 ms of which 5 ms to minimize.
[2024-06-01 00:42:30] [INFO ] Deduced a trap composed of 119 places in 526 ms of which 5 ms to minimize.
[2024-06-01 00:42:30] [INFO ] Deduced a trap composed of 121 places in 532 ms of which 5 ms to minimize.
[2024-06-01 00:42:31] [INFO ] Deduced a trap composed of 111 places in 544 ms of which 5 ms to minimize.
[2024-06-01 00:42:31] [INFO ] Deduced a trap composed of 89 places in 539 ms of which 5 ms to minimize.
[2024-06-01 00:42:32] [INFO ] Deduced a trap composed of 113 places in 530 ms of which 5 ms to minimize.
[2024-06-01 00:42:33] [INFO ] Deduced a trap composed of 89 places in 516 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 13/34 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-06-01 00:42:34] [INFO ] Deduced a trap composed of 64 places in 542 ms of which 5 ms to minimize.
[2024-06-01 00:42:34] [INFO ] Deduced a trap composed of 48 places in 543 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (OVERLAPS) 1/285 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-06-01 00:42:36] [INFO ] Deduced a trap composed of 72 places in 271 ms of which 3 ms to minimize.
[2024-06-01 00:42:36] [INFO ] Deduced a trap composed of 112 places in 481 ms of which 5 ms to minimize.
[2024-06-01 00:42:37] [INFO ] Deduced a trap composed of 79 places in 556 ms of which 5 ms to minimize.
[2024-06-01 00:42:38] [INFO ] Deduced a trap composed of 102 places in 566 ms of which 5 ms to minimize.
[2024-06-01 00:42:38] [INFO ] Deduced a trap composed of 87 places in 573 ms of which 5 ms to minimize.
[2024-06-01 00:42:39] [INFO ] Deduced a trap composed of 104 places in 560 ms of which 5 ms to minimize.
[2024-06-01 00:42:39] [INFO ] Deduced a trap composed of 82 places in 539 ms of which 5 ms to minimize.
[2024-06-01 00:42:40] [INFO ] Deduced a trap composed of 83 places in 487 ms of which 5 ms to minimize.
[2024-06-01 00:42:40] [INFO ] Deduced a trap composed of 90 places in 506 ms of which 5 ms to minimize.
[2024-06-01 00:42:41] [INFO ] Deduced a trap composed of 73 places in 554 ms of which 5 ms to minimize.
[2024-06-01 00:42:42] [INFO ] Deduced a trap composed of 63 places in 525 ms of which 5 ms to minimize.
[2024-06-01 00:42:42] [INFO ] Deduced a trap composed of 111 places in 539 ms of which 5 ms to minimize.
[2024-06-01 00:42:43] [INFO ] Deduced a trap composed of 90 places in 543 ms of which 5 ms to minimize.
[2024-06-01 00:42:43] [INFO ] Deduced a trap composed of 69 places in 553 ms of which 5 ms to minimize.
[2024-06-01 00:42:44] [INFO ] Deduced a trap composed of 106 places in 544 ms of which 5 ms to minimize.
[2024-06-01 00:42:44] [INFO ] Deduced a trap composed of 116 places in 533 ms of which 5 ms to minimize.
[2024-06-01 00:42:45] [INFO ] Deduced a trap composed of 98 places in 539 ms of which 4 ms to minimize.
[2024-06-01 00:42:45] [INFO ] Deduced a trap composed of 63 places in 535 ms of which 4 ms to minimize.
[2024-06-01 00:42:46] [INFO ] Deduced a trap composed of 96 places in 548 ms of which 5 ms to minimize.
[2024-06-01 00:42:47] [INFO ] Deduced a trap composed of 66 places in 539 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/285 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/285 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 10 (OVERLAPS) 1155/1440 variables, 285/342 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1440 variables, 90/432 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1440 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 13 (OVERLAPS) 0/1440 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1440/1440 variables, and 432 constraints, problems are : Problem set: 0 solved, 34 unsolved in 29886 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 285/285 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 34 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 225/257 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/257 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (OVERLAPS) 27/284 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 34/55 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (OVERLAPS) 1/285 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-06-01 00:42:57] [INFO ] Deduced a trap composed of 140 places in 547 ms of which 5 ms to minimize.
[2024-06-01 00:42:57] [INFO ] Deduced a trap composed of 136 places in 508 ms of which 5 ms to minimize.
[2024-06-01 00:42:58] [INFO ] Deduced a trap composed of 73 places in 540 ms of which 5 ms to minimize.
[2024-06-01 00:42:58] [INFO ] Deduced a trap composed of 129 places in 531 ms of which 4 ms to minimize.
[2024-06-01 00:42:59] [INFO ] Deduced a trap composed of 73 places in 541 ms of which 5 ms to minimize.
[2024-06-01 00:42:59] [INFO ] Deduced a trap composed of 101 places in 538 ms of which 5 ms to minimize.
[2024-06-01 00:43:00] [INFO ] Deduced a trap composed of 47 places in 539 ms of which 5 ms to minimize.
[2024-06-01 00:43:01] [INFO ] Deduced a trap composed of 132 places in 549 ms of which 5 ms to minimize.
[2024-06-01 00:43:01] [INFO ] Deduced a trap composed of 68 places in 547 ms of which 5 ms to minimize.
[2024-06-01 00:43:02] [INFO ] Deduced a trap composed of 115 places in 518 ms of which 5 ms to minimize.
[2024-06-01 00:43:02] [INFO ] Deduced a trap composed of 97 places in 529 ms of which 4 ms to minimize.
[2024-06-01 00:43:03] [INFO ] Deduced a trap composed of 94 places in 542 ms of which 5 ms to minimize.
[2024-06-01 00:43:03] [INFO ] Deduced a trap composed of 135 places in 522 ms of which 5 ms to minimize.
[2024-06-01 00:43:04] [INFO ] Deduced a trap composed of 105 places in 530 ms of which 5 ms to minimize.
[2024-06-01 00:43:05] [INFO ] Deduced a trap composed of 142 places in 522 ms of which 5 ms to minimize.
[2024-06-01 00:43:05] [INFO ] Deduced a trap composed of 71 places in 522 ms of which 4 ms to minimize.
[2024-06-01 00:43:06] [INFO ] Deduced a trap composed of 79 places in 486 ms of which 4 ms to minimize.
[2024-06-01 00:43:06] [INFO ] Deduced a trap composed of 70 places in 519 ms of which 5 ms to minimize.
[2024-06-01 00:43:07] [INFO ] Deduced a trap composed of 96 places in 521 ms of which 5 ms to minimize.
[2024-06-01 00:43:07] [INFO ] Deduced a trap composed of 63 places in 522 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/285 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-06-01 00:43:09] [INFO ] Deduced a trap composed of 39 places in 463 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/285 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/285 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 11 (OVERLAPS) 1155/1440 variables, 285/363 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1440 variables, 90/453 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1440 variables, 34/487 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1440 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 15 (OVERLAPS) 0/1440 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1440/1440 variables, and 487 constraints, problems are : Problem set: 0 solved, 34 unsolved in 33340 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 285/285 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 56/56 constraints]
After SMT, in 63310ms problems are : Problem set: 0 solved, 34 unsolved
Parikh walk visited 6 properties in 12537 ms.
Support contains 26 out of 285 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 285/285 places, 1155/1155 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 274 transition count 946
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 274 transition count 946
Applied a total of 22 rules in 29 ms. Remains 274 /285 variables (removed 11) and now considering 946/1155 (removed 209) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 274/285 places, 946/1155 transitions.
RANDOM walk for 4000000 steps (8 resets) in 80879 ms. (49 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2893 ms. (138 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2578 ms. (155 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2339 ms. (170 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2702 ms. (147 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2655 ms. (150 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2466 ms. (162 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2296 ms. (174 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3003 ms. (133 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2941 ms. (135 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2285 ms. (174 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400001 steps (8 resets) in 2524 ms. (158 steps per ms) remains 27/28 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2189 ms. (182 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2236 ms. (178 steps per ms) remains 26/27 properties
BEST_FIRST walk for 400001 steps (8 resets) in 2633 ms. (151 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2932 ms. (136 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2692 ms. (148 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3007 ms. (132 steps per ms) remains 25/26 properties
BEST_FIRST walk for 400002 steps (8 resets) in 3087 ms. (129 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3055 ms. (130 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2889 ms. (138 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2760 ms. (144 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2714 ms. (147 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2619 ms. (152 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2754 ms. (145 steps per ms) remains 24/25 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3379 ms. (118 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400002 steps (8 resets) in 3034 ms. (131 steps per ms) remains 23/24 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3355 ms. (119 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2635 ms. (151 steps per ms) remains 23/23 properties
// Phase 1: matrix 946 rows 274 cols
[2024-06-01 00:44:32] [INFO ] Computed 22 invariants in 7 ms
[2024-06-01 00:44:32] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 178/201 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 70/271 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-06-01 00:44:33] [INFO ] Deduced a trap composed of 84 places in 481 ms of which 5 ms to minimize.
[2024-06-01 00:44:34] [INFO ] Deduced a trap composed of 112 places in 484 ms of which 5 ms to minimize.
[2024-06-01 00:44:34] [INFO ] Deduced a trap composed of 107 places in 466 ms of which 4 ms to minimize.
[2024-06-01 00:44:35] [INFO ] Deduced a trap composed of 89 places in 380 ms of which 4 ms to minimize.
[2024-06-01 00:44:35] [INFO ] Deduced a trap composed of 72 places in 263 ms of which 3 ms to minimize.
[2024-06-01 00:44:35] [INFO ] Deduced a trap composed of 104 places in 316 ms of which 4 ms to minimize.
[2024-06-01 00:44:36] [INFO ] Deduced a trap composed of 110 places in 452 ms of which 5 ms to minimize.
[2024-06-01 00:44:36] [INFO ] Deduced a trap composed of 70 places in 476 ms of which 4 ms to minimize.
[2024-06-01 00:44:37] [INFO ] Deduced a trap composed of 50 places in 398 ms of which 4 ms to minimize.
[2024-06-01 00:44:37] [INFO ] Deduced a trap composed of 71 places in 451 ms of which 5 ms to minimize.
[2024-06-01 00:44:38] [INFO ] Deduced a trap composed of 76 places in 403 ms of which 5 ms to minimize.
[2024-06-01 00:44:38] [INFO ] Deduced a trap composed of 43 places in 458 ms of which 5 ms to minimize.
[2024-06-01 00:44:39] [INFO ] Deduced a trap composed of 59 places in 428 ms of which 5 ms to minimize.
[2024-06-01 00:44:39] [INFO ] Deduced a trap composed of 94 places in 454 ms of which 5 ms to minimize.
[2024-06-01 00:44:40] [INFO ] Deduced a trap composed of 63 places in 470 ms of which 5 ms to minimize.
[2024-06-01 00:44:40] [INFO ] Deduced a trap composed of 85 places in 476 ms of which 4 ms to minimize.
[2024-06-01 00:44:40] [INFO ] Deduced a trap composed of 61 places in 421 ms of which 4 ms to minimize.
[2024-06-01 00:44:41] [INFO ] Deduced a trap composed of 59 places in 452 ms of which 4 ms to minimize.
[2024-06-01 00:44:41] [INFO ] Deduced a trap composed of 68 places in 461 ms of which 5 ms to minimize.
[2024-06-01 00:44:42] [INFO ] Deduced a trap composed of 75 places in 458 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-06-01 00:44:43] [INFO ] Deduced a trap composed of 87 places in 457 ms of which 4 ms to minimize.
[2024-06-01 00:44:43] [INFO ] Deduced a trap composed of 84 places in 406 ms of which 3 ms to minimize.
[2024-06-01 00:44:43] [INFO ] Deduced a trap composed of 45 places in 267 ms of which 3 ms to minimize.
[2024-06-01 00:44:44] [INFO ] Deduced a trap composed of 100 places in 417 ms of which 5 ms to minimize.
[2024-06-01 00:44:44] [INFO ] Deduced a trap composed of 90 places in 395 ms of which 4 ms to minimize.
[2024-06-01 00:44:45] [INFO ] Deduced a trap composed of 84 places in 410 ms of which 4 ms to minimize.
[2024-06-01 00:44:45] [INFO ] Deduced a trap composed of 82 places in 434 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/271 variables, 7/46 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-06-01 00:44:46] [INFO ] Deduced a trap composed of 39 places in 430 ms of which 5 ms to minimize.
[2024-06-01 00:44:46] [INFO ] Deduced a trap composed of 40 places in 428 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/271 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/271 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 3/274 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (OVERLAPS) 946/1220 variables, 274/325 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1220 variables, 90/415 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1220 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 13 (OVERLAPS) 0/1220 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1220/1220 variables, and 415 constraints, problems are : Problem set: 0 solved, 23 unsolved in 18904 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 274/274 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 178/201 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 70/271 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 29/48 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/271 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 3/274 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 946/1220 variables, 274/325 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1220 variables, 90/415 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1220 variables, 23/438 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1220 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 12 (OVERLAPS) 0/1220 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1220/1220 variables, and 438 constraints, problems are : Problem set: 0 solved, 23 unsolved in 9348 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 274/274 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 29/29 constraints]
After SMT, in 28339ms problems are : Problem set: 0 solved, 23 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 23 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 946/946 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 271 transition count 889
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 271 transition count 889
Applied a total of 6 rules in 19 ms. Remains 271 /274 variables (removed 3) and now considering 889/946 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 271/274 places, 889/946 transitions.
RANDOM walk for 4000000 steps (8 resets) in 80235 ms. (49 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3032 ms. (131 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2856 ms. (140 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2834 ms. (141 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2994 ms. (133 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2968 ms. (134 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400001 steps (8 resets) in 3125 ms. (127 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3038 ms. (131 steps per ms) remains 22/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2869 ms. (139 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3000 ms. (133 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2913 ms. (137 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2601 ms. (153 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1993 ms. (200 steps per ms) remains 21/22 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3125 ms. (127 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3674 ms. (108 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2403 ms. (166 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2640 ms. (151 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3467 ms. (115 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2480 ms. (161 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2417 ms. (165 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2978 ms. (134 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2626 ms. (152 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2632 ms. (151 steps per ms) remains 20/21 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2620 ms. (152 steps per ms) remains 19/20 properties
// Phase 1: matrix 889 rows 271 cols
[2024-06-01 00:45:51] [INFO ] Computed 22 invariants in 4 ms
[2024-06-01 00:45:51] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 178/198 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 70/268 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-01 00:45:51] [INFO ] Deduced a trap composed of 103 places in 268 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 3/271 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-01 00:45:52] [INFO ] Deduced a trap composed of 82 places in 372 ms of which 3 ms to minimize.
[2024-06-01 00:45:53] [INFO ] Deduced a trap composed of 99 places in 341 ms of which 3 ms to minimize.
[2024-06-01 00:45:53] [INFO ] Deduced a trap composed of 107 places in 303 ms of which 3 ms to minimize.
[2024-06-01 00:45:53] [INFO ] Deduced a trap composed of 120 places in 286 ms of which 3 ms to minimize.
[2024-06-01 00:45:53] [INFO ] Deduced a trap composed of 99 places in 295 ms of which 3 ms to minimize.
[2024-06-01 00:45:54] [INFO ] Deduced a trap composed of 87 places in 293 ms of which 3 ms to minimize.
[2024-06-01 00:45:54] [INFO ] Deduced a trap composed of 94 places in 277 ms of which 4 ms to minimize.
[2024-06-01 00:45:54] [INFO ] Deduced a trap composed of 84 places in 400 ms of which 5 ms to minimize.
[2024-06-01 00:45:55] [INFO ] Deduced a trap composed of 99 places in 331 ms of which 3 ms to minimize.
[2024-06-01 00:45:55] [INFO ] Deduced a trap composed of 106 places in 318 ms of which 3 ms to minimize.
[2024-06-01 00:45:55] [INFO ] Deduced a trap composed of 60 places in 292 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/271 variables, 11/34 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 889/1160 variables, 271/305 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1160 variables, 90/395 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1160 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 19 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/1160 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1160/1160 variables, and 395 constraints, problems are : Problem set: 0 solved, 19 unsolved in 6824 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 271/271 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 178/198 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 70/268 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 11/30 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 3/271 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/271 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 889/1160 variables, 271/305 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1160 variables, 90/395 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1160 variables, 19/414 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1160 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (OVERLAPS) 0/1160 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1160/1160 variables, and 414 constraints, problems are : Problem set: 0 solved, 19 unsolved in 4083 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 271/271 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 12/12 constraints]
After SMT, in 10953ms problems are : Problem set: 0 solved, 19 unsolved
Parikh walk visited 0 properties in 2108 ms.
Support contains 20 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 889/889 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 269 transition count 851
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 269 transition count 851
Applied a total of 4 rules in 17 ms. Remains 269 /271 variables (removed 2) and now considering 851/889 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 269/271 places, 851/889 transitions.
RANDOM walk for 4000000 steps (8 resets) in 80935 ms. (49 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2390 ms. (167 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2341 ms. (170 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (8 resets) in 3168 ms. (126 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2674 ms. (149 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3018 ms. (132 steps per ms) remains 18/19 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2680 ms. (149 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2093 ms. (191 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2196 ms. (182 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2770 ms. (144 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (8 resets) in 3015 ms. (132 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2748 ms. (145 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2503 ms. (159 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2092 ms. (191 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2635 ms. (151 steps per ms) remains 17/18 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3261 ms. (122 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2924 ms. (136 steps per ms) remains 16/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2476 ms. (161 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2451 ms. (163 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400001 steps (8 resets) in 2239 ms. (178 steps per ms) remains 16/16 properties
// Phase 1: matrix 851 rows 269 cols
[2024-06-01 00:46:52] [INFO ] Computed 22 invariants in 5 ms
[2024-06-01 00:46:52] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 156/173 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 92/265 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 00:46:52] [INFO ] Deduced a trap composed of 78 places in 265 ms of which 3 ms to minimize.
[2024-06-01 00:46:53] [INFO ] Deduced a trap composed of 106 places in 343 ms of which 4 ms to minimize.
[2024-06-01 00:46:53] [INFO ] Deduced a trap composed of 99 places in 277 ms of which 3 ms to minimize.
[2024-06-01 00:46:53] [INFO ] Deduced a trap composed of 98 places in 266 ms of which 3 ms to minimize.
[2024-06-01 00:46:54] [INFO ] Deduced a trap composed of 57 places in 231 ms of which 3 ms to minimize.
[2024-06-01 00:46:54] [INFO ] Deduced a trap composed of 99 places in 253 ms of which 3 ms to minimize.
[2024-06-01 00:46:54] [INFO ] Deduced a trap composed of 115 places in 397 ms of which 5 ms to minimize.
[2024-06-01 00:46:55] [INFO ] Deduced a trap composed of 107 places in 350 ms of which 4 ms to minimize.
[2024-06-01 00:46:55] [INFO ] Deduced a trap composed of 80 places in 365 ms of which 3 ms to minimize.
[2024-06-01 00:46:55] [INFO ] Deduced a trap composed of 120 places in 275 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 10/28 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 4/269 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 00:46:56] [INFO ] Deduced a trap composed of 100 places in 374 ms of which 3 ms to minimize.
[2024-06-01 00:46:56] [INFO ] Deduced a trap composed of 116 places in 294 ms of which 3 ms to minimize.
[2024-06-01 00:46:57] [INFO ] Deduced a trap composed of 82 places in 305 ms of which 3 ms to minimize.
[2024-06-01 00:46:57] [INFO ] Deduced a trap composed of 69 places in 295 ms of which 3 ms to minimize.
[2024-06-01 00:46:57] [INFO ] Deduced a trap composed of 50 places in 288 ms of which 3 ms to minimize.
[2024-06-01 00:46:58] [INFO ] Deduced a trap composed of 64 places in 297 ms of which 3 ms to minimize.
[2024-06-01 00:46:58] [INFO ] Deduced a trap composed of 84 places in 282 ms of which 3 ms to minimize.
[2024-06-01 00:46:58] [INFO ] Deduced a trap composed of 88 places in 450 ms of which 5 ms to minimize.
[2024-06-01 00:46:59] [INFO ] Deduced a trap composed of 56 places in 473 ms of which 4 ms to minimize.
[2024-06-01 00:46:59] [INFO ] Deduced a trap composed of 56 places in 320 ms of which 3 ms to minimize.
[2024-06-01 00:47:00] [INFO ] Deduced a trap composed of 76 places in 296 ms of which 3 ms to minimize.
[2024-06-01 00:47:00] [INFO ] Deduced a trap composed of 86 places in 295 ms of which 3 ms to minimize.
[2024-06-01 00:47:00] [INFO ] Deduced a trap composed of 77 places in 338 ms of which 4 ms to minimize.
[2024-06-01 00:47:01] [INFO ] Deduced a trap composed of 106 places in 366 ms of which 3 ms to minimize.
[2024-06-01 00:47:01] [INFO ] Deduced a trap composed of 80 places in 290 ms of which 3 ms to minimize.
[2024-06-01 00:47:01] [INFO ] Deduced a trap composed of 61 places in 284 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 16/48 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 851/1120 variables, 269/317 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1120 variables, 90/407 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1120 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/1120 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1120/1120 variables, and 407 constraints, problems are : Problem set: 0 solved, 16 unsolved in 11576 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 269/269 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 156/173 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 92/265 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 00:47:04] [INFO ] Deduced a trap composed of 99 places in 378 ms of which 4 ms to minimize.
[2024-06-01 00:47:05] [INFO ] Deduced a trap composed of 88 places in 371 ms of which 4 ms to minimize.
[2024-06-01 00:47:05] [INFO ] Deduced a trap composed of 83 places in 350 ms of which 3 ms to minimize.
[2024-06-01 00:47:05] [INFO ] Deduced a trap composed of 78 places in 281 ms of which 3 ms to minimize.
[2024-06-01 00:47:06] [INFO ] Deduced a trap composed of 70 places in 288 ms of which 4 ms to minimize.
[2024-06-01 00:47:06] [INFO ] Deduced a trap composed of 85 places in 381 ms of which 4 ms to minimize.
[2024-06-01 00:47:06] [INFO ] Deduced a trap composed of 83 places in 310 ms of which 3 ms to minimize.
[2024-06-01 00:47:07] [INFO ] Deduced a trap composed of 75 places in 281 ms of which 2 ms to minimize.
[2024-06-01 00:47:07] [INFO ] Deduced a trap composed of 57 places in 275 ms of which 3 ms to minimize.
[2024-06-01 00:47:07] [INFO ] Deduced a trap composed of 63 places in 310 ms of which 4 ms to minimize.
[2024-06-01 00:47:08] [INFO ] Deduced a trap composed of 83 places in 375 ms of which 4 ms to minimize.
[2024-06-01 00:47:08] [INFO ] Deduced a trap composed of 56 places in 368 ms of which 4 ms to minimize.
[2024-06-01 00:47:08] [INFO ] Deduced a trap composed of 69 places in 289 ms of which 3 ms to minimize.
[2024-06-01 00:47:08] [INFO ] Deduced a trap composed of 77 places in 265 ms of which 3 ms to minimize.
[2024-06-01 00:47:09] [INFO ] Deduced a trap composed of 89 places in 408 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 4/269 variables, 4/59 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 851/1120 variables, 269/332 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1120 variables, 90/422 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1120 variables, 16/438 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1120 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (OVERLAPS) 0/1120 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1120/1120 variables, and 438 constraints, problems are : Problem set: 0 solved, 16 unsolved in 9750 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 269/269 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 41/41 constraints]
After SMT, in 21361ms problems are : Problem set: 0 solved, 16 unsolved
Parikh walk visited 0 properties in 450 ms.
Support contains 17 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 851/851 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 266 transition count 794
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 266 transition count 794
Applied a total of 6 rules in 15 ms. Remains 266 /269 variables (removed 3) and now considering 794/851 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 266/269 places, 794/851 transitions.
RANDOM walk for 4000000 steps (8 resets) in 71871 ms. (55 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2537 ms. (157 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2333 ms. (171 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3136 ms. (127 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3191 ms. (125 steps per ms) remains 15/16 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1795 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2531 ms. (157 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3177 ms. (125 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3028 ms. (132 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2462 ms. (162 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2628 ms. (152 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2322 ms. (172 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2330 ms. (171 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2155 ms. (185 steps per ms) remains 14/15 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2203 ms. (181 steps per ms) remains 13/14 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2582 ms. (154 steps per ms) remains 13/13 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2209 ms. (180 steps per ms) remains 13/13 properties
// Phase 1: matrix 794 rows 266 cols
[2024-06-01 00:47:53] [INFO ] Computed 22 invariants in 6 ms
[2024-06-01 00:47:53] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 134/148 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 113/261 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-01 00:47:54] [INFO ] Deduced a trap composed of 83 places in 383 ms of which 5 ms to minimize.
[2024-06-01 00:47:54] [INFO ] Deduced a trap composed of 106 places in 396 ms of which 4 ms to minimize.
[2024-06-01 00:47:54] [INFO ] Deduced a trap composed of 57 places in 396 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-01 00:47:55] [INFO ] Deduced a trap composed of 108 places in 400 ms of which 4 ms to minimize.
[2024-06-01 00:47:55] [INFO ] Deduced a trap composed of 87 places in 395 ms of which 5 ms to minimize.
[2024-06-01 00:47:56] [INFO ] Deduced a trap composed of 87 places in 331 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-01 00:47:56] [INFO ] Deduced a trap composed of 71 places in 376 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/261 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/261 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 5/266 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/266 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 794/1060 variables, 266/295 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1060 variables, 90/385 constraints. Problems are: Problem set: 0 solved, 13 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1060 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 0/1060 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1060/1060 variables, and 385 constraints, problems are : Problem set: 0 solved, 13 unsolved in 5860 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 266/266 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 134/148 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 113/261 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 5/266 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-01 00:48:00] [INFO ] Deduced a trap composed of 115 places in 421 ms of which 5 ms to minimize.
[2024-06-01 00:48:00] [INFO ] Deduced a trap composed of 81 places in 432 ms of which 4 ms to minimize.
[2024-06-01 00:48:01] [INFO ] Deduced a trap composed of 83 places in 423 ms of which 4 ms to minimize.
[2024-06-01 00:48:01] [INFO ] Deduced a trap composed of 84 places in 429 ms of which 5 ms to minimize.
[2024-06-01 00:48:01] [INFO ] Deduced a trap composed of 62 places in 439 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/266 variables, 5/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/266 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 794/1060 variables, 266/300 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1060 variables, 90/390 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1060 variables, 13/403 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1060 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 0/1060 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1060/1060 variables, and 403 constraints, problems are : Problem set: 0 solved, 13 unsolved in 6649 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 266/266 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 12/12 constraints]
After SMT, in 12557ms problems are : Problem set: 0 solved, 13 unsolved
Parikh walk visited 0 properties in 5747 ms.
Support contains 14 out of 266 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 794/794 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 263 transition count 737
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 263 transition count 737
Applied a total of 6 rules in 14 ms. Remains 263 /266 variables (removed 3) and now considering 737/794 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 263/266 places, 737/794 transitions.
RANDOM walk for 4000000 steps (8 resets) in 63582 ms. (62 steps per ms) remains 13/13 properties
BEST_FIRST walk for 3599441 steps (8 resets) in 17344 ms. (207 steps per ms) remains 13/13 properties
BEST_FIRST walk for 3696587 steps (8 resets) in 18206 ms. (203 steps per ms) remains 13/13 properties
BEST_FIRST walk for 3826658 steps (8 resets) in 16324 ms. (234 steps per ms) remains 12/13 properties
BEST_FIRST walk for 3691422 steps (8 resets) in 17207 ms. (214 steps per ms) remains 11/12 properties
BEST_FIRST walk for 3695677 steps (8 resets) in 16724 ms. (220 steps per ms) remains 10/11 properties
BEST_FIRST walk for 3652465 steps (7 resets) in 15597 ms. (234 steps per ms) remains 9/10 properties
BEST_FIRST walk for 3682042 steps (8 resets) in 16079 ms. (228 steps per ms) remains 8/9 properties
BEST_FIRST walk for 3898245 steps (8 resets) in 16688 ms. (233 steps per ms) remains 7/8 properties
BEST_FIRST walk for 3843968 steps (8 resets) in 13302 ms. (288 steps per ms) remains 6/7 properties
BEST_FIRST walk for 3790528 steps (8 resets) in 14743 ms. (257 steps per ms) remains 6/6 properties
BEST_FIRST walk for 3982704 steps (8 resets) in 15690 ms. (253 steps per ms) remains 6/6 properties
BEST_FIRST walk for 3839895 steps (8 resets) in 15200 ms. (252 steps per ms) remains 6/6 properties
BEST_FIRST walk for 3581365 steps (8 resets) in 14368 ms. (249 steps per ms) remains 6/6 properties
// Phase 1: matrix 737 rows 263 cols
[2024-06-01 00:49:44] [INFO ] Computed 22 invariants in 4 ms
[2024-06-01 00:49:44] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 90/97 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 155/252 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 11/263 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 00:49:44] [INFO ] Deduced a trap composed of 98 places in 378 ms of which 5 ms to minimize.
[2024-06-01 00:49:45] [INFO ] Deduced a trap composed of 55 places in 409 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 737/1000 variables, 263/287 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1000 variables, 90/377 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1000 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/1000 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1000/1000 variables, and 377 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1849 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 263/263 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 90/97 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 155/252 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 11/263 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 737/1000 variables, 263/287 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1000 variables, 90/377 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1000 variables, 6/383 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1000 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/1000 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1000/1000 variables, and 383 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1130 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 263/263 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints]
After SMT, in 2998ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 1273 ms.
Support contains 7 out of 263 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 263/263 places, 737/737 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 256 transition count 604
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 256 transition count 604
Applied a total of 14 rules in 14 ms. Remains 256 /263 variables (removed 7) and now considering 604/737 (removed 133) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 256/263 places, 604/737 transitions.
RANDOM walk for 4000000 steps (8 resets) in 43173 ms. (92 steps per ms) remains 6/6 properties
BEST_FIRST walk for 3897966 steps (8 resets) in 12426 ms. (313 steps per ms) remains 5/6 properties
BEST_FIRST walk for 3982607 steps (8 resets) in 14771 ms. (269 steps per ms) remains 4/5 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 13113 ms. (305 steps per ms) remains 3/4 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 10391 ms. (384 steps per ms) remains 2/3 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 11350 ms. (352 steps per ms) remains 1/2 properties
BEST_FIRST walk for 3435251 steps (7 resets) in 2610 ms. (1315 steps per ms) remains 0/1 properties
Able to resolve query QuasiLiveness after proving 2290 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 1445996 ms.
ITS solved all properties within timeout

BK_STOP 1717203026387

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is Anderson-PT-10, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r466-smll-171620124700227"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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