About the Execution of LTSMin+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 |
| 1107.151 | 117264.00 | 169314.00 | 247.60 | ????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.r528-tall-171683761900834.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is ShieldRVs-PT-040A, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683761900834
=====================================================================
--------------------
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 1717268507163
Invoking MCC driver with
BK_TOOL=ltsminxred
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 ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 19:01:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 19:01:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 19:01:48] [INFO ] Load time of PNML (sax parser for PT used): 115 ms
[2024-06-01 19:01:48] [INFO ] Transformed 563 places.
[2024-06-01 19:01:48] [INFO ] Transformed 763 transitions.
[2024-06-01 19:01:48] [INFO ] Found NUPN structural information;
[2024-06-01 19:01:48] [INFO ] Parsed PT model containing 563 places and 763 transitions and 3680 arcs in 219 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 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 48 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
// Phase 1: matrix 763 rows 563 cols
[2024-06-01 19:01:48] [INFO ] Computed 161 invariants in 24 ms
[2024-06-01 19:01:49] [INFO ] Implicit Places using invariants in 466 ms returned []
[2024-06-01 19:01:49] [INFO ] Invariant cache hit.
[2024-06-01 19:01:49] [INFO ] Implicit Places using invariants and state equation in 553 ms returned []
Implicit Place search using SMT with State Equation took 1048 ms to find 0 implicit places.
Running 762 sub problems to find dead transitions.
[2024-06-01 19:01:49] [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-06-01 19:02:10] [INFO ] Deduced a trap composed of 8 places in 195 ms of which 23 ms to minimize.
[2024-06-01 19:02:10] [INFO ] Deduced a trap composed of 8 places in 160 ms of which 3 ms to minimize.
[2024-06-01 19:02:10] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 1 ms to minimize.
[2024-06-01 19:02:10] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 2 ms to minimize.
[2024-06-01 19:02:10] [INFO ] Deduced a trap composed of 12 places in 146 ms of which 2 ms to minimize.
[2024-06-01 19:02:10] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 2 ms to minimize.
[2024-06-01 19:02:10] [INFO ] Deduced a trap composed of 12 places in 141 ms of which 3 ms to minimize.
[2024-06-01 19:02:11] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 3 ms to minimize.
[2024-06-01 19:02:11] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 3 ms to minimize.
[2024-06-01 19:02:11] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 2 ms to minimize.
[2024-06-01 19:02:11] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 1 ms to minimize.
[2024-06-01 19:02:11] [INFO ] Deduced a trap composed of 17 places in 136 ms of which 2 ms to minimize.
[2024-06-01 19:02:11] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 3 ms to minimize.
[2024-06-01 19:02:12] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 3 ms to minimize.
[2024-06-01 19:02:12] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 1 ms to minimize.
[2024-06-01 19:02:12] [INFO ] Deduced a trap composed of 14 places in 150 ms of which 3 ms to minimize.
[2024-06-01 19:02:12] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 2 ms to minimize.
[2024-06-01 19:02:12] [INFO ] Deduced a trap composed of 14 places in 159 ms of which 2 ms to minimize.
[2024-06-01 19:02:12] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 2 ms to minimize.
[2024-06-01 19:02:13] [INFO ] Deduced a trap composed of 13 places in 158 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-06-01 19:02:13] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 2 ms to minimize.
[2024-06-01 19:02:13] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 2 ms to minimize.
[2024-06-01 19:02:13] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 1 ms to minimize.
[2024-06-01 19:02:14] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 2 ms to minimize.
[2024-06-01 19:02:14] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 3 ms to minimize.
[2024-06-01 19:02:14] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 1 ms to minimize.
[2024-06-01 19:02:14] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 2 ms to minimize.
[2024-06-01 19:02:14] [INFO ] Deduced a trap composed of 14 places in 179 ms of which 2 ms to minimize.
[2024-06-01 19:02:15] [INFO ] Deduced a trap composed of 13 places in 150 ms of which 3 ms to minimize.
[2024-06-01 19:02:15] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 1 ms to minimize.
[2024-06-01 19:02:15] [INFO ] Deduced a trap composed of 13 places in 162 ms of which 3 ms to minimize.
[2024-06-01 19:02:15] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 2 ms to minimize.
[2024-06-01 19:02:15] [INFO ] Deduced a trap composed of 18 places in 142 ms of which 2 ms to minimize.
[2024-06-01 19:02:15] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 3 ms to minimize.
[2024-06-01 19:02:16] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 2 ms to minimize.
[2024-06-01 19:02:16] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 2 ms to minimize.
[2024-06-01 19:02:16] [INFO ] Deduced a trap composed of 21 places in 148 ms of which 2 ms to minimize.
[2024-06-01 19:02:16] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 2 ms to minimize.
[2024-06-01 19:02:16] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 2 ms to minimize.
[2024-06-01 19:02:16] [INFO ] Deduced a trap composed of 17 places in 146 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-06-01 19:02:17] [INFO ] Deduced a trap composed of 14 places in 147 ms of which 3 ms to minimize.
[2024-06-01 19:02:17] [INFO ] Deduced a trap composed of 12 places in 146 ms of which 2 ms to minimize.
[2024-06-01 19:02:17] [INFO ] Deduced a trap composed of 14 places in 151 ms of which 2 ms to minimize.
[2024-06-01 19:02:17] [INFO ] Deduced a trap composed of 14 places in 148 ms of which 2 ms to minimize.
[2024-06-01 19:02:18] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 2 ms to minimize.
[2024-06-01 19:02:18] [INFO ] Deduced a trap composed of 13 places in 156 ms of which 2 ms to minimize.
[2024-06-01 19:02:18] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 2 ms to minimize.
[2024-06-01 19:02:18] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 2 ms to minimize.
[2024-06-01 19:02:19] [INFO ] Deduced a trap composed of 15 places in 156 ms of which 2 ms to minimize.
[2024-06-01 19:02:19] [INFO ] Deduced a trap composed of 13 places in 158 ms of which 2 ms to minimize.
[2024-06-01 19:02:19] [INFO ] Deduced a trap composed of 14 places in 150 ms of which 3 ms to minimize.
[2024-06-01 19:02:19] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 3 ms to minimize.
[2024-06-01 19:02:19] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 2 ms to minimize.
[2024-06-01 19:02:20] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 1 ms to minimize.
[2024-06-01 19:02:20] [INFO ] Deduced a trap composed of 12 places in 155 ms of which 2 ms to minimize.
SMT process timed out in 30560ms, After SMT, problems are : Problem set: 0 solved, 762 unsolved
Search for dead transitions found 0 dead transitions in 30583ms
Finished structural reductions in LTL mode , in 1 iterations and 31707 ms. Remains : 563/563 places, 763/763 transitions.
Support contains 234 out of 563 places after structural reductions.
[2024-06-01 19:02:20] [INFO ] Flatten gal took : 122 ms
[2024-06-01 19:02:20] [INFO ] Flatten gal took : 73 ms
[2024-06-01 19:02:20] [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 2007 ms. (19 steps per ms) remains 8/84 properties
BEST_FIRST walk for 40003 steps (8 resets) in 345 ms. (115 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 366 ms. (109 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 190 ms. (209 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 186 ms. (213 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 117 ms. (339 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 2/2 properties
[2024-06-01 19:02:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 31/43 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 31/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 520/563 variables, 150/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 520/724 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:02:22] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 9 ms to minimize.
[2024-06-01 19:02:22] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 2 ms to minimize.
[2024-06-01 19:02:22] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 2 ms to minimize.
[2024-06-01 19:02:22] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
[2024-06-01 19:02:22] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2024-06-01 19:02:22] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 2 ms to minimize.
[2024-06-01 19:02:22] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-06-01 19:02:22] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:02:22] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 2 ms to minimize.
[2024-06-01 19:02:23] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2024-06-01 19:02:23] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2024-06-01 19:02:23] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 2 ms to minimize.
[2024-06-01 19:02:23] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 1 ms to minimize.
[2024-06-01 19:02:23] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2024-06-01 19:02:23] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2024-06-01 19:02:23] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 16/740 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 763/1326 variables, 563/1303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:02:23] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 2 ms to minimize.
[2024-06-01 19:02:23] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 1 ms to minimize.
[2024-06-01 19:02:23] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 1 ms to minimize.
[2024-06-01 19:02:24] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:02:24] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:02:24] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 0 ms to minimize.
[2024-06-01 19:02:24] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1326 variables, 7/1310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1326 variables, 0/1310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/1326 variables, 0/1310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1326/1326 variables, and 1310 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2449 ms.
Refiners :[Domain max(s): 563/563 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 563/563 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 31/43 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 31/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 520/563 variables, 150/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 520/724 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 23/747 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:02:24] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
[2024-06-01 19:02:24] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2024-06-01 19:02:24] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 2 ms to minimize.
[2024-06-01 19:02:24] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:02:24] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2024-06-01 19:02:25] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-06-01 19:02:25] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2024-06-01 19:02:25] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-06-01 19:02:25] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 0 ms to minimize.
[2024-06-01 19:02:25] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-06-01 19:02:25] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2024-06-01 19:02:25] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-06-01 19:02:25] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 13/760 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/563 variables, 0/760 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 763/1326 variables, 563/1323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1326 variables, 2/1325 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:02:25] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 2 ms to minimize.
[2024-06-01 19:02:25] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 2 ms to minimize.
[2024-06-01 19:02:26] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 1 ms to minimize.
[2024-06-01 19:02:26] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 1 ms to minimize.
[2024-06-01 19:02:26] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 2 ms to minimize.
[2024-06-01 19:02:26] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-06-01 19:02:26] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 2 ms to minimize.
[2024-06-01 19:02:26] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 2 ms to minimize.
[2024-06-01 19:02:26] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 1 ms to minimize.
[2024-06-01 19:02:26] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 2 ms to minimize.
[2024-06-01 19:02:26] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2024-06-01 19:02:26] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-06-01 19:02:27] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2024-06-01 19:02:27] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 2 ms to minimize.
[2024-06-01 19:02:27] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2024-06-01 19:02:27] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2024-06-01 19:02:27] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-06-01 19:02:27] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 1 ms to minimize.
[2024-06-01 19:02:27] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 1 ms to minimize.
[2024-06-01 19:02:27] [INFO ] Deduced a trap composed of 29 places in 61 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, 2 unsolved
[2024-06-01 19:02:27] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-06-01 19:02:28] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-06-01 19:02:28] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-06-01 19:02:28] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 0 ms to minimize.
[2024-06-01 19:02:28] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 0 ms to minimize.
[2024-06-01 19:02:28] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:02:28] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:02:28] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-06-01 19:02:28] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-06-01 19:02:28] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-06-01 19:02:28] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2024-06-01 19:02:28] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-06-01 19:02:28] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 0 ms to minimize.
[2024-06-01 19:02:28] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-06-01 19:02:28] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 0 ms to minimize.
[2024-06-01 19:02:29] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1326 variables, 16/1361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:02:29] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-06-01 19:02:29] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2024-06-01 19:02:29] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 0 ms to minimize.
[2024-06-01 19:02:29] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-06-01 19:02:29] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
SMT process timed out in 7482ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 12 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 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
Partial Free-agglomeration rule applied 81 times.
Drop transitions (Partial Free agglomeration) removed 81 transitions
Iterating global reduction 0 with 81 rules applied. Total rules applied 83 place count 562 transition count 762
Applied a total of 83 rules in 144 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 145 ms. Remains : 562/563 places, 762/763 transitions.
RANDOM walk for 40000 steps (84 resets) in 601 ms. (66 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 162 ms. (245 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 1/1 properties
// Phase 1: matrix 762 rows 562 cols
[2024-06-01 19:02:29] [INFO ] Computed 161 invariants in 11 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-06-01 19:02:30] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 2 ms to minimize.
[2024-06-01 19:02:30] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 1 ms to minimize.
[2024-06-01 19:02:30] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 1 ms to minimize.
[2024-06-01 19:02:30] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 2 ms to minimize.
[2024-06-01 19:02:30] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
[2024-06-01 19:02:30] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 1 ms to minimize.
[2024-06-01 19:02:30] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2024-06-01 19:02:30] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2024-06-01 19:02:30] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-06-01 19:02:30] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/562 variables, 10/733 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/562 variables, 0/733 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 762/1324 variables, 562/1295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:02:31] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 2 ms to minimize.
[2024-06-01 19:02:31] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 2 ms to minimize.
[2024-06-01 19:02:31] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 2 ms to minimize.
[2024-06-01 19:02:31] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 1 ms to minimize.
[2024-06-01 19:02:31] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 2 ms to minimize.
[2024-06-01 19:02:31] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1324 variables, 6/1301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1324 variables, 0/1301 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/1301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1324/1324 variables, and 1301 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1898 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: 16/16 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, 16/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:02:32] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 1 ms to minimize.
[2024-06-01 19:02:32] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
[2024-06-01 19:02:32] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 2 ms to minimize.
[2024-06-01 19:02:32] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
[2024-06-01 19:02:32] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 2 ms to minimize.
[2024-06-01 19:02:32] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 2 ms to minimize.
[2024-06-01 19:02:32] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
[2024-06-01 19:02:32] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2024-06-01 19:02:32] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:02:32] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-06-01 19:02:32] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-06-01 19:02:32] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-06-01 19:02:32] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-06-01 19:02:32] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
[2024-06-01 19:02:32] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/562 variables, 15/754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/562 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 762/1324 variables, 562/1316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1324 variables, 1/1317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:02:33] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 1 ms to minimize.
[2024-06-01 19:02:33] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2024-06-01 19:02:33] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
[2024-06-01 19:02:33] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1324 variables, 4/1321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1324 variables, 0/1321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1324 variables, 0/1321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1324/1324 variables, and 1321 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1816 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: 35/35 constraints]
After SMT, in 3746ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 185 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.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 561 transition count 761
Applied a total of 1 rules in 212 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 212 ms. Remains : 561/562 places, 761/762 transitions.
RANDOM walk for 40000 steps (84 resets) in 267 ms. (149 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 469231 steps, run timeout after 3001 ms. (steps per millisecond=156 ) properties seen :0 out of 1
Probabilistic random walk after 469231 steps, saw 367735 distinct states, run finished after 3005 ms. (steps per millisecond=156 ) properties seen :0
// Phase 1: matrix 761 rows 561 cols
[2024-06-01 19:02:37] [INFO ] Computed 161 invariants in 9 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
All remaining problems are real, not stopping.
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
At refinement iteration 50 (INCLUDED_ONLY) 0/844 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 6/850 variables, 3/792 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/850 variables, 6/798 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/850 variables, 6/804 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/850 variables, 0/804 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (OVERLAPS) 93/943 variables, 36/840 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/943 variables, 36/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/943 variables, 9/885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/943 variables, 0/885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 6/949 variables, 3/888 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/949 variables, 6/894 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/949 variables, 6/900 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/949 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (OVERLAPS) 93/1042 variables, 36/936 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1042 variables, 36/972 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1042 variables, 9/981 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1042 variables, 0/981 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (OVERLAPS) 6/1048 variables, 3/984 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1048 variables, 6/990 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1048 variables, 6/996 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1048 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (OVERLAPS) 58/1106 variables, 28/1024 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1106 variables, 28/1052 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1106 variables, 8/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1106 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (OVERLAPS) 2/1108 variables, 1/1061 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1108 variables, 2/1063 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1108 variables, 2/1065 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1108 variables, 0/1065 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (OVERLAPS) 33/1141 variables, 14/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1141 variables, 14/1093 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1141 variables, 4/1097 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1141 variables, 0/1097 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (OVERLAPS) 2/1143 variables, 1/1098 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1143 variables, 2/1100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1143 variables, 2/1102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1143 variables, 0/1102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (OVERLAPS) 31/1174 variables, 12/1114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1174 variables, 12/1126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1174 variables, 3/1129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1174 variables, 0/1129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (OVERLAPS) 2/1176 variables, 1/1130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1176 variables, 2/1132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1176 variables, 2/1134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/1176 variables, 0/1134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (OVERLAPS) 31/1207 variables, 12/1146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1207 variables, 12/1158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/1207 variables, 3/1161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1207 variables, 0/1161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (OVERLAPS) 2/1209 variables, 1/1162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/1209 variables, 2/1164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1209 variables, 2/1166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/1209 variables, 0/1166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (OVERLAPS) 31/1240 variables, 12/1178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1240 variables, 12/1190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/1240 variables, 3/1193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/1240 variables, 0/1193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (OVERLAPS) 2/1242 variables, 1/1194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/1242 variables, 2/1196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/1242 variables, 2/1198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/1242 variables, 0/1198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (OVERLAPS) 31/1273 variables, 12/1210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/1273 variables, 12/1222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/1273 variables, 3/1225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/1273 variables, 0/1225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (OVERLAPS) 2/1275 variables, 1/1226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/1275 variables, 2/1228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/1275 variables, 2/1230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/1275 variables, 0/1230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (OVERLAPS) 31/1306 variables, 12/1242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/1306 variables, 12/1254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/1306 variables, 3/1257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/1306 variables, 0/1257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 123 (OVERLAPS) 2/1308 variables, 1/1258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/1308 variables, 2/1260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/1308 variables, 2/1262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/1308 variables, 0/1262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 127 (OVERLAPS) 14/1322 variables, 9/1271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/1322 variables, 9/1280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/1322 variables, 3/1283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 130 (INCLUDED_ONLY) 0/1322 variables, 0/1283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 131 (OVERLAPS) 0/1322 variables, 0/1283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1322/1322 variables, and 1283 constraints, problems are : Problem set: 0 solved, 1 unsolved in 738 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: 0/0 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
At refinement iteration 19 (INCLUDED_ONLY) 0/346 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 8/354 variables, 4/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/354 variables, 8/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/354 variables, 8/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:02:38] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/354 variables, 1/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
[2024-06-01 19:02:38] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/478 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/478 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 8/486 variables, 4/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/486 variables, 8/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/486 variables, 8/445 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/486 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 124/610 variables, 48/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/610 variables, 48/541 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/610 variables, 12/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/610 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 8/618 variables, 4/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/618 variables, 8/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/618 variables, 8/573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/618 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 121/739 variables, 48/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/739 variables, 48/669 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/739 variables, 12/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
[2024-06-01 19:02:38] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
At refinement iteration 49 (INCLUDED_ONLY) 0/747 variables, 1/702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/747 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 97/844 variables, 40/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/844 variables, 40/782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/844 variables, 11/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:02:38] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
At refinement iteration 54 (INCLUDED_ONLY) 0/844 variables, 1/794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/844 variables, 0/794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 6/850 variables, 3/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/850 variables, 6/803 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/850 variables, 6/809 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/850 variables, 0/809 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (OVERLAPS) 93/943 variables, 36/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/943 variables, 36/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/943 variables, 9/890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:02:38] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 0 ms to minimize.
At refinement iteration 63 (INCLUDED_ONLY) 0/943 variables, 1/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/943 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (OVERLAPS) 6/949 variables, 3/894 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/949 variables, 6/900 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/949 variables, 6/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/949 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (OVERLAPS) 93/1042 variables, 36/942 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1042 variables, 36/978 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1042 variables, 9/987 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:02:38] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 0 ms to minimize.
At refinement iteration 72 (INCLUDED_ONLY) 0/1042 variables, 1/988 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1042 variables, 0/988 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (OVERLAPS) 6/1048 variables, 3/991 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1048 variables, 6/997 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1048 variables, 6/1003 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1048 variables, 0/1003 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (OVERLAPS) 58/1106 variables, 28/1031 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1106 variables, 28/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1106 variables, 8/1067 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1106 variables, 0/1067 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (OVERLAPS) 2/1108 variables, 1/1068 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1108 variables, 2/1070 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1108 variables, 2/1072 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1108 variables, 0/1072 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (OVERLAPS) 33/1141 variables, 14/1086 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1141 variables, 14/1100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1141 variables, 4/1104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:02:39] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
At refinement iteration 89 (INCLUDED_ONLY) 0/1141 variables, 1/1105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1141 variables, 0/1105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (OVERLAPS) 2/1143 variables, 1/1106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1143 variables, 2/1108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1143 variables, 2/1110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/1143 variables, 0/1110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (OVERLAPS) 31/1174 variables, 12/1122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1174 variables, 12/1134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/1174 variables, 3/1137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:02:39] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
At refinement iteration 98 (INCLUDED_ONLY) 0/1174 variables, 1/1138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/1174 variables, 0/1138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (OVERLAPS) 2/1176 variables, 1/1139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1176 variables, 2/1141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/1176 variables, 2/1143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/1176 variables, 0/1143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (OVERLAPS) 31/1207 variables, 12/1155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/1207 variables, 12/1167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/1207 variables, 3/1170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:02:39] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 0 ms to minimize.
[2024-06-01 19:02:39] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
At refinement iteration 107 (INCLUDED_ONLY) 0/1207 variables, 2/1172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/1207 variables, 0/1172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (OVERLAPS) 2/1209 variables, 1/1173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/1209 variables, 2/1175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/1209 variables, 2/1177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/1209 variables, 0/1177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (OVERLAPS) 31/1240 variables, 12/1189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/1240 variables, 12/1201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/1240 variables, 3/1204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/1240 variables, 0/1204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (OVERLAPS) 2/1242 variables, 1/1205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/1242 variables, 2/1207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/1242 variables, 2/1209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/1242 variables, 0/1209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (OVERLAPS) 31/1273 variables, 12/1221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/1273 variables, 12/1233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/1273 variables, 3/1236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/1273 variables, 0/1236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 125 (OVERLAPS) 2/1275 variables, 1/1237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/1275 variables, 2/1239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 127 (INCLUDED_ONLY) 0/1275 variables, 2/1241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/1275 variables, 0/1241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 129 (OVERLAPS) 31/1306 variables, 12/1253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 130 (INCLUDED_ONLY) 0/1306 variables, 12/1265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/1306 variables, 3/1268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/1306 variables, 0/1268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 133 (OVERLAPS) 2/1308 variables, 1/1269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/1308 variables, 2/1271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 135 (INCLUDED_ONLY) 0/1308 variables, 2/1273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 136 (INCLUDED_ONLY) 0/1308 variables, 0/1273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 137 (OVERLAPS) 14/1322 variables, 9/1282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 138 (INCLUDED_ONLY) 0/1322 variables, 9/1291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 139 (INCLUDED_ONLY) 0/1322 variables, 3/1294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/1322 variables, 0/1294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:02:39] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 1 ms to minimize.
At refinement iteration 141 (OVERLAPS) 0/1322 variables, 1/1295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 142 (INCLUDED_ONLY) 0/1322 variables, 0/1295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 143 (OVERLAPS) 0/1322 variables, 0/1295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1322/1322 variables, and 1295 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1886 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: 11/11 constraints]
After SMT, in 2639ms 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 25 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 25 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 99 ms. Remains 561 /561 variables (removed 0) and now considering 761/761 (removed 0) transitions.
[2024-06-01 19:02:39] [INFO ] Invariant cache hit.
[2024-06-01 19:02:40] [INFO ] Implicit Places using invariants in 285 ms returned []
[2024-06-01 19:02:40] [INFO ] Invariant cache hit.
[2024-06-01 19:02:40] [INFO ] Implicit Places using invariants and state equation in 638 ms returned []
Implicit Place search using SMT with State Equation took 925 ms to find 0 implicit places.
[2024-06-01 19:02:41] [INFO ] Redundant transitions in 91 ms returned []
Running 760 sub problems to find dead transitions.
[2024-06-01 19:02:41] [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-06-01 19:02:47] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 2 ms to minimize.
[2024-06-01 19:02:47] [INFO ] Deduced a trap composed of 6 places in 108 ms of which 2 ms to minimize.
[2024-06-01 19:02:47] [INFO ] Deduced a trap composed of 5 places in 113 ms of which 2 ms to minimize.
[2024-06-01 19:02:48] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 2 ms to minimize.
[2024-06-01 19:02:48] [INFO ] Deduced a trap composed of 6 places in 108 ms of which 1 ms to minimize.
[2024-06-01 19:02:48] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 1 ms to minimize.
[2024-06-01 19:02:48] [INFO ] Deduced a trap composed of 6 places in 107 ms of which 2 ms to minimize.
[2024-06-01 19:02:48] [INFO ] Deduced a trap composed of 6 places in 164 ms of which 3 ms to minimize.
[2024-06-01 19:02:48] [INFO ] Deduced a trap composed of 6 places in 171 ms of which 2 ms to minimize.
[2024-06-01 19:02:48] [INFO ] Deduced a trap composed of 6 places in 164 ms of which 2 ms to minimize.
[2024-06-01 19:02:49] [INFO ] Deduced a trap composed of 6 places in 152 ms of which 2 ms to minimize.
[2024-06-01 19:02:49] [INFO ] Deduced a trap composed of 6 places in 173 ms of which 2 ms to minimize.
[2024-06-01 19:02:49] [INFO ] Deduced a trap composed of 6 places in 166 ms of which 2 ms to minimize.
[2024-06-01 19:02:49] [INFO ] Deduced a trap composed of 6 places in 159 ms of which 3 ms to minimize.
[2024-06-01 19:02:49] [INFO ] Deduced a trap composed of 6 places in 168 ms of which 3 ms to minimize.
[2024-06-01 19:02:50] [INFO ] Deduced a trap composed of 6 places in 161 ms of which 3 ms to minimize.
[2024-06-01 19:02:50] [INFO ] Deduced a trap composed of 6 places in 155 ms of which 3 ms to minimize.
[2024-06-01 19:02:50] [INFO ] Deduced a trap composed of 10 places in 167 ms of which 3 ms to minimize.
[2024-06-01 19:02:50] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 2 ms to minimize.
[2024-06-01 19:02:50] [INFO ] Deduced a trap composed of 9 places in 115 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-06-01 19:02:50] [INFO ] Deduced a trap composed of 6 places in 109 ms of which 1 ms to minimize.
[2024-06-01 19:02:51] [INFO ] Deduced a trap composed of 6 places in 124 ms of which 2 ms to minimize.
[2024-06-01 19:02:51] [INFO ] Deduced a trap composed of 6 places in 132 ms of which 2 ms to minimize.
[2024-06-01 19:02:51] [INFO ] Deduced a trap composed of 6 places in 129 ms of which 2 ms to minimize.
[2024-06-01 19:02:51] [INFO ] Deduced a trap composed of 6 places in 133 ms of which 2 ms to minimize.
[2024-06-01 19:02:51] [INFO ] Deduced a trap composed of 6 places in 132 ms of which 2 ms to minimize.
[2024-06-01 19:02:51] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 2 ms to minimize.
[2024-06-01 19:02:51] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 2 ms to minimize.
[2024-06-01 19:02:52] [INFO ] Deduced a trap composed of 6 places in 124 ms of which 2 ms to minimize.
[2024-06-01 19:02:52] [INFO ] Deduced a trap composed of 6 places in 124 ms of which 1 ms to minimize.
[2024-06-01 19:02:52] [INFO ] Deduced a trap composed of 6 places in 132 ms of which 2 ms to minimize.
[2024-06-01 19:02:52] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 2 ms to minimize.
[2024-06-01 19:02:52] [INFO ] Deduced a trap composed of 6 places in 123 ms of which 2 ms to minimize.
[2024-06-01 19:02:52] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 1 ms to minimize.
[2024-06-01 19:02:53] [INFO ] Deduced a trap composed of 6 places in 172 ms of which 2 ms to minimize.
[2024-06-01 19:02:54] [INFO ] Deduced a trap composed of 6 places in 183 ms of which 2 ms to minimize.
[2024-06-01 19:02:54] [INFO ] Deduced a trap composed of 6 places in 169 ms of which 3 ms to minimize.
[2024-06-01 19:02:54] [INFO ] Deduced a trap composed of 6 places in 177 ms of which 4 ms to minimize.
[2024-06-01 19:02:54] [INFO ] Deduced a trap composed of 6 places in 170 ms of which 3 ms to minimize.
[2024-06-01 19:02:54] [INFO ] Deduced a trap composed of 6 places in 166 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/561 variables, 20/762 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:03:01] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 1 ms to minimize.
[2024-06-01 19:03:01] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 1 ms to minimize.
[2024-06-01 19:03:01] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-06-01 19:03:01] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 1 ms to minimize.
[2024-06-01 19:03:01] [INFO ] Deduced a trap composed of 6 places in 166 ms of which 3 ms to minimize.
[2024-06-01 19:03:01] [INFO ] Deduced a trap composed of 6 places in 170 ms of which 3 ms to minimize.
[2024-06-01 19:03:01] [INFO ] Deduced a trap composed of 6 places in 167 ms of which 3 ms to minimize.
[2024-06-01 19:03:02] [INFO ] Deduced a trap composed of 18 places in 155 ms of which 2 ms to minimize.
[2024-06-01 19:03:02] [INFO ] Deduced a trap composed of 17 places in 147 ms of which 3 ms to minimize.
[2024-06-01 19:03:02] [INFO ] Deduced a trap composed of 6 places in 145 ms of which 3 ms to minimize.
[2024-06-01 19:03:02] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 3 ms to minimize.
[2024-06-01 19:03:02] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:03:02] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2024-06-01 19:03:02] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 2 ms to minimize.
[2024-06-01 19:03:02] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-06-01 19:03:02] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-06-01 19:03:02] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
[2024-06-01 19:03:02] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-06-01 19:03:03] [INFO ] Deduced a trap composed of 10 places in 170 ms of which 2 ms to minimize.
[2024-06-01 19:03:03] [INFO ] Deduced a trap composed of 10 places in 153 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-06-01 19:03:03] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 0 ms to minimize.
[2024-06-01 19:03:03] [INFO ] Deduced a trap composed of 21 places in 153 ms of which 7 ms to minimize.
[2024-06-01 19:03:03] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:03:04] [INFO ] Deduced a trap composed of 14 places in 177 ms of which 3 ms to minimize.
[2024-06-01 19:03:04] [INFO ] Deduced a trap composed of 10 places in 168 ms of which 3 ms to minimize.
[2024-06-01 19:03:04] [INFO ] Deduced a trap composed of 6 places in 160 ms of which 2 ms to minimize.
[2024-06-01 19:03:04] [INFO ] Deduced a trap composed of 10 places in 176 ms of which 3 ms to minimize.
[2024-06-01 19:03:05] [INFO ] Deduced a trap composed of 6 places in 179 ms of which 3 ms to minimize.
[2024-06-01 19:03:05] [INFO ] Deduced a trap composed of 21 places in 145 ms of which 2 ms to minimize.
[2024-06-01 19:03:05] [INFO ] Deduced a trap composed of 20 places in 176 ms of which 3 ms to minimize.
[2024-06-01 19:03:05] [INFO ] Deduced a trap composed of 10 places in 168 ms of which 4 ms to minimize.
[2024-06-01 19:03:05] [INFO ] Deduced a trap composed of 6 places in 175 ms of which 3 ms to minimize.
[2024-06-01 19:03:06] [INFO ] Deduced a trap composed of 16 places in 173 ms of which 2 ms to minimize.
[2024-06-01 19:03:06] [INFO ] Deduced a trap composed of 10 places in 173 ms of which 3 ms to minimize.
[2024-06-01 19:03:06] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-06-01 19:03:06] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-06-01 19:03:06] [INFO ] Deduced a trap composed of 6 places in 170 ms of which 4 ms to minimize.
[2024-06-01 19:03:06] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 1 ms to minimize.
[2024-06-01 19:03:07] [INFO ] Deduced a trap composed of 14 places in 166 ms of which 2 ms to minimize.
[2024-06-01 19:03:07] [INFO ] Deduced a trap composed of 6 places in 69 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-06-01 19:03:07] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
[2024-06-01 19:03:09] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-06-01 19:03:10] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2024-06-01 19:03:10] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 1.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 1.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 1.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 1.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 1.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 1.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 1.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 1.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 1.0)
(s170 1.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 1.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 1.0)
(s184 0.0)
(s185 1.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 1.0)
(s190 1.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 1.0)
(s198 1.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 1.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 1.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 1.0)
(s218 1.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 561/1322 variables, and 806 constraints, problems are : Problem set: 0 solved, 760 unsolved in 30027 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: 84/84 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, 84/806 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:03:12] [INFO ] Deduced a trap composed of 15 places in 178 ms of which 3 ms to minimize.
[2024-06-01 19:03:12] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-06-01 19:03:12] [INFO ] Deduced a trap composed of 12 places in 168 ms of which 3 ms to minimize.
[2024-06-01 19:03:12] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
[2024-06-01 19:03:12] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 2 ms to minimize.
[2024-06-01 19:03:12] [INFO ] Deduced a trap composed of 10 places in 163 ms of which 3 ms to minimize.
[2024-06-01 19:03:13] [INFO ] Deduced a trap composed of 10 places in 158 ms of which 2 ms to minimize.
[2024-06-01 19:03:13] [INFO ] Deduced a trap composed of 6 places in 155 ms of which 2 ms to minimize.
[2024-06-01 19:03:13] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 0 ms to minimize.
[2024-06-01 19:03:13] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 2 ms to minimize.
[2024-06-01 19:03:14] [INFO ] Deduced a trap composed of 19 places in 161 ms of which 3 ms to minimize.
[2024-06-01 19:03:14] [INFO ] Deduced a trap composed of 109 places in 159 ms of which 2 ms to minimize.
[2024-06-01 19:03:14] [INFO ] Deduced a trap composed of 10 places in 154 ms of which 3 ms to minimize.
[2024-06-01 19:03:14] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-06-01 19:03:14] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:03:14] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 3 ms to minimize.
[2024-06-01 19:03:15] [INFO ] Deduced a trap composed of 28 places in 154 ms of which 2 ms to minimize.
[2024-06-01 19:03:15] [INFO ] Deduced a trap composed of 10 places in 170 ms of which 2 ms to minimize.
[2024-06-01 19:03:15] [INFO ] Deduced a trap composed of 25 places in 157 ms of which 3 ms to minimize.
[2024-06-01 19:03:15] [INFO ] Deduced a trap composed of 10 places in 175 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/561 variables, 20/826 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:03:15] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-06-01 19:03:16] [INFO ] Deduced a trap composed of 10 places in 139 ms of which 2 ms to minimize.
[2024-06-01 19:03:16] [INFO ] Deduced a trap composed of 18 places in 157 ms of which 2 ms to minimize.
[2024-06-01 19:03:16] [INFO ] Deduced a trap composed of 10 places in 154 ms of which 3 ms to minimize.
[2024-06-01 19:03:16] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 3 ms to minimize.
[2024-06-01 19:03:17] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 3 ms to minimize.
[2024-06-01 19:03:17] [INFO ] Deduced a trap composed of 10 places in 153 ms of which 3 ms to minimize.
[2024-06-01 19:03:17] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
[2024-06-01 19:03:17] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-06-01 19:03:17] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-06-01 19:03:17] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-06-01 19:03:17] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:03:17] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-06-01 19:03:17] [INFO ] Deduced a trap composed of 6 places in 148 ms of which 3 ms to minimize.
[2024-06-01 19:03:18] [INFO ] Deduced a trap composed of 22 places in 164 ms of which 5 ms to minimize.
[2024-06-01 19:03:18] [INFO ] Deduced a trap composed of 21 places in 146 ms of which 3 ms to minimize.
[2024-06-01 19:03:18] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 2 ms to minimize.
[2024-06-01 19:03:18] [INFO ] Deduced a trap composed of 10 places in 154 ms of which 3 ms to minimize.
[2024-06-01 19:03:18] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 1 ms to minimize.
[2024-06-01 19:03:19] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/561 variables, 20/846 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:03:19] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-06-01 19:03:19] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-06-01 19:03:19] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2024-06-01 19:03:19] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-06-01 19:03:19] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2024-06-01 19:03:19] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 2 ms to minimize.
[2024-06-01 19:03:20] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-06-01 19:03:20] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-06-01 19:03:20] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-06-01 19:03:20] [INFO ] Deduced a trap composed of 6 places in 160 ms of which 3 ms to minimize.
[2024-06-01 19:03:20] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 0 ms to minimize.
[2024-06-01 19:03:20] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 0 ms to minimize.
[2024-06-01 19:03:20] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-06-01 19:03:20] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-06-01 19:03:20] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-06-01 19:03:20] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2024-06-01 19:03:21] [INFO ] Deduced a trap composed of 18 places in 136 ms of which 3 ms to minimize.
[2024-06-01 19:03:21] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-06-01 19:03:21] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:03:21] [INFO ] Deduced a trap composed of 113 places in 118 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/561 variables, 20/866 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:03:22] [INFO ] Deduced a trap composed of 12 places in 157 ms of which 3 ms to minimize.
[2024-06-01 19:03:22] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2024-06-01 19:03:22] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 0 ms to minimize.
[2024-06-01 19:03:22] [INFO ] Deduced a trap composed of 14 places in 149 ms of which 2 ms to minimize.
[2024-06-01 19:03:22] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 1 ms to minimize.
[2024-06-01 19:03:23] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 1 ms to minimize.
[2024-06-01 19:03:23] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 3 ms to minimize.
[2024-06-01 19:03:23] [INFO ] Deduced a trap composed of 6 places in 175 ms of which 3 ms to minimize.
[2024-06-01 19:03:23] [INFO ] Deduced a trap composed of 10 places in 172 ms of which 2 ms to minimize.
[2024-06-01 19:03:23] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 2 ms to minimize.
[2024-06-01 19:03:23] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-06-01 19:03:24] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:03:24] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:03:24] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-06-01 19:03:24] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 0 ms to minimize.
[2024-06-01 19:03:24] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 2 ms to minimize.
[2024-06-01 19:03:24] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 1 ms to minimize.
[2024-06-01 19:03:24] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:03:24] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2024-06-01 19:03:24] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 20/886 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:03:25] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2024-06-01 19:03:25] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2024-06-01 19:03:25] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-06-01 19:03:25] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2024-06-01 19:03:26] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 2 ms to minimize.
[2024-06-01 19:03:26] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 2 ms to minimize.
[2024-06-01 19:03:26] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 2 ms to minimize.
[2024-06-01 19:03:26] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 2 ms to minimize.
[2024-06-01 19:03:26] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-06-01 19:03:26] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 0 ms to minimize.
[2024-06-01 19:03:26] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 0 ms to minimize.
[2024-06-01 19:03:26] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-06-01 19:03:26] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-06-01 19:03:27] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 3 ms to minimize.
[2024-06-01 19:03:27] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-06-01 19:03:27] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-06-01 19:03:27] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 2 ms to minimize.
[2024-06-01 19:03:27] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 1 ms to minimize.
[2024-06-01 19:03:27] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 2 ms to minimize.
[2024-06-01 19:03:27] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/561 variables, 20/906 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:03:28] [INFO ] Deduced a trap composed of 10 places in 168 ms of which 3 ms to minimize.
[2024-06-01 19:03:28] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 0 ms to minimize.
[2024-06-01 19:03:29] [INFO ] Deduced a trap composed of 8 places in 165 ms of which 3 ms to minimize.
[2024-06-01 19:03:29] [INFO ] Deduced a trap composed of 9 places in 165 ms of which 2 ms to minimize.
[2024-06-01 19:03:29] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-06-01 19:03:29] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2024-06-01 19:03:29] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 1 ms to minimize.
[2024-06-01 19:03:29] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 1 ms to minimize.
[2024-06-01 19:03:30] [INFO ] Deduced a trap composed of 10 places in 168 ms of which 2 ms to minimize.
[2024-06-01 19:03:30] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 1 ms to minimize.
[2024-06-01 19:03:30] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 1 ms to minimize.
[2024-06-01 19:03:30] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 2 ms to minimize.
[2024-06-01 19:03:30] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 1 ms to minimize.
[2024-06-01 19:03:30] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 2 ms to minimize.
[2024-06-01 19:03:30] [INFO ] Deduced a trap composed of 41 places in 81 ms of which 1 ms to minimize.
[2024-06-01 19:03:30] [INFO ] Deduced a trap composed of 10 places in 167 ms of which 2 ms to minimize.
[2024-06-01 19:03:31] [INFO ] Deduced a trap composed of 6 places in 168 ms of which 2 ms to minimize.
[2024-06-01 19:03:31] [INFO ] Deduced a trap composed of 10 places in 165 ms of which 3 ms to minimize.
[2024-06-01 19:03:31] [INFO ] Deduced a trap composed of 13 places in 168 ms of which 3 ms to minimize.
[2024-06-01 19:03:31] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/561 variables, 20/926 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:03:32] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
[2024-06-01 19:03:32] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
[2024-06-01 19:03:32] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-06-01 19:03:32] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 0 ms to minimize.
[2024-06-01 19:03:33] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-06-01 19:03:33] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-06-01 19:03:33] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-06-01 19:03:33] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-06-01 19:03:33] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-06-01 19:03:33] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 0 ms to minimize.
[2024-06-01 19:03:33] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-06-01 19:03:33] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 0 ms to minimize.
[2024-06-01 19:03:33] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 0 ms to minimize.
[2024-06-01 19:03:33] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-06-01 19:03:33] [INFO ] Deduced a trap composed of 38 places in 136 ms of which 2 ms to minimize.
[2024-06-01 19:03:34] [INFO ] Deduced a trap composed of 37 places in 132 ms of which 2 ms to minimize.
[2024-06-01 19:03:34] [INFO ] Deduced a trap composed of 33 places in 134 ms of which 2 ms to minimize.
[2024-06-01 19:03:34] [INFO ] Deduced a trap composed of 32 places in 134 ms of which 2 ms to minimize.
[2024-06-01 19:03:34] [INFO ] Deduced a trap composed of 86 places in 136 ms of which 2 ms to minimize.
[2024-06-01 19:03:34] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/561 variables, 20/946 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:03:35] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 2 ms to minimize.
[2024-06-01 19:03:36] [INFO ] Deduced a trap composed of 6 places in 119 ms of which 2 ms to minimize.
[2024-06-01 19:03:36] [INFO ] Deduced a trap composed of 6 places in 115 ms of which 2 ms to minimize.
[2024-06-01 19:03:36] [INFO ] Deduced a trap composed of 6 places in 102 ms of which 2 ms to minimize.
[2024-06-01 19:03:36] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 2 ms to minimize.
[2024-06-01 19:03:36] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 2 ms to minimize.
[2024-06-01 19:03:37] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 1 ms to minimize.
[2024-06-01 19:03:37] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2024-06-01 19:03:37] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2024-06-01 19:03:37] [INFO ] Deduced a trap composed of 6 places in 112 ms of which 2 ms to minimize.
[2024-06-01 19:03:37] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 2 ms to minimize.
[2024-06-01 19:03:37] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 1 ms to minimize.
[2024-06-01 19:03:37] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 1 ms to minimize.
[2024-06-01 19:03:37] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 1 ms to minimize.
[2024-06-01 19:03:37] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 0 ms to minimize.
[2024-06-01 19:03:38] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 2 ms to minimize.
[2024-06-01 19:03:38] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 1 ms to minimize.
[2024-06-01 19:03:38] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 2 ms to minimize.
[2024-06-01 19:03:38] [INFO ] Deduced a trap composed of 6 places in 107 ms of which 2 ms to minimize.
[2024-06-01 19:03:38] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/561 variables, 20/966 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-06-01 19:03:39] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-06-01 19:03:39] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 0 ms to minimize.
[2024-06-01 19:03:39] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-06-01 19:03:39] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 0 ms to minimize.
[2024-06-01 19:03:39] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-06-01 19:03:40] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-06-01 19:03:40] [INFO ] Deduced a trap composed of 6 places in 112 ms of which 1 ms to minimize.
[2024-06-01 19:03:40] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
[2024-06-01 19:03:40] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-06-01 19:03:40] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-06-01 19:03:40] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 2 ms to minimize.
[2024-06-01 19:03:40] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-06-01 19:03:40] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2024-06-01 19:03:40] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 0 ms to minimize.
[2024-06-01 19:03:41] [INFO ] Deduced a trap composed of 6 places in 109 ms of which 1 ms to minimize.
[2024-06-01 19:03:41] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 1 ms to minimize.
[2024-06-01 19:03:41] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 561/1322 variables, and 983 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: 0/760 constraints, Known Traps: 261/261 constraints]
After SMT, in 60370ms problems are : Problem set: 0 solved, 760 unsolved
Search for dead transitions found 0 dead transitions in 60379ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61503 ms. Remains : 561/561 places, 761/761 transitions.
[2024-06-01 19:03:41] [INFO ] Flatten gal took : 49 ms
[2024-06-01 19:03:41] [INFO ] Flatten gal took : 42 ms
[2024-06-01 19:03:41] [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 33 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 33 ms. Remains : 562/563 places, 762/763 transitions.
[2024-06-01 19:03:41] [INFO ] Flatten gal took : 34 ms
[2024-06-01 19:03:41] [INFO ] Flatten gal took : 35 ms
[2024-06-01 19:03:41] [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 27 ms. Remains : 562/563 places, 762/763 transitions.
[2024-06-01 19:03:41] [INFO ] Flatten gal took : 32 ms
[2024-06-01 19:03:41] [INFO ] Flatten gal took : 34 ms
[2024-06-01 19:03:41] [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 26 ms. Remains : 562/563 places, 762/763 transitions.
[2024-06-01 19:03:41] [INFO ] Flatten gal took : 32 ms
[2024-06-01 19:03:42] [INFO ] Flatten gal took : 33 ms
[2024-06-01 19:03:42] [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 7 ms. Remains : 563/563 places, 763/763 transitions.
[2024-06-01 19:03:42] [INFO ] Flatten gal took : 31 ms
[2024-06-01 19:03:42] [INFO ] Flatten gal took : 32 ms
[2024-06-01 19:03:42] [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 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-06-01 19:03:42] [INFO ] Flatten gal took : 29 ms
[2024-06-01 19:03:42] [INFO ] Flatten gal took : 31 ms
[2024-06-01 19:03:42] [INFO ] Input system was already deterministic with 762 transitions.
RANDOM walk for 833 steps (0 resets) in 16 ms. (49 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-06-01 19:03:42] [INFO ] Flatten gal took : 29 ms
[2024-06-01 19:03:42] [INFO ] Flatten gal took : 30 ms
[2024-06-01 19:03:42] [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 6 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-06-01 19:03:42] [INFO ] Flatten gal took : 29 ms
[2024-06-01 19:03:42] [INFO ] Flatten gal took : 31 ms
[2024-06-01 19:03:42] [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 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-06-01 19:03:42] [INFO ] Flatten gal took : 29 ms
[2024-06-01 19:03:42] [INFO ] Flatten gal took : 31 ms
[2024-06-01 19:03:42] [INFO ] Input system was already deterministic with 762 transitions.
RANDOM walk for 15997 steps (28 resets) in 112 ms. (141 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 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 24 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-06-01 19:03:42] [INFO ] Flatten gal took : 28 ms
[2024-06-01 19:03:42] [INFO ] Flatten gal took : 30 ms
[2024-06-01 19:03:43] [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-06-01 19:03:43] [INFO ] Flatten gal took : 29 ms
[2024-06-01 19:03:43] [INFO ] Flatten gal took : 30 ms
[2024-06-01 19:03:43] [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 6 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-06-01 19:03:43] [INFO ] Flatten gal took : 26 ms
[2024-06-01 19:03:43] [INFO ] Flatten gal took : 28 ms
[2024-06-01 19:03:43] [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 24 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 24 ms. Remains : 562/563 places, 762/763 transitions.
[2024-06-01 19:03:43] [INFO ] Flatten gal took : 25 ms
[2024-06-01 19:03:43] [INFO ] Flatten gal took : 27 ms
[2024-06-01 19:03:43] [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 23 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 24 ms. Remains : 562/563 places, 762/763 transitions.
[2024-06-01 19:03:43] [INFO ] Flatten gal took : 26 ms
[2024-06-01 19:03:43] [INFO ] Flatten gal took : 27 ms
[2024-06-01 19:03:43] [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-06-01 19:03:43] [INFO ] Flatten gal took : 26 ms
[2024-06-01 19:03:43] [INFO ] Flatten gal took : 27 ms
[2024-06-01 19:03:43] [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 23 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 23 ms. Remains : 562/563 places, 762/763 transitions.
[2024-06-01 19:03:43] [INFO ] Flatten gal took : 26 ms
[2024-06-01 19:03:43] [INFO ] Flatten gal took : 27 ms
[2024-06-01 19:03:43] [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 23 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 24 ms. Remains : 562/563 places, 762/763 transitions.
[2024-06-01 19:03:43] [INFO ] Flatten gal took : 28 ms
[2024-06-01 19:03:43] [INFO ] Flatten gal took : 29 ms
[2024-06-01 19:03:43] [INFO ] Input system was already deterministic with 762 transitions.
[2024-06-01 19:03:43] [INFO ] Flatten gal took : 30 ms
[2024-06-01 19:03:44] [INFO ] Flatten gal took : 29 ms
[2024-06-01 19:03:44] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 7 ms.
[2024-06-01 19:03:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 563 places, 763 transitions and 3680 arcs took 9 ms.
Total runtime 115814 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : ShieldRVs-PT-040A-CTLFireability-2024-00
Could not compute solution for formula : ShieldRVs-PT-040A-CTLFireability-2024-01
Could not compute solution for formula : ShieldRVs-PT-040A-CTLFireability-2024-02
Could not compute solution for formula : ShieldRVs-PT-040A-CTLFireability-2024-03
Could not compute solution for formula : ShieldRVs-PT-040A-CTLFireability-2024-05
Could not compute solution for formula : ShieldRVs-PT-040A-CTLFireability-2024-06
Could not compute solution for formula : ShieldRVs-PT-040A-CTLFireability-2024-08
Could not compute solution for formula : ShieldRVs-PT-040A-CTLFireability-2024-09
Could not compute solution for formula : ShieldRVs-PT-040A-CTLFireability-2024-10
Could not compute solution for formula : ShieldRVs-PT-040A-CTLFireability-2024-11
Could not compute solution for formula : ShieldRVs-PT-040A-CTLFireability-2023-12
Could not compute solution for formula : ShieldRVs-PT-040A-CTLFireability-2023-13
Could not compute solution for formula : ShieldRVs-PT-040A-CTLFireability-2023-14
Could not compute solution for formula : ShieldRVs-PT-040A-CTLFireability-2023-15
BK_STOP 1717268624427
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name ShieldRVs-PT-040A-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/1876/ctl_0_
ctl formula name ShieldRVs-PT-040A-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/1876/ctl_1_
ctl formula name ShieldRVs-PT-040A-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/1876/ctl_2_
ctl formula name ShieldRVs-PT-040A-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/1876/ctl_3_
ctl formula name ShieldRVs-PT-040A-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/1876/ctl_4_
ctl formula name ShieldRVs-PT-040A-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/1876/ctl_5_
ctl formula name ShieldRVs-PT-040A-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/1876/ctl_6_
ctl formula name ShieldRVs-PT-040A-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/1876/ctl_7_
ctl formula name ShieldRVs-PT-040A-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/1876/ctl_8_
ctl formula name ShieldRVs-PT-040A-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/1876/ctl_9_
ctl formula name ShieldRVs-PT-040A-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/1876/ctl_10_
ctl formula name ShieldRVs-PT-040A-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/1876/ctl_11_
ctl formula name ShieldRVs-PT-040A-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/1876/ctl_12_
ctl formula name ShieldRVs-PT-040A-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/1876/ctl_13_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVs-PT-040A"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is 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 r528-tall-171683761900834"
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 ;