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.r488-tall-171631132000126.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 Dekker-PT-200, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r488-tall-171631132000126
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 25M
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 22 14:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 12 04:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 29K Apr 12 04:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 25M 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

here is the order used to build the result vector(from text file)
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-2024-00
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-2024-01
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-2024-02
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-2023-03
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-2024-04
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-2023-05
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-2024-06
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-2024-07
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-2024-08
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-2024-09
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-2024-10
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-2024-11
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-2024-12
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-2024-13
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-2024-14
FORMULA_NAME Dekker-PT-200-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717186791201

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Dekker-PT-200
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 20:19:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 20:19:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 20:19:53] [INFO ] Load time of PNML (sax parser for PT used): 1078 ms
[2024-05-31 20:19:53] [INFO ] Transformed 1000 places.
[2024-05-31 20:19:53] [INFO ] Transformed 40400 transitions.
[2024-05-31 20:19:53] [INFO ] Found NUPN structural information;
[2024-05-31 20:19:53] [INFO ] Parsed PT model containing 1000 places and 40400 transitions and 320400 arcs in 1430 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
FORMULA Dekker-PT-200-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 6080 ms. (6 steps per ms) remains 8/11 properties
FORMULA Dekker-PT-200-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-200-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-200-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 632 ms. (63 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 468 ms. (85 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 570 ms. (70 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 535 ms. (74 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 446 ms. (89 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 506 ms. (78 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 379 ms. (105 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 387 ms. (103 steps per ms) remains 8/8 properties
[2024-05-31 20:19:57] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 1000 cols
[2024-05-31 20:19:57] [INFO ] Computed 600 invariants in 43 ms
[2024-05-31 20:19:57] [INFO ] State equation strengthened by 200 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 109/109 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 181/290 variables, 119/229 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 181/410 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 7/417 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 26/316 variables, 26/443 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 26/469 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/316 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 100/416 variables, 83/552 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/416 variables, 100/652 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/416 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 34/450 variables, 34/686 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/450 variables, 34/720 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/450 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 360/810 variables, 450/1170 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/810 variables, 0/1170 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (OVERLAPS) 220/1030 variables, 200/1370 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1030 variables, 0/1370 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (OVERLAPS) 660/1690 variables, 440/1810 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1690 variables, 440/2250 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1690 variables, 0/2250 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (OVERLAPS) 110/1800 variables, 220/2470 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1800 variables, 110/2580 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1800 variables, 110/2690 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1800 variables, 110/2800 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1800 variables, 0/2800 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 28 (OVERLAPS) 0/1800 variables, 0/2800 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1800/1800 variables, and 2800 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2815 ms.
Refiners :[Domain max(s): 1000/1000 constraints, Positive P Invariants (semi-flows): 400/400 constraints, Generalized P Invariants (flows): 200/200 constraints, State Equation: 1000/1000 constraints, ReadFeed: 200/200 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 109/109 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 20:20:00] [INFO ] Deduced a trap composed of 2 places in 176 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 181/290 variables, 119/230 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 181/411 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 7/418 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 20:20:02] [INFO ] Deduced a trap composed of 4 places in 483 ms of which 2 ms to minimize.
[2024-05-31 20:20:03] [INFO ] Deduced a trap composed of 4 places in 486 ms of which 1 ms to minimize.
[2024-05-31 20:20:03] [INFO ] Deduced a trap composed of 4 places in 498 ms of which 1 ms to minimize.
[2024-05-31 20:20:04] [INFO ] Deduced a trap composed of 4 places in 475 ms of which 1 ms to minimize.
[2024-05-31 20:20:04] [INFO ] Deduced a trap composed of 4 places in 472 ms of which 3 ms to minimize.
[2024-05-31 20:20:05] [INFO ] Deduced a trap composed of 4 places in 429 ms of which 2 ms to minimize.
[2024-05-31 20:20:05] [INFO ] Deduced a trap composed of 4 places in 424 ms of which 6 ms to minimize.
SMT process timed out in 8513ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 109 out of 1000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 40400/40400 transitions.
Applied a total of 0 rules in 1401 ms. Remains 1000 /1000 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1424 ms. Remains : 1000/1000 places, 40400/40400 transitions.
RANDOM walk for 40000 steps (8 resets) in 6466 ms. (6 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 551 ms. (72 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 494 ms. (80 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 376 ms. (106 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 381 ms. (104 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 327 ms. (121 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 343 ms. (116 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 335 ms. (119 steps per ms) remains 7/8 properties
FORMULA Dekker-PT-200-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 419 ms. (95 steps per ms) remains 7/7 properties
[2024-05-31 20:20:10] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2024-05-31 20:20:10] [INFO ] Invariant cache hit.
[2024-05-31 20:20:10] [INFO ] State equation strengthened by 200 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 108/108 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 178/286 variables, 117/226 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 178/404 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 7/411 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 26/312 variables, 26/437 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 26/463 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 99/411 variables, 82/545 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/411 variables, 99/644 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/411 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 34/445 variables, 34/678 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/445 variables, 34/712 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/445 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 356/801 variables, 445/1157 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/801 variables, 0/1157 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 222/1023 variables, 200/1357 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1023 variables, 0/1357 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (OVERLAPS) 666/1689 variables, 444/1801 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1689 variables, 444/2245 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1689 variables, 0/2245 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (OVERLAPS) 111/1800 variables, 222/2467 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1800 variables, 111/2578 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1800 variables, 111/2689 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1800 variables, 111/2800 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1800 variables, 0/2800 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 28 (OVERLAPS) 0/1800 variables, 0/2800 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1800/1800 variables, and 2800 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1971 ms.
Refiners :[Domain max(s): 1000/1000 constraints, Positive P Invariants (semi-flows): 400/400 constraints, Generalized P Invariants (flows): 200/200 constraints, State Equation: 1000/1000 constraints, ReadFeed: 200/200 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 108/108 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 20:20:12] [INFO ] Deduced a trap composed of 2 places in 182 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 178/286 variables, 117/227 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 178/405 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 7/412 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 20:20:14] [INFO ] Deduced a trap composed of 4 places in 466 ms of which 1 ms to minimize.
[2024-05-31 20:20:14] [INFO ] Deduced a trap composed of 4 places in 490 ms of which 2 ms to minimize.
[2024-05-31 20:20:15] [INFO ] Deduced a trap composed of 4 places in 452 ms of which 1 ms to minimize.
[2024-05-31 20:20:15] [INFO ] Deduced a trap composed of 4 places in 440 ms of which 1 ms to minimize.
[2024-05-31 20:20:16] [INFO ] Deduced a trap composed of 4 places in 451 ms of which 2 ms to minimize.
[2024-05-31 20:20:16] [INFO ] Deduced a trap composed of 4 places in 407 ms of which 18 ms to minimize.
[2024-05-31 20:20:17] [INFO ] Deduced a trap composed of 4 places in 389 ms of which 1 ms to minimize.
[2024-05-31 20:20:17] [INFO ] Deduced a trap composed of 4 places in 420 ms of which 2 ms to minimize.
[2024-05-31 20:20:17] [INFO ] Deduced a trap composed of 4 places in 380 ms of which 1 ms to minimize.
[2024-05-31 20:20:18] [INFO ] Deduced a trap composed of 4 places in 387 ms of which 1 ms to minimize.
[2024-05-31 20:20:18] [INFO ] Deduced a trap composed of 4 places in 388 ms of which 1 ms to minimize.
[2024-05-31 20:20:19] [INFO ] Deduced a trap composed of 4 places in 367 ms of which 1 ms to minimize.
[2024-05-31 20:20:19] [INFO ] Deduced a trap composed of 4 places in 373 ms of which 4 ms to minimize.
[2024-05-31 20:20:19] [INFO ] Deduced a trap composed of 4 places in 377 ms of which 13 ms to minimize.
[2024-05-31 20:20:20] [INFO ] Deduced a trap composed of 4 places in 343 ms of which 0 ms to minimize.
[2024-05-31 20:20:20] [INFO ] Deduced a trap composed of 4 places in 324 ms of which 0 ms to minimize.
[2024-05-31 20:20:20] [INFO ] Deduced a trap composed of 4 places in 343 ms of which 0 ms to minimize.
[2024-05-31 20:20:21] [INFO ] Deduced a trap composed of 4 places in 332 ms of which 1 ms to minimize.
[2024-05-31 20:20:21] [INFO ] Deduced a trap composed of 4 places in 328 ms of which 1 ms to minimize.
[2024-05-31 20:20:21] [INFO ] Deduced a trap composed of 4 places in 326 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/286 variables, 20/432 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 20:20:22] [INFO ] Deduced a trap composed of 4 places in 344 ms of which 1 ms to minimize.
[2024-05-31 20:20:22] [INFO ] Deduced a trap composed of 4 places in 310 ms of which 0 ms to minimize.
[2024-05-31 20:20:22] [INFO ] Deduced a trap composed of 4 places in 303 ms of which 1 ms to minimize.
[2024-05-31 20:20:23] [INFO ] Deduced a trap composed of 4 places in 328 ms of which 1 ms to minimize.
[2024-05-31 20:20:23] [INFO ] Deduced a trap composed of 4 places in 322 ms of which 4 ms to minimize.
[2024-05-31 20:20:23] [INFO ] Deduced a trap composed of 4 places in 343 ms of which 1 ms to minimize.
[2024-05-31 20:20:24] [INFO ] Deduced a trap composed of 4 places in 323 ms of which 0 ms to minimize.
[2024-05-31 20:20:24] [INFO ] Deduced a trap composed of 4 places in 305 ms of which 1 ms to minimize.
[2024-05-31 20:20:24] [INFO ] Deduced a trap composed of 4 places in 334 ms of which 0 ms to minimize.
[2024-05-31 20:20:25] [INFO ] Deduced a trap composed of 4 places in 323 ms of which 1 ms to minimize.
[2024-05-31 20:20:25] [INFO ] Deduced a trap composed of 4 places in 324 ms of which 4 ms to minimize.
[2024-05-31 20:20:25] [INFO ] Deduced a trap composed of 4 places in 295 ms of which 1 ms to minimize.
[2024-05-31 20:20:26] [INFO ] Deduced a trap composed of 4 places in 324 ms of which 1 ms to minimize.
[2024-05-31 20:20:26] [INFO ] Deduced a trap composed of 4 places in 335 ms of which 2 ms to minimize.
[2024-05-31 20:20:26] [INFO ] Deduced a trap composed of 4 places in 319 ms of which 1 ms to minimize.
[2024-05-31 20:20:27] [INFO ] Deduced a trap composed of 4 places in 310 ms of which 1 ms to minimize.
[2024-05-31 20:20:27] [INFO ] Deduced a trap composed of 4 places in 327 ms of which 1 ms to minimize.
[2024-05-31 20:20:27] [INFO ] Deduced a trap composed of 4 places in 300 ms of which 1 ms to minimize.
[2024-05-31 20:20:28] [INFO ] Deduced a trap composed of 4 places in 337 ms of which 0 ms to minimize.
[2024-05-31 20:20:28] [INFO ] Deduced a trap composed of 4 places in 290 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/286 variables, 20/452 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 20:20:28] [INFO ] Deduced a trap composed of 4 places in 306 ms of which 0 ms to minimize.
[2024-05-31 20:20:29] [INFO ] Deduced a trap composed of 4 places in 327 ms of which 2 ms to minimize.
[2024-05-31 20:20:29] [INFO ] Deduced a trap composed of 4 places in 294 ms of which 0 ms to minimize.
[2024-05-31 20:20:29] [INFO ] Deduced a trap composed of 4 places in 321 ms of which 1 ms to minimize.
[2024-05-31 20:20:30] [INFO ] Deduced a trap composed of 4 places in 304 ms of which 0 ms to minimize.
[2024-05-31 20:20:30] [INFO ] Deduced a trap composed of 4 places in 280 ms of which 1 ms to minimize.
[2024-05-31 20:20:30] [INFO ] Deduced a trap composed of 4 places in 272 ms of which 17 ms to minimize.
[2024-05-31 20:20:30] [INFO ] Deduced a trap composed of 4 places in 262 ms of which 1 ms to minimize.
[2024-05-31 20:20:31] [INFO ] Deduced a trap composed of 4 places in 286 ms of which 1 ms to minimize.
[2024-05-31 20:20:31] [INFO ] Deduced a trap composed of 4 places in 244 ms of which 0 ms to minimize.
[2024-05-31 20:20:31] [INFO ] Deduced a trap composed of 4 places in 233 ms of which 2 ms to minimize.
[2024-05-31 20:20:31] [INFO ] Deduced a trap composed of 4 places in 268 ms of which 1 ms to minimize.
[2024-05-31 20:20:32] [INFO ] Deduced a trap composed of 4 places in 237 ms of which 1 ms to minimize.
[2024-05-31 20:20:32] [INFO ] Deduced a trap composed of 4 places in 229 ms of which 1 ms to minimize.
[2024-05-31 20:20:32] [INFO ] Deduced a trap composed of 4 places in 227 ms of which 1 ms to minimize.
[2024-05-31 20:20:32] [INFO ] Deduced a trap composed of 4 places in 266 ms of which 1 ms to minimize.
[2024-05-31 20:20:33] [INFO ] Deduced a trap composed of 4 places in 251 ms of which 0 ms to minimize.
[2024-05-31 20:20:33] [INFO ] Deduced a trap composed of 4 places in 259 ms of which 1 ms to minimize.
[2024-05-31 20:20:33] [INFO ] Deduced a trap composed of 4 places in 252 ms of which 1 ms to minimize.
[2024-05-31 20:20:34] [INFO ] Deduced a trap composed of 4 places in 262 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/286 variables, 20/472 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 20:20:34] [INFO ] Deduced a trap composed of 4 places in 247 ms of which 0 ms to minimize.
[2024-05-31 20:20:34] [INFO ] Deduced a trap composed of 4 places in 262 ms of which 0 ms to minimize.
[2024-05-31 20:20:34] [INFO ] Deduced a trap composed of 4 places in 262 ms of which 0 ms to minimize.
[2024-05-31 20:20:35] [INFO ] Deduced a trap composed of 4 places in 242 ms of which 1 ms to minimize.
[2024-05-31 20:20:35] [INFO ] Deduced a trap composed of 4 places in 245 ms of which 1 ms to minimize.
[2024-05-31 20:20:35] [INFO ] Deduced a trap composed of 4 places in 208 ms of which 0 ms to minimize.
[2024-05-31 20:20:35] [INFO ] Deduced a trap composed of 4 places in 211 ms of which 1 ms to minimize.
[2024-05-31 20:20:36] [INFO ] Deduced a trap composed of 4 places in 225 ms of which 0 ms to minimize.
[2024-05-31 20:20:36] [INFO ] Deduced a trap composed of 4 places in 223 ms of which 1 ms to minimize.
[2024-05-31 20:20:36] [INFO ] Deduced a trap composed of 4 places in 225 ms of which 1 ms to minimize.
[2024-05-31 20:20:36] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 0 ms to minimize.
[2024-05-31 20:20:36] [INFO ] Deduced a trap composed of 4 places in 232 ms of which 0 ms to minimize.
[2024-05-31 20:20:37] [INFO ] Deduced a trap composed of 4 places in 211 ms of which 0 ms to minimize.
[2024-05-31 20:20:37] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 0 ms to minimize.
[2024-05-31 20:20:37] [INFO ] Deduced a trap composed of 4 places in 217 ms of which 1 ms to minimize.
[2024-05-31 20:20:37] [INFO ] Deduced a trap composed of 4 places in 163 ms of which 0 ms to minimize.
[2024-05-31 20:20:38] [INFO ] Deduced a trap composed of 4 places in 213 ms of which 0 ms to minimize.
[2024-05-31 20:20:38] [INFO ] Deduced a trap composed of 4 places in 226 ms of which 0 ms to minimize.
[2024-05-31 20:20:38] [INFO ] Deduced a trap composed of 4 places in 174 ms of which 1 ms to minimize.
[2024-05-31 20:20:38] [INFO ] Deduced a trap composed of 4 places in 174 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/286 variables, 20/492 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 20:20:38] [INFO ] Deduced a trap composed of 4 places in 160 ms of which 0 ms to minimize.
[2024-05-31 20:20:39] [INFO ] Deduced a trap composed of 4 places in 277 ms of which 1 ms to minimize.
[2024-05-31 20:20:39] [INFO ] Deduced a trap composed of 4 places in 258 ms of which 0 ms to minimize.
[2024-05-31 20:20:39] [INFO ] Deduced a trap composed of 4 places in 216 ms of which 1 ms to minimize.
[2024-05-31 20:20:39] [INFO ] Deduced a trap composed of 4 places in 214 ms of which 0 ms to minimize.
[2024-05-31 20:20:40] [INFO ] Deduced a trap composed of 4 places in 210 ms of which 0 ms to minimize.
[2024-05-31 20:20:40] [INFO ] Deduced a trap composed of 4 places in 199 ms of which 0 ms to minimize.
[2024-05-31 20:20:40] [INFO ] Deduced a trap composed of 4 places in 180 ms of which 0 ms to minimize.
[2024-05-31 20:20:40] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 0 ms to minimize.
[2024-05-31 20:20:40] [INFO ] Deduced a trap composed of 4 places in 185 ms of which 0 ms to minimize.
[2024-05-31 20:20:41] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 0 ms to minimize.
[2024-05-31 20:20:41] [INFO ] Deduced a trap composed of 4 places in 183 ms of which 1 ms to minimize.
[2024-05-31 20:20:41] [INFO ] Deduced a trap composed of 4 places in 206 ms of which 1 ms to minimize.
[2024-05-31 20:20:41] [INFO ] Deduced a trap composed of 4 places in 308 ms of which 0 ms to minimize.
[2024-05-31 20:20:42] [INFO ] Deduced a trap composed of 4 places in 245 ms of which 1 ms to minimize.
[2024-05-31 20:20:42] [INFO ] Deduced a trap composed of 4 places in 237 ms of which 0 ms to minimize.
[2024-05-31 20:20:42] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 1 ms to minimize.
[2024-05-31 20:20:42] [INFO ] Deduced a trap composed of 4 places in 248 ms of which 1 ms to minimize.
[2024-05-31 20:20:43] [INFO ] Deduced a trap composed of 4 places in 244 ms of which 0 ms to minimize.
[2024-05-31 20:20:43] [INFO ] Deduced a trap composed of 4 places in 233 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/286 variables, 20/512 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 20:20:43] [INFO ] Deduced a trap composed of 4 places in 234 ms of which 1 ms to minimize.
[2024-05-31 20:20:44] [INFO ] Deduced a trap composed of 4 places in 224 ms of which 0 ms to minimize.
[2024-05-31 20:20:44] [INFO ] Deduced a trap composed of 4 places in 204 ms of which 0 ms to minimize.
[2024-05-31 20:20:44] [INFO ] Deduced a trap composed of 4 places in 202 ms of which 1 ms to minimize.
[2024-05-31 20:20:44] [INFO ] Deduced a trap composed of 4 places in 227 ms of which 1 ms to minimize.
[2024-05-31 20:20:44] [INFO ] Deduced a trap composed of 4 places in 197 ms of which 0 ms to minimize.
[2024-05-31 20:20:45] [INFO ] Deduced a trap composed of 4 places in 206 ms of which 1 ms to minimize.
[2024-05-31 20:20:45] [INFO ] Deduced a trap composed of 4 places in 179 ms of which 0 ms to minimize.
[2024-05-31 20:20:45] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 10 ms to minimize.
[2024-05-31 20:20:45] [INFO ] Deduced a trap composed of 4 places in 219 ms of which 0 ms to minimize.
[2024-05-31 20:20:45] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 1 ms to minimize.
[2024-05-31 20:20:46] [INFO ] Deduced a trap composed of 4 places in 214 ms of which 1 ms to minimize.
[2024-05-31 20:20:46] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 1 ms to minimize.
[2024-05-31 20:20:46] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 1 ms to minimize.
[2024-05-31 20:20:46] [INFO ] Deduced a trap composed of 4 places in 162 ms of which 1 ms to minimize.
[2024-05-31 20:20:46] [INFO ] Deduced a trap composed of 4 places in 177 ms of which 0 ms to minimize.
[2024-05-31 20:20:47] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 1 ms to minimize.
[2024-05-31 20:20:47] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 1 ms to minimize.
[2024-05-31 20:20:47] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 0 ms to minimize.
[2024-05-31 20:20:47] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/286 variables, 20/532 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 20:20:47] [INFO ] Deduced a trap composed of 4 places in 245 ms of which 1 ms to minimize.
[2024-05-31 20:20:48] [INFO ] Deduced a trap composed of 4 places in 252 ms of which 0 ms to minimize.
[2024-05-31 20:20:48] [INFO ] Deduced a trap composed of 4 places in 231 ms of which 0 ms to minimize.
[2024-05-31 20:20:48] [INFO ] Deduced a trap composed of 4 places in 246 ms of which 0 ms to minimize.
[2024-05-31 20:20:48] [INFO ] Deduced a trap composed of 4 places in 238 ms of which 0 ms to minimize.
[2024-05-31 20:20:49] [INFO ] Deduced a trap composed of 4 places in 230 ms of which 0 ms to minimize.
[2024-05-31 20:20:49] [INFO ] Deduced a trap composed of 4 places in 210 ms of which 0 ms to minimize.
[2024-05-31 20:20:49] [INFO ] Deduced a trap composed of 4 places in 236 ms of which 1 ms to minimize.
[2024-05-31 20:20:49] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 0 ms to minimize.
[2024-05-31 20:20:50] [INFO ] Deduced a trap composed of 4 places in 210 ms of which 0 ms to minimize.
[2024-05-31 20:20:50] [INFO ] Deduced a trap composed of 4 places in 205 ms of which 0 ms to minimize.
[2024-05-31 20:20:50] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 1 ms to minimize.
[2024-05-31 20:20:50] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 1 ms to minimize.
[2024-05-31 20:20:50] [INFO ] Deduced a trap composed of 4 places in 177 ms of which 0 ms to minimize.
[2024-05-31 20:20:51] [INFO ] Deduced a trap composed of 4 places in 175 ms of which 1 ms to minimize.
[2024-05-31 20:20:51] [INFO ] Deduced a trap composed of 4 places in 167 ms of which 0 ms to minimize.
[2024-05-31 20:20:51] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 1 ms to minimize.
[2024-05-31 20:20:51] [INFO ] Deduced a trap composed of 4 places in 160 ms of which 0 ms to minimize.
[2024-05-31 20:20:52] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 0 ms to minimize.
[2024-05-31 20:20:52] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/286 variables, 20/552 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 20:20:52] [INFO ] Deduced a trap composed of 4 places in 207 ms of which 1 ms to minimize.
[2024-05-31 20:20:52] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 1 ms to minimize.
[2024-05-31 20:20:52] [INFO ] Deduced a trap composed of 4 places in 201 ms of which 1 ms to minimize.
[2024-05-31 20:20:53] [INFO ] Deduced a trap composed of 4 places in 183 ms of which 1 ms to minimize.
[2024-05-31 20:20:53] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 0 ms to minimize.
[2024-05-31 20:20:53] [INFO ] Deduced a trap composed of 4 places in 183 ms of which 0 ms to minimize.
[2024-05-31 20:20:54] [INFO ] Deduced a trap composed of 4 places in 221 ms of which 0 ms to minimize.
[2024-05-31 20:20:54] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 1 ms to minimize.
[2024-05-31 20:20:54] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 1 ms to minimize.
[2024-05-31 20:20:54] [INFO ] Deduced a trap composed of 4 places in 167 ms of which 0 ms to minimize.
[2024-05-31 20:20:54] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 1 ms to minimize.
[2024-05-31 20:20:55] [INFO ] Deduced a trap composed of 4 places in 202 ms of which 0 ms to minimize.
[2024-05-31 20:20:55] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 1 ms to minimize.
[2024-05-31 20:20:55] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 1 ms to minimize.
[2024-05-31 20:20:55] [INFO ] Deduced a trap composed of 4 places in 168 ms of which 0 ms to minimize.
[2024-05-31 20:20:55] [INFO ] Deduced a trap composed of 4 places in 168 ms of which 1 ms to minimize.
[2024-05-31 20:20:56] [INFO ] Deduced a trap composed of 4 places in 168 ms of which 0 ms to minimize.
[2024-05-31 20:20:56] [INFO ] Deduced a trap composed of 4 places in 171 ms of which 0 ms to minimize.
[2024-05-31 20:20:56] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 1 ms to minimize.
[2024-05-31 20:20:56] [INFO ] Deduced a trap composed of 4 places in 256 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/286 variables, 20/572 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 20:20:56] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 1 ms to minimize.
[2024-05-31 20:20:57] [INFO ] Deduced a trap composed of 4 places in 161 ms of which 1 ms to minimize.
[2024-05-31 20:20:57] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 1 ms to minimize.
[2024-05-31 20:20:57] [INFO ] Deduced a trap composed of 4 places in 165 ms of which 0 ms to minimize.
SMT process timed out in 47458ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 108 out of 1000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 40400/40400 transitions.
Applied a total of 0 rules in 1014 ms. Remains 1000 /1000 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1014 ms. Remains : 1000/1000 places, 40400/40400 transitions.
RANDOM walk for 40000 steps (8 resets) in 5495 ms. (7 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 493 ms. (80 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 349 ms. (114 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 409 ms. (97 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 354 ms. (112 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 319 ms. (125 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 344 ms. (115 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 504 ms. (79 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 227532 steps, run timeout after 6003 ms. (steps per millisecond=37 ) properties seen :0 out of 7
Probabilistic random walk after 227532 steps, saw 218989 distinct states, run finished after 6007 ms. (steps per millisecond=37 ) properties seen :0
[2024-05-31 20:21:06] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2024-05-31 20:21:06] [INFO ] Invariant cache hit.
[2024-05-31 20:21:07] [INFO ] State equation strengthened by 200 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 108/108 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 178/286 variables, 117/226 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 178/404 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 7/411 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 26/312 variables, 26/437 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 26/463 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 99/411 variables, 82/545 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/411 variables, 99/644 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/411 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 34/445 variables, 34/678 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/445 variables, 34/712 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/445 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 356/801 variables, 445/1157 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/801 variables, 0/1157 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 222/1023 variables, 200/1357 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1023 variables, 0/1357 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (OVERLAPS) 666/1689 variables, 444/1801 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1689 variables, 444/2245 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1689 variables, 0/2245 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (OVERLAPS) 111/1800 variables, 222/2467 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1800 variables, 111/2578 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1800 variables, 111/2689 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1800 variables, 111/2800 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1800 variables, 0/2800 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 28 (OVERLAPS) 0/1800 variables, 0/2800 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1800/1800 variables, and 2800 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1890 ms.
Refiners :[Domain max(s): 1000/1000 constraints, Positive P Invariants (semi-flows): 400/400 constraints, Generalized P Invariants (flows): 200/200 constraints, State Equation: 1000/1000 constraints, ReadFeed: 200/200 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 108/108 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 20:21:09] [INFO ] Deduced a trap composed of 2 places in 145 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 178/286 variables, 117/227 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 178/405 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 7/412 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 20:21:10] [INFO ] Deduced a trap composed of 4 places in 487 ms of which 1 ms to minimize.
[2024-05-31 20:21:11] [INFO ] Deduced a trap composed of 4 places in 466 ms of which 0 ms to minimize.
[2024-05-31 20:21:11] [INFO ] Deduced a trap composed of 4 places in 450 ms of which 1 ms to minimize.
[2024-05-31 20:21:12] [INFO ] Deduced a trap composed of 4 places in 462 ms of which 1 ms to minimize.
[2024-05-31 20:21:12] [INFO ] Deduced a trap composed of 4 places in 434 ms of which 1 ms to minimize.
[2024-05-31 20:21:13] [INFO ] Deduced a trap composed of 4 places in 467 ms of which 1 ms to minimize.
[2024-05-31 20:21:13] [INFO ] Deduced a trap composed of 4 places in 415 ms of which 1 ms to minimize.
[2024-05-31 20:21:14] [INFO ] Deduced a trap composed of 4 places in 400 ms of which 1 ms to minimize.
[2024-05-31 20:21:14] [INFO ] Deduced a trap composed of 4 places in 387 ms of which 1 ms to minimize.
[2024-05-31 20:21:14] [INFO ] Deduced a trap composed of 4 places in 375 ms of which 0 ms to minimize.
[2024-05-31 20:21:15] [INFO ] Deduced a trap composed of 4 places in 373 ms of which 1 ms to minimize.
[2024-05-31 20:21:15] [INFO ] Deduced a trap composed of 4 places in 352 ms of which 1 ms to minimize.
[2024-05-31 20:21:16] [INFO ] Deduced a trap composed of 4 places in 368 ms of which 0 ms to minimize.
[2024-05-31 20:21:16] [INFO ] Deduced a trap composed of 4 places in 334 ms of which 1 ms to minimize.
[2024-05-31 20:21:16] [INFO ] Deduced a trap composed of 4 places in 328 ms of which 1 ms to minimize.
[2024-05-31 20:21:17] [INFO ] Deduced a trap composed of 4 places in 317 ms of which 0 ms to minimize.
[2024-05-31 20:21:17] [INFO ] Deduced a trap composed of 4 places in 314 ms of which 1 ms to minimize.
[2024-05-31 20:21:17] [INFO ] Deduced a trap composed of 4 places in 315 ms of which 0 ms to minimize.
[2024-05-31 20:21:18] [INFO ] Deduced a trap composed of 4 places in 323 ms of which 1 ms to minimize.
[2024-05-31 20:21:18] [INFO ] Deduced a trap composed of 4 places in 327 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/286 variables, 20/432 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 20:21:18] [INFO ] Deduced a trap composed of 4 places in 349 ms of which 1 ms to minimize.
[2024-05-31 20:21:19] [INFO ] Deduced a trap composed of 4 places in 334 ms of which 0 ms to minimize.
[2024-05-31 20:21:19] [INFO ] Deduced a trap composed of 4 places in 356 ms of which 1 ms to minimize.
[2024-05-31 20:21:19] [INFO ] Deduced a trap composed of 4 places in 357 ms of which 1 ms to minimize.
[2024-05-31 20:21:20] [INFO ] Deduced a trap composed of 4 places in 319 ms of which 0 ms to minimize.
[2024-05-31 20:21:20] [INFO ] Deduced a trap composed of 4 places in 347 ms of which 0 ms to minimize.
[2024-05-31 20:21:20] [INFO ] Deduced a trap composed of 4 places in 315 ms of which 1 ms to minimize.
[2024-05-31 20:21:21] [INFO ] Deduced a trap composed of 4 places in 297 ms of which 1 ms to minimize.
[2024-05-31 20:21:21] [INFO ] Deduced a trap composed of 4 places in 311 ms of which 1 ms to minimize.
[2024-05-31 20:21:21] [INFO ] Deduced a trap composed of 4 places in 324 ms of which 1 ms to minimize.
[2024-05-31 20:21:22] [INFO ] Deduced a trap composed of 4 places in 325 ms of which 1 ms to minimize.
[2024-05-31 20:21:22] [INFO ] Deduced a trap composed of 4 places in 326 ms of which 1 ms to minimize.
[2024-05-31 20:21:22] [INFO ] Deduced a trap composed of 4 places in 343 ms of which 1 ms to minimize.
[2024-05-31 20:21:23] [INFO ] Deduced a trap composed of 4 places in 316 ms of which 0 ms to minimize.
[2024-05-31 20:21:23] [INFO ] Deduced a trap composed of 4 places in 318 ms of which 0 ms to minimize.
[2024-05-31 20:21:23] [INFO ] Deduced a trap composed of 4 places in 303 ms of which 0 ms to minimize.
[2024-05-31 20:21:24] [INFO ] Deduced a trap composed of 4 places in 316 ms of which 1 ms to minimize.
[2024-05-31 20:21:24] [INFO ] Deduced a trap composed of 4 places in 313 ms of which 1 ms to minimize.
[2024-05-31 20:21:24] [INFO ] Deduced a trap composed of 4 places in 348 ms of which 1 ms to minimize.
[2024-05-31 20:21:24] [INFO ] Deduced a trap composed of 4 places in 293 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/286 variables, 20/452 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 20:21:25] [INFO ] Deduced a trap composed of 4 places in 297 ms of which 1 ms to minimize.
[2024-05-31 20:21:25] [INFO ] Deduced a trap composed of 4 places in 311 ms of which 1 ms to minimize.
[2024-05-31 20:21:25] [INFO ] Deduced a trap composed of 4 places in 301 ms of which 0 ms to minimize.
[2024-05-31 20:21:26] [INFO ] Deduced a trap composed of 4 places in 332 ms of which 1 ms to minimize.
[2024-05-31 20:21:26] [INFO ] Deduced a trap composed of 4 places in 283 ms of which 1 ms to minimize.
[2024-05-31 20:21:26] [INFO ] Deduced a trap composed of 4 places in 274 ms of which 1 ms to minimize.
[2024-05-31 20:21:27] [INFO ] Deduced a trap composed of 4 places in 281 ms of which 0 ms to minimize.
[2024-05-31 20:21:27] [INFO ] Deduced a trap composed of 4 places in 289 ms of which 0 ms to minimize.
[2024-05-31 20:21:27] [INFO ] Deduced a trap composed of 4 places in 308 ms of which 0 ms to minimize.
[2024-05-31 20:21:28] [INFO ] Deduced a trap composed of 4 places in 246 ms of which 0 ms to minimize.
[2024-05-31 20:21:28] [INFO ] Deduced a trap composed of 4 places in 260 ms of which 0 ms to minimize.
[2024-05-31 20:21:28] [INFO ] Deduced a trap composed of 4 places in 266 ms of which 0 ms to minimize.
[2024-05-31 20:21:28] [INFO ] Deduced a trap composed of 4 places in 251 ms of which 0 ms to minimize.
[2024-05-31 20:21:29] [INFO ] Deduced a trap composed of 4 places in 211 ms of which 0 ms to minimize.
[2024-05-31 20:21:29] [INFO ] Deduced a trap composed of 4 places in 248 ms of which 0 ms to minimize.
[2024-05-31 20:21:29] [INFO ] Deduced a trap composed of 4 places in 261 ms of which 1 ms to minimize.
[2024-05-31 20:21:29] [INFO ] Deduced a trap composed of 4 places in 273 ms of which 0 ms to minimize.
[2024-05-31 20:21:30] [INFO ] Deduced a trap composed of 4 places in 250 ms of which 2 ms to minimize.
[2024-05-31 20:21:30] [INFO ] Deduced a trap composed of 4 places in 274 ms of which 1 ms to minimize.
[2024-05-31 20:21:30] [INFO ] Deduced a trap composed of 4 places in 259 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/286 variables, 20/472 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 20:21:30] [INFO ] Deduced a trap composed of 4 places in 284 ms of which 1 ms to minimize.
[2024-05-31 20:21:31] [INFO ] Deduced a trap composed of 4 places in 269 ms of which 1 ms to minimize.
[2024-05-31 20:21:31] [INFO ] Deduced a trap composed of 4 places in 264 ms of which 1 ms to minimize.
[2024-05-31 20:21:31] [INFO ] Deduced a trap composed of 4 places in 238 ms of which 1 ms to minimize.
[2024-05-31 20:21:32] [INFO ] Deduced a trap composed of 4 places in 242 ms of which 1 ms to minimize.
[2024-05-31 20:21:32] [INFO ] Deduced a trap composed of 4 places in 209 ms of which 1 ms to minimize.
[2024-05-31 20:21:32] [INFO ] Deduced a trap composed of 4 places in 211 ms of which 0 ms to minimize.
[2024-05-31 20:21:32] [INFO ] Deduced a trap composed of 4 places in 214 ms of which 0 ms to minimize.
[2024-05-31 20:21:32] [INFO ] Deduced a trap composed of 4 places in 199 ms of which 0 ms to minimize.
[2024-05-31 20:21:33] [INFO ] Deduced a trap composed of 4 places in 216 ms of which 0 ms to minimize.
[2024-05-31 20:21:33] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 1 ms to minimize.
[2024-05-31 20:21:33] [INFO ] Deduced a trap composed of 4 places in 224 ms of which 1 ms to minimize.
[2024-05-31 20:21:33] [INFO ] Deduced a trap composed of 4 places in 206 ms of which 1 ms to minimize.
[2024-05-31 20:21:33] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 1 ms to minimize.
[2024-05-31 20:21:34] [INFO ] Deduced a trap composed of 4 places in 183 ms of which 2 ms to minimize.
[2024-05-31 20:21:34] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 0 ms to minimize.
[2024-05-31 20:21:34] [INFO ] Deduced a trap composed of 4 places in 247 ms of which 0 ms to minimize.
[2024-05-31 20:21:34] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 0 ms to minimize.
[2024-05-31 20:21:35] [INFO ] Deduced a trap composed of 4 places in 185 ms of which 0 ms to minimize.
[2024-05-31 20:21:35] [INFO ] Deduced a trap composed of 4 places in 179 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/286 variables, 20/492 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 20:21:35] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 1 ms to minimize.
[2024-05-31 20:21:35] [INFO ] Deduced a trap composed of 4 places in 253 ms of which 7 ms to minimize.
[2024-05-31 20:21:36] [INFO ] Deduced a trap composed of 4 places in 270 ms of which 1 ms to minimize.
[2024-05-31 20:21:36] [INFO ] Deduced a trap composed of 4 places in 222 ms of which 0 ms to minimize.
[2024-05-31 20:21:36] [INFO ] Deduced a trap composed of 4 places in 229 ms of which 1 ms to minimize.
[2024-05-31 20:21:36] [INFO ] Deduced a trap composed of 4 places in 206 ms of which 0 ms to minimize.
[2024-05-31 20:21:36] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 0 ms to minimize.
[2024-05-31 20:21:37] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 0 ms to minimize.
[2024-05-31 20:21:37] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 0 ms to minimize.
[2024-05-31 20:21:37] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 0 ms to minimize.
[2024-05-31 20:21:37] [INFO ] Deduced a trap composed of 4 places in 167 ms of which 0 ms to minimize.
[2024-05-31 20:21:37] [INFO ] Deduced a trap composed of 4 places in 169 ms of which 1 ms to minimize.
[2024-05-31 20:21:38] [INFO ] Deduced a trap composed of 4 places in 230 ms of which 0 ms to minimize.
[2024-05-31 20:21:38] [INFO ] Deduced a trap composed of 4 places in 257 ms of which 1 ms to minimize.
[2024-05-31 20:21:38] [INFO ] Deduced a trap composed of 4 places in 221 ms of which 0 ms to minimize.
[2024-05-31 20:21:38] [INFO ] Deduced a trap composed of 4 places in 246 ms of which 1 ms to minimize.
[2024-05-31 20:21:39] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 0 ms to minimize.
[2024-05-31 20:21:39] [INFO ] Deduced a trap composed of 4 places in 248 ms of which 0 ms to minimize.
[2024-05-31 20:21:39] [INFO ] Deduced a trap composed of 4 places in 224 ms of which 1 ms to minimize.
[2024-05-31 20:21:39] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/286 variables, 20/512 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 20:21:40] [INFO ] Deduced a trap composed of 4 places in 234 ms of which 1 ms to minimize.
[2024-05-31 20:21:40] [INFO ] Deduced a trap composed of 4 places in 215 ms of which 0 ms to minimize.
[2024-05-31 20:21:40] [INFO ] Deduced a trap composed of 4 places in 205 ms of which 0 ms to minimize.
[2024-05-31 20:21:40] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 1 ms to minimize.
[2024-05-31 20:21:41] [INFO ] Deduced a trap composed of 4 places in 236 ms of which 1 ms to minimize.
[2024-05-31 20:21:41] [INFO ] Deduced a trap composed of 4 places in 201 ms of which 0 ms to minimize.
[2024-05-31 20:21:41] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 1 ms to minimize.
[2024-05-31 20:21:41] [INFO ] Deduced a trap composed of 4 places in 170 ms of which 1 ms to minimize.
[2024-05-31 20:21:41] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 0 ms to minimize.
[2024-05-31 20:21:42] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 0 ms to minimize.
[2024-05-31 20:21:42] [INFO ] Deduced a trap composed of 4 places in 195 ms of which 0 ms to minimize.
[2024-05-31 20:21:42] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 1 ms to minimize.
[2024-05-31 20:21:42] [INFO ] Deduced a trap composed of 4 places in 182 ms of which 1 ms to minimize.
[2024-05-31 20:21:42] [INFO ] Deduced a trap composed of 4 places in 165 ms of which 0 ms to minimize.
[2024-05-31 20:21:43] [INFO ] Deduced a trap composed of 4 places in 168 ms of which 1 ms to minimize.
[2024-05-31 20:21:43] [INFO ] Deduced a trap composed of 4 places in 175 ms of which 0 ms to minimize.
[2024-05-31 20:21:43] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 0 ms to minimize.
[2024-05-31 20:21:43] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 1 ms to minimize.
[2024-05-31 20:21:43] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 0 ms to minimize.
[2024-05-31 20:21:44] [INFO ] Deduced a trap composed of 4 places in 170 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/286 variables, 20/532 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 20:21:44] [INFO ] Deduced a trap composed of 4 places in 249 ms of which 0 ms to minimize.
[2024-05-31 20:21:44] [INFO ] Deduced a trap composed of 4 places in 239 ms of which 1 ms to minimize.
[2024-05-31 20:21:44] [INFO ] Deduced a trap composed of 4 places in 227 ms of which 1 ms to minimize.
[2024-05-31 20:21:45] [INFO ] Deduced a trap composed of 4 places in 226 ms of which 0 ms to minimize.
[2024-05-31 20:21:45] [INFO ] Deduced a trap composed of 4 places in 212 ms of which 0 ms to minimize.
[2024-05-31 20:21:45] [INFO ] Deduced a trap composed of 4 places in 228 ms of which 0 ms to minimize.
[2024-05-31 20:21:45] [INFO ] Deduced a trap composed of 4 places in 206 ms of which 0 ms to minimize.
[2024-05-31 20:21:45] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 1 ms to minimize.
[2024-05-31 20:21:46] [INFO ] Deduced a trap composed of 4 places in 177 ms of which 0 ms to minimize.
[2024-05-31 20:21:46] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 1 ms to minimize.
[2024-05-31 20:21:46] [INFO ] Deduced a trap composed of 4 places in 182 ms of which 1 ms to minimize.
[2024-05-31 20:21:46] [INFO ] Deduced a trap composed of 4 places in 177 ms of which 1 ms to minimize.
[2024-05-31 20:21:46] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 1 ms to minimize.
[2024-05-31 20:21:47] [INFO ] Deduced a trap composed of 4 places in 171 ms of which 1 ms to minimize.
[2024-05-31 20:21:47] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 0 ms to minimize.
[2024-05-31 20:21:47] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 1 ms to minimize.
[2024-05-31 20:21:47] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 1 ms to minimize.
[2024-05-31 20:21:47] [INFO ] Deduced a trap composed of 4 places in 161 ms of which 0 ms to minimize.
[2024-05-31 20:21:48] [INFO ] Deduced a trap composed of 4 places in 173 ms of which 1 ms to minimize.
[2024-05-31 20:21:48] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/286 variables, 20/552 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 20:21:48] [INFO ] Deduced a trap composed of 4 places in 183 ms of which 0 ms to minimize.
[2024-05-31 20:21:48] [INFO ] Deduced a trap composed of 4 places in 173 ms of which 0 ms to minimize.
[2024-05-31 20:21:48] [INFO ] Deduced a trap composed of 4 places in 165 ms of which 0 ms to minimize.
[2024-05-31 20:21:49] [INFO ] Deduced a trap composed of 4 places in 163 ms of which 1 ms to minimize.
[2024-05-31 20:21:49] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 0 ms to minimize.
[2024-05-31 20:21:49] [INFO ] Deduced a trap composed of 4 places in 173 ms of which 0 ms to minimize.
[2024-05-31 20:21:49] [INFO ] Deduced a trap composed of 4 places in 186 ms of which 1 ms to minimize.
[2024-05-31 20:21:50] [INFO ] Deduced a trap composed of 4 places in 169 ms of which 0 ms to minimize.
[2024-05-31 20:21:50] [INFO ] Deduced a trap composed of 4 places in 204 ms of which 1 ms to minimize.
[2024-05-31 20:21:50] [INFO ] Deduced a trap composed of 4 places in 170 ms of which 0 ms to minimize.
[2024-05-31 20:21:50] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 0 ms to minimize.
[2024-05-31 20:21:50] [INFO ] Deduced a trap composed of 4 places in 202 ms of which 1 ms to minimize.
[2024-05-31 20:21:51] [INFO ] Deduced a trap composed of 4 places in 182 ms of which 1 ms to minimize.
[2024-05-31 20:21:51] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 1 ms to minimize.
[2024-05-31 20:21:51] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 0 ms to minimize.
[2024-05-31 20:21:51] [INFO ] Deduced a trap composed of 4 places in 167 ms of which 0 ms to minimize.
[2024-05-31 20:21:51] [INFO ] Deduced a trap composed of 4 places in 168 ms of which 0 ms to minimize.
[2024-05-31 20:21:52] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 1 ms to minimize.
[2024-05-31 20:21:52] [INFO ] Deduced a trap composed of 4 places in 186 ms of which 0 ms to minimize.
[2024-05-31 20:21:52] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/286 variables, 20/572 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 20:21:52] [INFO ] Deduced a trap composed of 4 places in 186 ms of which 0 ms to minimize.
[2024-05-31 20:21:52] [INFO ] Deduced a trap composed of 4 places in 180 ms of which 1 ms to minimize.
[2024-05-31 20:21:53] [INFO ] Deduced a trap composed of 4 places in 180 ms of which 0 ms to minimize.
[2024-05-31 20:21:53] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 0 ms to minimize.
[2024-05-31 20:21:53] [INFO ] Deduced a trap composed of 4 places in 175 ms of which 0 ms to minimize.
[2024-05-31 20:21:53] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 0 ms to minimize.
[2024-05-31 20:21:54] [INFO ] Deduced a trap composed of 4 places in 165 ms of which 1 ms to minimize.
[2024-05-31 20:21:54] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 0 ms to minimize.
Problem Dekker-PT-200-ReachabilityCardinality-2024-10 is UNSAT
FORMULA Dekker-PT-200-ReachabilityCardinality-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
[2024-05-31 20:21:54] [INFO ] Deduced a trap composed of 4 places in 195 ms of which 1 ms to minimize.
[2024-05-31 20:21:54] [INFO ] Deduced a trap composed of 4 places in 212 ms of which 0 ms to minimize.
[2024-05-31 20:21:54] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 1 ms to minimize.
[2024-05-31 20:21:55] [INFO ] Deduced a trap composed of 4 places in 218 ms of which 1 ms to minimize.
[2024-05-31 20:21:55] [INFO ] Deduced a trap composed of 4 places in 185 ms of which 0 ms to minimize.
[2024-05-31 20:21:55] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 0 ms to minimize.
[2024-05-31 20:21:55] [INFO ] Deduced a trap composed of 4 places in 167 ms of which 0 ms to minimize.
[2024-05-31 20:21:55] [INFO ] Deduced a trap composed of 4 places in 177 ms of which 2 ms to minimize.
[2024-05-31 20:21:56] [INFO ] Deduced a trap composed of 4 places in 167 ms of which 1 ms to minimize.
[2024-05-31 20:21:56] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 0 ms to minimize.
[2024-05-31 20:21:56] [INFO ] Deduced a trap composed of 4 places in 162 ms of which 0 ms to minimize.
[2024-05-31 20:21:56] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 1 ms to minimize.
Problem Dekker-PT-200-ReachabilityCardinality-2024-10 is UNSAT
At refinement iteration 15 (INCLUDED_ONLY) 0/286 variables, 20/592 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-31 20:21:56] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 0 ms to minimize.
[2024-05-31 20:21:57] [INFO ] Deduced a trap composed of 4 places in 209 ms of which 1 ms to minimize.
[2024-05-31 20:21:57] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/286 variables, 3/595 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-31 20:21:57] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 1 ms to minimize.
[2024-05-31 20:21:58] [INFO ] Deduced a trap composed of 4 places in 162 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/286 variables, 2/597 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/286 variables, 0/597 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 26/312 variables, 26/623 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/312 variables, 26/649 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-31 20:21:59] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 0 ms to minimize.
[2024-05-31 20:21:59] [INFO ] Deduced a trap composed of 4 places in 137 ms of which 0 ms to minimize.
[2024-05-31 20:21:59] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 0 ms to minimize.
[2024-05-31 20:21:59] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 0 ms to minimize.
[2024-05-31 20:21:59] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 0 ms to minimize.
[2024-05-31 20:22:00] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 0 ms to minimize.
[2024-05-31 20:22:00] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 0 ms to minimize.
[2024-05-31 20:22:00] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 0 ms to minimize.
[2024-05-31 20:22:00] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 1 ms to minimize.
[2024-05-31 20:22:00] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 1 ms to minimize.
[2024-05-31 20:22:00] [INFO ] Deduced a trap composed of 4 places in 137 ms of which 0 ms to minimize.
[2024-05-31 20:22:00] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 0 ms to minimize.
[2024-05-31 20:22:01] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 0 ms to minimize.
[2024-05-31 20:22:01] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 0 ms to minimize.
[2024-05-31 20:22:01] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 0 ms to minimize.
[2024-05-31 20:22:01] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 0 ms to minimize.
[2024-05-31 20:22:01] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 0 ms to minimize.
[2024-05-31 20:22:01] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2024-05-31 20:22:02] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 1 ms to minimize.
[2024-05-31 20:22:02] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/312 variables, 20/669 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-31 20:22:02] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 0 ms to minimize.
[2024-05-31 20:22:02] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 0 ms to minimize.
[2024-05-31 20:22:02] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 0 ms to minimize.
[2024-05-31 20:22:02] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 1 ms to minimize.
[2024-05-31 20:22:03] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 0 ms to minimize.
[2024-05-31 20:22:03] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 0 ms to minimize.
[2024-05-31 20:22:03] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 1 ms to minimize.
[2024-05-31 20:22:03] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 0 ms to minimize.
[2024-05-31 20:22:03] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 1 ms to minimize.
[2024-05-31 20:22:03] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 1 ms to minimize.
[2024-05-31 20:22:04] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 0 ms to minimize.
[2024-05-31 20:22:04] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 0 ms to minimize.
[2024-05-31 20:22:04] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 1 ms to minimize.
[2024-05-31 20:22:04] [INFO ] Deduced a trap composed of 4 places in 133 ms of which 1 ms to minimize.
[2024-05-31 20:22:04] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 1 ms to minimize.
[2024-05-31 20:22:04] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 1 ms to minimize.
[2024-05-31 20:22:04] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 0 ms to minimize.
[2024-05-31 20:22:04] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/312 variables, 18/687 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-31 20:22:05] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 0 ms to minimize.
[2024-05-31 20:22:05] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 0 ms to minimize.
[2024-05-31 20:22:05] [INFO ] Deduced a trap composed of 4 places in 170 ms of which 1 ms to minimize.
[2024-05-31 20:22:06] [INFO ] Deduced a trap composed of 4 places in 171 ms of which 0 ms to minimize.
[2024-05-31 20:22:06] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 1 ms to minimize.
[2024-05-31 20:22:06] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 0 ms to minimize.
[2024-05-31 20:22:06] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 0 ms to minimize.
[2024-05-31 20:22:06] [INFO ] Deduced a trap composed of 4 places in 133 ms of which 1 ms to minimize.
[2024-05-31 20:22:06] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 1 ms to minimize.
[2024-05-31 20:22:07] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 1 ms to minimize.
[2024-05-31 20:22:07] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 0 ms to minimize.
[2024-05-31 20:22:07] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 0 ms to minimize.
[2024-05-31 20:22:07] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 0 ms to minimize.
[2024-05-31 20:22:07] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 0 ms to minimize.
[2024-05-31 20:22:07] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 1 ms to minimize.
[2024-05-31 20:22:07] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 0 ms to minimize.
[2024-05-31 20:22:08] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 0 ms to minimize.
[2024-05-31 20:22:08] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 0 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/312 variables, 18/705 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-31 20:22:08] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 0 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/312 variables, 1/706 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/312 variables, 0/706 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 26 (OVERLAPS) 99/411 variables, 82/788 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/411 variables, 99/887 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/411 variables, 0/887 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 29 (OVERLAPS) 34/445 variables, 34/921 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/445 variables, 34/955 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-31 20:22:10] [INFO ] Deduced a trap composed of 4 places in 208 ms of which 0 ms to minimize.
[2024-05-31 20:22:10] [INFO ] Deduced a trap composed of 5 places in 203 ms of which 0 ms to minimize.
[2024-05-31 20:22:10] [INFO ] Deduced a trap composed of 5 places in 204 ms of which 1 ms to minimize.
[2024-05-31 20:22:11] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 1 ms to minimize.
[2024-05-31 20:22:11] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 0 ms to minimize.
[2024-05-31 20:22:11] [INFO ] Deduced a trap composed of 5 places in 200 ms of which 0 ms to minimize.
[2024-05-31 20:22:11] [INFO ] Deduced a trap composed of 5 places in 212 ms of which 0 ms to minimize.
[2024-05-31 20:22:12] [INFO ] Deduced a trap composed of 4 places in 195 ms of which 1 ms to minimize.
[2024-05-31 20:22:12] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 0 ms to minimize.
[2024-05-31 20:22:12] [INFO ] Deduced a trap composed of 5 places in 211 ms of which 1 ms to minimize.
[2024-05-31 20:22:12] [INFO ] Deduced a trap composed of 5 places in 210 ms of which 1 ms to minimize.
[2024-05-31 20:22:13] [INFO ] Deduced a trap composed of 4 places in 186 ms of which 1 ms to minimize.
[2024-05-31 20:22:13] [INFO ] Deduced a trap composed of 4 places in 202 ms of which 0 ms to minimize.
[2024-05-31 20:22:13] [INFO ] Deduced a trap composed of 4 places in 187 ms of which 0 ms to minimize.
[2024-05-31 20:22:13] [INFO ] Deduced a trap composed of 4 places in 203 ms of which 0 ms to minimize.
[2024-05-31 20:22:14] [INFO ] Deduced a trap composed of 4 places in 202 ms of which 0 ms to minimize.
[2024-05-31 20:22:14] [INFO ] Deduced a trap composed of 5 places in 199 ms of which 0 ms to minimize.
[2024-05-31 20:22:14] [INFO ] Deduced a trap composed of 4 places in 201 ms of which 1 ms to minimize.
[2024-05-31 20:22:14] [INFO ] Deduced a trap composed of 4 places in 186 ms of which 0 ms to minimize.
[2024-05-31 20:22:15] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 0 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/445 variables, 20/975 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-31 20:22:15] [INFO ] Deduced a trap composed of 4 places in 187 ms of which 0 ms to minimize.
[2024-05-31 20:22:15] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 0 ms to minimize.
[2024-05-31 20:22:16] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 0 ms to minimize.
[2024-05-31 20:22:16] [INFO ] Deduced a trap composed of 4 places in 170 ms of which 0 ms to minimize.
[2024-05-31 20:22:16] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 0 ms to minimize.
[2024-05-31 20:22:16] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 0 ms to minimize.
[2024-05-31 20:22:17] [INFO ] Deduced a trap composed of 4 places in 185 ms of which 1 ms to minimize.
[2024-05-31 20:22:17] [INFO ] Deduced a trap composed of 4 places in 171 ms of which 0 ms to minimize.
[2024-05-31 20:22:17] [INFO ] Deduced a trap composed of 4 places in 182 ms of which 0 ms to minimize.
[2024-05-31 20:22:17] [INFO ] Deduced a trap composed of 4 places in 182 ms of which 0 ms to minimize.
At refinement iteration 32 (INCLUDED_ONLY) 0/445 variables, 10/985 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/445 variables, 0/985 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 34 (OVERLAPS) 356/801 variables, 445/1430 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/801 variables, 0/1430 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 36 (OVERLAPS) 222/1023 variables, 200/1630 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-31 20:22:20] [INFO ] Deduced a trap composed of 4 places in 226 ms of which 0 ms to minimize.
[2024-05-31 20:22:20] [INFO ] Deduced a trap composed of 4 places in 226 ms of which 0 ms to minimize.
At refinement iteration 37 (INCLUDED_ONLY) 0/1023 variables, 2/1632 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-31 20:22:22] [INFO ] Deduced a trap composed of 4 places in 215 ms of which 0 ms to minimize.
At refinement iteration 38 (INCLUDED_ONLY) 0/1023 variables, 1/1633 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1023 variables, 0/1633 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 40 (OVERLAPS) 666/1689 variables, 444/2077 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1689 variables, 444/2521 constraints. Problems are: Problem set: 1 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1689/1800 variables, and 2527 constraints, problems are : Problem set: 1 solved, 6 unsolved in 75035 ms.
Refiners :[Domain max(s): 889/1000 constraints, Positive P Invariants (semi-flows): 178/400 constraints, Generalized P Invariants (flows): 89/200 constraints, State Equation: 889/1000 constraints, ReadFeed: 200/200 constraints, PredecessorRefiner: 6/7 constraints, Known Traps: 276/276 constraints]
After SMT, in 77311ms problems are : Problem set: 1 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 99 out of 1000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 40400/40400 transitions.
Applied a total of 0 rules in 949 ms. Remains 1000 /1000 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 951 ms. Remains : 1000/1000 places, 40400/40400 transitions.
RANDOM walk for 40000 steps (8 resets) in 4786 ms. (8 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 478 ms. (83 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 486 ms. (82 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 550 ms. (72 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 472 ms. (84 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 436 ms. (91 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 523 ms. (76 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 247431 steps, run timeout after 6003 ms. (steps per millisecond=41 ) properties seen :0 out of 6
Probabilistic random walk after 247431 steps, saw 238026 distinct states, run finished after 6005 ms. (steps per millisecond=41 ) properties seen :0
[2024-05-31 20:22:33] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2024-05-31 20:22:33] [INFO ] Invariant cache hit.
[2024-05-31 20:22:33] [INFO ] State equation strengthened by 200 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 161/260 variables, 106/206 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 161/367 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 5/372 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 23/283 variables, 23/395 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/283 variables, 23/418 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/283 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 96/379 variables, 78/496 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/379 variables, 96/592 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/379 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 36/415 variables, 36/628 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/415 variables, 36/664 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/415 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 332/747 variables, 415/1079 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/747 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 234/981 variables, 200/1279 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/981 variables, 0/1279 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 702/1683 variables, 468/1747 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1683 variables, 468/2215 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1683 variables, 0/2215 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 117/1800 variables, 234/2449 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1800 variables, 117/2566 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1800 variables, 117/2683 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1800 variables, 117/2800 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1800 variables, 0/2800 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (OVERLAPS) 0/1800 variables, 0/2800 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1800/1800 variables, and 2800 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1766 ms.
Refiners :[Domain max(s): 1000/1000 constraints, Positive P Invariants (semi-flows): 400/400 constraints, Generalized P Invariants (flows): 200/200 constraints, State Equation: 1000/1000 constraints, ReadFeed: 200/200 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 161/260 variables, 106/206 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 161/367 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 5/372 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 20:22:36] [INFO ] Deduced a trap composed of 4 places in 465 ms of which 1 ms to minimize.
[2024-05-31 20:22:36] [INFO ] Deduced a trap composed of 4 places in 421 ms of which 1 ms to minimize.
[2024-05-31 20:22:37] [INFO ] Deduced a trap composed of 4 places in 407 ms of which 0 ms to minimize.
[2024-05-31 20:22:37] [INFO ] Deduced a trap composed of 4 places in 394 ms of which 0 ms to minimize.
[2024-05-31 20:22:38] [INFO ] Deduced a trap composed of 4 places in 385 ms of which 0 ms to minimize.
[2024-05-31 20:22:38] [INFO ] Deduced a trap composed of 4 places in 371 ms of which 0 ms to minimize.
[2024-05-31 20:22:39] [INFO ] Deduced a trap composed of 4 places in 491 ms of which 1 ms to minimize.
[2024-05-31 20:22:39] [INFO ] Deduced a trap composed of 4 places in 399 ms of which 1 ms to minimize.
[2024-05-31 20:22:39] [INFO ] Deduced a trap composed of 4 places in 396 ms of which 1 ms to minimize.
[2024-05-31 20:22:40] [INFO ] Deduced a trap composed of 4 places in 376 ms of which 1 ms to minimize.
[2024-05-31 20:22:40] [INFO ] Deduced a trap composed of 4 places in 360 ms of which 1 ms to minimize.
[2024-05-31 20:22:40] [INFO ] Deduced a trap composed of 4 places in 356 ms of which 0 ms to minimize.
[2024-05-31 20:22:41] [INFO ] Deduced a trap composed of 4 places in 359 ms of which 1 ms to minimize.
[2024-05-31 20:22:41] [INFO ] Deduced a trap composed of 4 places in 356 ms of which 0 ms to minimize.
[2024-05-31 20:22:42] [INFO ] Deduced a trap composed of 4 places in 329 ms of which 0 ms to minimize.
[2024-05-31 20:22:42] [INFO ] Deduced a trap composed of 4 places in 310 ms of which 1 ms to minimize.
[2024-05-31 20:22:42] [INFO ] Deduced a trap composed of 4 places in 290 ms of which 1 ms to minimize.
[2024-05-31 20:22:42] [INFO ] Deduced a trap composed of 4 places in 290 ms of which 0 ms to minimize.
[2024-05-31 20:22:43] [INFO ] Deduced a trap composed of 4 places in 302 ms of which 0 ms to minimize.
[2024-05-31 20:22:43] [INFO ] Deduced a trap composed of 4 places in 289 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 20/392 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 20:22:43] [INFO ] Deduced a trap composed of 4 places in 364 ms of which 0 ms to minimize.
[2024-05-31 20:22:44] [INFO ] Deduced a trap composed of 4 places in 334 ms of which 0 ms to minimize.
[2024-05-31 20:22:44] [INFO ] Deduced a trap composed of 4 places in 320 ms of which 1 ms to minimize.
[2024-05-31 20:22:44] [INFO ] Deduced a trap composed of 4 places in 335 ms of which 0 ms to minimize.
[2024-05-31 20:22:45] [INFO ] Deduced a trap composed of 4 places in 298 ms of which 1 ms to minimize.
[2024-05-31 20:22:45] [INFO ] Deduced a trap composed of 4 places in 290 ms of which 1 ms to minimize.
[2024-05-31 20:22:45] [INFO ] Deduced a trap composed of 4 places in 280 ms of which 1 ms to minimize.
[2024-05-31 20:22:46] [INFO ] Deduced a trap composed of 4 places in 312 ms of which 1 ms to minimize.
[2024-05-31 20:22:46] [INFO ] Deduced a trap composed of 4 places in 313 ms of which 1 ms to minimize.
[2024-05-31 20:22:46] [INFO ] Deduced a trap composed of 4 places in 285 ms of which 1 ms to minimize.
[2024-05-31 20:22:47] [INFO ] Deduced a trap composed of 4 places in 358 ms of which 0 ms to minimize.
[2024-05-31 20:22:47] [INFO ] Deduced a trap composed of 4 places in 341 ms of which 0 ms to minimize.
[2024-05-31 20:22:47] [INFO ] Deduced a trap composed of 4 places in 314 ms of which 0 ms to minimize.
[2024-05-31 20:22:48] [INFO ] Deduced a trap composed of 4 places in 341 ms of which 0 ms to minimize.
[2024-05-31 20:22:48] [INFO ] Deduced a trap composed of 4 places in 311 ms of which 0 ms to minimize.
[2024-05-31 20:22:48] [INFO ] Deduced a trap composed of 5 places in 263 ms of which 0 ms to minimize.
[2024-05-31 20:22:49] [INFO ] Deduced a trap composed of 4 places in 239 ms of which 1 ms to minimize.
[2024-05-31 20:22:49] [INFO ] Deduced a trap composed of 4 places in 227 ms of which 0 ms to minimize.
[2024-05-31 20:22:49] [INFO ] Deduced a trap composed of 4 places in 251 ms of which 1 ms to minimize.
[2024-05-31 20:22:49] [INFO ] Deduced a trap composed of 4 places in 261 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/260 variables, 20/412 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 20:22:50] [INFO ] Deduced a trap composed of 4 places in 231 ms of which 1 ms to minimize.
[2024-05-31 20:22:50] [INFO ] Deduced a trap composed of 4 places in 226 ms of which 0 ms to minimize.
[2024-05-31 20:22:50] [INFO ] Deduced a trap composed of 4 places in 212 ms of which 1 ms to minimize.
[2024-05-31 20:22:50] [INFO ] Deduced a trap composed of 4 places in 195 ms of which 0 ms to minimize.
[2024-05-31 20:22:50] [INFO ] Deduced a trap composed of 4 places in 212 ms of which 1 ms to minimize.
[2024-05-31 20:22:51] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 1 ms to minimize.
[2024-05-31 20:22:51] [INFO ] Deduced a trap composed of 4 places in 223 ms of which 0 ms to minimize.
[2024-05-31 20:22:51] [INFO ] Deduced a trap composed of 4 places in 248 ms of which 0 ms to minimize.
[2024-05-31 20:22:51] [INFO ] Deduced a trap composed of 4 places in 227 ms of which 0 ms to minimize.
[2024-05-31 20:22:52] [INFO ] Deduced a trap composed of 4 places in 202 ms of which 0 ms to minimize.
[2024-05-31 20:22:52] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 0 ms to minimize.
[2024-05-31 20:22:52] [INFO ] Deduced a trap composed of 4 places in 179 ms of which 1 ms to minimize.
[2024-05-31 20:22:52] [INFO ] Deduced a trap composed of 4 places in 239 ms of which 1 ms to minimize.
[2024-05-31 20:22:53] [INFO ] Deduced a trap composed of 4 places in 212 ms of which 0 ms to minimize.
[2024-05-31 20:22:53] [INFO ] Deduced a trap composed of 4 places in 197 ms of which 0 ms to minimize.
[2024-05-31 20:22:53] [INFO ] Deduced a trap composed of 4 places in 197 ms of which 0 ms to minimize.
[2024-05-31 20:22:53] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 0 ms to minimize.
[2024-05-31 20:22:53] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 1 ms to minimize.
[2024-05-31 20:22:54] [INFO ] Deduced a trap composed of 4 places in 195 ms of which 0 ms to minimize.
[2024-05-31 20:22:54] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/260 variables, 20/432 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 20:22:54] [INFO ] Deduced a trap composed of 4 places in 246 ms of which 1 ms to minimize.
[2024-05-31 20:22:54] [INFO ] Deduced a trap composed of 4 places in 229 ms of which 0 ms to minimize.
[2024-05-31 20:22:55] [INFO ] Deduced a trap composed of 4 places in 204 ms of which 10 ms to minimize.
[2024-05-31 20:22:55] [INFO ] Deduced a trap composed of 4 places in 186 ms of which 1 ms to minimize.
[2024-05-31 20:22:55] [INFO ] Deduced a trap composed of 4 places in 160 ms of which 1 ms to minimize.
[2024-05-31 20:22:55] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 1 ms to minimize.
[2024-05-31 20:22:55] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 0 ms to minimize.
[2024-05-31 20:22:55] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 1 ms to minimize.
[2024-05-31 20:22:56] [INFO ] Deduced a trap composed of 4 places in 186 ms of which 0 ms to minimize.
[2024-05-31 20:22:56] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 1 ms to minimize.
[2024-05-31 20:22:56] [INFO ] Deduced a trap composed of 4 places in 177 ms of which 0 ms to minimize.
[2024-05-31 20:22:56] [INFO ] Deduced a trap composed of 4 places in 209 ms of which 1 ms to minimize.
[2024-05-31 20:22:56] [INFO ] Deduced a trap composed of 4 places in 177 ms of which 1 ms to minimize.
[2024-05-31 20:22:57] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 0 ms to minimize.
[2024-05-31 20:22:57] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 0 ms to minimize.
[2024-05-31 20:22:57] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 0 ms to minimize.
[2024-05-31 20:22:57] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 1 ms to minimize.
[2024-05-31 20:22:58] [INFO ] Deduced a trap composed of 4 places in 175 ms of which 1 ms to minimize.
[2024-05-31 20:22:58] [INFO ] Deduced a trap composed of 4 places in 171 ms of which 0 ms to minimize.
[2024-05-31 20:22:58] [INFO ] Deduced a trap composed of 4 places in 167 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/260 variables, 20/452 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 20:22:58] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 0 ms to minimize.
[2024-05-31 20:22:58] [INFO ] Deduced a trap composed of 4 places in 179 ms of which 0 ms to minimize.
[2024-05-31 20:22:59] [INFO ] Deduced a trap composed of 4 places in 179 ms of which 1 ms to minimize.
[2024-05-31 20:22:59] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 1 ms to minimize.
[2024-05-31 20:22:59] [INFO ] Deduced a trap composed of 4 places in 167 ms of which 0 ms to minimize.
[2024-05-31 20:22:59] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 0 ms to minimize.
[2024-05-31 20:22:59] [INFO ] Deduced a trap composed of 4 places in 163 ms of which 0 ms to minimize.
[2024-05-31 20:23:00] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 0 ms to minimize.
[2024-05-31 20:23:00] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 0 ms to minimize.
[2024-05-31 20:23:00] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 0 ms to minimize.
[2024-05-31 20:23:00] [INFO ] Deduced a trap composed of 4 places in 171 ms of which 1 ms to minimize.
[2024-05-31 20:23:00] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 1 ms to minimize.
[2024-05-31 20:23:01] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 0 ms to minimize.
[2024-05-31 20:23:01] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 1 ms to minimize.
[2024-05-31 20:23:01] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 1 ms to minimize.
[2024-05-31 20:23:01] [INFO ] Deduced a trap composed of 4 places in 236 ms of which 1 ms to minimize.
[2024-05-31 20:23:01] [INFO ] Deduced a trap composed of 4 places in 239 ms of which 1 ms to minimize.
[2024-05-31 20:23:02] [INFO ] Deduced a trap composed of 4 places in 259 ms of which 0 ms to minimize.
[2024-05-31 20:23:02] [INFO ] Deduced a trap composed of 4 places in 220 ms of which 1 ms to minimize.
[2024-05-31 20:23:02] [INFO ] Deduced a trap composed of 4 places in 238 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/260 variables, 20/472 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 20:23:02] [INFO ] Deduced a trap composed of 4 places in 241 ms of which 0 ms to minimize.
[2024-05-31 20:23:03] [INFO ] Deduced a trap composed of 4 places in 209 ms of which 1 ms to minimize.
[2024-05-31 20:23:03] [INFO ] Deduced a trap composed of 4 places in 204 ms of which 1 ms to minimize.
[2024-05-31 20:23:03] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 1 ms to minimize.
[2024-05-31 20:23:03] [INFO ] Deduced a trap composed of 4 places in 174 ms of which 1 ms to minimize.
[2024-05-31 20:23:04] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 1 ms to minimize.
[2024-05-31 20:23:04] [INFO ] Deduced a trap composed of 4 places in 208 ms of which 0 ms to minimize.
[2024-05-31 20:23:04] [INFO ] Deduced a trap composed of 4 places in 195 ms of which 0 ms to minimize.
[2024-05-31 20:23:04] [INFO ] Deduced a trap composed of 4 places in 211 ms of which 1 ms to minimize.
[2024-05-31 20:23:04] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 1 ms to minimize.
[2024-05-31 20:23:05] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 0 ms to minimize.
[2024-05-31 20:23:05] [INFO ] Deduced a trap composed of 4 places in 179 ms of which 1 ms to minimize.
[2024-05-31 20:23:05] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 0 ms to minimize.
[2024-05-31 20:23:05] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 0 ms to minimize.
[2024-05-31 20:23:05] [INFO ] Deduced a trap composed of 4 places in 170 ms of which 1 ms to minimize.
[2024-05-31 20:23:06] [INFO ] Deduced a trap composed of 4 places in 206 ms of which 1 ms to minimize.
[2024-05-31 20:23:06] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 0 ms to minimize.
[2024-05-31 20:23:06] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 0 ms to minimize.
[2024-05-31 20:23:06] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 1 ms to minimize.
[2024-05-31 20:23:06] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/260 variables, 20/492 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 20:23:07] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 0 ms to minimize.
[2024-05-31 20:23:07] [INFO ] Deduced a trap composed of 4 places in 218 ms of which 0 ms to minimize.
[2024-05-31 20:23:08] [INFO ] Deduced a trap composed of 4 places in 183 ms of which 0 ms to minimize.
[2024-05-31 20:23:08] [INFO ] Deduced a trap composed of 5 places in 215 ms of which 0 ms to minimize.
[2024-05-31 20:23:08] [INFO ] Deduced a trap composed of 4 places in 197 ms of which 1 ms to minimize.
[2024-05-31 20:23:08] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 0 ms to minimize.
[2024-05-31 20:23:08] [INFO ] Deduced a trap composed of 4 places in 209 ms of which 1 ms to minimize.
[2024-05-31 20:23:09] [INFO ] Deduced a trap composed of 4 places in 163 ms of which 0 ms to minimize.
[2024-05-31 20:23:09] [INFO ] Deduced a trap composed of 4 places in 175 ms of which 1 ms to minimize.
[2024-05-31 20:23:09] [INFO ] Deduced a trap composed of 4 places in 173 ms of which 0 ms to minimize.
[2024-05-31 20:23:09] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 0 ms to minimize.
[2024-05-31 20:23:09] [INFO ] Deduced a trap composed of 4 places in 217 ms of which 1 ms to minimize.
[2024-05-31 20:23:10] [INFO ] Deduced a trap composed of 4 places in 207 ms of which 1 ms to minimize.
[2024-05-31 20:23:10] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 1 ms to minimize.
[2024-05-31 20:23:10] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 1 ms to minimize.
[2024-05-31 20:23:10] [INFO ] Deduced a trap composed of 4 places in 203 ms of which 1 ms to minimize.
[2024-05-31 20:23:10] [INFO ] Deduced a trap composed of 4 places in 197 ms of which 0 ms to minimize.
[2024-05-31 20:23:11] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 0 ms to minimize.
[2024-05-31 20:23:11] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 1 ms to minimize.
[2024-05-31 20:23:11] [INFO ] Deduced a trap composed of 4 places in 204 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/260 variables, 20/512 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 20:23:11] [INFO ] Deduced a trap composed of 4 places in 174 ms of which 0 ms to minimize.
[2024-05-31 20:23:12] [INFO ] Deduced a trap composed of 4 places in 169 ms of which 1 ms to minimize.
[2024-05-31 20:23:12] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/260 variables, 3/515 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 20:23:12] [INFO ] Deduced a trap composed of 4 places in 162 ms of which 0 ms to minimize.
[2024-05-31 20:23:12] [INFO ] Deduced a trap composed of 4 places in 167 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/260 variables, 2/517 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/260 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 23/283 variables, 23/540 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/283 variables, 23/563 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 20:23:14] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 0 ms to minimize.
[2024-05-31 20:23:14] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 0 ms to minimize.
[2024-05-31 20:23:14] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 1 ms to minimize.
[2024-05-31 20:23:14] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 1 ms to minimize.
[2024-05-31 20:23:14] [INFO ] Deduced a trap composed of 4 places in 168 ms of which 0 ms to minimize.
[2024-05-31 20:23:14] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 1 ms to minimize.
[2024-05-31 20:23:15] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 0 ms to minimize.
[2024-05-31 20:23:15] [INFO ] Deduced a trap composed of 4 places in 137 ms of which 1 ms to minimize.
[2024-05-31 20:23:15] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 0 ms to minimize.
[2024-05-31 20:23:15] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 1 ms to minimize.
[2024-05-31 20:23:15] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 0 ms to minimize.
[2024-05-31 20:23:15] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 1 ms to minimize.
[2024-05-31 20:23:16] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 0 ms to minimize.
[2024-05-31 20:23:16] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 0 ms to minimize.
[2024-05-31 20:23:16] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 1 ms to minimize.
[2024-05-31 20:23:16] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 0 ms to minimize.
[2024-05-31 20:23:16] [INFO ] Deduced a trap composed of 4 places in 133 ms of which 0 ms to minimize.
[2024-05-31 20:23:16] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 1 ms to minimize.
[2024-05-31 20:23:17] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 0 ms to minimize.
[2024-05-31 20:23:17] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/283 variables, 20/583 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 20:23:17] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 1 ms to minimize.
[2024-05-31 20:23:17] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 0 ms to minimize.
[2024-05-31 20:23:17] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 0 ms to minimize.
[2024-05-31 20:23:17] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 0 ms to minimize.
[2024-05-31 20:23:17] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 0 ms to minimize.
[2024-05-31 20:23:18] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 0 ms to minimize.
[2024-05-31 20:23:18] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 1 ms to minimize.
[2024-05-31 20:23:18] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 0 ms to minimize.
[2024-05-31 20:23:18] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 1 ms to minimize.
[2024-05-31 20:23:18] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 1 ms to minimize.
[2024-05-31 20:23:18] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 1 ms to minimize.
[2024-05-31 20:23:19] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2024-05-31 20:23:19] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 0 ms to minimize.
[2024-05-31 20:23:19] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 0 ms to minimize.
[2024-05-31 20:23:19] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 1 ms to minimize.
[2024-05-31 20:23:19] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 0 ms to minimize.
[2024-05-31 20:23:19] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 1 ms to minimize.
[2024-05-31 20:23:19] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/283 variables, 18/601 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 20:23:20] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 1 ms to minimize.
[2024-05-31 20:23:20] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/283 variables, 2/603 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/283 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (OVERLAPS) 96/379 variables, 78/681 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/379 variables, 96/777 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/379 variables, 0/777 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (OVERLAPS) 36/415 variables, 36/813 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/415 variables, 36/849 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 20:23:22] [INFO ] Deduced a trap composed of 4 places in 221 ms of which 1 ms to minimize.
[2024-05-31 20:23:22] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 1 ms to minimize.
[2024-05-31 20:23:22] [INFO ] Deduced a trap composed of 5 places in 195 ms of which 1 ms to minimize.
[2024-05-31 20:23:22] [INFO ] Deduced a trap composed of 4 places in 202 ms of which 0 ms to minimize.
[2024-05-31 20:23:23] [INFO ] Deduced a trap composed of 5 places in 216 ms of which 1 ms to minimize.
[2024-05-31 20:23:23] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 1 ms to minimize.
[2024-05-31 20:23:23] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 0 ms to minimize.
[2024-05-31 20:23:23] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 1 ms to minimize.
[2024-05-31 20:23:24] [INFO ] Deduced a trap composed of 5 places in 195 ms of which 1 ms to minimize.
[2024-05-31 20:23:24] [INFO ] Deduced a trap composed of 5 places in 209 ms of which 0 ms to minimize.
[2024-05-31 20:23:24] [INFO ] Deduced a trap composed of 4 places in 185 ms of which 1 ms to minimize.
[2024-05-31 20:23:24] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 1 ms to minimize.
[2024-05-31 20:23:24] [INFO ] Deduced a trap composed of 4 places in 179 ms of which 1 ms to minimize.
[2024-05-31 20:23:25] [INFO ] Deduced a trap composed of 5 places in 210 ms of which 1 ms to minimize.
[2024-05-31 20:23:25] [INFO ] Deduced a trap composed of 5 places in 194 ms of which 0 ms to minimize.
[2024-05-31 20:23:25] [INFO ] Deduced a trap composed of 4 places in 168 ms of which 1 ms to minimize.
[2024-05-31 20:23:25] [INFO ] Deduced a trap composed of 4 places in 195 ms of which 0 ms to minimize.
[2024-05-31 20:23:26] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 0 ms to minimize.
[2024-05-31 20:23:26] [INFO ] Deduced a trap composed of 4 places in 161 ms of which 1 ms to minimize.
[2024-05-31 20:23:26] [INFO ] Deduced a trap composed of 4 places in 214 ms of which 0 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/415 variables, 20/869 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 20:23:27] [INFO ] Deduced a trap composed of 5 places in 200 ms of which 1 ms to minimize.
[2024-05-31 20:23:27] [INFO ] Deduced a trap composed of 4 places in 182 ms of which 0 ms to minimize.
[2024-05-31 20:23:27] [INFO ] Deduced a trap composed of 5 places in 206 ms of which 0 ms to minimize.
[2024-05-31 20:23:27] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 0 ms to minimize.
[2024-05-31 20:23:28] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 1 ms to minimize.
[2024-05-31 20:23:28] [INFO ] Deduced a trap composed of 4 places in 174 ms of which 1 ms to minimize.
[2024-05-31 20:23:28] [INFO ] Deduced a trap composed of 5 places in 188 ms of which 1 ms to minimize.
[2024-05-31 20:23:28] [INFO ] Deduced a trap composed of 4 places in 179 ms of which 0 ms to minimize.
[2024-05-31 20:23:28] [INFO ] Deduced a trap composed of 4 places in 173 ms of which 0 ms to minimize.
[2024-05-31 20:23:29] [INFO ] Deduced a trap composed of 4 places in 167 ms of which 0 ms to minimize.
[2024-05-31 20:23:29] [INFO ] Deduced a trap composed of 5 places in 181 ms of which 1 ms to minimize.
[2024-05-31 20:23:29] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 0 ms to minimize.
[2024-05-31 20:23:29] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 0 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/415 variables, 13/882 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/415 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 30 (OVERLAPS) 332/747 variables, 415/1297 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/747 variables, 0/1297 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 32 (OVERLAPS) 234/981 variables, 200/1497 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/981 variables, 0/1497 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 34 (OVERLAPS) 702/1683 variables, 468/1965 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1683 variables, 468/2433 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1683 variables, 6/2439 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 20:23:34] [INFO ] Deduced a trap composed of 4 places in 823 ms of which 2 ms to minimize.
[2024-05-31 20:23:35] [INFO ] Deduced a trap composed of 4 places in 826 ms of which 1 ms to minimize.
[2024-05-31 20:23:36] [INFO ] Deduced a trap composed of 4 places in 821 ms of which 1 ms to minimize.
[2024-05-31 20:23:37] [INFO ] Deduced a trap composed of 4 places in 756 ms of which 2 ms to minimize.
[2024-05-31 20:23:37] [INFO ] Deduced a trap composed of 4 places in 803 ms of which 2 ms to minimize.
[2024-05-31 20:23:38] [INFO ] Deduced a trap composed of 4 places in 797 ms of which 1 ms to minimize.
[2024-05-31 20:23:39] [INFO ] Deduced a trap composed of 4 places in 769 ms of which 2 ms to minimize.
[2024-05-31 20:23:40] [INFO ] Deduced a trap composed of 4 places in 738 ms of which 1 ms to minimize.
[2024-05-31 20:23:41] [INFO ] Deduced a trap composed of 4 places in 685 ms of which 2 ms to minimize.
[2024-05-31 20:23:41] [INFO ] Deduced a trap composed of 4 places in 674 ms of which 1 ms to minimize.
[2024-05-31 20:23:42] [INFO ] Deduced a trap composed of 4 places in 754 ms of which 1 ms to minimize.
[2024-05-31 20:23:43] [INFO ] Deduced a trap composed of 4 places in 760 ms of which 2 ms to minimize.
[2024-05-31 20:23:44] [INFO ] Deduced a trap composed of 4 places in 744 ms of which 1 ms to minimize.
[2024-05-31 20:23:45] [INFO ] Deduced a trap composed of 4 places in 737 ms of which 1 ms to minimize.
[2024-05-31 20:23:45] [INFO ] Deduced a trap composed of 4 places in 751 ms of which 2 ms to minimize.
[2024-05-31 20:23:46] [INFO ] Deduced a trap composed of 4 places in 715 ms of which 2 ms to minimize.
[2024-05-31 20:23:47] [INFO ] Deduced a trap composed of 4 places in 690 ms of which 1 ms to minimize.
[2024-05-31 20:23:48] [INFO ] Deduced a trap composed of 4 places in 681 ms of which 6 ms to minimize.
[2024-05-31 20:23:48] [INFO ] Deduced a trap composed of 4 places in 679 ms of which 1 ms to minimize.
[2024-05-31 20:23:49] [INFO ] Deduced a trap composed of 4 places in 664 ms of which 1 ms to minimize.
At refinement iteration 37 (INCLUDED_ONLY) 0/1683 variables, 20/2459 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 20:23:50] [INFO ] Deduced a trap composed of 4 places in 676 ms of which 3 ms to minimize.
[2024-05-31 20:23:51] [INFO ] Deduced a trap composed of 4 places in 654 ms of which 1 ms to minimize.
[2024-05-31 20:23:52] [INFO ] Deduced a trap composed of 4 places in 620 ms of which 1 ms to minimize.
[2024-05-31 20:23:52] [INFO ] Deduced a trap composed of 4 places in 636 ms of which 1 ms to minimize.
[2024-05-31 20:23:53] [INFO ] Deduced a trap composed of 4 places in 635 ms of which 1 ms to minimize.
[2024-05-31 20:23:54] [INFO ] Deduced a trap composed of 4 places in 627 ms of which 2 ms to minimize.
[2024-05-31 20:23:54] [INFO ] Deduced a trap composed of 4 places in 632 ms of which 6 ms to minimize.
[2024-05-31 20:23:55] [INFO ] Deduced a trap composed of 4 places in 637 ms of which 1 ms to minimize.
[2024-05-31 20:23:56] [INFO ] Deduced a trap composed of 4 places in 619 ms of which 1 ms to minimize.
[2024-05-31 20:23:56] [INFO ] Deduced a trap composed of 4 places in 624 ms of which 1 ms to minimize.
[2024-05-31 20:23:57] [INFO ] Deduced a trap composed of 4 places in 619 ms of which 1 ms to minimize.
[2024-05-31 20:23:58] [INFO ] Deduced a trap composed of 4 places in 607 ms of which 1 ms to minimize.
[2024-05-31 20:23:58] [INFO ] Deduced a trap composed of 4 places in 601 ms of which 1 ms to minimize.
[2024-05-31 20:23:59] [INFO ] Deduced a trap composed of 4 places in 570 ms of which 1 ms to minimize.
[2024-05-31 20:24:00] [INFO ] Deduced a trap composed of 4 places in 558 ms of which 1 ms to minimize.
[2024-05-31 20:24:00] [INFO ] Deduced a trap composed of 4 places in 558 ms of which 1 ms to minimize.
[2024-05-31 20:24:01] [INFO ] Deduced a trap composed of 4 places in 547 ms of which 1 ms to minimize.
[2024-05-31 20:24:01] [INFO ] Deduced a trap composed of 4 places in 545 ms of which 1 ms to minimize.
[2024-05-31 20:24:02] [INFO ] Deduced a trap composed of 4 places in 533 ms of which 1 ms to minimize.
[2024-05-31 20:24:02] [INFO ] Deduced a trap composed of 4 places in 524 ms of which 1 ms to minimize.
At refinement iteration 38 (INCLUDED_ONLY) 0/1683 variables, 20/2479 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 20:24:04] [INFO ] Deduced a trap composed of 4 places in 617 ms of which 1 ms to minimize.
[2024-05-31 20:24:04] [INFO ] Deduced a trap composed of 4 places in 600 ms of which 1 ms to minimize.
[2024-05-31 20:24:05] [INFO ] Deduced a trap composed of 4 places in 592 ms of which 1 ms to minimize.
[2024-05-31 20:24:06] [INFO ] Deduced a trap composed of 4 places in 571 ms of which 1 ms to minimize.
SMT process timed out in 92816ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 19755 ms.
Support contains 99 out of 1000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 40400/40400 transitions.
Applied a total of 0 rules in 758 ms. Remains 1000 /1000 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 759 ms. Remains : 1000/1000 places, 40400/40400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 40400/40400 transitions.
Applied a total of 0 rules in 779 ms. Remains 1000 /1000 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2024-05-31 20:24:27] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2024-05-31 20:24:27] [INFO ] Invariant cache hit.
[2024-05-31 20:24:57] [INFO ] Implicit Places using invariants in 30056 ms returned [400, 406, 409, 412, 415, 421, 424, 427, 430, 436, 439, 442, 445, 448, 451, 454, 457, 460, 463, 466, 469, 472, 475, 478, 481, 484, 487, 490, 493, 496, 502, 505, 508, 511, 514, 517, 520, 523, 526, 529, 532, 535, 541, 544, 553, 556, 559, 562, 565, 568, 571, 574, 577, 580, 583, 586, 589, 592, 595, 598, 604, 607, 610, 613, 616, 619, 622, 625, 628, 631, 634, 637, 640, 643, 646, 649, 652, 655, 658, 661, 664, 667, 670, 673, 676, 679, 682, 685, 688, 691, 694, 697, 700, 703, 706, 709, 712, 715, 718, 721, 724, 727, 730, 733, 736, 739, 742, 745, 748, 754, 757, 760, 763, 766, 772, 775, 778, 781, 784, 787, 790, 793, 796, 799, 802, 805, 808, 811, 814, 817, 820, 823, 826, 829, 832, 835, 838, 844, 847, 850, 853, 859, 862, 868, 874, 877, 880, 883, 886, 889, 892, 895, 898, 901, 907, 910, 913, 916, 919, 922, 925, 928, 931, 934, 937, 943, 946, 949, 952, 955, 958, 961, 967, 970, 973, 976, 979, 982, 988, 991, 994, 997]
Discarding 182 places :
Implicit Place search using SMT only with invariants took 30100 ms to find 182 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 818/1000 places, 40400/40400 transitions.
Applied a total of 0 rules in 690 ms. Remains 818 /818 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 31573 ms. Remains : 818/1000 places, 40400/40400 transitions.
RANDOM walk for 40000 steps (8 resets) in 4019 ms. (9 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 266 ms. (149 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 313 ms. (127 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 308 ms. (129 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 329 ms. (121 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 281 ms. (141 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 319 ms. (125 steps per ms) remains 5/6 properties
FORMULA Dekker-PT-200-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-05-31 20:24:59] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 818 cols
[2024-05-31 20:24:59] [INFO ] Computed 418 invariants in 19 ms
[2024-05-31 20:25:00] [INFO ] State equation strengthened by 200 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 68/68 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 110/178 variables, 74/142 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 110/252 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 54/232 variables, 42/294 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 54/348 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 13/245 variables, 13/361 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 13/374 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 232/477 variables, 245/619 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/477 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 284/761 variables, 200/819 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/761 variables, 0/819 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 715/1476 variables, 431/1250 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1476 variables, 431/1681 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1476 variables, 137/1818 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1476 variables, 0/1818 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 142/1618 variables, 147/1965 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1618 variables, 142/2107 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1618 variables, 5/2112 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1618 variables, 142/2254 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1618 variables, 0/2254 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 0/1618 variables, 0/2254 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1618/1618 variables, and 2254 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1159 ms.
Refiners :[Domain max(s): 818/818 constraints, Positive P Invariants (semi-flows): 400/400 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 818/818 constraints, ReadFeed: 200/200 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 68/68 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 110/178 variables, 74/142 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 110/252 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 20:25:02] [INFO ] Deduced a trap composed of 4 places in 319 ms of which 1 ms to minimize.
[2024-05-31 20:25:02] [INFO ] Deduced a trap composed of 4 places in 324 ms of which 1 ms to minimize.
[2024-05-31 20:25:02] [INFO ] Deduced a trap composed of 4 places in 317 ms of which 1 ms to minimize.
[2024-05-31 20:25:03] [INFO ] Deduced a trap composed of 4 places in 319 ms of which 0 ms to minimize.
[2024-05-31 20:25:03] [INFO ] Deduced a trap composed of 4 places in 253 ms of which 0 ms to minimize.
[2024-05-31 20:25:03] [INFO ] Deduced a trap composed of 4 places in 244 ms of which 0 ms to minimize.
[2024-05-31 20:25:03] [INFO ] Deduced a trap composed of 4 places in 236 ms of which 1 ms to minimize.
[2024-05-31 20:25:04] [INFO ] Deduced a trap composed of 4 places in 225 ms of which 1 ms to minimize.
[2024-05-31 20:25:04] [INFO ] Deduced a trap composed of 4 places in 224 ms of which 1 ms to minimize.
[2024-05-31 20:25:04] [INFO ] Deduced a trap composed of 4 places in 210 ms of which 0 ms to minimize.
[2024-05-31 20:25:04] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 1 ms to minimize.
[2024-05-31 20:25:04] [INFO ] Deduced a trap composed of 4 places in 179 ms of which 0 ms to minimize.
[2024-05-31 20:25:05] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 1 ms to minimize.
[2024-05-31 20:25:05] [INFO ] Deduced a trap composed of 4 places in 187 ms of which 1 ms to minimize.
[2024-05-31 20:25:05] [INFO ] Deduced a trap composed of 4 places in 168 ms of which 1 ms to minimize.
[2024-05-31 20:25:05] [INFO ] Deduced a trap composed of 4 places in 260 ms of which 1 ms to minimize.
[2024-05-31 20:25:05] [INFO ] Deduced a trap composed of 4 places in 250 ms of which 0 ms to minimize.
[2024-05-31 20:25:06] [INFO ] Deduced a trap composed of 4 places in 244 ms of which 1 ms to minimize.
[2024-05-31 20:25:06] [INFO ] Deduced a trap composed of 4 places in 233 ms of which 0 ms to minimize.
[2024-05-31 20:25:06] [INFO ] Deduced a trap composed of 4 places in 223 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 20/272 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 20:25:06] [INFO ] Deduced a trap composed of 4 places in 260 ms of which 0 ms to minimize.
[2024-05-31 20:25:07] [INFO ] Deduced a trap composed of 4 places in 204 ms of which 1 ms to minimize.
[2024-05-31 20:25:07] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 0 ms to minimize.
[2024-05-31 20:25:07] [INFO ] Deduced a trap composed of 4 places in 253 ms of which 0 ms to minimize.
[2024-05-31 20:25:07] [INFO ] Deduced a trap composed of 4 places in 235 ms of which 1 ms to minimize.
[2024-05-31 20:25:08] [INFO ] Deduced a trap composed of 4 places in 186 ms of which 0 ms to minimize.
[2024-05-31 20:25:08] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 1 ms to minimize.
[2024-05-31 20:25:08] [INFO ] Deduced a trap composed of 4 places in 218 ms of which 0 ms to minimize.
[2024-05-31 20:25:08] [INFO ] Deduced a trap composed of 4 places in 167 ms of which 0 ms to minimize.
[2024-05-31 20:25:08] [INFO ] Deduced a trap composed of 4 places in 223 ms of which 0 ms to minimize.
[2024-05-31 20:25:09] [INFO ] Deduced a trap composed of 4 places in 182 ms of which 0 ms to minimize.
[2024-05-31 20:25:09] [INFO ] Deduced a trap composed of 4 places in 207 ms of which 0 ms to minimize.
[2024-05-31 20:25:09] [INFO ] Deduced a trap composed of 4 places in 182 ms of which 0 ms to minimize.
[2024-05-31 20:25:09] [INFO ] Deduced a trap composed of 4 places in 171 ms of which 0 ms to minimize.
[2024-05-31 20:25:09] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 0 ms to minimize.
[2024-05-31 20:25:09] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 1 ms to minimize.
[2024-05-31 20:25:10] [INFO ] Deduced a trap composed of 4 places in 213 ms of which 0 ms to minimize.
[2024-05-31 20:25:10] [INFO ] Deduced a trap composed of 4 places in 199 ms of which 1 ms to minimize.
[2024-05-31 20:25:10] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 1 ms to minimize.
[2024-05-31 20:25:10] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 20/292 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 20:25:11] [INFO ] Deduced a trap composed of 4 places in 201 ms of which 1 ms to minimize.
[2024-05-31 20:25:11] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 0 ms to minimize.
[2024-05-31 20:25:11] [INFO ] Deduced a trap composed of 4 places in 219 ms of which 1 ms to minimize.
[2024-05-31 20:25:11] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 0 ms to minimize.
[2024-05-31 20:25:11] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 1 ms to minimize.
[2024-05-31 20:25:12] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 1 ms to minimize.
[2024-05-31 20:25:12] [INFO ] Deduced a trap composed of 4 places in 171 ms of which 1 ms to minimize.
[2024-05-31 20:25:12] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 1 ms to minimize.
[2024-05-31 20:25:12] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 0 ms to minimize.
[2024-05-31 20:25:12] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 0 ms to minimize.
[2024-05-31 20:25:12] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 0 ms to minimize.
[2024-05-31 20:25:13] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 0 ms to minimize.
[2024-05-31 20:25:13] [INFO ] Deduced a trap composed of 4 places in 165 ms of which 0 ms to minimize.
[2024-05-31 20:25:13] [INFO ] Deduced a trap composed of 4 places in 175 ms of which 1 ms to minimize.
[2024-05-31 20:25:13] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 0 ms to minimize.
[2024-05-31 20:25:13] [INFO ] Deduced a trap composed of 4 places in 168 ms of which 0 ms to minimize.
[2024-05-31 20:25:14] [INFO ] Deduced a trap composed of 4 places in 180 ms of which 0 ms to minimize.
[2024-05-31 20:25:14] [INFO ] Deduced a trap composed of 4 places in 169 ms of which 0 ms to minimize.
[2024-05-31 20:25:14] [INFO ] Deduced a trap composed of 4 places in 161 ms of which 0 ms to minimize.
[2024-05-31 20:25:14] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 20/312 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 20:25:14] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 1 ms to minimize.
[2024-05-31 20:25:15] [INFO ] Deduced a trap composed of 4 places in 171 ms of which 0 ms to minimize.
[2024-05-31 20:25:15] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 0 ms to minimize.
[2024-05-31 20:25:15] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 1 ms to minimize.
[2024-05-31 20:25:15] [INFO ] Deduced a trap composed of 4 places in 167 ms of which 0 ms to minimize.
[2024-05-31 20:25:15] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 0 ms to minimize.
[2024-05-31 20:25:16] [INFO ] Deduced a trap composed of 4 places in 160 ms of which 1 ms to minimize.
[2024-05-31 20:25:16] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 8/320 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 54/232 variables, 42/362 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/232 variables, 54/416 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 20:25:16] [INFO ] Deduced a trap composed of 4 places in 204 ms of which 0 ms to minimize.
[2024-05-31 20:25:17] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 1 ms to minimize.
[2024-05-31 20:25:17] [INFO ] Deduced a trap composed of 4 places in 224 ms of which 1 ms to minimize.
[2024-05-31 20:25:17] [INFO ] Deduced a trap composed of 4 places in 174 ms of which 1 ms to minimize.
[2024-05-31 20:25:17] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 0 ms to minimize.
[2024-05-31 20:25:17] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 0 ms to minimize.
[2024-05-31 20:25:18] [INFO ] Deduced a trap composed of 6 places in 218 ms of which 0 ms to minimize.
[2024-05-31 20:25:18] [INFO ] Deduced a trap composed of 4 places in 208 ms of which 0 ms to minimize.
[2024-05-31 20:25:18] [INFO ] Deduced a trap composed of 4 places in 171 ms of which 1 ms to minimize.
[2024-05-31 20:25:18] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 0 ms to minimize.
[2024-05-31 20:25:18] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 0 ms to minimize.
[2024-05-31 20:25:19] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 0 ms to minimize.
[2024-05-31 20:25:19] [INFO ] Deduced a trap composed of 4 places in 186 ms of which 0 ms to minimize.
[2024-05-31 20:25:19] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 0 ms to minimize.
[2024-05-31 20:25:19] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 0 ms to minimize.
[2024-05-31 20:25:19] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 1 ms to minimize.
[2024-05-31 20:25:20] [INFO ] Deduced a trap composed of 4 places in 165 ms of which 1 ms to minimize.
[2024-05-31 20:25:20] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 0 ms to minimize.
[2024-05-31 20:25:20] [INFO ] Deduced a trap composed of 4 places in 195 ms of which 1 ms to minimize.
[2024-05-31 20:25:20] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/232 variables, 20/436 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 20:25:20] [INFO ] Deduced a trap composed of 4 places in 207 ms of which 1 ms to minimize.
[2024-05-31 20:25:21] [INFO ] Deduced a trap composed of 4 places in 171 ms of which 1 ms to minimize.
[2024-05-31 20:25:21] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 1 ms to minimize.
[2024-05-31 20:25:21] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 1 ms to minimize.
[2024-05-31 20:25:21] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 1 ms to minimize.
[2024-05-31 20:25:22] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 1 ms to minimize.
[2024-05-31 20:25:22] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 1 ms to minimize.
[2024-05-31 20:25:22] [INFO ] Deduced a trap composed of 4 places in 167 ms of which 0 ms to minimize.
[2024-05-31 20:25:22] [INFO ] Deduced a trap composed of 5 places in 159 ms of which 0 ms to minimize.
[2024-05-31 20:25:22] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 0 ms to minimize.
[2024-05-31 20:25:23] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 1 ms to minimize.
[2024-05-31 20:25:23] [INFO ] Deduced a trap composed of 5 places in 150 ms of which 1 ms to minimize.
[2024-05-31 20:25:23] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 0 ms to minimize.
[2024-05-31 20:25:23] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 1 ms to minimize.
[2024-05-31 20:25:23] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 0 ms to minimize.
[2024-05-31 20:25:23] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 0 ms to minimize.
[2024-05-31 20:25:24] [INFO ] Deduced a trap composed of 4 places in 160 ms of which 0 ms to minimize.
[2024-05-31 20:25:24] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 1 ms to minimize.
[2024-05-31 20:25:24] [INFO ] Deduced a trap composed of 4 places in 137 ms of which 1 ms to minimize.
[2024-05-31 20:25:24] [INFO ] Deduced a trap composed of 4 places in 177 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/232 variables, 20/456 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 20:25:25] [INFO ] Deduced a trap composed of 4 places in 175 ms of which 1 ms to minimize.
[2024-05-31 20:25:25] [INFO ] Deduced a trap composed of 4 places in 161 ms of which 0 ms to minimize.
[2024-05-31 20:25:25] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 0 ms to minimize.
[2024-05-31 20:25:25] [INFO ] Deduced a trap composed of 4 places in 133 ms of which 0 ms to minimize.
[2024-05-31 20:25:25] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 1 ms to minimize.
[2024-05-31 20:25:25] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 1 ms to minimize.
[2024-05-31 20:25:26] [INFO ] Deduced a trap composed of 5 places in 155 ms of which 0 ms to minimize.
[2024-05-31 20:25:26] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 0 ms to minimize.
[2024-05-31 20:25:26] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 1 ms to minimize.
[2024-05-31 20:25:26] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 0 ms to minimize.
[2024-05-31 20:25:26] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 0 ms to minimize.
[2024-05-31 20:25:26] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 0 ms to minimize.
[2024-05-31 20:25:27] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 1 ms to minimize.
[2024-05-31 20:25:27] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 0 ms to minimize.
[2024-05-31 20:25:27] [INFO ] Deduced a trap composed of 4 places in 162 ms of which 0 ms to minimize.
[2024-05-31 20:25:27] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 1 ms to minimize.
[2024-05-31 20:25:27] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/232 variables, 17/473 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/232 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 13/245 variables, 13/486 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/245 variables, 13/499 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/245 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 232/477 variables, 245/744 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/477 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 284/761 variables, 200/944 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 20:25:30] [INFO ] Deduced a trap composed of 4 places in 202 ms of which 0 ms to minimize.
[2024-05-31 20:25:30] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 0 ms to minimize.
[2024-05-31 20:25:30] [INFO ] Deduced a trap composed of 4 places in 177 ms of which 0 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/761 variables, 3/947 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/761 variables, 0/947 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 715/1476 variables, 431/1378 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1476 variables, 431/1809 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1476 variables, 137/1946 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1476 variables, 5/1951 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 20:25:33] [INFO ] Deduced a trap composed of 4 places in 667 ms of which 1 ms to minimize.
[2024-05-31 20:25:33] [INFO ] Deduced a trap composed of 4 places in 673 ms of which 1 ms to minimize.
[2024-05-31 20:25:34] [INFO ] Deduced a trap composed of 4 places in 695 ms of which 0 ms to minimize.
[2024-05-31 20:25:35] [INFO ] Deduced a trap composed of 4 places in 663 ms of which 0 ms to minimize.
[2024-05-31 20:25:35] [INFO ] Deduced a trap composed of 4 places in 675 ms of which 1 ms to minimize.
[2024-05-31 20:25:36] [INFO ] Deduced a trap composed of 4 places in 671 ms of which 1 ms to minimize.
[2024-05-31 20:25:37] [INFO ] Deduced a trap composed of 4 places in 647 ms of which 1 ms to minimize.
[2024-05-31 20:25:38] [INFO ] Deduced a trap composed of 4 places in 622 ms of which 1 ms to minimize.
[2024-05-31 20:25:38] [INFO ] Deduced a trap composed of 4 places in 632 ms of which 0 ms to minimize.
[2024-05-31 20:25:39] [INFO ] Deduced a trap composed of 4 places in 628 ms of which 1 ms to minimize.
[2024-05-31 20:25:40] [INFO ] Deduced a trap composed of 4 places in 632 ms of which 1 ms to minimize.
[2024-05-31 20:25:40] [INFO ] Deduced a trap composed of 4 places in 621 ms of which 1 ms to minimize.
[2024-05-31 20:25:41] [INFO ] Deduced a trap composed of 4 places in 595 ms of which 1 ms to minimize.
[2024-05-31 20:25:41] [INFO ] Deduced a trap composed of 4 places in 559 ms of which 1 ms to minimize.
[2024-05-31 20:25:42] [INFO ] Deduced a trap composed of 4 places in 587 ms of which 1 ms to minimize.
[2024-05-31 20:25:43] [INFO ] Deduced a trap composed of 4 places in 604 ms of which 1 ms to minimize.
[2024-05-31 20:25:43] [INFO ] Deduced a trap composed of 4 places in 557 ms of which 0 ms to minimize.
[2024-05-31 20:25:44] [INFO ] Deduced a trap composed of 4 places in 519 ms of which 1 ms to minimize.
[2024-05-31 20:25:44] [INFO ] Deduced a trap composed of 4 places in 499 ms of which 1 ms to minimize.
[2024-05-31 20:25:45] [INFO ] Deduced a trap composed of 4 places in 545 ms of which 1 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/1476 variables, 20/1971 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 20:25:46] [INFO ] Deduced a trap composed of 4 places in 614 ms of which 1 ms to minimize.
[2024-05-31 20:25:47] [INFO ] Deduced a trap composed of 4 places in 557 ms of which 1 ms to minimize.
[2024-05-31 20:25:47] [INFO ] Deduced a trap composed of 4 places in 587 ms of which 1 ms to minimize.
[2024-05-31 20:25:48] [INFO ] Deduced a trap composed of 4 places in 585 ms of which 0 ms to minimize.
[2024-05-31 20:25:48] [INFO ] Deduced a trap composed of 4 places in 510 ms of which 0 ms to minimize.
[2024-05-31 20:25:49] [INFO ] Deduced a trap composed of 4 places in 534 ms of which 1 ms to minimize.
[2024-05-31 20:25:50] [INFO ] Deduced a trap composed of 4 places in 532 ms of which 1 ms to minimize.
[2024-05-31 20:25:50] [INFO ] Deduced a trap composed of 4 places in 523 ms of which 1 ms to minimize.
[2024-05-31 20:25:51] [INFO ] Deduced a trap composed of 4 places in 487 ms of which 0 ms to minimize.
[2024-05-31 20:25:51] [INFO ] Deduced a trap composed of 4 places in 472 ms of which 1 ms to minimize.
[2024-05-31 20:25:52] [INFO ] Deduced a trap composed of 4 places in 507 ms of which 1 ms to minimize.
[2024-05-31 20:25:52] [INFO ] Deduced a trap composed of 4 places in 458 ms of which 1 ms to minimize.
[2024-05-31 20:25:53] [INFO ] Deduced a trap composed of 4 places in 455 ms of which 0 ms to minimize.
[2024-05-31 20:25:53] [INFO ] Deduced a trap composed of 4 places in 466 ms of which 1 ms to minimize.
[2024-05-31 20:25:54] [INFO ] Deduced a trap composed of 4 places in 478 ms of which 1 ms to minimize.
[2024-05-31 20:25:54] [INFO ] Deduced a trap composed of 4 places in 455 ms of which 1 ms to minimize.
[2024-05-31 20:25:55] [INFO ] Deduced a trap composed of 4 places in 471 ms of which 1 ms to minimize.
[2024-05-31 20:25:55] [INFO ] Deduced a trap composed of 4 places in 468 ms of which 0 ms to minimize.
[2024-05-31 20:25:56] [INFO ] Deduced a trap composed of 4 places in 435 ms of which 1 ms to minimize.
[2024-05-31 20:25:56] [INFO ] Deduced a trap composed of 4 places in 425 ms of which 1 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/1476 variables, 20/1991 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 20:25:57] [INFO ] Deduced a trap composed of 4 places in 484 ms of which 0 ms to minimize.
[2024-05-31 20:25:58] [INFO ] Deduced a trap composed of 4 places in 481 ms of which 0 ms to minimize.
[2024-05-31 20:25:58] [INFO ] Deduced a trap composed of 4 places in 422 ms of which 0 ms to minimize.
[2024-05-31 20:25:58] [INFO ] Deduced a trap composed of 4 places in 436 ms of which 0 ms to minimize.
[2024-05-31 20:25:59] [INFO ] Deduced a trap composed of 4 places in 462 ms of which 1 ms to minimize.
[2024-05-31 20:25:59] [INFO ] Deduced a trap composed of 4 places in 447 ms of which 0 ms to minimize.
[2024-05-31 20:26:00] [INFO ] Deduced a trap composed of 4 places in 435 ms of which 0 ms to minimize.
[2024-05-31 20:26:00] [INFO ] Deduced a trap composed of 4 places in 382 ms of which 0 ms to minimize.
[2024-05-31 20:26:01] [INFO ] Deduced a trap composed of 4 places in 396 ms of which 2 ms to minimize.
[2024-05-31 20:26:01] [INFO ] Deduced a trap composed of 4 places in 402 ms of which 1 ms to minimize.
[2024-05-31 20:26:02] [INFO ] Deduced a trap composed of 4 places in 416 ms of which 1 ms to minimize.
[2024-05-31 20:26:02] [INFO ] Deduced a trap composed of 4 places in 425 ms of which 1 ms to minimize.
[2024-05-31 20:26:03] [INFO ] Deduced a trap composed of 4 places in 384 ms of which 1 ms to minimize.
[2024-05-31 20:26:03] [INFO ] Deduced a trap composed of 4 places in 412 ms of which 1 ms to minimize.
[2024-05-31 20:26:03] [INFO ] Deduced a trap composed of 4 places in 401 ms of which 1 ms to minimize.
[2024-05-31 20:26:04] [INFO ] Deduced a trap composed of 4 places in 404 ms of which 1 ms to minimize.
[2024-05-31 20:26:04] [INFO ] Deduced a trap composed of 4 places in 386 ms of which 1 ms to minimize.
[2024-05-31 20:26:05] [INFO ] Deduced a trap composed of 4 places in 361 ms of which 1 ms to minimize.
[2024-05-31 20:26:05] [INFO ] Deduced a trap composed of 4 places in 393 ms of which 1 ms to minimize.
[2024-05-31 20:26:06] [INFO ] Deduced a trap composed of 4 places in 351 ms of which 1 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/1476 variables, 20/2011 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 20:26:06] [INFO ] Deduced a trap composed of 4 places in 378 ms of which 1 ms to minimize.
[2024-05-31 20:26:07] [INFO ] Deduced a trap composed of 4 places in 355 ms of which 1 ms to minimize.
[2024-05-31 20:26:07] [INFO ] Deduced a trap composed of 4 places in 337 ms of which 1 ms to minimize.
[2024-05-31 20:26:07] [INFO ] Deduced a trap composed of 4 places in 358 ms of which 0 ms to minimize.
[2024-05-31 20:26:08] [INFO ] Deduced a trap composed of 4 places in 350 ms of which 1 ms to minimize.
[2024-05-31 20:26:08] [INFO ] Deduced a trap composed of 4 places in 353 ms of which 0 ms to minimize.
[2024-05-31 20:26:09] [INFO ] Deduced a trap composed of 4 places in 353 ms of which 1 ms to minimize.
[2024-05-31 20:26:09] [INFO ] Deduced a trap composed of 4 places in 358 ms of which 0 ms to minimize.
[2024-05-31 20:26:09] [INFO ] Deduced a trap composed of 4 places in 359 ms of which 1 ms to minimize.
[2024-05-31 20:26:10] [INFO ] Deduced a trap composed of 4 places in 349 ms of which 1 ms to minimize.
[2024-05-31 20:26:10] [INFO ] Deduced a trap composed of 4 places in 326 ms of which 1 ms to minimize.
[2024-05-31 20:26:11] [INFO ] Deduced a trap composed of 4 places in 335 ms of which 0 ms to minimize.
[2024-05-31 20:26:11] [INFO ] Deduced a trap composed of 4 places in 342 ms of which 1 ms to minimize.
[2024-05-31 20:26:11] [INFO ] Deduced a trap composed of 4 places in 381 ms of which 1 ms to minimize.
[2024-05-31 20:26:12] [INFO ] Deduced a trap composed of 4 places in 327 ms of which 1 ms to minimize.
[2024-05-31 20:26:12] [INFO ] Deduced a trap composed of 4 places in 310 ms of which 0 ms to minimize.
[2024-05-31 20:26:12] [INFO ] Deduced a trap composed of 4 places in 296 ms of which 1 ms to minimize.
[2024-05-31 20:26:13] [INFO ] Deduced a trap composed of 4 places in 288 ms of which 0 ms to minimize.
[2024-05-31 20:26:13] [INFO ] Deduced a trap composed of 4 places in 289 ms of which 1 ms to minimize.
[2024-05-31 20:26:13] [INFO ] Deduced a trap composed of 4 places in 285 ms of which 0 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/1476 variables, 20/2031 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 20:26:14] [INFO ] Deduced a trap composed of 4 places in 324 ms of which 1 ms to minimize.
[2024-05-31 20:26:14] [INFO ] Deduced a trap composed of 4 places in 276 ms of which 1 ms to minimize.
[2024-05-31 20:26:15] [INFO ] Deduced a trap composed of 4 places in 273 ms of which 0 ms to minimize.
[2024-05-31 20:26:15] [INFO ] Deduced a trap composed of 4 places in 258 ms of which 1 ms to minimize.
[2024-05-31 20:26:15] [INFO ] Deduced a trap composed of 4 places in 271 ms of which 1 ms to minimize.
[2024-05-31 20:26:16] [INFO ] Deduced a trap composed of 4 places in 251 ms of which 0 ms to minimize.
[2024-05-31 20:26:16] [INFO ] Deduced a trap composed of 4 places in 249 ms of which 1 ms to minimize.
[2024-05-31 20:26:16] [INFO ] Deduced a trap composed of 4 places in 329 ms of which 0 ms to minimize.
[2024-05-31 20:26:17] [INFO ] Deduced a trap composed of 4 places in 257 ms of which 1 ms to minimize.
[2024-05-31 20:26:17] [INFO ] Deduced a trap composed of 4 places in 291 ms of which 0 ms to minimize.
[2024-05-31 20:26:17] [INFO ] Deduced a trap composed of 4 places in 291 ms of which 1 ms to minimize.
[2024-05-31 20:26:18] [INFO ] Deduced a trap composed of 4 places in 282 ms of which 0 ms to minimize.
[2024-05-31 20:26:18] [INFO ] Deduced a trap composed of 4 places in 254 ms of which 0 ms to minimize.
[2024-05-31 20:26:18] [INFO ] Deduced a trap composed of 4 places in 282 ms of which 0 ms to minimize.
[2024-05-31 20:26:18] [INFO ] Deduced a trap composed of 4 places in 256 ms of which 1 ms to minimize.
[2024-05-31 20:26:19] [INFO ] Deduced a trap composed of 4 places in 242 ms of which 1 ms to minimize.
[2024-05-31 20:26:19] [INFO ] Deduced a trap composed of 4 places in 225 ms of which 0 ms to minimize.
[2024-05-31 20:26:19] [INFO ] Deduced a trap composed of 4 places in 256 ms of which 1 ms to minimize.
[2024-05-31 20:26:20] [INFO ] Deduced a trap composed of 4 places in 236 ms of which 0 ms to minimize.
[2024-05-31 20:26:20] [INFO ] Deduced a trap composed of 4 places in 254 ms of which 0 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/1476 variables, 20/2051 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 20:26:20] [INFO ] Deduced a trap composed of 4 places in 247 ms of which 1 ms to minimize.
[2024-05-31 20:26:21] [INFO ] Deduced a trap composed of 4 places in 235 ms of which 1 ms to minimize.
[2024-05-31 20:26:21] [INFO ] Deduced a trap composed of 4 places in 238 ms of which 1 ms to minimize.
[2024-05-31 20:26:21] [INFO ] Deduced a trap composed of 4 places in 234 ms of which 1 ms to minimize.
[2024-05-31 20:26:22] [INFO ] Deduced a trap composed of 4 places in 220 ms of which 0 ms to minimize.
[2024-05-31 20:26:22] [INFO ] Deduced a trap composed of 4 places in 227 ms of which 0 ms to minimize.
[2024-05-31 20:26:22] [INFO ] Deduced a trap composed of 4 places in 209 ms of which 1 ms to minimize.
[2024-05-31 20:26:22] [INFO ] Deduced a trap composed of 4 places in 225 ms of which 1 ms to minimize.
[2024-05-31 20:26:23] [INFO ] Deduced a trap composed of 4 places in 207 ms of which 1 ms to minimize.
[2024-05-31 20:26:23] [INFO ] Deduced a trap composed of 4 places in 222 ms of which 1 ms to minimize.
[2024-05-31 20:26:23] [INFO ] Deduced a trap composed of 4 places in 220 ms of which 1 ms to minimize.
[2024-05-31 20:26:23] [INFO ] Deduced a trap composed of 4 places in 207 ms of which 1 ms to minimize.
[2024-05-31 20:26:24] [INFO ] Deduced a trap composed of 4 places in 359 ms of which 1 ms to minimize.
[2024-05-31 20:26:24] [INFO ] Deduced a trap composed of 4 places in 336 ms of which 1 ms to minimize.
[2024-05-31 20:26:24] [INFO ] Deduced a trap composed of 4 places in 325 ms of which 1 ms to minimize.
[2024-05-31 20:26:25] [INFO ] Deduced a trap composed of 4 places in 308 ms of which 1 ms to minimize.
[2024-05-31 20:26:25] [INFO ] Deduced a trap composed of 4 places in 302 ms of which 0 ms to minimize.
[2024-05-31 20:26:26] [INFO ] Deduced a trap composed of 4 places in 273 ms of which 1 ms to minimize.
[2024-05-31 20:26:26] [INFO ] Deduced a trap composed of 5 places in 252 ms of which 1 ms to minimize.
[2024-05-31 20:26:26] [INFO ] Deduced a trap composed of 4 places in 280 ms of which 0 ms to minimize.
At refinement iteration 32 (INCLUDED_ONLY) 0/1476 variables, 20/2071 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 20:26:27] [INFO ] Deduced a trap composed of 4 places in 368 ms of which 0 ms to minimize.
[2024-05-31 20:26:27] [INFO ] Deduced a trap composed of 4 places in 361 ms of which 1 ms to minimize.
[2024-05-31 20:26:28] [INFO ] Deduced a trap composed of 4 places in 374 ms of which 1 ms to minimize.
[2024-05-31 20:26:28] [INFO ] Deduced a trap composed of 4 places in 355 ms of which 0 ms to minimize.
[2024-05-31 20:26:28] [INFO ] Deduced a trap composed of 4 places in 350 ms of which 1 ms to minimize.
[2024-05-31 20:26:29] [INFO ] Deduced a trap composed of 4 places in 352 ms of which 0 ms to minimize.
[2024-05-31 20:26:29] [INFO ] Deduced a trap composed of 4 places in 351 ms of which 1 ms to minimize.
[2024-05-31 20:26:30] [INFO ] Deduced a trap composed of 4 places in 326 ms of which 0 ms to minimize.
[2024-05-31 20:26:30] [INFO ] Deduced a trap composed of 4 places in 371 ms of which 0 ms to minimize.
[2024-05-31 20:26:30] [INFO ] Deduced a trap composed of 4 places in 340 ms of which 1 ms to minimize.
[2024-05-31 20:26:31] [INFO ] Deduced a trap composed of 4 places in 342 ms of which 1 ms to minimize.
[2024-05-31 20:26:31] [INFO ] Deduced a trap composed of 4 places in 357 ms of which 1 ms to minimize.
[2024-05-31 20:26:32] [INFO ] Deduced a trap composed of 4 places in 341 ms of which 0 ms to minimize.
[2024-05-31 20:26:32] [INFO ] Deduced a trap composed of 4 places in 363 ms of which 1 ms to minimize.
[2024-05-31 20:26:32] [INFO ] Deduced a trap composed of 4 places in 329 ms of which 0 ms to minimize.
[2024-05-31 20:26:33] [INFO ] Deduced a trap composed of 4 places in 335 ms of which 2 ms to minimize.
[2024-05-31 20:26:33] [INFO ] Deduced a trap composed of 4 places in 315 ms of which 1 ms to minimize.
[2024-05-31 20:26:33] [INFO ] Deduced a trap composed of 4 places in 306 ms of which 0 ms to minimize.
[2024-05-31 20:26:34] [INFO ] Deduced a trap composed of 5 places in 320 ms of which 0 ms to minimize.
[2024-05-31 20:26:34] [INFO ] Deduced a trap composed of 4 places in 319 ms of which 0 ms to minimize.
At refinement iteration 33 (INCLUDED_ONLY) 0/1476 variables, 20/2091 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 20:26:35] [INFO ] Deduced a trap composed of 4 places in 298 ms of which 1 ms to minimize.
[2024-05-31 20:26:35] [INFO ] Deduced a trap composed of 4 places in 300 ms of which 1 ms to minimize.
[2024-05-31 20:26:36] [INFO ] Deduced a trap composed of 4 places in 292 ms of which 1 ms to minimize.
[2024-05-31 20:26:36] [INFO ] Deduced a trap composed of 4 places in 289 ms of which 0 ms to minimize.
[2024-05-31 20:26:36] [INFO ] Deduced a trap composed of 4 places in 271 ms of which 0 ms to minimize.
[2024-05-31 20:26:36] [INFO ] Deduced a trap composed of 4 places in 260 ms of which 1 ms to minimize.
[2024-05-31 20:26:37] [INFO ] Deduced a trap composed of 4 places in 260 ms of which 0 ms to minimize.
[2024-05-31 20:26:37] [INFO ] Deduced a trap composed of 6 places in 256 ms of which 1 ms to minimize.
[2024-05-31 20:26:37] [INFO ] Deduced a trap composed of 6 places in 247 ms of which 0 ms to minimize.
[2024-05-31 20:26:38] [INFO ] Deduced a trap composed of 6 places in 239 ms of which 1 ms to minimize.
[2024-05-31 20:26:38] [INFO ] Deduced a trap composed of 4 places in 239 ms of which 1 ms to minimize.
[2024-05-31 20:26:38] [INFO ] Deduced a trap composed of 4 places in 245 ms of which 1 ms to minimize.
[2024-05-31 20:26:38] [INFO ] Deduced a trap composed of 4 places in 214 ms of which 0 ms to minimize.
[2024-05-31 20:26:39] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 1 ms to minimize.
[2024-05-31 20:26:39] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 1 ms to minimize.
[2024-05-31 20:26:39] [INFO ] Deduced a trap composed of 4 places in 237 ms of which 1 ms to minimize.
[2024-05-31 20:26:39] [INFO ] Deduced a trap composed of 4 places in 223 ms of which 0 ms to minimize.
[2024-05-31 20:26:40] [INFO ] Deduced a trap composed of 4 places in 235 ms of which 0 ms to minimize.
[2024-05-31 20:26:40] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 1 ms to minimize.
[2024-05-31 20:26:40] [INFO ] Deduced a trap composed of 4 places in 185 ms of which 1 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/1476 variables, 20/2111 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 20:26:41] [INFO ] Deduced a trap composed of 6 places in 284 ms of which 0 ms to minimize.
[2024-05-31 20:26:41] [INFO ] Deduced a trap composed of 4 places in 313 ms of which 0 ms to minimize.
[2024-05-31 20:26:42] [INFO ] Deduced a trap composed of 4 places in 303 ms of which 1 ms to minimize.
[2024-05-31 20:26:42] [INFO ] Deduced a trap composed of 4 places in 313 ms of which 1 ms to minimize.
[2024-05-31 20:26:42] [INFO ] Deduced a trap composed of 6 places in 274 ms of which 0 ms to minimize.
[2024-05-31 20:26:43] [INFO ] Deduced a trap composed of 4 places in 258 ms of which 0 ms to minimize.
[2024-05-31 20:26:43] [INFO ] Deduced a trap composed of 6 places in 297 ms of which 0 ms to minimize.
[2024-05-31 20:26:43] [INFO ] Deduced a trap composed of 4 places in 261 ms of which 1 ms to minimize.
[2024-05-31 20:26:43] [INFO ] Deduced a trap composed of 6 places in 274 ms of which 0 ms to minimize.
[2024-05-31 20:26:44] [INFO ] Deduced a trap composed of 4 places in 288 ms of which 1 ms to minimize.
[2024-05-31 20:26:44] [INFO ] Deduced a trap composed of 6 places in 266 ms of which 0 ms to minimize.
[2024-05-31 20:26:44] [INFO ] Deduced a trap composed of 4 places in 279 ms of which 1 ms to minimize.
[2024-05-31 20:26:45] [INFO ] Deduced a trap composed of 4 places in 264 ms of which 1 ms to minimize.
[2024-05-31 20:26:45] [INFO ] Deduced a trap composed of 6 places in 260 ms of which 1 ms to minimize.
[2024-05-31 20:26:45] [INFO ] Deduced a trap composed of 6 places in 264 ms of which 1 ms to minimize.
[2024-05-31 20:26:46] [INFO ] Deduced a trap composed of 4 places in 259 ms of which 0 ms to minimize.
[2024-05-31 20:26:46] [INFO ] Deduced a trap composed of 4 places in 282 ms of which 1 ms to minimize.
SMT process timed out in 106538ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
FORMULA Dekker-PT-200-ReachabilityCardinality-2024-06 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 14062 ms.
Support contains 68 out of 818 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 818/818 places, 40400/40400 transitions.
Applied a total of 0 rules in 698 ms. Remains 818 /818 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 698 ms. Remains : 818/818 places, 40400/40400 transitions.
[2024-05-31 20:27:01] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2024-05-31 20:27:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 818 places, 40400 transitions and 283818 arcs took 156 ms.
[2024-05-31 20:27:03] [INFO ] Flatten gal took : 1905 ms
Total runtime 431331 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : Dekker-PT-200-ReachabilityCardinality-2024-02
Could not compute solution for formula : Dekker-PT-200-ReachabilityCardinality-2023-03
Could not compute solution for formula : Dekker-PT-200-ReachabilityCardinality-2023-05
Could not compute solution for formula : Dekker-PT-200-ReachabilityCardinality-2024-07

BK_STOP 1717187224058

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2024
rfs formula name Dekker-PT-200-ReachabilityCardinality-2024-02
rfs formula type EF
rfs formula formula --invariant=/tmp/3609/inv_0_
rfs formula name Dekker-PT-200-ReachabilityCardinality-2023-03
rfs formula type EF
rfs formula formula --invariant=/tmp/3609/inv_1_
rfs formula name Dekker-PT-200-ReachabilityCardinality-2023-05
rfs formula type EF
rfs formula formula --invariant=/tmp/3609/inv_2_
rfs formula name Dekker-PT-200-ReachabilityCardinality-2024-07
rfs formula type AG
rfs formula formula --invariant=/tmp/3609/inv_3_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="Dekker-PT-200"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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 Dekker-PT-200, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r488-tall-171631132000126"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Dekker-PT-200.tgz
mv Dekker-PT-200 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;