About the Execution of LTSMin+red for ShieldRVs-PT-010A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 392.331 | 49385.00 | 71096.00 | 161.50 | ????????????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-171683761800786.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is ShieldRVs-PT-010A, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683761800786
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 18:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 176K Apr 12 18:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Apr 12 17:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 12 17:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 63K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldRVs-PT-010A-CTLFireability-2024-00
FORMULA_NAME ShieldRVs-PT-010A-CTLFireability-2024-01
FORMULA_NAME ShieldRVs-PT-010A-CTLFireability-2024-02
FORMULA_NAME ShieldRVs-PT-010A-CTLFireability-2024-03
FORMULA_NAME ShieldRVs-PT-010A-CTLFireability-2024-04
FORMULA_NAME ShieldRVs-PT-010A-CTLFireability-2024-05
FORMULA_NAME ShieldRVs-PT-010A-CTLFireability-2024-06
FORMULA_NAME ShieldRVs-PT-010A-CTLFireability-2024-07
FORMULA_NAME ShieldRVs-PT-010A-CTLFireability-2024-08
FORMULA_NAME ShieldRVs-PT-010A-CTLFireability-2024-09
FORMULA_NAME ShieldRVs-PT-010A-CTLFireability-2024-10
FORMULA_NAME ShieldRVs-PT-010A-CTLFireability-2024-11
FORMULA_NAME ShieldRVs-PT-010A-CTLFireability-2023-12
FORMULA_NAME ShieldRVs-PT-010A-CTLFireability-2023-13
FORMULA_NAME ShieldRVs-PT-010A-CTLFireability-2023-14
FORMULA_NAME ShieldRVs-PT-010A-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1717264079087
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-010A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 17:48:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 17:48:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 17:48:00] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2024-06-01 17:48:00] [INFO ] Transformed 143 places.
[2024-06-01 17:48:00] [INFO ] Transformed 193 transitions.
[2024-06-01 17:48:00] [INFO ] Found NUPN structural information;
[2024-06-01 17:48:00] [INFO ] Parsed PT model containing 143 places and 193 transitions and 920 arcs in 172 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Support contains 111 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 193/193 transitions.
Applied a total of 0 rules in 13 ms. Remains 143 /143 variables (removed 0) and now considering 193/193 (removed 0) transitions.
// Phase 1: matrix 193 rows 143 cols
[2024-06-01 17:48:00] [INFO ] Computed 41 invariants in 14 ms
[2024-06-01 17:48:00] [INFO ] Implicit Places using invariants in 226 ms returned []
[2024-06-01 17:48:00] [INFO ] Invariant cache hit.
[2024-06-01 17:48:00] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
Running 192 sub problems to find dead transitions.
[2024-06-01 17:48:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 142/142 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (OVERLAPS) 1/143 variables, 41/183 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-06-01 17:48:02] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 12 ms to minimize.
[2024-06-01 17:48:02] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 2 ms to minimize.
[2024-06-01 17:48:03] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 0 ms to minimize.
[2024-06-01 17:48:03] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-06-01 17:48:03] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-06-01 17:48:03] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-06-01 17:48:03] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-06-01 17:48:03] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-06-01 17:48:03] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-06-01 17:48:03] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-06-01 17:48:03] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-06-01 17:48:03] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-06-01 17:48:03] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-06-01 17:48:03] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-06-01 17:48:03] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-06-01 17:48:03] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-06-01 17:48:03] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-06-01 17:48:03] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-06-01 17:48:03] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-06-01 17:48:03] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 20/204 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-06-01 17:48:04] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-06-01 17:48:04] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-06-01 17:48:04] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-06-01 17:48:04] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
[2024-06-01 17:48:04] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-06-01 17:48:04] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-06-01 17:48:04] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-06-01 17:48:04] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-06-01 17:48:04] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-06-01 17:48:04] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-06-01 17:48:04] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-06-01 17:48:04] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2024-06-01 17:48:04] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
[2024-06-01 17:48:04] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 2 ms to minimize.
[2024-06-01 17:48:04] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 4 ms to minimize.
[2024-06-01 17:48:04] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-06-01 17:48:04] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-06-01 17:48:04] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2024-06-01 17:48:05] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-06-01 17:48:05] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 20/224 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-06-01 17:48:05] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-06-01 17:48:05] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2024-06-01 17:48:05] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-06-01 17:48:05] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-06-01 17:48:05] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-06-01 17:48:05] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
[2024-06-01 17:48:05] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-06-01 17:48:05] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-06-01 17:48:05] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-06-01 17:48:05] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 10/234 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-06-01 17:48:06] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 2 ms to minimize.
[2024-06-01 17:48:06] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-06-01 17:48:06] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-06-01 17:48:06] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-06-01 17:48:07] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-06-01 17:48:07] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-06-01 17:48:07] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 2 ms to minimize.
[2024-06-01 17:48:07] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 8/242 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-06-01 17:48:07] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-06-01 17:48:07] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-06-01 17:48:07] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-06-01 17:48:08] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 4/246 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-06-01 17:48:08] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-06-01 17:48:08] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-06-01 17:48:08] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-06-01 17:48:08] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-06-01 17:48:09] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 5/251 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 11 (OVERLAPS) 193/336 variables, 143/394 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-06-01 17:48:10] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-06-01 17:48:10] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-06-01 17:48:10] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-06-01 17:48:11] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-06-01 17:48:11] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/336 variables, 5/399 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-06-01 17:48:12] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-06-01 17:48:12] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-06-01 17:48:12] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-06-01 17:48:12] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-06-01 17:48:13] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 0 ms to minimize.
[2024-06-01 17:48:13] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-06-01 17:48:13] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-06-01 17:48:13] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-06-01 17:48:13] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-06-01 17:48:13] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/336 variables, 10/409 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-06-01 17:48:13] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-06-01 17:48:13] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-06-01 17:48:14] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2024-06-01 17:48:14] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-06-01 17:48:14] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-06-01 17:48:14] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-06-01 17:48:14] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2024-06-01 17:48:14] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2024-06-01 17:48:14] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-06-01 17:48:14] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-06-01 17:48:14] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-06-01 17:48:14] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/336 variables, 12/421 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-06-01 17:48:15] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-06-01 17:48:15] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-06-01 17:48:15] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-06-01 17:48:15] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-06-01 17:48:15] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2024-06-01 17:48:15] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2024-06-01 17:48:15] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 0 ms to minimize.
[2024-06-01 17:48:15] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 0 ms to minimize.
[2024-06-01 17:48:15] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/336 variables, 9/430 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-06-01 17:48:17] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/336 variables, 1/431 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-06-01 17:48:18] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-06-01 17:48:18] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-06-01 17:48:18] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-06-01 17:48:18] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 0 ms to minimize.
[2024-06-01 17:48:18] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-06-01 17:48:18] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-06-01 17:48:18] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-06-01 17:48:18] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-06-01 17:48:18] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-06-01 17:48:18] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-06-01 17:48:19] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-06-01 17:48:19] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/336 variables, 12/443 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-06-01 17:48:19] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/336 variables, 1/444 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-06-01 17:48:21] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2024-06-01 17:48:21] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-06-01 17:48:21] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-06-01 17:48:21] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-06-01 17:48:22] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 0 ms to minimize.
[2024-06-01 17:48:22] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 2 ms to minimize.
[2024-06-01 17:48:22] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-06-01 17:48:22] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2024-06-01 17:48:22] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-06-01 17:48:22] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/336 variables, 10/454 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-06-01 17:48:23] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-06-01 17:48:23] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
[2024-06-01 17:48:23] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-06-01 17:48:23] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-06-01 17:48:23] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-06-01 17:48:24] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/336 variables, 6/460 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-06-01 17:48:24] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-06-01 17:48:24] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-06-01 17:48:25] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-06-01 17:48:25] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/336 variables, 4/464 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-06-01 17:48:26] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-06-01 17:48:27] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-06-01 17:48:27] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 0 ms to minimize.
[2024-06-01 17:48:27] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/336 variables, 4/468 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-06-01 17:48:28] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-06-01 17:48:28] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2024-06-01 17:48:28] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-06-01 17:48:28] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
[2024-06-01 17:48:28] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-06-01 17:48:28] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-06-01 17:48:28] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-06-01 17:48:28] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/336 variables, 8/476 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-06-01 17:48:29] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-06-01 17:48:29] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/336 variables, 2/478 constraints. Problems are: Problem set: 0 solved, 192 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 336/336 variables, and 478 constraints, problems are : Problem set: 0 solved, 192 unsolved in 30029 ms.
Refiners :[Domain max(s): 143/143 constraints, Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 151/151 constraints]
Escalating to Integer solving :Problem set: 0 solved, 192 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 142/142 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (OVERLAPS) 1/143 variables, 41/183 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 151/335 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 6 (OVERLAPS) 193/336 variables, 143/478 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 192/670 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/336 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 9 (OVERLAPS) 0/336 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Int declared 336/336 variables, and 670 constraints, problems are : Problem set: 0 solved, 192 unsolved in 14810 ms.
Refiners :[Domain max(s): 143/143 constraints, Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 151/151 constraints]
After SMT, in 44959ms problems are : Problem set: 0 solved, 192 unsolved
Search for dead transitions found 0 dead transitions in 44987ms
Finished structural reductions in LTL mode , in 1 iterations and 45445 ms. Remains : 143/143 places, 193/193 transitions.
Support contains 111 out of 143 places after structural reductions.
[2024-06-01 17:48:46] [INFO ] Flatten gal took : 46 ms
[2024-06-01 17:48:46] [INFO ] Flatten gal took : 21 ms
[2024-06-01 17:48:46] [INFO ] Input system was already deterministic with 193 transitions.
Support contains 110 out of 143 places (down from 111) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 74 to 72
RANDOM walk for 40000 steps (274 resets) in 1580 ms. (25 steps per ms) remains 5/72 properties
BEST_FIRST walk for 40004 steps (46 resets) in 378 ms. (105 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (36 resets) in 95 ms. (416 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (33 resets) in 84 ms. (470 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (38 resets) in 106 ms. (373 steps per ms) remains 3/4 properties
[2024-06-01 17:48:46] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp40 is UNSAT
After SMT solving in domain Real declared 63/336 variables, and 40 constraints, problems are : Problem set: 3 solved, 0 unsolved in 38 ms.
Refiners :[Domain max(s): 23/143 constraints, Positive P Invariants (semi-flows): 17/41 constraints, State Equation: 0/143 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 54ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
[2024-06-01 17:48:47] [INFO ] Flatten gal took : 17 ms
[2024-06-01 17:48:47] [INFO ] Flatten gal took : 17 ms
[2024-06-01 17:48:47] [INFO ] Input system was already deterministic with 193 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 193/193 transitions.
Applied a total of 0 rules in 6 ms. Remains 143 /143 variables (removed 0) and now considering 193/193 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 143/143 places, 193/193 transitions.
[2024-06-01 17:48:47] [INFO ] Flatten gal took : 14 ms
[2024-06-01 17:48:47] [INFO ] Flatten gal took : 15 ms
[2024-06-01 17:48:47] [INFO ] Input system was already deterministic with 193 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 143/143 places, 193/193 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 142 transition count 192
Applied a total of 2 rules in 30 ms. Remains 142 /143 variables (removed 1) and now considering 192/193 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30 ms. Remains : 142/143 places, 192/193 transitions.
[2024-06-01 17:48:47] [INFO ] Flatten gal took : 13 ms
[2024-06-01 17:48:47] [INFO ] Flatten gal took : 13 ms
[2024-06-01 17:48:47] [INFO ] Input system was already deterministic with 192 transitions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 193/193 transitions.
Applied a total of 0 rules in 6 ms. Remains 143 /143 variables (removed 0) and now considering 193/193 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 143/143 places, 193/193 transitions.
[2024-06-01 17:48:47] [INFO ] Flatten gal took : 13 ms
[2024-06-01 17:48:47] [INFO ] Flatten gal took : 13 ms
[2024-06-01 17:48:47] [INFO ] Input system was already deterministic with 193 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 143/143 places, 193/193 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 142 transition count 192
Applied a total of 2 rules in 17 ms. Remains 142 /143 variables (removed 1) and now considering 192/193 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 142/143 places, 192/193 transitions.
[2024-06-01 17:48:47] [INFO ] Flatten gal took : 11 ms
[2024-06-01 17:48:47] [INFO ] Flatten gal took : 11 ms
[2024-06-01 17:48:47] [INFO ] Input system was already deterministic with 192 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 143/143 places, 193/193 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 142 transition count 192
Applied a total of 2 rules in 11 ms. Remains 142 /143 variables (removed 1) and now considering 192/193 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 142/143 places, 192/193 transitions.
[2024-06-01 17:48:47] [INFO ] Flatten gal took : 10 ms
[2024-06-01 17:48:47] [INFO ] Flatten gal took : 9 ms
[2024-06-01 17:48:47] [INFO ] Input system was already deterministic with 192 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 143/143 places, 193/193 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 142 transition count 192
Applied a total of 2 rules in 11 ms. Remains 142 /143 variables (removed 1) and now considering 192/193 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 142/143 places, 192/193 transitions.
[2024-06-01 17:48:47] [INFO ] Flatten gal took : 9 ms
[2024-06-01 17:48:47] [INFO ] Flatten gal took : 9 ms
[2024-06-01 17:48:47] [INFO ] Input system was already deterministic with 192 transitions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 193/193 transitions.
Applied a total of 0 rules in 2 ms. Remains 143 /143 variables (removed 0) and now considering 193/193 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 143/143 places, 193/193 transitions.
[2024-06-01 17:48:47] [INFO ] Flatten gal took : 9 ms
[2024-06-01 17:48:47] [INFO ] Flatten gal took : 9 ms
[2024-06-01 17:48:47] [INFO ] Input system was already deterministic with 193 transitions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 193/193 transitions.
Applied a total of 0 rules in 1 ms. Remains 143 /143 variables (removed 0) and now considering 193/193 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 143/143 places, 193/193 transitions.
[2024-06-01 17:48:47] [INFO ] Flatten gal took : 9 ms
[2024-06-01 17:48:47] [INFO ] Flatten gal took : 9 ms
[2024-06-01 17:48:47] [INFO ] Input system was already deterministic with 193 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 143/143 places, 193/193 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 142 transition count 192
Applied a total of 2 rules in 10 ms. Remains 142 /143 variables (removed 1) and now considering 192/193 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 142/143 places, 192/193 transitions.
[2024-06-01 17:48:47] [INFO ] Flatten gal took : 8 ms
[2024-06-01 17:48:47] [INFO ] Flatten gal took : 8 ms
[2024-06-01 17:48:47] [INFO ] Input system was already deterministic with 192 transitions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 193/193 transitions.
Applied a total of 0 rules in 2 ms. Remains 143 /143 variables (removed 0) and now considering 193/193 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 143/143 places, 193/193 transitions.
[2024-06-01 17:48:47] [INFO ] Flatten gal took : 9 ms
[2024-06-01 17:48:47] [INFO ] Flatten gal took : 10 ms
[2024-06-01 17:48:47] [INFO ] Input system was already deterministic with 193 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 143/143 places, 193/193 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 141 transition count 191
Applied a total of 2 rules in 11 ms. Remains 141 /143 variables (removed 2) and now considering 191/193 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 141/143 places, 191/193 transitions.
[2024-06-01 17:48:47] [INFO ] Flatten gal took : 9 ms
[2024-06-01 17:48:47] [INFO ] Flatten gal took : 8 ms
[2024-06-01 17:48:47] [INFO ] Input system was already deterministic with 191 transitions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 193/193 transitions.
Applied a total of 0 rules in 2 ms. Remains 143 /143 variables (removed 0) and now considering 193/193 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 143/143 places, 193/193 transitions.
[2024-06-01 17:48:47] [INFO ] Flatten gal took : 14 ms
[2024-06-01 17:48:47] [INFO ] Flatten gal took : 9 ms
[2024-06-01 17:48:47] [INFO ] Input system was already deterministic with 193 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 143/143 places, 193/193 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 142 transition count 192
Applied a total of 2 rules in 10 ms. Remains 142 /143 variables (removed 1) and now considering 192/193 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 142/143 places, 192/193 transitions.
[2024-06-01 17:48:47] [INFO ] Flatten gal took : 8 ms
[2024-06-01 17:48:47] [INFO ] Flatten gal took : 8 ms
[2024-06-01 17:48:47] [INFO ] Input system was already deterministic with 192 transitions.
RANDOM walk for 957 steps (5 resets) in 15 ms. (59 steps per ms) remains 0/1 properties
FORMULA ShieldRVs-PT-010A-CTLFireability-2023-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 193/193 transitions.
Applied a total of 0 rules in 2 ms. Remains 143 /143 variables (removed 0) and now considering 193/193 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 143/143 places, 193/193 transitions.
[2024-06-01 17:48:47] [INFO ] Flatten gal took : 8 ms
[2024-06-01 17:48:47] [INFO ] Flatten gal took : 8 ms
[2024-06-01 17:48:47] [INFO ] Input system was already deterministic with 193 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 143/143 places, 193/193 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 142 transition count 192
Applied a total of 2 rules in 9 ms. Remains 142 /143 variables (removed 1) and now considering 192/193 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 142/143 places, 192/193 transitions.
[2024-06-01 17:48:47] [INFO ] Flatten gal took : 8 ms
[2024-06-01 17:48:47] [INFO ] Flatten gal took : 9 ms
[2024-06-01 17:48:47] [INFO ] Input system was already deterministic with 192 transitions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 193/193 transitions.
Applied a total of 0 rules in 2 ms. Remains 143 /143 variables (removed 0) and now considering 193/193 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 143/143 places, 193/193 transitions.
[2024-06-01 17:48:47] [INFO ] Flatten gal took : 7 ms
[2024-06-01 17:48:47] [INFO ] Flatten gal took : 8 ms
[2024-06-01 17:48:47] [INFO ] Input system was already deterministic with 193 transitions.
[2024-06-01 17:48:47] [INFO ] Flatten gal took : 9 ms
[2024-06-01 17:48:47] [INFO ] Flatten gal took : 9 ms
[2024-06-01 17:48:47] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2024-06-01 17:48:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 143 places, 193 transitions and 920 arcs took 3 ms.
Total runtime 47764 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : ShieldRVs-PT-010A-CTLFireability-2024-00
Could not compute solution for formula : ShieldRVs-PT-010A-CTLFireability-2024-01
Could not compute solution for formula : ShieldRVs-PT-010A-CTLFireability-2024-02
Could not compute solution for formula : ShieldRVs-PT-010A-CTLFireability-2024-03
Could not compute solution for formula : ShieldRVs-PT-010A-CTLFireability-2024-04
Could not compute solution for formula : ShieldRVs-PT-010A-CTLFireability-2024-05
Could not compute solution for formula : ShieldRVs-PT-010A-CTLFireability-2024-06
Could not compute solution for formula : ShieldRVs-PT-010A-CTLFireability-2024-07
Could not compute solution for formula : ShieldRVs-PT-010A-CTLFireability-2024-08
Could not compute solution for formula : ShieldRVs-PT-010A-CTLFireability-2024-09
Could not compute solution for formula : ShieldRVs-PT-010A-CTLFireability-2024-10
Could not compute solution for formula : ShieldRVs-PT-010A-CTLFireability-2024-11
Could not compute solution for formula : ShieldRVs-PT-010A-CTLFireability-2023-13
Could not compute solution for formula : ShieldRVs-PT-010A-CTLFireability-2023-14
Could not compute solution for formula : ShieldRVs-PT-010A-CTLFireability-2023-15
BK_STOP 1717264128472
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name ShieldRVs-PT-010A-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/965/ctl_0_
ctl formula name ShieldRVs-PT-010A-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/965/ctl_1_
ctl formula name ShieldRVs-PT-010A-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/965/ctl_2_
ctl formula name ShieldRVs-PT-010A-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/965/ctl_3_
ctl formula name ShieldRVs-PT-010A-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/965/ctl_4_
ctl formula name ShieldRVs-PT-010A-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/965/ctl_5_
ctl formula name ShieldRVs-PT-010A-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/965/ctl_6_
ctl formula name ShieldRVs-PT-010A-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/965/ctl_7_
ctl formula name ShieldRVs-PT-010A-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/965/ctl_8_
ctl formula name ShieldRVs-PT-010A-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/965/ctl_9_
ctl formula name ShieldRVs-PT-010A-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/965/ctl_10_
ctl formula name ShieldRVs-PT-010A-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/965/ctl_11_
ctl formula name ShieldRVs-PT-010A-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/965/ctl_12_
ctl formula name ShieldRVs-PT-010A-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/965/ctl_13_
ctl formula name ShieldRVs-PT-010A-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/965/ctl_14_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVs-PT-010A"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is ShieldRVs-PT-010A, 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-171683761800786"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-010A.tgz
mv ShieldRVs-PT-010A 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 ;