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.r355-tall-171683759700846.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is ShieldRVs-PT-040B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683759700846
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 960K
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 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:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 19:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 17:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 12 17:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K 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 498K 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-040B-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityCardinality-2024-04
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717060040071

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-040B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 09:07:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-30 09:07:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 09:07:21] [INFO ] Load time of PNML (sax parser for PT used): 198 ms
[2024-05-30 09:07:21] [INFO ] Transformed 1603 places.
[2024-05-30 09:07:21] [INFO ] Transformed 1803 transitions.
[2024-05-30 09:07:21] [INFO ] Found NUPN structural information;
[2024-05-30 09:07:21] [INFO ] Parsed PT model containing 1603 places and 1803 transitions and 5760 arcs in 360 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-040B-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-040B-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (20 resets) in 1949 ms. (20 steps per ms) remains 7/14 properties
FORMULA ShieldRVs-PT-040B-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 388 ms. (102 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1191 ms. (33 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 7/7 properties
// Phase 1: matrix 1803 rows 1603 cols
[2024-05-30 09:07:23] [INFO ] Computed 161 invariants in 32 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 1094/1196 variables, 113/215 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1196 variables, 1094/1309 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1196 variables, 0/1309 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 407/1603 variables, 48/1357 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1603 variables, 407/1764 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1603 variables, 0/1764 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 1803/3406 variables, 1603/3367 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3406 variables, 0/3367 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/3406 variables, 0/3367 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3406/3406 variables, and 3367 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2086 ms.
Refiners :[Domain max(s): 1603/1603 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 1603/1603 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/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 1094/1196 variables, 113/215 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1196 variables, 1094/1309 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-30 09:07:26] [INFO ] Deduced a trap composed of 46 places in 445 ms of which 53 ms to minimize.
[2024-05-30 09:07:26] [INFO ] Deduced a trap composed of 25 places in 321 ms of which 6 ms to minimize.
[2024-05-30 09:07:26] [INFO ] Deduced a trap composed of 34 places in 450 ms of which 6 ms to minimize.
[2024-05-30 09:07:27] [INFO ] Deduced a trap composed of 29 places in 351 ms of which 5 ms to minimize.
[2024-05-30 09:07:27] [INFO ] Deduced a trap composed of 22 places in 274 ms of which 5 ms to minimize.
[2024-05-30 09:07:27] [INFO ] Deduced a trap composed of 34 places in 289 ms of which 5 ms to minimize.
[2024-05-30 09:07:28] [INFO ] Deduced a trap composed of 20 places in 271 ms of which 5 ms to minimize.
[2024-05-30 09:07:28] [INFO ] Deduced a trap composed of 38 places in 305 ms of which 5 ms to minimize.
[2024-05-30 09:07:28] [INFO ] Deduced a trap composed of 23 places in 275 ms of which 5 ms to minimize.
[2024-05-30 09:07:29] [INFO ] Deduced a trap composed of 28 places in 302 ms of which 5 ms to minimize.
[2024-05-30 09:07:29] [INFO ] Deduced a trap composed of 28 places in 299 ms of which 4 ms to minimize.
[2024-05-30 09:07:29] [INFO ] Deduced a trap composed of 24 places in 279 ms of which 5 ms to minimize.
[2024-05-30 09:07:29] [INFO ] Deduced a trap composed of 35 places in 254 ms of which 5 ms to minimize.
[2024-05-30 09:07:30] [INFO ] Deduced a trap composed of 33 places in 267 ms of which 5 ms to minimize.
[2024-05-30 09:07:30] [INFO ] Deduced a trap composed of 46 places in 246 ms of which 4 ms to minimize.
SMT process timed out in 7475ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 102 out of 1603 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1603/1603 places, 1803/1803 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 127 transitions
Trivial Post-agglo rules discarded 127 transitions
Performed 127 trivial Post agglomeration. Transition count delta: 127
Iterating post reduction 0 with 127 rules applied. Total rules applied 127 place count 1603 transition count 1676
Reduce places removed 127 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 137 rules applied. Total rules applied 264 place count 1476 transition count 1666
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 274 place count 1466 transition count 1666
Performed 196 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 196 Pre rules applied. Total rules applied 274 place count 1466 transition count 1470
Deduced a syphon composed of 196 places in 3 ms
Reduce places removed 196 places and 0 transitions.
Iterating global reduction 3 with 392 rules applied. Total rules applied 666 place count 1270 transition count 1470
Discarding 240 places :
Symmetric choice reduction at 3 with 240 rule applications. Total rules 906 place count 1030 transition count 1230
Iterating global reduction 3 with 240 rules applied. Total rules applied 1146 place count 1030 transition count 1230
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 85 Pre rules applied. Total rules applied 1146 place count 1030 transition count 1145
Deduced a syphon composed of 85 places in 5 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 170 rules applied. Total rules applied 1316 place count 945 transition count 1145
Performed 259 Post agglomeration using F-continuation condition.Transition count delta: 259
Deduced a syphon composed of 259 places in 4 ms
Reduce places removed 259 places and 0 transitions.
Iterating global reduction 3 with 518 rules applied. Total rules applied 1834 place count 686 transition count 886
Partial Free-agglomeration rule applied 72 times.
Drop transitions (Partial Free agglomeration) removed 72 transitions
Iterating global reduction 3 with 72 rules applied. Total rules applied 1906 place count 686 transition count 886
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1907 place count 685 transition count 885
Applied a total of 1907 rules in 576 ms. Remains 685 /1603 variables (removed 918) and now considering 885/1803 (removed 918) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 590 ms. Remains : 685/1603 places, 885/1803 transitions.
RANDOM walk for 40000 steps (60 resets) in 455 ms. (87 steps per ms) remains 6/7 properties
FORMULA ShieldRVs-PT-040B-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 5/6 properties
FORMULA ShieldRVs-PT-040B-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 250 ms. (159 steps per ms) remains 3/5 properties
FORMULA ShieldRVs-PT-040B-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 200 ms. (199 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 3/3 properties
// Phase 1: matrix 885 rows 685 cols
[2024-05-30 09:07:31] [INFO ] Computed 161 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 145/170 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 373/543 variables, 93/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/543 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 748/1291 variables, 543/668 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1291 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 204/1495 variables, 88/756 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1495 variables, 15/771 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1495 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 23/1518 variables, 11/782 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1518 variables, 13/795 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1518 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 6/1524 variables, 3/798 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1524 variables, 2/800 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1524 variables, 0/800 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 40/1564 variables, 35/835 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1564 variables, 5/840 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1564 variables, 0/840 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 4/1568 variables, 2/842 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1568 variables, 0/842 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 2/1570 variables, 4/846 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1570 variables, 0/846 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 0/1570 variables, 0/846 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1570/1570 variables, and 846 constraints, problems are : Problem set: 0 solved, 3 unsolved in 849 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 685/685 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/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 145/170 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 373/543 variables, 93/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 09:07:32] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 1 ms to minimize.
[2024-05-30 09:07:32] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 2 ms to minimize.
[2024-05-30 09:07:32] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 2 ms to minimize.
[2024-05-30 09:07:33] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 2 ms to minimize.
[2024-05-30 09:07:33] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 2 ms to minimize.
[2024-05-30 09:07:33] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 2 ms to minimize.
[2024-05-30 09:07:33] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 2 ms to minimize.
[2024-05-30 09:07:33] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 2 ms to minimize.
[2024-05-30 09:07:33] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-05-30 09:07:33] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 1 ms to minimize.
[2024-05-30 09:07:33] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 1 ms to minimize.
[2024-05-30 09:07:33] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-05-30 09:07:33] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-05-30 09:07:33] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 2 ms to minimize.
[2024-05-30 09:07:33] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-30 09:07:33] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-30 09:07:34] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-30 09:07:34] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/543 variables, 18/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/543 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 748/1291 variables, 543/686 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1291 variables, 2/688 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 09:07:34] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 2 ms to minimize.
[2024-05-30 09:07:34] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 1 ms to minimize.
[2024-05-30 09:07:34] [INFO ] Deduced a trap composed of 11 places in 106 ms of which 2 ms to minimize.
[2024-05-30 09:07:34] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 2 ms to minimize.
[2024-05-30 09:07:34] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 1 ms to minimize.
[2024-05-30 09:07:34] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 2 ms to minimize.
[2024-05-30 09:07:35] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 1 ms to minimize.
[2024-05-30 09:07:35] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 2 ms to minimize.
[2024-05-30 09:07:35] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
[2024-05-30 09:07:35] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 3 ms to minimize.
[2024-05-30 09:07:35] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1291 variables, 11/699 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 09:07:35] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1291 variables, 1/700 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1291 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 204/1495 variables, 88/788 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1495 variables, 15/803 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1495 variables, 1/804 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 09:07:36] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 3 ms to minimize.
[2024-05-30 09:07:36] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 3 ms to minimize.
[2024-05-30 09:07:36] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 2 ms to minimize.
[2024-05-30 09:07:36] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 2 ms to minimize.
[2024-05-30 09:07:36] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 2 ms to minimize.
[2024-05-30 09:07:36] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 3 ms to minimize.
[2024-05-30 09:07:36] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 2 ms to minimize.
[2024-05-30 09:07:36] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 2 ms to minimize.
[2024-05-30 09:07:37] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 2 ms to minimize.
[2024-05-30 09:07:37] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 2 ms to minimize.
[2024-05-30 09:07:37] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 3 ms to minimize.
[2024-05-30 09:07:37] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 2 ms to minimize.
[2024-05-30 09:07:37] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 2 ms to minimize.
[2024-05-30 09:07:37] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 1 ms to minimize.
[2024-05-30 09:07:37] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1495 variables, 15/819 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1495 variables, 0/819 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 23/1518 variables, 11/830 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1518 variables, 13/843 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 09:07:38] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 2 ms to minimize.
[2024-05-30 09:07:38] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1518 variables, 2/845 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1518 variables, 0/845 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 6/1524 variables, 3/848 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1524 variables, 2/850 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1524 variables, 0/850 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 40/1564 variables, 35/885 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1564 variables, 5/890 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 09:07:38] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 2 ms to minimize.
[2024-05-30 09:07:38] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 2 ms to minimize.
[2024-05-30 09:07:38] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1564 variables, 3/893 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1564 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 4/1568 variables, 2/895 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1568 variables, 0/895 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 2/1570 variables, 4/899 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1570 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 0/1570 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1570/1570 variables, and 899 constraints, problems are : Problem set: 0 solved, 3 unsolved in 7060 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 685/685 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 50/50 constraints]
After SMT, in 7939ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 836 ms.
Support contains 25 out of 685 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 685/685 places, 885/885 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 685 transition count 873
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 673 transition count 873
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 24 place count 673 transition count 859
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 52 place count 659 transition count 859
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 55 place count 656 transition count 856
Iterating global reduction 2 with 3 rules applied. Total rules applied 58 place count 656 transition count 856
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 58 place count 656 transition count 854
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 62 place count 654 transition count 854
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 2 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 2 with 110 rules applied. Total rules applied 172 place count 599 transition count 799
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 2 with 10 rules applied. Total rules applied 182 place count 599 transition count 799
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 187 place count 594 transition count 794
Applied a total of 187 rules in 135 ms. Remains 594 /685 variables (removed 91) and now considering 794/885 (removed 91) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 594/685 places, 794/885 transitions.
RANDOM walk for 40000 steps (75 resets) in 329 ms. (121 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 209 ms. (190 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 194 ms. (205 steps per ms) remains 2/3 properties
FORMULA ShieldRVs-PT-040B-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (8 resets) in 137 ms. (289 steps per ms) remains 2/2 properties
// Phase 1: matrix 794 rows 594 cols
[2024-05-30 09:07:40] [INFO ] Computed 161 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 51/56 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/60 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 112/172 variables, 60/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 247/419 variables, 83/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/419 variables, 14/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/419 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 21/440 variables, 11/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/440 variables, 19/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/440 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/442 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/442 variables, 2/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/442 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 211/653 variables, 92/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/653 variables, 22/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/653 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 14/667 variables, 7/325 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/667 variables, 12/337 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/667 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 117/784 variables, 54/391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/784 variables, 14/405 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/784 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 8/792 variables, 4/409 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/792 variables, 6/415 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/792 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 94/886 variables, 38/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/886 variables, 9/462 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/886 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 6/892 variables, 3/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/892 variables, 6/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/892 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (OVERLAPS) 90/982 variables, 36/507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/982 variables, 8/515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/982 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (OVERLAPS) 7/989 variables, 4/519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/989 variables, 7/526 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/989 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (OVERLAPS) 49/1038 variables, 24/550 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1038 variables, 7/557 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1038 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (OVERLAPS) 4/1042 variables, 1/558 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1042 variables, 2/560 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1042 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (OVERLAPS) 2/1044 variables, 1/561 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1044 variables, 1/562 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1044 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (OVERLAPS) 31/1075 variables, 13/575 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1075 variables, 1/576 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1075 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (OVERLAPS) 3/1078 variables, 2/578 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1078 variables, 3/581 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1078 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 55 (OVERLAPS) 31/1109 variables, 12/593 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1109 variables, 3/596 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1109 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 58 (OVERLAPS) 2/1111 variables, 1/597 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1111 variables, 2/599 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1111 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 61 (OVERLAPS) 31/1142 variables, 12/611 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1142 variables, 3/614 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1142 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 64 (OVERLAPS) 2/1144 variables, 1/615 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1144 variables, 2/617 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1144 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 67 (OVERLAPS) 33/1177 variables, 12/629 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1177 variables, 1/630 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1177 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 70 (OVERLAPS) 4/1181 variables, 3/633 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1181 variables, 4/637 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1181 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 73 (OVERLAPS) 2/1183 variables, 1/638 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1183 variables, 2/640 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1183 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 76 (OVERLAPS) 29/1212 variables, 10/650 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1212 variables, 2/652 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1212 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 79 (OVERLAPS) 2/1214 variables, 1/653 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1214 variables, 2/655 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1214 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 82 (OVERLAPS) 31/1245 variables, 12/667 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1245 variables, 3/670 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1245 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 85 (OVERLAPS) 2/1247 variables, 1/671 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1247 variables, 2/673 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1247 variables, 0/673 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 88 (OVERLAPS) 32/1279 variables, 12/685 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1279 variables, 1/686 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1279 variables, 0/686 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 91 (OVERLAPS) 4/1283 variables, 3/689 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1283 variables, 2/691 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1283 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 94 (OVERLAPS) 2/1285 variables, 1/692 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1285 variables, 2/694 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1285 variables, 0/694 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 97 (OVERLAPS) 31/1316 variables, 12/706 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1316 variables, 1/707 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/1316 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 100 (OVERLAPS) 4/1320 variables, 2/709 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1320 variables, 2/711 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/1320 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 103 (OVERLAPS) 32/1352 variables, 14/725 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1352 variables, 3/728 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/1352 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 106 (OVERLAPS) 2/1354 variables, 1/729 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/1354 variables, 2/731 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/1354 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 109 (OVERLAPS) 28/1382 variables, 12/743 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/1382 variables, 3/746 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/1382 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 112 (OVERLAPS) 2/1384 variables, 1/747 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/1384 variables, 2/749 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/1384 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 115 (OVERLAPS) 4/1388 variables, 4/753 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/1388 variables, 2/755 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/1388 variables, 0/755 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 118 (OVERLAPS) 0/1388 variables, 0/755 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1388/1388 variables, and 755 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1337 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 594/594 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 51/56 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/60 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 09:07:42] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 112/172 variables, 60/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 247/419 variables, 83/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/419 variables, 14/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/419 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 09:07:42] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-30 09:07:42] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/419 variables, 2/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/419 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 21/440 variables, 11/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/440 variables, 19/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/440 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/442 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/442 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/442 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 211/653 variables, 92/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/653 variables, 22/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/653 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 14/667 variables, 7/330 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/667 variables, 12/342 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 09:07:42] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/667 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/667 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 117/784 variables, 54/397 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/784 variables, 14/411 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 09:07:42] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 0 ms to minimize.
[2024-05-30 09:07:42] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/784 variables, 2/413 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/784 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 8/792 variables, 4/417 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/792 variables, 6/423 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/792 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (OVERLAPS) 94/886 variables, 38/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/886 variables, 9/470 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 09:07:42] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 1 ms to minimize.
At refinement iteration 35 (INCLUDED_ONLY) 0/886 variables, 1/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/886 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (OVERLAPS) 6/892 variables, 3/474 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/892 variables, 6/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/892 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (OVERLAPS) 90/982 variables, 36/516 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/982 variables, 8/524 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/982 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (OVERLAPS) 7/989 variables, 4/528 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/989 variables, 7/535 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/989 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (OVERLAPS) 49/1038 variables, 24/559 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1038 variables, 7/566 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1038 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (OVERLAPS) 4/1042 variables, 1/567 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1042 variables, 2/569 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 09:07:43] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
At refinement iteration 51 (INCLUDED_ONLY) 0/1042 variables, 1/570 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1042 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 53 (OVERLAPS) 2/1044 variables, 1/571 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1044 variables, 1/572 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 09:07:43] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2024-05-30 09:07:43] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-05-30 09:07:43] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-05-30 09:07:43] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 1 ms to minimize.
At refinement iteration 55 (INCLUDED_ONLY) 0/1044 variables, 4/576 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1044 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 57 (OVERLAPS) 31/1075 variables, 13/589 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1075 variables, 1/590 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1075 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 60 (OVERLAPS) 3/1078 variables, 2/592 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1078 variables, 3/595 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1078 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 63 (OVERLAPS) 31/1109 variables, 12/607 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1109 variables, 3/610 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1109 variables, 0/610 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 66 (OVERLAPS) 2/1111 variables, 1/611 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1111 variables, 2/613 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1111 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 69 (OVERLAPS) 31/1142 variables, 12/625 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1142 variables, 3/628 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1142 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 72 (OVERLAPS) 2/1144 variables, 1/629 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1144 variables, 2/631 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1144 variables, 0/631 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 75 (OVERLAPS) 33/1177 variables, 12/643 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1177 variables, 1/644 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1177 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 78 (OVERLAPS) 4/1181 variables, 3/647 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1181 variables, 4/651 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1181 variables, 0/651 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 81 (OVERLAPS) 2/1183 variables, 1/652 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1183 variables, 2/654 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1183 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 84 (OVERLAPS) 29/1212 variables, 10/664 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1212 variables, 2/666 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1212 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 87 (OVERLAPS) 2/1214 variables, 1/667 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1214 variables, 2/669 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1214 variables, 0/669 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 90 (OVERLAPS) 31/1245 variables, 12/681 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/1245 variables, 3/684 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1245 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 93 (OVERLAPS) 2/1247 variables, 1/685 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/1247 variables, 2/687 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1247 variables, 0/687 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 96 (OVERLAPS) 32/1279 variables, 12/699 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/1279 variables, 1/700 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1279 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 99 (OVERLAPS) 4/1283 variables, 3/703 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/1283 variables, 2/705 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1283 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 102 (OVERLAPS) 2/1285 variables, 1/706 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/1285 variables, 2/708 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1285 variables, 0/708 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 105 (OVERLAPS) 31/1316 variables, 12/720 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/1316 variables, 1/721 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/1316 variables, 0/721 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 108 (OVERLAPS) 4/1320 variables, 2/723 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/1320 variables, 2/725 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/1320 variables, 0/725 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 111 (OVERLAPS) 32/1352 variables, 14/739 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/1352 variables, 3/742 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/1352 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 114 (OVERLAPS) 2/1354 variables, 1/743 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/1354 variables, 2/745 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/1354 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 117 (OVERLAPS) 28/1382 variables, 12/757 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/1382 variables, 3/760 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/1382 variables, 0/760 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 120 (OVERLAPS) 2/1384 variables, 1/761 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/1384 variables, 2/763 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/1384 variables, 0/763 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 123 (OVERLAPS) 4/1388 variables, 4/767 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/1388 variables, 2/769 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/1388 variables, 0/769 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 126 (OVERLAPS) 0/1388 variables, 0/769 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1388/1388 variables, and 769 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2632 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 594/594 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 12/12 constraints]
After SMT, in 3980ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 210 ms.
Support contains 5 out of 594 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 594/594 places, 794/794 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 594 transition count 791
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 591 transition count 791
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 6 place count 591 transition count 783
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 22 place count 583 transition count 783
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 44 place count 572 transition count 772
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 48 place count 572 transition count 772
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 52 place count 568 transition count 768
Applied a total of 52 rules in 62 ms. Remains 568 /594 variables (removed 26) and now considering 768/794 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 568/594 places, 768/794 transitions.
RANDOM walk for 40000 steps (84 resets) in 303 ms. (131 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 181 ms. (219 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (9 resets) in 188 ms. (211 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 287501 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :0 out of 2
Probabilistic random walk after 287501 steps, saw 280743 distinct states, run finished after 3004 ms. (steps per millisecond=95 ) properties seen :0
// Phase 1: matrix 768 rows 568 cols
[2024-05-30 09:07:48] [INFO ] Computed 161 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 48/53 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/57 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 109/166 variables, 57/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 239/405 variables, 82/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/405 variables, 18/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/405 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 14/419 variables, 7/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/419 variables, 14/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/419 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 210/629 variables, 91/283 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/629 variables, 24/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/629 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 12/641 variables, 6/313 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/641 variables, 12/325 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/641 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 114/755 variables, 52/377 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/755 variables, 15/392 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/755 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 6/761 variables, 3/395 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/761 variables, 6/401 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/761 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 93/854 variables, 36/437 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/854 variables, 9/446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/854 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 6/860 variables, 3/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/860 variables, 6/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/860 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 89/949 variables, 36/491 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/949 variables, 9/500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/949 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (OVERLAPS) 6/955 variables, 3/503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/955 variables, 6/509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/955 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (OVERLAPS) 48/1003 variables, 24/533 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1003 variables, 7/540 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1003 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (OVERLAPS) 2/1005 variables, 1/541 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1005 variables, 2/543 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1005 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (OVERLAPS) 31/1036 variables, 12/555 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1036 variables, 3/558 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1036 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (OVERLAPS) 2/1038 variables, 1/559 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1038 variables, 2/561 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1038 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (OVERLAPS) 31/1069 variables, 12/573 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1069 variables, 3/576 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1069 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (OVERLAPS) 2/1071 variables, 1/577 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1071 variables, 2/579 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1071 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 55 (OVERLAPS) 31/1102 variables, 12/591 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1102 variables, 3/594 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1102 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 58 (OVERLAPS) 2/1104 variables, 1/595 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1104 variables, 2/597 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1104 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 61 (OVERLAPS) 31/1135 variables, 12/609 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1135 variables, 3/612 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1135 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 64 (OVERLAPS) 2/1137 variables, 1/613 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1137 variables, 2/615 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1137 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 67 (OVERLAPS) 31/1168 variables, 12/627 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1168 variables, 3/630 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1168 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 70 (OVERLAPS) 2/1170 variables, 1/631 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1170 variables, 2/633 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1170 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 73 (OVERLAPS) 31/1201 variables, 12/645 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1201 variables, 3/648 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1201 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 76 (OVERLAPS) 2/1203 variables, 1/649 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1203 variables, 2/651 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1203 variables, 0/651 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 79 (OVERLAPS) 31/1234 variables, 12/663 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1234 variables, 3/666 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1234 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 82 (OVERLAPS) 2/1236 variables, 1/667 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1236 variables, 2/669 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1236 variables, 0/669 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 85 (OVERLAPS) 31/1267 variables, 12/681 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1267 variables, 3/684 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1267 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 88 (OVERLAPS) 2/1269 variables, 1/685 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1269 variables, 2/687 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1269 variables, 0/687 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 91 (OVERLAPS) 31/1300 variables, 12/699 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1300 variables, 3/702 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1300 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 94 (OVERLAPS) 2/1302 variables, 1/703 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1302 variables, 2/705 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1302 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 97 (OVERLAPS) 28/1330 variables, 12/717 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1330 variables, 3/720 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/1330 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 100 (OVERLAPS) 2/1332 variables, 1/721 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1332 variables, 2/723 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/1332 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 103 (OVERLAPS) 4/1336 variables, 4/727 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1336 variables, 2/729 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/1336 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 106 (OVERLAPS) 0/1336 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1336/1336 variables, and 729 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1207 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 568/568 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 48/53 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/57 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 09:07:49] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 109/166 variables, 57/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 239/405 variables, 82/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/405 variables, 18/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/405 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 09:07:49] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-30 09:07:49] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-05-30 09:07:49] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/405 variables, 3/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/405 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 14/419 variables, 7/184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/419 variables, 14/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/419 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 210/629 variables, 91/289 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/629 variables, 24/313 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 09:07:49] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/629 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/629 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 12/641 variables, 6/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/641 variables, 12/332 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/641 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 114/755 variables, 52/384 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/755 variables, 15/399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/755 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 6/761 variables, 3/402 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/761 variables, 6/408 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/761 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 93/854 variables, 36/444 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/854 variables, 9/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/854 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (OVERLAPS) 6/860 variables, 3/456 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/860 variables, 6/462 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/860 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (OVERLAPS) 89/949 variables, 36/498 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/949 variables, 9/507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/949 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (OVERLAPS) 6/955 variables, 3/510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/955 variables, 6/516 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/955 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (OVERLAPS) 48/1003 variables, 24/540 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1003 variables, 7/547 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 09:07:50] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2024-05-30 09:07:50] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 2 ms to minimize.
At refinement iteration 43 (INCLUDED_ONLY) 0/1003 variables, 2/549 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1003 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (OVERLAPS) 2/1005 variables, 1/550 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1005 variables, 2/552 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 09:07:50] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 1 ms to minimize.
At refinement iteration 47 (INCLUDED_ONLY) 0/1005 variables, 1/553 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1005 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (OVERLAPS) 31/1036 variables, 12/565 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1036 variables, 3/568 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 09:07:50] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
At refinement iteration 51 (INCLUDED_ONLY) 0/1036 variables, 1/569 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 09:07:50] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
At refinement iteration 52 (INCLUDED_ONLY) 0/1036 variables, 1/570 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1036 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 54 (OVERLAPS) 2/1038 variables, 1/571 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1038 variables, 2/573 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1038 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 57 (OVERLAPS) 31/1069 variables, 12/585 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1069 variables, 3/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1069 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 60 (OVERLAPS) 2/1071 variables, 1/589 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1071 variables, 2/591 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1071 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 63 (OVERLAPS) 31/1102 variables, 12/603 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1102 variables, 3/606 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1102 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 66 (OVERLAPS) 2/1104 variables, 1/607 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1104 variables, 2/609 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1104 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 69 (OVERLAPS) 31/1135 variables, 12/621 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1135 variables, 3/624 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1135 variables, 0/624 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 72 (OVERLAPS) 2/1137 variables, 1/625 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1137 variables, 2/627 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1137 variables, 0/627 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 75 (OVERLAPS) 31/1168 variables, 12/639 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1168 variables, 3/642 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1168 variables, 0/642 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 78 (OVERLAPS) 2/1170 variables, 1/643 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1170 variables, 2/645 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1170 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 81 (OVERLAPS) 31/1201 variables, 12/657 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1201 variables, 3/660 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1201 variables, 0/660 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 84 (OVERLAPS) 2/1203 variables, 1/661 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1203 variables, 2/663 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1203 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 87 (OVERLAPS) 31/1234 variables, 12/675 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1234 variables, 3/678 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1234 variables, 0/678 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 90 (OVERLAPS) 2/1236 variables, 1/679 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/1236 variables, 2/681 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1236 variables, 0/681 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 93 (OVERLAPS) 31/1267 variables, 12/693 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/1267 variables, 3/696 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1267 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 96 (OVERLAPS) 2/1269 variables, 1/697 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/1269 variables, 2/699 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1269 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 99 (OVERLAPS) 31/1300 variables, 12/711 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/1300 variables, 3/714 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1300 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 102 (OVERLAPS) 2/1302 variables, 1/715 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/1302 variables, 2/717 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1302 variables, 0/717 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 105 (OVERLAPS) 28/1330 variables, 12/729 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/1330 variables, 3/732 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/1330 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 108 (OVERLAPS) 2/1332 variables, 1/733 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/1332 variables, 2/735 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/1332 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 111 (OVERLAPS) 4/1336 variables, 4/739 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/1336 variables, 2/741 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/1336 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 114 (OVERLAPS) 0/1336 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1336/1336 variables, and 741 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2453 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 568/568 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 10/10 constraints]
After SMT, in 3675ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 190 ms.
Support contains 5 out of 568 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 568/568 places, 768/768 transitions.
Applied a total of 0 rules in 15 ms. Remains 568 /568 variables (removed 0) and now considering 768/768 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 568/568 places, 768/768 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 568/568 places, 768/768 transitions.
Applied a total of 0 rules in 14 ms. Remains 568 /568 variables (removed 0) and now considering 768/768 (removed 0) transitions.
[2024-05-30 09:07:52] [INFO ] Invariant cache hit.
[2024-05-30 09:07:52] [INFO ] Implicit Places using invariants in 300 ms returned []
[2024-05-30 09:07:52] [INFO ] Invariant cache hit.
[2024-05-30 09:07:53] [INFO ] Implicit Places using invariants and state equation in 597 ms returned []
Implicit Place search using SMT with State Equation took 909 ms to find 0 implicit places.
[2024-05-30 09:07:53] [INFO ] Redundant transitions in 127 ms returned []
Running 764 sub problems to find dead transitions.
[2024-05-30 09:07:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/565 variables, 149/149 constraints. Problems are: Problem set: 0 solved, 764 unsolved
[2024-05-30 09:08:00] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
[2024-05-30 09:08:00] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-30 09:08:00] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
[2024-05-30 09:08:00] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2024-05-30 09:08:00] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-30 09:08:00] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2024-05-30 09:08:00] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
[2024-05-30 09:08:00] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-30 09:08:00] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-30 09:08:00] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-30 09:08:00] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
[2024-05-30 09:08:00] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-30 09:08:00] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-30 09:08:00] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2024-05-30 09:08:00] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-30 09:08:00] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-30 09:08:00] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 0 ms to minimize.
[2024-05-30 09:08:00] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-30 09:08:01] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-30 09:08:01] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/565 variables, 20/169 constraints. Problems are: Problem set: 0 solved, 764 unsolved
[2024-05-30 09:08:01] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
[2024-05-30 09:08:01] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
[2024-05-30 09:08:01] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-30 09:08:01] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-30 09:08:01] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-05-30 09:08:01] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 0 ms to minimize.
[2024-05-30 09:08:01] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 0 ms to minimize.
[2024-05-30 09:08:01] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2024-05-30 09:08:03] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 1 ms to minimize.
[2024-05-30 09:08:03] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 1 ms to minimize.
[2024-05-30 09:08:03] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 2 ms to minimize.
[2024-05-30 09:08:03] [INFO ] Deduced a trap composed of 6 places in 109 ms of which 1 ms to minimize.
[2024-05-30 09:08:03] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 2 ms to minimize.
[2024-05-30 09:08:03] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 2 ms to minimize.
[2024-05-30 09:08:03] [INFO ] Deduced a trap composed of 6 places in 97 ms of which 2 ms to minimize.
[2024-05-30 09:08:03] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 1 ms to minimize.
[2024-05-30 09:08:03] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 1 ms to minimize.
[2024-05-30 09:08:03] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 2 ms to minimize.
[2024-05-30 09:08:04] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 1 ms to minimize.
[2024-05-30 09:08:04] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/565 variables, 20/189 constraints. Problems are: Problem set: 0 solved, 764 unsolved
[2024-05-30 09:08:04] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-30 09:08:04] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-30 09:08:04] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 0 ms to minimize.
[2024-05-30 09:08:04] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-05-30 09:08:04] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-30 09:08:04] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2024-05-30 09:08:04] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 0 ms to minimize.
[2024-05-30 09:08:05] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-30 09:08:05] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-30 09:08:05] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-05-30 09:08:05] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-05-30 09:08:05] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 1 ms to minimize.
[2024-05-30 09:08:05] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 1 ms to minimize.
[2024-05-30 09:08:05] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 1 ms to minimize.
[2024-05-30 09:08:05] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 1 ms to minimize.
[2024-05-30 09:08:05] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2024-05-30 09:08:05] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
[2024-05-30 09:08:05] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 1 ms to minimize.
[2024-05-30 09:08:05] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 1 ms to minimize.
[2024-05-30 09:08:05] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/565 variables, 20/209 constraints. Problems are: Problem set: 0 solved, 764 unsolved
[2024-05-30 09:08:12] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 0 ms to minimize.
[2024-05-30 09:08:12] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-30 09:08:12] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-05-30 09:08:12] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-30 09:08:12] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-30 09:08:12] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-30 09:08:12] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-30 09:08:13] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 2 ms to minimize.
[2024-05-30 09:08:14] [INFO ] Deduced a trap composed of 6 places in 130 ms of which 2 ms to minimize.
[2024-05-30 09:08:14] [INFO ] Deduced a trap composed of 6 places in 117 ms of which 2 ms to minimize.
[2024-05-30 09:08:14] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 2 ms to minimize.
[2024-05-30 09:08:14] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 2 ms to minimize.
[2024-05-30 09:08:14] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 2 ms to minimize.
[2024-05-30 09:08:14] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 2 ms to minimize.
[2024-05-30 09:08:14] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 2 ms to minimize.
[2024-05-30 09:08:14] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 2 ms to minimize.
[2024-05-30 09:08:15] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 2 ms to minimize.
[2024-05-30 09:08:15] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 2 ms to minimize.
[2024-05-30 09:08:15] [INFO ] Deduced a trap composed of 6 places in 108 ms of which 2 ms to minimize.
[2024-05-30 09:08:15] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/565 variables, 20/229 constraints. Problems are: Problem set: 0 solved, 764 unsolved
[2024-05-30 09:08:16] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2024-05-30 09:08:16] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-30 09:08:16] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2024-05-30 09:08:16] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-30 09:08:16] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-05-30 09:08:16] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 1 ms to minimize.
[2024-05-30 09:08:16] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 2 ms to minimize.
[2024-05-30 09:08:16] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 2 ms to minimize.
[2024-05-30 09:08:17] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 2 ms to minimize.
[2024-05-30 09:08:17] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2024-05-30 09:08:17] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 2 ms to minimize.
[2024-05-30 09:08:17] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 1 ms to minimize.
[2024-05-30 09:08:17] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-05-30 09:08:17] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 2 ms to minimize.
[2024-05-30 09:08:17] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 2 ms to minimize.
[2024-05-30 09:08:17] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 1 ms to minimize.
[2024-05-30 09:08:17] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 2 ms to minimize.
[2024-05-30 09:08:17] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-30 09:08:18] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-05-30 09:08:18] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/565 variables, 20/249 constraints. Problems are: Problem set: 0 solved, 764 unsolved
[2024-05-30 09:08:18] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 1 ms to minimize.
[2024-05-30 09:08:19] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 1 ms to minimize.
[2024-05-30 09:08:19] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 1 ms to minimize.
[2024-05-30 09:08:19] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2024-05-30 09:08:19] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 1 ms to minimize.
[2024-05-30 09:08:19] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2024-05-30 09:08:19] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 2 ms to minimize.
[2024-05-30 09:08:19] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 2 ms to minimize.
[2024-05-30 09:08:20] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 2 ms to minimize.
[2024-05-30 09:08:20] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2024-05-30 09:08:20] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-30 09:08:20] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2024-05-30 09:08:20] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-30 09:08:20] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-05-30 09:08:20] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2024-05-30 09:08:20] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-30 09:08:20] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-30 09:08:20] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-30 09:08:20] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-30 09:08:20] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 20/269 constraints. Problems are: Problem set: 0 solved, 764 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 565/1336 variables, and 269 constraints, problems are : Problem set: 0 solved, 764 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 149/161 constraints, State Equation: 0/568 constraints, PredecessorRefiner: 764/764 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 0 solved, 764 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/565 variables, 149/149 constraints. Problems are: Problem set: 0 solved, 764 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/565 variables, 120/269 constraints. Problems are: Problem set: 0 solved, 764 unsolved
[2024-05-30 09:08:24] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-30 09:08:24] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-30 09:08:24] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-30 09:08:24] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-30 09:08:24] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-05-30 09:08:24] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-30 09:08:24] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-30 09:08:24] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 1 ms to minimize.
[2024-05-30 09:08:24] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-05-30 09:08:25] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 2 ms to minimize.
[2024-05-30 09:08:25] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-30 09:08:25] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-30 09:08:25] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 1 ms to minimize.
[2024-05-30 09:08:25] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-05-30 09:08:25] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-05-30 09:08:25] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 2 ms to minimize.
[2024-05-30 09:08:25] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-05-30 09:08:25] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2024-05-30 09:08:25] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2024-05-30 09:08:25] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/565 variables, 20/289 constraints. Problems are: Problem set: 0 solved, 764 unsolved
[2024-05-30 09:08:26] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-30 09:08:26] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 0 ms to minimize.
[2024-05-30 09:08:27] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 1 ms to minimize.
[2024-05-30 09:08:27] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
[2024-05-30 09:08:27] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 2 ms to minimize.
[2024-05-30 09:08:27] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 1 ms to minimize.
[2024-05-30 09:08:27] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 2 ms to minimize.
[2024-05-30 09:08:27] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 2 ms to minimize.
[2024-05-30 09:08:27] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 2 ms to minimize.
[2024-05-30 09:08:28] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-30 09:08:28] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-30 09:08:28] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2024-05-30 09:08:28] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-30 09:08:28] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
[2024-05-30 09:08:28] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-05-30 09:08:28] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2024-05-30 09:08:28] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
[2024-05-30 09:08:28] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-05-30 09:08:28] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2024-05-30 09:08:28] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/565 variables, 20/309 constraints. Problems are: Problem set: 0 solved, 764 unsolved
[2024-05-30 09:08:29] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 1 ms to minimize.
[2024-05-30 09:08:30] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 3 ms to minimize.
[2024-05-30 09:08:30] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.
[2024-05-30 09:08:30] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-05-30 09:08:30] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-30 09:08:30] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-30 09:08:30] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-30 09:08:30] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-30 09:08:31] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-05-30 09:08:31] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
[2024-05-30 09:08:31] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-05-30 09:08:31] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 0 ms to minimize.
[2024-05-30 09:08:31] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 0 ms to minimize.
[2024-05-30 09:08:31] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 0 ms to minimize.
[2024-05-30 09:08:31] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-05-30 09:08:31] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-30 09:08:32] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-05-30 09:08:32] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-05-30 09:08:32] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2024-05-30 09:08:32] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/565 variables, 20/329 constraints. Problems are: Problem set: 0 solved, 764 unsolved
[2024-05-30 09:08:32] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-05-30 09:08:32] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-30 09:08:33] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-05-30 09:08:33] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-30 09:08:33] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
[2024-05-30 09:08:34] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-30 09:08:34] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-30 09:08:34] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-05-30 09:08:34] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 0 ms to minimize.
[2024-05-30 09:08:34] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-05-30 09:08:35] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-05-30 09:08:35] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-30 09:08:35] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2024-05-30 09:08:35] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2024-05-30 09:08:35] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-30 09:08:35] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-30 09:08:35] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-05-30 09:08:35] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2024-05-30 09:08:35] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-05-30 09:08:35] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/565 variables, 20/349 constraints. Problems are: Problem set: 0 solved, 764 unsolved
[2024-05-30 09:08:36] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-05-30 09:08:36] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2024-05-30 09:08:36] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
[2024-05-30 09:08:36] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2024-05-30 09:08:36] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2024-05-30 09:08:37] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2024-05-30 09:08:37] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-30 09:08:37] [INFO ] Deduced a trap composed of 52 places in 57 ms of which 1 ms to minimize.
[2024-05-30 09:08:37] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 1 ms to minimize.
[2024-05-30 09:08:37] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 0 ms to minimize.
[2024-05-30 09:08:37] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 1 ms to minimize.
[2024-05-30 09:08:37] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
[2024-05-30 09:08:37] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 1 ms to minimize.
[2024-05-30 09:08:37] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 1 ms to minimize.
[2024-05-30 09:08:37] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
[2024-05-30 09:08:37] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
[2024-05-30 09:08:37] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2024-05-30 09:08:37] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 1 ms to minimize.
[2024-05-30 09:08:37] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
[2024-05-30 09:08:38] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 20/369 constraints. Problems are: Problem set: 0 solved, 764 unsolved
[2024-05-30 09:08:38] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-05-30 09:08:38] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2024-05-30 09:08:38] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-05-30 09:08:38] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2024-05-30 09:08:38] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-05-30 09:08:38] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 0 ms to minimize.
[2024-05-30 09:08:39] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2024-05-30 09:08:39] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 1 ms to minimize.
[2024-05-30 09:08:39] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-05-30 09:08:39] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-05-30 09:08:39] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-05-30 09:08:39] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2024-05-30 09:08:39] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-30 09:08:39] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 1 ms to minimize.
[2024-05-30 09:08:39] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-30 09:08:39] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 1 ms to minimize.
[2024-05-30 09:08:39] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 1 ms to minimize.
[2024-05-30 09:08:39] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 1 ms to minimize.
[2024-05-30 09:08:39] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
[2024-05-30 09:08:39] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 20/389 constraints. Problems are: Problem set: 0 solved, 764 unsolved
[2024-05-30 09:08:40] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-30 09:08:40] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 0 ms to minimize.
[2024-05-30 09:08:40] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-30 09:08:40] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-05-30 09:08:40] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
[2024-05-30 09:08:40] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
[2024-05-30 09:08:40] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-30 09:08:40] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-05-30 09:08:40] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-30 09:08:40] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-30 09:08:40] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-30 09:08:40] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-05-30 09:08:40] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
[2024-05-30 09:08:41] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-05-30 09:08:41] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-30 09:08:41] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 0 ms to minimize.
[2024-05-30 09:08:41] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 0 ms to minimize.
[2024-05-30 09:08:41] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-30 09:08:41] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-30 09:08:41] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/565 variables, 20/409 constraints. Problems are: Problem set: 0 solved, 764 unsolved
[2024-05-30 09:08:42] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-30 09:08:42] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-30 09:08:42] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2024-05-30 09:08:42] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-05-30 09:08:42] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-30 09:08:42] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-30 09:08:42] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 1 ms to minimize.
[2024-05-30 09:08:43] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2024-05-30 09:08:43] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 2 ms to minimize.
[2024-05-30 09:08:43] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-05-30 09:08:43] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 1 ms to minimize.
[2024-05-30 09:08:43] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 2 ms to minimize.
[2024-05-30 09:08:43] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-05-30 09:08:44] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-30 09:08:44] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 2 ms to minimize.
[2024-05-30 09:08:44] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 1 ms to minimize.
[2024-05-30 09:08:44] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 1 ms to minimize.
[2024-05-30 09:08:45] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-30 09:08:45] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-05-30 09:08:46] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/565 variables, 20/429 constraints. Problems are: Problem set: 0 solved, 764 unsolved
[2024-05-30 09:08:47] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 2 ms to minimize.
[2024-05-30 09:08:47] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 2 ms to minimize.
[2024-05-30 09:08:47] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 2 ms to minimize.
[2024-05-30 09:08:49] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-05-30 09:08:50] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-05-30 09:08:50] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2024-05-30 09:08:50] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2024-05-30 09:08:50] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-05-30 09:08:50] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 0 ms to minimize.
[2024-05-30 09:08:50] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-30 09:08:50] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 0 ms to minimize.
[2024-05-30 09:08:51] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2024-05-30 09:08:51] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-30 09:08:51] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-05-30 09:08:51] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 1 ms to minimize.
[2024-05-30 09:08:51] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 0 ms to minimize.
[2024-05-30 09:08:51] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-30 09:08:52] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 0 ms to minimize.
[2024-05-30 09:08:52] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2024-05-30 09:08:52] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/565 variables, 20/449 constraints. Problems are: Problem set: 0 solved, 764 unsolved
[2024-05-30 09:08:52] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-30 09:08:52] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-30 09:08:52] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 565/1336 variables, and 452 constraints, problems are : Problem set: 0 solved, 764 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 149/161 constraints, State Equation: 0/568 constraints, PredecessorRefiner: 0/764 constraints, Known Traps: 303/303 constraints]
After SMT, in 60316ms problems are : Problem set: 0 solved, 764 unsolved
Search for dead transitions found 0 dead transitions in 60325ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61386 ms. Remains : 568/568 places, 768/768 transitions.
[2024-05-30 09:08:53] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2024-05-30 09:08:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 568 places, 768 transitions and 3703 arcs took 8 ms.
[2024-05-30 09:08:53] [INFO ] Flatten gal took : 109 ms
Total runtime 92620 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldRVs-PT-040B

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 568
TRANSITIONS: 768
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.014s, Sys 0.006s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.002s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1762
MODEL NAME: /home/mcc/execution/412/model
568 places, 768 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA ShieldRVs-PT-040B-ReachabilityCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldRVs-PT-040B-ReachabilityCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717060145682

--------------------
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

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-040B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is ShieldRVs-PT-040B, 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 r355-tall-171683759700846"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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