Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r355-tall-171683757900026.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is ShieldIIPs-PT-002B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683757900026
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K 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.5K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 14:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 183K Apr 11 14:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 11 14:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 11 14:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:51 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 33K 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-002B-CTLFireability-2024-00
FORMULA_NAME ShieldIIPs-PT-002B-CTLFireability-2024-01
FORMULA_NAME ShieldIIPs-PT-002B-CTLFireability-2024-02
FORMULA_NAME ShieldIIPs-PT-002B-CTLFireability-2024-03
FORMULA_NAME ShieldIIPs-PT-002B-CTLFireability-2024-04
FORMULA_NAME ShieldIIPs-PT-002B-CTLFireability-2024-05
FORMULA_NAME ShieldIIPs-PT-002B-CTLFireability-2024-06
FORMULA_NAME ShieldIIPs-PT-002B-CTLFireability-2024-07
FORMULA_NAME ShieldIIPs-PT-002B-CTLFireability-2024-08
FORMULA_NAME ShieldIIPs-PT-002B-CTLFireability-2024-09
FORMULA_NAME ShieldIIPs-PT-002B-CTLFireability-2024-10
FORMULA_NAME ShieldIIPs-PT-002B-CTLFireability-2024-11
FORMULA_NAME ShieldIIPs-PT-002B-CTLFireability-2023-12
FORMULA_NAME ShieldIIPs-PT-002B-CTLFireability-2023-13
FORMULA_NAME ShieldIIPs-PT-002B-CTLFireability-2023-14
FORMULA_NAME ShieldIIPs-PT-002B-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716876432155

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-002B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 06:07:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 06:07:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 06:07:13] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2024-05-28 06:07:13] [INFO ] Transformed 123 places.
[2024-05-28 06:07:13] [INFO ] Transformed 121 transitions.
[2024-05-28 06:07:13] [INFO ] Found NUPN structural information;
[2024-05-28 06:07:13] [INFO ] Parsed PT model containing 123 places and 121 transitions and 362 arcs in 154 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
Support contains 94 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 121/121 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 122 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 122 transition count 120
Applied a total of 2 rules in 22 ms. Remains 122 /123 variables (removed 1) and now considering 120/121 (removed 1) transitions.
// Phase 1: matrix 120 rows 122 cols
[2024-05-28 06:07:13] [INFO ] Computed 19 invariants in 13 ms
[2024-05-28 06:07:13] [INFO ] Implicit Places using invariants in 203 ms returned []
[2024-05-28 06:07:13] [INFO ] Invariant cache hit.
[2024-05-28 06:07:13] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
Running 119 sub problems to find dead transitions.
[2024-05-28 06:07:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 06:07:14] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 12 ms to minimize.
[2024-05-28 06:07:14] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-28 06:07:14] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-05-28 06:07:14] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2024-05-28 06:07:15] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:07:15] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-28 06:07:15] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:07:15] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 06:07:15] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-28 06:07:15] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-28 06:07:15] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 0 ms to minimize.
[2024-05-28 06:07:15] [INFO ] Deduced a trap composed of 31 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:07:15] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:07:15] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 1 ms to minimize.
[2024-05-28 06:07:15] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 0 ms to minimize.
[2024-05-28 06:07:15] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-28 06:07:15] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:07:15] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
[2024-05-28 06:07:15] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:07:15] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 06:07:15] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 3 ms to minimize.
[2024-05-28 06:07:15] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 1 ms to minimize.
[2024-05-28 06:07:15] [INFO ] Deduced a trap composed of 16 places in 16 ms of which 1 ms to minimize.
[2024-05-28 06:07:15] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 0 ms to minimize.
[2024-05-28 06:07:15] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
[2024-05-28 06:07:15] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
[2024-05-28 06:07:15] [INFO ] Deduced a trap composed of 18 places in 18 ms of which 0 ms to minimize.
[2024-05-28 06:07:15] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 0 ms to minimize.
[2024-05-28 06:07:16] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:07:16] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:07:16] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:07:16] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:07:16] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:07:16] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:07:16] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 4 ms to minimize.
[2024-05-28 06:07:16] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:07:16] [INFO ] Deduced a trap composed of 25 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:07:16] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-05-28 06:07:16] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 1 ms to minimize.
[2024-05-28 06:07:16] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 06:07:16] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:07:16] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:07:16] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2024-05-28 06:07:16] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-28 06:07:16] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:07:17] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:07:17] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:07:17] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:07:17] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:07:17] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-28 06:07:17] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 2 ms to minimize.
[2024-05-28 06:07:17] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 06:07:17] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:07:17] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 1 ms to minimize.
[2024-05-28 06:07:17] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-28 06:07:17] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-28 06:07:17] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 7 ms to minimize.
[2024-05-28 06:07:17] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
[2024-05-28 06:07:17] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 7/78 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 06:07:18] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-28 06:07:18] [INFO ] Deduced a trap composed of 26 places in 25 ms of which 0 ms to minimize.
[2024-05-28 06:07:18] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-28 06:07:18] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-28 06:07:18] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2024-05-28 06:07:18] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2024-05-28 06:07:18] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:07:18] [INFO ] Deduced a trap composed of 26 places in 22 ms of which 1 ms to minimize.
[2024-05-28 06:07:18] [INFO ] Deduced a trap composed of 26 places in 23 ms of which 0 ms to minimize.
[2024-05-28 06:07:18] [INFO ] Deduced a trap composed of 31 places in 29 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 06:07:19] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:07:19] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:07:19] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
[2024-05-28 06:07:19] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 0 ms to minimize.
[2024-05-28 06:07:19] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:07:19] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:07:19] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 7/95 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 06:07:19] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-05-28 06:07:19] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 1 ms to minimize.
[2024-05-28 06:07:19] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
[2024-05-28 06:07:19] [INFO ] Deduced a trap composed of 18 places in 18 ms of which 0 ms to minimize.
[2024-05-28 06:07:19] [INFO ] Deduced a trap composed of 26 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:07:19] [INFO ] Deduced a trap composed of 24 places in 20 ms of which 0 ms to minimize.
[2024-05-28 06:07:19] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:07:19] [INFO ] Deduced a trap composed of 24 places in 20 ms of which 0 ms to minimize.
[2024-05-28 06:07:19] [INFO ] Deduced a trap composed of 22 places in 20 ms of which 0 ms to minimize.
[2024-05-28 06:07:19] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:07:20] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:07:20] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:07:20] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:07:20] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:07:20] [INFO ] Deduced a trap composed of 32 places in 27 ms of which 0 ms to minimize.
[2024-05-28 06:07:20] [INFO ] Deduced a trap composed of 35 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 16/111 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 06:07:20] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-28 06:07:20] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 11 (OVERLAPS) 120/242 variables, 122/235 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 06:07:21] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/242 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/242 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 06:07:22] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-05-28 06:07:22] [INFO ] Deduced a trap composed of 37 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:07:22] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:07:22] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:07:23] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-05-28 06:07:23] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-28 06:07:23] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:07:23] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 0 ms to minimize.
[2024-05-28 06:07:23] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-28 06:07:23] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/242 variables, 10/246 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 06:07:23] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:07:24] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:07:24] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:07:24] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:07:24] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:07:24] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 0 ms to minimize.
[2024-05-28 06:07:24] [INFO ] Deduced a trap composed of 26 places in 19 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/242 variables, 7/253 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 06:07:25] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 1 ms to minimize.
[2024-05-28 06:07:25] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 1 ms to minimize.
[2024-05-28 06:07:25] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
[2024-05-28 06:07:25] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-05-28 06:07:25] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/242 variables, 5/258 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/242 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 06:07:26] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/242 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/242 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 06:07:28] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-05-28 06:07:28] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-28 06:07:28] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:07:28] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-28 06:07:28] [INFO ] Deduced a trap composed of 28 places in 22 ms of which 1 ms to minimize.
[2024-05-28 06:07:28] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 0 ms to minimize.
At refinement iteration 20 (OVERLAPS) 0/242 variables, 6/265 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 06:07:28] [INFO ] Deduced a trap composed of 21 places in 20 ms of which 0 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/242 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 06:07:29] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 0 ms to minimize.
[2024-05-28 06:07:29] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:07:29] [INFO ] Deduced a trap composed of 25 places in 22 ms of which 1 ms to minimize.
[2024-05-28 06:07:29] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-28 06:07:29] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 0 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/242 variables, 5/271 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 06:07:30] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/242 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 06:07:31] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:07:31] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 0 ms to minimize.
[2024-05-28 06:07:31] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-28 06:07:31] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:07:31] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/242 variables, 5/277 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 06:07:32] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:07:32] [INFO ] Deduced a trap composed of 28 places in 22 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/242 variables, 2/279 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/242 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 27 (OVERLAPS) 0/242 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 279 constraints, problems are : Problem set: 0 solved, 119 unsolved in 20277 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 138/138 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 138/157 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 06:07:34] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:07:34] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-05-28 06:07:34] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
[2024-05-28 06:07:35] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 4/161 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 06:07:35] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-28 06:07:35] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-05-28 06:07:35] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-28 06:07:35] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 0 ms to minimize.
[2024-05-28 06:07:35] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 5/166 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 06:07:36] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (OVERLAPS) 120/242 variables, 122/289 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 119/408 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 06:07:37] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-28 06:07:37] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 2/410 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 06:07:40] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-05-28 06:07:40] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-28 06:07:40] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-28 06:07:40] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2024-05-28 06:07:40] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-28 06:07:40] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 6/416 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 06:07:42] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-28 06:07:43] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-28 06:07:43] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-28 06:07:43] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-28 06:07:43] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:07:43] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-28 06:07:43] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 7/423 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 06:07:46] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-28 06:07:46] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 0 ms to minimize.
[2024-05-28 06:07:46] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 0 ms to minimize.
[2024-05-28 06:07:46] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/242 variables, 4/427 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 06:07:49] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-05-28 06:07:49] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
[2024-05-28 06:07:49] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-05-28 06:07:49] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:07:49] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:07:49] [INFO ] Deduced a trap composed of 32 places in 29 ms of which 0 ms to minimize.
[2024-05-28 06:07:49] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
[2024-05-28 06:07:50] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/242 variables, 8/435 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 06:07:53] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/242 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 06:07:56] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/242 variables, 1/437 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/242 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 06:08:02] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/242 variables, 1/438 constraints. Problems are: Problem set: 0 solved, 119 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 242/242 variables, and 438 constraints, problems are : Problem set: 0 solved, 119 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 178/178 constraints]
After SMT, in 50344ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 50356ms
Starting structural reductions in LTL mode, iteration 1 : 122/123 places, 120/121 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50726 ms. Remains : 122/123 places, 120/121 transitions.
Support contains 94 out of 122 places after structural reductions.
[2024-05-28 06:08:04] [INFO ] Flatten gal took : 31 ms
[2024-05-28 06:08:04] [INFO ] Flatten gal took : 14 ms
[2024-05-28 06:08:04] [INFO ] Input system was already deterministic with 120 transitions.
RANDOM walk for 40000 steps (115 resets) in 1508 ms. (26 steps per ms) remains 6/96 properties
BEST_FIRST walk for 40004 steps (27 resets) in 100 ms. (396 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (31 resets) in 108 ms. (367 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (22 resets) in 82 ms. (481 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (16 resets) in 96 ms. (412 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (23 resets) in 77 ms. (512 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (19 resets) in 100 ms. (396 steps per ms) remains 6/6 properties
[2024-05-28 06:08:05] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp70 is UNSAT
At refinement iteration 1 (OVERLAPS) 104/122 variables, 19/19 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/19 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 120/242 variables, 122/141 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 0/141 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/242 variables, 0/141 constraints. Problems are: Problem set: 5 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 141 constraints, problems are : Problem set: 5 solved, 1 unsolved in 98 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 1 unsolved
Problem AtomicPropp81 is UNSAT
After SMT solving in domain Int declared 122/242 variables, and 19 constraints, problems are : Problem set: 6 solved, 0 unsolved in 30 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 0/122 constraints, PredecessorRefiner: 0/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 133ms problems are : Problem set: 6 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 6 atomic propositions for a total of 16 simplifications.
FORMULA ShieldIIPs-PT-002B-CTLFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 06:08:05] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-28 06:08:05] [INFO ] Flatten gal took : 10 ms
FORMULA ShieldIIPs-PT-002B-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 06:08:05] [INFO ] Flatten gal took : 8 ms
[2024-05-28 06:08:05] [INFO ] Input system was already deterministic with 120 transitions.
Support contains 89 out of 122 places (down from 90) after GAL structural reductions.
Computed a total of 32 stabilizing places and 32 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 120/120 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 109 transition count 107
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 109 transition count 107
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 108 transition count 106
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 108 transition count 106
Applied a total of 28 rules in 11 ms. Remains 108 /122 variables (removed 14) and now considering 106/120 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 108/122 places, 106/120 transitions.
[2024-05-28 06:08:05] [INFO ] Flatten gal took : 6 ms
[2024-05-28 06:08:05] [INFO ] Flatten gal took : 6 ms
[2024-05-28 06:08:05] [INFO ] Input system was already deterministic with 106 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 122/122 places, 120/120 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 121 transition count 109
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 111 transition count 109
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 20 place count 111 transition count 100
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 38 place count 102 transition count 100
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 48 place count 92 transition count 90
Iterating global reduction 2 with 10 rules applied. Total rules applied 58 place count 92 transition count 90
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 58 place count 92 transition count 86
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 66 place count 88 transition count 86
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 124 place count 59 transition count 57
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 126 place count 57 transition count 55
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 127 place count 56 transition count 55
Applied a total of 127 rules in 31 ms. Remains 56 /122 variables (removed 66) and now considering 55/120 (removed 65) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 31 ms. Remains : 56/122 places, 55/120 transitions.
[2024-05-28 06:08:05] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:08:05] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:08:05] [INFO ] Input system was already deterministic with 55 transitions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 120/120 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 116 transition count 114
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 116 transition count 114
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 115 transition count 113
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 115 transition count 113
Applied a total of 14 rules in 9 ms. Remains 115 /122 variables (removed 7) and now considering 113/120 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 115/122 places, 113/120 transitions.
[2024-05-28 06:08:05] [INFO ] Flatten gal took : 6 ms
[2024-05-28 06:08:05] [INFO ] Flatten gal took : 7 ms
[2024-05-28 06:08:05] [INFO ] Input system was already deterministic with 113 transitions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 120/120 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 110 transition count 108
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 110 transition count 108
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 109 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 109 transition count 107
Applied a total of 26 rules in 8 ms. Remains 109 /122 variables (removed 13) and now considering 107/120 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 109/122 places, 107/120 transitions.
[2024-05-28 06:08:05] [INFO ] Flatten gal took : 6 ms
[2024-05-28 06:08:05] [INFO ] Flatten gal took : 6 ms
[2024-05-28 06:08:05] [INFO ] Input system was already deterministic with 107 transitions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 120/120 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 115 transition count 113
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 115 transition count 113
Applied a total of 14 rules in 4 ms. Remains 115 /122 variables (removed 7) and now considering 113/120 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 115/122 places, 113/120 transitions.
[2024-05-28 06:08:05] [INFO ] Flatten gal took : 6 ms
[2024-05-28 06:08:05] [INFO ] Flatten gal took : 6 ms
[2024-05-28 06:08:05] [INFO ] Input system was already deterministic with 113 transitions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 120/120 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 109 transition count 107
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 109 transition count 107
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 108 transition count 106
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 108 transition count 106
Applied a total of 28 rules in 5 ms. Remains 108 /122 variables (removed 14) and now considering 106/120 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 108/122 places, 106/120 transitions.
[2024-05-28 06:08:05] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:08:05] [INFO ] Flatten gal took : 6 ms
[2024-05-28 06:08:05] [INFO ] Input system was already deterministic with 106 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 122/122 places, 120/120 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 121 transition count 109
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 111 transition count 109
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 20 place count 111 transition count 98
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 42 place count 100 transition count 98
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 54 place count 88 transition count 86
Iterating global reduction 2 with 12 rules applied. Total rules applied 66 place count 88 transition count 86
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 66 place count 88 transition count 81
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 76 place count 83 transition count 81
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 128 place count 57 transition count 55
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 130 place count 55 transition count 53
Applied a total of 130 rules in 17 ms. Remains 55 /122 variables (removed 67) and now considering 53/120 (removed 67) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 55/122 places, 53/120 transitions.
[2024-05-28 06:08:05] [INFO ] Flatten gal took : 2 ms
[2024-05-28 06:08:05] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:08:05] [INFO ] Input system was already deterministic with 53 transitions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 120/120 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 112 transition count 110
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 112 transition count 110
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 111 transition count 109
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 111 transition count 109
Applied a total of 22 rules in 3 ms. Remains 111 /122 variables (removed 11) and now considering 109/120 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 111/122 places, 109/120 transitions.
[2024-05-28 06:08:05] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:08:05] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:08:05] [INFO ] Input system was already deterministic with 109 transitions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 120/120 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 111 transition count 109
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 111 transition count 109
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 110 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 110 transition count 108
Applied a total of 24 rules in 4 ms. Remains 110 /122 variables (removed 12) and now considering 108/120 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 110/122 places, 108/120 transitions.
[2024-05-28 06:08:05] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:08:05] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:08:05] [INFO ] Input system was already deterministic with 108 transitions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 120/120 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 115 transition count 113
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 115 transition count 113
Applied a total of 14 rules in 2 ms. Remains 115 /122 variables (removed 7) and now considering 113/120 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 115/122 places, 113/120 transitions.
[2024-05-28 06:08:05] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:08:05] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:08:05] [INFO ] Input system was already deterministic with 113 transitions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 120/120 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 111 transition count 109
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 111 transition count 109
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 110 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 110 transition count 108
Applied a total of 24 rules in 3 ms. Remains 110 /122 variables (removed 12) and now considering 108/120 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 110/122 places, 108/120 transitions.
[2024-05-28 06:08:05] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:08:05] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:08:05] [INFO ] Input system was already deterministic with 108 transitions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 120/120 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 109 transition count 107
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 109 transition count 107
Applied a total of 26 rules in 3 ms. Remains 109 /122 variables (removed 13) and now considering 107/120 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 109/122 places, 107/120 transitions.
[2024-05-28 06:08:05] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:08:05] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:08:05] [INFO ] Input system was already deterministic with 107 transitions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 120/120 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 109 transition count 107
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 109 transition count 107
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 108 transition count 106
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 108 transition count 106
Applied a total of 28 rules in 4 ms. Remains 108 /122 variables (removed 14) and now considering 106/120 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 108/122 places, 106/120 transitions.
[2024-05-28 06:08:05] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:08:05] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:08:05] [INFO ] Input system was already deterministic with 106 transitions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 120/120 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 111 transition count 109
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 111 transition count 109
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 110 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 110 transition count 108
Applied a total of 24 rules in 3 ms. Remains 110 /122 variables (removed 12) and now considering 108/120 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 110/122 places, 108/120 transitions.
[2024-05-28 06:08:05] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:08:05] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:08:05] [INFO ] Input system was already deterministic with 108 transitions.
[2024-05-28 06:08:05] [INFO ] Flatten gal took : 6 ms
[2024-05-28 06:08:05] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:08:05] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2024-05-28 06:08:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 122 places, 120 transitions and 360 arcs took 1 ms.
Total runtime 52696 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldIIPs-PT-002B

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 122
TRANSITIONS: 120
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.004s, Sys 0.000s]


SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1091
MODEL NAME: /home/mcc/execution/411/model
122 places, 120 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA ShieldIIPs-PT-002B-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldIIPs-PT-002B-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldIIPs-PT-002B-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldIIPs-PT-002B-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldIIPs-PT-002B-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldIIPs-PT-002B-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldIIPs-PT-002B-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldIIPs-PT-002B-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldIIPs-PT-002B-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldIIPs-PT-002B-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldIIPs-PT-002B-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldIIPs-PT-002B-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldIIPs-PT-002B-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldIIPs-PT-002B-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716877189430

--------------------
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

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-002B"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is ShieldIIPs-PT-002B, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r355-tall-171683757900026"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-002B.tgz
mv ShieldIIPs-PT-002B 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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;