About the Execution of LTSMin+red for ShieldRVs-PT-004B
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
443.268 | 100687.00 | 132399.00 | 303.20 | ?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-171683761800762.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-004B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683761800762
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K 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.2K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 19 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 19:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 17:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K Apr 12 17:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 17:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Apr 12 17:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 49K 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-004B-CTLFireability-2024-00
FORMULA_NAME ShieldRVs-PT-004B-CTLFireability-2024-01
FORMULA_NAME ShieldRVs-PT-004B-CTLFireability-2024-02
FORMULA_NAME ShieldRVs-PT-004B-CTLFireability-2024-03
FORMULA_NAME ShieldRVs-PT-004B-CTLFireability-2024-04
FORMULA_NAME ShieldRVs-PT-004B-CTLFireability-2024-05
FORMULA_NAME ShieldRVs-PT-004B-CTLFireability-2024-06
FORMULA_NAME ShieldRVs-PT-004B-CTLFireability-2024-07
FORMULA_NAME ShieldRVs-PT-004B-CTLFireability-2024-08
FORMULA_NAME ShieldRVs-PT-004B-CTLFireability-2024-09
FORMULA_NAME ShieldRVs-PT-004B-CTLFireability-2024-10
FORMULA_NAME ShieldRVs-PT-004B-CTLFireability-2024-11
FORMULA_NAME ShieldRVs-PT-004B-CTLFireability-2023-12
FORMULA_NAME ShieldRVs-PT-004B-CTLFireability-2023-13
FORMULA_NAME ShieldRVs-PT-004B-CTLFireability-2023-14
FORMULA_NAME ShieldRVs-PT-004B-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1717263106861
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-004B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 17:31:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 17:31:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 17:31:48] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2024-06-01 17:31:48] [INFO ] Transformed 163 places.
[2024-06-01 17:31:48] [INFO ] Transformed 183 transitions.
[2024-06-01 17:31:48] [INFO ] Found NUPN structural information;
[2024-06-01 17:31:48] [INFO ] Parsed PT model containing 163 places and 183 transitions and 576 arcs in 170 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Support contains 93 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 183/183 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 154 transition count 174
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 154 transition count 174
Applied a total of 18 rules in 25 ms. Remains 154 /163 variables (removed 9) and now considering 174/183 (removed 9) transitions.
// Phase 1: matrix 174 rows 154 cols
[2024-06-01 17:31:48] [INFO ] Computed 17 invariants in 17 ms
[2024-06-01 17:31:48] [INFO ] Implicit Places using invariants in 236 ms returned []
[2024-06-01 17:31:48] [INFO ] Invariant cache hit.
[2024-06-01 17:31:48] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
Running 173 sub problems to find dead transitions.
[2024-06-01 17:31:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-06-01 17:31:50] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 18 ms to minimize.
[2024-06-01 17:31:50] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-06-01 17:31:50] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-06-01 17:31:50] [INFO ] Deduced a trap composed of 20 places in 252 ms of which 1 ms to minimize.
[2024-06-01 17:31:50] [INFO ] Deduced a trap composed of 20 places in 167 ms of which 1 ms to minimize.
[2024-06-01 17:31:50] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 2 ms to minimize.
[2024-06-01 17:31:50] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-06-01 17:31:50] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 1 ms to minimize.
[2024-06-01 17:31:51] [INFO ] Deduced a trap composed of 43 places in 122 ms of which 1 ms to minimize.
[2024-06-01 17:31:51] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-06-01 17:31:51] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-06-01 17:31:51] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 3 ms to minimize.
[2024-06-01 17:31:51] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-06-01 17:31:51] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
[2024-06-01 17:31:51] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 2 ms to minimize.
[2024-06-01 17:31:51] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 1 ms to minimize.
[2024-06-01 17:31:51] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
[2024-06-01 17:31:51] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2024-06-01 17:31:51] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-06-01 17:31:51] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-06-01 17:31:51] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-06-01 17:31:51] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-06-01 17:31:51] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-06-01 17:31:51] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 0 ms to minimize.
[2024-06-01 17:31:51] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-06-01 17:31:52] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 0 ms to minimize.
[2024-06-01 17:31:52] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 2 ms to minimize.
[2024-06-01 17:31:52] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-06-01 17:31:52] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-06-01 17:31:52] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
[2024-06-01 17:31:52] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 2 ms to minimize.
[2024-06-01 17:31:52] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-06-01 17:31:52] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 2 ms to minimize.
[2024-06-01 17:31:52] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-06-01 17:31:52] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 4 ms to minimize.
[2024-06-01 17:31:52] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-06-01 17:31:52] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-06-01 17:31:52] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-06-01 17:31:52] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-06-01 17:31:52] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-06-01 17:31:53] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-06-01 17:31:53] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-06-01 17:31:53] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-06-01 17:31:53] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-06-01 17:31:53] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2024-06-01 17:31:53] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-06-01 17:31:53] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-06-01 17:31:53] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-06-01 17:31:53] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 0 ms to minimize.
[2024-06-01 17:31:54] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-06-01 17:31:54] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-06-01 17:31:54] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-06-01 17:31:54] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-06-01 17:31:54] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-06-01 17:31:54] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-06-01 17:31:54] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-06-01 17:31:54] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
[2024-06-01 17:31:54] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-06-01 17:31:54] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-06-01 17:31:54] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-06-01 17:31:54] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-06-01 17:31:54] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-06-01 17:31:54] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-06-01 17:31:54] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-06-01 17:31:54] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 2 ms to minimize.
[2024-06-01 17:31:55] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-06-01 17:31:55] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-06-01 17:31:55] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-06-01 17:31:55] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-06-01 17:31:55] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-06-01 17:31:55] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 1 ms to minimize.
[2024-06-01 17:31:55] [INFO ] Deduced a trap composed of 30 places in 28 ms of which 1 ms to minimize.
[2024-06-01 17:31:55] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-06-01 17:31:55] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-06-01 17:31:55] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2024-06-01 17:31:55] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2024-06-01 17:31:55] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-06-01 17:31:55] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
[2024-06-01 17:31:55] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-06-01 17:31:55] [INFO ] Deduced a trap composed of 34 places in 30 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-06-01 17:31:55] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-06-01 17:31:56] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 0 ms to minimize.
[2024-06-01 17:31:56] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-06-01 17:31:56] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-06-01 17:31:56] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-06-01 17:31:56] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
[2024-06-01 17:31:56] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-06-01 17:31:56] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-06-01 17:31:56] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-06-01 17:31:56] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
[2024-06-01 17:31:56] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 0 ms to minimize.
[2024-06-01 17:31:56] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-06-01 17:31:56] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-06-01 17:31:56] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2024-06-01 17:31:56] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-06-01 17:31:56] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-06-01 17:31:56] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-06-01 17:31:56] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-06-01 17:31:56] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-06-01 17:31:56] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 20/117 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-06-01 17:31:57] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-06-01 17:31:57] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 1 ms to minimize.
[2024-06-01 17:31:57] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-06-01 17:31:57] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-06-01 17:31:57] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 0 ms to minimize.
[2024-06-01 17:31:57] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-06-01 17:31:57] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-06-01 17:31:57] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-06-01 17:31:57] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-06-01 17:31:57] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 17:31:58] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-06-01 17:31:58] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-06-01 17:31:58] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-06-01 17:31:58] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-06-01 17:31:58] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-06-01 17:31:58] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-06-01 17:31:58] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-06-01 17:31:58] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 0 ms to minimize.
[2024-06-01 17:31:58] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 0 ms to minimize.
[2024-06-01 17:31:58] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-06-01 17:31:58] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-06-01 17:31:59] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
[2024-06-01 17:31:59] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 0 ms to minimize.
[2024-06-01 17:31:59] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-06-01 17:31:59] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-06-01 17:31:59] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2024-06-01 17:31:59] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-06-01 17:31:59] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-06-01 17:31:59] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
[2024-06-01 17:31:59] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 10/147 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-06-01 17:31:59] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
[2024-06-01 17:31:59] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-06-01 17:32:00] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-06-01 17:32:00] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 2 ms to minimize.
[2024-06-01 17:32:00] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-06-01 17:32:00] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-06-01 17:32:00] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-06-01 17:32:00] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-06-01 17:32:00] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-06-01 17:32:00] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-06-01 17:32:00] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-06-01 17:32:00] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-06-01 17:32:00] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 2 ms to minimize.
[2024-06-01 17:32:00] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-06-01 17:32:00] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 0 ms to minimize.
[2024-06-01 17:32:00] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
[2024-06-01 17:32:00] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 1 ms to minimize.
[2024-06-01 17:32:00] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-06-01 17:32:00] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-06-01 17:32:00] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 20/167 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-06-01 17:32:01] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-06-01 17:32:01] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-06-01 17:32:01] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 0 ms to minimize.
[2024-06-01 17:32:01] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-06-01 17:32:01] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-06-01 17:32:01] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-06-01 17:32:02] [INFO ] Deduced a trap composed of 50 places in 48 ms of which 1 ms to minimize.
[2024-06-01 17:32:02] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-06-01 17:32:02] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 1 ms to minimize.
[2024-06-01 17:32:02] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-06-01 17:32:02] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-06-01 17:32:02] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-06-01 17:32:02] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 0 ms to minimize.
[2024-06-01 17:32:02] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-06-01 17:32:02] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-06-01 17:32:02] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-06-01 17:32:02] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-06-01 17:32:02] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-06-01 17:32:02] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-06-01 17:32:02] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 20/187 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-06-01 17:32:03] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 1 ms to minimize.
[2024-06-01 17:32:03] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-06-01 17:32:03] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-06-01 17:32:03] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
[2024-06-01 17:32:03] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-06-01 17:32:03] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-06-01 17:32:03] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-06-01 17:32:03] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-06-01 17:32:03] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-06-01 17:32:03] [INFO ] Deduced a trap composed of 25 places in 23 ms of which 0 ms to minimize.
[2024-06-01 17:32:03] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2024-06-01 17:32:03] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-06-01 17:32:03] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2024-06-01 17:32:03] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-06-01 17:32:03] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 1 ms to minimize.
[2024-06-01 17:32:04] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 0 ms to minimize.
[2024-06-01 17:32:04] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 0 ms to minimize.
[2024-06-01 17:32:04] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2024-06-01 17:32:04] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/154 variables, 19/206 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-06-01 17:32:04] [INFO ] Deduced a trap composed of 52 places in 49 ms of which 1 ms to minimize.
[2024-06-01 17:32:04] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2024-06-01 17:32:04] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-06-01 17:32:04] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-06-01 17:32:05] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 0 ms to minimize.
[2024-06-01 17:32:05] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 0 ms to minimize.
[2024-06-01 17:32:05] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 17:32:05] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-06-01 17:32:05] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2024-06-01 17:32:05] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-06-01 17:32:05] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/154 variables, 11/217 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-06-01 17:32:06] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-06-01 17:32:06] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-06-01 17:32:06] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-06-01 17:32:06] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-06-01 17:32:06] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
[2024-06-01 17:32:06] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 0 ms to minimize.
[2024-06-01 17:32:06] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 1 ms to minimize.
[2024-06-01 17:32:06] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
[2024-06-01 17:32:06] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-06-01 17:32:06] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 1 ms to minimize.
[2024-06-01 17:32:06] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 1 ms to minimize.
[2024-06-01 17:32:07] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/154 variables, 12/229 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-06-01 17:32:07] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-06-01 17:32:07] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 0 ms to minimize.
[2024-06-01 17:32:07] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-06-01 17:32:07] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 0 ms to minimize.
[2024-06-01 17:32:07] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 0 ms to minimize.
[2024-06-01 17:32:07] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-06-01 17:32:08] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-06-01 17:32:08] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/154 variables, 8/237 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-06-01 17:32:08] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 1 ms to minimize.
[2024-06-01 17:32:08] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-06-01 17:32:08] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2024-06-01 17:32:08] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-06-01 17:32:08] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 0 ms to minimize.
[2024-06-01 17:32:08] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-06-01 17:32:08] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-06-01 17:32:09] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 0 ms to minimize.
[2024-06-01 17:32:09] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 1 ms to minimize.
[2024-06-01 17:32:09] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 0 ms to minimize.
[2024-06-01 17:32:09] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
[2024-06-01 17:32:09] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 2 ms to minimize.
[2024-06-01 17:32:09] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/154 variables, 13/250 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-06-01 17:32:10] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
[2024-06-01 17:32:10] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-06-01 17:32:10] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 0 ms to minimize.
[2024-06-01 17:32:10] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-06-01 17:32:10] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-06-01 17:32:10] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 0 ms to minimize.
[2024-06-01 17:32:10] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-06-01 17:32:10] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-06-01 17:32:10] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 1 ms to minimize.
[2024-06-01 17:32:10] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-06-01 17:32:10] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
[2024-06-01 17:32:10] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-06-01 17:32:11] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 0 ms to minimize.
[2024-06-01 17:32:11] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-06-01 17:32:11] [INFO ] Deduced a trap composed of 42 places in 31 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/154 variables, 15/265 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-06-01 17:32:11] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
[2024-06-01 17:32:11] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
[2024-06-01 17:32:11] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-01 17:32:11] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 2 ms to minimize.
[2024-06-01 17:32:11] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 0 ms to minimize.
[2024-06-01 17:32:12] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-06-01 17:32:12] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-06-01 17:32:12] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 6 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/154 variables, 8/273 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-06-01 17:32:12] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 2 ms to minimize.
[2024-06-01 17:32:12] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
[2024-06-01 17:32:13] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
[2024-06-01 17:32:13] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/154 variables, 4/277 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-06-01 17:32:14] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 0 ms to minimize.
[2024-06-01 17:32:14] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2024-06-01 17:32:14] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 0 ms to minimize.
[2024-06-01 17:32:14] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/154 variables, 4/281 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-06-01 17:32:15] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-06-01 17:32:15] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-06-01 17:32:15] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-06-01 17:32:15] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
[2024-06-01 17:32:15] [INFO ] Deduced a trap composed of 36 places in 29 ms of which 1 ms to minimize.
[2024-06-01 17:32:15] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-06-01 17:32:15] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/154 variables, 7/288 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-06-01 17:32:16] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 0 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/154 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-06-01 17:32:17] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-06-01 17:32:17] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/154 variables, 2/291 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-06-01 17:32:18] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 154/328 variables, and 292 constraints, problems are : Problem set: 0 solved, 173 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 0/154 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 275/275 constraints]
Escalating to Integer solving :Problem set: 0 solved, 173 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 275/292 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-06-01 17:32:19] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2024-06-01 17:32:19] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 0 ms to minimize.
[2024-06-01 17:32:19] [INFO ] Deduced a trap composed of 35 places in 26 ms of which 1 ms to minimize.
[2024-06-01 17:32:20] [INFO ] Deduced a trap composed of 32 places in 28 ms of which 0 ms to minimize.
[2024-06-01 17:32:20] [INFO ] Deduced a trap composed of 35 places in 27 ms of which 0 ms to minimize.
[2024-06-01 17:32:20] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 1 ms to minimize.
[2024-06-01 17:32:20] [INFO ] Deduced a trap composed of 35 places in 29 ms of which 1 ms to minimize.
[2024-06-01 17:32:20] [INFO ] Deduced a trap composed of 35 places in 26 ms of which 1 ms to minimize.
[2024-06-01 17:32:20] [INFO ] Deduced a trap composed of 35 places in 31 ms of which 0 ms to minimize.
[2024-06-01 17:32:20] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 0 ms to minimize.
[2024-06-01 17:32:20] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-06-01 17:32:20] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 1 ms to minimize.
[2024-06-01 17:32:20] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 0 ms to minimize.
[2024-06-01 17:32:20] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 1 ms to minimize.
[2024-06-01 17:32:20] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-06-01 17:32:20] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 1 ms to minimize.
[2024-06-01 17:32:20] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
[2024-06-01 17:32:20] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 1 ms to minimize.
[2024-06-01 17:32:20] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 1 ms to minimize.
[2024-06-01 17:32:20] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 20/312 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-06-01 17:32:21] [INFO ] Deduced a trap composed of 45 places in 43 ms of which 1 ms to minimize.
[2024-06-01 17:32:21] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-06-01 17:32:21] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
[2024-06-01 17:32:21] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-06-01 17:32:21] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-06-01 17:32:21] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-06-01 17:32:21] [INFO ] Deduced a trap composed of 38 places in 31 ms of which 0 ms to minimize.
[2024-06-01 17:32:21] [INFO ] Deduced a trap composed of 35 places in 27 ms of which 1 ms to minimize.
[2024-06-01 17:32:21] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-06-01 17:32:21] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 0 ms to minimize.
[2024-06-01 17:32:21] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 0 ms to minimize.
[2024-06-01 17:32:21] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-06-01 17:32:21] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-06-01 17:32:21] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 1 ms to minimize.
[2024-06-01 17:32:21] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 15/327 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-06-01 17:32:22] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-06-01 17:32:22] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-06-01 17:32:22] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 3/330 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (OVERLAPS) 174/328 variables, 154/484 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/328 variables, 173/657 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-06-01 17:32:25] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 0 ms to minimize.
[2024-06-01 17:32:25] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-06-01 17:32:25] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-06-01 17:32:26] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2024-06-01 17:32:26] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2024-06-01 17:32:26] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-01 17:32:27] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-06-01 17:32:27] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-01 17:32:27] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 1 ms to minimize.
[2024-06-01 17:32:27] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-06-01 17:32:27] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 1 ms to minimize.
[2024-06-01 17:32:27] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 0 ms to minimize.
[2024-06-01 17:32:27] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 1 ms to minimize.
[2024-06-01 17:32:27] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 1 ms to minimize.
[2024-06-01 17:32:27] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
[2024-06-01 17:32:27] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 1 ms to minimize.
[2024-06-01 17:32:27] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2024-06-01 17:32:27] [INFO ] Deduced a trap composed of 43 places in 33 ms of which 0 ms to minimize.
[2024-06-01 17:32:27] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 0 ms to minimize.
[2024-06-01 17:32:28] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 20/677 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-06-01 17:32:32] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2024-06-01 17:32:32] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-06-01 17:32:32] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-06-01 17:32:32] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-06-01 17:32:33] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-06-01 17:32:34] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-06-01 17:32:34] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/328 variables, 7/684 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-06-01 17:32:41] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2024-06-01 17:32:41] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 0 ms to minimize.
[2024-06-01 17:32:42] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-06-01 17:32:42] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2024-06-01 17:32:43] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-06-01 17:32:43] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 6/690 constraints. Problems are: Problem set: 0 solved, 173 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 328/328 variables, and 690 constraints, problems are : Problem set: 0 solved, 173 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 346/346 constraints]
After SMT, in 60115ms problems are : Problem set: 0 solved, 173 unsolved
Search for dead transitions found 0 dead transitions in 60130ms
Starting structural reductions in LTL mode, iteration 1 : 154/163 places, 174/183 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60559 ms. Remains : 154/163 places, 174/183 transitions.
Support contains 93 out of 154 places after structural reductions.
[2024-06-01 17:32:49] [INFO ] Flatten gal took : 37 ms
[2024-06-01 17:32:49] [INFO ] Flatten gal took : 20 ms
[2024-06-01 17:32:49] [INFO ] Input system was already deterministic with 174 transitions.
RANDOM walk for 40000 steps (208 resets) in 1792 ms. (22 steps per ms) remains 3/67 properties
BEST_FIRST walk for 40002 steps (34 resets) in 172 ms. (231 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (31 resets) in 98 ms. (404 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (32 resets) in 84 ms. (470 steps per ms) remains 3/3 properties
[2024-06-01 17:32:49] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 89/103 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 51/154 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 174/328 variables, 154/171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/328 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 171 constraints, problems are : Problem set: 0 solved, 3 unsolved in 160 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 89/103 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 17:32:50] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-06-01 17:32:50] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
[2024-06-01 17:32:50] [INFO ] Deduced a trap composed of 24 places in 20 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 51/154 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 17:32:50] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-06-01 17:32:50] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-06-01 17:32:50] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-06-01 17:32:50] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 174/328 variables, 154/178 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/328 variables, 3/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 17:32:50] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-06-01 17:32:50] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 0 ms to minimize.
[2024-06-01 17:32:50] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-06-01 17:32:50] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2024-06-01 17:32:50] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 0 ms to minimize.
[2024-06-01 17:32:50] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-06-01 17:32:50] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 0 ms to minimize.
[2024-06-01 17:32:50] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2024-06-01 17:32:50] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 9/190 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 17:32:51] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-06-01 17:32:51] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-06-01 17:32:51] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/328 variables, 3/193 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/328 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 193 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1220 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 19/19 constraints]
After SMT, in 1403ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1266 ms.
Support contains 14 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 174/174 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 154 transition count 159
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 31 place count 139 transition count 158
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 32 place count 138 transition count 158
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 32 place count 138 transition count 139
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 70 place count 119 transition count 139
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 84 place count 105 transition count 125
Iterating global reduction 3 with 14 rules applied. Total rules applied 98 place count 105 transition count 125
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 98 place count 105 transition count 121
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 106 place count 101 transition count 121
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 172 place count 68 transition count 88
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 181 place count 68 transition count 88
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 182 place count 67 transition count 87
Applied a total of 182 rules in 42 ms. Remains 67 /154 variables (removed 87) and now considering 87/174 (removed 87) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 67/154 places, 87/174 transitions.
RANDOM walk for 40000 steps (542 resets) in 470 ms. (84 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (106 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
// Phase 1: matrix 87 rows 67 cols
[2024-06-01 17:32:52] [INFO ] Computed 17 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/18 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/20 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 45/65 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 78/143 variables, 39/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/144 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/144 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/144 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 10/154 variables, 7/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/154 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/154 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/154 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 154/154 variables, and 84 constraints, problems are : Problem set: 0 solved, 1 unsolved in 64 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 67/67 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/18 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/20 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 45/65 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 78/143 variables, 39/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:32:52] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/143 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/144 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/144 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/144 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 10/154 variables, 7/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/154 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/154 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/154 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 154/154 variables, and 86 constraints, problems are : Problem set: 0 solved, 1 unsolved in 98 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 67/67 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 167ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 87/87 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 67 transition count 85
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 65 transition count 85
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 62 transition count 82
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 62 transition count 82
Applied a total of 11 rules in 20 ms. Remains 62 /67 variables (removed 5) and now considering 82/87 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 62/67 places, 82/87 transitions.
RANDOM walk for 40000 steps (589 resets) in 115 ms. (344 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (118 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3070631 steps, run timeout after 3001 ms. (steps per millisecond=1023 ) properties seen :0 out of 1
Probabilistic random walk after 3070631 steps, saw 499533 distinct states, run finished after 3004 ms. (steps per millisecond=1022 ) properties seen :0
// Phase 1: matrix 82 rows 62 cols
[2024-06-01 17:32:56] [INFO ] Computed 17 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/17 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/19 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 44/63 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 73/136 variables, 37/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 11/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/136 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 8/144 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/144 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/144 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/144 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 144/144 variables, and 79 constraints, problems are : Problem set: 0 solved, 1 unsolved in 61 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 62/62 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/17 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/19 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 44/63 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 73/136 variables, 37/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 11/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/136 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:32:56] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/136 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/136 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 8/144 variables, 6/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/144 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 17:32:56] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/144 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/144 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/144 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 144/144 variables, and 82 constraints, problems are : Problem set: 0 solved, 1 unsolved in 156 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 224ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 82/82 transitions.
Applied a total of 0 rules in 8 ms. Remains 62 /62 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 62/62 places, 82/82 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 82/82 transitions.
Applied a total of 0 rules in 5 ms. Remains 62 /62 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-06-01 17:32:56] [INFO ] Invariant cache hit.
[2024-06-01 17:32:56] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-06-01 17:32:56] [INFO ] Invariant cache hit.
[2024-06-01 17:32:56] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2024-06-01 17:32:56] [INFO ] Redundant transitions in 19 ms returned []
Running 80 sub problems to find dead transitions.
[2024-06-01 17:32:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-01 17:32:56] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2024-06-01 17:32:56] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-06-01 17:32:56] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 0 ms to minimize.
[2024-06-01 17:32:56] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 1 ms to minimize.
[2024-06-01 17:32:56] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-06-01 17:32:56] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
[2024-06-01 17:32:56] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-06-01 17:32:56] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-06-01 17:32:56] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-06-01 17:32:56] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-06-01 17:32:56] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 11/25 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-01 17:32:57] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-06-01 17:32:57] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 2/62 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-01 17:32:57] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2024-06-01 17:32:57] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-06-01 17:32:57] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-06-01 17:32:57] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-06-01 17:32:57] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-06-01 17:32:57] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-06-01 17:32:57] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 0 ms to minimize.
[2024-06-01 17:32:57] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-06-01 17:32:57] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 1 ms to minimize.
[2024-06-01 17:32:57] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
[2024-06-01 17:32:57] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
[2024-06-01 17:32:57] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2024-06-01 17:32:57] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-06-01 17:32:57] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 14/44 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-01 17:32:57] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-06-01 17:32:57] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-06-01 17:32:57] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-06-01 17:32:57] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
[2024-06-01 17:32:58] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 5/49 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 82/144 variables, 62/111 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-01 17:32:58] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2024-06-01 17:32:58] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 0 ms to minimize.
[2024-06-01 17:32:58] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-06-01 17:32:58] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2024-06-01 17:32:58] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-06-01 17:32:58] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-06-01 17:32:58] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-06-01 17:32:58] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/144 variables, 8/119 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-01 17:32:59] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-06-01 17:32:59] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-06-01 17:32:59] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/144 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/144 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-01 17:32:59] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/144 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-01 17:32:59] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2024-06-01 17:33:00] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/144 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-01 17:33:00] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
[2024-06-01 17:33:00] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-06-01 17:33:00] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
[2024-06-01 17:33:00] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/144 variables, 4/129 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-01 17:33:00] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-06-01 17:33:00] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-06-01 17:33:00] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-06-01 17:33:00] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/144 variables, 4/133 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-01 17:33:00] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-06-01 17:33:01] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/144 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-01 17:33:01] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2024-06-01 17:33:01] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-06-01 17:33:01] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-06-01 17:33:01] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 1 ms to minimize.
[2024-06-01 17:33:01] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/144 variables, 5/140 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-01 17:33:01] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-06-01 17:33:01] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/144 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-01 17:33:01] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/144 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-01 17:33:02] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-06-01 17:33:02] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/144 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-01 17:33:02] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-01 17:33:02] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/144 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-01 17:33:02] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/144 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-01 17:33:03] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-06-01 17:33:03] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2024-06-01 17:33:03] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/144 variables, 3/151 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-01 17:33:03] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-06-01 17:33:03] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-06-01 17:33:03] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/144 variables, 3/154 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-01 17:33:03] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
[2024-06-01 17:33:03] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-06-01 17:33:03] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/144 variables, 3/157 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/144 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 27 (OVERLAPS) 0/144 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 144/144 variables, and 157 constraints, problems are : Problem set: 0 solved, 80 unsolved in 8212 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 78/78 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 76/90 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 2/62 variables, 3/93 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 82/144 variables, 62/157 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 80/237 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-01 17:33:05] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-06-01 17:33:05] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-06-01 17:33:06] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 3/240 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-01 17:33:07] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/144 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-01 17:33:08] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/144 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-01 17:33:09] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-06-01 17:33:09] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-06-01 17:33:09] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/144 variables, 3/245 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-01 17:33:10] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-06-01 17:33:10] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2024-06-01 17:33:10] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-06-01 17:33:10] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-06-01 17:33:10] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-06-01 17:33:11] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-06-01 17:33:11] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-06-01 17:33:11] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/144 variables, 8/253 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-01 17:33:11] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/144 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-01 17:33:12] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-06-01 17:33:13] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/144 variables, 2/256 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-01 17:33:14] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/144 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-01 17:33:15] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-06-01 17:33:15] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
[2024-06-01 17:33:15] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-06-01 17:33:15] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/144 variables, 4/261 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-01 17:33:16] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-06-01 17:33:16] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-06-01 17:33:16] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/144 variables, 3/264 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-01 17:33:17] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-06-01 17:33:18] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2024-06-01 17:33:18] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/144 variables, 3/267 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-01 17:33:19] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/144 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/144 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-01 17:33:22] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-06-01 17:33:22] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
At refinement iteration 21 (OVERLAPS) 0/144 variables, 2/270 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/144 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 23 (OVERLAPS) 0/144 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 144/144 variables, and 270 constraints, problems are : Problem set: 0 solved, 80 unsolved in 21761 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 111/111 constraints]
After SMT, in 29996ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 29999ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30147 ms. Remains : 62/62 places, 82/82 transitions.
[2024-06-01 17:33:26] [INFO ] Flatten gal took : 11 ms
[2024-06-01 17:33:26] [INFO ] Flatten gal took : 10 ms
[2024-06-01 17:33:26] [INFO ] Input system was already deterministic with 174 transitions.
Computed a total of 41 stabilizing places and 41 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 174/174 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 136 transition count 156
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 136 transition count 156
Applied a total of 36 rules in 8 ms. Remains 136 /154 variables (removed 18) and now considering 156/174 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 136/154 places, 156/174 transitions.
[2024-06-01 17:33:26] [INFO ] Flatten gal took : 8 ms
[2024-06-01 17:33:26] [INFO ] Flatten gal took : 9 ms
[2024-06-01 17:33:26] [INFO ] Input system was already deterministic with 156 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 154/154 places, 174/174 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 153 transition count 156
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 136 transition count 156
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 34 place count 136 transition count 137
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 72 place count 117 transition count 137
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 90 place count 99 transition count 119
Iterating global reduction 2 with 18 rules applied. Total rules applied 108 place count 99 transition count 119
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 108 place count 99 transition count 112
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 122 place count 92 transition count 112
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 186 place count 60 transition count 80
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 188 place count 58 transition count 78
Applied a total of 188 rules in 26 ms. Remains 58 /154 variables (removed 96) and now considering 78/174 (removed 96) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 29 ms. Remains : 58/154 places, 78/174 transitions.
[2024-06-01 17:33:26] [INFO ] Flatten gal took : 4 ms
[2024-06-01 17:33:26] [INFO ] Flatten gal took : 8 ms
[2024-06-01 17:33:26] [INFO ] Input system was already deterministic with 78 transitions.
RANDOM walk for 70 steps (0 resets) in 4 ms. (14 steps per ms) remains 0/1 properties
FORMULA ShieldRVs-PT-004B-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 174/174 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 137 transition count 157
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 137 transition count 157
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 136 transition count 156
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 136 transition count 156
Applied a total of 36 rules in 4 ms. Remains 136 /154 variables (removed 18) and now considering 156/174 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 136/154 places, 156/174 transitions.
[2024-06-01 17:33:26] [INFO ] Flatten gal took : 8 ms
[2024-06-01 17:33:26] [INFO ] Flatten gal took : 10 ms
[2024-06-01 17:33:26] [INFO ] Input system was already deterministic with 156 transitions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 174/174 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 138 transition count 158
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 138 transition count 158
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 137 transition count 157
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 137 transition count 157
Applied a total of 34 rules in 5 ms. Remains 137 /154 variables (removed 17) and now considering 157/174 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 137/154 places, 157/174 transitions.
[2024-06-01 17:33:26] [INFO ] Flatten gal took : 22 ms
[2024-06-01 17:33:26] [INFO ] Flatten gal took : 6 ms
[2024-06-01 17:33:26] [INFO ] Input system was already deterministic with 157 transitions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 174/174 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 135 transition count 155
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 135 transition count 155
Applied a total of 38 rules in 3 ms. Remains 135 /154 variables (removed 19) and now considering 155/174 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 135/154 places, 155/174 transitions.
[2024-06-01 17:33:26] [INFO ] Flatten gal took : 6 ms
[2024-06-01 17:33:26] [INFO ] Flatten gal took : 7 ms
[2024-06-01 17:33:26] [INFO ] Input system was already deterministic with 155 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 154/154 places, 174/174 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 153 transition count 156
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 136 transition count 156
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 34 place count 136 transition count 136
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 74 place count 116 transition count 136
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 93 place count 97 transition count 117
Iterating global reduction 2 with 19 rules applied. Total rules applied 112 place count 97 transition count 117
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 112 place count 97 transition count 110
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 126 place count 90 transition count 110
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 186 place count 60 transition count 80
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 188 place count 58 transition count 78
Applied a total of 188 rules in 18 ms. Remains 58 /154 variables (removed 96) and now considering 78/174 (removed 96) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 58/154 places, 78/174 transitions.
[2024-06-01 17:33:26] [INFO ] Flatten gal took : 4 ms
[2024-06-01 17:33:26] [INFO ] Flatten gal took : 4 ms
[2024-06-01 17:33:26] [INFO ] Input system was already deterministic with 78 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 154/154 places, 174/174 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 153 transition count 158
Reduce places removed 15 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 17 rules applied. Total rules applied 32 place count 138 transition count 156
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 34 place count 136 transition count 156
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 34 place count 136 transition count 136
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 74 place count 116 transition count 136
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 92 place count 98 transition count 118
Iterating global reduction 3 with 18 rules applied. Total rules applied 110 place count 98 transition count 118
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 110 place count 98 transition count 111
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 124 place count 91 transition count 111
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 178 place count 64 transition count 84
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 180 place count 62 transition count 82
Applied a total of 180 rules in 18 ms. Remains 62 /154 variables (removed 92) and now considering 82/174 (removed 92) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 62/154 places, 82/174 transitions.
[2024-06-01 17:33:26] [INFO ] Flatten gal took : 4 ms
[2024-06-01 17:33:26] [INFO ] Flatten gal took : 4 ms
[2024-06-01 17:33:26] [INFO ] Input system was already deterministic with 82 transitions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 174/174 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 140 transition count 160
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 140 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 139 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 139 transition count 159
Applied a total of 30 rules in 4 ms. Remains 139 /154 variables (removed 15) and now considering 159/174 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 139/154 places, 159/174 transitions.
[2024-06-01 17:33:26] [INFO ] Flatten gal took : 6 ms
[2024-06-01 17:33:26] [INFO ] Flatten gal took : 6 ms
[2024-06-01 17:33:26] [INFO ] Input system was already deterministic with 159 transitions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 174/174 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 135 transition count 155
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 135 transition count 155
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 134 transition count 154
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 134 transition count 154
Applied a total of 40 rules in 4 ms. Remains 134 /154 variables (removed 20) and now considering 154/174 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 134/154 places, 154/174 transitions.
[2024-06-01 17:33:26] [INFO ] Flatten gal took : 6 ms
[2024-06-01 17:33:26] [INFO ] Flatten gal took : 6 ms
[2024-06-01 17:33:26] [INFO ] Input system was already deterministic with 154 transitions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 174/174 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 136 transition count 156
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 136 transition count 156
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 135 transition count 155
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 135 transition count 155
Applied a total of 38 rules in 5 ms. Remains 135 /154 variables (removed 19) and now considering 155/174 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 135/154 places, 155/174 transitions.
[2024-06-01 17:33:26] [INFO ] Flatten gal took : 6 ms
[2024-06-01 17:33:26] [INFO ] Flatten gal took : 6 ms
[2024-06-01 17:33:26] [INFO ] Input system was already deterministic with 155 transitions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 174/174 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 136 transition count 156
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 136 transition count 156
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 135 transition count 155
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 135 transition count 155
Applied a total of 38 rules in 5 ms. Remains 135 /154 variables (removed 19) and now considering 155/174 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 135/154 places, 155/174 transitions.
[2024-06-01 17:33:26] [INFO ] Flatten gal took : 5 ms
[2024-06-01 17:33:26] [INFO ] Flatten gal took : 5 ms
[2024-06-01 17:33:26] [INFO ] Input system was already deterministic with 155 transitions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 174/174 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 137 transition count 157
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 137 transition count 157
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 136 transition count 156
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 136 transition count 156
Applied a total of 36 rules in 4 ms. Remains 136 /154 variables (removed 18) and now considering 156/174 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 136/154 places, 156/174 transitions.
[2024-06-01 17:33:26] [INFO ] Flatten gal took : 6 ms
[2024-06-01 17:33:26] [INFO ] Flatten gal took : 6 ms
[2024-06-01 17:33:26] [INFO ] Input system was already deterministic with 156 transitions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 174/174 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 142 transition count 162
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 142 transition count 162
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 141 transition count 161
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 141 transition count 161
Applied a total of 26 rules in 4 ms. Remains 141 /154 variables (removed 13) and now considering 161/174 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 141/154 places, 161/174 transitions.
[2024-06-01 17:33:26] [INFO ] Flatten gal took : 6 ms
[2024-06-01 17:33:26] [INFO ] Flatten gal took : 6 ms
[2024-06-01 17:33:26] [INFO ] Input system was already deterministic with 161 transitions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 174/174 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 139 transition count 159
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 139 transition count 159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 138 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 138 transition count 158
Applied a total of 32 rules in 5 ms. Remains 138 /154 variables (removed 16) and now considering 158/174 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 138/154 places, 158/174 transitions.
[2024-06-01 17:33:26] [INFO ] Flatten gal took : 6 ms
[2024-06-01 17:33:26] [INFO ] Flatten gal took : 6 ms
[2024-06-01 17:33:26] [INFO ] Input system was already deterministic with 158 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 154/154 places, 174/174 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 153 transition count 156
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 136 transition count 156
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 34 place count 136 transition count 136
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 74 place count 116 transition count 136
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 93 place count 97 transition count 117
Iterating global reduction 2 with 19 rules applied. Total rules applied 112 place count 97 transition count 117
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 112 place count 97 transition count 110
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 126 place count 90 transition count 110
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 178 place count 64 transition count 84
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 180 place count 62 transition count 82
Applied a total of 180 rules in 27 ms. Remains 62 /154 variables (removed 92) and now considering 82/174 (removed 92) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27 ms. Remains : 62/154 places, 82/174 transitions.
[2024-06-01 17:33:27] [INFO ] Flatten gal took : 4 ms
[2024-06-01 17:33:27] [INFO ] Flatten gal took : 4 ms
[2024-06-01 17:33:27] [INFO ] Input system was already deterministic with 82 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 154/154 places, 174/174 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 153 transition count 158
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 138 transition count 158
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 30 place count 138 transition count 140
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 66 place count 120 transition count 140
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 85 place count 101 transition count 121
Iterating global reduction 2 with 19 rules applied. Total rules applied 104 place count 101 transition count 121
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 104 place count 101 transition count 115
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 116 place count 95 transition count 115
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 176 place count 65 transition count 85
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 178 place count 63 transition count 83
Applied a total of 178 rules in 30 ms. Remains 63 /154 variables (removed 91) and now considering 83/174 (removed 91) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30 ms. Remains : 63/154 places, 83/174 transitions.
[2024-06-01 17:33:27] [INFO ] Flatten gal took : 3 ms
[2024-06-01 17:33:27] [INFO ] Flatten gal took : 4 ms
[2024-06-01 17:33:27] [INFO ] Input system was already deterministic with 83 transitions.
[2024-06-01 17:33:27] [INFO ] Flatten gal took : 6 ms
[2024-06-01 17:33:27] [INFO ] Flatten gal took : 7 ms
[2024-06-01 17:33:27] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 10 ms.
[2024-06-01 17:33:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 154 places, 174 transitions and 558 arcs took 11 ms.
Total runtime 99172 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-004B-CTLFireability-2024-00
Could not compute solution for formula : ShieldRVs-PT-004B-CTLFireability-2024-02
Could not compute solution for formula : ShieldRVs-PT-004B-CTLFireability-2024-03
Could not compute solution for formula : ShieldRVs-PT-004B-CTLFireability-2024-04
Could not compute solution for formula : ShieldRVs-PT-004B-CTLFireability-2024-05
Could not compute solution for formula : ShieldRVs-PT-004B-CTLFireability-2024-06
Could not compute solution for formula : ShieldRVs-PT-004B-CTLFireability-2024-07
Could not compute solution for formula : ShieldRVs-PT-004B-CTLFireability-2024-08
Could not compute solution for formula : ShieldRVs-PT-004B-CTLFireability-2024-09
Could not compute solution for formula : ShieldRVs-PT-004B-CTLFireability-2024-10
Could not compute solution for formula : ShieldRVs-PT-004B-CTLFireability-2024-11
Could not compute solution for formula : ShieldRVs-PT-004B-CTLFireability-2023-12
Could not compute solution for formula : ShieldRVs-PT-004B-CTLFireability-2023-13
Could not compute solution for formula : ShieldRVs-PT-004B-CTLFireability-2023-14
Could not compute solution for formula : ShieldRVs-PT-004B-CTLFireability-2023-15
BK_STOP 1717263207548
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name ShieldRVs-PT-004B-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/2002/ctl_0_
ctl formula name ShieldRVs-PT-004B-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/2002/ctl_1_
ctl formula name ShieldRVs-PT-004B-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/2002/ctl_2_
ctl formula name ShieldRVs-PT-004B-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/2002/ctl_3_
ctl formula name ShieldRVs-PT-004B-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/2002/ctl_4_
ctl formula name ShieldRVs-PT-004B-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/2002/ctl_5_
ctl formula name ShieldRVs-PT-004B-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/2002/ctl_6_
ctl formula name ShieldRVs-PT-004B-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/2002/ctl_7_
ctl formula name ShieldRVs-PT-004B-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/2002/ctl_8_
ctl formula name ShieldRVs-PT-004B-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/2002/ctl_9_
ctl formula name ShieldRVs-PT-004B-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/2002/ctl_10_
ctl formula name ShieldRVs-PT-004B-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/2002/ctl_11_
ctl formula name ShieldRVs-PT-004B-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/2002/ctl_12_
ctl formula name ShieldRVs-PT-004B-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/2002/ctl_13_
ctl formula name ShieldRVs-PT-004B-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/2002/ctl_14_
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-004B"
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-004B, 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-171683761800762"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-004B.tgz
mv ShieldRVs-PT-004B 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 ;