About the Execution of LTSMin+red for ShieldIIPs-PT-010B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 509.619 | 73085.00 | 108751.00 | 199.70 | ????????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-171683760300090.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is ShieldIIPs-PT-010B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683760300090
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K 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.6K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Apr 11 14:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Apr 11 14:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 11 14:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 11 14:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 164K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldIIPs-PT-010B-CTLFireability-2024-00
FORMULA_NAME ShieldIIPs-PT-010B-CTLFireability-2024-01
FORMULA_NAME ShieldIIPs-PT-010B-CTLFireability-2024-02
FORMULA_NAME ShieldIIPs-PT-010B-CTLFireability-2024-03
FORMULA_NAME ShieldIIPs-PT-010B-CTLFireability-2024-04
FORMULA_NAME ShieldIIPs-PT-010B-CTLFireability-2024-05
FORMULA_NAME ShieldIIPs-PT-010B-CTLFireability-2024-06
FORMULA_NAME ShieldIIPs-PT-010B-CTLFireability-2024-07
FORMULA_NAME ShieldIIPs-PT-010B-CTLFireability-2024-08
FORMULA_NAME ShieldIIPs-PT-010B-CTLFireability-2024-09
FORMULA_NAME ShieldIIPs-PT-010B-CTLFireability-2024-10
FORMULA_NAME ShieldIIPs-PT-010B-CTLFireability-2024-11
FORMULA_NAME ShieldIIPs-PT-010B-CTLFireability-2023-12
FORMULA_NAME ShieldIIPs-PT-010B-CTLFireability-2023-13
FORMULA_NAME ShieldIIPs-PT-010B-CTLFireability-2023-14
FORMULA_NAME ShieldIIPs-PT-010B-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1717225077951
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-010B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:57:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 06:57:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:57:59] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2024-06-01 06:57:59] [INFO ] Transformed 603 places.
[2024-06-01 06:57:59] [INFO ] Transformed 593 transitions.
[2024-06-01 06:57:59] [INFO ] Found NUPN structural information;
[2024-06-01 06:57:59] [INFO ] Parsed PT model containing 603 places and 593 transitions and 1786 arcs in 223 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
Support contains 191 out of 603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 603/603 places, 593/593 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 562 transition count 552
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 562 transition count 552
Applied a total of 82 rules in 86 ms. Remains 562 /603 variables (removed 41) and now considering 552/593 (removed 41) transitions.
// Phase 1: matrix 552 rows 562 cols
[2024-06-01 06:57:59] [INFO ] Computed 91 invariants in 23 ms
[2024-06-01 06:57:59] [INFO ] Implicit Places using invariants in 360 ms returned []
[2024-06-01 06:57:59] [INFO ] Invariant cache hit.
[2024-06-01 06:58:00] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 795 ms to find 0 implicit places.
Running 551 sub problems to find dead transitions.
[2024-06-01 06:58:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 1 (OVERLAPS) 1/562 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 551 unsolved
[2024-06-01 06:58:09] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 15 ms to minimize.
[2024-06-01 06:58:09] [INFO ] Deduced a trap composed of 48 places in 60 ms of which 2 ms to minimize.
[2024-06-01 06:58:09] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:58:09] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:58:10] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 1 ms to minimize.
[2024-06-01 06:58:10] [INFO ] Deduced a trap composed of 51 places in 69 ms of which 1 ms to minimize.
[2024-06-01 06:58:10] [INFO ] Deduced a trap composed of 52 places in 80 ms of which 2 ms to minimize.
[2024-06-01 06:58:10] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 2 ms to minimize.
[2024-06-01 06:58:10] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 2 ms to minimize.
[2024-06-01 06:58:11] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:58:11] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 2 ms to minimize.
[2024-06-01 06:58:11] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 1 ms to minimize.
[2024-06-01 06:58:11] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2024-06-01 06:58:11] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-06-01 06:58:11] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:58:11] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:58:11] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 2 ms to minimize.
[2024-06-01 06:58:12] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 3 ms to minimize.
[2024-06-01 06:58:12] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 2 ms to minimize.
[2024-06-01 06:58:12] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/562 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 551 unsolved
[2024-06-01 06:58:14] [INFO ] Deduced a trap composed of 16 places in 180 ms of which 4 ms to minimize.
[2024-06-01 06:58:14] [INFO ] Deduced a trap composed of 24 places in 165 ms of which 4 ms to minimize.
[2024-06-01 06:58:14] [INFO ] Deduced a trap composed of 18 places in 174 ms of which 4 ms to minimize.
[2024-06-01 06:58:14] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 0 ms to minimize.
[2024-06-01 06:58:14] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:58:14] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:58:14] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:58:14] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:58:14] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:58:14] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:58:15] [INFO ] Deduced a trap composed of 16 places in 158 ms of which 3 ms to minimize.
[2024-06-01 06:58:15] [INFO ] Deduced a trap composed of 17 places in 146 ms of which 3 ms to minimize.
[2024-06-01 06:58:15] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:58:15] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:58:15] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:58:15] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:58:15] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:58:15] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:58:16] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:58:16] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/562 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 551 unsolved
[2024-06-01 06:58:22] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2024-06-01 06:58:22] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:58:22] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:58:22] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:58:22] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:58:22] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:58:22] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:58:22] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 3 ms to minimize.
[2024-06-01 06:58:23] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 2 ms to minimize.
[2024-06-01 06:58:23] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:58:23] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 3 ms to minimize.
[2024-06-01 06:58:23] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 3 ms to minimize.
[2024-06-01 06:58:23] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 2 ms to minimize.
[2024-06-01 06:58:23] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 2 ms to minimize.
[2024-06-01 06:58:23] [INFO ] Deduced a trap composed of 28 places in 137 ms of which 3 ms to minimize.
[2024-06-01 06:58:24] [INFO ] Deduced a trap composed of 18 places in 137 ms of which 5 ms to minimize.
[2024-06-01 06:58:24] [INFO ] Deduced a trap composed of 21 places in 130 ms of which 3 ms to minimize.
[2024-06-01 06:58:24] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:58:24] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:58:24] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/562 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 551 unsolved
[2024-06-01 06:58:26] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:58:26] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-06-01 06:58:26] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 2 ms to minimize.
[2024-06-01 06:58:27] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:58:27] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:58:27] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 0 ms to minimize.
[2024-06-01 06:58:27] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:58:27] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:58:27] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:58:27] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 2 ms to minimize.
[2024-06-01 06:58:27] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 3 ms to minimize.
[2024-06-01 06:58:28] [INFO ] Deduced a trap composed of 45 places in 87 ms of which 2 ms to minimize.
[2024-06-01 06:58:28] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:58:28] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 2 ms to minimize.
[2024-06-01 06:58:28] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:58:28] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:58:28] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 1 ms to minimize.
[2024-06-01 06:58:28] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 1 ms to minimize.
[2024-06-01 06:58:28] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 2 ms to minimize.
[2024-06-01 06:58:28] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 551 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 562/1114 variables, and 171 constraints, problems are : Problem set: 0 solved, 551 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 0/562 constraints, PredecessorRefiner: 551/551 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 551 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 1 (OVERLAPS) 1/562 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/562 variables, 80/171 constraints. Problems are: Problem set: 0 solved, 551 unsolved
[2024-06-01 06:58:36] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 3 ms to minimize.
[2024-06-01 06:58:36] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:58:37] [INFO ] Deduced a trap composed of 25 places in 143 ms of which 3 ms to minimize.
[2024-06-01 06:58:37] [INFO ] Deduced a trap composed of 22 places in 143 ms of which 3 ms to minimize.
[2024-06-01 06:58:37] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:58:37] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:58:37] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:58:38] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:58:38] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 2 ms to minimize.
[2024-06-01 06:58:38] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:58:38] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 2 ms to minimize.
[2024-06-01 06:58:38] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 2 ms to minimize.
[2024-06-01 06:58:38] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 2 ms to minimize.
[2024-06-01 06:58:38] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:58:38] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:58:38] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 2 ms to minimize.
[2024-06-01 06:58:38] [INFO ] Deduced a trap composed of 38 places in 88 ms of which 2 ms to minimize.
[2024-06-01 06:58:39] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 2 ms to minimize.
[2024-06-01 06:58:39] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 2 ms to minimize.
[2024-06-01 06:58:39] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/562 variables, 20/191 constraints. Problems are: Problem set: 0 solved, 551 unsolved
[2024-06-01 06:58:41] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:58:42] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:58:42] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:58:42] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-06-01 06:58:42] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 2 ms to minimize.
[2024-06-01 06:58:42] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:58:42] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:58:42] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 1 ms to minimize.
[2024-06-01 06:58:42] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:58:42] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:58:42] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:58:42] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:58:42] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 1 ms to minimize.
[2024-06-01 06:58:43] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 2 ms to minimize.
[2024-06-01 06:58:43] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-06-01 06:58:43] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:58:43] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:58:43] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:58:43] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 2 ms to minimize.
[2024-06-01 06:58:43] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/562 variables, 20/211 constraints. Problems are: Problem set: 0 solved, 551 unsolved
[2024-06-01 06:58:44] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 2 ms to minimize.
[2024-06-01 06:58:45] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-06-01 06:58:45] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:58:46] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:58:46] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:58:46] [INFO ] Deduced a trap composed of 36 places in 81 ms of which 2 ms to minimize.
[2024-06-01 06:58:46] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:58:46] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:58:46] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:58:46] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:58:47] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:58:47] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
[2024-06-01 06:58:47] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 0 ms to minimize.
[2024-06-01 06:58:47] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2024-06-01 06:58:47] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:58:47] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 2 ms to minimize.
[2024-06-01 06:58:47] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2024-06-01 06:58:47] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:58:48] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 2 ms to minimize.
[2024-06-01 06:58:48] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 20/231 constraints. Problems are: Problem set: 0 solved, 551 unsolved
[2024-06-01 06:58:49] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:58:50] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 2 ms to minimize.
[2024-06-01 06:58:50] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 1 ms to minimize.
[2024-06-01 06:58:51] [INFO ] Deduced a trap composed of 22 places in 117 ms of which 2 ms to minimize.
[2024-06-01 06:58:51] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:58:51] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:58:51] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:58:51] [INFO ] Deduced a trap composed of 26 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:58:51] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:58:51] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:58:51] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:58:52] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:58:52] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:58:52] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:58:52] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:58:52] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:58:52] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:58:52] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:58:52] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:58:52] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 20/251 constraints. Problems are: Problem set: 0 solved, 551 unsolved
[2024-06-01 06:58:55] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:58:55] [INFO ] Deduced a trap composed of 47 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:58:55] [INFO ] Deduced a trap composed of 45 places in 132 ms of which 3 ms to minimize.
[2024-06-01 06:58:55] [INFO ] Deduced a trap composed of 44 places in 130 ms of which 3 ms to minimize.
[2024-06-01 06:58:56] [INFO ] Deduced a trap composed of 57 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:58:56] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:58:56] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:58:56] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 2 ms to minimize.
[2024-06-01 06:58:56] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 2 ms to minimize.
[2024-06-01 06:58:56] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:58:57] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 2 ms to minimize.
[2024-06-01 06:58:57] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
[2024-06-01 06:58:57] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
[2024-06-01 06:58:57] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 2 ms to minimize.
[2024-06-01 06:58:57] [INFO ] Deduced a trap composed of 47 places in 67 ms of which 1 ms to minimize.
[2024-06-01 06:58:57] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:58:57] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:58:57] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:58:57] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2024-06-01 06:58:57] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/562 variables, 20/271 constraints. Problems are: Problem set: 0 solved, 551 unsolved
[2024-06-01 06:58:59] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:58:59] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:59:00] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:59:00] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:59:00] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:59:00] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 0 ms to minimize.
[2024-06-01 06:59:00] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 562/1114 variables, and 278 constraints, problems are : Problem set: 0 solved, 551 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 0/562 constraints, PredecessorRefiner: 0/551 constraints, Known Traps: 187/187 constraints]
After SMT, in 60185ms problems are : Problem set: 0 solved, 551 unsolved
Search for dead transitions found 0 dead transitions in 60204ms
Starting structural reductions in LTL mode, iteration 1 : 562/603 places, 552/593 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61107 ms. Remains : 562/603 places, 552/593 transitions.
Support contains 191 out of 562 places after structural reductions.
[2024-06-01 06:59:00] [INFO ] Flatten gal took : 70 ms
[2024-06-01 06:59:00] [INFO ] Flatten gal took : 33 ms
[2024-06-01 06:59:00] [INFO ] Input system was already deterministic with 552 transitions.
Reduction of identical properties reduced properties to check from 136 to 135
RANDOM walk for 40000 steps (28 resets) in 1573 ms. (25 steps per ms) remains 5/135 properties
BEST_FIRST walk for 40003 steps (8 resets) in 118 ms. (336 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 4/4 properties
[2024-06-01 06:59:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp101 is UNSAT
Problem AtomicPropp117 is UNSAT
At refinement iteration 1 (OVERLAPS) 174/186 variables, 27/27 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-06-01 06:59:01] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2024-06-01 06:59:01] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 2/29 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 0/29 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 376/562 variables, 64/93 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-06-01 06:59:02] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 2 ms to minimize.
[2024-06-01 06:59:02] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 2 ms to minimize.
[2024-06-01 06:59:02] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 2 ms to minimize.
[2024-06-01 06:59:02] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 2 ms to minimize.
[2024-06-01 06:59:02] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 2 ms to minimize.
[2024-06-01 06:59:02] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 2 ms to minimize.
[2024-06-01 06:59:02] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 2 ms to minimize.
[2024-06-01 06:59:02] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 2 ms to minimize.
[2024-06-01 06:59:02] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:59:03] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 2 ms to minimize.
[2024-06-01 06:59:03] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-06-01 06:59:03] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-06-01 06:59:03] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:59:03] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 14/107 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 0/107 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 552/1114 variables, 562/669 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-06-01 06:59:03] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1114 variables, 1/670 constraints. Problems are: Problem set: 2 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1114 variables, 0/670 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1114 variables, 0/670 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1114/1114 variables, and 670 constraints, problems are : Problem set: 2 solved, 2 unsolved in 1929 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 562/562 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 86/92 variables, 11/11 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/11 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 470/562 variables, 80/91 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/562 variables, 17/108 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-06-01 06:59:03] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 2 ms to minimize.
[2024-06-01 06:59:03] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 2 ms to minimize.
[2024-06-01 06:59:04] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 2 ms to minimize.
[2024-06-01 06:59:04] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 2 ms to minimize.
[2024-06-01 06:59:04] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 2 ms to minimize.
[2024-06-01 06:59:04] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 2 ms to minimize.
[2024-06-01 06:59:04] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:59:04] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 8/116 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 0/116 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 552/1114 variables, 562/678 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1114 variables, 2/680 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-06-01 06:59:04] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 2 ms to minimize.
[2024-06-01 06:59:04] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 12 ms to minimize.
[2024-06-01 06:59:04] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 2 ms to minimize.
[2024-06-01 06:59:05] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 2 ms to minimize.
[2024-06-01 06:59:05] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 1 ms to minimize.
[2024-06-01 06:59:05] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 2 ms to minimize.
[2024-06-01 06:59:05] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 2 ms to minimize.
[2024-06-01 06:59:05] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 1 ms to minimize.
[2024-06-01 06:59:05] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 2 ms to minimize.
[2024-06-01 06:59:05] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 2 ms to minimize.
[2024-06-01 06:59:05] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 1 ms to minimize.
[2024-06-01 06:59:05] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2024-06-01 06:59:05] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 2 ms to minimize.
[2024-06-01 06:59:06] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 2 ms to minimize.
[2024-06-01 06:59:06] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 2 ms to minimize.
[2024-06-01 06:59:06] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 2 ms to minimize.
[2024-06-01 06:59:06] [INFO ] Deduced a trap composed of 46 places in 87 ms of which 2 ms to minimize.
[2024-06-01 06:59:06] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 2 ms to minimize.
[2024-06-01 06:59:06] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
[2024-06-01 06:59:06] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1114 variables, 20/700 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-06-01 06:59:06] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-06-01 06:59:06] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 2 ms to minimize.
[2024-06-01 06:59:06] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2024-06-01 06:59:06] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 1 ms to minimize.
[2024-06-01 06:59:07] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2024-06-01 06:59:07] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2024-06-01 06:59:07] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 2 ms to minimize.
[2024-06-01 06:59:07] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1114 variables, 8/708 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1114 variables, 0/708 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/1114 variables, 0/708 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1114/1114 variables, and 708 constraints, problems are : Problem set: 2 solved, 2 unsolved in 3746 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 562/562 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 53/53 constraints]
After SMT, in 5684ms problems are : Problem set: 2 solved, 2 unsolved
Parikh walk visited 0 properties in 1003 ms.
Support contains 6 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 552/552 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 562 transition count 503
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 98 place count 513 transition count 503
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 52 Pre rules applied. Total rules applied 98 place count 513 transition count 451
Deduced a syphon composed of 52 places in 1 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 202 place count 461 transition count 451
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 229 place count 434 transition count 424
Iterating global reduction 2 with 27 rules applied. Total rules applied 256 place count 434 transition count 424
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 256 place count 434 transition count 413
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 278 place count 423 transition count 413
Performed 166 Post agglomeration using F-continuation condition.Transition count delta: 166
Deduced a syphon composed of 166 places in 1 ms
Reduce places removed 166 places and 0 transitions.
Iterating global reduction 2 with 332 rules applied. Total rules applied 610 place count 257 transition count 247
Partial Free-agglomeration rule applied 68 times.
Drop transitions (Partial Free agglomeration) removed 68 transitions
Iterating global reduction 2 with 68 rules applied. Total rules applied 678 place count 257 transition count 247
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 679 place count 256 transition count 246
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 680 place count 255 transition count 246
Applied a total of 680 rules in 156 ms. Remains 255 /562 variables (removed 307) and now considering 246/552 (removed 306) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 156 ms. Remains : 255/562 places, 246/552 transitions.
RANDOM walk for 40000 steps (8 resets) in 832 ms. (48 steps per ms) remains 1/2 properties
BEST_FIRST walk for 13448 steps (1 resets) in 27 ms. (480 steps per ms) remains 0/1 properties
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2024-06-01 06:59:08] [INFO ] Flatten gal took : 28 ms
[2024-06-01 06:59:08] [INFO ] Flatten gal took : 27 ms
[2024-06-01 06:59:09] [INFO ] Input system was already deterministic with 552 transitions.
Computed a total of 136 stabilizing places and 136 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 562/562 places, 552/552 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 536 transition count 526
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 536 transition count 526
Applied a total of 52 rules in 16 ms. Remains 536 /562 variables (removed 26) and now considering 526/552 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 536/562 places, 526/552 transitions.
[2024-06-01 06:59:09] [INFO ] Flatten gal took : 21 ms
[2024-06-01 06:59:09] [INFO ] Flatten gal took : 23 ms
[2024-06-01 06:59:09] [INFO ] Input system was already deterministic with 526 transitions.
Starting structural reductions in LTL mode, iteration 0 : 562/562 places, 552/552 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 534 transition count 524
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 534 transition count 524
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 533 transition count 523
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 533 transition count 523
Applied a total of 58 rules in 27 ms. Remains 533 /562 variables (removed 29) and now considering 523/552 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 533/562 places, 523/552 transitions.
[2024-06-01 06:59:09] [INFO ] Flatten gal took : 18 ms
[2024-06-01 06:59:09] [INFO ] Flatten gal took : 19 ms
[2024-06-01 06:59:09] [INFO ] Input system was already deterministic with 523 transitions.
Starting structural reductions in LTL mode, iteration 0 : 562/562 places, 552/552 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 537 transition count 527
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 537 transition count 527
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 536 transition count 526
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 536 transition count 526
Applied a total of 52 rules in 28 ms. Remains 536 /562 variables (removed 26) and now considering 526/552 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 536/562 places, 526/552 transitions.
[2024-06-01 06:59:09] [INFO ] Flatten gal took : 18 ms
[2024-06-01 06:59:09] [INFO ] Flatten gal took : 20 ms
[2024-06-01 06:59:09] [INFO ] Input system was already deterministic with 526 transitions.
Starting structural reductions in LTL mode, iteration 0 : 562/562 places, 552/552 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 535 transition count 525
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 535 transition count 525
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 534 transition count 524
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 534 transition count 524
Applied a total of 56 rules in 24 ms. Remains 534 /562 variables (removed 28) and now considering 524/552 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 534/562 places, 524/552 transitions.
[2024-06-01 06:59:09] [INFO ] Flatten gal took : 17 ms
[2024-06-01 06:59:09] [INFO ] Flatten gal took : 17 ms
[2024-06-01 06:59:09] [INFO ] Input system was already deterministic with 524 transitions.
Starting structural reductions in LTL mode, iteration 0 : 562/562 places, 552/552 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 533 transition count 523
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 533 transition count 523
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 532 transition count 522
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 532 transition count 522
Applied a total of 60 rules in 23 ms. Remains 532 /562 variables (removed 30) and now considering 522/552 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 532/562 places, 522/552 transitions.
[2024-06-01 06:59:09] [INFO ] Flatten gal took : 16 ms
[2024-06-01 06:59:09] [INFO ] Flatten gal took : 17 ms
[2024-06-01 06:59:09] [INFO ] Input system was already deterministic with 522 transitions.
Starting structural reductions in LTL mode, iteration 0 : 562/562 places, 552/552 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 539 transition count 529
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 539 transition count 529
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 538 transition count 528
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 538 transition count 528
Applied a total of 48 rules in 25 ms. Remains 538 /562 variables (removed 24) and now considering 528/552 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 538/562 places, 528/552 transitions.
[2024-06-01 06:59:09] [INFO ] Flatten gal took : 17 ms
[2024-06-01 06:59:09] [INFO ] Flatten gal took : 17 ms
[2024-06-01 06:59:09] [INFO ] Input system was already deterministic with 528 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 562/562 places, 552/552 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 561 transition count 502
Reduce places removed 49 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 50 rules applied. Total rules applied 99 place count 512 transition count 501
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 100 place count 511 transition count 501
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 52 Pre rules applied. Total rules applied 100 place count 511 transition count 449
Deduced a syphon composed of 52 places in 1 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 3 with 104 rules applied. Total rules applied 204 place count 459 transition count 449
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 230 place count 433 transition count 423
Iterating global reduction 3 with 26 rules applied. Total rules applied 256 place count 433 transition count 423
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 256 place count 433 transition count 412
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 278 place count 422 transition count 412
Performed 160 Post agglomeration using F-continuation condition.Transition count delta: 160
Deduced a syphon composed of 160 places in 0 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 3 with 320 rules applied. Total rules applied 598 place count 262 transition count 252
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 600 place count 260 transition count 250
Applied a total of 600 rules in 78 ms. Remains 260 /562 variables (removed 302) and now considering 250/552 (removed 302) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 79 ms. Remains : 260/562 places, 250/552 transitions.
[2024-06-01 06:59:09] [INFO ] Flatten gal took : 10 ms
[2024-06-01 06:59:09] [INFO ] Flatten gal took : 10 ms
[2024-06-01 06:59:09] [INFO ] Input system was already deterministic with 250 transitions.
Starting structural reductions in LTL mode, iteration 0 : 562/562 places, 552/552 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 539 transition count 529
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 539 transition count 529
Applied a total of 46 rules in 16 ms. Remains 539 /562 variables (removed 23) and now considering 529/552 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 539/562 places, 529/552 transitions.
[2024-06-01 06:59:09] [INFO ] Flatten gal took : 15 ms
[2024-06-01 06:59:09] [INFO ] Flatten gal took : 16 ms
[2024-06-01 06:59:09] [INFO ] Input system was already deterministic with 529 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 562/562 places, 552/552 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 561 transition count 501
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 100 place count 511 transition count 501
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 52 Pre rules applied. Total rules applied 100 place count 511 transition count 449
Deduced a syphon composed of 52 places in 1 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 204 place count 459 transition count 449
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 233 place count 430 transition count 420
Iterating global reduction 2 with 29 rules applied. Total rules applied 262 place count 430 transition count 420
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 262 place count 430 transition count 408
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 286 place count 418 transition count 408
Performed 164 Post agglomeration using F-continuation condition.Transition count delta: 164
Deduced a syphon composed of 164 places in 1 ms
Reduce places removed 164 places and 0 transitions.
Iterating global reduction 2 with 328 rules applied. Total rules applied 614 place count 254 transition count 244
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 616 place count 252 transition count 242
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 617 place count 251 transition count 242
Applied a total of 617 rules in 74 ms. Remains 251 /562 variables (removed 311) and now considering 242/552 (removed 310) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 74 ms. Remains : 251/562 places, 242/552 transitions.
[2024-06-01 06:59:09] [INFO ] Flatten gal took : 11 ms
[2024-06-01 06:59:09] [INFO ] Flatten gal took : 10 ms
[2024-06-01 06:59:09] [INFO ] Input system was already deterministic with 242 transitions.
RANDOM walk for 11 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
FORMULA ShieldIIPs-PT-010B-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 562/562 places, 552/552 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 561 transition count 501
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 100 place count 511 transition count 501
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 100 place count 511 transition count 451
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 200 place count 461 transition count 451
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 228 place count 433 transition count 423
Iterating global reduction 2 with 28 rules applied. Total rules applied 256 place count 433 transition count 423
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 256 place count 433 transition count 411
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 280 place count 421 transition count 411
Performed 164 Post agglomeration using F-continuation condition.Transition count delta: 164
Deduced a syphon composed of 164 places in 0 ms
Reduce places removed 164 places and 0 transitions.
Iterating global reduction 2 with 328 rules applied. Total rules applied 608 place count 257 transition count 247
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 610 place count 255 transition count 245
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 611 place count 254 transition count 245
Applied a total of 611 rules in 66 ms. Remains 254 /562 variables (removed 308) and now considering 245/552 (removed 307) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 66 ms. Remains : 254/562 places, 245/552 transitions.
[2024-06-01 06:59:10] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:59:10] [INFO ] Flatten gal took : 9 ms
[2024-06-01 06:59:10] [INFO ] Input system was already deterministic with 245 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 562/562 places, 552/552 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 561 transition count 500
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 102 place count 510 transition count 500
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 102 place count 510 transition count 449
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 204 place count 459 transition count 449
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 233 place count 430 transition count 420
Iterating global reduction 2 with 29 rules applied. Total rules applied 262 place count 430 transition count 420
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 262 place count 430 transition count 408
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 286 place count 418 transition count 408
Performed 163 Post agglomeration using F-continuation condition.Transition count delta: 163
Deduced a syphon composed of 163 places in 1 ms
Reduce places removed 163 places and 0 transitions.
Iterating global reduction 2 with 326 rules applied. Total rules applied 612 place count 255 transition count 245
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 614 place count 253 transition count 243
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 615 place count 252 transition count 243
Applied a total of 615 rules in 60 ms. Remains 252 /562 variables (removed 310) and now considering 243/552 (removed 309) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60 ms. Remains : 252/562 places, 243/552 transitions.
[2024-06-01 06:59:10] [INFO ] Flatten gal took : 9 ms
[2024-06-01 06:59:10] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:59:10] [INFO ] Input system was already deterministic with 243 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 562/562 places, 552/552 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 561 transition count 501
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 100 place count 511 transition count 501
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 100 place count 511 transition count 451
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 200 place count 461 transition count 451
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 227 place count 434 transition count 424
Iterating global reduction 2 with 27 rules applied. Total rules applied 254 place count 434 transition count 424
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 254 place count 434 transition count 413
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 276 place count 423 transition count 413
Performed 162 Post agglomeration using F-continuation condition.Transition count delta: 162
Deduced a syphon composed of 162 places in 0 ms
Reduce places removed 162 places and 0 transitions.
Iterating global reduction 2 with 324 rules applied. Total rules applied 600 place count 261 transition count 251
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 602 place count 259 transition count 249
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 603 place count 258 transition count 249
Applied a total of 603 rules in 47 ms. Remains 258 /562 variables (removed 304) and now considering 249/552 (removed 303) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 47 ms. Remains : 258/562 places, 249/552 transitions.
[2024-06-01 06:59:10] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:59:10] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:59:10] [INFO ] Input system was already deterministic with 249 transitions.
Starting structural reductions in LTL mode, iteration 0 : 562/562 places, 552/552 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 537 transition count 527
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 537 transition count 527
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 536 transition count 526
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 536 transition count 526
Applied a total of 52 rules in 20 ms. Remains 536 /562 variables (removed 26) and now considering 526/552 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 536/562 places, 526/552 transitions.
[2024-06-01 06:59:10] [INFO ] Flatten gal took : 14 ms
[2024-06-01 06:59:10] [INFO ] Flatten gal took : 13 ms
[2024-06-01 06:59:10] [INFO ] Input system was already deterministic with 526 transitions.
Starting structural reductions in LTL mode, iteration 0 : 562/562 places, 552/552 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 536 transition count 526
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 536 transition count 526
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 535 transition count 525
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 535 transition count 525
Applied a total of 54 rules in 21 ms. Remains 535 /562 variables (removed 27) and now considering 525/552 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 535/562 places, 525/552 transitions.
[2024-06-01 06:59:10] [INFO ] Flatten gal took : 14 ms
[2024-06-01 06:59:10] [INFO ] Flatten gal took : 14 ms
[2024-06-01 06:59:10] [INFO ] Input system was already deterministic with 525 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 562/562 places, 552/552 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 47 place count 561 transition count 504
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 94 place count 514 transition count 504
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 52 Pre rules applied. Total rules applied 94 place count 514 transition count 452
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 198 place count 462 transition count 452
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 225 place count 435 transition count 425
Iterating global reduction 2 with 27 rules applied. Total rules applied 252 place count 435 transition count 425
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 252 place count 435 transition count 415
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 272 place count 425 transition count 415
Performed 165 Post agglomeration using F-continuation condition.Transition count delta: 165
Deduced a syphon composed of 165 places in 0 ms
Reduce places removed 165 places and 0 transitions.
Iterating global reduction 2 with 330 rules applied. Total rules applied 602 place count 260 transition count 250
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 604 place count 258 transition count 248
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 605 place count 257 transition count 248
Applied a total of 605 rules in 52 ms. Remains 257 /562 variables (removed 305) and now considering 248/552 (removed 304) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 52 ms. Remains : 257/562 places, 248/552 transitions.
[2024-06-01 06:59:10] [INFO ] Flatten gal took : 7 ms
[2024-06-01 06:59:10] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:59:10] [INFO ] Input system was already deterministic with 248 transitions.
Starting structural reductions in LTL mode, iteration 0 : 562/562 places, 552/552 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 536 transition count 526
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 536 transition count 526
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 535 transition count 525
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 535 transition count 525
Applied a total of 54 rules in 21 ms. Remains 535 /562 variables (removed 27) and now considering 525/552 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 535/562 places, 525/552 transitions.
[2024-06-01 06:59:10] [INFO ] Flatten gal took : 13 ms
[2024-06-01 06:59:10] [INFO ] Flatten gal took : 13 ms
[2024-06-01 06:59:10] [INFO ] Input system was already deterministic with 525 transitions.
[2024-06-01 06:59:10] [INFO ] Flatten gal took : 15 ms
[2024-06-01 06:59:10] [INFO ] Flatten gal took : 22 ms
[2024-06-01 06:59:10] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2024-06-01 06:59:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 562 places, 552 transitions and 1704 arcs took 5 ms.
Total runtime 71569 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 : ShieldIIPs-PT-010B-CTLFireability-2024-00
Could not compute solution for formula : ShieldIIPs-PT-010B-CTLFireability-2024-01
Could not compute solution for formula : ShieldIIPs-PT-010B-CTLFireability-2024-02
Could not compute solution for formula : ShieldIIPs-PT-010B-CTLFireability-2024-03
Could not compute solution for formula : ShieldIIPs-PT-010B-CTLFireability-2024-04
Could not compute solution for formula : ShieldIIPs-PT-010B-CTLFireability-2024-05
Could not compute solution for formula : ShieldIIPs-PT-010B-CTLFireability-2024-06
Could not compute solution for formula : ShieldIIPs-PT-010B-CTLFireability-2024-07
Could not compute solution for formula : ShieldIIPs-PT-010B-CTLFireability-2024-09
Could not compute solution for formula : ShieldIIPs-PT-010B-CTLFireability-2024-10
Could not compute solution for formula : ShieldIIPs-PT-010B-CTLFireability-2024-11
Could not compute solution for formula : ShieldIIPs-PT-010B-CTLFireability-2023-12
Could not compute solution for formula : ShieldIIPs-PT-010B-CTLFireability-2023-13
Could not compute solution for formula : ShieldIIPs-PT-010B-CTLFireability-2023-14
Could not compute solution for formula : ShieldIIPs-PT-010B-CTLFireability-2023-15
BK_STOP 1717225151036
--------------------
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 ShieldIIPs-PT-010B-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/1242/ctl_0_
ctl formula name ShieldIIPs-PT-010B-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/1242/ctl_1_
ctl formula name ShieldIIPs-PT-010B-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/1242/ctl_2_
ctl formula name ShieldIIPs-PT-010B-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/1242/ctl_3_
ctl formula name ShieldIIPs-PT-010B-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/1242/ctl_4_
ctl formula name ShieldIIPs-PT-010B-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/1242/ctl_5_
ctl formula name ShieldIIPs-PT-010B-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/1242/ctl_6_
ctl formula name ShieldIIPs-PT-010B-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/1242/ctl_7_
ctl formula name ShieldIIPs-PT-010B-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/1242/ctl_8_
ctl formula name ShieldIIPs-PT-010B-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/1242/ctl_9_
ctl formula name ShieldIIPs-PT-010B-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/1242/ctl_10_
ctl formula name ShieldIIPs-PT-010B-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/1242/ctl_11_
ctl formula name ShieldIIPs-PT-010B-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/1242/ctl_12_
ctl formula name ShieldIIPs-PT-010B-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/1242/ctl_13_
ctl formula name ShieldIIPs-PT-010B-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/1242/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="ShieldIIPs-PT-010B"
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 ShieldIIPs-PT-010B, 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-171683760300090"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-010B.tgz
mv ShieldIIPs-PT-010B 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 ;