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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 76K 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.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.9M 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 ShieldPPPt-PT-100B-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-2023-04
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717261706186

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-100B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 17:08:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 17:08:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 17:08:27] [INFO ] Load time of PNML (sax parser for PT used): 325 ms
[2024-06-01 17:08:28] [INFO ] Transformed 7803 places.
[2024-06-01 17:08:28] [INFO ] Transformed 7103 transitions.
[2024-06-01 17:08:28] [INFO ] Found NUPN structural information;
[2024-06-01 17:08:28] [INFO ] Parsed PT model containing 7803 places and 7103 transitions and 17806 arcs in 768 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 2182 ms. (18 steps per ms) remains 10/15 properties
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 165 ms. (240 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 181 ms. (219 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1265 ms. (31 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 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 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 161 ms. (246 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 96 ms. (412 steps per ms) remains 10/10 properties
// Phase 1: matrix 7103 rows 7803 cols
[2024-06-01 17:08:30] [INFO ] Computed 1101 invariants in 85 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 1218/1297 variables, 139/218 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1297 variables, 1218/1436 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1297 variables, 0/1436 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 6506/7803 variables, 962/2398 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7803 variables, 6506/8904 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/7803 variables, 0/8904 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 14906/14906 variables, and 16707 constraints, problems are : Problem set: 0 solved, 10 unsolved in 5051 ms.
Refiners :[Domain max(s): 7803/7803 constraints, Positive P Invariants (semi-flows): 1101/1101 constraints, State Equation: 7803/7803 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/79 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 1218/1297 variables, 139/218 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1297 variables, 1218/1436 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-01 17:08:35] [INFO ] Deduced a trap composed of 80 places in 214 ms of which 30 ms to minimize.
[2024-06-01 17:08:36] [INFO ] Deduced a trap composed of 107 places in 161 ms of which 4 ms to minimize.
[2024-06-01 17:08:36] [INFO ] Deduced a trap composed of 97 places in 129 ms of which 3 ms to minimize.
[2024-06-01 17:08:36] [INFO ] Deduced a trap composed of 99 places in 116 ms of which 2 ms to minimize.
[2024-06-01 17:08:36] [INFO ] Deduced a trap composed of 102 places in 112 ms of which 3 ms to minimize.
[2024-06-01 17:08:36] [INFO ] Deduced a trap composed of 33 places in 143 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1297 variables, 6/1442 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1297 variables, 0/1442 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 6506/7803 variables, 962/2404 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/7803 variables, 6506/8910 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-01 17:08:41] [INFO ] Deduced a trap composed of 26 places in 2084 ms of which 24 ms to minimize.
SMT process timed out in 11305ms, After SMT, problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 79 out of 7803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7803/7803 places, 7103/7103 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1850 transitions
Trivial Post-agglo rules discarded 1850 transitions
Performed 1850 trivial Post agglomeration. Transition count delta: 1850
Iterating post reduction 0 with 1850 rules applied. Total rules applied 1850 place count 7803 transition count 5253
Reduce places removed 1850 places and 0 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 1 with 1870 rules applied. Total rules applied 3720 place count 5953 transition count 5233
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 3740 place count 5933 transition count 5233
Performed 405 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 405 Pre rules applied. Total rules applied 3740 place count 5933 transition count 4828
Deduced a syphon composed of 405 places in 25 ms
Reduce places removed 405 places and 0 transitions.
Iterating global reduction 3 with 810 rules applied. Total rules applied 4550 place count 5528 transition count 4828
Discarding 682 places :
Symmetric choice reduction at 3 with 682 rule applications. Total rules 5232 place count 4846 transition count 4146
Iterating global reduction 3 with 682 rules applied. Total rules applied 5914 place count 4846 transition count 4146
Performed 287 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 287 Pre rules applied. Total rules applied 5914 place count 4846 transition count 3859
Deduced a syphon composed of 287 places in 18 ms
Reduce places removed 287 places and 0 transitions.
Iterating global reduction 3 with 574 rules applied. Total rules applied 6488 place count 4559 transition count 3859
Performed 1663 Post agglomeration using F-continuation condition.Transition count delta: 1663
Deduced a syphon composed of 1663 places in 17 ms
Reduce places removed 1663 places and 0 transitions.
Iterating global reduction 3 with 3326 rules applied. Total rules applied 9814 place count 2896 transition count 2196
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 14 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 10016 place count 2795 transition count 2196
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 6 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 10218 place count 2694 transition count 2196
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 89 places in 4 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 10396 place count 2605 transition count 2196
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 10400 place count 2605 transition count 2192
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 10404 place count 2601 transition count 2192
Partial Free-agglomeration rule applied 287 times.
Drop transitions (Partial Free agglomeration) removed 287 transitions
Iterating global reduction 4 with 287 rules applied. Total rules applied 10691 place count 2601 transition count 2192
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 10692 place count 2600 transition count 2191
Applied a total of 10692 rules in 3345 ms. Remains 2600 /7803 variables (removed 5203) and now considering 2191/7103 (removed 4912) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3354 ms. Remains : 2600/7803 places, 2191/7103 transitions.
RANDOM walk for 40000 steps (8 resets) in 1072 ms. (37 steps per ms) remains 8/10 properties
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 827 ms. (48 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 544 ms. (73 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 594 ms. (67 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 538 ms. (74 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 559 ms. (71 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 511 ms. (78 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 532 ms. (75 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 527 ms. (75 steps per ms) remains 8/8 properties
// Phase 1: matrix 2191 rows 2600 cols
[2024-06-01 17:08:46] [INFO ] Computed 1101 invariants in 6 ms
[2024-06-01 17:08:46] [INFO ] State equation strengthened by 51 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 309/377 variables, 123/123 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/377 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 111/488 variables, 50/173 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/488 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 577/1065 variables, 488/661 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1065 variables, 39/700 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1065 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 774/1839 variables, 420/1120 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1839 variables, 162/1282 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1839 variables, 8/1290 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1839 variables, 0/1290 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 33/1872 variables, 34/1324 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1872 variables, 31/1355 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1872 variables, 0/1355 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 57/1929 variables, 28/1383 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1929 variables, 0/1383 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 904/2833 variables, 494/1877 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2833 variables, 141/2018 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2833 variables, 1/2019 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2833 variables, 0/2019 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (OVERLAPS) 59/2892 variables, 63/2082 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2892 variables, 57/2139 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2892 variables, 0/2139 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (OVERLAPS) 106/2998 variables, 53/2192 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2998 variables, 0/2192 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 26 (OVERLAPS) 653/3651 variables, 441/2633 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3651 variables, 126/2759 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3651 variables, 0/2759 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 29 (OVERLAPS) 25/3676 variables, 33/2792 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/3676 variables, 23/2815 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/3676 variables, 0/2815 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 32 (OVERLAPS) 43/3719 variables, 20/2835 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/3719 variables, 0/2835 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 34 (OVERLAPS) 381/4100 variables, 238/3073 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/4100 variables, 63/3136 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/4100 variables, 3/3139 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/4100 variables, 0/3139 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 38 (OVERLAPS) 17/4117 variables, 30/3169 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/4117 variables, 17/3186 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/4117 variables, 0/3186 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 41 (OVERLAPS) 8/4125 variables, 4/3190 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/4125 variables, 0/3190 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 43 (OVERLAPS) 196/4321 variables, 121/3311 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/4321 variables, 44/3355 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/4321 variables, 0/3355 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 46 (OVERLAPS) 5/4326 variables, 10/3365 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/4326 variables, 5/3370 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/4326 variables, 0/3370 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 49 (OVERLAPS) 139/4465 variables, 73/3443 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/4465 variables, 19/3462 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/4465 variables, 0/3462 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 52 (OVERLAPS) 10/4475 variables, 16/3478 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/4475 variables, 10/3488 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/4475 variables, 0/3488 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 55 (OVERLAPS) 8/4483 variables, 4/3492 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/4483 variables, 0/3492 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 57 (OVERLAPS) 79/4562 variables, 52/3544 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/4562 variables, 21/3565 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/4562 variables, 0/3565 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 60 (OVERLAPS) 80/4642 variables, 42/3607 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/4642 variables, 9/3616 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/4642 variables, 0/3616 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 63 (OVERLAPS) 6/4648 variables, 11/3627 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/4648 variables, 6/3633 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/4648 variables, 0/3633 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 66 (OVERLAPS) 2/4650 variables, 1/3634 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/4650 variables, 0/3634 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 68 (OVERLAPS) 26/4676 variables, 18/3652 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/4676 variables, 8/3660 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/4676 variables, 0/3660 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 71 (OVERLAPS) 29/4705 variables, 15/3675 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/4705 variables, 3/3678 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/4705 variables, 0/3678 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 74 (OVERLAPS) 2/4707 variables, 4/3682 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/4707 variables, 2/3684 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/4707 variables, 0/3684 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 77 (OVERLAPS) 15/4722 variables, 8/3692 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/4722 variables, 4/3696 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/4722 variables, 0/3696 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 80 (OVERLAPS) 29/4751 variables, 15/3711 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/4751 variables, 3/3714 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/4751 variables, 0/3714 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 83 (OVERLAPS) 2/4753 variables, 4/3718 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/4753 variables, 2/3720 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/4753 variables, 0/3720 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 86 (OVERLAPS) 15/4768 variables, 8/3728 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/4768 variables, 3/3731 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/4768 variables, 0/3731 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 89 (OVERLAPS) 1/4769 variables, 1/3732 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/4769 variables, 1/3733 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/4769 variables, 0/3733 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 92 (OVERLAPS) 19/4788 variables, 10/3743 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/4788 variables, 3/3746 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/4788 variables, 0/3746 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 95 (OVERLAPS) 1/4789 variables, 2/3748 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/4789 variables, 1/3749 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/4789 variables, 0/3749 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 98 (OVERLAPS) 2/4791 variables, 2/3751 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/4791 variables, 1/3752 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/4791 variables, 0/3752 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 101 (OVERLAPS) 0/4791 variables, 0/3752 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4791/4791 variables, and 3752 constraints, problems are : Problem set: 0 solved, 8 unsolved in 18317 ms.
Refiners :[Positive P Invariants (semi-flows): 1101/1101 constraints, State Equation: 2600/2600 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 309/377 variables, 123/123 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 17:09:04] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-06-01 17:09:04] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/377 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/377 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 111/488 variables, 50/175 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 17:09:04] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/488 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 577/1065 variables, 488/664 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1065 variables, 39/703 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 17:09:05] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1065 variables, 1/704 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1065 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 774/1839 variables, 420/1124 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1839 variables, 162/1286 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1839 variables, 8/1294 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1839 variables, 8/1302 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 17:09:05] [INFO ] Deduced a trap composed of 3 places in 165 ms of which 4 ms to minimize.
[2024-06-01 17:09:06] [INFO ] Deduced a trap composed of 3 places in 166 ms of which 3 ms to minimize.
[2024-06-01 17:09:06] [INFO ] Deduced a trap composed of 6 places in 162 ms of which 3 ms to minimize.
[2024-06-01 17:09:06] [INFO ] Deduced a trap composed of 4 places in 160 ms of which 3 ms to minimize.
[2024-06-01 17:09:06] [INFO ] Deduced a trap composed of 5 places in 150 ms of which 3 ms to minimize.
[2024-06-01 17:09:07] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 3 ms to minimize.
[2024-06-01 17:09:07] [INFO ] Deduced a trap composed of 8 places in 141 ms of which 3 ms to minimize.
[2024-06-01 17:09:07] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1839 variables, 8/1310 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1839 variables, 0/1310 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 33/1872 variables, 34/1344 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1872 variables, 31/1375 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 17:09:08] [INFO ] Deduced a trap composed of 5 places in 133 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1872 variables, 1/1376 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1872 variables, 0/1376 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (OVERLAPS) 57/1929 variables, 28/1404 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 17:09:08] [INFO ] Deduced a trap composed of 6 places in 136 ms of which 3 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1929 variables, 1/1405 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 17:09:09] [INFO ] Deduced a trap composed of 6 places in 130 ms of which 3 ms to minimize.
[2024-06-01 17:09:09] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 3 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1929 variables, 2/1407 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 17:09:10] [INFO ] Deduced a trap composed of 5 places in 130 ms of which 3 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1929 variables, 1/1408 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1929 variables, 0/1408 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 26 (OVERLAPS) 904/2833 variables, 494/1902 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2833 variables, 141/2043 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2833 variables, 1/2044 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 17:09:11] [INFO ] Deduced a trap composed of 6 places in 188 ms of which 4 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/2833 variables, 1/2045 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2833 variables, 0/2045 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 31 (OVERLAPS) 59/2892 variables, 63/2108 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2892 variables, 57/2165 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/2892 variables, 0/2165 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 34 (OVERLAPS) 106/2998 variables, 53/2218 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 17:09:12] [INFO ] Deduced a trap composed of 5 places in 210 ms of which 5 ms to minimize.
[2024-06-01 17:09:13] [INFO ] Deduced a trap composed of 6 places in 217 ms of which 4 ms to minimize.
[2024-06-01 17:09:13] [INFO ] Deduced a trap composed of 6 places in 214 ms of which 4 ms to minimize.
At refinement iteration 35 (INCLUDED_ONLY) 0/2998 variables, 3/2221 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2998 variables, 0/2221 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 37 (OVERLAPS) 653/3651 variables, 441/2662 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/3651 variables, 126/2788 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 17:09:14] [INFO ] Deduced a trap composed of 7 places in 245 ms of which 5 ms to minimize.
[2024-06-01 17:09:15] [INFO ] Deduced a trap composed of 5 places in 248 ms of which 5 ms to minimize.
[2024-06-01 17:09:15] [INFO ] Deduced a trap composed of 5 places in 253 ms of which 5 ms to minimize.
At refinement iteration 39 (INCLUDED_ONLY) 0/3651 variables, 3/2791 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/3651 variables, 0/2791 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 41 (OVERLAPS) 25/3676 variables, 33/2824 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/3676 variables, 23/2847 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/3676 variables, 0/2847 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 44 (OVERLAPS) 43/3719 variables, 20/2867 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/3719 variables, 0/2867 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 46 (OVERLAPS) 381/4100 variables, 238/3105 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/4100 variables, 63/3168 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/4100 variables, 3/3171 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/4100 variables, 0/3171 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 50 (OVERLAPS) 17/4117 variables, 30/3201 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/4117 variables, 17/3218 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/4117 variables, 0/3218 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 53 (OVERLAPS) 8/4125 variables, 4/3222 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/4125 variables, 0/3222 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 55 (OVERLAPS) 196/4321 variables, 121/3343 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/4321 variables, 44/3387 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 17:09:21] [INFO ] Deduced a trap composed of 5 places in 309 ms of which 6 ms to minimize.
At refinement iteration 57 (INCLUDED_ONLY) 0/4321 variables, 1/3388 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 17:09:22] [INFO ] Deduced a trap composed of 4 places in 304 ms of which 6 ms to minimize.
At refinement iteration 58 (INCLUDED_ONLY) 0/4321 variables, 1/3389 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/4321 variables, 0/3389 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 60 (OVERLAPS) 5/4326 variables, 10/3399 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/4326 variables, 5/3404 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 17:09:23] [INFO ] Deduced a trap composed of 5 places in 322 ms of which 6 ms to minimize.
At refinement iteration 62 (INCLUDED_ONLY) 0/4326 variables, 1/3405 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/4326 variables, 0/3405 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 64 (OVERLAPS) 139/4465 variables, 73/3478 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/4465 variables, 19/3497 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 17:09:26] [INFO ] Deduced a trap composed of 5 places in 343 ms of which 6 ms to minimize.
At refinement iteration 66 (INCLUDED_ONLY) 0/4465 variables, 1/3498 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/4465 variables, 0/3498 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 68 (OVERLAPS) 10/4475 variables, 16/3514 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/4475 variables, 10/3524 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/4475 variables, 0/3524 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 71 (OVERLAPS) 8/4483 variables, 4/3528 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/4483 variables, 0/3528 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 73 (OVERLAPS) 79/4562 variables, 52/3580 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/4562 variables, 21/3601 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/4562 variables, 0/3601 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 76 (OVERLAPS) 80/4642 variables, 42/3643 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/4642 variables, 9/3652 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/4642 variables, 0/3652 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 79 (OVERLAPS) 6/4648 variables, 11/3663 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/4648 variables, 6/3669 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/4648 variables, 0/3669 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 82 (OVERLAPS) 2/4650 variables, 1/3670 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/4650 variables, 0/3670 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 84 (OVERLAPS) 26/4676 variables, 18/3688 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/4676 variables, 8/3696 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/4676 variables, 0/3696 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 87 (OVERLAPS) 29/4705 variables, 15/3711 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/4705 variables, 3/3714 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/4705 variables, 0/3714 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 90 (OVERLAPS) 2/4707 variables, 4/3718 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/4707 variables, 2/3720 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/4707 variables, 0/3720 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 93 (OVERLAPS) 15/4722 variables, 8/3728 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/4722 variables, 4/3732 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/4722 variables, 0/3732 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 96 (OVERLAPS) 29/4751 variables, 15/3747 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/4751 variables, 3/3750 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/4751 variables, 0/3750 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 99 (OVERLAPS) 2/4753 variables, 4/3754 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/4753 variables, 2/3756 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/4753 variables, 0/3756 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 102 (OVERLAPS) 15/4768 variables, 8/3764 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/4768 variables, 3/3767 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/4768 variables, 0/3767 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 105 (OVERLAPS) 1/4769 variables, 1/3768 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/4769 variables, 1/3769 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/4769 variables, 0/3769 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 108 (OVERLAPS) 19/4788 variables, 10/3779 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/4788 variables, 3/3782 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/4788 variables, 0/3782 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 111 (OVERLAPS) 1/4789 variables, 2/3784 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/4789 variables, 1/3785 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/4789 variables, 0/3785 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 114 (OVERLAPS) 2/4791 variables, 2/3787 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/4791 variables, 1/3788 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/4791 variables, 0/3788 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 117 (OVERLAPS) 0/4791 variables, 0/3788 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4791/4791 variables, and 3788 constraints, problems are : Problem set: 0 solved, 8 unsolved in 38736 ms.
Refiners :[Positive P Invariants (semi-flows): 1101/1101 constraints, State Equation: 2600/2600 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 28/28 constraints]
After SMT, in 57100ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 13226 ms.
Support contains 68 out of 2600 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2600/2600 places, 2191/2191 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 2600 transition count 2188
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 2597 transition count 2187
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 2596 transition count 2187
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 8 place count 2596 transition count 2186
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 10 place count 2595 transition count 2186
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 13 rules applied. Total rules applied 23 place count 2588 transition count 2180
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 25 place count 2588 transition count 2178
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 25 place count 2588 transition count 2176
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 29 place count 2586 transition count 2176
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 31 place count 2585 transition count 2176
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 32 place count 2585 transition count 2176
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 35 place count 2582 transition count 2173
Applied a total of 35 rules in 460 ms. Remains 2582 /2600 variables (removed 18) and now considering 2173/2191 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 460 ms. Remains : 2582/2600 places, 2173/2191 transitions.
RANDOM walk for 40000 steps (8 resets) in 1119 ms. (35 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 632 ms. (63 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 538 ms. (74 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 567 ms. (70 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 539 ms. (74 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 564 ms. (70 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 516 ms. (77 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 539 ms. (74 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 529 ms. (75 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 65916 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :0 out of 8
Probabilistic random walk after 65916 steps, saw 60126 distinct states, run finished after 3006 ms. (steps per millisecond=21 ) properties seen :0
// Phase 1: matrix 2173 rows 2582 cols
[2024-06-01 17:10:01] [INFO ] Computed 1100 invariants in 9 ms
[2024-06-01 17:10:01] [INFO ] State equation strengthened by 49 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 306/374 variables, 123/123 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/374 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 111/485 variables, 50/173 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/485 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 575/1060 variables, 485/658 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1060 variables, 39/697 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1060 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 773/1833 variables, 422/1119 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1833 variables, 165/1284 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1833 variables, 8/1292 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1833 variables, 0/1292 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 28/1861 variables, 31/1323 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1861 variables, 28/1351 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1861 variables, 0/1351 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 50/1911 variables, 25/1376 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1911 variables, 0/1376 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 903/2814 variables, 487/1863 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2814 variables, 141/2004 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2814 variables, 0/2004 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (OVERLAPS) 59/2873 variables, 64/2068 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2873 variables, 59/2127 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2873 variables, 0/2127 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (OVERLAPS) 108/2981 variables, 54/2181 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2981 variables, 0/2181 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (OVERLAPS) 650/3631 variables, 441/2622 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3631 variables, 129/2751 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3631 variables, 0/2751 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 28 (OVERLAPS) 21/3652 variables, 31/2782 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3652 variables, 21/2803 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/3652 variables, 0/2803 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 31 (OVERLAPS) 22/3674 variables, 11/2814 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/3674 variables, 0/2814 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 33 (OVERLAPS) 371/4045 variables, 219/3033 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/4045 variables, 63/3096 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/4045 variables, 0/3096 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 36 (OVERLAPS) 19/4064 variables, 32/3128 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/4064 variables, 19/3147 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/4064 variables, 0/3147 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 39 (OVERLAPS) 12/4076 variables, 6/3153 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/4076 variables, 0/3153 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 41 (OVERLAPS) 201/4277 variables, 125/3278 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/4277 variables, 44/3322 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/4277 variables, 0/3322 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 44 (OVERLAPS) 5/4282 variables, 10/3332 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/4282 variables, 5/3337 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/4282 variables, 0/3337 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 47 (OVERLAPS) 140/4422 variables, 75/3412 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/4422 variables, 20/3432 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/4422 variables, 0/3432 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 50 (OVERLAPS) 10/4432 variables, 16/3448 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/4432 variables, 10/3458 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/4432 variables, 0/3458 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 53 (OVERLAPS) 8/4440 variables, 4/3462 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/4440 variables, 0/3462 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 55 (OVERLAPS) 80/4520 variables, 50/3512 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/4520 variables, 20/3532 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/4520 variables, 0/3532 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 58 (OVERLAPS) 96/4616 variables, 52/3584 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/4616 variables, 12/3596 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/4616 variables, 0/3596 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 61 (OVERLAPS) 7/4623 variables, 13/3609 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/4623 variables, 7/3616 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/4623 variables, 0/3616 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 64 (OVERLAPS) 2/4625 variables, 1/3617 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/4625 variables, 0/3617 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 66 (OVERLAPS) 26/4651 variables, 18/3635 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/4651 variables, 8/3643 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/4651 variables, 0/3643 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 69 (OVERLAPS) 29/4680 variables, 15/3658 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/4680 variables, 3/3661 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/4680 variables, 0/3661 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 72 (OVERLAPS) 2/4682 variables, 4/3665 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/4682 variables, 2/3667 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/4682 variables, 0/3667 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 75 (OVERLAPS) 15/4697 variables, 8/3675 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/4697 variables, 4/3679 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/4697 variables, 1/3680 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/4697 variables, 0/3680 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 79 (OVERLAPS) 26/4723 variables, 14/3694 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/4723 variables, 3/3697 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/4723 variables, 0/3697 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 82 (OVERLAPS) 2/4725 variables, 4/3701 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/4725 variables, 2/3703 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/4725 variables, 0/3703 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 85 (OVERLAPS) 10/4735 variables, 6/3709 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/4735 variables, 3/3712 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/4735 variables, 0/3712 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 88 (OVERLAPS) 16/4751 variables, 8/3720 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/4751 variables, 3/3723 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/4751 variables, 1/3724 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/4751 variables, 0/3724 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 92 (OVERLAPS) 1/4752 variables, 1/3725 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/4752 variables, 1/3726 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/4752 variables, 0/3726 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 95 (OVERLAPS) 1/4753 variables, 1/3727 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/4753 variables, 1/3728 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/4753 variables, 0/3728 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 98 (OVERLAPS) 2/4755 variables, 2/3730 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/4755 variables, 1/3731 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/4755 variables, 0/3731 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 101 (OVERLAPS) 0/4755 variables, 0/3731 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4755/4755 variables, and 3731 constraints, problems are : Problem set: 0 solved, 8 unsolved in 18031 ms.
Refiners :[Positive P Invariants (semi-flows): 1100/1100 constraints, State Equation: 2582/2582 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 306/374 variables, 123/123 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 17:10:19] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/374 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/374 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 111/485 variables, 50/174 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 17:10:19] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2024-06-01 17:10:19] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
[2024-06-01 17:10:20] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/485 variables, 3/177 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 575/1060 variables, 485/662 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1060 variables, 39/701 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 17:10:20] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 2 ms to minimize.
[2024-06-01 17:10:20] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1060 variables, 2/703 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1060 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 773/1833 variables, 422/1125 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1833 variables, 165/1290 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1833 variables, 8/1298 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1833 variables, 8/1306 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 17:10:21] [INFO ] Deduced a trap composed of 3 places in 165 ms of which 3 ms to minimize.
[2024-06-01 17:10:21] [INFO ] Deduced a trap composed of 3 places in 159 ms of which 3 ms to minimize.
[2024-06-01 17:10:21] [INFO ] Deduced a trap composed of 5 places in 159 ms of which 3 ms to minimize.
[2024-06-01 17:10:21] [INFO ] Deduced a trap composed of 5 places in 159 ms of which 3 ms to minimize.
[2024-06-01 17:10:21] [INFO ] Deduced a trap composed of 5 places in 157 ms of which 3 ms to minimize.
[2024-06-01 17:10:22] [INFO ] Deduced a trap composed of 3 places in 154 ms of which 3 ms to minimize.
[2024-06-01 17:10:22] [INFO ] Deduced a trap composed of 6 places in 159 ms of which 3 ms to minimize.
[2024-06-01 17:10:22] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 4 ms to minimize.
[2024-06-01 17:10:22] [INFO ] Deduced a trap composed of 9 places in 156 ms of which 3 ms to minimize.
[2024-06-01 17:10:22] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 3 ms to minimize.
[2024-06-01 17:10:23] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 3 ms to minimize.
[2024-06-01 17:10:23] [INFO ] Deduced a trap composed of 5 places in 138 ms of which 3 ms to minimize.
[2024-06-01 17:10:23] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1833 variables, 13/1319 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 17:10:23] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1833 variables, 1/1320 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1833 variables, 0/1320 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (OVERLAPS) 28/1861 variables, 31/1351 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1861 variables, 28/1379 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 17:10:24] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 2 ms to minimize.
[2024-06-01 17:10:25] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 2 ms to minimize.
[2024-06-01 17:10:25] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1861 variables, 3/1382 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1861 variables, 0/1382 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (OVERLAPS) 50/1911 variables, 25/1407 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1911 variables, 0/1407 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (OVERLAPS) 903/2814 variables, 487/1894 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2814 variables, 141/2035 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 17:10:26] [INFO ] Deduced a trap composed of 10 places in 176 ms of which 3 ms to minimize.
[2024-06-01 17:10:26] [INFO ] Deduced a trap composed of 7 places in 171 ms of which 4 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/2814 variables, 2/2037 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 17:10:27] [INFO ] Deduced a trap composed of 8 places in 179 ms of which 4 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/2814 variables, 1/2038 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2814 variables, 0/2038 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 29 (OVERLAPS) 59/2873 variables, 64/2102 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2873 variables, 59/2161 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2873 variables, 0/2161 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 32 (OVERLAPS) 108/2981 variables, 54/2215 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 17:10:29] [INFO ] Deduced a trap composed of 7 places in 200 ms of which 4 ms to minimize.
[2024-06-01 17:10:29] [INFO ] Deduced a trap composed of 6 places in 208 ms of which 4 ms to minimize.
[2024-06-01 17:10:29] [INFO ] Deduced a trap composed of 5 places in 199 ms of which 4 ms to minimize.
At refinement iteration 33 (INCLUDED_ONLY) 0/2981 variables, 3/2218 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2981 variables, 0/2218 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 35 (OVERLAPS) 650/3631 variables, 441/2659 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/3631 variables, 129/2788 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/3631 variables, 0/2788 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 38 (OVERLAPS) 21/3652 variables, 31/2819 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/3652 variables, 21/2840 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/3652 variables, 0/2840 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 41 (OVERLAPS) 22/3674 variables, 11/2851 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/3674 variables, 0/2851 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 43 (OVERLAPS) 371/4045 variables, 219/3070 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/4045 variables, 63/3133 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/4045 variables, 0/3133 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 46 (OVERLAPS) 19/4064 variables, 32/3165 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/4064 variables, 19/3184 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/4064 variables, 0/3184 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 49 (OVERLAPS) 12/4076 variables, 6/3190 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/4076 variables, 0/3190 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 51 (OVERLAPS) 201/4277 variables, 125/3315 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/4277 variables, 44/3359 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/4277 variables, 0/3359 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 54 (OVERLAPS) 5/4282 variables, 10/3369 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/4282 variables, 5/3374 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/4282 variables, 0/3374 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 57 (OVERLAPS) 140/4422 variables, 75/3449 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/4422 variables, 20/3469 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/4422 variables, 0/3469 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 60 (OVERLAPS) 10/4432 variables, 16/3485 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/4432 variables, 10/3495 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/4432 variables, 0/3495 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 63 (OVERLAPS) 8/4440 variables, 4/3499 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/4440 variables, 0/3499 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 65 (OVERLAPS) 80/4520 variables, 50/3549 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/4520 variables, 20/3569 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/4520 variables, 0/3569 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 68 (OVERLAPS) 96/4616 variables, 52/3621 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/4616 variables, 12/3633 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/4616 variables, 0/3633 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 71 (OVERLAPS) 7/4623 variables, 13/3646 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/4623 variables, 7/3653 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/4623 variables, 0/3653 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 74 (OVERLAPS) 2/4625 variables, 1/3654 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/4625 variables, 0/3654 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 76 (OVERLAPS) 26/4651 variables, 18/3672 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/4651 variables, 8/3680 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 17:10:43] [INFO ] Deduced a trap composed of 5 places in 340 ms of which 6 ms to minimize.
At refinement iteration 78 (INCLUDED_ONLY) 0/4651 variables, 1/3681 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/4651 variables, 0/3681 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 80 (OVERLAPS) 29/4680 variables, 15/3696 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/4680 variables, 3/3699 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/4680 variables, 0/3699 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 83 (OVERLAPS) 2/4682 variables, 4/3703 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/4682 variables, 2/3705 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/4682 variables, 0/3705 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 86 (OVERLAPS) 15/4697 variables, 8/3713 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/4697 variables, 4/3717 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/4697 variables, 1/3718 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/4697 variables, 0/3718 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 90 (OVERLAPS) 26/4723 variables, 14/3732 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/4723 variables, 3/3735 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/4723 variables, 0/3735 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 93 (OVERLAPS) 2/4725 variables, 4/3739 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/4725 variables, 2/3741 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/4725 variables, 0/3741 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 96 (OVERLAPS) 10/4735 variables, 6/3747 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/4735 variables, 3/3750 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/4735 variables, 0/3750 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 99 (OVERLAPS) 16/4751 variables, 8/3758 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/4751 variables, 3/3761 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/4751 variables, 1/3762 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/4751 variables, 0/3762 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 103 (OVERLAPS) 1/4752 variables, 1/3763 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/4752 variables, 1/3764 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/4752 variables, 0/3764 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 106 (OVERLAPS) 1/4753 variables, 1/3765 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/4753 variables, 1/3766 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/4753 variables, 0/3766 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 109 (OVERLAPS) 2/4755 variables, 2/3768 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/4755 variables, 1/3769 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/4755 variables, 0/3769 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 112 (OVERLAPS) 0/4755 variables, 0/3769 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4755/4755 variables, and 3769 constraints, problems are : Problem set: 0 solved, 8 unsolved in 35466 ms.
Refiners :[Positive P Invariants (semi-flows): 1100/1100 constraints, State Equation: 2582/2582 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 30/30 constraints]
After SMT, in 53535ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 14619 ms.
Support contains 68 out of 2582 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2582/2582 places, 2173/2173 transitions.
Applied a total of 0 rules in 98 ms. Remains 2582 /2582 variables (removed 0) and now considering 2173/2173 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 2582/2582 places, 2173/2173 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2582/2582 places, 2173/2173 transitions.
Applied a total of 0 rules in 86 ms. Remains 2582 /2582 variables (removed 0) and now considering 2173/2173 (removed 0) transitions.
[2024-06-01 17:11:09] [INFO ] Invariant cache hit.
[2024-06-01 17:11:11] [INFO ] Implicit Places using invariants in 1512 ms returned [2565, 2569]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1524 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2580/2582 places, 2173/2173 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2578 transition count 2171
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2578 transition count 2171
Applied a total of 4 rules in 156 ms. Remains 2578 /2580 variables (removed 2) and now considering 2171/2173 (removed 2) transitions.
// Phase 1: matrix 2171 rows 2578 cols
[2024-06-01 17:11:11] [INFO ] Computed 1098 invariants in 11 ms
[2024-06-01 17:11:12] [INFO ] Implicit Places using invariants in 1451 ms returned []
[2024-06-01 17:11:12] [INFO ] Invariant cache hit.
[2024-06-01 17:11:14] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-06-01 17:11:17] [INFO ] Implicit Places using invariants and state equation in 4527 ms returned []
Implicit Place search using SMT with State Equation took 5980 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2578/2582 places, 2171/2173 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 7747 ms. Remains : 2578/2582 places, 2171/2173 transitions.
RANDOM walk for 40000 steps (8 resets) in 747 ms. (53 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 535 ms. (74 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 566 ms. (70 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 564 ms. (70 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 535 ms. (74 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 580 ms. (68 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 512 ms. (77 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 501 ms. (79 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 538 ms. (74 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 67972 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :0 out of 8
Probabilistic random walk after 67972 steps, saw 61710 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
[2024-06-01 17:11:21] [INFO ] Invariant cache hit.
[2024-06-01 17:11:21] [INFO ] State equation strengthened by 47 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 306/374 variables, 123/123 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/374 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 111/485 variables, 50/173 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/485 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 575/1060 variables, 485/658 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1060 variables, 39/697 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1060 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 773/1833 variables, 422/1119 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1833 variables, 165/1284 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1833 variables, 8/1292 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1833 variables, 0/1292 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 28/1861 variables, 31/1323 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1861 variables, 28/1351 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1861 variables, 0/1351 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 50/1911 variables, 25/1376 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1911 variables, 0/1376 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 903/2814 variables, 487/1863 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2814 variables, 141/2004 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2814 variables, 0/2004 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (OVERLAPS) 59/2873 variables, 64/2068 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2873 variables, 59/2127 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2873 variables, 0/2127 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (OVERLAPS) 108/2981 variables, 54/2181 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2981 variables, 0/2181 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (OVERLAPS) 650/3631 variables, 441/2622 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3631 variables, 129/2751 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3631 variables, 0/2751 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 28 (OVERLAPS) 21/3652 variables, 31/2782 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3652 variables, 21/2803 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/3652 variables, 0/2803 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 31 (OVERLAPS) 22/3674 variables, 11/2814 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/3674 variables, 0/2814 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 33 (OVERLAPS) 371/4045 variables, 219/3033 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/4045 variables, 63/3096 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/4045 variables, 0/3096 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 36 (OVERLAPS) 19/4064 variables, 32/3128 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/4064 variables, 19/3147 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/4064 variables, 0/3147 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 39 (OVERLAPS) 12/4076 variables, 6/3153 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/4076 variables, 0/3153 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 41 (OVERLAPS) 201/4277 variables, 125/3278 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/4277 variables, 44/3322 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/4277 variables, 0/3322 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 44 (OVERLAPS) 5/4282 variables, 10/3332 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/4282 variables, 5/3337 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/4282 variables, 0/3337 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 47 (OVERLAPS) 140/4422 variables, 75/3412 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/4422 variables, 20/3432 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/4422 variables, 0/3432 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 50 (OVERLAPS) 10/4432 variables, 16/3448 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/4432 variables, 10/3458 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/4432 variables, 0/3458 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 53 (OVERLAPS) 8/4440 variables, 4/3462 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/4440 variables, 0/3462 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 55 (OVERLAPS) 80/4520 variables, 50/3512 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/4520 variables, 20/3532 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/4520 variables, 0/3532 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 58 (OVERLAPS) 96/4616 variables, 52/3584 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/4616 variables, 12/3596 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/4616 variables, 0/3596 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 61 (OVERLAPS) 7/4623 variables, 13/3609 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/4623 variables, 7/3616 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/4623 variables, 0/3616 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 64 (OVERLAPS) 2/4625 variables, 1/3617 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/4625 variables, 0/3617 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 66 (OVERLAPS) 26/4651 variables, 18/3635 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/4651 variables, 8/3643 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/4651 variables, 0/3643 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 69 (OVERLAPS) 29/4680 variables, 15/3658 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/4680 variables, 3/3661 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/4680 variables, 0/3661 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 72 (OVERLAPS) 2/4682 variables, 4/3665 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/4682 variables, 2/3667 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/4682 variables, 0/3667 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 75 (OVERLAPS) 14/4696 variables, 8/3675 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/4696 variables, 4/3679 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/4696 variables, 0/3679 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 78 (OVERLAPS) 24/4720 variables, 12/3691 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/4720 variables, 2/3693 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/4720 variables, 0/3693 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 81 (OVERLAPS) 2/4722 variables, 4/3697 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/4722 variables, 2/3699 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/4722 variables, 0/3699 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 84 (OVERLAPS) 10/4732 variables, 6/3705 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/4732 variables, 3/3708 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/4732 variables, 0/3708 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 87 (OVERLAPS) 15/4747 variables, 8/3716 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/4747 variables, 4/3720 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/4747 variables, 0/3720 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 90 (OVERLAPS) 2/4749 variables, 2/3722 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/4749 variables, 1/3723 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/4749 variables, 0/3723 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 93 (OVERLAPS) 0/4749 variables, 0/3723 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4749/4749 variables, and 3723 constraints, problems are : Problem set: 0 solved, 8 unsolved in 17568 ms.
Refiners :[Positive P Invariants (semi-flows): 1098/1098 constraints, State Equation: 2578/2578 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 306/374 variables, 123/123 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 17:11:39] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/374 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/374 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 111/485 variables, 50/174 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 17:11:39] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-06-01 17:11:39] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/485 variables, 2/176 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 575/1060 variables, 485/661 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1060 variables, 39/700 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 17:11:40] [INFO ] Deduced a trap composed of 6 places in 81 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1060 variables, 1/701 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1060 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 773/1833 variables, 422/1123 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1833 variables, 165/1288 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1833 variables, 8/1296 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1833 variables, 8/1304 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 17:11:40] [INFO ] Deduced a trap composed of 4 places in 180 ms of which 4 ms to minimize.
[2024-06-01 17:11:41] [INFO ] Deduced a trap composed of 3 places in 160 ms of which 3 ms to minimize.
[2024-06-01 17:11:41] [INFO ] Deduced a trap composed of 6 places in 154 ms of which 3 ms to minimize.
[2024-06-01 17:11:41] [INFO ] Deduced a trap composed of 6 places in 151 ms of which 3 ms to minimize.
[2024-06-01 17:11:41] [INFO ] Deduced a trap composed of 5 places in 152 ms of which 3 ms to minimize.
[2024-06-01 17:11:41] [INFO ] Deduced a trap composed of 5 places in 146 ms of which 3 ms to minimize.
[2024-06-01 17:11:42] [INFO ] Deduced a trap composed of 3 places in 152 ms of which 3 ms to minimize.
[2024-06-01 17:11:42] [INFO ] Deduced a trap composed of 3 places in 147 ms of which 3 ms to minimize.
[2024-06-01 17:11:42] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 3 ms to minimize.
[2024-06-01 17:11:42] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1833 variables, 10/1314 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1833 variables, 0/1314 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 28/1861 variables, 31/1345 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1861 variables, 28/1373 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1861 variables, 0/1373 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (OVERLAPS) 50/1911 variables, 25/1398 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1911 variables, 0/1398 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (OVERLAPS) 903/2814 variables, 487/1885 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2814 variables, 141/2026 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 17:11:44] [INFO ] Deduced a trap composed of 6 places in 189 ms of which 3 ms to minimize.
[2024-06-01 17:11:44] [INFO ] Deduced a trap composed of 5 places in 192 ms of which 4 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/2814 variables, 2/2028 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2814 variables, 0/2028 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 26 (OVERLAPS) 59/2873 variables, 64/2092 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2873 variables, 59/2151 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2873 variables, 0/2151 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 29 (OVERLAPS) 108/2981 variables, 54/2205 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 17:11:46] [INFO ] Deduced a trap composed of 5 places in 213 ms of which 4 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/2981 variables, 1/2206 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2981 variables, 0/2206 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 32 (OVERLAPS) 650/3631 variables, 441/2647 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/3631 variables, 129/2776 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 17:11:48] [INFO ] Deduced a trap composed of 5 places in 251 ms of which 5 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/3631 variables, 1/2777 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/3631 variables, 0/2777 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 36 (OVERLAPS) 21/3652 variables, 31/2808 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/3652 variables, 21/2829 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/3652 variables, 0/2829 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 39 (OVERLAPS) 22/3674 variables, 11/2840 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/3674 variables, 0/2840 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 41 (OVERLAPS) 371/4045 variables, 219/3059 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/4045 variables, 63/3122 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 17:11:51] [INFO ] Deduced a trap composed of 5 places in 267 ms of which 5 ms to minimize.
At refinement iteration 43 (INCLUDED_ONLY) 0/4045 variables, 1/3123 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 17:11:52] [INFO ] Deduced a trap composed of 4 places in 274 ms of which 5 ms to minimize.
At refinement iteration 44 (INCLUDED_ONLY) 0/4045 variables, 1/3124 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/4045 variables, 0/3124 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 46 (OVERLAPS) 19/4064 variables, 32/3156 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/4064 variables, 19/3175 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/4064 variables, 0/3175 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 49 (OVERLAPS) 12/4076 variables, 6/3181 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/4076 variables, 0/3181 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 51 (OVERLAPS) 201/4277 variables, 125/3306 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/4277 variables, 44/3350 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 17:11:55] [INFO ] Deduced a trap composed of 5 places in 269 ms of which 5 ms to minimize.
[2024-06-01 17:11:55] [INFO ] Deduced a trap composed of 5 places in 255 ms of which 5 ms to minimize.
At refinement iteration 53 (INCLUDED_ONLY) 0/4277 variables, 2/3352 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 17:11:56] [INFO ] Deduced a trap composed of 5 places in 269 ms of which 5 ms to minimize.
At refinement iteration 54 (INCLUDED_ONLY) 0/4277 variables, 1/3353 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/4277 variables, 0/3353 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 56 (OVERLAPS) 5/4282 variables, 10/3363 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/4282 variables, 5/3368 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/4282 variables, 0/3368 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 59 (OVERLAPS) 140/4422 variables, 75/3443 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/4422 variables, 20/3463 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/4422 variables, 0/3463 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 62 (OVERLAPS) 10/4432 variables, 16/3479 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/4432 variables, 10/3489 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/4432 variables, 0/3489 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 65 (OVERLAPS) 8/4440 variables, 4/3493 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 17:12:01] [INFO ] Deduced a trap composed of 5 places in 288 ms of which 5 ms to minimize.
At refinement iteration 66 (INCLUDED_ONLY) 0/4440 variables, 1/3494 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/4440 variables, 0/3494 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 68 (OVERLAPS) 80/4520 variables, 50/3544 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/4520 variables, 20/3564 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/4520 variables, 0/3564 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 71 (OVERLAPS) 96/4616 variables, 52/3616 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/4616 variables, 12/3628 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/4616 variables, 0/3628 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 74 (OVERLAPS) 7/4623 variables, 13/3641 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/4623 variables, 7/3648 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/4623 variables, 0/3648 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 77 (OVERLAPS) 2/4625 variables, 1/3649 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/4625 variables, 0/3649 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 79 (OVERLAPS) 26/4651 variables, 18/3667 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/4651 variables, 8/3675 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/4651 variables, 0/3675 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 82 (OVERLAPS) 29/4680 variables, 15/3690 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/4680 variables, 3/3693 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/4680 variables, 0/3693 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 85 (OVERLAPS) 2/4682 variables, 4/3697 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/4682 variables, 2/3699 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/4682 variables, 0/3699 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 88 (OVERLAPS) 14/4696 variables, 8/3707 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/4696 variables, 4/3711 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/4696 variables, 0/3711 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 91 (OVERLAPS) 24/4720 variables, 12/3723 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/4720 variables, 2/3725 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/4720 variables, 0/3725 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 94 (OVERLAPS) 2/4722 variables, 4/3729 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/4722 variables, 2/3731 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/4722 variables, 0/3731 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 97 (OVERLAPS) 10/4732 variables, 6/3737 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/4732 variables, 3/3740 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/4732 variables, 0/3740 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 100 (OVERLAPS) 15/4747 variables, 8/3748 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/4747 variables, 4/3752 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/4747 variables, 0/3752 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 103 (OVERLAPS) 2/4749 variables, 2/3754 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/4749 variables, 1/3755 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/4749 variables, 0/3755 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 106 (OVERLAPS) 0/4749 variables, 0/3755 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4749/4749 variables, and 3755 constraints, problems are : Problem set: 0 solved, 8 unsolved in 35096 ms.
Refiners :[Positive P Invariants (semi-flows): 1098/1098 constraints, State Equation: 2578/2578 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 24/24 constraints]
After SMT, in 52695ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 17405 ms.
Support contains 68 out of 2578 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2578/2578 places, 2171/2171 transitions.
Applied a total of 0 rules in 108 ms. Remains 2578 /2578 variables (removed 0) and now considering 2171/2171 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 2578/2578 places, 2171/2171 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2578/2578 places, 2171/2171 transitions.
Applied a total of 0 rules in 88 ms. Remains 2578 /2578 variables (removed 0) and now considering 2171/2171 (removed 0) transitions.
[2024-06-01 17:12:32] [INFO ] Invariant cache hit.
[2024-06-01 17:12:33] [INFO ] Implicit Places using invariants in 1431 ms returned []
[2024-06-01 17:12:33] [INFO ] Invariant cache hit.
[2024-06-01 17:12:34] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-06-01 17:12:38] [INFO ] Implicit Places using invariants and state equation in 4608 ms returned []
Implicit Place search using SMT with State Equation took 6040 ms to find 0 implicit places.
[2024-06-01 17:12:38] [INFO ] Redundant transitions in 107 ms returned []
Running 2149 sub problems to find dead transitions.
[2024-06-01 17:12:38] [INFO ] Invariant cache hit.
[2024-06-01 17:12:38] [INFO ] State equation strengthened by 47 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/2558 variables, 985/985 constraints. Problems are: Problem set: 0 solved, 2149 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2558/4749 variables, and 985 constraints, problems are : Problem set: 0 solved, 2149 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 985/1098 constraints, State Equation: 0/2578 constraints, ReadFeed: 0/47 constraints, PredecessorRefiner: 2149/2149 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2149 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2558 variables, 985/985 constraints. Problems are: Problem set: 0 solved, 2149 unsolved
[2024-06-01 17:13:14] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2024-06-01 17:13:14] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
[2024-06-01 17:13:14] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
[2024-06-01 17:13:15] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 0 ms to minimize.
[2024-06-01 17:13:15] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2024-06-01 17:13:15] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
[2024-06-01 17:13:15] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
[2024-06-01 17:13:15] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 0 ms to minimize.
[2024-06-01 17:13:16] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 0 ms to minimize.
[2024-06-01 17:13:16] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 0 ms to minimize.
[2024-06-01 17:13:16] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 1 ms to minimize.
[2024-06-01 17:13:16] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 0 ms to minimize.
[2024-06-01 17:13:16] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2024-06-01 17:13:17] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
[2024-06-01 17:13:17] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 0 ms to minimize.
[2024-06-01 17:13:17] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 1 ms to minimize.
[2024-06-01 17:13:18] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 1 ms to minimize.
[2024-06-01 17:13:18] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
[2024-06-01 17:13:19] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 1 ms to minimize.
[2024-06-01 17:13:19] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/2558 variables, 20/1005 constraints. Problems are: Problem set: 0 solved, 2149 unsolved
[2024-06-01 17:13:24] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 0 ms to minimize.
[2024-06-01 17:13:26] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 1 ms to minimize.
[2024-06-01 17:13:27] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 1 ms to minimize.
[2024-06-01 17:13:28] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 1 ms to minimize.
[2024-06-01 17:13:28] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 1 ms to minimize.
[2024-06-01 17:13:28] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
[2024-06-01 17:13:29] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 2 ms to minimize.
[2024-06-01 17:13:29] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 1 ms to minimize.
[2024-06-01 17:13:29] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2024-06-01 17:13:29] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 1 ms to minimize.
[2024-06-01 17:13:30] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 1 ms to minimize.
[2024-06-01 17:13:30] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 2 ms to minimize.
[2024-06-01 17:13:30] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 1 ms to minimize.
[2024-06-01 17:13:30] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 2 ms to minimize.
[2024-06-01 17:13:31] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 2 ms to minimize.
[2024-06-01 17:13:31] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 2 ms to minimize.
[2024-06-01 17:13:31] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 2 ms to minimize.
[2024-06-01 17:13:31] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 1 ms to minimize.
[2024-06-01 17:13:32] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 2 ms to minimize.
[2024-06-01 17:13:32] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2558 variables, 20/1025 constraints. Problems are: Problem set: 0 solved, 2149 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2558/4749 variables, and 1025 constraints, problems are : Problem set: 0 solved, 2149 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 985/1098 constraints, State Equation: 0/2578 constraints, ReadFeed: 0/47 constraints, PredecessorRefiner: 0/2149 constraints, Known Traps: 40/40 constraints]
After SMT, in 60831ms problems are : Problem set: 0 solved, 2149 unsolved
Search for dead transitions found 0 dead transitions in 60853ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67108 ms. Remains : 2578/2578 places, 2171/2171 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 569 times.
Drop transitions (Partial Free agglomeration) removed 569 transitions
Iterating global reduction 0 with 569 rules applied. Total rules applied 569 place count 2578 transition count 2171
Applied a total of 569 rules in 191 ms. Remains 2578 /2578 variables (removed 0) and now considering 2171/2171 (removed 0) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 2171 rows 2578 cols
[2024-06-01 17:13:39] [INFO ] Computed 1098 invariants in 5 ms
[2024-06-01 17:13:40] [INFO ] [Real]Absence check using 1098 positive place invariants in 179 ms returned sat
[2024-06-01 17:13:40] [INFO ] After 815ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-06-01 17:13:40] [INFO ] [Nat]Absence check using 1098 positive place invariants in 172 ms returned sat
[2024-06-01 17:13:42] [INFO ] After 1558ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-06-01 17:13:42] [INFO ] State equation strengthened by 533 read => feed constraints.
[2024-06-01 17:13:44] [INFO ] After 1378ms SMT Verify possible using 533 Read/Feed constraints in natural domain returned unsat :0 sat :8
TRAPS : Iteration 0
[2024-06-01 17:13:44] [INFO ] Deduced a trap composed of 5 places in 526 ms of which 8 ms to minimize.
[2024-06-01 17:13:45] [INFO ] Deduced a trap composed of 5 places in 516 ms of which 8 ms to minimize.
[2024-06-01 17:13:45] [INFO ] Deduced a trap composed of 6 places in 504 ms of which 8 ms to minimize.
[2024-06-01 17:13:46] [INFO ] Deduced a trap composed of 5 places in 500 ms of which 7 ms to minimize.
[2024-06-01 17:13:47] [INFO ] Deduced a trap composed of 5 places in 503 ms of which 7 ms to minimize.
[2024-06-01 17:13:47] [INFO ] Deduced a trap composed of 5 places in 490 ms of which 7 ms to minimize.
[2024-06-01 17:13:48] [INFO ] Deduced a trap composed of 5 places in 495 ms of which 7 ms to minimize.
[2024-06-01 17:13:48] [INFO ] Deduced a trap composed of 6 places in 498 ms of which 8 ms to minimize.
[2024-06-01 17:13:49] [INFO ] Deduced a trap composed of 7 places in 481 ms of which 8 ms to minimize.
[2024-06-01 17:13:50] [INFO ] Deduced a trap composed of 4 places in 482 ms of which 8 ms to minimize.
[2024-06-01 17:13:50] [INFO ] Deduced a trap composed of 6 places in 493 ms of which 8 ms to minimize.
[2024-06-01 17:13:51] [INFO ] Deduced a trap composed of 5 places in 465 ms of which 8 ms to minimize.
[2024-06-01 17:13:51] [INFO ] Deduced a trap composed of 5 places in 490 ms of which 8 ms to minimize.
[2024-06-01 17:13:52] [INFO ] Deduced a trap composed of 5 places in 491 ms of which 7 ms to minimize.
[2024-06-01 17:13:52] [INFO ] Deduced a trap composed of 5 places in 484 ms of which 8 ms to minimize.
[2024-06-01 17:13:53] [INFO ] Deduced a trap composed of 6 places in 481 ms of which 7 ms to minimize.
[2024-06-01 17:13:54] [INFO ] Deduced a trap composed of 5 places in 445 ms of which 7 ms to minimize.
[2024-06-01 17:13:54] [INFO ] Deduced a trap composed of 7 places in 424 ms of which 7 ms to minimize.
[2024-06-01 17:13:55] [INFO ] Deduced a trap composed of 5 places in 472 ms of which 7 ms to minimize.
[2024-06-01 17:13:55] [INFO ] Deduced a trap composed of 6 places in 460 ms of which 8 ms to minimize.
[2024-06-01 17:13:56] [INFO ] Deduced a trap composed of 5 places in 465 ms of which 7 ms to minimize.
[2024-06-01 17:13:56] [INFO ] Deduced a trap composed of 5 places in 465 ms of which 7 ms to minimize.
[2024-06-01 17:13:57] [INFO ] Deduced a trap composed of 7 places in 432 ms of which 8 ms to minimize.
[2024-06-01 17:13:57] [INFO ] Deduced a trap composed of 7 places in 450 ms of which 7 ms to minimize.
[2024-06-01 17:13:58] [INFO ] Deduced a trap composed of 7 places in 415 ms of which 7 ms to minimize.
[2024-06-01 17:13:58] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 14355 ms
[2024-06-01 17:13:59] [INFO ] Deduced a trap composed of 5 places in 409 ms of which 7 ms to minimize.
[2024-06-01 17:13:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 580 ms
[2024-06-01 17:13:59] [INFO ] Deduced a trap composed of 3 places in 444 ms of which 7 ms to minimize.
[2024-06-01 17:14:00] [INFO ] Deduced a trap composed of 3 places in 458 ms of which 7 ms to minimize.
[2024-06-01 17:14:01] [INFO ] Deduced a trap composed of 5 places in 446 ms of which 7 ms to minimize.
[2024-06-01 17:14:01] [INFO ] Deduced a trap composed of 5 places in 453 ms of which 7 ms to minimize.
[2024-06-01 17:14:02] [INFO ] Deduced a trap composed of 5 places in 440 ms of which 7 ms to minimize.
[2024-06-01 17:14:02] [INFO ] Deduced a trap composed of 5 places in 439 ms of which 7 ms to minimize.
[2024-06-01 17:14:02] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3366 ms
[2024-06-01 17:14:03] [INFO ] Deduced a trap composed of 8 places in 414 ms of which 7 ms to minimize.
[2024-06-01 17:14:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 582 ms
[2024-06-01 17:14:04] [INFO ] Deduced a trap composed of 6 places in 456 ms of which 7 ms to minimize.
[2024-06-01 17:14:04] [INFO ] Deduced a trap composed of 7 places in 445 ms of which 7 ms to minimize.
[2024-06-01 17:14:05] [INFO ] Deduced a trap composed of 9 places in 431 ms of which 7 ms to minimize.
[2024-06-01 17:14:05] [INFO ] Deduced a trap composed of 6 places in 440 ms of which 7 ms to minimize.
[2024-06-01 17:14:05] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2222 ms
[2024-06-01 17:14:06] [INFO ] Deduced a trap composed of 3 places in 443 ms of which 8 ms to minimize.
[2024-06-01 17:14:07] [INFO ] Deduced a trap composed of 5 places in 451 ms of which 7 ms to minimize.
[2024-06-01 17:14:07] [INFO ] Deduced a trap composed of 7 places in 449 ms of which 7 ms to minimize.
[2024-06-01 17:14:08] [INFO ] Deduced a trap composed of 9 places in 446 ms of which 7 ms to minimize.
[2024-06-01 17:14:08] [INFO ] Deduced a trap composed of 5 places in 451 ms of which 8 ms to minimize.
[2024-06-01 17:14:09] [INFO ] Deduced a trap composed of 5 places in 446 ms of which 7 ms to minimize.
[2024-06-01 17:14:09] [INFO ] Deduced a trap composed of 6 places in 446 ms of which 8 ms to minimize.
[2024-06-01 17:14:10] [INFO ] Deduced a trap composed of 6 places in 415 ms of which 7 ms to minimize.
[2024-06-01 17:14:11] [INFO ] Deduced a trap composed of 5 places in 458 ms of which 7 ms to minimize.
[2024-06-01 17:14:11] [INFO ] Deduced a trap composed of 3 places in 523 ms of which 8 ms to minimize.
[2024-06-01 17:14:12] [INFO ] Deduced a trap composed of 5 places in 530 ms of which 8 ms to minimize.
[2024-06-01 17:14:12] [INFO ] Deduced a trap composed of 9 places in 531 ms of which 7 ms to minimize.
[2024-06-01 17:14:13] [INFO ] Deduced a trap composed of 5 places in 536 ms of which 8 ms to minimize.
[2024-06-01 17:14:14] [INFO ] Deduced a trap composed of 6 places in 523 ms of which 8 ms to minimize.
[2024-06-01 17:14:14] [INFO ] Deduced a trap composed of 5 places in 509 ms of which 8 ms to minimize.
[2024-06-01 17:14:15] [INFO ] Deduced a trap composed of 8 places in 507 ms of which 7 ms to minimize.
[2024-06-01 17:14:15] [INFO ] Deduced a trap composed of 7 places in 509 ms of which 7 ms to minimize.
[2024-06-01 17:14:16] [INFO ] Deduced a trap composed of 7 places in 494 ms of which 8 ms to minimize.
[2024-06-01 17:14:17] [INFO ] Deduced a trap composed of 6 places in 488 ms of which 7 ms to minimize.
[2024-06-01 17:14:17] [INFO ] Deduced a trap composed of 10 places in 460 ms of which 7 ms to minimize.
[2024-06-01 17:14:18] [INFO ] Deduced a trap composed of 9 places in 493 ms of which 7 ms to minimize.
[2024-06-01 17:14:18] [INFO ] Deduced a trap composed of 8 places in 483 ms of which 7 ms to minimize.
[2024-06-01 17:14:19] [INFO ] Deduced a trap composed of 5 places in 466 ms of which 7 ms to minimize.
[2024-06-01 17:14:20] [INFO ] Deduced a trap composed of 9 places in 479 ms of which 8 ms to minimize.
[2024-06-01 17:14:20] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 13911 ms
TRAPS : Iteration 1
[2024-06-01 17:14:20] [INFO ] Deduced a trap composed of 11 places in 474 ms of which 7 ms to minimize.
[2024-06-01 17:14:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 642 ms
[2024-06-01 17:14:21] [INFO ] Deduced a trap composed of 7 places in 462 ms of which 8 ms to minimize.
[2024-06-01 17:14:22] [INFO ] Deduced a trap composed of 6 places in 462 ms of which 7 ms to minimize.
[2024-06-01 17:14:22] [INFO ] Deduced a trap composed of 3 places in 452 ms of which 8 ms to minimize.
[2024-06-01 17:14:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1731 ms
[2024-06-01 17:14:23] [INFO ] Deduced a trap composed of 6 places in 433 ms of which 7 ms to minimize.
[2024-06-01 17:14:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 599 ms
[2024-06-01 17:14:24] [INFO ] Deduced a trap composed of 6 places in 430 ms of which 6 ms to minimize.
[2024-06-01 17:14:24] [INFO ] Deduced a trap composed of 5 places in 423 ms of which 7 ms to minimize.
[2024-06-01 17:14:25] [INFO ] Deduced a trap composed of 8 places in 432 ms of which 8 ms to minimize.
[2024-06-01 17:14:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1639 ms
TRAPS : Iteration 2
[2024-06-01 17:14:26] [INFO ] Deduced a trap composed of 3 places in 429 ms of which 7 ms to minimize.
[2024-06-01 17:14:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 598 ms
[2024-06-01 17:14:27] [INFO ] Deduced a trap composed of 7 places in 439 ms of which 7 ms to minimize.
[2024-06-01 17:14:27] [INFO ] Deduced a trap composed of 5 places in 439 ms of which 7 ms to minimize.
[2024-06-01 17:14:28] [INFO ] Deduced a trap composed of 6 places in 429 ms of which 7 ms to minimize.
[2024-06-01 17:14:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1653 ms
[2024-06-01 17:14:28] [INFO ] Deduced a trap composed of 7 places in 436 ms of which 7 ms to minimize.
[2024-06-01 17:14:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 609 ms
[2024-06-01 17:14:29] [INFO ] Deduced a trap composed of 6 places in 465 ms of which 7 ms to minimize.
[2024-06-01 17:14:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 643 ms
[2024-06-01 17:14:30] [INFO ] Deduced a trap composed of 6 places in 457 ms of which 7 ms to minimize.
[2024-06-01 17:14:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 634 ms
TRAPS : Iteration 3
[2024-06-01 17:14:31] [INFO ] Deduced a trap composed of 6 places in 451 ms of which 7 ms to minimize.
[2024-06-01 17:14:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 629 ms
[2024-06-01 17:14:32] [INFO ] Deduced a trap composed of 6 places in 441 ms of which 7 ms to minimize.
[2024-06-01 17:14:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 619 ms
TRAPS : Iteration 4
[2024-06-01 17:14:34] [INFO ] Deduced a trap composed of 12 places in 428 ms of which 7 ms to minimize.
[2024-06-01 17:14:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 597 ms
[2024-06-01 17:14:35] [INFO ] Deduced a trap composed of 8 places in 732 ms of which 10 ms to minimize.
[2024-06-01 17:14:36] [INFO ] Deduced a trap composed of 4 places in 752 ms of which 10 ms to minimize.
[2024-06-01 17:14:37] [INFO ] Deduced a trap composed of 7 places in 663 ms of which 9 ms to minimize.
[2024-06-01 17:14:38] [INFO ] Deduced a trap composed of 13 places in 655 ms of which 10 ms to minimize.
[2024-06-01 17:14:38] [INFO ] Deduced a trap composed of 12 places in 653 ms of which 9 ms to minimize.
[2024-06-01 17:14:39] [INFO ] Deduced a trap composed of 5 places in 638 ms of which 8 ms to minimize.
[2024-06-01 17:14:40] [INFO ] Deduced a trap composed of 5 places in 645 ms of which 9 ms to minimize.
[2024-06-01 17:14:40] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 5654 ms
[2024-06-01 17:14:41] [INFO ] Deduced a trap composed of 8 places in 562 ms of which 8 ms to minimize.
[2024-06-01 17:14:42] [INFO ] Deduced a trap composed of 5 places in 586 ms of which 8 ms to minimize.
[2024-06-01 17:14:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1419 ms
[2024-06-01 17:14:43] [INFO ] Deduced a trap composed of 5 places in 575 ms of which 9 ms to minimize.
[2024-06-01 17:14:43] [INFO ] Deduced a trap composed of 5 places in 563 ms of which 8 ms to minimize.
[2024-06-01 17:14:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1414 ms
[2024-06-01 17:14:44] [INFO ] Deduced a trap composed of 5 places in 545 ms of which 9 ms to minimize.
[2024-06-01 17:14:45] [INFO ] Deduced a trap composed of 8 places in 567 ms of which 9 ms to minimize.
[2024-06-01 17:14:45] [INFO ] Deduced a trap composed of 5 places in 564 ms of which 9 ms to minimize.
[2024-06-01 17:14:46] [INFO ] Deduced a trap composed of 5 places in 560 ms of which 8 ms to minimize.
[2024-06-01 17:14:47] [INFO ] Deduced a trap composed of 6 places in 564 ms of which 8 ms to minimize.
[2024-06-01 17:14:47] [INFO ] Deduced a trap composed of 6 places in 559 ms of which 9 ms to minimize.
[2024-06-01 17:14:48] [INFO ] Deduced a trap composed of 5 places in 553 ms of which 9 ms to minimize.
[2024-06-01 17:14:49] [INFO ] Deduced a trap composed of 5 places in 561 ms of which 9 ms to minimize.
[2024-06-01 17:14:49] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 5316 ms
[2024-06-01 17:14:50] [INFO ] Deduced a trap composed of 7 places in 546 ms of which 9 ms to minimize.
[2024-06-01 17:14:50] [INFO ] Deduced a trap composed of 7 places in 547 ms of which 8 ms to minimize.
[2024-06-01 17:14:51] [INFO ] Deduced a trap composed of 5 places in 526 ms of which 8 ms to minimize.
[2024-06-01 17:14:51] [INFO ] Deduced a trap composed of 5 places in 523 ms of which 8 ms to minimize.
[2024-06-01 17:14:52] [INFO ] Deduced a trap composed of 9 places in 535 ms of which 9 ms to minimize.
[2024-06-01 17:14:53] [INFO ] Deduced a trap composed of 7 places in 541 ms of which 8 ms to minimize.
[2024-06-01 17:14:53] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3876 ms
TRAPS : Iteration 5
[2024-06-01 17:14:54] [INFO ] Deduced a trap composed of 10 places in 512 ms of which 7 ms to minimize.
[2024-06-01 17:14:54] [INFO ] Deduced a trap composed of 9 places in 524 ms of which 9 ms to minimize.
[2024-06-01 17:14:55] [INFO ] Deduced a trap composed of 6 places in 521 ms of which 8 ms to minimize.
[2024-06-01 17:14:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1920 ms
[2024-06-01 17:14:56] [INFO ] Deduced a trap composed of 9 places in 549 ms of which 8 ms to minimize.
[2024-06-01 17:14:57] [INFO ] Deduced a trap composed of 5 places in 546 ms of which 8 ms to minimize.
[2024-06-01 17:14:57] [INFO ] Deduced a trap composed of 6 places in 529 ms of which 8 ms to minimize.
[2024-06-01 17:14:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1992 ms
[2024-06-01 17:14:58] [INFO ] Deduced a trap composed of 6 places in 559 ms of which 8 ms to minimize.
[2024-06-01 17:14:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 731 ms
[2024-06-01 17:14:59] [INFO ] Deduced a trap composed of 5 places in 516 ms of which 8 ms to minimize.
[2024-06-01 17:14:59] [INFO ] Deduced a trap composed of 5 places in 503 ms of which 7 ms to minimize.
[2024-06-01 17:15:00] [INFO ] Deduced a trap composed of 7 places in 513 ms of which 7 ms to minimize.
[2024-06-01 17:15:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1894 ms
[2024-06-01 17:15:01] [INFO ] Deduced a trap composed of 6 places in 533 ms of which 8 ms to minimize.
[2024-06-01 17:15:02] [INFO ] Deduced a trap composed of 7 places in 529 ms of which 8 ms to minimize.
[2024-06-01 17:15:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1324 ms
TRAPS : Iteration 6
[2024-06-01 17:15:04] [INFO ] After 81288ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
[2024-06-01 17:15:05] [INFO ] After 84944ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Over-approximation ignoring read arcs solved 0 properties in 85992 ms.
[2024-06-01 17:15:05] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 8 ms.
[2024-06-01 17:15:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2578 places, 2171 transitions and 9383 arcs took 14 ms.
[2024-06-01 17:15:05] [INFO ] Flatten gal took : 199 ms
Total runtime 398225 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 : ShieldPPPt-PT-100B-ReachabilityCardinality-2024-01
Could not compute solution for formula : ShieldPPPt-PT-100B-ReachabilityCardinality-2024-03
Could not compute solution for formula : ShieldPPPt-PT-100B-ReachabilityCardinality-2023-04
Could not compute solution for formula : ShieldPPPt-PT-100B-ReachabilityCardinality-2024-06
Could not compute solution for formula : ShieldPPPt-PT-100B-ReachabilityCardinality-2024-07
Could not compute solution for formula : ShieldPPPt-PT-100B-ReachabilityCardinality-2024-11
Could not compute solution for formula : ShieldPPPt-PT-100B-ReachabilityCardinality-2024-12
Could not compute solution for formula : ShieldPPPt-PT-100B-ReachabilityCardinality-2024-13

BK_STOP 1717262105901

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2024
rfs formula name ShieldPPPt-PT-100B-ReachabilityCardinality-2024-01
rfs formula type EF
rfs formula formula --invariant=/tmp/1306/inv_0_
rfs formula name ShieldPPPt-PT-100B-ReachabilityCardinality-2024-03
rfs formula type EF
rfs formula formula --invariant=/tmp/1306/inv_1_
rfs formula name ShieldPPPt-PT-100B-ReachabilityCardinality-2023-04
rfs formula type AG
rfs formula formula --invariant=/tmp/1306/inv_2_
rfs formula name ShieldPPPt-PT-100B-ReachabilityCardinality-2024-06
rfs formula type AG
rfs formula formula --invariant=/tmp/1306/inv_3_
rfs formula name ShieldPPPt-PT-100B-ReachabilityCardinality-2024-07
rfs formula type EF
rfs formula formula --invariant=/tmp/1306/inv_4_
rfs formula name ShieldPPPt-PT-100B-ReachabilityCardinality-2024-11
rfs formula type AG
rfs formula formula --invariant=/tmp/1306/inv_5_
rfs formula name ShieldPPPt-PT-100B-ReachabilityCardinality-2024-12
rfs formula type EF
rfs formula formula --invariant=/tmp/1306/inv_6_
rfs formula name ShieldPPPt-PT-100B-ReachabilityCardinality-2024-13
rfs formula type EF
rfs formula formula --invariant=/tmp/1306/inv_7_
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="ShieldPPPt-PT-100B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-100B.tgz
mv ShieldPPPt-PT-100B execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;