About the Execution of GreatSPN+red for ShieldRVs-PT-040A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 11679.596 | 3600000.00 | 13961281.00 | 634.20 | ????T??T???????? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r355-tall-171683759600834.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is ShieldRVs-PT-040A, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683759600834
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 16:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 18:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 12 18:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 12 17:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 12 17:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 256K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldRVs-PT-040A-CTLFireability-2024-00
FORMULA_NAME ShieldRVs-PT-040A-CTLFireability-2024-01
FORMULA_NAME ShieldRVs-PT-040A-CTLFireability-2024-02
FORMULA_NAME ShieldRVs-PT-040A-CTLFireability-2024-03
FORMULA_NAME ShieldRVs-PT-040A-CTLFireability-2024-04
FORMULA_NAME ShieldRVs-PT-040A-CTLFireability-2024-05
FORMULA_NAME ShieldRVs-PT-040A-CTLFireability-2024-06
FORMULA_NAME ShieldRVs-PT-040A-CTLFireability-2024-07
FORMULA_NAME ShieldRVs-PT-040A-CTLFireability-2024-08
FORMULA_NAME ShieldRVs-PT-040A-CTLFireability-2024-09
FORMULA_NAME ShieldRVs-PT-040A-CTLFireability-2024-10
FORMULA_NAME ShieldRVs-PT-040A-CTLFireability-2024-11
FORMULA_NAME ShieldRVs-PT-040A-CTLFireability-2023-12
FORMULA_NAME ShieldRVs-PT-040A-CTLFireability-2023-13
FORMULA_NAME ShieldRVs-PT-040A-CTLFireability-2023-14
FORMULA_NAME ShieldRVs-PT-040A-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1717055651032
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-040A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 07:54:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-30 07:54:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 07:54:12] [INFO ] Load time of PNML (sax parser for PT used): 114 ms
[2024-05-30 07:54:12] [INFO ] Transformed 563 places.
[2024-05-30 07:54:12] [INFO ] Transformed 763 transitions.
[2024-05-30 07:54:12] [INFO ] Found NUPN structural information;
[2024-05-30 07:54:12] [INFO ] Parsed PT model containing 563 places and 763 transitions and 3680 arcs in 229 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
Support contains 234 out of 563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Applied a total of 0 rules in 56 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
// Phase 1: matrix 763 rows 563 cols
[2024-05-30 07:54:12] [INFO ] Computed 161 invariants in 33 ms
[2024-05-30 07:54:13] [INFO ] Implicit Places using invariants in 785 ms returned []
[2024-05-30 07:54:13] [INFO ] Invariant cache hit.
[2024-05-30 07:54:14] [INFO ] Implicit Places using invariants and state equation in 588 ms returned []
Implicit Place search using SMT with State Equation took 1402 ms to find 0 implicit places.
Running 762 sub problems to find dead transitions.
[2024-05-30 07:54:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/562 variables, 562/562 constraints. Problems are: Problem set: 0 solved, 762 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/562 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 762 unsolved
At refinement iteration 2 (OVERLAPS) 1/563 variables, 161/723 constraints. Problems are: Problem set: 0 solved, 762 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/563 variables, 1/724 constraints. Problems are: Problem set: 0 solved, 762 unsolved
[2024-05-30 07:54:34] [INFO ] Deduced a trap composed of 8 places in 282 ms of which 28 ms to minimize.
[2024-05-30 07:54:35] [INFO ] Deduced a trap composed of 8 places in 423 ms of which 14 ms to minimize.
[2024-05-30 07:54:35] [INFO ] Deduced a trap composed of 7 places in 253 ms of which 1 ms to minimize.
[2024-05-30 07:54:36] [INFO ] Deduced a trap composed of 7 places in 979 ms of which 2 ms to minimize.
[2024-05-30 07:54:36] [INFO ] Deduced a trap composed of 12 places in 154 ms of which 4 ms to minimize.
[2024-05-30 07:54:36] [INFO ] Deduced a trap composed of 13 places in 174 ms of which 3 ms to minimize.
[2024-05-30 07:54:37] [INFO ] Deduced a trap composed of 12 places in 149 ms of which 3 ms to minimize.
[2024-05-30 07:54:37] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 3 ms to minimize.
[2024-05-30 07:54:37] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 4 ms to minimize.
[2024-05-30 07:54:37] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 2 ms to minimize.
[2024-05-30 07:54:37] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 2 ms to minimize.
[2024-05-30 07:54:38] [INFO ] Deduced a trap composed of 17 places in 154 ms of which 2 ms to minimize.
[2024-05-30 07:54:38] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 3 ms to minimize.
[2024-05-30 07:54:38] [INFO ] Deduced a trap composed of 12 places in 153 ms of which 3 ms to minimize.
[2024-05-30 07:54:38] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 1 ms to minimize.
[2024-05-30 07:54:38] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 2 ms to minimize.
[2024-05-30 07:54:38] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 3 ms to minimize.
[2024-05-30 07:54:39] [INFO ] Deduced a trap composed of 14 places in 150 ms of which 2 ms to minimize.
[2024-05-30 07:54:39] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 1 ms to minimize.
[2024-05-30 07:54:39] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/563 variables, 20/744 constraints. Problems are: Problem set: 0 solved, 762 unsolved
[2024-05-30 07:54:39] [INFO ] Deduced a trap composed of 14 places in 135 ms of which 2 ms to minimize.
[2024-05-30 07:54:39] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 5 ms to minimize.
[2024-05-30 07:54:40] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 1 ms to minimize.
[2024-05-30 07:54:40] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 2 ms to minimize.
[2024-05-30 07:54:40] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 2 ms to minimize.
[2024-05-30 07:54:40] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2024-05-30 07:54:40] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 3 ms to minimize.
[2024-05-30 07:54:41] [INFO ] Deduced a trap composed of 14 places in 151 ms of which 2 ms to minimize.
[2024-05-30 07:54:41] [INFO ] Deduced a trap composed of 13 places in 150 ms of which 2 ms to minimize.
[2024-05-30 07:54:41] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 2 ms to minimize.
[2024-05-30 07:54:41] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 3 ms to minimize.
[2024-05-30 07:54:41] [INFO ] Deduced a trap composed of 7 places in 145 ms of which 3 ms to minimize.
[2024-05-30 07:54:41] [INFO ] Deduced a trap composed of 18 places in 155 ms of which 2 ms to minimize.
[2024-05-30 07:54:42] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 4 ms to minimize.
[2024-05-30 07:54:42] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 3 ms to minimize.
[2024-05-30 07:54:42] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 3 ms to minimize.
[2024-05-30 07:54:42] [INFO ] Deduced a trap composed of 21 places in 143 ms of which 2 ms to minimize.
[2024-05-30 07:54:42] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 3 ms to minimize.
[2024-05-30 07:54:42] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 2 ms to minimize.
[2024-05-30 07:54:43] [INFO ] Deduced a trap composed of 17 places in 142 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/563 variables, 20/764 constraints. Problems are: Problem set: 0 solved, 762 unsolved
[2024-05-30 07:54:43] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 3 ms to minimize.
[2024-05-30 07:54:43] [INFO ] Deduced a trap composed of 12 places in 147 ms of which 3 ms to minimize.
[2024-05-30 07:54:43] [INFO ] Deduced a trap composed of 14 places in 150 ms of which 2 ms to minimize.
[2024-05-30 07:54:44] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 3 ms to minimize.
[2024-05-30 07:54:44] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 2 ms to minimize.
[2024-05-30 07:54:44] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 3 ms to minimize.
SMT process timed out in 30631ms, After SMT, problems are : Problem set: 0 solved, 762 unsolved
Search for dead transitions found 0 dead transitions in 30656ms
Finished structural reductions in LTL mode , in 1 iterations and 32142 ms. Remains : 563/563 places, 763/763 transitions.
Support contains 234 out of 563 places after structural reductions.
[2024-05-30 07:54:45] [INFO ] Flatten gal took : 123 ms
[2024-05-30 07:54:45] [INFO ] Flatten gal took : 80 ms
[2024-05-30 07:54:45] [INFO ] Input system was already deterministic with 763 transitions.
Support contains 231 out of 563 places (down from 234) after GAL structural reductions.
RANDOM walk for 40000 steps (72 resets) in 2779 ms. (14 steps per ms) remains 9/84 properties
BEST_FIRST walk for 40004 steps (8 resets) in 318 ms. (125 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 250 ms. (159 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 212 ms. (187 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 354 ms. (112 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 205 ms. (194 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 217 ms. (183 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 219 ms. (181 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 4/4 properties
[2024-05-30 07:54:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 68/95 variables, 26/53 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 68/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 468/563 variables, 135/256 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 468/724 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 07:54:47] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 2 ms to minimize.
[2024-05-30 07:54:47] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 1 ms to minimize.
[2024-05-30 07:54:47] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 2 ms to minimize.
[2024-05-30 07:54:47] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 1 ms to minimize.
[2024-05-30 07:54:47] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 2 ms to minimize.
[2024-05-30 07:54:47] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2024-05-30 07:54:47] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-05-30 07:54:47] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-05-30 07:54:47] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2024-05-30 07:54:47] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 12 ms to minimize.
[2024-05-30 07:54:47] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-05-30 07:54:47] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-30 07:54:47] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-05-30 07:54:48] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-05-30 07:54:48] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 15/739 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 763/1326 variables, 563/1302 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1326 variables, 0/1302 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/1326 variables, 0/1302 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1326/1326 variables, and 1302 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1573 ms.
Refiners :[Domain max(s): 563/563 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 563/563 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 68/95 variables, 26/53 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 68/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 468/563 variables, 135/256 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 468/724 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 15/739 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 07:54:48] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 1 ms to minimize.
[2024-05-30 07:54:48] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-05-30 07:54:48] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2024-05-30 07:54:48] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-30 07:54:49] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 1 ms to minimize.
[2024-05-30 07:54:49] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2024-05-30 07:54:49] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-05-30 07:54:49] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-05-30 07:54:49] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-05-30 07:54:49] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-05-30 07:54:49] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 2 ms to minimize.
[2024-05-30 07:54:49] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-05-30 07:54:49] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-05-30 07:54:49] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2024-05-30 07:54:49] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-30 07:54:49] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 0 ms to minimize.
[2024-05-30 07:54:49] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-05-30 07:54:49] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-05-30 07:54:49] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 19/758 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/563 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 763/1326 variables, 563/1321 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1326 variables, 4/1325 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 07:54:50] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
[2024-05-30 07:54:50] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 2 ms to minimize.
[2024-05-30 07:54:50] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
[2024-05-30 07:54:50] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
[2024-05-30 07:54:50] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-05-30 07:54:50] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-05-30 07:54:50] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2024-05-30 07:54:51] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2024-05-30 07:54:51] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-30 07:54:51] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 0 ms to minimize.
[2024-05-30 07:54:51] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-30 07:54:51] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-30 07:54:51] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2024-05-30 07:54:51] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2024-05-30 07:54:51] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-30 07:54:51] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-30 07:54:51] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-30 07:54:51] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-05-30 07:54:51] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-30 07:54:52] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1326 variables, 20/1345 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 07:54:52] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-30 07:54:52] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-30 07:54:52] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 2 ms to minimize.
[2024-05-30 07:54:52] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 2 ms to minimize.
[2024-05-30 07:54:52] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
[2024-05-30 07:54:52] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-05-30 07:54:52] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2024-05-30 07:54:52] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-30 07:54:52] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1326 variables, 9/1354 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 07:54:53] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-30 07:54:53] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 0 ms to minimize.
[2024-05-30 07:54:53] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 0 ms to minimize.
[2024-05-30 07:54:53] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 0 ms to minimize.
[2024-05-30 07:54:53] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1326/1326 variables, and 1359 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5008 ms.
Refiners :[Domain max(s): 563/563 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 563/563 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 68/68 constraints]
After SMT, in 6620ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 27 out of 563 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 563/563 places, 763/763 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 562 transition count 762
Partial Free-agglomeration rule applied 79 times.
Drop transitions (Partial Free agglomeration) removed 79 transitions
Iterating global reduction 0 with 79 rules applied. Total rules applied 81 place count 562 transition count 762
Applied a total of 81 rules in 156 ms. Remains 562 /563 variables (removed 1) and now considering 762/763 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 156 ms. Remains : 562/563 places, 762/763 transitions.
RANDOM walk for 40000 steps (83 resets) in 1000 ms. (39 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 358 ms. (111 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 199 ms. (200 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 254 ms. (156 steps per ms) remains 1/1 properties
// Phase 1: matrix 762 rows 562 cols
[2024-05-30 07:54:54] [INFO ] Computed 161 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 17/23 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 17/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 539/562 variables, 155/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 539/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 07:54:54] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 1 ms to minimize.
[2024-05-30 07:54:54] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 1 ms to minimize.
[2024-05-30 07:54:55] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 1 ms to minimize.
[2024-05-30 07:54:55] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 2 ms to minimize.
[2024-05-30 07:54:55] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 1 ms to minimize.
[2024-05-30 07:54:55] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 1 ms to minimize.
[2024-05-30 07:54:55] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2024-05-30 07:54:55] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-30 07:54:55] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/562 variables, 9/732 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/562 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 762/1324 variables, 562/1294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 07:54:55] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 2 ms to minimize.
[2024-05-30 07:54:56] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 2 ms to minimize.
[2024-05-30 07:54:56] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 2 ms to minimize.
[2024-05-30 07:54:56] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 2 ms to minimize.
[2024-05-30 07:54:56] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 2 ms to minimize.
[2024-05-30 07:54:56] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 1 ms to minimize.
[2024-05-30 07:54:56] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 1 ms to minimize.
[2024-05-30 07:54:56] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 1 ms to minimize.
[2024-05-30 07:54:57] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 1 ms to minimize.
[2024-05-30 07:54:57] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 1 ms to minimize.
[2024-05-30 07:54:57] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1324 variables, 11/1305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1324 variables, 0/1305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/1324 variables, 0/1305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1324/1324 variables, and 1305 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3039 ms.
Refiners :[Domain max(s): 562/562 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 562/562 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 17/23 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 17/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 539/562 variables, 155/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 539/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/562 variables, 20/743 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 07:54:57] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 2 ms to minimize.
[2024-05-30 07:54:57] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 1 ms to minimize.
[2024-05-30 07:54:57] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 1 ms to minimize.
[2024-05-30 07:54:57] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 1 ms to minimize.
[2024-05-30 07:54:58] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 8 ms to minimize.
[2024-05-30 07:54:58] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2024-05-30 07:54:58] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 1 ms to minimize.
[2024-05-30 07:54:58] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 2 ms to minimize.
[2024-05-30 07:54:58] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-05-30 07:54:58] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 0 ms to minimize.
[2024-05-30 07:54:58] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-30 07:54:58] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2024-05-30 07:54:58] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-05-30 07:54:58] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-05-30 07:54:58] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-05-30 07:54:58] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/562 variables, 16/759 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/562 variables, 0/759 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 762/1324 variables, 562/1321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1324 variables, 1/1322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 07:54:59] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 1 ms to minimize.
[2024-05-30 07:54:59] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2024-05-30 07:54:59] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1324 variables, 3/1325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1324 variables, 0/1325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1324 variables, 0/1325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1324/1324 variables, and 1325 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2024 ms.
Refiners :[Domain max(s): 562/562 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 562/562 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 39/39 constraints]
After SMT, in 5108ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 138 ms.
Support contains 6 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 762/762 transitions.
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 562 transition count 762
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 561 transition count 761
Applied a total of 3 rules in 144 ms. Remains 561 /562 variables (removed 1) and now considering 761/762 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 561/562 places, 761/762 transitions.
RANDOM walk for 40000 steps (84 resets) in 384 ms. (103 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 430424 steps, run timeout after 3001 ms. (steps per millisecond=143 ) properties seen :0 out of 1
Probabilistic random walk after 430424 steps, saw 360149 distinct states, run finished after 3006 ms. (steps per millisecond=143 ) properties seen :0
// Phase 1: matrix 761 rows 561 cols
[2024-05-30 07:55:02] [INFO ] Computed 161 invariants in 5 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 16/22 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 16/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/80 variables, 22/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 134/214 variables, 52/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/214 variables, 52/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 12/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/214 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 8/222 variables, 4/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 8/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/222 variables, 8/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/222 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 124/346 variables, 48/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/346 variables, 48/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/346 variables, 12/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/346 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 8/354 variables, 4/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/354 variables, 8/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/354 variables, 8/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/354 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 124/478 variables, 48/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/478 variables, 48/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/478 variables, 12/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/478 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 8/486 variables, 4/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/486 variables, 8/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/486 variables, 8/442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/486 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 124/610 variables, 48/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/610 variables, 48/538 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/610 variables, 12/550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/610 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 8/618 variables, 4/554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/618 variables, 8/562 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/618 variables, 8/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/618 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 121/739 variables, 48/618 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/739 variables, 48/666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/739 variables, 12/678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/739 variables, 0/678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 8/747 variables, 4/682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/747 variables, 8/690 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/747 variables, 8/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/747 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 97/844 variables, 40/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/844 variables, 40/778 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/844 variables, 11/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 07:55:03] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
At refinement iteration 50 (INCLUDED_ONLY) 0/844 variables, 1/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/844 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (OVERLAPS) 6/850 variables, 3/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/850 variables, 6/799 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/850 variables, 6/805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/850 variables, 0/805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 93/943 variables, 36/841 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/943 variables, 36/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/943 variables, 9/886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 07:55:03] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
At refinement iteration 59 (INCLUDED_ONLY) 0/943 variables, 1/887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/943 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (OVERLAPS) 6/949 variables, 3/890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/949 variables, 6/896 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/949 variables, 6/902 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/949 variables, 0/902 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (OVERLAPS) 93/1042 variables, 36/938 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1042 variables, 36/974 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1042 variables, 9/983 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1042 variables, 0/983 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (OVERLAPS) 6/1048 variables, 3/986 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1048 variables, 6/992 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1048 variables, 6/998 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1048 variables, 0/998 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (OVERLAPS) 58/1106 variables, 28/1026 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1106 variables, 28/1054 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1106 variables, 8/1062 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1106 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (OVERLAPS) 2/1108 variables, 1/1063 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1108 variables, 2/1065 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1108 variables, 2/1067 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1108 variables, 0/1067 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (OVERLAPS) 33/1141 variables, 14/1081 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1141 variables, 14/1095 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1141 variables, 4/1099 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 07:55:03] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
At refinement iteration 84 (INCLUDED_ONLY) 0/1141 variables, 1/1100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1141 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (OVERLAPS) 2/1143 variables, 1/1101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1143 variables, 2/1103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1143 variables, 2/1105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1143 variables, 0/1105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (OVERLAPS) 31/1174 variables, 12/1117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/1174 variables, 12/1129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1174 variables, 3/1132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1174 variables, 0/1132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (OVERLAPS) 2/1176 variables, 1/1133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1176 variables, 2/1135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1176 variables, 2/1137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/1176 variables, 0/1137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (OVERLAPS) 31/1207 variables, 12/1149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/1207 variables, 12/1161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/1207 variables, 3/1164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1207 variables, 0/1164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (OVERLAPS) 2/1209 variables, 1/1165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/1209 variables, 2/1167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1209 variables, 2/1169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/1209 variables, 0/1169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (OVERLAPS) 31/1240 variables, 12/1181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/1240 variables, 12/1193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/1240 variables, 3/1196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/1240 variables, 0/1196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (OVERLAPS) 2/1242 variables, 1/1197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/1242 variables, 2/1199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/1242 variables, 2/1201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/1242 variables, 0/1201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (OVERLAPS) 31/1273 variables, 12/1213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/1273 variables, 12/1225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/1273 variables, 3/1228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/1273 variables, 0/1228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (OVERLAPS) 2/1275 variables, 1/1229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/1275 variables, 2/1231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/1275 variables, 2/1233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/1275 variables, 0/1233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (OVERLAPS) 31/1306 variables, 12/1245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/1306 variables, 12/1257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/1306 variables, 3/1260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/1306 variables, 0/1260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 126 (OVERLAPS) 2/1308 variables, 1/1261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 127 (INCLUDED_ONLY) 0/1308 variables, 2/1263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/1308 variables, 2/1265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/1308 variables, 0/1265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 130 (OVERLAPS) 14/1322 variables, 9/1274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/1322 variables, 9/1283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/1322 variables, 3/1286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 133 (INCLUDED_ONLY) 0/1322 variables, 0/1286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 134 (OVERLAPS) 0/1322 variables, 0/1286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1322/1322 variables, and 1286 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1662 ms.
Refiners :[Domain max(s): 561/561 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 561/561 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 16/22 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 16/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 58/80 variables, 22/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 134/214 variables, 52/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/214 variables, 52/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 12/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/214 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/214 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 8/222 variables, 4/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/222 variables, 8/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/222 variables, 8/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/222 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 124/346 variables, 48/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/346 variables, 48/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/346 variables, 12/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 07:55:04] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/346 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/346 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 8/354 variables, 4/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/354 variables, 8/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/354 variables, 8/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/354 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 124/478 variables, 48/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/478 variables, 48/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/478 variables, 12/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/478 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 8/486 variables, 4/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/486 variables, 8/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/486 variables, 8/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/486 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 124/610 variables, 48/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/610 variables, 48/540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/610 variables, 12/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/610 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 8/618 variables, 4/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/618 variables, 8/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/618 variables, 8/572 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/618 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 121/739 variables, 48/620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/739 variables, 48/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/739 variables, 12/680 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 07:55:04] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
At refinement iteration 44 (INCLUDED_ONLY) 0/739 variables, 1/681 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/739 variables, 0/681 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 8/747 variables, 4/685 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/747 variables, 8/693 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/747 variables, 8/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/747 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 97/844 variables, 40/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/844 variables, 40/781 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/844 variables, 11/792 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/844 variables, 1/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 07:55:05] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
[2024-05-30 07:55:05] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
At refinement iteration 54 (INCLUDED_ONLY) 0/844 variables, 2/795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/844 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 6/850 variables, 3/798 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/850 variables, 6/804 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/850 variables, 6/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 07:55:05] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
At refinement iteration 59 (INCLUDED_ONLY) 0/850 variables, 1/811 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/850 variables, 0/811 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (OVERLAPS) 93/943 variables, 36/847 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/943 variables, 36/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/943 variables, 9/892 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/943 variables, 1/893 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 07:55:05] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
At refinement iteration 65 (INCLUDED_ONLY) 0/943 variables, 1/894 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/943 variables, 0/894 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (OVERLAPS) 6/949 variables, 3/897 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/949 variables, 6/903 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/949 variables, 6/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/949 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (OVERLAPS) 93/1042 variables, 36/945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1042 variables, 36/981 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1042 variables, 9/990 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 07:55:05] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
At refinement iteration 74 (INCLUDED_ONLY) 0/1042 variables, 1/991 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1042 variables, 0/991 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (OVERLAPS) 6/1048 variables, 3/994 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1048 variables, 6/1000 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1048 variables, 6/1006 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1048 variables, 0/1006 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (OVERLAPS) 58/1106 variables, 28/1034 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1106 variables, 28/1062 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1106 variables, 8/1070 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 07:55:05] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-30 07:55:05] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-30 07:55:05] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2024-05-30 07:55:05] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
At refinement iteration 83 (INCLUDED_ONLY) 0/1106 variables, 4/1074 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1106 variables, 0/1074 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (OVERLAPS) 2/1108 variables, 1/1075 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1108 variables, 2/1077 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1108 variables, 2/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 07:55:05] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-30 07:55:05] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 1 ms to minimize.
At refinement iteration 88 (INCLUDED_ONLY) 0/1108 variables, 2/1081 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1108 variables, 0/1081 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (OVERLAPS) 33/1141 variables, 14/1095 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/1141 variables, 14/1109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1141 variables, 4/1113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1141 variables, 1/1114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/1141 variables, 0/1114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (OVERLAPS) 2/1143 variables, 1/1115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1143 variables, 2/1117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/1143 variables, 2/1119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1143 variables, 0/1119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (OVERLAPS) 31/1174 variables, 12/1131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/1174 variables, 12/1143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1174 variables, 3/1146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 07:55:06] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
At refinement iteration 102 (INCLUDED_ONLY) 0/1174 variables, 1/1147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/1174 variables, 0/1147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (OVERLAPS) 2/1176 variables, 1/1148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/1176 variables, 2/1150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/1176 variables, 2/1152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/1176 variables, 0/1152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (OVERLAPS) 31/1207 variables, 12/1164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/1207 variables, 12/1176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/1207 variables, 3/1179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/1207 variables, 0/1179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (OVERLAPS) 2/1209 variables, 1/1180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/1209 variables, 2/1182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/1209 variables, 2/1184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/1209 variables, 0/1184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (OVERLAPS) 31/1240 variables, 12/1196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/1240 variables, 12/1208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/1240 variables, 3/1211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 07:55:06] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
At refinement iteration 119 (INCLUDED_ONLY) 0/1240 variables, 1/1212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/1240 variables, 0/1212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (OVERLAPS) 2/1242 variables, 1/1213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/1242 variables, 2/1215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/1242 variables, 2/1217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/1242 variables, 0/1217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 125 (OVERLAPS) 31/1273 variables, 12/1229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/1273 variables, 12/1241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 127 (INCLUDED_ONLY) 0/1273 variables, 3/1244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/1273 variables, 0/1244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 129 (OVERLAPS) 2/1275 variables, 1/1245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 130 (INCLUDED_ONLY) 0/1275 variables, 2/1247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/1275 variables, 2/1249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/1275 variables, 0/1249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 133 (OVERLAPS) 31/1306 variables, 12/1261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/1306 variables, 12/1273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 135 (INCLUDED_ONLY) 0/1306 variables, 3/1276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 07:55:06] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
At refinement iteration 136 (INCLUDED_ONLY) 0/1306 variables, 1/1277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/1306 variables, 0/1277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 138 (OVERLAPS) 2/1308 variables, 1/1278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 139 (INCLUDED_ONLY) 0/1308 variables, 2/1280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/1308 variables, 2/1282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 141 (INCLUDED_ONLY) 0/1308 variables, 0/1282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 142 (OVERLAPS) 14/1322 variables, 9/1291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 143 (INCLUDED_ONLY) 0/1322 variables, 9/1300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 144 (INCLUDED_ONLY) 0/1322 variables, 3/1303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 145 (INCLUDED_ONLY) 0/1322 variables, 0/1303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 146 (OVERLAPS) 0/1322 variables, 0/1303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1322/1322 variables, and 1303 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2198 ms.
Refiners :[Domain max(s): 561/561 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 561/561 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 19/19 constraints]
After SMT, in 3878ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 561 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 561/561 places, 761/761 transitions.
Applied a total of 0 rules in 33 ms. Remains 561 /561 variables (removed 0) and now considering 761/761 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 561/561 places, 761/761 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 561/561 places, 761/761 transitions.
Applied a total of 0 rules in 42 ms. Remains 561 /561 variables (removed 0) and now considering 761/761 (removed 0) transitions.
[2024-05-30 07:55:06] [INFO ] Invariant cache hit.
[2024-05-30 07:55:07] [INFO ] Implicit Places using invariants in 341 ms returned []
[2024-05-30 07:55:07] [INFO ] Invariant cache hit.
[2024-05-30 07:55:07] [INFO ] Implicit Places using invariants and state equation in 647 ms returned []
Implicit Place search using SMT with State Equation took 990 ms to find 0 implicit places.
[2024-05-30 07:55:07] [INFO ] Redundant transitions in 108 ms returned []
Running 760 sub problems to find dead transitions.
[2024-05-30 07:55:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 561/561 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 161/722 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-05-30 07:55:14] [INFO ] Deduced a trap composed of 6 places in 156 ms of which 2 ms to minimize.
[2024-05-30 07:55:15] [INFO ] Deduced a trap composed of 6 places in 150 ms of which 2 ms to minimize.
[2024-05-30 07:55:15] [INFO ] Deduced a trap composed of 6 places in 142 ms of which 2 ms to minimize.
[2024-05-30 07:55:15] [INFO ] Deduced a trap composed of 6 places in 159 ms of which 3 ms to minimize.
[2024-05-30 07:55:15] [INFO ] Deduced a trap composed of 6 places in 150 ms of which 4 ms to minimize.
[2024-05-30 07:55:15] [INFO ] Deduced a trap composed of 6 places in 146 ms of which 5 ms to minimize.
[2024-05-30 07:55:15] [INFO ] Deduced a trap composed of 6 places in 162 ms of which 3 ms to minimize.
[2024-05-30 07:55:16] [INFO ] Deduced a trap composed of 6 places in 172 ms of which 3 ms to minimize.
[2024-05-30 07:55:16] [INFO ] Deduced a trap composed of 6 places in 166 ms of which 3 ms to minimize.
[2024-05-30 07:55:16] [INFO ] Deduced a trap composed of 6 places in 166 ms of which 5 ms to minimize.
[2024-05-30 07:55:16] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 3 ms to minimize.
[2024-05-30 07:55:16] [INFO ] Deduced a trap composed of 10 places in 171 ms of which 2 ms to minimize.
[2024-05-30 07:55:16] [INFO ] Deduced a trap composed of 6 places in 165 ms of which 3 ms to minimize.
[2024-05-30 07:55:17] [INFO ] Deduced a trap composed of 6 places in 167 ms of which 2 ms to minimize.
[2024-05-30 07:55:17] [INFO ] Deduced a trap composed of 6 places in 161 ms of which 3 ms to minimize.
[2024-05-30 07:55:17] [INFO ] Deduced a trap composed of 6 places in 160 ms of which 2 ms to minimize.
[2024-05-30 07:55:17] [INFO ] Deduced a trap composed of 6 places in 166 ms of which 3 ms to minimize.
[2024-05-30 07:55:17] [INFO ] Deduced a trap composed of 10 places in 161 ms of which 2 ms to minimize.
[2024-05-30 07:55:17] [INFO ] Deduced a trap composed of 19 places in 154 ms of which 2 ms to minimize.
[2024-05-30 07:55:18] [INFO ] Deduced a trap composed of 6 places in 156 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/561 variables, 20/742 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-05-30 07:55:18] [INFO ] Deduced a trap composed of 6 places in 134 ms of which 2 ms to minimize.
[2024-05-30 07:55:18] [INFO ] Deduced a trap composed of 6 places in 133 ms of which 2 ms to minimize.
[2024-05-30 07:55:18] [INFO ] Deduced a trap composed of 6 places in 126 ms of which 2 ms to minimize.
[2024-05-30 07:55:18] [INFO ] Deduced a trap composed of 6 places in 134 ms of which 2 ms to minimize.
[2024-05-30 07:55:18] [INFO ] Deduced a trap composed of 6 places in 130 ms of which 2 ms to minimize.
[2024-05-30 07:55:19] [INFO ] Deduced a trap composed of 6 places in 127 ms of which 2 ms to minimize.
[2024-05-30 07:55:19] [INFO ] Deduced a trap composed of 6 places in 129 ms of which 3 ms to minimize.
[2024-05-30 07:55:19] [INFO ] Deduced a trap composed of 6 places in 127 ms of which 2 ms to minimize.
[2024-05-30 07:55:19] [INFO ] Deduced a trap composed of 6 places in 127 ms of which 3 ms to minimize.
[2024-05-30 07:55:19] [INFO ] Deduced a trap composed of 6 places in 144 ms of which 2 ms to minimize.
[2024-05-30 07:55:19] [INFO ] Deduced a trap composed of 6 places in 140 ms of which 3 ms to minimize.
[2024-05-30 07:55:20] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 2 ms to minimize.
[2024-05-30 07:55:20] [INFO ] Deduced a trap composed of 6 places in 130 ms of which 2 ms to minimize.
[2024-05-30 07:55:20] [INFO ] Deduced a trap composed of 6 places in 133 ms of which 2 ms to minimize.
[2024-05-30 07:55:20] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 2 ms to minimize.
[2024-05-30 07:55:20] [INFO ] Deduced a trap composed of 6 places in 136 ms of which 3 ms to minimize.
[2024-05-30 07:55:20] [INFO ] Deduced a trap composed of 6 places in 123 ms of which 2 ms to minimize.
[2024-05-30 07:55:20] [INFO ] Deduced a trap composed of 6 places in 124 ms of which 2 ms to minimize.
[2024-05-30 07:55:21] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 2 ms to minimize.
[2024-05-30 07:55:21] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/561 variables, 20/762 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-05-30 07:55:27] [INFO ] Deduced a trap composed of 5 places in 154 ms of which 2 ms to minimize.
[2024-05-30 07:55:27] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 2 ms to minimize.
[2024-05-30 07:55:27] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 3 ms to minimize.
[2024-05-30 07:55:27] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 1 ms to minimize.
[2024-05-30 07:55:28] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 2 ms to minimize.
[2024-05-30 07:55:28] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 2 ms to minimize.
[2024-05-30 07:55:28] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
[2024-05-30 07:55:28] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-30 07:55:28] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
[2024-05-30 07:55:28] [INFO ] Deduced a trap composed of 6 places in 162 ms of which 2 ms to minimize.
[2024-05-30 07:55:28] [INFO ] Deduced a trap composed of 14 places in 165 ms of which 2 ms to minimize.
[2024-05-30 07:55:29] [INFO ] Deduced a trap composed of 6 places in 173 ms of which 3 ms to minimize.
[2024-05-30 07:55:29] [INFO ] Deduced a trap composed of 18 places in 176 ms of which 2 ms to minimize.
[2024-05-30 07:55:29] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
[2024-05-30 07:55:29] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-30 07:55:29] [INFO ] Deduced a trap composed of 12 places in 160 ms of which 3 ms to minimize.
[2024-05-30 07:55:29] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 0 ms to minimize.
[2024-05-30 07:55:29] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-05-30 07:55:29] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2024-05-30 07:55:29] [INFO ] Deduced a trap composed of 14 places in 165 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/561 variables, 20/782 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-05-30 07:55:30] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2024-05-30 07:55:30] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 2 ms to minimize.
[2024-05-30 07:55:30] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 1 ms to minimize.
[2024-05-30 07:55:30] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-30 07:55:30] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2024-05-30 07:55:30] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2024-05-30 07:55:30] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 1 ms to minimize.
[2024-05-30 07:55:30] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-30 07:55:30] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2024-05-30 07:55:30] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 1 ms to minimize.
[2024-05-30 07:55:31] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 2 ms to minimize.
[2024-05-30 07:55:31] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 0 ms to minimize.
[2024-05-30 07:55:31] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-05-30 07:55:31] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-30 07:55:31] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2024-05-30 07:55:31] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 2 ms to minimize.
[2024-05-30 07:55:31] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 7 ms to minimize.
[2024-05-30 07:55:31] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 1 ms to minimize.
[2024-05-30 07:55:31] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 1 ms to minimize.
[2024-05-30 07:55:31] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/561 variables, 20/802 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-05-30 07:55:32] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 3 ms to minimize.
[2024-05-30 07:55:32] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-30 07:55:32] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-30 07:55:32] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 4 ms to minimize.
[2024-05-30 07:55:32] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 3 ms to minimize.
[2024-05-30 07:55:32] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-30 07:55:33] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 2 ms to minimize.
[2024-05-30 07:55:33] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-05-30 07:55:33] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-30 07:55:33] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-30 07:55:33] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 2 ms to minimize.
[2024-05-30 07:55:33] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-30 07:55:33] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 2 ms to minimize.
[2024-05-30 07:55:33] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 1 ms to minimize.
[2024-05-30 07:55:33] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 2 ms to minimize.
[2024-05-30 07:55:34] [INFO ] Deduced a trap composed of 6 places in 141 ms of which 3 ms to minimize.
[2024-05-30 07:55:34] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 2 ms to minimize.
[2024-05-30 07:55:34] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-05-30 07:55:34] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-30 07:55:34] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 20/822 constraints. Problems are: Problem set: 0 solved, 760 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 561/1322 variables, and 822 constraints, problems are : Problem set: 0 solved, 760 unsolved in 30024 ms.
Refiners :[Domain max(s): 561/561 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 0/561 constraints, PredecessorRefiner: 760/760 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 0 solved, 760 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 561/561 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 161/722 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/561 variables, 100/822 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-05-30 07:55:39] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
[2024-05-30 07:55:39] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 2 ms to minimize.
[2024-05-30 07:55:39] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-30 07:55:39] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-05-30 07:55:39] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2024-05-30 07:55:39] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 0 ms to minimize.
[2024-05-30 07:55:39] [INFO ] Deduced a trap composed of 6 places in 88 ms of which 2 ms to minimize.
[2024-05-30 07:55:39] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-30 07:55:39] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-30 07:55:40] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-05-30 07:55:40] [INFO ] Deduced a trap composed of 48 places in 84 ms of which 2 ms to minimize.
[2024-05-30 07:55:40] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-05-30 07:55:40] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-30 07:55:40] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-30 07:55:40] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 1 ms to minimize.
[2024-05-30 07:55:40] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-05-30 07:55:40] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 1 ms to minimize.
[2024-05-30 07:55:40] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
[2024-05-30 07:55:40] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-30 07:55:40] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/561 variables, 20/842 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-05-30 07:55:41] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 0 ms to minimize.
[2024-05-30 07:55:41] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-05-30 07:55:41] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-30 07:55:41] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-05-30 07:55:41] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-30 07:55:41] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 1 ms to minimize.
[2024-05-30 07:55:42] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2024-05-30 07:55:42] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-05-30 07:55:42] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-30 07:55:42] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 2 ms to minimize.
[2024-05-30 07:55:42] [INFO ] Deduced a trap composed of 6 places in 132 ms of which 2 ms to minimize.
[2024-05-30 07:55:42] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 1 ms to minimize.
[2024-05-30 07:55:42] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 1 ms to minimize.
[2024-05-30 07:55:42] [INFO ] Deduced a trap composed of 17 places in 128 ms of which 2 ms to minimize.
[2024-05-30 07:55:43] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 2 ms to minimize.
[2024-05-30 07:55:43] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 2 ms to minimize.
[2024-05-30 07:55:43] [INFO ] Deduced a trap composed of 6 places in 142 ms of which 2 ms to minimize.
[2024-05-30 07:55:43] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 2 ms to minimize.
[2024-05-30 07:55:43] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 3 ms to minimize.
[2024-05-30 07:55:43] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/561 variables, 20/862 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-05-30 07:55:44] [INFO ] Deduced a trap composed of 18 places in 121 ms of which 2 ms to minimize.
[2024-05-30 07:55:44] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 3 ms to minimize.
[2024-05-30 07:55:44] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 2 ms to minimize.
[2024-05-30 07:55:44] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 3 ms to minimize.
[2024-05-30 07:55:45] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 3 ms to minimize.
[2024-05-30 07:55:45] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 2 ms to minimize.
[2024-05-30 07:55:45] [INFO ] Deduced a trap composed of 18 places in 136 ms of which 2 ms to minimize.
[2024-05-30 07:55:45] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 2 ms to minimize.
[2024-05-30 07:55:45] [INFO ] Deduced a trap composed of 6 places in 129 ms of which 2 ms to minimize.
[2024-05-30 07:55:45] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-05-30 07:55:46] [INFO ] Deduced a trap composed of 18 places in 136 ms of which 2 ms to minimize.
[2024-05-30 07:55:46] [INFO ] Deduced a trap composed of 14 places in 133 ms of which 2 ms to minimize.
[2024-05-30 07:55:46] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 3 ms to minimize.
[2024-05-30 07:55:46] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 2 ms to minimize.
[2024-05-30 07:55:46] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2024-05-30 07:55:46] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-05-30 07:55:46] [INFO ] Deduced a trap composed of 6 places in 133 ms of which 2 ms to minimize.
[2024-05-30 07:55:46] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 2 ms to minimize.
[2024-05-30 07:55:47] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 1 ms to minimize.
[2024-05-30 07:55:47] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/561 variables, 20/882 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-05-30 07:55:47] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-30 07:55:48] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-30 07:55:48] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-30 07:55:48] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-30 07:55:48] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-05-30 07:55:48] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 0 ms to minimize.
[2024-05-30 07:55:48] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-30 07:55:48] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-30 07:55:48] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 0 ms to minimize.
[2024-05-30 07:55:48] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-30 07:55:48] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-30 07:55:49] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 3 ms to minimize.
[2024-05-30 07:55:49] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 1 ms to minimize.
[2024-05-30 07:55:49] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 0 ms to minimize.
[2024-05-30 07:55:49] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 1 ms to minimize.
[2024-05-30 07:55:49] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 1 ms to minimize.
[2024-05-30 07:55:49] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2024-05-30 07:55:49] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2024-05-30 07:55:49] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-05-30 07:55:49] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 20/902 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-05-30 07:55:50] [INFO ] Deduced a trap composed of 18 places in 141 ms of which 2 ms to minimize.
[2024-05-30 07:55:50] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-30 07:55:50] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-30 07:55:51] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-30 07:55:51] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-05-30 07:55:51] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-30 07:55:51] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-30 07:55:51] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-05-30 07:55:51] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-30 07:55:51] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 0 ms to minimize.
[2024-05-30 07:55:51] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-30 07:55:51] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-30 07:55:51] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 0 ms to minimize.
[2024-05-30 07:55:51] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-30 07:55:51] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 2 ms to minimize.
[2024-05-30 07:55:51] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 0 ms to minimize.
[2024-05-30 07:55:51] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 0 ms to minimize.
[2024-05-30 07:55:52] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-30 07:55:52] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-30 07:55:52] [INFO ] Deduced a trap composed of 6 places in 134 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/561 variables, 20/922 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-05-30 07:55:53] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-05-30 07:55:53] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 2 ms to minimize.
[2024-05-30 07:55:53] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 0 ms to minimize.
[2024-05-30 07:55:53] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 2 ms to minimize.
[2024-05-30 07:55:53] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 2 ms to minimize.
[2024-05-30 07:55:53] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 2 ms to minimize.
[2024-05-30 07:55:53] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-30 07:55:53] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-30 07:55:53] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
[2024-05-30 07:55:53] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2024-05-30 07:55:54] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
[2024-05-30 07:55:54] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-30 07:55:54] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-30 07:55:54] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-30 07:55:54] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 0 ms to minimize.
[2024-05-30 07:55:54] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 0 ms to minimize.
[2024-05-30 07:55:54] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
[2024-05-30 07:55:54] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-05-30 07:55:54] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 2 ms to minimize.
[2024-05-30 07:55:54] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/561 variables, 20/942 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-05-30 07:55:55] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
[2024-05-30 07:55:55] [INFO ] Deduced a trap composed of 15 places in 167 ms of which 2 ms to minimize.
[2024-05-30 07:55:55] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2024-05-30 07:55:56] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-30 07:55:56] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 2 ms to minimize.
[2024-05-30 07:55:56] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 2 ms to minimize.
[2024-05-30 07:55:56] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-30 07:55:56] [INFO ] Deduced a trap composed of 10 places in 149 ms of which 2 ms to minimize.
[2024-05-30 07:55:56] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 2 ms to minimize.
[2024-05-30 07:55:56] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 0 ms to minimize.
[2024-05-30 07:55:56] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
[2024-05-30 07:55:57] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 0 ms to minimize.
[2024-05-30 07:55:57] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 2 ms to minimize.
[2024-05-30 07:55:57] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 2 ms to minimize.
[2024-05-30 07:55:57] [INFO ] Deduced a trap composed of 35 places in 123 ms of which 2 ms to minimize.
[2024-05-30 07:55:57] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 2 ms to minimize.
[2024-05-30 07:55:57] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-30 07:55:57] [INFO ] Deduced a trap composed of 35 places in 117 ms of which 2 ms to minimize.
[2024-05-30 07:55:58] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 2 ms to minimize.
[2024-05-30 07:55:58] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/561 variables, 20/962 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-05-30 07:55:59] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 2 ms to minimize.
[2024-05-30 07:55:59] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-05-30 07:55:59] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 0 ms to minimize.
[2024-05-30 07:55:59] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 0 ms to minimize.
[2024-05-30 07:55:59] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
[2024-05-30 07:55:59] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-05-30 07:55:59] [INFO ] Deduced a trap composed of 6 places in 136 ms of which 3 ms to minimize.
[2024-05-30 07:55:59] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-30 07:55:59] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-05-30 07:55:59] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 0 ms to minimize.
[2024-05-30 07:56:00] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 0 ms to minimize.
[2024-05-30 07:56:00] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-30 07:56:00] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2024-05-30 07:56:00] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2024-05-30 07:56:00] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 0 ms to minimize.
[2024-05-30 07:56:00] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 0 ms to minimize.
[2024-05-30 07:56:00] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 0 ms to minimize.
[2024-05-30 07:56:00] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-05-30 07:56:00] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 0 ms to minimize.
[2024-05-30 07:56:00] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/561 variables, 20/982 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-05-30 07:56:01] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 3 ms to minimize.
[2024-05-30 07:56:01] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 2 ms to minimize.
[2024-05-30 07:56:01] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 2 ms to minimize.
[2024-05-30 07:56:01] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 2 ms to minimize.
[2024-05-30 07:56:01] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 2 ms to minimize.
[2024-05-30 07:56:02] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 2 ms to minimize.
[2024-05-30 07:56:02] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 1 ms to minimize.
[2024-05-30 07:56:02] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 2 ms to minimize.
[2024-05-30 07:56:02] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 2 ms to minimize.
[2024-05-30 07:56:02] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 2 ms to minimize.
[2024-05-30 07:56:03] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 1 ms to minimize.
[2024-05-30 07:56:03] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 2 ms to minimize.
[2024-05-30 07:56:03] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-05-30 07:56:03] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-30 07:56:03] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-30 07:56:03] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 1 ms to minimize.
[2024-05-30 07:56:03] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-05-30 07:56:03] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 1 ms to minimize.
[2024-05-30 07:56:03] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-05-30 07:56:03] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/561 variables, 20/1002 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-05-30 07:56:04] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-30 07:56:04] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-30 07:56:04] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2024-05-30 07:56:04] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2024-05-30 07:56:04] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 0 ms to minimize.
[2024-05-30 07:56:04] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
[2024-05-30 07:56:04] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-30 07:56:04] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 0 ms to minimize.
[2024-05-30 07:56:05] [INFO ] Deduced a trap composed of 16 places in 139 ms of which 2 ms to minimize.
[2024-05-30 07:56:05] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 2 ms to minimize.
[2024-05-30 07:56:05] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 2 ms to minimize.
[2024-05-30 07:56:05] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 2 ms to minimize.
[2024-05-30 07:56:05] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 1 ms to minimize.
[2024-05-30 07:56:05] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 2 ms to minimize.
[2024-05-30 07:56:06] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 2 ms to minimize.
[2024-05-30 07:56:06] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 2 ms to minimize.
[2024-05-30 07:56:06] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 1 ms to minimize.
[2024-05-30 07:56:06] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 1 ms to minimize.
[2024-05-30 07:56:06] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2024-05-30 07:56:06] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/561 variables, 20/1022 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-05-30 07:56:07] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 2 ms to minimize.
[2024-05-30 07:56:07] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2024-05-30 07:56:07] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 2 ms to minimize.
[2024-05-30 07:56:08] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 2 ms to minimize.
[2024-05-30 07:56:08] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 2 ms to minimize.
[2024-05-30 07:56:08] [INFO ] Deduced a trap composed of 6 places in 100 ms of which 1 ms to minimize.
SMT process timed out in 60387ms, After SMT, problems are : Problem set: 0 solved, 760 unsolved
Search for dead transitions found 0 dead transitions in 60396ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61546 ms. Remains : 561/561 places, 761/761 transitions.
[2024-05-30 07:56:08] [INFO ] Flatten gal took : 51 ms
[2024-05-30 07:56:08] [INFO ] Flatten gal took : 41 ms
[2024-05-30 07:56:08] [INFO ] Input system was already deterministic with 763 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 562 transition count 762
Applied a total of 2 rules in 48 ms. Remains 562 /563 variables (removed 1) and now considering 762/763 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 49 ms. Remains : 562/563 places, 762/763 transitions.
[2024-05-30 07:56:08] [INFO ] Flatten gal took : 35 ms
[2024-05-30 07:56:08] [INFO ] Flatten gal took : 36 ms
[2024-05-30 07:56:08] [INFO ] Input system was already deterministic with 762 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 562 transition count 762
Applied a total of 2 rules in 32 ms. Remains 562 /563 variables (removed 1) and now considering 762/763 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 32 ms. Remains : 562/563 places, 762/763 transitions.
[2024-05-30 07:56:08] [INFO ] Flatten gal took : 31 ms
[2024-05-30 07:56:08] [INFO ] Flatten gal took : 32 ms
[2024-05-30 07:56:08] [INFO ] Input system was already deterministic with 762 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 562 transition count 762
Applied a total of 2 rules in 26 ms. Remains 562 /563 variables (removed 1) and now considering 762/763 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28 ms. Remains : 562/563 places, 762/763 transitions.
[2024-05-30 07:56:08] [INFO ] Flatten gal took : 32 ms
[2024-05-30 07:56:09] [INFO ] Flatten gal took : 34 ms
[2024-05-30 07:56:09] [INFO ] Input system was already deterministic with 762 transitions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Applied a total of 0 rules in 7 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 563/563 places, 763/763 transitions.
[2024-05-30 07:56:09] [INFO ] Flatten gal took : 32 ms
[2024-05-30 07:56:09] [INFO ] Flatten gal took : 32 ms
[2024-05-30 07:56:09] [INFO ] Input system was already deterministic with 763 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 562 transition count 762
Applied a total of 2 rules in 26 ms. Remains 562 /563 variables (removed 1) and now considering 762/763 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26 ms. Remains : 562/563 places, 762/763 transitions.
[2024-05-30 07:56:09] [INFO ] Flatten gal took : 29 ms
[2024-05-30 07:56:09] [INFO ] Flatten gal took : 30 ms
[2024-05-30 07:56:09] [INFO ] Input system was already deterministic with 762 transitions.
RANDOM walk for 872 steps (0 resets) in 14 ms. (58 steps per ms) remains 0/1 properties
FORMULA ShieldRVs-PT-040A-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Applied a total of 0 rules in 7 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 563/563 places, 763/763 transitions.
[2024-05-30 07:56:09] [INFO ] Flatten gal took : 30 ms
[2024-05-30 07:56:09] [INFO ] Flatten gal took : 32 ms
[2024-05-30 07:56:09] [INFO ] Input system was already deterministic with 763 transitions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Applied a total of 0 rules in 7 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 563/563 places, 763/763 transitions.
[2024-05-30 07:56:09] [INFO ] Flatten gal took : 27 ms
[2024-05-30 07:56:09] [INFO ] Flatten gal took : 28 ms
[2024-05-30 07:56:09] [INFO ] Input system was already deterministic with 763 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 562 transition count 762
Applied a total of 2 rules in 29 ms. Remains 562 /563 variables (removed 1) and now considering 762/763 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 29 ms. Remains : 562/563 places, 762/763 transitions.
[2024-05-30 07:56:09] [INFO ] Flatten gal took : 29 ms
[2024-05-30 07:56:09] [INFO ] Flatten gal took : 31 ms
[2024-05-30 07:56:09] [INFO ] Input system was already deterministic with 762 transitions.
RANDOM walk for 19259 steps (34 resets) in 225 ms. (85 steps per ms) remains 0/1 properties
FORMULA ShieldRVs-PT-040A-CTLFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 562 transition count 762
Applied a total of 2 rules in 25 ms. Remains 562 /563 variables (removed 1) and now considering 762/763 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26 ms. Remains : 562/563 places, 762/763 transitions.
[2024-05-30 07:56:09] [INFO ] Flatten gal took : 27 ms
[2024-05-30 07:56:09] [INFO ] Flatten gal took : 29 ms
[2024-05-30 07:56:10] [INFO ] Input system was already deterministic with 762 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 562 transition count 762
Applied a total of 2 rules in 27 ms. Remains 562 /563 variables (removed 1) and now considering 762/763 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 29 ms. Remains : 562/563 places, 762/763 transitions.
[2024-05-30 07:56:10] [INFO ] Flatten gal took : 26 ms
[2024-05-30 07:56:10] [INFO ] Flatten gal took : 29 ms
[2024-05-30 07:56:10] [INFO ] Input system was already deterministic with 762 transitions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Applied a total of 0 rules in 5 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 563/563 places, 763/763 transitions.
[2024-05-30 07:56:10] [INFO ] Flatten gal took : 27 ms
[2024-05-30 07:56:10] [INFO ] Flatten gal took : 30 ms
[2024-05-30 07:56:10] [INFO ] Input system was already deterministic with 763 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 562 transition count 762
Applied a total of 2 rules in 27 ms. Remains 562 /563 variables (removed 1) and now considering 762/763 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27 ms. Remains : 562/563 places, 762/763 transitions.
[2024-05-30 07:56:10] [INFO ] Flatten gal took : 28 ms
[2024-05-30 07:56:10] [INFO ] Flatten gal took : 29 ms
[2024-05-30 07:56:10] [INFO ] Input system was already deterministic with 762 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 562 transition count 762
Applied a total of 2 rules in 25 ms. Remains 562 /563 variables (removed 1) and now considering 762/763 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25 ms. Remains : 562/563 places, 762/763 transitions.
[2024-05-30 07:56:10] [INFO ] Flatten gal took : 27 ms
[2024-05-30 07:56:10] [INFO ] Flatten gal took : 30 ms
[2024-05-30 07:56:10] [INFO ] Input system was already deterministic with 762 transitions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Applied a total of 0 rules in 5 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 563/563 places, 763/763 transitions.
[2024-05-30 07:56:10] [INFO ] Flatten gal took : 26 ms
[2024-05-30 07:56:10] [INFO ] Flatten gal took : 27 ms
[2024-05-30 07:56:10] [INFO ] Input system was already deterministic with 763 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 562 transition count 762
Applied a total of 2 rules in 20 ms. Remains 562 /563 variables (removed 1) and now considering 762/763 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 562/563 places, 762/763 transitions.
[2024-05-30 07:56:10] [INFO ] Flatten gal took : 26 ms
[2024-05-30 07:56:10] [INFO ] Flatten gal took : 27 ms
[2024-05-30 07:56:10] [INFO ] Input system was already deterministic with 762 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 562 transition count 762
Applied a total of 2 rules in 20 ms. Remains 562 /563 variables (removed 1) and now considering 762/763 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 562/563 places, 762/763 transitions.
[2024-05-30 07:56:10] [INFO ] Flatten gal took : 27 ms
[2024-05-30 07:56:10] [INFO ] Flatten gal took : 31 ms
[2024-05-30 07:56:11] [INFO ] Input system was already deterministic with 762 transitions.
[2024-05-30 07:56:11] [INFO ] Flatten gal took : 35 ms
[2024-05-30 07:56:11] [INFO ] Flatten gal took : 34 ms
[2024-05-30 07:56:11] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 7 ms.
[2024-05-30 07:56:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 563 places, 763 transitions and 3680 arcs took 7 ms.
Total runtime 118885 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running ShieldRVs-PT-040A
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/409/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 563
TRANSITIONS: 763
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.019s, Sys 0.004s]
SAVING FILE /home/mcc/execution/409/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.003s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 2029
MODEL NAME: /home/mcc/execution/409/model
563 places, 763 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
BK_TIME_CONFINEMENT_REACHED
--------------------
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 CTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory
Error in allocating array of size 2097152 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVs-PT-040A"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is ShieldRVs-PT-040A, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r355-tall-171683759600834"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-040A.tgz
mv ShieldRVs-PT-040A execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;