MCC'2024- Execution of r528-tall-171683760500159

About the Execution of LTSMin+red for ShieldIIPs-PT-050B

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
865.968	221628.00	298052.00	437.10	?TTT???TT???TFTT	normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r528-tall-171683760500159.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 ShieldIIPs-PT-050B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683760500159
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K 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.5K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 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 846K 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 ShieldIIPs-PT-050B-ReachabilityFireability-2024-00
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-2024-01
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-2024-02
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-2024-03
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-2023-04
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-2023-05
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-2024-06
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-2024-07
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-2024-08
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-2024-09
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-2024-10
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-2024-11
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-2024-12
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-2024-13
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-2024-14
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717232353163

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-050B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 08:59:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 08:59:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 08:59:14] [INFO ] Load time of PNML (sax parser for PT used): 194 ms
[2024-06-01 08:59:14] [INFO ] Transformed 3003 places.
[2024-06-01 08:59:14] [INFO ] Transformed 2953 transitions.
[2024-06-01 08:59:14] [INFO ] Found NUPN structural information;
[2024-06-01 08:59:14] [INFO ] Parsed PT model containing 3003 places and 2953 transitions and 8906 arcs in 416 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 2570 ms. (15 steps per ms) remains 10/16 properties
FORMULA ShieldIIPs-PT-050B-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 315 ms. (126 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 125 ms. (317 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 173 ms. (229 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 411 ms. (97 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 491 ms. (81 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 10/10 properties
// Phase 1: matrix 2953 rows 3003 cols
[2024-06-01 08:59:16] [INFO ] Computed 451 invariants in 39 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 219/219 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/219 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 1666/1885 variables, 242/461 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1885 variables, 1666/2127 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1885 variables, 0/2127 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 1118/3003 variables, 209/2336 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3003 variables, 1118/3454 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3003 variables, 0/3454 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 2953/5956 variables, 3003/6457 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5956 variables, 0/6457 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 0/5956 variables, 0/6457 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5956/5956 variables, and 6457 constraints, problems are : Problem set: 0 solved, 10 unsolved in 4602 ms.
Refiners :[Domain max(s): 3003/3003 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 3003/3003 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 219/219 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/219 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 1666/1885 variables, 242/461 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1885 variables, 1666/2127 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-01 08:59:22] [INFO ] Deduced a trap composed of 30 places in 325 ms of which 37 ms to minimize.
[2024-06-01 08:59:22] [INFO ] Deduced a trap composed of 21 places in 222 ms of which 7 ms to minimize.
[2024-06-01 08:59:22] [INFO ] Deduced a trap composed of 32 places in 196 ms of which 4 ms to minimize.
[2024-06-01 08:59:22] [INFO ] Deduced a trap composed of 42 places in 182 ms of which 4 ms to minimize.
[2024-06-01 08:59:23] [INFO ] Deduced a trap composed of 28 places in 159 ms of which 3 ms to minimize.
[2024-06-01 08:59:23] [INFO ] Deduced a trap composed of 36 places in 206 ms of which 4 ms to minimize.
[2024-06-01 08:59:23] [INFO ] Deduced a trap composed of 43 places in 174 ms of which 4 ms to minimize.
[2024-06-01 08:59:23] [INFO ] Deduced a trap composed of 37 places in 159 ms of which 3 ms to minimize.
[2024-06-01 08:59:23] [INFO ] Deduced a trap composed of 33 places in 186 ms of which 3 ms to minimize.
[2024-06-01 08:59:24] [INFO ] Deduced a trap composed of 42 places in 178 ms of which 3 ms to minimize.
[2024-06-01 08:59:24] [INFO ] Deduced a trap composed of 48 places in 149 ms of which 3 ms to minimize.
[2024-06-01 08:59:24] [INFO ] Deduced a trap composed of 26 places in 148 ms of which 3 ms to minimize.
[2024-06-01 08:59:24] [INFO ] Deduced a trap composed of 42 places in 132 ms of which 2 ms to minimize.
[2024-06-01 08:59:24] [INFO ] Deduced a trap composed of 37 places in 134 ms of which 3 ms to minimize.
[2024-06-01 08:59:24] [INFO ] Deduced a trap composed of 48 places in 133 ms of which 3 ms to minimize.
[2024-06-01 08:59:25] [INFO ] Deduced a trap composed of 43 places in 132 ms of which 2 ms to minimize.
[2024-06-01 08:59:25] [INFO ] Deduced a trap composed of 50 places in 128 ms of which 2 ms to minimize.
[2024-06-01 08:59:25] [INFO ] Deduced a trap composed of 57 places in 117 ms of which 3 ms to minimize.
[2024-06-01 08:59:25] [INFO ] Deduced a trap composed of 63 places in 112 ms of which 3 ms to minimize.
[2024-06-01 08:59:25] [INFO ] Deduced a trap composed of 57 places in 112 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1885 variables, 20/2147 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-01 08:59:25] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 3 ms to minimize.
[2024-06-01 08:59:26] [INFO ] Deduced a trap composed of 40 places in 133 ms of which 3 ms to minimize.
[2024-06-01 08:59:26] [INFO ] Deduced a trap composed of 35 places in 149 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1885/5956 variables, and 2150 constraints, problems are : Problem set: 0 solved, 10 unsolved in 5007 ms.
Refiners :[Domain max(s): 1885/3003 constraints, Positive P Invariants (semi-flows): 242/451 constraints, State Equation: 0/3003 constraints, PredecessorRefiner: 0/10 constraints, Known Traps: 23/23 constraints]
After SMT, in 9814ms problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 219 out of 3003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3003/3003 places, 2953/2953 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 202 transitions
Trivial Post-agglo rules discarded 202 transitions
Performed 202 trivial Post agglomeration. Transition count delta: 202
Iterating post reduction 0 with 202 rules applied. Total rules applied 202 place count 3003 transition count 2751
Reduce places removed 202 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 1 with 216 rules applied. Total rules applied 418 place count 2801 transition count 2737
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 432 place count 2787 transition count 2737
Performed 237 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 237 Pre rules applied. Total rules applied 432 place count 2787 transition count 2500
Deduced a syphon composed of 237 places in 7 ms
Reduce places removed 237 places and 0 transitions.
Iterating global reduction 3 with 474 rules applied. Total rules applied 906 place count 2550 transition count 2500
Discarding 298 places :
Symmetric choice reduction at 3 with 298 rule applications. Total rules 1204 place count 2252 transition count 2202
Iterating global reduction 3 with 298 rules applied. Total rules applied 1502 place count 2252 transition count 2202
Performed 92 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 92 Pre rules applied. Total rules applied 1502 place count 2252 transition count 2110
Deduced a syphon composed of 92 places in 7 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 3 with 184 rules applied. Total rules applied 1686 place count 2160 transition count 2110
Performed 697 Post agglomeration using F-continuation condition.Transition count delta: 697
Deduced a syphon composed of 697 places in 5 ms
Reduce places removed 697 places and 0 transitions.
Iterating global reduction 3 with 1394 rules applied. Total rules applied 3080 place count 1463 transition count 1413
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 294 times.
Drop transitions (Partial Free agglomeration) removed 294 transitions
Iterating global reduction 3 with 294 rules applied. Total rules applied 3374 place count 1463 transition count 1413
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3375 place count 1462 transition count 1412
Applied a total of 3375 rules in 944 ms. Remains 1462 /3003 variables (removed 1541) and now considering 1412/2953 (removed 1541) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 954 ms. Remains : 1462/3003 places, 1412/2953 transitions.
RANDOM walk for 40000 steps (8 resets) in 1091 ms. (36 steps per ms) remains 7/10 properties
FORMULA ShieldIIPs-PT-050B-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 390 ms. (102 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 242 ms. (164 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 263 ms. (151 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 205 ms. (194 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 201 ms. (198 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 205 ms. (194 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 252 ms. (158 steps per ms) remains 7/7 properties
// Phase 1: matrix 1412 rows 1462 cols
[2024-06-01 08:59:28] [INFO ] Computed 451 invariants in 37 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 655/860 variables, 224/224 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/860 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 421/1281 variables, 157/381 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1281 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 24/1305 variables, 12/393 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1305 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1324/2629 variables, 1305/1698 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2629 variables, 0/1698 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 148/2777 variables, 91/1789 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2777 variables, 29/1818 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2777 variables, 0/1818 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 6/2783 variables, 5/1823 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2783 variables, 4/1827 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2783 variables, 0/1827 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 6/2789 variables, 3/1830 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2789 variables, 4/1834 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2789 variables, 0/1834 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 2/2791 variables, 1/1835 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2791 variables, 2/1837 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2791 variables, 0/1837 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (OVERLAPS) 56/2847 variables, 36/1873 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2847 variables, 10/1883 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2847 variables, 1/1884 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2847 variables, 0/1884 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (OVERLAPS) 1/2848 variables, 1/1885 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2848 variables, 1/1886 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2848 variables, 0/1886 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 28 (OVERLAPS) 20/2868 variables, 14/1900 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2868 variables, 4/1904 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2868 variables, 0/1904 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 31 (OVERLAPS) 1/2869 variables, 2/1906 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2869 variables, 1/1907 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/2869 variables, 0/1907 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 34 (OVERLAPS) 5/2874 variables, 4/1911 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/2874 variables, 2/1913 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2874 variables, 0/1913 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 37 (OVERLAPS) 0/2874 variables, 0/1913 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2874/2874 variables, and 1913 constraints, problems are : Problem set: 0 solved, 7 unsolved in 4840 ms.
Refiners :[Positive P Invariants (semi-flows): 437/437 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 1462/1462 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 655/860 variables, 224/224 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 08:59:33] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 2 ms to minimize.
[2024-06-01 08:59:33] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 1 ms to minimize.
[2024-06-01 08:59:33] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2024-06-01 08:59:33] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 1 ms to minimize.
[2024-06-01 08:59:33] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 1 ms to minimize.
[2024-06-01 08:59:33] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 1 ms to minimize.
[2024-06-01 08:59:33] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-06-01 08:59:33] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2024-06-01 08:59:33] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 2 ms to minimize.
[2024-06-01 08:59:34] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 1 ms to minimize.
[2024-06-01 08:59:34] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 3 ms to minimize.
[2024-06-01 08:59:34] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2024-06-01 08:59:34] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 2 ms to minimize.
[2024-06-01 08:59:34] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-06-01 08:59:34] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2024-06-01 08:59:34] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 1 ms to minimize.
[2024-06-01 08:59:34] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 3 ms to minimize.
[2024-06-01 08:59:34] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-06-01 08:59:34] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-06-01 08:59:34] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/860 variables, 20/244 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 08:59:34] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-06-01 08:59:34] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-06-01 08:59:35] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 4 ms to minimize.
[2024-06-01 08:59:35] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-06-01 08:59:35] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2024-06-01 08:59:35] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2024-06-01 08:59:35] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-06-01 08:59:35] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 2 ms to minimize.
[2024-06-01 08:59:35] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-06-01 08:59:35] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-06-01 08:59:35] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-06-01 08:59:35] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/860 variables, 12/256 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 08:59:35] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-06-01 08:59:35] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 1 ms to minimize.
[2024-06-01 08:59:36] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/860 variables, 3/259 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/860 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 421/1281 variables, 157/416 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 08:59:36] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 3 ms to minimize.
[2024-06-01 08:59:36] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 2 ms to minimize.
[2024-06-01 08:59:36] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 2 ms to minimize.
[2024-06-01 08:59:36] [INFO ] Deduced a trap composed of 8 places in 115 ms of which 2 ms to minimize.
[2024-06-01 08:59:37] [INFO ] Deduced a trap composed of 6 places in 99 ms of which 2 ms to minimize.
[2024-06-01 08:59:37] [INFO ] Deduced a trap composed of 6 places in 105 ms of which 2 ms to minimize.
[2024-06-01 08:59:37] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 2 ms to minimize.
[2024-06-01 08:59:37] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 2 ms to minimize.
[2024-06-01 08:59:37] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 2 ms to minimize.
[2024-06-01 08:59:37] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 2 ms to minimize.
[2024-06-01 08:59:37] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 3 ms to minimize.
[2024-06-01 08:59:37] [INFO ] Deduced a trap composed of 5 places in 131 ms of which 3 ms to minimize.
[2024-06-01 08:59:38] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 2 ms to minimize.
[2024-06-01 08:59:38] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 2 ms to minimize.
[2024-06-01 08:59:38] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 2 ms to minimize.
[2024-06-01 08:59:38] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 2 ms to minimize.
[2024-06-01 08:59:38] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 2 ms to minimize.
[2024-06-01 08:59:38] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 3 ms to minimize.
[2024-06-01 08:59:38] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 1 ms to minimize.
[2024-06-01 08:59:38] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1281 variables, 20/436 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 08:59:38] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
[2024-06-01 08:59:39] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 1 ms to minimize.
[2024-06-01 08:59:39] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 2 ms to minimize.
[2024-06-01 08:59:39] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 2 ms to minimize.
[2024-06-01 08:59:39] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2024-06-01 08:59:39] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 2 ms to minimize.
[2024-06-01 08:59:39] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-06-01 08:59:39] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-06-01 08:59:39] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-06-01 08:59:39] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
[2024-06-01 08:59:39] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
[2024-06-01 08:59:39] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1281 variables, 12/448 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 08:59:40] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 2 ms to minimize.
[2024-06-01 08:59:40] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2024-06-01 08:59:40] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1281 variables, 3/451 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 08:59:40] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 2 ms to minimize.
[2024-06-01 08:59:40] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-06-01 08:59:40] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1281 variables, 3/454 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 08:59:41] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 1 ms to minimize.
[2024-06-01 08:59:41] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1281 variables, 2/456 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1281 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 24/1305 variables, 12/468 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 08:59:41] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2024-06-01 08:59:41] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 1 ms to minimize.
[2024-06-01 08:59:41] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1305 variables, 3/471 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1305 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 1324/2629 variables, 1305/1776 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2629 variables, 2/1778 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 08:59:43] [INFO ] Deduced a trap composed of 8 places in 126 ms of which 3 ms to minimize.
[2024-06-01 08:59:43] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 2 ms to minimize.
[2024-06-01 08:59:43] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 2 ms to minimize.
[2024-06-01 08:59:43] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 2 ms to minimize.
[2024-06-01 08:59:43] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 2 ms to minimize.
[2024-06-01 08:59:43] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 2 ms to minimize.
[2024-06-01 08:59:44] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 2 ms to minimize.
[2024-06-01 08:59:44] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 2 ms to minimize.
[2024-06-01 08:59:44] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 1 ms to minimize.
[2024-06-01 08:59:44] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 2 ms to minimize.
[2024-06-01 08:59:44] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 2 ms to minimize.
[2024-06-01 08:59:44] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 2 ms to minimize.
[2024-06-01 08:59:45] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 2 ms to minimize.
[2024-06-01 08:59:45] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 2 ms to minimize.
[2024-06-01 08:59:45] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 1 ms to minimize.
[2024-06-01 08:59:45] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 2 ms to minimize.
[2024-06-01 08:59:45] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 2 ms to minimize.
[2024-06-01 08:59:45] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 1 ms to minimize.
[2024-06-01 08:59:45] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-06-01 08:59:45] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/2629 variables, 20/1798 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 08:59:47] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 2 ms to minimize.
[2024-06-01 08:59:47] [INFO ] Deduced a trap composed of 6 places in 107 ms of which 2 ms to minimize.
[2024-06-01 08:59:47] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 2 ms to minimize.
[2024-06-01 08:59:47] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 2 ms to minimize.
[2024-06-01 08:59:47] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 2 ms to minimize.
[2024-06-01 08:59:47] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 2 ms to minimize.
[2024-06-01 08:59:48] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 2 ms to minimize.
[2024-06-01 08:59:48] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 2 ms to minimize.
[2024-06-01 08:59:48] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 2 ms to minimize.
[2024-06-01 08:59:48] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 2 ms to minimize.
[2024-06-01 08:59:48] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 2 ms to minimize.
[2024-06-01 08:59:48] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 2 ms to minimize.
[2024-06-01 08:59:48] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 2 ms to minimize.
[2024-06-01 08:59:49] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2024-06-01 08:59:49] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 2 ms to minimize.
[2024-06-01 08:59:49] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 2 ms to minimize.
[2024-06-01 08:59:49] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 2 ms to minimize.
[2024-06-01 08:59:49] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 2 ms to minimize.
[2024-06-01 08:59:49] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 2 ms to minimize.
[2024-06-01 08:59:49] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/2629 variables, 20/1818 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 08:59:50] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 3 ms to minimize.
[2024-06-01 08:59:50] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 2 ms to minimize.
[2024-06-01 08:59:50] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 1 ms to minimize.
[2024-06-01 08:59:51] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 2 ms to minimize.
[2024-06-01 08:59:51] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 1 ms to minimize.
[2024-06-01 08:59:51] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
[2024-06-01 08:59:51] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 1 ms to minimize.
[2024-06-01 08:59:51] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 2 ms to minimize.
[2024-06-01 08:59:52] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/2629 variables, 9/1827 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 08:59:52] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 2 ms to minimize.
[2024-06-01 08:59:52] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/2629 variables, 2/1829 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 08:59:53] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 1 ms to minimize.
[2024-06-01 08:59:53] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 2 ms to minimize.
[2024-06-01 08:59:54] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/2629 variables, 3/1832 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2629 variables, 0/1832 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (OVERLAPS) 148/2777 variables, 91/1923 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2777 variables, 29/1952 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2777 variables, 5/1957 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 08:59:56] [INFO ] Deduced a trap composed of 5 places in 125 ms of which 2 ms to minimize.
[2024-06-01 08:59:56] [INFO ] Deduced a trap composed of 5 places in 125 ms of which 3 ms to minimize.
[2024-06-01 08:59:57] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 3 ms to minimize.
[2024-06-01 08:59:57] [INFO ] Deduced a trap composed of 6 places in 120 ms of which 2 ms to minimize.
[2024-06-01 08:59:57] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 2 ms to minimize.
[2024-06-01 08:59:57] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 2 ms to minimize.
[2024-06-01 08:59:57] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 2 ms to minimize.
[2024-06-01 08:59:57] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 1 ms to minimize.
[2024-06-01 08:59:58] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 2 ms to minimize.
[2024-06-01 08:59:58] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 2 ms to minimize.
[2024-06-01 08:59:58] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 1 ms to minimize.
[2024-06-01 08:59:58] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 2 ms to minimize.
[2024-06-01 08:59:58] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 1 ms to minimize.
[2024-06-01 08:59:58] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2024-06-01 08:59:59] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 2 ms to minimize.
[2024-06-01 08:59:59] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 2 ms to minimize.
[2024-06-01 08:59:59] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2024-06-01 08:59:59] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 2 ms to minimize.
[2024-06-01 09:00:00] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 1 ms to minimize.
[2024-06-01 09:00:00] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 2 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/2777 variables, 20/1977 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 09:00:01] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 1 ms to minimize.
[2024-06-01 09:00:01] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 1 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/2777 variables, 2/1979 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2777 variables, 0/1979 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 30 (OVERLAPS) 6/2783 variables, 5/1984 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2783 variables, 4/1988 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 09:00:05] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 2 ms to minimize.
[2024-06-01 09:00:05] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 2 ms to minimize.
[2024-06-01 09:00:05] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 2 ms to minimize.
[2024-06-01 09:00:05] [INFO ] Deduced a trap composed of 18 places in 121 ms of which 2 ms to minimize.
[2024-06-01 09:00:05] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 2 ms to minimize.
[2024-06-01 09:00:06] [INFO ] Deduced a trap composed of 6 places in 108 ms of which 2 ms to minimize.
[2024-06-01 09:00:06] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 2 ms to minimize.
[2024-06-01 09:00:06] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 2 ms to minimize.
[2024-06-01 09:00:07] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 2 ms to minimize.
[2024-06-01 09:00:07] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 2 ms to minimize.
[2024-06-01 09:00:07] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 2 ms to minimize.
[2024-06-01 09:00:07] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 2 ms to minimize.
[2024-06-01 09:00:07] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 3 ms to minimize.
[2024-06-01 09:00:08] [INFO ] Deduced a trap composed of 6 places in 114 ms of which 2 ms to minimize.
At refinement iteration 32 (INCLUDED_ONLY) 0/2783 variables, 14/2002 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 09:00:09] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 2 ms to minimize.
[2024-06-01 09:00:09] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 2 ms to minimize.
[2024-06-01 09:00:09] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 2 ms to minimize.
At refinement iteration 33 (INCLUDED_ONLY) 0/2783 variables, 3/2005 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2783 variables, 0/2005 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 35 (OVERLAPS) 6/2789 variables, 3/2008 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2789 variables, 4/2012 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/2789 variables, 0/2012 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 38 (OVERLAPS) 2/2791 variables, 1/2013 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/2791 variables, 2/2015 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/2791 variables, 0/2015 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 41 (OVERLAPS) 56/2847 variables, 36/2051 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/2847 variables, 10/2061 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/2847 variables, 1/2062 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 09:00:14] [INFO ] Deduced a trap composed of 5 places in 117 ms of which 2 ms to minimize.
At refinement iteration 44 (INCLUDED_ONLY) 0/2847 variables, 1/2063 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/2847 variables, 0/2063 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 46 (OVERLAPS) 1/2848 variables, 1/2064 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/2848 variables, 1/2065 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 09:00:17] [INFO ] Deduced a trap composed of 8 places in 127 ms of which 3 ms to minimize.
[2024-06-01 09:00:17] [INFO ] Deduced a trap composed of 6 places in 119 ms of which 2 ms to minimize.
At refinement iteration 48 (INCLUDED_ONLY) 0/2848 variables, 2/2067 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2848/2874 variables, and 2067 constraints, problems are : Problem set: 0 solved, 7 unsolved in 45018 ms.
Refiners :[Positive P Invariants (semi-flows): 429/437 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 1443/1462 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 174/174 constraints]
After SMT, in 49943ms problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 205 out of 1462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1462/1462 places, 1412/1412 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 1462 transition count 1407
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 1457 transition count 1407
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 10 place count 1457 transition count 1404
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 1454 transition count 1404
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 1453 transition count 1403
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 1453 transition count 1403
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 34 place count 1445 transition count 1395
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 37 place count 1445 transition count 1395
Applied a total of 37 rules in 194 ms. Remains 1445 /1462 variables (removed 17) and now considering 1395/1412 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 199 ms. Remains : 1445/1462 places, 1395/1412 transitions.
RANDOM walk for 40000 steps (8 resets) in 640 ms. (62 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 287 ms. (138 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 247 ms. (161 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 256 ms. (155 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 197 ms. (202 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 210 ms. (189 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 223 ms. (178 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 239 ms. (166 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 103292 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :0 out of 7
Probabilistic random walk after 103292 steps, saw 90787 distinct states, run finished after 3007 ms. (steps per millisecond=34 ) properties seen :0
// Phase 1: matrix 1395 rows 1445 cols
[2024-06-01 09:00:21] [INFO ] Computed 451 invariants in 21 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 644/849 variables, 224/224 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/849 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 415/1264 variables, 156/380 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1264 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 26/1290 variables, 13/393 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1290 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1309/2599 variables, 1290/1683 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2599 variables, 0/1683 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 147/2746 variables, 91/1774 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2746 variables, 30/1804 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2746 variables, 0/1804 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 4/2750 variables, 4/1808 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2750 variables, 4/1812 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2750 variables, 0/1812 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 6/2756 variables, 3/1815 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2756 variables, 4/1819 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2756 variables, 0/1819 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 2/2758 variables, 1/1820 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2758 variables, 2/1822 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2758 variables, 0/1822 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (OVERLAPS) 55/2813 variables, 34/1856 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2813 variables, 10/1866 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2813 variables, 1/1867 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2813 variables, 0/1867 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (OVERLAPS) 1/2814 variables, 1/1868 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2814 variables, 1/1869 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2814 variables, 0/1869 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 28 (OVERLAPS) 20/2834 variables, 14/1883 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2834 variables, 4/1887 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2834 variables, 0/1887 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 31 (OVERLAPS) 1/2835 variables, 2/1889 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2835 variables, 1/1890 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/2835 variables, 0/1890 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 34 (OVERLAPS) 5/2840 variables, 4/1894 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/2840 variables, 2/1896 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2840 variables, 0/1896 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 37 (OVERLAPS) 0/2840 variables, 0/1896 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2840/2840 variables, and 1896 constraints, problems are : Problem set: 0 solved, 7 unsolved in 4536 ms.
Refiners :[Positive P Invariants (semi-flows): 436/436 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 1445/1445 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 644/849 variables, 224/224 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 09:00:26] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 1 ms to minimize.
[2024-06-01 09:00:26] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
[2024-06-01 09:00:26] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 1 ms to minimize.
[2024-06-01 09:00:27] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
[2024-06-01 09:00:27] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-06-01 09:00:27] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 1 ms to minimize.
[2024-06-01 09:00:27] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2024-06-01 09:00:27] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 2 ms to minimize.
[2024-06-01 09:00:27] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 2 ms to minimize.
[2024-06-01 09:00:27] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2024-06-01 09:00:27] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 1 ms to minimize.
[2024-06-01 09:00:27] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-06-01 09:00:27] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 2 ms to minimize.
[2024-06-01 09:00:27] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-06-01 09:00:27] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-06-01 09:00:27] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-06-01 09:00:28] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-06-01 09:00:28] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-06-01 09:00:28] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-06-01 09:00:28] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/849 variables, 20/244 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 09:00:28] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2024-06-01 09:00:28] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-06-01 09:00:28] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 2 ms to minimize.
[2024-06-01 09:00:28] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 2 ms to minimize.
[2024-06-01 09:00:28] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-06-01 09:00:28] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-06-01 09:00:28] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-06-01 09:00:28] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2024-06-01 09:00:29] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/849 variables, 9/253 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 09:00:29] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-06-01 09:00:29] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-06-01 09:00:29] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-06-01 09:00:29] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-06-01 09:00:29] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
[2024-06-01 09:00:29] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/849 variables, 6/259 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 09:00:29] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-06-01 09:00:29] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-06-01 09:00:29] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 1 ms to minimize.
[2024-06-01 09:00:29] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-06-01 09:00:29] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
[2024-06-01 09:00:30] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/849 variables, 6/265 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 09:00:30] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2024-06-01 09:00:30] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/849 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 09:00:30] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 1 ms to minimize.
[2024-06-01 09:00:30] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
[2024-06-01 09:00:30] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/849 variables, 3/270 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 09:00:30] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/849 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 09:00:31] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-06-01 09:00:31] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 1 ms to minimize.
[2024-06-01 09:00:31] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/849 variables, 3/274 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 09:00:31] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/849 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 09:00:31] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/849 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 09:00:31] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/849 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/849 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 415/1264 variables, 156/433 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 09:00:32] [INFO ] Deduced a trap composed of 6 places in 116 ms of which 2 ms to minimize.
[2024-06-01 09:00:32] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 1 ms to minimize.
[2024-06-01 09:00:32] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 2 ms to minimize.
[2024-06-01 09:00:32] [INFO ] Deduced a trap composed of 8 places in 115 ms of which 3 ms to minimize.
[2024-06-01 09:00:32] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 3 ms to minimize.
[2024-06-01 09:00:32] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 5 ms to minimize.
[2024-06-01 09:00:32] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 2 ms to minimize.
[2024-06-01 09:00:33] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 2 ms to minimize.
[2024-06-01 09:00:33] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 2 ms to minimize.
[2024-06-01 09:00:33] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 1 ms to minimize.
[2024-06-01 09:00:33] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 1 ms to minimize.
[2024-06-01 09:00:33] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 2 ms to minimize.
[2024-06-01 09:00:33] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 2 ms to minimize.
[2024-06-01 09:00:33] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 2 ms to minimize.
[2024-06-01 09:00:33] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
[2024-06-01 09:00:33] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 1 ms to minimize.
[2024-06-01 09:00:34] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 2 ms to minimize.
[2024-06-01 09:00:34] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 1 ms to minimize.
[2024-06-01 09:00:34] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 2 ms to minimize.
[2024-06-01 09:00:34] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1264 variables, 20/453 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 09:00:34] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
[2024-06-01 09:00:34] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 2 ms to minimize.
[2024-06-01 09:00:34] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 2 ms to minimize.
[2024-06-01 09:00:34] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 1 ms to minimize.
[2024-06-01 09:00:34] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 1 ms to minimize.
[2024-06-01 09:00:34] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2024-06-01 09:00:34] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 1 ms to minimize.
[2024-06-01 09:00:35] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 1 ms to minimize.
[2024-06-01 09:00:35] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-06-01 09:00:35] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 1 ms to minimize.
[2024-06-01 09:00:35] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
[2024-06-01 09:00:35] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-06-01 09:00:35] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-06-01 09:00:35] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-06-01 09:00:35] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2024-06-01 09:00:35] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-06-01 09:00:35] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 1 ms to minimize.
[2024-06-01 09:00:35] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2024-06-01 09:00:35] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
[2024-06-01 09:00:36] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1264 variables, 20/473 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 09:00:36] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-06-01 09:00:36] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2024-06-01 09:00:36] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1264 variables, 3/476 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 09:00:36] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 1 ms to minimize.
[2024-06-01 09:00:36] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 2 ms to minimize.
[2024-06-01 09:00:36] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 1 ms to minimize.
[2024-06-01 09:00:36] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 1 ms to minimize.
[2024-06-01 09:00:36] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-06-01 09:00:37] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 1 ms to minimize.
[2024-06-01 09:00:37] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2024-06-01 09:00:37] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
[2024-06-01 09:00:37] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 2 ms to minimize.
[2024-06-01 09:00:37] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-06-01 09:00:37] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-06-01 09:00:37] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
[2024-06-01 09:00:37] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-06-01 09:00:37] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 2 ms to minimize.
[2024-06-01 09:00:37] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 2 ms to minimize.
[2024-06-01 09:00:38] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 2 ms to minimize.
[2024-06-01 09:00:38] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 1 ms to minimize.
[2024-06-01 09:00:38] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 2 ms to minimize.
[2024-06-01 09:00:38] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 1 ms to minimize.
[2024-06-01 09:00:38] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1264 variables, 20/496 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 09:00:38] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-06-01 09:00:38] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-06-01 09:00:38] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1264 variables, 3/499 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 09:00:39] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 2 ms to minimize.
[2024-06-01 09:00:39] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 2 ms to minimize.
[2024-06-01 09:00:39] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 2 ms to minimize.
[2024-06-01 09:00:39] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1264 variables, 4/503 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 09:00:39] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 1 ms to minimize.
[2024-06-01 09:00:39] [INFO ] Deduced a trap composed of 6 places in 97 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1264 variables, 2/505 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 09:00:40] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 2 ms to minimize.
[2024-06-01 09:00:40] [INFO ] Deduced a trap composed of 8 places in 137 ms of which 3 ms to minimize.
[2024-06-01 09:00:40] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1264 variables, 3/508 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1264 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (OVERLAPS) 26/1290 variables, 13/521 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 09:00:40] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 2 ms to minimize.
[2024-06-01 09:00:40] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 2 ms to minimize.
[2024-06-01 09:00:41] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 1 ms to minimize.
[2024-06-01 09:00:41] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 1 ms to minimize.
[2024-06-01 09:00:41] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1290 variables, 5/526 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 09:00:41] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 2 ms to minimize.
[2024-06-01 09:00:41] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2024-06-01 09:00:41] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 1 ms to minimize.
[2024-06-01 09:00:41] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 1 ms to minimize.
[2024-06-01 09:00:42] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 2 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/1290 variables, 5/531 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 09:00:42] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 1 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/1290 variables, 1/532 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1290 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 29 (OVERLAPS) 1309/2599 variables, 1290/1822 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2599 variables, 2/1824 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 09:00:43] [INFO ] Deduced a trap composed of 6 places in 123 ms of which 2 ms to minimize.
[2024-06-01 09:00:43] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 3 ms to minimize.
[2024-06-01 09:00:44] [INFO ] Deduced a trap composed of 6 places in 126 ms of which 2 ms to minimize.
[2024-06-01 09:00:44] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 2 ms to minimize.
[2024-06-01 09:00:44] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 3 ms to minimize.
[2024-06-01 09:00:44] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 2 ms to minimize.
[2024-06-01 09:00:44] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 3 ms to minimize.
[2024-06-01 09:00:44] [INFO ] Deduced a trap composed of 5 places in 124 ms of which 2 ms to minimize.
[2024-06-01 09:00:45] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 2 ms to minimize.
[2024-06-01 09:00:45] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 2 ms to minimize.
[2024-06-01 09:00:45] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 2 ms to minimize.
[2024-06-01 09:00:45] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 2 ms to minimize.
[2024-06-01 09:00:45] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 1 ms to minimize.
[2024-06-01 09:00:45] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 1 ms to minimize.
[2024-06-01 09:00:45] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 2 ms to minimize.
[2024-06-01 09:00:46] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 2 ms to minimize.
[2024-06-01 09:00:46] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 2 ms to minimize.
[2024-06-01 09:00:46] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 2 ms to minimize.
[2024-06-01 09:00:46] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 1 ms to minimize.
[2024-06-01 09:00:46] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 2 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/2599 variables, 20/1844 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 09:00:47] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 2 ms to minimize.
[2024-06-01 09:00:47] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 2 ms to minimize.
[2024-06-01 09:00:48] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 5 ms to minimize.
[2024-06-01 09:00:48] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 2 ms to minimize.
[2024-06-01 09:00:48] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 1 ms to minimize.
[2024-06-01 09:00:48] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 2 ms to minimize.
[2024-06-01 09:00:48] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 1 ms to minimize.
[2024-06-01 09:00:48] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 2 ms to minimize.
[2024-06-01 09:00:49] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 1 ms to minimize.
[2024-06-01 09:00:49] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 2 ms to minimize.
[2024-06-01 09:00:49] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 2 ms to minimize.
[2024-06-01 09:00:49] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
[2024-06-01 09:00:49] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2024-06-01 09:00:49] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 2 ms to minimize.
[2024-06-01 09:00:50] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 1 ms to minimize.
At refinement iteration 32 (INCLUDED_ONLY) 0/2599 variables, 15/1859 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 09:00:50] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
At refinement iteration 33 (INCLUDED_ONLY) 0/2599 variables, 1/1860 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 09:00:51] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2024-06-01 09:00:51] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 2 ms to minimize.
[2024-06-01 09:00:51] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 1 ms to minimize.
[2024-06-01 09:00:51] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 2 ms to minimize.
[2024-06-01 09:00:52] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 1 ms to minimize.
[2024-06-01 09:00:52] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 2 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/2599 variables, 6/1866 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/2599 variables, 0/1866 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 36 (OVERLAPS) 147/2746 variables, 91/1957 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/2746 variables, 30/1987 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/2746 variables, 5/1992 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 09:00:56] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 2 ms to minimize.
[2024-06-01 09:00:56] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 2 ms to minimize.
[2024-06-01 09:00:56] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 2 ms to minimize.
[2024-06-01 09:00:57] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 3 ms to minimize.
[2024-06-01 09:00:57] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 3 ms to minimize.
[2024-06-01 09:00:57] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 3 ms to minimize.
[2024-06-01 09:00:57] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 2 ms to minimize.
[2024-06-01 09:00:57] [INFO ] Deduced a trap composed of 8 places in 116 ms of which 2 ms to minimize.
[2024-06-01 09:00:57] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 2 ms to minimize.
[2024-06-01 09:00:58] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 2 ms to minimize.
[2024-06-01 09:00:58] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 2 ms to minimize.
[2024-06-01 09:00:58] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 2 ms to minimize.
[2024-06-01 09:00:58] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 2 ms to minimize.
[2024-06-01 09:00:58] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 1 ms to minimize.
[2024-06-01 09:00:59] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 2 ms to minimize.
[2024-06-01 09:00:59] [INFO ] Deduced a trap composed of 6 places in 110 ms of which 2 ms to minimize.
[2024-06-01 09:01:00] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 1 ms to minimize.
[2024-06-01 09:01:00] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 2 ms to minimize.
[2024-06-01 09:01:00] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 2 ms to minimize.
[2024-06-01 09:01:00] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 2 ms to minimize.
At refinement iteration 39 (INCLUDED_ONLY) 0/2746 variables, 20/2012 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 09:01:01] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 2 ms to minimize.
[2024-06-01 09:01:02] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 2 ms to minimize.
[2024-06-01 09:01:02] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 2 ms to minimize.
[2024-06-01 09:01:02] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 2 ms to minimize.
At refinement iteration 40 (INCLUDED_ONLY) 0/2746 variables, 4/2016 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 09:01:04] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 2 ms to minimize.
[2024-06-01 09:01:04] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
At refinement iteration 41 (INCLUDED_ONLY) 0/2746 variables, 2/2018 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/2746 variables, 0/2018 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 43 (OVERLAPS) 4/2750 variables, 4/2022 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/2750 variables, 4/2026 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 09:01:07] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 1 ms to minimize.
[2024-06-01 09:01:08] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-06-01 09:01:08] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 2 ms to minimize.
At refinement iteration 45 (INCLUDED_ONLY) 0/2750 variables, 3/2029 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 09:01:09] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 2 ms to minimize.
[2024-06-01 09:01:09] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2024-06-01 09:01:09] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 2 ms to minimize.
[2024-06-01 09:01:09] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-06-01 09:01:10] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
At refinement iteration 46 (INCLUDED_ONLY) 0/2750 variables, 5/2034 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/2750 variables, 0/2034 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 48 (OVERLAPS) 6/2756 variables, 3/2037 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/2756 variables, 4/2041 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 09:01:12] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
At refinement iteration 50 (INCLUDED_ONLY) 0/2756 variables, 1/2042 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/2756 variables, 0/2042 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 52 (OVERLAPS) 2/2758 variables, 1/2043 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/2758 variables, 2/2045 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/2758 variables, 0/2045 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 55 (OVERLAPS) 55/2813 variables, 34/2079 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/2813 variables, 10/2089 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/2813 variables, 1/2090 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 09:01:16] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2024-06-01 09:01:16] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-06-01 09:01:16] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2024-06-01 09:01:16] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 2 ms to minimize.
[2024-06-01 09:01:17] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
At refinement iteration 58 (INCLUDED_ONLY) 0/2813 variables, 5/2095 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/2813 variables, 0/2095 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 60 (OVERLAPS) 1/2814 variables, 1/2096 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/2814 variables, 1/2097 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 09:01:19] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 1 ms to minimize.
[2024-06-01 09:01:20] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 1 ms to minimize.
At refinement iteration 62 (INCLUDED_ONLY) 0/2814 variables, 2/2099 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/2814 variables, 0/2099 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 64 (OVERLAPS) 20/2834 variables, 14/2113 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/2834 variables, 4/2117 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 09:01:22] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2024-06-01 09:01:22] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 1 ms to minimize.
[2024-06-01 09:01:22] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
[2024-06-01 09:01:22] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-06-01 09:01:23] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
At refinement iteration 66 (INCLUDED_ONLY) 0/2834 variables, 5/2122 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 09:01:24] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
At refinement iteration 67 (INCLUDED_ONLY) 0/2834 variables, 1/2123 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 09:01:25] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-06-01 09:01:25] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 0 ms to minimize.
[2024-06-01 09:01:25] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
At refinement iteration 68 (INCLUDED_ONLY) 0/2834 variables, 3/2126 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/2834 variables, 0/2126 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 70 (OVERLAPS) 1/2835 variables, 2/2128 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/2835 variables, 1/2129 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 09:01:28] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
At refinement iteration 72 (INCLUDED_ONLY) 0/2835 variables, 1/2130 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/2835 variables, 0/2130 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 74 (OVERLAPS) 5/2840 variables, 4/2134 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/2840 variables, 2/2136 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 09:01:29] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-06-01 09:01:30] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
At refinement iteration 76 (INCLUDED_ONLY) 0/2840 variables, 2/2138 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/2840 variables, 0/2138 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 78 (OVERLAPS) 0/2840 variables, 0/2138 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2840/2840 variables, and 2138 constraints, problems are : Problem set: 0 solved, 7 unsolved in 67046 ms.
Refiners :[Positive P Invariants (semi-flows): 436/436 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 1445/1445 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 235/235 constraints]
After SMT, in 71652ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 17582 ms.
Support contains 205 out of 1445 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1445/1445 places, 1395/1395 transitions.
Applied a total of 0 rules in 35 ms. Remains 1445 /1445 variables (removed 0) and now considering 1395/1395 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 1445/1445 places, 1395/1395 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1445/1445 places, 1395/1395 transitions.
Applied a total of 0 rules in 34 ms. Remains 1445 /1445 variables (removed 0) and now considering 1395/1395 (removed 0) transitions.
[2024-06-01 09:01:51] [INFO ] Invariant cache hit.
[2024-06-01 09:01:51] [INFO ] Implicit Places using invariants in 649 ms returned []
[2024-06-01 09:01:51] [INFO ] Invariant cache hit.
[2024-06-01 09:01:53] [INFO ] Implicit Places using invariants and state equation in 1520 ms returned []
Implicit Place search using SMT with State Equation took 2194 ms to find 0 implicit places.
[2024-06-01 09:01:53] [INFO ] Redundant transitions in 103 ms returned []
Running 1378 sub problems to find dead transitions.
[2024-06-01 09:01:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1428 variables, 69/69 constraints. Problems are: Problem set: 0 solved, 1378 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1428 variables, 15/84 constraints. Problems are: Problem set: 0 solved, 1378 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0)
(s973 1.0)
(s974 1.0)
(s975 1.0)
(s976 1.0)
(s977 1.0)
(s978 1.0)
(s979 1.0)
(s980 1.0)
(s981 1.0)
(s982 1.0)
(s983 1.0)
(s984 1.0)
(s985 1.0)
(s986 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1428/2840 variables, and 84 constraints, problems are : Problem set: 0 solved, 1378 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 69/436 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 0/1445 constraints, PredecessorRefiner: 1378/1378 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1378 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1428 variables, 69/69 constraints. Problems are: Problem set: 0 solved, 1378 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1428 variables, 15/84 constraints. Problems are: Problem set: 0 solved, 1378 unsolved
[2024-06-01 09:02:44] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-06-01 09:02:45] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-06-01 09:02:46] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-06-01 09:02:46] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-06-01 09:02:47] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-06-01 09:02:47] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1428/2840 variables, and 90 constraints, problems are : Problem set: 0 solved, 1378 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 69/436 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 0/1445 constraints, PredecessorRefiner: 0/1378 constraints, Known Traps: 6/6 constraints]
After SMT, in 60544ms problems are : Problem set: 0 solved, 1378 unsolved
Search for dead transitions found 0 dead transitions in 60559ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62904 ms. Remains : 1445/1445 places, 1395/1395 transitions.
[2024-06-01 09:02:54] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2024-06-01 09:02:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1445 places, 1395 transitions and 6331 arcs took 12 ms.
[2024-06-01 09:02:54] [INFO ] Flatten gal took : 168 ms
Total runtime 220231 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 : ShieldIIPs-PT-050B-ReachabilityFireability-2024-00
Could not compute solution for formula : ShieldIIPs-PT-050B-ReachabilityFireability-2023-04
Could not compute solution for formula : ShieldIIPs-PT-050B-ReachabilityFireability-2023-05
Could not compute solution for formula : ShieldIIPs-PT-050B-ReachabilityFireability-2024-06
Could not compute solution for formula : ShieldIIPs-PT-050B-ReachabilityFireability-2024-09
Could not compute solution for formula : ShieldIIPs-PT-050B-ReachabilityFireability-2024-10
Could not compute solution for formula : ShieldIIPs-PT-050B-ReachabilityFireability-2024-11

BK_STOP 1717232574791

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name ShieldIIPs-PT-050B-ReachabilityFireability-2024-00
rfs formula type EF
rfs formula formula --invariant=/tmp/1872/inv_0_
rfs formula name ShieldIIPs-PT-050B-ReachabilityFireability-2023-04
rfs formula type EF
rfs formula formula --invariant=/tmp/1872/inv_1_
rfs formula name ShieldIIPs-PT-050B-ReachabilityFireability-2023-05
rfs formula type EF
rfs formula formula --invariant=/tmp/1872/inv_2_
rfs formula name ShieldIIPs-PT-050B-ReachabilityFireability-2024-06
rfs formula type EF
rfs formula formula --invariant=/tmp/1872/inv_3_
rfs formula name ShieldIIPs-PT-050B-ReachabilityFireability-2024-09
rfs formula type EF
rfs formula formula --invariant=/tmp/1872/inv_4_
rfs formula name ShieldIIPs-PT-050B-ReachabilityFireability-2024-10
rfs formula type AG
rfs formula formula --invariant=/tmp/1872/inv_5_
rfs formula name ShieldIIPs-PT-050B-ReachabilityFireability-2024-11
rfs formula type EF
rfs formula formula --invariant=/tmp/1872/inv_6_
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="ShieldIIPs-PT-050B"
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 ShieldIIPs-PT-050B, 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-171683760500159"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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