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.r528-tall-171683762000878.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 ShieldRVs-PT-100B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683762000878
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 124K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.3M May 18 16:43 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 ShieldRVs-PT-100B-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-2023-03
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-2024-04
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717274090201

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-100B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 20:34:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 20:34:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 20:34:51] [INFO ] Load time of PNML (sax parser for PT used): 235 ms
[2024-06-01 20:34:51] [INFO ] Transformed 4003 places.
[2024-06-01 20:34:51] [INFO ] Transformed 4503 transitions.
[2024-06-01 20:34:51] [INFO ] Found NUPN structural information;
[2024-06-01 20:34:51] [INFO ] Parsed PT model containing 4003 places and 4503 transitions and 14400 arcs in 482 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 1859 ms. (21 steps per ms) remains 3/15 properties
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 428 ms. (93 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 3/3 properties
// Phase 1: matrix 4503 rows 4003 cols
[2024-06-01 20:34:52] [INFO ] Computed 401 invariants in 50 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 2810/2838 variables, 280/308 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2838 variables, 2810/3118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2838 variables, 0/3118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1165/4003 variables, 121/3239 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4003 variables, 1165/4404 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4003 variables, 0/4404 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 4503/8506 variables, 4003/8407 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8506 variables, 0/8407 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/8506 variables, 0/8407 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8506/8506 variables, and 8407 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3368 ms.
Refiners :[Domain max(s): 4003/4003 constraints, Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 4003/4003 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 2810/2838 variables, 280/308 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2838 variables, 2810/3118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 20:34:58] [INFO ] Deduced a trap composed of 53 places in 1263 ms of which 111 ms to minimize.
[2024-06-01 20:34:59] [INFO ] Deduced a trap composed of 22 places in 1052 ms of which 14 ms to minimize.
[2024-06-01 20:35:00] [INFO ] Deduced a trap composed of 62 places in 1048 ms of which 13 ms to minimize.
[2024-06-01 20:35:01] [INFO ] Deduced a trap composed of 92 places in 999 ms of which 12 ms to minimize.
SMT process timed out in 8703ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 28 out of 4003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4003/4003 places, 4503/4503 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 391 transitions
Trivial Post-agglo rules discarded 391 transitions
Performed 391 trivial Post agglomeration. Transition count delta: 391
Iterating post reduction 0 with 391 rules applied. Total rules applied 391 place count 4003 transition count 4112
Reduce places removed 391 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 392 rules applied. Total rules applied 783 place count 3612 transition count 4111
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 784 place count 3611 transition count 4111
Performed 498 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 498 Pre rules applied. Total rules applied 784 place count 3611 transition count 3613
Deduced a syphon composed of 498 places in 14 ms
Reduce places removed 498 places and 0 transitions.
Iterating global reduction 3 with 996 rules applied. Total rules applied 1780 place count 3113 transition count 3613
Discarding 692 places :
Symmetric choice reduction at 3 with 692 rule applications. Total rules 2472 place count 2421 transition count 2921
Iterating global reduction 3 with 692 rules applied. Total rules applied 3164 place count 2421 transition count 2921
Performed 287 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 287 Pre rules applied. Total rules applied 3164 place count 2421 transition count 2634
Deduced a syphon composed of 287 places in 7 ms
Reduce places removed 287 places and 0 transitions.
Iterating global reduction 3 with 574 rules applied. Total rules applied 3738 place count 2134 transition count 2634
Performed 694 Post agglomeration using F-continuation condition.Transition count delta: 694
Deduced a syphon composed of 694 places in 18 ms
Reduce places removed 694 places and 0 transitions.
Iterating global reduction 3 with 1388 rules applied. Total rules applied 5126 place count 1440 transition count 1940
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 201 times.
Drop transitions (Partial Free agglomeration) removed 201 transitions
Iterating global reduction 3 with 201 rules applied. Total rules applied 5327 place count 1440 transition count 1940
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 5328 place count 1439 transition count 1939
Applied a total of 5328 rules in 1438 ms. Remains 1439 /4003 variables (removed 2564) and now considering 1939/4503 (removed 2564) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1448 ms. Remains : 1439/4003 places, 1939/4503 transitions.
RANDOM walk for 40000 steps (32 resets) in 680 ms. (58 steps per ms) remains 1/3 properties
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 355 ms. (112 steps per ms) remains 1/1 properties
// Phase 1: matrix 1939 rows 1439 cols
[2024-06-01 20:35:03] [INFO ] Computed 401 invariants in 11 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 995/1018 variables, 280/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1018 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/1036 variables, 5/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1036 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1438/2474 variables, 1036/1321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2474 variables, 0/1321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 280/2754 variables, 98/1419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2754 variables, 22/1441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2754 variables, 0/1441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 18/2772 variables, 9/1450 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2772 variables, 18/1468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2772 variables, 0/1468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 237/3009 variables, 101/1569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3009 variables, 27/1596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3009 variables, 0/1596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 14/3023 variables, 7/1603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3023 variables, 14/1617 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3023 variables, 0/1617 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 156/3179 variables, 70/1687 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3179 variables, 19/1706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3179 variables, 0/1706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 8/3187 variables, 4/1710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3187 variables, 8/1718 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3187 variables, 0/1718 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 104/3291 variables, 46/1764 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3291 variables, 12/1776 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3291 variables, 0/1776 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 6/3297 variables, 3/1779 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3297 variables, 6/1785 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/3297 variables, 0/1785 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 60/3357 variables, 26/1811 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/3357 variables, 7/1818 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/3357 variables, 0/1818 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 4/3361 variables, 2/1820 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/3361 variables, 4/1824 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/3361 variables, 0/1824 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 17/3378 variables, 12/1836 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/3378 variables, 4/1840 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/3378 variables, 0/1840 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 0/3378 variables, 0/1840 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3378/3378 variables, and 1840 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1247 ms.
Refiners :[Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 1439/1439 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 995/1018 variables, 280/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:35:05] [INFO ] Deduced a trap composed of 8 places in 219 ms of which 3 ms to minimize.
[2024-06-01 20:35:05] [INFO ] Deduced a trap composed of 8 places in 224 ms of which 3 ms to minimize.
[2024-06-01 20:35:05] [INFO ] Deduced a trap composed of 10 places in 203 ms of which 4 ms to minimize.
[2024-06-01 20:35:05] [INFO ] Deduced a trap composed of 8 places in 195 ms of which 3 ms to minimize.
[2024-06-01 20:35:05] [INFO ] Deduced a trap composed of 13 places in 191 ms of which 2 ms to minimize.
[2024-06-01 20:35:06] [INFO ] Deduced a trap composed of 8 places in 168 ms of which 2 ms to minimize.
[2024-06-01 20:35:06] [INFO ] Deduced a trap composed of 8 places in 172 ms of which 2 ms to minimize.
[2024-06-01 20:35:06] [INFO ] Deduced a trap composed of 7 places in 192 ms of which 3 ms to minimize.
[2024-06-01 20:35:06] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 3 ms to minimize.
[2024-06-01 20:35:06] [INFO ] Deduced a trap composed of 8 places in 166 ms of which 3 ms to minimize.
[2024-06-01 20:35:07] [INFO ] Deduced a trap composed of 12 places in 179 ms of which 2 ms to minimize.
[2024-06-01 20:35:07] [INFO ] Deduced a trap composed of 12 places in 186 ms of which 3 ms to minimize.
[2024-06-01 20:35:07] [INFO ] Deduced a trap composed of 12 places in 173 ms of which 3 ms to minimize.
[2024-06-01 20:35:07] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 3 ms to minimize.
[2024-06-01 20:35:07] [INFO ] Deduced a trap composed of 8 places in 159 ms of which 2 ms to minimize.
[2024-06-01 20:35:08] [INFO ] Deduced a trap composed of 10 places in 157 ms of which 2 ms to minimize.
[2024-06-01 20:35:08] [INFO ] Deduced a trap composed of 11 places in 156 ms of which 3 ms to minimize.
[2024-06-01 20:35:08] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 2 ms to minimize.
[2024-06-01 20:35:08] [INFO ] Deduced a trap composed of 8 places in 130 ms of which 2 ms to minimize.
[2024-06-01 20:35:08] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1018 variables, 20/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:35:08] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 2 ms to minimize.
[2024-06-01 20:35:08] [INFO ] Deduced a trap composed of 8 places in 116 ms of which 2 ms to minimize.
[2024-06-01 20:35:09] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 2 ms to minimize.
[2024-06-01 20:35:09] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 2 ms to minimize.
[2024-06-01 20:35:09] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 1 ms to minimize.
[2024-06-01 20:35:09] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 2 ms to minimize.
[2024-06-01 20:35:09] [INFO ] Deduced a trap composed of 8 places in 116 ms of which 2 ms to minimize.
[2024-06-01 20:35:09] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 2 ms to minimize.
[2024-06-01 20:35:09] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 2 ms to minimize.
[2024-06-01 20:35:10] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 2 ms to minimize.
[2024-06-01 20:35:10] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 2 ms to minimize.
[2024-06-01 20:35:10] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 2 ms to minimize.
[2024-06-01 20:35:10] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 1 ms to minimize.
[2024-06-01 20:35:10] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 2 ms to minimize.
[2024-06-01 20:35:10] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2024-06-01 20:35:10] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 2 ms to minimize.
[2024-06-01 20:35:10] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-06-01 20:35:10] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1018 variables, 18/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1018 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 18/1036 variables, 5/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1036 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1438/2474 variables, 1036/1359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:35:11] [INFO ] Deduced a trap composed of 13 places in 190 ms of which 3 ms to minimize.
[2024-06-01 20:35:11] [INFO ] Deduced a trap composed of 7 places in 206 ms of which 4 ms to minimize.
[2024-06-01 20:35:11] [INFO ] Deduced a trap composed of 12 places in 199 ms of which 4 ms to minimize.
[2024-06-01 20:35:12] [INFO ] Deduced a trap composed of 8 places in 189 ms of which 3 ms to minimize.
[2024-06-01 20:35:12] [INFO ] Deduced a trap composed of 12 places in 167 ms of which 2 ms to minimize.
[2024-06-01 20:35:12] [INFO ] Deduced a trap composed of 9 places in 167 ms of which 3 ms to minimize.
[2024-06-01 20:35:12] [INFO ] Deduced a trap composed of 8 places in 158 ms of which 3 ms to minimize.
[2024-06-01 20:35:12] [INFO ] Deduced a trap composed of 16 places in 154 ms of which 3 ms to minimize.
[2024-06-01 20:35:13] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 3 ms to minimize.
[2024-06-01 20:35:13] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 3 ms to minimize.
[2024-06-01 20:35:13] [INFO ] Deduced a trap composed of 12 places in 149 ms of which 3 ms to minimize.
[2024-06-01 20:35:13] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 1 ms to minimize.
[2024-06-01 20:35:13] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 3 ms to minimize.
[2024-06-01 20:35:13] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 2 ms to minimize.
[2024-06-01 20:35:13] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
[2024-06-01 20:35:14] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/2474 variables, 16/1375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2474 variables, 0/1375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 280/2754 variables, 98/1473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2754 variables, 22/1495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2754 variables, 1/1496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:35:14] [INFO ] Deduced a trap composed of 9 places in 249 ms of which 4 ms to minimize.
[2024-06-01 20:35:15] [INFO ] Deduced a trap composed of 9 places in 231 ms of which 4 ms to minimize.
[2024-06-01 20:35:15] [INFO ] Deduced a trap composed of 10 places in 182 ms of which 3 ms to minimize.
[2024-06-01 20:35:15] [INFO ] Deduced a trap composed of 9 places in 181 ms of which 2 ms to minimize.
[2024-06-01 20:35:15] [INFO ] Deduced a trap composed of 12 places in 162 ms of which 3 ms to minimize.
[2024-06-01 20:35:16] [INFO ] Deduced a trap composed of 8 places in 147 ms of which 3 ms to minimize.
[2024-06-01 20:35:16] [INFO ] Deduced a trap composed of 8 places in 164 ms of which 3 ms to minimize.
[2024-06-01 20:35:16] [INFO ] Deduced a trap composed of 12 places in 164 ms of which 2 ms to minimize.
[2024-06-01 20:35:16] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 2 ms to minimize.
[2024-06-01 20:35:16] [INFO ] Deduced a trap composed of 8 places in 170 ms of which 3 ms to minimize.
[2024-06-01 20:35:17] [INFO ] Deduced a trap composed of 8 places in 150 ms of which 3 ms to minimize.
[2024-06-01 20:35:17] [INFO ] Deduced a trap composed of 8 places in 180 ms of which 3 ms to minimize.
[2024-06-01 20:35:17] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 2 ms to minimize.
[2024-06-01 20:35:17] [INFO ] Deduced a trap composed of 8 places in 193 ms of which 3 ms to minimize.
[2024-06-01 20:35:17] [INFO ] Deduced a trap composed of 12 places in 160 ms of which 2 ms to minimize.
[2024-06-01 20:35:18] [INFO ] Deduced a trap composed of 23 places in 176 ms of which 2 ms to minimize.
[2024-06-01 20:35:18] [INFO ] Deduced a trap composed of 8 places in 176 ms of which 2 ms to minimize.
[2024-06-01 20:35:18] [INFO ] Deduced a trap composed of 12 places in 186 ms of which 3 ms to minimize.
[2024-06-01 20:35:18] [INFO ] Deduced a trap composed of 8 places in 181 ms of which 3 ms to minimize.
[2024-06-01 20:35:19] [INFO ] Deduced a trap composed of 12 places in 163 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/2754 variables, 20/1516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:35:19] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 2 ms to minimize.
[2024-06-01 20:35:19] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 1 ms to minimize.
[2024-06-01 20:35:19] [INFO ] Deduced a trap composed of 8 places in 136 ms of which 2 ms to minimize.
[2024-06-01 20:35:19] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 2 ms to minimize.
[2024-06-01 20:35:20] [INFO ] Deduced a trap composed of 20 places in 137 ms of which 3 ms to minimize.
[2024-06-01 20:35:20] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 2 ms to minimize.
[2024-06-01 20:35:20] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 3 ms to minimize.
[2024-06-01 20:35:20] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 1 ms to minimize.
[2024-06-01 20:35:20] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 1 ms to minimize.
[2024-06-01 20:35:21] [INFO ] Deduced a trap composed of 24 places in 160 ms of which 2 ms to minimize.
[2024-06-01 20:35:21] [INFO ] Deduced a trap composed of 28 places in 136 ms of which 2 ms to minimize.
[2024-06-01 20:35:21] [INFO ] Deduced a trap composed of 28 places in 128 ms of which 2 ms to minimize.
[2024-06-01 20:35:21] [INFO ] Deduced a trap composed of 20 places in 140 ms of which 2 ms to minimize.
[2024-06-01 20:35:21] [INFO ] Deduced a trap composed of 8 places in 138 ms of which 2 ms to minimize.
[2024-06-01 20:35:21] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 2 ms to minimize.
[2024-06-01 20:35:22] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 1 ms to minimize.
[2024-06-01 20:35:22] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 2 ms to minimize.
[2024-06-01 20:35:22] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 2 ms to minimize.
[2024-06-01 20:35:22] [INFO ] Deduced a trap composed of 12 places in 127 ms of which 2 ms to minimize.
[2024-06-01 20:35:22] [INFO ] Deduced a trap composed of 8 places in 144 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/2754 variables, 20/1536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:35:23] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 1 ms to minimize.
[2024-06-01 20:35:23] [INFO ] Deduced a trap composed of 18 places in 143 ms of which 3 ms to minimize.
[2024-06-01 20:35:23] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 2 ms to minimize.
[2024-06-01 20:35:23] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 1 ms to minimize.
[2024-06-01 20:35:23] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 2 ms to minimize.
[2024-06-01 20:35:23] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 1 ms to minimize.
[2024-06-01 20:35:24] [INFO ] Deduced a trap composed of 38 places in 107 ms of which 1 ms to minimize.
[2024-06-01 20:35:24] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 2 ms to minimize.
[2024-06-01 20:35:24] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 1 ms to minimize.
[2024-06-01 20:35:24] [INFO ] Deduced a trap composed of 28 places in 115 ms of which 2 ms to minimize.
[2024-06-01 20:35:24] [INFO ] Deduced a trap composed of 28 places in 110 ms of which 2 ms to minimize.
[2024-06-01 20:35:24] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 2 ms to minimize.
[2024-06-01 20:35:25] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 1 ms to minimize.
[2024-06-01 20:35:25] [INFO ] Deduced a trap composed of 36 places in 113 ms of which 2 ms to minimize.
[2024-06-01 20:35:25] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 2 ms to minimize.
[2024-06-01 20:35:25] [INFO ] Deduced a trap composed of 36 places in 99 ms of which 1 ms to minimize.
[2024-06-01 20:35:25] [INFO ] Deduced a trap composed of 36 places in 97 ms of which 1 ms to minimize.
[2024-06-01 20:35:25] [INFO ] Deduced a trap composed of 36 places in 102 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/2754 variables, 18/1554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2754 variables, 0/1554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/2772 variables, 9/1563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2772 variables, 18/1581 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:35:26] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 2 ms to minimize.
[2024-06-01 20:35:26] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 2 ms to minimize.
[2024-06-01 20:35:26] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 1 ms to minimize.
[2024-06-01 20:35:26] [INFO ] Deduced a trap composed of 36 places in 106 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/2772 variables, 4/1585 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:35:26] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 1 ms to minimize.
[2024-06-01 20:35:27] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 1 ms to minimize.
[2024-06-01 20:35:27] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/2772 variables, 3/1588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2772 variables, 0/1588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 237/3009 variables, 101/1689 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3009 variables, 27/1716 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:35:27] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 2 ms to minimize.
[2024-06-01 20:35:27] [INFO ] Deduced a trap composed of 42 places in 108 ms of which 2 ms to minimize.
[2024-06-01 20:35:27] [INFO ] Deduced a trap composed of 42 places in 108 ms of which 1 ms to minimize.
[2024-06-01 20:35:28] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 2 ms to minimize.
[2024-06-01 20:35:28] [INFO ] Deduced a trap composed of 47 places in 108 ms of which 2 ms to minimize.
[2024-06-01 20:35:28] [INFO ] Deduced a trap composed of 46 places in 111 ms of which 2 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/3009 variables, 6/1722 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:35:28] [INFO ] Deduced a trap composed of 47 places in 108 ms of which 2 ms to minimize.
[2024-06-01 20:35:28] [INFO ] Deduced a trap composed of 46 places in 101 ms of which 2 ms to minimize.
[2024-06-01 20:35:29] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 2 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/3009 variables, 3/1725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:35:29] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 2 ms to minimize.
[2024-06-01 20:35:29] [INFO ] Deduced a trap composed of 42 places in 100 ms of which 1 ms to minimize.
[2024-06-01 20:35:29] [INFO ] Deduced a trap composed of 46 places in 118 ms of which 2 ms to minimize.
[2024-06-01 20:35:29] [INFO ] Deduced a trap composed of 46 places in 105 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/3009 variables, 4/1729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:35:30] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2024-06-01 20:35:30] [INFO ] Deduced a trap composed of 38 places in 105 ms of which 2 ms to minimize.
[2024-06-01 20:35:30] [INFO ] Deduced a trap composed of 50 places in 98 ms of which 1 ms to minimize.
[2024-06-01 20:35:30] [INFO ] Deduced a trap composed of 50 places in 100 ms of which 2 ms to minimize.
[2024-06-01 20:35:30] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 1 ms to minimize.
[2024-06-01 20:35:30] [INFO ] Deduced a trap composed of 28 places in 115 ms of which 2 ms to minimize.
[2024-06-01 20:35:31] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 2 ms to minimize.
[2024-06-01 20:35:31] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 1 ms to minimize.
[2024-06-01 20:35:31] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 1 ms to minimize.
[2024-06-01 20:35:31] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 2 ms to minimize.
[2024-06-01 20:35:31] [INFO ] Deduced a trap composed of 36 places in 106 ms of which 1 ms to minimize.
[2024-06-01 20:35:31] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 2 ms to minimize.
[2024-06-01 20:35:31] [INFO ] Deduced a trap composed of 42 places in 106 ms of which 2 ms to minimize.
[2024-06-01 20:35:32] [INFO ] Deduced a trap composed of 46 places in 108 ms of which 2 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/3009 variables, 14/1743 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:35:32] [INFO ] Deduced a trap composed of 46 places in 116 ms of which 2 ms to minimize.
[2024-06-01 20:35:32] [INFO ] Deduced a trap composed of 46 places in 112 ms of which 2 ms to minimize.
[2024-06-01 20:35:32] [INFO ] Deduced a trap composed of 50 places in 107 ms of which 1 ms to minimize.
[2024-06-01 20:35:32] [INFO ] Deduced a trap composed of 50 places in 107 ms of which 1 ms to minimize.
[2024-06-01 20:35:33] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 2 ms to minimize.
[2024-06-01 20:35:33] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 2 ms to minimize.
[2024-06-01 20:35:33] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 1 ms to minimize.
[2024-06-01 20:35:33] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 1 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/3009 variables, 8/1751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3009 variables, 0/1751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 14/3023 variables, 7/1758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/3023 variables, 14/1772 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/3023 variables, 0/1772 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 156/3179 variables, 70/1842 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/3179 variables, 19/1861 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:35:34] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-06-01 20:35:34] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
At refinement iteration 35 (INCLUDED_ONLY) 0/3179 variables, 2/1863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/3179 variables, 0/1863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 8/3187 variables, 4/1867 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/3187 variables, 8/1875 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/3187 variables, 0/1875 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 104/3291 variables, 46/1921 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/3291 variables, 12/1933 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:35:34] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 0 ms to minimize.
At refinement iteration 42 (INCLUDED_ONLY) 0/3291 variables, 1/1934 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/3291 variables, 0/1934 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 6/3297 variables, 3/1937 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/3297 variables, 6/1943 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/3297 variables, 0/1943 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 60/3357 variables, 26/1969 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/3357 variables, 7/1976 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:35:35] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
At refinement iteration 49 (INCLUDED_ONLY) 0/3357 variables, 1/1977 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/3357 variables, 0/1977 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 4/3361 variables, 2/1979 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/3361 variables, 4/1983 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/3361 variables, 0/1983 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (OVERLAPS) 17/3378 variables, 12/1995 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/3378 variables, 4/1999 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:35:35] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 1 ms to minimize.
[2024-06-01 20:35:35] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 0 ms to minimize.
At refinement iteration 56 (INCLUDED_ONLY) 0/3378 variables, 2/2001 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:35:36] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
At refinement iteration 57 (INCLUDED_ONLY) 0/3378 variables, 1/2002 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/3378 variables, 0/2002 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 0/3378 variables, 0/2002 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3378/3378 variables, and 2002 constraints, problems are : Problem set: 0 solved, 1 unsolved in 31642 ms.
Refiners :[Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 1439/1439 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 161/161 constraints]
After SMT, in 32924ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1338 ms.
Support contains 23 out of 1439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1439/1439 places, 1939/1939 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1439 transition count 1938
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1438 transition count 1938
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 8 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 1432 transition count 1932
Applied a total of 14 rules in 127 ms. Remains 1432 /1439 variables (removed 7) and now considering 1932/1939 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127 ms. Remains : 1432/1439 places, 1932/1939 transitions.
RANDOM walk for 40000 steps (32 resets) in 576 ms. (69 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 306 ms. (130 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 122048 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :0 out of 1
Probabilistic random walk after 122048 steps, saw 69932 distinct states, run finished after 3006 ms. (steps per millisecond=40 ) properties seen :0
// Phase 1: matrix 1932 rows 1432 cols
[2024-06-01 20:35:41] [INFO ] Computed 401 invariants in 6 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 988/1011 variables, 280/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1011 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/1029 variables, 5/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1029 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1431/2460 variables, 1029/1314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2460 variables, 0/1314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 280/2740 variables, 98/1412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2740 variables, 22/1434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2740 variables, 0/1434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 18/2758 variables, 9/1443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2758 variables, 18/1461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2758 variables, 0/1461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 237/2995 variables, 101/1562 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2995 variables, 27/1589 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2995 variables, 0/1589 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 14/3009 variables, 7/1596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3009 variables, 14/1610 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3009 variables, 0/1610 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 156/3165 variables, 70/1680 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3165 variables, 19/1699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3165 variables, 0/1699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 8/3173 variables, 4/1703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3173 variables, 8/1711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3173 variables, 0/1711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 104/3277 variables, 46/1757 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3277 variables, 12/1769 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3277 variables, 0/1769 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 6/3283 variables, 3/1772 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3283 variables, 6/1778 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/3283 variables, 0/1778 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 60/3343 variables, 26/1804 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/3343 variables, 7/1811 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/3343 variables, 0/1811 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 4/3347 variables, 2/1813 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/3347 variables, 4/1817 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/3347 variables, 0/1817 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 17/3364 variables, 12/1829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/3364 variables, 4/1833 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/3364 variables, 0/1833 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 0/3364 variables, 0/1833 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3364/3364 variables, and 1833 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1201 ms.
Refiners :[Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 1432/1432 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 988/1011 variables, 280/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:35:42] [INFO ] Deduced a trap composed of 8 places in 188 ms of which 3 ms to minimize.
[2024-06-01 20:35:42] [INFO ] Deduced a trap composed of 8 places in 186 ms of which 2 ms to minimize.
[2024-06-01 20:35:43] [INFO ] Deduced a trap composed of 10 places in 178 ms of which 3 ms to minimize.
[2024-06-01 20:35:43] [INFO ] Deduced a trap composed of 9 places in 186 ms of which 3 ms to minimize.
[2024-06-01 20:35:43] [INFO ] Deduced a trap composed of 8 places in 165 ms of which 2 ms to minimize.
[2024-06-01 20:35:43] [INFO ] Deduced a trap composed of 12 places in 160 ms of which 2 ms to minimize.
[2024-06-01 20:35:43] [INFO ] Deduced a trap composed of 8 places in 162 ms of which 2 ms to minimize.
[2024-06-01 20:35:43] [INFO ] Deduced a trap composed of 10 places in 146 ms of which 2 ms to minimize.
[2024-06-01 20:35:44] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 2 ms to minimize.
[2024-06-01 20:35:44] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 2 ms to minimize.
[2024-06-01 20:35:44] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 2 ms to minimize.
[2024-06-01 20:35:44] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 2 ms to minimize.
[2024-06-01 20:35:44] [INFO ] Deduced a trap composed of 8 places in 115 ms of which 2 ms to minimize.
[2024-06-01 20:35:44] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 1 ms to minimize.
[2024-06-01 20:35:44] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 1 ms to minimize.
[2024-06-01 20:35:45] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 2 ms to minimize.
[2024-06-01 20:35:45] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 2 ms to minimize.
[2024-06-01 20:35:45] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 2 ms to minimize.
[2024-06-01 20:35:45] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 2 ms to minimize.
[2024-06-01 20:35:45] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1011 variables, 20/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:35:45] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 2 ms to minimize.
[2024-06-01 20:35:45] [INFO ] Deduced a trap composed of 8 places in 115 ms of which 1 ms to minimize.
[2024-06-01 20:35:45] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 2 ms to minimize.
[2024-06-01 20:35:45] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 1 ms to minimize.
[2024-06-01 20:35:45] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 1 ms to minimize.
[2024-06-01 20:35:46] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 2 ms to minimize.
[2024-06-01 20:35:46] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 1 ms to minimize.
[2024-06-01 20:35:46] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2024-06-01 20:35:46] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-06-01 20:35:46] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-06-01 20:35:46] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1011 variables, 11/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1011 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 18/1029 variables, 5/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1029 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1431/2460 variables, 1029/1345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:35:46] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 2 ms to minimize.
[2024-06-01 20:35:47] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 2 ms to minimize.
[2024-06-01 20:35:47] [INFO ] Deduced a trap composed of 8 places in 129 ms of which 2 ms to minimize.
[2024-06-01 20:35:47] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 2 ms to minimize.
[2024-06-01 20:35:47] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 2 ms to minimize.
[2024-06-01 20:35:47] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 2 ms to minimize.
[2024-06-01 20:35:47] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 2 ms to minimize.
[2024-06-01 20:35:47] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 3 ms to minimize.
[2024-06-01 20:35:48] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 3 ms to minimize.
[2024-06-01 20:35:48] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 1 ms to minimize.
[2024-06-01 20:35:48] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 2 ms to minimize.
[2024-06-01 20:35:48] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 2 ms to minimize.
[2024-06-01 20:35:48] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 2 ms to minimize.
[2024-06-01 20:35:48] [INFO ] Deduced a trap composed of 18 places in 131 ms of which 2 ms to minimize.
[2024-06-01 20:35:49] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 2 ms to minimize.
[2024-06-01 20:35:49] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 2 ms to minimize.
[2024-06-01 20:35:49] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 2 ms to minimize.
[2024-06-01 20:35:49] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 2 ms to minimize.
[2024-06-01 20:35:49] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/2460 variables, 19/1364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2460 variables, 0/1364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 280/2740 variables, 98/1462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2740 variables, 22/1484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2740 variables, 1/1485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:35:50] [INFO ] Deduced a trap composed of 7 places in 232 ms of which 3 ms to minimize.
[2024-06-01 20:35:50] [INFO ] Deduced a trap composed of 7 places in 229 ms of which 3 ms to minimize.
[2024-06-01 20:35:50] [INFO ] Deduced a trap composed of 12 places in 227 ms of which 3 ms to minimize.
[2024-06-01 20:35:51] [INFO ] Deduced a trap composed of 8 places in 218 ms of which 4 ms to minimize.
[2024-06-01 20:35:51] [INFO ] Deduced a trap composed of 12 places in 216 ms of which 3 ms to minimize.
[2024-06-01 20:35:51] [INFO ] Deduced a trap composed of 20 places in 218 ms of which 3 ms to minimize.
[2024-06-01 20:35:52] [INFO ] Deduced a trap composed of 8 places in 222 ms of which 3 ms to minimize.
[2024-06-01 20:35:52] [INFO ] Deduced a trap composed of 20 places in 221 ms of which 3 ms to minimize.
[2024-06-01 20:35:52] [INFO ] Deduced a trap composed of 14 places in 221 ms of which 3 ms to minimize.
[2024-06-01 20:35:52] [INFO ] Deduced a trap composed of 11 places in 209 ms of which 3 ms to minimize.
[2024-06-01 20:35:53] [INFO ] Deduced a trap composed of 20 places in 193 ms of which 4 ms to minimize.
[2024-06-01 20:35:53] [INFO ] Deduced a trap composed of 20 places in 214 ms of which 3 ms to minimize.
[2024-06-01 20:35:53] [INFO ] Deduced a trap composed of 12 places in 202 ms of which 3 ms to minimize.
[2024-06-01 20:35:53] [INFO ] Deduced a trap composed of 12 places in 203 ms of which 3 ms to minimize.
[2024-06-01 20:35:54] [INFO ] Deduced a trap composed of 8 places in 211 ms of which 4 ms to minimize.
[2024-06-01 20:35:54] [INFO ] Deduced a trap composed of 12 places in 211 ms of which 3 ms to minimize.
[2024-06-01 20:35:54] [INFO ] Deduced a trap composed of 8 places in 221 ms of which 4 ms to minimize.
[2024-06-01 20:35:54] [INFO ] Deduced a trap composed of 12 places in 236 ms of which 7 ms to minimize.
[2024-06-01 20:35:55] [INFO ] Deduced a trap composed of 14 places in 270 ms of which 3 ms to minimize.
[2024-06-01 20:35:55] [INFO ] Deduced a trap composed of 20 places in 215 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/2740 variables, 20/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:35:55] [INFO ] Deduced a trap composed of 8 places in 212 ms of which 3 ms to minimize.
[2024-06-01 20:35:56] [INFO ] Deduced a trap composed of 19 places in 214 ms of which 6 ms to minimize.
[2024-06-01 20:35:56] [INFO ] Deduced a trap composed of 8 places in 227 ms of which 3 ms to minimize.
[2024-06-01 20:35:56] [INFO ] Deduced a trap composed of 8 places in 181 ms of which 3 ms to minimize.
[2024-06-01 20:35:56] [INFO ] Deduced a trap composed of 12 places in 177 ms of which 3 ms to minimize.
[2024-06-01 20:35:57] [INFO ] Deduced a trap composed of 12 places in 180 ms of which 2 ms to minimize.
[2024-06-01 20:35:57] [INFO ] Deduced a trap composed of 16 places in 179 ms of which 3 ms to minimize.
[2024-06-01 20:35:57] [INFO ] Deduced a trap composed of 12 places in 185 ms of which 3 ms to minimize.
[2024-06-01 20:35:57] [INFO ] Deduced a trap composed of 18 places in 175 ms of which 3 ms to minimize.
[2024-06-01 20:35:58] [INFO ] Deduced a trap composed of 12 places in 181 ms of which 3 ms to minimize.
[2024-06-01 20:35:58] [INFO ] Deduced a trap composed of 18 places in 180 ms of which 2 ms to minimize.
[2024-06-01 20:35:58] [INFO ] Deduced a trap composed of 12 places in 178 ms of which 3 ms to minimize.
[2024-06-01 20:35:58] [INFO ] Deduced a trap composed of 12 places in 176 ms of which 3 ms to minimize.
[2024-06-01 20:35:59] [INFO ] Deduced a trap composed of 16 places in 174 ms of which 4 ms to minimize.
[2024-06-01 20:35:59] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 2 ms to minimize.
[2024-06-01 20:35:59] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 2 ms to minimize.
[2024-06-01 20:35:59] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 2 ms to minimize.
[2024-06-01 20:35:59] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 3 ms to minimize.
[2024-06-01 20:36:00] [INFO ] Deduced a trap composed of 20 places in 148 ms of which 2 ms to minimize.
[2024-06-01 20:36:00] [INFO ] Deduced a trap composed of 21 places in 137 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/2740 variables, 20/1525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:36:00] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 2 ms to minimize.
[2024-06-01 20:36:00] [INFO ] Deduced a trap composed of 17 places in 142 ms of which 2 ms to minimize.
[2024-06-01 20:36:00] [INFO ] Deduced a trap composed of 16 places in 146 ms of which 2 ms to minimize.
[2024-06-01 20:36:01] [INFO ] Deduced a trap composed of 21 places in 152 ms of which 2 ms to minimize.
[2024-06-01 20:36:01] [INFO ] Deduced a trap composed of 20 places in 131 ms of which 2 ms to minimize.
[2024-06-01 20:36:01] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 2 ms to minimize.
[2024-06-01 20:36:01] [INFO ] Deduced a trap composed of 16 places in 137 ms of which 2 ms to minimize.
[2024-06-01 20:36:01] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 2 ms to minimize.
[2024-06-01 20:36:02] [INFO ] Deduced a trap composed of 25 places in 131 ms of which 2 ms to minimize.
[2024-06-01 20:36:02] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 2 ms to minimize.
[2024-06-01 20:36:02] [INFO ] Deduced a trap composed of 8 places in 135 ms of which 2 ms to minimize.
[2024-06-01 20:36:02] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 2 ms to minimize.
[2024-06-01 20:36:02] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 2 ms to minimize.
[2024-06-01 20:36:03] [INFO ] Deduced a trap composed of 25 places in 135 ms of which 2 ms to minimize.
[2024-06-01 20:36:03] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 2 ms to minimize.
[2024-06-01 20:36:03] [INFO ] Deduced a trap composed of 28 places in 140 ms of which 2 ms to minimize.
[2024-06-01 20:36:03] [INFO ] Deduced a trap composed of 20 places in 144 ms of which 2 ms to minimize.
[2024-06-01 20:36:03] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 2 ms to minimize.
[2024-06-01 20:36:04] [INFO ] Deduced a trap composed of 20 places in 134 ms of which 2 ms to minimize.
[2024-06-01 20:36:04] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/2740 variables, 20/1545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:36:04] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 2 ms to minimize.
[2024-06-01 20:36:04] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 2 ms to minimize.
[2024-06-01 20:36:04] [INFO ] Deduced a trap composed of 26 places in 134 ms of which 2 ms to minimize.
[2024-06-01 20:36:05] [INFO ] Deduced a trap composed of 34 places in 134 ms of which 2 ms to minimize.
[2024-06-01 20:36:05] [INFO ] Deduced a trap composed of 38 places in 136 ms of which 2 ms to minimize.
[2024-06-01 20:36:05] [INFO ] Deduced a trap composed of 29 places in 139 ms of which 3 ms to minimize.
[2024-06-01 20:36:05] [INFO ] Deduced a trap composed of 41 places in 134 ms of which 3 ms to minimize.
[2024-06-01 20:36:05] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 2 ms to minimize.
[2024-06-01 20:36:06] [INFO ] Deduced a trap composed of 32 places in 133 ms of which 2 ms to minimize.
[2024-06-01 20:36:06] [INFO ] Deduced a trap composed of 40 places in 122 ms of which 2 ms to minimize.
[2024-06-01 20:36:06] [INFO ] Deduced a trap composed of 28 places in 139 ms of which 2 ms to minimize.
[2024-06-01 20:36:06] [INFO ] Deduced a trap composed of 42 places in 130 ms of which 2 ms to minimize.
[2024-06-01 20:36:06] [INFO ] Deduced a trap composed of 47 places in 131 ms of which 2 ms to minimize.
[2024-06-01 20:36:07] [INFO ] Deduced a trap composed of 47 places in 131 ms of which 2 ms to minimize.
[2024-06-01 20:36:07] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 2 ms to minimize.
[2024-06-01 20:36:07] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 2 ms to minimize.
[2024-06-01 20:36:07] [INFO ] Deduced a trap composed of 32 places in 140 ms of which 2 ms to minimize.
[2024-06-01 20:36:07] [INFO ] Deduced a trap composed of 40 places in 130 ms of which 2 ms to minimize.
[2024-06-01 20:36:08] [INFO ] Deduced a trap composed of 30 places in 136 ms of which 2 ms to minimize.
[2024-06-01 20:36:08] [INFO ] Deduced a trap composed of 30 places in 140 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/2740 variables, 20/1565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:36:08] [INFO ] Deduced a trap composed of 46 places in 133 ms of which 2 ms to minimize.
[2024-06-01 20:36:08] [INFO ] Deduced a trap composed of 46 places in 130 ms of which 2 ms to minimize.
[2024-06-01 20:36:08] [INFO ] Deduced a trap composed of 46 places in 130 ms of which 2 ms to minimize.
[2024-06-01 20:36:09] [INFO ] Deduced a trap composed of 46 places in 130 ms of which 2 ms to minimize.
[2024-06-01 20:36:09] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 1 ms to minimize.
[2024-06-01 20:36:09] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
[2024-06-01 20:36:09] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 2 ms to minimize.
[2024-06-01 20:36:09] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 1 ms to minimize.
[2024-06-01 20:36:09] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 1 ms to minimize.
[2024-06-01 20:36:09] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 1 ms to minimize.
[2024-06-01 20:36:10] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 2 ms to minimize.
[2024-06-01 20:36:10] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 1 ms to minimize.
[2024-06-01 20:36:10] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 1 ms to minimize.
[2024-06-01 20:36:10] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2024-06-01 20:36:10] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-06-01 20:36:10] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2024-06-01 20:36:10] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/2740 variables, 17/1582 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2740 variables, 0/1582 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 18/2758 variables, 9/1591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2758 variables, 18/1609 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2758 variables, 0/1609 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 237/2995 variables, 101/1710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2995 variables, 27/1737 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:36:11] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/2995 variables, 1/1738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2995 variables, 0/1738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 14/3009 variables, 7/1745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3009 variables, 14/1759 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3009 variables, 0/1759 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 156/3165 variables, 70/1829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/3165 variables, 19/1848 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:36:11] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/3165 variables, 1/1849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/3165 variables, 0/1849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 8/3173 variables, 4/1853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/3173 variables, 8/1861 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/3173 variables, 0/1861 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 104/3277 variables, 46/1907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/3277 variables, 12/1919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/3277 variables, 0/1919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 6/3283 variables, 3/1922 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/3283 variables, 6/1928 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/3283 variables, 0/1928 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 60/3343 variables, 26/1954 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/3343 variables, 7/1961 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:36:12] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 1 ms to minimize.
At refinement iteration 44 (INCLUDED_ONLY) 0/3343 variables, 1/1962 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/3343 variables, 0/1962 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 4/3347 variables, 2/1964 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/3347 variables, 4/1968 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/3347 variables, 0/1968 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 17/3364 variables, 12/1980 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/3364 variables, 4/1984 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/3364 variables, 0/1984 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (OVERLAPS) 0/3364 variables, 0/1984 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3364/3364 variables, and 1984 constraints, problems are : Problem set: 0 solved, 1 unsolved in 30831 ms.
Refiners :[Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 1432/1432 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 150/150 constraints]
After SMT, in 32057ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1230 ms.
Support contains 23 out of 1432 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1432/1432 places, 1932/1932 transitions.
Applied a total of 0 rules in 71 ms. Remains 1432 /1432 variables (removed 0) and now considering 1932/1932 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 1432/1432 places, 1932/1932 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1432/1432 places, 1932/1932 transitions.
Applied a total of 0 rules in 64 ms. Remains 1432 /1432 variables (removed 0) and now considering 1932/1932 (removed 0) transitions.
[2024-06-01 20:36:14] [INFO ] Invariant cache hit.
[2024-06-01 20:36:15] [INFO ] Implicit Places using invariants in 663 ms returned []
[2024-06-01 20:36:15] [INFO ] Invariant cache hit.
[2024-06-01 20:36:16] [INFO ] Implicit Places using invariants and state equation in 1686 ms returned []
Implicit Place search using SMT with State Equation took 2358 ms to find 0 implicit places.
[2024-06-01 20:36:17] [INFO ] Redundant transitions in 258 ms returned []
Running 1926 sub problems to find dead transitions.
[2024-06-01 20:36:17] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1427 variables, 118/118 constraints. Problems are: Problem set: 0 solved, 1926 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1427/3364 variables, and 118 constraints, problems are : Problem set: 0 solved, 1926 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 118/401 constraints, State Equation: 0/1432 constraints, PredecessorRefiner: 1926/1926 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1926 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1427 variables, 118/118 constraints. Problems are: Problem set: 0 solved, 1926 unsolved
[2024-06-01 20:36:49] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-06-01 20:36:55] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 1 ms to minimize.
[2024-06-01 20:36:56] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-06-01 20:36:56] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-06-01 20:36:56] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2024-06-01 20:36:56] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
[2024-06-01 20:36:56] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2024-06-01 20:36:56] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-06-01 20:36:56] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-06-01 20:36:56] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-06-01 20:36:57] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 1 ms to minimize.
[2024-06-01 20:36:57] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 1 ms to minimize.
[2024-06-01 20:36:57] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 1 ms to minimize.
[2024-06-01 20:36:57] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 1 ms to minimize.
[2024-06-01 20:36:57] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 1 ms to minimize.
[2024-06-01 20:36:57] [INFO ] Deduced a trap composed of 43 places in 72 ms of which 1 ms to minimize.
[2024-06-01 20:36:57] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 2 ms to minimize.
[2024-06-01 20:36:58] [INFO ] Deduced a trap composed of 48 places in 80 ms of which 2 ms to minimize.
[2024-06-01 20:36:58] [INFO ] Deduced a trap composed of 52 places in 76 ms of which 1 ms to minimize.
[2024-06-01 20:36:58] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1427 variables, 20/138 constraints. Problems are: Problem set: 0 solved, 1926 unsolved
[2024-06-01 20:37:05] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-06-01 20:37:05] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-06-01 20:37:05] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2024-06-01 20:37:05] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-06-01 20:37:05] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-06-01 20:37:05] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-06-01 20:37:06] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-06-01 20:37:06] [INFO ] Deduced a trap composed of 37 places in 64 ms of which 1 ms to minimize.
[2024-06-01 20:37:06] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 1 ms to minimize.
[2024-06-01 20:37:06] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 2 ms to minimize.
[2024-06-01 20:37:06] [INFO ] Deduced a trap composed of 45 places in 70 ms of which 1 ms to minimize.
[2024-06-01 20:37:06] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 2 ms to minimize.
[2024-06-01 20:37:07] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 1 ms to minimize.
[2024-06-01 20:37:07] [INFO ] Deduced a trap composed of 45 places in 68 ms of which 1 ms to minimize.
[2024-06-01 20:37:07] [INFO ] Deduced a trap composed of 46 places in 70 ms of which 1 ms to minimize.
[2024-06-01 20:37:07] [INFO ] Deduced a trap composed of 45 places in 66 ms of which 1 ms to minimize.
[2024-06-01 20:37:07] [INFO ] Deduced a trap composed of 46 places in 72 ms of which 1 ms to minimize.
[2024-06-01 20:37:07] [INFO ] Deduced a trap composed of 45 places in 74 ms of which 1 ms to minimize.
[2024-06-01 20:37:07] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 1 ms to minimize.
[2024-06-01 20:37:07] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1427 variables, 20/158 constraints. Problems are: Problem set: 0 solved, 1926 unsolved
[2024-06-01 20:37:08] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-06-01 20:37:15] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 1 ms to minimize.
[2024-06-01 20:37:15] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 2 ms to minimize.
[2024-06-01 20:37:15] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 2 ms to minimize.
[2024-06-01 20:37:15] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 1 ms to minimize.
[2024-06-01 20:37:15] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2024-06-01 20:37:16] [INFO ] Deduced a trap composed of 45 places in 85 ms of which 1 ms to minimize.
[2024-06-01 20:37:16] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 2 ms to minimize.
[2024-06-01 20:37:16] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 1 ms to minimize.
[2024-06-01 20:37:16] [INFO ] Deduced a trap composed of 43 places in 83 ms of which 2 ms to minimize.
[2024-06-01 20:37:16] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 2 ms to minimize.
[2024-06-01 20:37:16] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 2 ms to minimize.
[2024-06-01 20:37:16] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 1 ms to minimize.
[2024-06-01 20:37:16] [INFO ] Deduced a trap composed of 46 places in 77 ms of which 1 ms to minimize.
[2024-06-01 20:37:16] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 2 ms to minimize.
[2024-06-01 20:37:17] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 2 ms to minimize.
[2024-06-01 20:37:17] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 1 ms to minimize.
[2024-06-01 20:37:17] [INFO ] Deduced a trap composed of 56 places in 92 ms of which 2 ms to minimize.
[2024-06-01 20:37:17] [INFO ] Deduced a trap composed of 58 places in 85 ms of which 1 ms to minimize.
[2024-06-01 20:37:17] [INFO ] Deduced a trap composed of 57 places in 88 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1427 variables, 20/178 constraints. Problems are: Problem set: 0 solved, 1926 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1427/3364 variables, and 178 constraints, problems are : Problem set: 0 solved, 1926 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 118/401 constraints, State Equation: 0/1432 constraints, PredecessorRefiner: 0/1926 constraints, Known Traps: 60/60 constraints]
After SMT, in 61269ms problems are : Problem set: 0 solved, 1926 unsolved
Search for dead transitions found 0 dead transitions in 61291ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63991 ms. Remains : 1432/1432 places, 1932/1932 transitions.
[2024-06-01 20:37:18] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2024-06-01 20:37:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1432 places, 1932 transitions and 9534 arcs took 18 ms.
[2024-06-01 20:37:18] [INFO ] Flatten gal took : 240 ms
Total runtime 147566 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 : ShieldRVs-PT-100B-ReachabilityCardinality-2023-03

BK_STOP 1717274239132

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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 ShieldRVs-PT-100B-ReachabilityCardinality-2023-03
rfs formula type AG
rfs formula formula --invariant=/tmp/1680/inv_0_
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="ShieldRVs-PT-100B"
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 ShieldRVs-PT-100B, 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 r528-tall-171683762000878"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-100B.tgz
mv ShieldRVs-PT-100B 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 ;