Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r528-tall-171683761300527.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is ShieldPPPs-PT-100B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683761300527
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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.8K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K Apr 13 11:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 13 11:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 13 11:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 13 11:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.8M 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 ShieldPPPs-PT-100B-ReachabilityFireability-2024-00
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-2024-01
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-2024-02
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-2024-03
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-2024-04
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-2024-05
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-2024-06
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-2024-07
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-2024-08
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-2024-09
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-2024-10
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-2024-11
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-2024-12
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-2024-13
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-2024-14
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717254879206

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-100B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:14:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 15:14:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:14:40] [INFO ] Load time of PNML (sax parser for PT used): 297 ms
[2024-06-01 15:14:40] [INFO ] Transformed 6803 places.
[2024-06-01 15:14:40] [INFO ] Transformed 6303 transitions.
[2024-06-01 15:14:40] [INFO ] Found NUPN structural information;
[2024-06-01 15:14:41] [INFO ] Parsed PT model containing 6803 places and 6303 transitions and 17406 arcs in 700 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 2241 ms. (17 steps per ms) remains 9/16 properties
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 219 ms. (181 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 199 ms. (200 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 443 ms. (90 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 201 ms. (198 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 655 ms. (60 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 9/9 properties
// Phase 1: matrix 6303 rows 6803 cols
[2024-06-01 15:14:42] [INFO ] Computed 1101 invariants in 65 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 189/189 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 5997/6186 variables, 987/1176 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6186 variables, 5997/7173 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6186 variables, 0/7173 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 617/6803 variables, 114/7287 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6803 variables, 617/7904 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6803 variables, 0/7904 constraints. Problems are: Problem set: 0 solved, 9 unsolved
SMT process timed out in 5308ms, After SMT, problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 189 out of 6803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6803/6803 places, 6303/6303 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 653 transitions
Trivial Post-agglo rules discarded 653 transitions
Performed 653 trivial Post agglomeration. Transition count delta: 653
Iterating post reduction 0 with 653 rules applied. Total rules applied 653 place count 6803 transition count 5650
Reduce places removed 653 places and 0 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 1 with 668 rules applied. Total rules applied 1321 place count 6150 transition count 5635
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 1336 place count 6135 transition count 5635
Performed 501 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 501 Pre rules applied. Total rules applied 1336 place count 6135 transition count 5134
Deduced a syphon composed of 501 places in 24 ms
Reduce places removed 501 places and 0 transitions.
Iterating global reduction 3 with 1002 rules applied. Total rules applied 2338 place count 5634 transition count 5134
Discarding 672 places :
Symmetric choice reduction at 3 with 672 rule applications. Total rules 3010 place count 4962 transition count 4462
Iterating global reduction 3 with 672 rules applied. Total rules applied 3682 place count 4962 transition count 4462
Performed 269 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 269 Pre rules applied. Total rules applied 3682 place count 4962 transition count 4193
Deduced a syphon composed of 269 places in 22 ms
Reduce places removed 269 places and 0 transitions.
Iterating global reduction 3 with 538 rules applied. Total rules applied 4220 place count 4693 transition count 4193
Performed 1418 Post agglomeration using F-continuation condition.Transition count delta: 1418
Deduced a syphon composed of 1418 places in 7 ms
Reduce places removed 1418 places and 0 transitions.
Iterating global reduction 3 with 2836 rules applied. Total rules applied 7056 place count 3275 transition count 2775
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 829 times.
Drop transitions (Partial Free agglomeration) removed 829 transitions
Iterating global reduction 3 with 829 rules applied. Total rules applied 7885 place count 3275 transition count 2775
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 7886 place count 3274 transition count 2774
Applied a total of 7886 rules in 2916 ms. Remains 3274 /6803 variables (removed 3529) and now considering 2774/6303 (removed 3529) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2929 ms. Remains : 3274/6803 places, 2774/6303 transitions.
RANDOM walk for 40000 steps (8 resets) in 1231 ms. (32 steps per ms) remains 6/9 properties
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 503 ms. (79 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 548 ms. (72 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 441 ms. (90 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 502 ms. (79 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 419 ms. (95 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 456 ms. (87 steps per ms) remains 6/6 properties
// Phase 1: matrix 2774 rows 3274 cols
[2024-06-01 15:14:52] [INFO ] Computed 1101 invariants in 80 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 2681/2862 variables, 937/937 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2862 variables, 0/937 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 40/2902 variables, 16/953 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2902 variables, 0/953 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 102/3004 variables, 51/1004 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3004 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 2614/5618 variables, 3004/4008 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5618 variables, 0/4008 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 213/5831 variables, 128/4136 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/5831 variables, 35/4171 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/5831 variables, 2/4173 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5831 variables, 0/4173 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 8/5839 variables, 7/4180 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5839 variables, 6/4186 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/5839 variables, 0/4186 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 10/5849 variables, 5/4191 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5849 variables, 4/4195 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5849 variables, 0/4195 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 4/5853 variables, 2/4197 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/5853 variables, 4/4201 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/5853 variables, 0/4201 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (OVERLAPS) 116/5969 variables, 74/4275 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/5969 variables, 20/4295 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/5969 variables, 0/4295 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (OVERLAPS) 4/5973 variables, 5/4300 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/5973 variables, 4/4304 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/5973 variables, 0/4304 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (OVERLAPS) 4/5977 variables, 2/4306 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/5977 variables, 2/4308 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/5977 variables, 0/4308 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 31 (OVERLAPS) 4/5981 variables, 2/4310 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/5981 variables, 2/4312 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/5981 variables, 0/4312 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 34 (OVERLAPS) 1/5982 variables, 1/4313 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/5982 variables, 1/4314 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/5982 variables, 0/4314 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 37 (OVERLAPS) 31/6013 variables, 24/4338 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/6013 variables, 7/4345 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/6013 variables, 0/4345 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 40 (OVERLAPS) 2/6015 variables, 1/4346 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/6015 variables, 0/4346 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 42 (OVERLAPS) 1/6016 variables, 1/4347 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/6016 variables, 1/4348 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/6016 variables, 0/4348 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 45 (OVERLAPS) 18/6034 variables, 11/4359 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/6034 variables, 4/4363 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/6034 variables, 0/4363 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 48 (OVERLAPS) 14/6048 variables, 9/4372 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/6048 variables, 3/4375 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/6048 variables, 0/4375 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 51 (OVERLAPS) 0/6048 variables, 0/4375 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6048/6048 variables, and 4375 constraints, problems are : Problem set: 0 solved, 6 unsolved in 12678 ms.
Refiners :[Positive P Invariants (semi-flows): 1043/1043 constraints, Generalized P Invariants (flows): 58/58 constraints, State Equation: 3274/3274 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 2681/2862 variables, 937/937 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 15:15:05] [INFO ] Deduced a trap composed of 6 places in 253 ms of which 32 ms to minimize.
[2024-06-01 15:15:05] [INFO ] Deduced a trap composed of 5 places in 258 ms of which 4 ms to minimize.
[2024-06-01 15:15:06] [INFO ] Deduced a trap composed of 7 places in 254 ms of which 4 ms to minimize.
[2024-06-01 15:15:06] [INFO ] Deduced a trap composed of 7 places in 201 ms of which 4 ms to minimize.
[2024-06-01 15:15:06] [INFO ] Deduced a trap composed of 6 places in 238 ms of which 4 ms to minimize.
[2024-06-01 15:15:07] [INFO ] Deduced a trap composed of 5 places in 205 ms of which 4 ms to minimize.
[2024-06-01 15:15:07] [INFO ] Deduced a trap composed of 7 places in 203 ms of which 4 ms to minimize.
[2024-06-01 15:15:07] [INFO ] Deduced a trap composed of 7 places in 189 ms of which 4 ms to minimize.
[2024-06-01 15:15:07] [INFO ] Deduced a trap composed of 10 places in 191 ms of which 3 ms to minimize.
[2024-06-01 15:15:07] [INFO ] Deduced a trap composed of 11 places in 184 ms of which 3 ms to minimize.
[2024-06-01 15:15:08] [INFO ] Deduced a trap composed of 9 places in 196 ms of which 4 ms to minimize.
[2024-06-01 15:15:08] [INFO ] Deduced a trap composed of 8 places in 175 ms of which 3 ms to minimize.
[2024-06-01 15:15:08] [INFO ] Deduced a trap composed of 7 places in 181 ms of which 3 ms to minimize.
[2024-06-01 15:15:08] [INFO ] Deduced a trap composed of 11 places in 174 ms of which 4 ms to minimize.
[2024-06-01 15:15:09] [INFO ] Deduced a trap composed of 14 places in 168 ms of which 3 ms to minimize.
[2024-06-01 15:15:09] [INFO ] Deduced a trap composed of 14 places in 162 ms of which 3 ms to minimize.
[2024-06-01 15:15:09] [INFO ] Deduced a trap composed of 8 places in 165 ms of which 3 ms to minimize.
[2024-06-01 15:15:09] [INFO ] Deduced a trap composed of 7 places in 181 ms of which 3 ms to minimize.
[2024-06-01 15:15:09] [INFO ] Deduced a trap composed of 8 places in 176 ms of which 3 ms to minimize.
[2024-06-01 15:15:10] [INFO ] Deduced a trap composed of 10 places in 163 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2862 variables, 20/957 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 15:15:10] [INFO ] Deduced a trap composed of 5 places in 173 ms of which 3 ms to minimize.
[2024-06-01 15:15:10] [INFO ] Deduced a trap composed of 8 places in 171 ms of which 3 ms to minimize.
[2024-06-01 15:15:10] [INFO ] Deduced a trap composed of 6 places in 202 ms of which 3 ms to minimize.
[2024-06-01 15:15:11] [INFO ] Deduced a trap composed of 9 places in 185 ms of which 3 ms to minimize.
[2024-06-01 15:15:11] [INFO ] Deduced a trap composed of 6 places in 189 ms of which 4 ms to minimize.
[2024-06-01 15:15:11] [INFO ] Deduced a trap composed of 9 places in 177 ms of which 4 ms to minimize.
[2024-06-01 15:15:11] [INFO ] Deduced a trap composed of 9 places in 178 ms of which 3 ms to minimize.
[2024-06-01 15:15:11] [INFO ] Deduced a trap composed of 9 places in 180 ms of which 4 ms to minimize.
[2024-06-01 15:15:12] [INFO ] Deduced a trap composed of 8 places in 186 ms of which 3 ms to minimize.
[2024-06-01 15:15:12] [INFO ] Deduced a trap composed of 8 places in 181 ms of which 4 ms to minimize.
[2024-06-01 15:15:12] [INFO ] Deduced a trap composed of 10 places in 175 ms of which 3 ms to minimize.
[2024-06-01 15:15:12] [INFO ] Deduced a trap composed of 10 places in 173 ms of which 3 ms to minimize.
[2024-06-01 15:15:13] [INFO ] Deduced a trap composed of 13 places in 178 ms of which 4 ms to minimize.
[2024-06-01 15:15:13] [INFO ] Deduced a trap composed of 8 places in 175 ms of which 5 ms to minimize.
[2024-06-01 15:15:13] [INFO ] Deduced a trap composed of 10 places in 165 ms of which 4 ms to minimize.
[2024-06-01 15:15:13] [INFO ] Deduced a trap composed of 9 places in 173 ms of which 3 ms to minimize.
[2024-06-01 15:15:14] [INFO ] Deduced a trap composed of 8 places in 182 ms of which 3 ms to minimize.
[2024-06-01 15:15:14] [INFO ] Deduced a trap composed of 8 places in 187 ms of which 3 ms to minimize.
[2024-06-01 15:15:14] [INFO ] Deduced a trap composed of 9 places in 176 ms of which 3 ms to minimize.
[2024-06-01 15:15:14] [INFO ] Deduced a trap composed of 9 places in 179 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2862 variables, 20/977 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 15:15:14] [INFO ] Deduced a trap composed of 16 places in 182 ms of which 3 ms to minimize.
[2024-06-01 15:15:15] [INFO ] Deduced a trap composed of 14 places in 171 ms of which 3 ms to minimize.
[2024-06-01 15:15:15] [INFO ] Deduced a trap composed of 16 places in 190 ms of which 3 ms to minimize.
[2024-06-01 15:15:15] [INFO ] Deduced a trap composed of 11 places in 177 ms of which 3 ms to minimize.
[2024-06-01 15:15:15] [INFO ] Deduced a trap composed of 11 places in 177 ms of which 4 ms to minimize.
[2024-06-01 15:15:16] [INFO ] Deduced a trap composed of 10 places in 177 ms of which 3 ms to minimize.
[2024-06-01 15:15:16] [INFO ] Deduced a trap composed of 11 places in 169 ms of which 3 ms to minimize.
[2024-06-01 15:15:16] [INFO ] Deduced a trap composed of 10 places in 175 ms of which 3 ms to minimize.
[2024-06-01 15:15:16] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 3 ms to minimize.
[2024-06-01 15:15:16] [INFO ] Deduced a trap composed of 12 places in 156 ms of which 3 ms to minimize.
[2024-06-01 15:15:17] [INFO ] Deduced a trap composed of 10 places in 163 ms of which 3 ms to minimize.
[2024-06-01 15:15:17] [INFO ] Deduced a trap composed of 12 places in 158 ms of which 3 ms to minimize.
[2024-06-01 15:15:17] [INFO ] Deduced a trap composed of 10 places in 162 ms of which 3 ms to minimize.
[2024-06-01 15:15:17] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 3 ms to minimize.
[2024-06-01 15:15:17] [INFO ] Deduced a trap composed of 11 places in 155 ms of which 2 ms to minimize.
[2024-06-01 15:15:18] [INFO ] Deduced a trap composed of 12 places in 148 ms of which 3 ms to minimize.
[2024-06-01 15:15:18] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 3 ms to minimize.
[2024-06-01 15:15:18] [INFO ] Deduced a trap composed of 12 places in 153 ms of which 3 ms to minimize.
[2024-06-01 15:15:18] [INFO ] Deduced a trap composed of 17 places in 146 ms of which 2 ms to minimize.
[2024-06-01 15:15:18] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2862 variables, 20/997 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 15:15:19] [INFO ] Deduced a trap composed of 8 places in 159 ms of which 3 ms to minimize.
[2024-06-01 15:15:19] [INFO ] Deduced a trap composed of 5 places in 160 ms of which 3 ms to minimize.
[2024-06-01 15:15:19] [INFO ] Deduced a trap composed of 10 places in 155 ms of which 3 ms to minimize.
[2024-06-01 15:15:19] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 4 ms to minimize.
[2024-06-01 15:15:19] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 3 ms to minimize.
[2024-06-01 15:15:20] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 3 ms to minimize.
[2024-06-01 15:15:20] [INFO ] Deduced a trap composed of 9 places in 151 ms of which 3 ms to minimize.
[2024-06-01 15:15:20] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 3 ms to minimize.
[2024-06-01 15:15:20] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 3 ms to minimize.
[2024-06-01 15:15:20] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 2 ms to minimize.
[2024-06-01 15:15:20] [INFO ] Deduced a trap composed of 16 places in 153 ms of which 3 ms to minimize.
[2024-06-01 15:15:21] [INFO ] Deduced a trap composed of 10 places in 155 ms of which 3 ms to minimize.
[2024-06-01 15:15:21] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 3 ms to minimize.
[2024-06-01 15:15:21] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 3 ms to minimize.
[2024-06-01 15:15:21] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 3 ms to minimize.
[2024-06-01 15:15:21] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 3 ms to minimize.
[2024-06-01 15:15:22] [INFO ] Deduced a trap composed of 8 places in 130 ms of which 3 ms to minimize.
[2024-06-01 15:15:22] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 3 ms to minimize.
[2024-06-01 15:15:22] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 3 ms to minimize.
[2024-06-01 15:15:22] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/2862 variables, 20/1017 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 15:15:22] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 2 ms to minimize.
[2024-06-01 15:15:22] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 2 ms to minimize.
[2024-06-01 15:15:23] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 2 ms to minimize.
[2024-06-01 15:15:23] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 3 ms to minimize.
[2024-06-01 15:15:23] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 2 ms to minimize.
[2024-06-01 15:15:23] [INFO ] Deduced a trap composed of 8 places in 131 ms of which 2 ms to minimize.
[2024-06-01 15:15:23] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 3 ms to minimize.
[2024-06-01 15:15:24] [INFO ] Deduced a trap composed of 16 places in 137 ms of which 3 ms to minimize.
[2024-06-01 15:15:24] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 3 ms to minimize.
[2024-06-01 15:15:24] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 3 ms to minimize.
[2024-06-01 15:15:24] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 2 ms to minimize.
[2024-06-01 15:15:24] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/2862 variables, 12/1029 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 15:15:25] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 2 ms to minimize.
[2024-06-01 15:15:25] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 2 ms to minimize.
[2024-06-01 15:15:25] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 2 ms to minimize.
[2024-06-01 15:15:25] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 2 ms to minimize.
[2024-06-01 15:15:25] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2862 variables, 5/1034 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 15:15:26] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 2 ms to minimize.
[2024-06-01 15:15:26] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/2862 variables, 2/1036 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2862 variables, 0/1036 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 40/2902 variables, 16/1052 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 15:15:27] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 2 ms to minimize.
[2024-06-01 15:15:27] [INFO ] Deduced a trap composed of 6 places in 107 ms of which 2 ms to minimize.
[2024-06-01 15:15:27] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/2902 variables, 3/1055 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 15:15:28] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 2 ms to minimize.
[2024-06-01 15:15:28] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/2902 variables, 2/1057 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2902 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 102/3004 variables, 51/1108 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 15:15:29] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 3 ms to minimize.
[2024-06-01 15:15:29] [INFO ] Deduced a trap composed of 12 places in 143 ms of which 3 ms to minimize.
[2024-06-01 15:15:29] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 2 ms to minimize.
[2024-06-01 15:15:29] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 2 ms to minimize.
[2024-06-01 15:15:29] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 3 ms to minimize.
[2024-06-01 15:15:29] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 2 ms to minimize.
[2024-06-01 15:15:30] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 3 ms to minimize.
[2024-06-01 15:15:30] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 2 ms to minimize.
[2024-06-01 15:15:30] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 2 ms to minimize.
[2024-06-01 15:15:30] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 3 ms to minimize.
[2024-06-01 15:15:30] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 2 ms to minimize.
[2024-06-01 15:15:31] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/3004 variables, 12/1120 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 15:15:31] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 2 ms to minimize.
[2024-06-01 15:15:31] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/3004 variables, 2/1122 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 15:15:32] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/3004 variables, 1/1123 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3004 variables, 0/1123 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 2614/5618 variables, 3004/4127 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/5618 variables, 3/4130 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 15:15:36] [INFO ] Deduced a trap composed of 10 places in 257 ms of which 4 ms to minimize.
[2024-06-01 15:15:36] [INFO ] Deduced a trap composed of 9 places in 281 ms of which 5 ms to minimize.
[2024-06-01 15:15:37] [INFO ] Deduced a trap composed of 8 places in 291 ms of which 5 ms to minimize.
[2024-06-01 15:15:37] [INFO ] Deduced a trap composed of 9 places in 281 ms of which 5 ms to minimize.
[2024-06-01 15:15:37] [INFO ] Deduced a trap composed of 6 places in 288 ms of which 5 ms to minimize.
[2024-06-01 15:15:38] [INFO ] Deduced a trap composed of 9 places in 262 ms of which 4 ms to minimize.
[2024-06-01 15:15:38] [INFO ] Deduced a trap composed of 9 places in 264 ms of which 5 ms to minimize.
[2024-06-01 15:15:38] [INFO ] Deduced a trap composed of 11 places in 255 ms of which 4 ms to minimize.
[2024-06-01 15:15:39] [INFO ] Deduced a trap composed of 8 places in 263 ms of which 4 ms to minimize.
[2024-06-01 15:15:39] [INFO ] Deduced a trap composed of 9 places in 256 ms of which 5 ms to minimize.
[2024-06-01 15:15:39] [INFO ] Deduced a trap composed of 8 places in 265 ms of which 5 ms to minimize.
[2024-06-01 15:15:40] [INFO ] Deduced a trap composed of 9 places in 258 ms of which 5 ms to minimize.
[2024-06-01 15:15:40] [INFO ] Deduced a trap composed of 7 places in 241 ms of which 5 ms to minimize.
[2024-06-01 15:15:41] [INFO ] Deduced a trap composed of 20 places in 232 ms of which 4 ms to minimize.
[2024-06-01 15:15:41] [INFO ] Deduced a trap composed of 9 places in 216 ms of which 4 ms to minimize.
[2024-06-01 15:15:41] [INFO ] Deduced a trap composed of 9 places in 193 ms of which 4 ms to minimize.
[2024-06-01 15:15:41] [INFO ] Deduced a trap composed of 9 places in 196 ms of which 4 ms to minimize.
[2024-06-01 15:15:42] [INFO ] Deduced a trap composed of 12 places in 196 ms of which 4 ms to minimize.
[2024-06-01 15:15:42] [INFO ] Deduced a trap composed of 14 places in 192 ms of which 4 ms to minimize.
[2024-06-01 15:15:42] [INFO ] Deduced a trap composed of 11 places in 212 ms of which 4 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/5618 variables, 20/4150 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 15:15:44] [INFO ] Deduced a trap composed of 7 places in 267 ms of which 4 ms to minimize.
[2024-06-01 15:15:45] [INFO ] Deduced a trap composed of 14 places in 254 ms of which 4 ms to minimize.
[2024-06-01 15:15:45] [INFO ] Deduced a trap composed of 9 places in 247 ms of which 4 ms to minimize.
[2024-06-01 15:15:45] [INFO ] Deduced a trap composed of 9 places in 244 ms of which 4 ms to minimize.
[2024-06-01 15:15:46] [INFO ] Deduced a trap composed of 17 places in 234 ms of which 4 ms to minimize.
[2024-06-01 15:15:46] [INFO ] Deduced a trap composed of 11 places in 229 ms of which 5 ms to minimize.
[2024-06-01 15:15:46] [INFO ] Deduced a trap composed of 9 places in 224 ms of which 4 ms to minimize.
[2024-06-01 15:15:47] [INFO ] Deduced a trap composed of 10 places in 228 ms of which 4 ms to minimize.
[2024-06-01 15:15:47] [INFO ] Deduced a trap composed of 15 places in 226 ms of which 5 ms to minimize.
[2024-06-01 15:15:47] [INFO ] Deduced a trap composed of 13 places in 213 ms of which 4 ms to minimize.
[2024-06-01 15:15:48] [INFO ] Deduced a trap composed of 11 places in 221 ms of which 4 ms to minimize.
[2024-06-01 15:15:48] [INFO ] Deduced a trap composed of 12 places in 209 ms of which 4 ms to minimize.
[2024-06-01 15:15:48] [INFO ] Deduced a trap composed of 12 places in 209 ms of which 3 ms to minimize.
[2024-06-01 15:15:49] [INFO ] Deduced a trap composed of 7 places in 208 ms of which 4 ms to minimize.
[2024-06-01 15:15:49] [INFO ] Deduced a trap composed of 7 places in 203 ms of which 4 ms to minimize.
[2024-06-01 15:15:49] [INFO ] Deduced a trap composed of 9 places in 178 ms of which 4 ms to minimize.
[2024-06-01 15:15:50] [INFO ] Deduced a trap composed of 8 places in 177 ms of which 3 ms to minimize.
SMT process timed out in 57985ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 35484 ms.
Support contains 181 out of 3274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3274/3274 places, 2774/2774 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 3274 transition count 2773
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 3273 transition count 2773
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 8 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 3269 transition count 2769
Applied a total of 10 rules in 321 ms. Remains 3269 /3274 variables (removed 5) and now considering 2769/2774 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 321 ms. Remains : 3269/3274 places, 2769/2774 transitions.
RANDOM walk for 40000 steps (8 resets) in 1254 ms. (31 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 433 ms. (92 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 405 ms. (98 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 401 ms. (99 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 515 ms. (77 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 451 ms. (88 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 411 ms. (97 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 77128 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :0 out of 6
Probabilistic random walk after 77128 steps, saw 74293 distinct states, run finished after 3004 ms. (steps per millisecond=25 ) properties seen :0
// Phase 1: matrix 2769 rows 3269 cols
[2024-06-01 15:16:30] [INFO ] Computed 1101 invariants in 71 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 2670/2851 variables, 933/933 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2851 variables, 0/933 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 40/2891 variables, 16/949 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2891 variables, 0/949 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 109/3000 variables, 55/1004 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3000 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 2610/5610 variables, 3000/4004 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5610 variables, 0/4004 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 213/5823 variables, 128/4132 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/5823 variables, 37/4169 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/5823 variables, 0/4169 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 7/5830 variables, 7/4176 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5830 variables, 7/4183 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5830 variables, 0/4183 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 10/5840 variables, 5/4188 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5840 variables, 4/4192 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5840 variables, 0/4192 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 4/5844 variables, 2/4194 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/5844 variables, 4/4198 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/5844 variables, 0/4198 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 115/5959 variables, 72/4270 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/5959 variables, 20/4290 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/5959 variables, 0/4290 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 5/5964 variables, 6/4296 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/5964 variables, 5/4301 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/5964 variables, 0/4301 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (OVERLAPS) 6/5970 variables, 3/4304 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/5970 variables, 2/4306 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/5970 variables, 0/4306 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 30 (OVERLAPS) 2/5972 variables, 1/4307 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/5972 variables, 2/4309 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/5972 variables, 0/4309 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 33 (OVERLAPS) 31/6003 variables, 24/4333 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/6003 variables, 7/4340 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/6003 variables, 0/4340 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 36 (OVERLAPS) 2/6005 variables, 1/4341 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/6005 variables, 0/4341 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 38 (OVERLAPS) 1/6006 variables, 1/4342 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/6006 variables, 1/4343 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/6006 variables, 0/4343 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 41 (OVERLAPS) 18/6024 variables, 11/4354 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/6024 variables, 3/4357 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/6024 variables, 1/4358 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/6024 variables, 0/4358 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 45 (OVERLAPS) 14/6038 variables, 9/4367 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/6038 variables, 3/4370 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/6038 variables, 0/4370 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 48 (OVERLAPS) 0/6038 variables, 0/4370 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6038/6038 variables, and 4370 constraints, problems are : Problem set: 0 solved, 6 unsolved in 11770 ms.
Refiners :[Positive P Invariants (semi-flows): 1041/1041 constraints, Generalized P Invariants (flows): 60/60 constraints, State Equation: 3269/3269 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 2670/2851 variables, 933/933 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 15:16:42] [INFO ] Deduced a trap composed of 5 places in 242 ms of which 4 ms to minimize.
[2024-06-01 15:16:42] [INFO ] Deduced a trap composed of 6 places in 238 ms of which 4 ms to minimize.
[2024-06-01 15:16:43] [INFO ] Deduced a trap composed of 6 places in 227 ms of which 5 ms to minimize.
[2024-06-01 15:16:43] [INFO ] Deduced a trap composed of 5 places in 234 ms of which 4 ms to minimize.
[2024-06-01 15:16:43] [INFO ] Deduced a trap composed of 10 places in 223 ms of which 4 ms to minimize.
[2024-06-01 15:16:43] [INFO ] Deduced a trap composed of 7 places in 232 ms of which 4 ms to minimize.
[2024-06-01 15:16:44] [INFO ] Deduced a trap composed of 8 places in 229 ms of which 4 ms to minimize.
[2024-06-01 15:16:44] [INFO ] Deduced a trap composed of 7 places in 220 ms of which 4 ms to minimize.
[2024-06-01 15:16:44] [INFO ] Deduced a trap composed of 8 places in 220 ms of which 4 ms to minimize.
[2024-06-01 15:16:44] [INFO ] Deduced a trap composed of 9 places in 210 ms of which 4 ms to minimize.
[2024-06-01 15:16:45] [INFO ] Deduced a trap composed of 8 places in 207 ms of which 4 ms to minimize.
[2024-06-01 15:16:45] [INFO ] Deduced a trap composed of 10 places in 209 ms of which 4 ms to minimize.
[2024-06-01 15:16:45] [INFO ] Deduced a trap composed of 9 places in 210 ms of which 4 ms to minimize.
[2024-06-01 15:16:45] [INFO ] Deduced a trap composed of 7 places in 214 ms of which 4 ms to minimize.
[2024-06-01 15:16:46] [INFO ] Deduced a trap composed of 10 places in 214 ms of which 4 ms to minimize.
[2024-06-01 15:16:46] [INFO ] Deduced a trap composed of 14 places in 211 ms of which 4 ms to minimize.
[2024-06-01 15:16:46] [INFO ] Deduced a trap composed of 8 places in 212 ms of which 4 ms to minimize.
[2024-06-01 15:16:47] [INFO ] Deduced a trap composed of 11 places in 198 ms of which 4 ms to minimize.
[2024-06-01 15:16:47] [INFO ] Deduced a trap composed of 11 places in 203 ms of which 4 ms to minimize.
[2024-06-01 15:16:47] [INFO ] Deduced a trap composed of 8 places in 196 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2851 variables, 20/953 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 15:16:47] [INFO ] Deduced a trap composed of 6 places in 177 ms of which 3 ms to minimize.
[2024-06-01 15:16:47] [INFO ] Deduced a trap composed of 7 places in 170 ms of which 3 ms to minimize.
[2024-06-01 15:16:48] [INFO ] Deduced a trap composed of 10 places in 182 ms of which 4 ms to minimize.
[2024-06-01 15:16:48] [INFO ] Deduced a trap composed of 11 places in 189 ms of which 4 ms to minimize.
[2024-06-01 15:16:48] [INFO ] Deduced a trap composed of 9 places in 173 ms of which 4 ms to minimize.
[2024-06-01 15:16:48] [INFO ] Deduced a trap composed of 9 places in 170 ms of which 3 ms to minimize.
[2024-06-01 15:16:49] [INFO ] Deduced a trap composed of 11 places in 176 ms of which 4 ms to minimize.
[2024-06-01 15:16:49] [INFO ] Deduced a trap composed of 11 places in 166 ms of which 3 ms to minimize.
[2024-06-01 15:16:49] [INFO ] Deduced a trap composed of 12 places in 158 ms of which 3 ms to minimize.
[2024-06-01 15:16:49] [INFO ] Deduced a trap composed of 8 places in 153 ms of which 3 ms to minimize.
[2024-06-01 15:16:49] [INFO ] Deduced a trap composed of 12 places in 170 ms of which 3 ms to minimize.
[2024-06-01 15:16:50] [INFO ] Deduced a trap composed of 10 places in 153 ms of which 3 ms to minimize.
[2024-06-01 15:16:50] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 3 ms to minimize.
[2024-06-01 15:16:50] [INFO ] Deduced a trap composed of 11 places in 164 ms of which 3 ms to minimize.
[2024-06-01 15:16:50] [INFO ] Deduced a trap composed of 12 places in 164 ms of which 3 ms to minimize.
[2024-06-01 15:16:50] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 3 ms to minimize.
[2024-06-01 15:16:51] [INFO ] Deduced a trap composed of 9 places in 148 ms of which 3 ms to minimize.
[2024-06-01 15:16:51] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 2 ms to minimize.
[2024-06-01 15:16:51] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 3 ms to minimize.
[2024-06-01 15:16:51] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2851 variables, 20/973 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 15:16:51] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 3 ms to minimize.
[2024-06-01 15:16:52] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 3 ms to minimize.
[2024-06-01 15:16:52] [INFO ] Deduced a trap composed of 12 places in 146 ms of which 3 ms to minimize.
[2024-06-01 15:16:52] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 3 ms to minimize.
[2024-06-01 15:16:52] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 2 ms to minimize.
[2024-06-01 15:16:52] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 3 ms to minimize.
[2024-06-01 15:16:52] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 3 ms to minimize.
[2024-06-01 15:16:53] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 3 ms to minimize.
[2024-06-01 15:16:53] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 3 ms to minimize.
[2024-06-01 15:16:53] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 3 ms to minimize.
[2024-06-01 15:16:53] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 3 ms to minimize.
[2024-06-01 15:16:53] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 2 ms to minimize.
[2024-06-01 15:16:53] [INFO ] Deduced a trap composed of 12 places in 127 ms of which 2 ms to minimize.
[2024-06-01 15:16:54] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 2 ms to minimize.
[2024-06-01 15:16:54] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 3 ms to minimize.
[2024-06-01 15:16:54] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 3 ms to minimize.
[2024-06-01 15:16:54] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 3 ms to minimize.
[2024-06-01 15:16:54] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 2 ms to minimize.
[2024-06-01 15:16:54] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 2 ms to minimize.
[2024-06-01 15:16:55] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2851 variables, 20/993 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 15:16:55] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 2 ms to minimize.
[2024-06-01 15:16:55] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 2 ms to minimize.
[2024-06-01 15:16:55] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 2 ms to minimize.
[2024-06-01 15:16:55] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 1 ms to minimize.
[2024-06-01 15:16:55] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 2 ms to minimize.
[2024-06-01 15:16:55] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 2 ms to minimize.
[2024-06-01 15:16:56] [INFO ] Deduced a trap composed of 6 places in 137 ms of which 3 ms to minimize.
[2024-06-01 15:16:56] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 3 ms to minimize.
[2024-06-01 15:16:56] [INFO ] Deduced a trap composed of 8 places in 126 ms of which 2 ms to minimize.
[2024-06-01 15:16:56] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 3 ms to minimize.
[2024-06-01 15:16:56] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 2 ms to minimize.
[2024-06-01 15:16:57] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 3 ms to minimize.
[2024-06-01 15:16:57] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 2 ms to minimize.
[2024-06-01 15:16:57] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 3 ms to minimize.
[2024-06-01 15:16:57] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 2 ms to minimize.
[2024-06-01 15:16:57] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 3 ms to minimize.
[2024-06-01 15:16:57] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 3 ms to minimize.
[2024-06-01 15:16:57] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 2 ms to minimize.
[2024-06-01 15:16:58] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 3 ms to minimize.
[2024-06-01 15:16:58] [INFO ] Deduced a trap composed of 18 places in 123 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/2851 variables, 20/1013 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 15:16:58] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 2 ms to minimize.
[2024-06-01 15:16:58] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 2 ms to minimize.
[2024-06-01 15:16:58] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 2 ms to minimize.
[2024-06-01 15:16:59] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 2 ms to minimize.
[2024-06-01 15:16:59] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/2851 variables, 5/1018 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 15:16:59] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 2 ms to minimize.
[2024-06-01 15:16:59] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 3 ms to minimize.
[2024-06-01 15:16:59] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 2 ms to minimize.
[2024-06-01 15:17:00] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 2 ms to minimize.
[2024-06-01 15:17:00] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 2 ms to minimize.
[2024-06-01 15:17:00] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 3 ms to minimize.
[2024-06-01 15:17:00] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 2 ms to minimize.
[2024-06-01 15:17:00] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2851 variables, 8/1026 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 15:17:00] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 3 ms to minimize.
[2024-06-01 15:17:01] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 2 ms to minimize.
[2024-06-01 15:17:01] [INFO ] Deduced a trap composed of 8 places in 126 ms of which 3 ms to minimize.
[2024-06-01 15:17:01] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 2 ms to minimize.
[2024-06-01 15:17:01] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 2 ms to minimize.
[2024-06-01 15:17:01] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 3 ms to minimize.
[2024-06-01 15:17:02] [INFO ] Deduced a trap composed of 8 places in 125 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/2851 variables, 7/1033 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 15:17:02] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/2851 variables, 1/1034 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 15:17:02] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 2 ms to minimize.
[2024-06-01 15:17:03] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 2 ms to minimize.
[2024-06-01 15:17:03] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/2851 variables, 3/1037 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 15:17:03] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 2 ms to minimize.
[2024-06-01 15:17:03] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/2851 variables, 2/1039 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2851 variables, 0/1039 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 40/2891 variables, 16/1055 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 15:17:04] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 2 ms to minimize.
[2024-06-01 15:17:04] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 2 ms to minimize.
[2024-06-01 15:17:05] [INFO ] Deduced a trap composed of 6 places in 110 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/2891 variables, 3/1058 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 15:17:05] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 2 ms to minimize.
[2024-06-01 15:17:05] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 2 ms to minimize.
[2024-06-01 15:17:05] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 2 ms to minimize.
[2024-06-01 15:17:05] [INFO ] Deduced a trap composed of 6 places in 112 ms of which 3 ms to minimize.
[2024-06-01 15:17:06] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/2891 variables, 5/1063 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 15:17:06] [INFO ] Deduced a trap composed of 12 places in 127 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/2891 variables, 1/1064 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2891 variables, 0/1064 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 109/3000 variables, 55/1119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 15:17:07] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 2 ms to minimize.
[2024-06-01 15:17:07] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 2 ms to minimize.
[2024-06-01 15:17:07] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 2 ms to minimize.
[2024-06-01 15:17:07] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 2 ms to minimize.
[2024-06-01 15:17:08] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 2 ms to minimize.
[2024-06-01 15:17:08] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 2 ms to minimize.
[2024-06-01 15:17:08] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 2 ms to minimize.
[2024-06-01 15:17:08] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 2 ms to minimize.
[2024-06-01 15:17:08] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 2 ms to minimize.
[2024-06-01 15:17:08] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 2 ms to minimize.
[2024-06-01 15:17:08] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 2 ms to minimize.
[2024-06-01 15:17:09] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 2 ms to minimize.
[2024-06-01 15:17:09] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 2 ms to minimize.
[2024-06-01 15:17:09] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 2 ms to minimize.
[2024-06-01 15:17:09] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/3000 variables, 15/1134 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 15:17:10] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 2 ms to minimize.
[2024-06-01 15:17:10] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 3 ms to minimize.
[2024-06-01 15:17:10] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 3 ms to minimize.
[2024-06-01 15:17:10] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 3 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/3000 variables, 4/1138 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 15:17:11] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 3 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/3000 variables, 1/1139 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3000 variables, 0/1139 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 2610/5610 variables, 3000/4139 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/5610 variables, 3/4142 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 15:17:14] [INFO ] Deduced a trap composed of 15 places in 383 ms of which 7 ms to minimize.
[2024-06-01 15:17:15] [INFO ] Deduced a trap composed of 8 places in 381 ms of which 6 ms to minimize.
[2024-06-01 15:17:15] [INFO ] Deduced a trap composed of 7 places in 364 ms of which 6 ms to minimize.
[2024-06-01 15:17:16] [INFO ] Deduced a trap composed of 7 places in 358 ms of which 7 ms to minimize.
[2024-06-01 15:17:16] [INFO ] Deduced a trap composed of 11 places in 350 ms of which 6 ms to minimize.
[2024-06-01 15:17:17] [INFO ] Deduced a trap composed of 7 places in 350 ms of which 6 ms to minimize.
[2024-06-01 15:17:17] [INFO ] Deduced a trap composed of 7 places in 345 ms of which 6 ms to minimize.
[2024-06-01 15:17:18] [INFO ] Deduced a trap composed of 9 places in 333 ms of which 5 ms to minimize.
[2024-06-01 15:17:18] [INFO ] Deduced a trap composed of 9 places in 312 ms of which 6 ms to minimize.
[2024-06-01 15:17:19] [INFO ] Deduced a trap composed of 6 places in 325 ms of which 5 ms to minimize.
[2024-06-01 15:17:19] [INFO ] Deduced a trap composed of 7 places in 320 ms of which 6 ms to minimize.
[2024-06-01 15:17:19] [INFO ] Deduced a trap composed of 9 places in 303 ms of which 5 ms to minimize.
[2024-06-01 15:17:20] [INFO ] Deduced a trap composed of 9 places in 313 ms of which 5 ms to minimize.
[2024-06-01 15:17:20] [INFO ] Deduced a trap composed of 8 places in 330 ms of which 5 ms to minimize.
[2024-06-01 15:17:21] [INFO ] Deduced a trap composed of 9 places in 334 ms of which 5 ms to minimize.
[2024-06-01 15:17:21] [INFO ] Deduced a trap composed of 9 places in 296 ms of which 5 ms to minimize.
[2024-06-01 15:17:22] [INFO ] Deduced a trap composed of 11 places in 303 ms of which 5 ms to minimize.
[2024-06-01 15:17:22] [INFO ] Deduced a trap composed of 9 places in 290 ms of which 5 ms to minimize.
[2024-06-01 15:17:22] [INFO ] Deduced a trap composed of 11 places in 286 ms of which 4 ms to minimize.
[2024-06-01 15:17:23] [INFO ] Deduced a trap composed of 9 places in 283 ms of which 5 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/5610 variables, 20/4162 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 15:17:24] [INFO ] Deduced a trap composed of 12 places in 213 ms of which 3 ms to minimize.
[2024-06-01 15:17:25] [INFO ] Deduced a trap composed of 10 places in 196 ms of which 4 ms to minimize.
[2024-06-01 15:17:25] [INFO ] Deduced a trap composed of 10 places in 208 ms of which 4 ms to minimize.
[2024-06-01 15:17:25] [INFO ] Deduced a trap composed of 10 places in 190 ms of which 4 ms to minimize.
[2024-06-01 15:17:26] [INFO ] Deduced a trap composed of 9 places in 183 ms of which 4 ms to minimize.
[2024-06-01 15:17:26] [INFO ] Deduced a trap composed of 15 places in 187 ms of which 3 ms to minimize.
[2024-06-01 15:17:26] [INFO ] Deduced a trap composed of 11 places in 173 ms of which 4 ms to minimize.
[2024-06-01 15:17:26] [INFO ] Deduced a trap composed of 11 places in 161 ms of which 3 ms to minimize.
[2024-06-01 15:17:27] [INFO ] Deduced a trap composed of 9 places in 158 ms of which 3 ms to minimize.
[2024-06-01 15:17:27] [INFO ] Deduced a trap composed of 11 places in 169 ms of which 3 ms to minimize.
[2024-06-01 15:17:27] [INFO ] Deduced a trap composed of 10 places in 163 ms of which 3 ms to minimize.
[2024-06-01 15:17:28] [INFO ] Deduced a trap composed of 12 places in 158 ms of which 3 ms to minimize.
[2024-06-01 15:17:28] [INFO ] Deduced a trap composed of 12 places in 176 ms of which 3 ms to minimize.
[2024-06-01 15:17:28] [INFO ] Deduced a trap composed of 11 places in 168 ms of which 3 ms to minimize.
[2024-06-01 15:17:28] [INFO ] Deduced a trap composed of 11 places in 161 ms of which 3 ms to minimize.
[2024-06-01 15:17:29] [INFO ] Deduced a trap composed of 10 places in 165 ms of which 3 ms to minimize.
[2024-06-01 15:17:29] [INFO ] Deduced a trap composed of 11 places in 160 ms of which 3 ms to minimize.
[2024-06-01 15:17:29] [INFO ] Deduced a trap composed of 9 places in 156 ms of which 3 ms to minimize.
[2024-06-01 15:17:29] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 3 ms to minimize.
[2024-06-01 15:17:30] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 2 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/5610 variables, 20/4182 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 15:17:31] [INFO ] Deduced a trap composed of 11 places in 217 ms of which 4 ms to minimize.
[2024-06-01 15:17:31] [INFO ] Deduced a trap composed of 10 places in 219 ms of which 4 ms to minimize.
[2024-06-01 15:17:31] [INFO ] Deduced a trap composed of 9 places in 200 ms of which 4 ms to minimize.
[2024-06-01 15:17:32] [INFO ] Deduced a trap composed of 7 places in 202 ms of which 3 ms to minimize.
[2024-06-01 15:17:32] [INFO ] Deduced a trap composed of 8 places in 196 ms of which 4 ms to minimize.
[2024-06-01 15:17:32] [INFO ] Deduced a trap composed of 9 places in 183 ms of which 3 ms to minimize.
[2024-06-01 15:17:33] [INFO ] Deduced a trap composed of 11 places in 194 ms of which 3 ms to minimize.
[2024-06-01 15:17:33] [INFO ] Deduced a trap composed of 12 places in 172 ms of which 3 ms to minimize.
[2024-06-01 15:17:33] [INFO ] Deduced a trap composed of 12 places in 179 ms of which 3 ms to minimize.
[2024-06-01 15:17:33] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 4 ms to minimize.
[2024-06-01 15:17:34] [INFO ] Deduced a trap composed of 12 places in 158 ms of which 3 ms to minimize.
[2024-06-01 15:17:34] [INFO ] Deduced a trap composed of 10 places in 157 ms of which 3 ms to minimize.
[2024-06-01 15:17:34] [INFO ] Deduced a trap composed of 6 places in 164 ms of which 3 ms to minimize.
[2024-06-01 15:17:35] [INFO ] Deduced a trap composed of 14 places in 149 ms of which 3 ms to minimize.
[2024-06-01 15:17:35] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 3 ms to minimize.
[2024-06-01 15:17:35] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 3 ms to minimize.
[2024-06-01 15:17:35] [INFO ] Deduced a trap composed of 17 places in 146 ms of which 3 ms to minimize.
[2024-06-01 15:17:36] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 2 ms to minimize.
[2024-06-01 15:17:36] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 3 ms to minimize.
[2024-06-01 15:17:36] [INFO ] Deduced a trap composed of 13 places in 150 ms of which 3 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/5610 variables, 20/4202 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 15:17:37] [INFO ] Deduced a trap composed of 13 places in 199 ms of which 4 ms to minimize.
[2024-06-01 15:17:38] [INFO ] Deduced a trap composed of 9 places in 194 ms of which 4 ms to minimize.
[2024-06-01 15:17:38] [INFO ] Deduced a trap composed of 9 places in 181 ms of which 3 ms to minimize.
[2024-06-01 15:17:38] [INFO ] Deduced a trap composed of 9 places in 174 ms of which 3 ms to minimize.
[2024-06-01 15:17:39] [INFO ] Deduced a trap composed of 12 places in 170 ms of which 3 ms to minimize.
[2024-06-01 15:17:39] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 3 ms to minimize.
[2024-06-01 15:17:39] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 3 ms to minimize.
[2024-06-01 15:17:39] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 2 ms to minimize.
[2024-06-01 15:17:40] [INFO ] Deduced a trap composed of 17 places in 151 ms of which 3 ms to minimize.
[2024-06-01 15:17:40] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 3 ms to minimize.
[2024-06-01 15:17:40] [INFO ] Deduced a trap composed of 14 places in 153 ms of which 3 ms to minimize.
[2024-06-01 15:17:40] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 3 ms to minimize.
[2024-06-01 15:17:41] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 3 ms to minimize.
[2024-06-01 15:17:41] [INFO ] Deduced a trap composed of 12 places in 154 ms of which 3 ms to minimize.
[2024-06-01 15:17:41] [INFO ] Deduced a trap composed of 8 places in 150 ms of which 3 ms to minimize.
[2024-06-01 15:17:42] [INFO ] Deduced a trap composed of 14 places in 148 ms of which 3 ms to minimize.
[2024-06-01 15:17:42] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 3 ms to minimize.
[2024-06-01 15:17:42] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 3 ms to minimize.
[2024-06-01 15:17:42] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 3 ms to minimize.
[2024-06-01 15:17:43] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 3 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/5610 variables, 20/4222 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 15:17:44] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 2 ms to minimize.
[2024-06-01 15:17:44] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 3 ms to minimize.
[2024-06-01 15:17:44] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 3 ms to minimize.
[2024-06-01 15:17:44] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 2 ms to minimize.
[2024-06-01 15:17:45] [INFO ] Deduced a trap composed of 21 places in 145 ms of which 2 ms to minimize.
[2024-06-01 15:17:45] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 3 ms to minimize.
[2024-06-01 15:17:46] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 2 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/5610 variables, 7/4229 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 15:17:47] [INFO ] Deduced a trap composed of 17 places in 162 ms of which 3 ms to minimize.
[2024-06-01 15:17:47] [INFO ] Deduced a trap composed of 24 places in 140 ms of which 2 ms to minimize.
[2024-06-01 15:17:48] [INFO ] Deduced a trap composed of 11 places in 155 ms of which 2 ms to minimize.
[2024-06-01 15:17:48] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 3 ms to minimize.
[2024-06-01 15:17:48] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 3 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/5610 variables, 5/4234 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 15:17:50] [INFO ] Deduced a trap composed of 17 places in 152 ms of which 3 ms to minimize.
[2024-06-01 15:17:50] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 3 ms to minimize.
[2024-06-01 15:17:51] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 3 ms to minimize.
[2024-06-01 15:17:51] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 2 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/5610 variables, 4/4238 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 15:17:52] [INFO ] Deduced a trap composed of 13 places in 139 ms of which 2 ms to minimize.
[2024-06-01 15:17:52] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 3 ms to minimize.
[2024-06-01 15:17:53] [INFO ] Deduced a trap composed of 17 places in 136 ms of which 3 ms to minimize.
At refinement iteration 32 (INCLUDED_ONLY) 0/5610 variables, 3/4241 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 15:17:54] [INFO ] Deduced a trap composed of 17 places in 141 ms of which 2 ms to minimize.
[2024-06-01 15:17:55] [INFO ] Deduced a trap composed of 17 places in 170 ms of which 3 ms to minimize.
[2024-06-01 15:17:55] [INFO ] Deduced a trap composed of 20 places in 146 ms of which 3 ms to minimize.
At refinement iteration 33 (INCLUDED_ONLY) 0/5610 variables, 3/4244 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 15:17:56] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 2 ms to minimize.
[2024-06-01 15:17:56] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5610/6038 variables, and 4246 constraints, problems are : Problem set: 0 solved, 6 unsolved in 75018 ms.
Refiners :[Positive P Invariants (semi-flows): 949/1041 constraints, Generalized P Invariants (flows): 55/60 constraints, State Equation: 3000/3269 constraints, PredecessorRefiner: 3/6 constraints, Known Traps: 239/239 constraints]
After SMT, in 86920ms problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 181 out of 3269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3269/3269 places, 2769/2769 transitions.
Applied a total of 0 rules in 149 ms. Remains 3269 /3269 variables (removed 0) and now considering 2769/2769 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 149 ms. Remains : 3269/3269 places, 2769/2769 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3269/3269 places, 2769/2769 transitions.
Applied a total of 0 rules in 156 ms. Remains 3269 /3269 variables (removed 0) and now considering 2769/2769 (removed 0) transitions.
[2024-06-01 15:17:57] [INFO ] Invariant cache hit.
[2024-06-01 15:17:59] [INFO ] Implicit Places using invariants in 2034 ms returned []
[2024-06-01 15:17:59] [INFO ] Invariant cache hit.
[2024-06-01 15:18:04] [INFO ] Implicit Places using invariants and state equation in 4893 ms returned []
Implicit Place search using SMT with State Equation took 6940 ms to find 0 implicit places.
[2024-06-01 15:18:04] [INFO ] Redundant transitions in 175 ms returned []
Running 2758 sub problems to find dead transitions.
[2024-06-01 15:18:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3260 variables, 109/109 constraints. Problems are: Problem set: 0 solved, 2758 unsolved
SMT process timed out in 31241ms, After SMT, problems are : Problem set: 0 solved, 2758 unsolved
Search for dead transitions found 0 dead transitions in 31269ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38567 ms. Remains : 3269/3269 places, 2769/2769 transitions.
[2024-06-01 15:18:35] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 10 ms.
[2024-06-01 15:18:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3269 places, 2769 transitions and 12449 arcs took 18 ms.
[2024-06-01 15:18:36] [INFO ] Flatten gal took : 285 ms
Total runtime 235862 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : ShieldPPPs-PT-100B-ReachabilityFireability-2024-00
Could not compute solution for formula : ShieldPPPs-PT-100B-ReachabilityFireability-2024-06
Could not compute solution for formula : ShieldPPPs-PT-100B-ReachabilityFireability-2024-08
Could not compute solution for formula : ShieldPPPs-PT-100B-ReachabilityFireability-2024-09
Could not compute solution for formula : ShieldPPPs-PT-100B-ReachabilityFireability-2024-10
Could not compute solution for formula : ShieldPPPs-PT-100B-ReachabilityFireability-2024-12

BK_STOP 1717255116435

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name ShieldPPPs-PT-100B-ReachabilityFireability-2024-00
rfs formula type EF
rfs formula formula --invariant=/tmp/1726/inv_0_
rfs formula name ShieldPPPs-PT-100B-ReachabilityFireability-2024-06
rfs formula type AG
rfs formula formula --invariant=/tmp/1726/inv_1_
rfs formula name ShieldPPPs-PT-100B-ReachabilityFireability-2024-08
rfs formula type AG
rfs formula formula --invariant=/tmp/1726/inv_2_
rfs formula name ShieldPPPs-PT-100B-ReachabilityFireability-2024-09
rfs formula type EF
rfs formula formula --invariant=/tmp/1726/inv_3_
rfs formula name ShieldPPPs-PT-100B-ReachabilityFireability-2024-10
rfs formula type EF
rfs formula formula --invariant=/tmp/1726/inv_4_
rfs formula name ShieldPPPs-PT-100B-ReachabilityFireability-2024-12
rfs formula type AG
rfs formula formula --invariant=/tmp/1726/inv_5_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPs-PT-100B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is ShieldPPPs-PT-100B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r528-tall-171683761300527"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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