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-171683757900025.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 CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683757900025
=====================================================================

--------------------
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-CTLCardinality-2024-00
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-2024-01
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-2024-02
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-2024-03
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-2024-04
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-2024-05
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-2024-06
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-2024-07
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-2024-08
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-2024-09
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-2024-10
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-2024-11
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-2023-12
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-2023-13
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-2023-14
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716876429172

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
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:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 06:07:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 06:07:10] [INFO ] Load time of PNML (sax parser for PT used): 54 ms
[2024-05-28 06:07:10] [INFO ] Transformed 123 places.
[2024-05-28 06:07:10] [INFO ] Transformed 121 transitions.
[2024-05-28 06:07:10] [INFO ] Found NUPN structural information;
[2024-05-28 06:07:10] [INFO ] Parsed PT model containing 123 places and 121 transitions and 362 arcs in 145 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
FORMULA ShieldIIPs-PT-002B-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 68 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 121/121 transitions.
Applied a total of 0 rules in 11 ms. Remains 123 /123 variables (removed 0) and now considering 121/121 (removed 0) transitions.
// Phase 1: matrix 121 rows 123 cols
[2024-05-28 06:07:10] [INFO ] Computed 19 invariants in 13 ms
[2024-05-28 06:07:10] [INFO ] Implicit Places using invariants in 212 ms returned []
[2024-05-28 06:07:10] [INFO ] Invariant cache hit.
[2024-05-28 06:07:10] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2024-05-28 06:07:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 19/141 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 06:07:12] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 16 ms to minimize.
[2024-05-28 06:07:12] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 2 ms to minimize.
[2024-05-28 06:07:12] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-28 06:07:12] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-05-28 06:07:12] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:07:12] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-05-28 06:07:12] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-28 06:07:12] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 2 ms to minimize.
[2024-05-28 06:07:12] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:07:12] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:07:12] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 1 ms to minimize.
[2024-05-28 06:07:12] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:07:12] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:07:12] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 0 ms to minimize.
[2024-05-28 06:07:12] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-28 06:07:12] [INFO ] Deduced a trap composed of 21 places in 20 ms of which 0 ms to minimize.
[2024-05-28 06:07:12] [INFO ] Deduced a trap composed of 21 places in 19 ms of which 1 ms to minimize.
[2024-05-28 06:07:12] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:07:12] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:07:12] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 06:07:12] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 12 ms to minimize.
[2024-05-28 06:07:12] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:07:13] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 0 ms to minimize.
[2024-05-28 06:07:13] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-28 06:07:13] [INFO ] Deduced a trap composed of 22 places in 19 ms of which 0 ms to minimize.
[2024-05-28 06:07:13] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-05-28 06:07:13] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:07:13] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:07:13] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:07:13] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:07:13] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:07:13] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:07:13] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-05-28 06:07:13] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:07:13] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 4 ms to minimize.
[2024-05-28 06:07:13] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:07:13] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:07:13] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 1 ms to minimize.
[2024-05-28 06:07:13] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:07:13] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 20/182 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 06:07:13] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-28 06:07:13] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:07:14] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:07:14] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:07:14] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
[2024-05-28 06:07:14] [INFO ] Deduced a trap composed of 26 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:07:14] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:07:14] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 1 ms to minimize.
[2024-05-28 06:07:14] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-05-28 06:07:14] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:07:14] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 0 ms to minimize.
[2024-05-28 06:07:14] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:07:14] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:07:14] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:07:14] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-28 06:07:14] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 16/198 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 06:07:15] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 5 ms to minimize.
[2024-05-28 06:07:15] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-28 06:07:15] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-28 06:07:15] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-05-28 06:07:15] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 0 ms to minimize.
[2024-05-28 06:07:15] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 6/204 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 06:07:15] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (OVERLAPS) 121/244 variables, 123/328 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 06:07:16] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-05-28 06:07:16] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 0 ms to minimize.
[2024-05-28 06:07:16] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-05-28 06:07:16] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-05-28 06:07:16] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-28 06:07:16] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 0 ms to minimize.
[2024-05-28 06:07:16] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
[2024-05-28 06:07:16] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:07:17] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-28 06:07:17] [INFO ] Deduced a trap composed of 26 places in 24 ms of which 0 ms to minimize.
[2024-05-28 06:07:17] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:07:17] [INFO ] Deduced a trap composed of 30 places in 26 ms of which 0 ms to minimize.
[2024-05-28 06:07:17] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:07:17] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2024-05-28 06:07:17] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-05-28 06:07:17] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-28 06:07:17] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-05-28 06:07:17] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 1 ms to minimize.
[2024-05-28 06:07:17] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-28 06:07:17] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/244 variables, 20/348 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 06:07:17] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-05-28 06:07:18] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-28 06:07:18] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 1 ms to minimize.
[2024-05-28 06:07:18] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:07:18] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/244 variables, 5/353 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 06:07:19] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2024-05-28 06:07:19] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-28 06:07:19] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 0 ms to minimize.
[2024-05-28 06:07:19] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/244 variables, 4/357 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 06:07:19] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-05-28 06:07:19] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-28 06:07:19] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-28 06:07:19] [INFO ] Deduced a trap composed of 30 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:07:19] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:07:20] [INFO ] Deduced a trap composed of 35 places in 28 ms of which 0 ms to minimize.
[2024-05-28 06:07:20] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-28 06:07:20] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2024-05-28 06:07:20] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:07:20] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-28 06:07:20] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:07:20] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:07:20] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-28 06:07:20] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/244 variables, 14/371 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 06:07:20] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/244 variables, 1/372 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/244 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 06:07:22] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/244 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 06:07:23] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:07:23] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-28 06:07:23] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
[2024-05-28 06:07:23] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:07:23] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/244 variables, 5/378 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/244 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 06:07:25] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
At refinement iteration 20 (OVERLAPS) 0/244 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 06:07:25] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:07:25] [INFO ] Deduced a trap composed of 26 places in 20 ms of which 0 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/244 variables, 2/381 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/244 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 06:07:27] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-28 06:07:27] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 2 ms to minimize.
At refinement iteration 23 (OVERLAPS) 0/244 variables, 2/383 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 06:07:27] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/244 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 06:07:28] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:07:28] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-05-28 06:07:29] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 0 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/244 variables, 3/387 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 06:07:29] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-28 06:07:29] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 0 ms to minimize.
[2024-05-28 06:07:29] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 0 ms to minimize.
[2024-05-28 06:07:29] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-28 06:07:29] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-28 06:07:29] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 0 ms to minimize.
[2024-05-28 06:07:29] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:07:29] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-28 06:07:29] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 0 ms to minimize.
[2024-05-28 06:07:29] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:07:30] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:07:30] [INFO ] Deduced a trap composed of 25 places in 22 ms of which 0 ms to minimize.
[2024-05-28 06:07:30] [INFO ] Deduced a trap composed of 29 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:07:30] [INFO ] Deduced a trap composed of 31 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:07:30] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 0 ms to minimize.
[2024-05-28 06:07:30] [INFO ] Deduced a trap composed of 27 places in 24 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/244 variables, 16/403 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 06:07:30] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 0 ms to minimize.
[2024-05-28 06:07:30] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/244 variables, 2/405 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 06:07:31] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 1 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/244 variables, 1/406 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/244 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 06:07:33] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
[2024-05-28 06:07:33] [INFO ] Deduced a trap composed of 27 places in 19 ms of which 1 ms to minimize.
At refinement iteration 30 (OVERLAPS) 0/244 variables, 2/408 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 06:07:34] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 1 ms to minimize.
[2024-05-28 06:07:34] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 1 ms to minimize.
[2024-05-28 06:07:34] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-05-28 06:07:34] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:07:34] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:07:34] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:07:34] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 0 ms to minimize.
[2024-05-28 06:07:34] [INFO ] Deduced a trap composed of 39 places in 29 ms of which 1 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/244 variables, 8/416 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 06:07:35] [INFO ] Deduced a trap composed of 19 places in 17 ms of which 0 ms to minimize.
At refinement iteration 32 (INCLUDED_ONLY) 0/244 variables, 1/417 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 06:07:36] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
At refinement iteration 33 (INCLUDED_ONLY) 0/244 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/244 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 35 (OVERLAPS) 0/244 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 244/244 variables, and 418 constraints, problems are : Problem set: 0 solved, 120 unsolved in 27356 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 153/153 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 19/141 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 153/295 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 06:07:38] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-05-28 06:07:39] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:07:39] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-28 06:07:39] [INFO ] Deduced a trap composed of 35 places in 27 ms of which 0 ms to minimize.
[2024-05-28 06:07:39] [INFO ] Deduced a trap composed of 38 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:07:39] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:07:39] [INFO ] Deduced a trap composed of 30 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:07:39] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:07:39] [INFO ] Deduced a trap composed of 26 places in 23 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 9/304 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 121/244 variables, 123/427 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 120/547 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 06:07:41] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:07:41] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:07:41] [INFO ] Deduced a trap composed of 25 places in 22 ms of which 1 ms to minimize.
[2024-05-28 06:07:41] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-28 06:07:41] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/244 variables, 5/552 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 06:07:46] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/244 variables, 1/553 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 06:07:49] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-05-28 06:07:49] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:07:49] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-05-28 06:07:50] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/244 variables, 4/557 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 06:07:53] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/244 variables, 1/558 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 06:07:57] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-28 06:07:58] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/244 variables, 2/560 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 06:08:01] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/244 variables, 1/561 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 06:08:05] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 0 ms to minimize.
[2024-05-28 06:08:05] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:08:05] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:08:05] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-28 06:08:05] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/244 variables, 5/566 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 244/244 variables, and 566 constraints, problems are : Problem set: 0 solved, 120 unsolved in 30018 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 181/181 constraints]
After SMT, in 57431ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 57443ms
Finished structural reductions in LTL mode , in 1 iterations and 57826 ms. Remains : 123/123 places, 121/121 transitions.
Support contains 68 out of 123 places after structural reductions.
[2024-05-28 06:08:08] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-28 06:08:08] [INFO ] Flatten gal took : 31 ms
FORMULA ShieldIIPs-PT-002B-CTLCardinality-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 06:08:08] [INFO ] Flatten gal took : 13 ms
[2024-05-28 06:08:08] [INFO ] Input system was already deterministic with 121 transitions.
Support contains 66 out of 123 places (down from 68) after GAL structural reductions.
RANDOM walk for 12292 steps (35 resets) in 341 ms. (35 steps per ms) remains 0/49 properties
[2024-05-28 06:08:08] [INFO ] Flatten gal took : 9 ms
[2024-05-28 06:08:08] [INFO ] Flatten gal took : 9 ms
[2024-05-28 06:08:08] [INFO ] Input system was already deterministic with 121 transitions.
Computed a total of 32 stabilizing places and 32 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 123/123 places, 121/121 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 122 transition count 109
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 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 22 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 44 place count 100 transition count 98
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 57 place count 87 transition count 85
Iterating global reduction 2 with 13 rules applied. Total rules applied 70 place count 87 transition count 85
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 70 place count 87 transition count 79
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 82 place count 81 transition count 79
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 138 place count 53 transition count 51
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 140 place count 51 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 141 place count 50 transition count 49
Applied a total of 141 rules in 47 ms. Remains 50 /123 variables (removed 73) and now considering 49/121 (removed 72) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 48 ms. Remains : 50/123 places, 49/121 transitions.
[2024-05-28 06:08:08] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:08:08] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:08:08] [INFO ] Input system was already deterministic with 49 transitions.
RANDOM walk for 1137 steps (7 resets) in 8 ms. (126 steps per ms) remains 0/1 properties
FORMULA ShieldIIPs-PT-002B-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 123/123 places, 121/121 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 122 transition count 112
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 114 transition count 111
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 113 transition count 111
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 18 place count 113 transition count 100
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 40 place count 102 transition count 100
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 53 place count 89 transition count 87
Iterating global reduction 3 with 13 rules applied. Total rules applied 66 place count 89 transition count 87
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 66 place count 89 transition count 82
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 76 place count 84 transition count 82
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 122 place count 61 transition count 59
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 124 place count 59 transition count 57
Applied a total of 124 rules in 48 ms. Remains 59 /123 variables (removed 64) and now considering 57/121 (removed 64) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 48 ms. Remains : 59/123 places, 57/121 transitions.
[2024-05-28 06:08:08] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:08:08] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:08:08] [INFO ] Input system was already deterministic with 57 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 123/123 places, 121/121 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 123 transition count 111
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 113 transition count 111
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 20 place count 113 transition count 101
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 40 place count 103 transition count 101
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 54 place count 89 transition count 87
Iterating global reduction 2 with 14 rules applied. Total rules applied 68 place count 89 transition count 87
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 68 place count 89 transition count 81
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 80 place count 83 transition count 81
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 124 place count 61 transition count 59
Applied a total of 124 rules in 44 ms. Remains 61 /123 variables (removed 62) and now considering 59/121 (removed 62) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 44 ms. Remains : 61/123 places, 59/121 transitions.
[2024-05-28 06:08:09] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:08:09] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:08:09] [INFO ] Input system was already deterministic with 59 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 123/123 places, 121/121 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 122 transition count 110
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 11 rules applied. Total rules applied 21 place count 112 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 111 transition count 109
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 22 place count 111 transition count 99
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 42 place count 101 transition count 99
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 54 place count 89 transition count 87
Iterating global reduction 3 with 12 rules applied. Total rules applied 66 place count 89 transition count 87
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 66 place count 89 transition count 83
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 74 place count 85 transition count 83
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 3 with 58 rules applied. Total rules applied 132 place count 56 transition count 54
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 134 place count 54 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 135 place count 53 transition count 52
Applied a total of 135 rules in 19 ms. Remains 53 /123 variables (removed 70) and now considering 52/121 (removed 69) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 53/123 places, 52/121 transitions.
[2024-05-28 06:08:09] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:08:09] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:08:09] [INFO ] Input system was already deterministic with 52 transitions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 121/121 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 112 transition count 110
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 112 transition count 110
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 111 transition count 109
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 111 transition count 109
Applied a total of 24 rules in 9 ms. Remains 111 /123 variables (removed 12) and now considering 109/121 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 111/123 places, 109/121 transitions.
[2024-05-28 06:08:09] [INFO ] Flatten gal took : 6 ms
[2024-05-28 06:08:09] [INFO ] Flatten gal took : 6 ms
[2024-05-28 06:08:09] [INFO ] Input system was already deterministic with 109 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 123/123 places, 121/121 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 122 transition count 113
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 115 transition count 113
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 14 place count 115 transition count 102
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 36 place count 104 transition count 102
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 44 place count 96 transition count 94
Iterating global reduction 2 with 8 rules applied. Total rules applied 52 place count 96 transition count 94
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 52 place count 96 transition count 91
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 58 place count 93 transition count 91
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 114 place count 65 transition count 63
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 116 place count 63 transition count 61
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 117 place count 62 transition count 61
Applied a total of 117 rules in 15 ms. Remains 62 /123 variables (removed 61) and now considering 61/121 (removed 60) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16 ms. Remains : 62/123 places, 61/121 transitions.
[2024-05-28 06:08:09] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:08:09] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:08:09] [INFO ] Input system was already deterministic with 61 transitions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 121/121 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 111 transition count 109
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 111 transition count 109
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 110 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 110 transition count 108
Applied a total of 26 rules in 4 ms. Remains 110 /123 variables (removed 13) and now considering 108/121 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 110/123 places, 108/121 transitions.
[2024-05-28 06:08:09] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:08:09] [INFO ] Flatten gal took : 8 ms
[2024-05-28 06:08:09] [INFO ] Input system was already deterministic with 108 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 123/123 places, 121/121 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 122 transition count 109
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 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 22 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 44 place count 100 transition count 98
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 58 place count 86 transition count 84
Iterating global reduction 2 with 14 rules applied. Total rules applied 72 place count 86 transition count 84
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 72 place count 86 transition count 78
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 84 place count 80 transition count 78
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 140 place count 52 transition count 50
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 142 place count 50 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 143 place count 49 transition count 48
Applied a total of 143 rules in 13 ms. Remains 49 /123 variables (removed 74) and now considering 48/121 (removed 73) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 49/123 places, 48/121 transitions.
[2024-05-28 06:08:09] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:08:09] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:08:09] [INFO ] Input system was already deterministic with 48 transitions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 121/121 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 112 transition count 110
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 112 transition count 110
Applied a total of 22 rules in 3 ms. Remains 112 /123 variables (removed 11) and now considering 110/121 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 112/123 places, 110/121 transitions.
[2024-05-28 06:08:09] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:08:09] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:08:09] [INFO ] Input system was already deterministic with 110 transitions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 121/121 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 112 transition count 110
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 112 transition count 110
Applied a total of 22 rules in 4 ms. Remains 112 /123 variables (removed 11) and now considering 110/121 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 112/123 places, 110/121 transitions.
[2024-05-28 06:08:09] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:08:09] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:08:09] [INFO ] Input system was already deterministic with 110 transitions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 121/121 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 113 transition count 111
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 113 transition count 111
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 112 transition count 110
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 112 transition count 110
Applied a total of 22 rules in 4 ms. Remains 112 /123 variables (removed 11) and now considering 110/121 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 112/123 places, 110/121 transitions.
[2024-05-28 06:08:09] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:08:09] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:08:09] [INFO ] Input system was already deterministic with 110 transitions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 121/121 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 110 transition count 108
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 110 transition count 108
Applied a total of 26 rules in 2 ms. Remains 110 /123 variables (removed 13) and now considering 108/121 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 110/123 places, 108/121 transitions.
[2024-05-28 06:08:09] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:08:09] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:08:09] [INFO ] Input system was already deterministic with 108 transitions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 121/121 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 109 transition count 107
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 109 transition count 107
Applied a total of 28 rules in 3 ms. Remains 109 /123 variables (removed 14) and now considering 107/121 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 109/123 places, 107/121 transitions.
[2024-05-28 06:08:09] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:08:09] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:08:09] [INFO ] Input system was already deterministic with 107 transitions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 121/121 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 111 transition count 109
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 111 transition count 109
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 110 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 110 transition count 108
Applied a total of 26 rules in 4 ms. Remains 110 /123 variables (removed 13) and now considering 108/121 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 110/123 places, 108/121 transitions.
[2024-05-28 06:08:09] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:08:09] [INFO ] Flatten gal took : 6 ms
[2024-05-28 06:08:09] [INFO ] Input system was already deterministic with 108 transitions.
[2024-05-28 06:08:09] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:08:09] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:08:09] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-28 06:08:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 123 places, 121 transitions and 362 arcs took 2 ms.
Total runtime 59121 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/421/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 123
TRANSITIONS: 121
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.004s, Sys 0.000s]


SAVING FILE /home/mcc/execution/421/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: 1099
MODEL NAME: /home/mcc/execution/421/model
123 places, 121 transitions.

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.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA ShieldIIPs-PT-002B-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldIIPs-PT-002B-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldIIPs-PT-002B-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldIIPs-PT-002B-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldIIPs-PT-002B-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldIIPs-PT-002B-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldIIPs-PT-002B-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldIIPs-PT-002B-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldIIPs-PT-002B-CTLCardinality-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldIIPs-PT-002B-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldIIPs-PT-002B-CTLCardinality-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldIIPs-PT-002B-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldIIPs-PT-002B-CTLCardinality-2023-13 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716877637718

--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

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="CTLCardinality"
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 CTLCardinality"
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-171683757900025"
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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;