Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 404K
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K 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.7K Apr 23 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Apr 12 17:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 12 17:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 12 17:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 12 17:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:54 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 24K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldRVs-PT-002B-CTLCardinality-2024-00
FORMULA_NAME ShieldRVs-PT-002B-CTLCardinality-2024-01
FORMULA_NAME ShieldRVs-PT-002B-CTLCardinality-2024-02
FORMULA_NAME ShieldRVs-PT-002B-CTLCardinality-2024-03
FORMULA_NAME ShieldRVs-PT-002B-CTLCardinality-2024-04
FORMULA_NAME ShieldRVs-PT-002B-CTLCardinality-2024-05
FORMULA_NAME ShieldRVs-PT-002B-CTLCardinality-2024-06
FORMULA_NAME ShieldRVs-PT-002B-CTLCardinality-2024-07
FORMULA_NAME ShieldRVs-PT-002B-CTLCardinality-2024-08
FORMULA_NAME ShieldRVs-PT-002B-CTLCardinality-2024-09
FORMULA_NAME ShieldRVs-PT-002B-CTLCardinality-2024-10
FORMULA_NAME ShieldRVs-PT-002B-CTLCardinality-2024-11
FORMULA_NAME ShieldRVs-PT-002B-CTLCardinality-2023-12
FORMULA_NAME ShieldRVs-PT-002B-CTLCardinality-2023-13
FORMULA_NAME ShieldRVs-PT-002B-CTLCardinality-2023-14
FORMULA_NAME ShieldRVs-PT-002B-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717262558272

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-002B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 17:22:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 17:22:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 17:22:39] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2024-06-01 17:22:39] [INFO ] Transformed 83 places.
[2024-06-01 17:22:39] [INFO ] Transformed 93 transitions.
[2024-06-01 17:22:39] [INFO ] Found NUPN structural information;
[2024-06-01 17:22:39] [INFO ] Parsed PT model containing 83 places and 93 transitions and 288 arcs in 141 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldRVs-PT-002B-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 53 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 93/93 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 81 transition count 91
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 81 transition count 91
Applied a total of 4 rules in 26 ms. Remains 81 /83 variables (removed 2) and now considering 91/93 (removed 2) transitions.
// Phase 1: matrix 91 rows 81 cols
[2024-06-01 17:22:39] [INFO ] Computed 9 invariants in 5 ms
[2024-06-01 17:22:39] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-06-01 17:22:39] [INFO ] Invariant cache hit.
[2024-06-01 17:22:39] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2024-06-01 17:22:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/81 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-01 17:22:40] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 12 ms to minimize.
[2024-06-01 17:22:40] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 2 ms to minimize.
[2024-06-01 17:22:40] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-06-01 17:22:40] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-06-01 17:22:40] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-06-01 17:22:40] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-06-01 17:22:40] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-06-01 17:22:40] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-06-01 17:22:40] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 0 ms to minimize.
[2024-06-01 17:22:40] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-06-01 17:22:41] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2024-06-01 17:22:41] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-06-01 17:22:41] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-06-01 17:22:41] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-06-01 17:22:41] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2024-06-01 17:22:41] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-06-01 17:22:41] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-06-01 17:22:41] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
[2024-06-01 17:22:41] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
[2024-06-01 17:22:41] [INFO ] Deduced a trap composed of 17 places in 16 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-01 17:22:41] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-06-01 17:22:41] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-06-01 17:22:41] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-06-01 17:22:41] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2024-06-01 17:22:41] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-06-01 17:22:41] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-06-01 17:22:41] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 0 ms to minimize.
[2024-06-01 17:22:41] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 0 ms to minimize.
[2024-06-01 17:22:41] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 0 ms to minimize.
[2024-06-01 17:22:41] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 1 ms to minimize.
[2024-06-01 17:22:41] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 0 ms to minimize.
[2024-06-01 17:22:41] [INFO ] Deduced a trap composed of 31 places in 29 ms of which 0 ms to minimize.
[2024-06-01 17:22:41] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
[2024-06-01 17:22:41] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-06-01 17:22:41] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 4 ms to minimize.
[2024-06-01 17:22:41] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2024-06-01 17:22:41] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 1 ms to minimize.
[2024-06-01 17:22:42] [INFO ] Deduced a trap composed of 27 places in 23 ms of which 0 ms to minimize.
[2024-06-01 17:22:42] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-06-01 17:22:42] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 20/49 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-01 17:22:42] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-06-01 17:22:42] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-06-01 17:22:42] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2024-06-01 17:22:42] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 0 ms to minimize.
[2024-06-01 17:22:42] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
[2024-06-01 17:22:42] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-06-01 17:22:42] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
[2024-06-01 17:22:42] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 1 ms to minimize.
[2024-06-01 17:22:42] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-06-01 17:22:42] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-06-01 17:22:42] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-06-01 17:22:42] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-06-01 17:22:42] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-06-01 17:22:42] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 0 ms to minimize.
[2024-06-01 17:22:42] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-06-01 17:22:43] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2024-06-01 17:22:43] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2024-06-01 17:22:43] [INFO ] Deduced a trap composed of 28 places in 21 ms of which 0 ms to minimize.
[2024-06-01 17:22:43] [INFO ] Deduced a trap composed of 28 places in 26 ms of which 0 ms to minimize.
[2024-06-01 17:22:43] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 20/69 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-01 17:22:43] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-06-01 17:22:43] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-06-01 17:22:43] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-06-01 17:22:43] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 4 ms to minimize.
[2024-06-01 17:22:43] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-06-01 17:22:43] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-06-01 17:22:43] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-06-01 17:22:43] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
[2024-06-01 17:22:43] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-06-01 17:22:43] [INFO ] Deduced a trap composed of 16 places in 18 ms of which 0 ms to minimize.
[2024-06-01 17:22:43] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-06-01 17:22:43] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-06-01 17:22:43] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 0 ms to minimize.
[2024-06-01 17:22:43] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-06-01 17:22:43] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 15/84 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-01 17:22:43] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-06-01 17:22:44] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 0 ms to minimize.
[2024-06-01 17:22:44] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-01 17:22:44] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-06-01 17:22:44] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-01 17:22:44] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2024-06-01 17:22:44] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 0 ms to minimize.
[2024-06-01 17:22:44] [INFO ] Deduced a trap composed of 27 places in 23 ms of which 0 ms to minimize.
[2024-06-01 17:22:44] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 0 ms to minimize.
[2024-06-01 17:22:44] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2024-06-01 17:22:44] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 6/95 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-01 17:22:45] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 0 ms to minimize.
[2024-06-01 17:22:45] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-06-01 17:22:45] [INFO ] Deduced a trap composed of 22 places in 19 ms of which 1 ms to minimize.
[2024-06-01 17:22:45] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/81 variables, 4/99 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-01 17:22:45] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-01 17:22:45] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-06-01 17:22:45] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 1 ms to minimize.
[2024-06-01 17:22:45] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 0 ms to minimize.
[2024-06-01 17:22:45] [INFO ] Deduced a trap composed of 29 places in 26 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/81 variables, 5/104 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-01 17:22:45] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-06-01 17:22:45] [INFO ] Deduced a trap composed of 36 places in 27 ms of which 0 ms to minimize.
[2024-06-01 17:22:45] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-06-01 17:22:46] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 1 ms to minimize.
[2024-06-01 17:22:46] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-06-01 17:22:46] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/81 variables, 6/110 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/81 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 13 (OVERLAPS) 91/172 variables, 81/191 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-01 17:22:46] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
[2024-06-01 17:22:46] [INFO ] Deduced a trap composed of 28 places in 22 ms of which 1 ms to minimize.
[2024-06-01 17:22:46] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-06-01 17:22:46] [INFO ] Deduced a trap composed of 27 places in 21 ms of which 0 ms to minimize.
[2024-06-01 17:22:46] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/172 variables, 5/196 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-01 17:22:47] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 1 ms to minimize.
[2024-06-01 17:22:47] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 0 ms to minimize.
[2024-06-01 17:22:47] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-06-01 17:22:47] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-06-01 17:22:47] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-06-01 17:22:47] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/172 variables, 6/202 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-01 17:22:47] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 0 ms to minimize.
[2024-06-01 17:22:47] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-06-01 17:22:48] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/172 variables, 3/205 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/172 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 18 (OVERLAPS) 0/172 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 172/172 variables, and 205 constraints, problems are : Problem set: 0 solved, 90 unsolved in 9040 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 81/81 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 115/115 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/81 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 115/124 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-01 17:22:49] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-06-01 17:22:49] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-01 17:22:49] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (OVERLAPS) 91/172 variables, 81/208 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 90/298 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-01 17:22:50] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-06-01 17:22:50] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 2/300 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-01 17:22:52] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-06-01 17:22:52] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-06-01 17:22:52] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/172 variables, 3/303 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-01 17:22:53] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-06-01 17:22:53] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 1 ms to minimize.
[2024-06-01 17:22:53] [INFO ] Deduced a trap composed of 25 places in 23 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/172 variables, 3/306 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-01 17:22:55] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/172 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-01 17:22:57] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/172 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/172 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-01 17:23:00] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-06-01 17:23:00] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2024-06-01 17:23:00] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 1 ms to minimize.
[2024-06-01 17:23:00] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/172 variables, 4/312 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-01 17:23:01] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-01 17:23:01] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/172 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/172 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-01 17:23:05] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/172 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-01 17:23:06] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-06-01 17:23:06] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-06-01 17:23:06] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 1 ms to minimize.
[2024-06-01 17:23:06] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/172 variables, 4/319 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-01 17:23:08] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
[2024-06-01 17:23:08] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 0 ms to minimize.
[2024-06-01 17:23:08] [INFO ] Deduced a trap composed of 28 places in 26 ms of which 1 ms to minimize.
[2024-06-01 17:23:08] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 0 ms to minimize.
[2024-06-01 17:23:08] [INFO ] Deduced a trap composed of 29 places in 24 ms of which 2 ms to minimize.
[2024-06-01 17:23:08] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-06-01 17:23:08] [INFO ] Deduced a trap composed of 26 places in 21 ms of which 0 ms to minimize.
[2024-06-01 17:23:09] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/172 variables, 8/327 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-01 17:23:10] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-06-01 17:23:10] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/172 variables, 2/329 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-01 17:23:12] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
[2024-06-01 17:23:12] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-06-01 17:23:13] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-06-01 17:23:13] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
[2024-06-01 17:23:13] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/172 variables, 5/334 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/172 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-01 17:23:16] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
At refinement iteration 23 (OVERLAPS) 0/172 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-01 17:23:18] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-06-01 17:23:18] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 0 ms to minimize.
[2024-06-01 17:23:18] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 172/172 variables, and 338 constraints, problems are : Problem set: 0 solved, 90 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 81/81 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 158/158 constraints]
After SMT, in 39114ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 39137ms
Starting structural reductions in LTL mode, iteration 1 : 81/83 places, 91/93 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39483 ms. Remains : 81/83 places, 91/93 transitions.
Support contains 53 out of 81 places after structural reductions.
[2024-06-01 17:23:19] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-06-01 17:23:19] [INFO ] Flatten gal took : 27 ms
FORMULA ShieldRVs-PT-002B-CTLCardinality-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-002B-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 17:23:19] [INFO ] Flatten gal took : 10 ms
[2024-06-01 17:23:19] [INFO ] Input system was already deterministic with 91 transitions.
Support contains 43 out of 81 places (down from 53) after GAL structural reductions.
RANDOM walk for 40000 steps (358 resets) in 1339 ms. (29 steps per ms) remains 3/39 properties
BEST_FIRST walk for 40003 steps (100 resets) in 202 ms. (197 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (77 resets) in 78 ms. (506 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (108 resets) in 79 ms. (500 steps per ms) remains 3/3 properties
[2024-06-01 17:23:19] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp27 is UNSAT
At refinement iteration 1 (OVERLAPS) 59/71 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 10/81 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 91/172 variables, 81/90 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 0/90 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/172 variables, 0/90 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 172/172 variables, and 90 constraints, problems are : Problem set: 1 solved, 2 unsolved in 77 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 81/81 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 63/71 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 17:23:20] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-06-01 17:23:20] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-06-01 17:23:20] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-06-01 17:23:20] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 4/12 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 17:23:20] [INFO ] Deduced a trap composed of 23 places in 21 ms of which 1 ms to minimize.
[2024-06-01 17:23:20] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
[2024-06-01 17:23:20] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-06-01 17:23:20] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
[2024-06-01 17:23:20] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-06-01 17:23:20] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 6/18 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/81 variables, 1/19 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 17:23:20] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 0 ms to minimize.
[2024-06-01 17:23:20] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 2/21 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 91/172 variables, 81/102 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/172 variables, 2/104 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 17:23:20] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-01 17:23:20] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2024-06-01 17:23:20] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/172 variables, 3/107 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 17:23:20] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/172 variables, 1/108 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/172 variables, 0/108 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 17:23:20] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2024-06-01 17:23:20] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/172 variables, 2/110 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/172 variables, 0/110 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/172 variables, 0/110 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 172/172 variables, and 110 constraints, problems are : Problem set: 1 solved, 2 unsolved in 726 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 81/81 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 18/18 constraints]
After SMT, in 810ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 0 properties in 188 ms.
Support contains 8 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 91/91 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 81 transition count 85
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 75 transition count 84
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 74 transition count 84
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 14 place count 74 transition count 77
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 28 place count 67 transition count 77
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 37 place count 58 transition count 68
Iterating global reduction 3 with 9 rules applied. Total rules applied 46 place count 58 transition count 68
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 46 place count 58 transition count 65
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 52 place count 55 transition count 65
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 80 place count 41 transition count 51
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 84 place count 41 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 85 place count 40 transition count 50
Applied a total of 85 rules in 28 ms. Remains 40 /81 variables (removed 41) and now considering 50/91 (removed 41) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 40/81 places, 50/91 transitions.
RANDOM walk for 40000 steps (544 resets) in 175 ms. (227 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (165 resets) in 51 ms. (769 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (145 resets) in 64 ms. (615 steps per ms) remains 2/2 properties
Probably explored full state space saw : 48269 states, properties seen :1
Probabilistic random walk after 255080 steps, saw 48269 distinct states, run finished after 516 ms. (steps per millisecond=494 ) properties seen :1
Explored full state space saw : 48269 states, properties seen :0
Exhaustive walk after 255080 steps, saw 48269 distinct states, run finished after 146 ms. (steps per millisecond=1747 ) properties seen :0
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
[2024-06-01 17:23:21] [INFO ] Flatten gal took : 7 ms
[2024-06-01 17:23:21] [INFO ] Flatten gal took : 6 ms
[2024-06-01 17:23:21] [INFO ] Input system was already deterministic with 91 transitions.
Computed a total of 22 stabilizing places and 22 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 81/81 places, 91/91 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 80 transition count 83
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 73 transition count 83
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 14 place count 73 transition count 74
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 32 place count 64 transition count 74
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 44 place count 52 transition count 62
Iterating global reduction 2 with 12 rules applied. Total rules applied 56 place count 52 transition count 62
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 56 place count 52 transition count 59
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 62 place count 49 transition count 59
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 90 place count 35 transition count 45
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 92 place count 33 transition count 43
Applied a total of 92 rules in 12 ms. Remains 33 /81 variables (removed 48) and now considering 43/91 (removed 48) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 33/81 places, 43/91 transitions.
[2024-06-01 17:23:21] [INFO ] Flatten gal took : 3 ms
[2024-06-01 17:23:21] [INFO ] Flatten gal took : 3 ms
[2024-06-01 17:23:21] [INFO ] Input system was already deterministic with 43 transitions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 91/91 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 71 transition count 81
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 71 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 70 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 70 transition count 80
Applied a total of 22 rules in 4 ms. Remains 70 /81 variables (removed 11) and now considering 80/91 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 70/81 places, 80/91 transitions.
[2024-06-01 17:23:21] [INFO ] Flatten gal took : 4 ms
[2024-06-01 17:23:21] [INFO ] Flatten gal took : 4 ms
[2024-06-01 17:23:21] [INFO ] Input system was already deterministic with 80 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 81/81 places, 91/91 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 80 transition count 81
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 71 transition count 81
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 18 place count 71 transition count 71
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 38 place count 61 transition count 71
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 49 place count 50 transition count 60
Iterating global reduction 2 with 11 rules applied. Total rules applied 60 place count 50 transition count 60
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 60 place count 50 transition count 56
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 68 place count 46 transition count 56
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 96 place count 32 transition count 42
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 98 place count 30 transition count 40
Applied a total of 98 rules in 11 ms. Remains 30 /81 variables (removed 51) and now considering 40/91 (removed 51) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 30/81 places, 40/91 transitions.
[2024-06-01 17:23:21] [INFO ] Flatten gal took : 3 ms
[2024-06-01 17:23:21] [INFO ] Flatten gal took : 2 ms
[2024-06-01 17:23:21] [INFO ] Input system was already deterministic with 40 transitions.
RANDOM walk for 116 steps (1 resets) in 6 ms. (16 steps per ms) remains 0/1 properties
FORMULA ShieldRVs-PT-002B-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 91/91 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 69 transition count 79
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 69 transition count 79
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 68 transition count 78
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 68 transition count 78
Applied a total of 26 rules in 4 ms. Remains 68 /81 variables (removed 13) and now considering 78/91 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 68/81 places, 78/91 transitions.
[2024-06-01 17:23:21] [INFO ] Flatten gal took : 4 ms
[2024-06-01 17:23:21] [INFO ] Flatten gal took : 4 ms
[2024-06-01 17:23:21] [INFO ] Input system was already deterministic with 78 transitions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 91/91 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 69 transition count 79
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 69 transition count 79
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 68 transition count 78
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 68 transition count 78
Applied a total of 26 rules in 4 ms. Remains 68 /81 variables (removed 13) and now considering 78/91 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 68/81 places, 78/91 transitions.
[2024-06-01 17:23:21] [INFO ] Flatten gal took : 4 ms
[2024-06-01 17:23:21] [INFO ] Flatten gal took : 4 ms
[2024-06-01 17:23:21] [INFO ] Input system was already deterministic with 78 transitions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 91/91 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 73 transition count 83
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 73 transition count 83
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 72 transition count 82
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 72 transition count 82
Applied a total of 18 rules in 3 ms. Remains 72 /81 variables (removed 9) and now considering 82/91 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 72/81 places, 82/91 transitions.
[2024-06-01 17:23:21] [INFO ] Flatten gal took : 4 ms
[2024-06-01 17:23:21] [INFO ] Flatten gal took : 4 ms
[2024-06-01 17:23:21] [INFO ] Input system was already deterministic with 82 transitions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 91/91 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 72 transition count 82
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 72 transition count 82
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 71 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 71 transition count 81
Applied a total of 20 rules in 6 ms. Remains 71 /81 variables (removed 10) and now considering 81/91 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 71/81 places, 81/91 transitions.
[2024-06-01 17:23:21] [INFO ] Flatten gal took : 4 ms
[2024-06-01 17:23:21] [INFO ] Flatten gal took : 3 ms
[2024-06-01 17:23:21] [INFO ] Input system was already deterministic with 81 transitions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 91/91 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 72 transition count 82
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 72 transition count 82
Applied a total of 18 rules in 2 ms. Remains 72 /81 variables (removed 9) and now considering 82/91 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 72/81 places, 82/91 transitions.
[2024-06-01 17:23:21] [INFO ] Flatten gal took : 4 ms
[2024-06-01 17:23:21] [INFO ] Flatten gal took : 4 ms
[2024-06-01 17:23:21] [INFO ] Input system was already deterministic with 82 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 81/81 places, 91/91 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 80 transition count 82
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 72 transition count 82
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 16 place count 72 transition count 72
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 36 place count 62 transition count 72
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 46 place count 52 transition count 62
Iterating global reduction 2 with 10 rules applied. Total rules applied 56 place count 52 transition count 62
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 56 place count 52 transition count 59
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 62 place count 49 transition count 59
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 92 place count 34 transition count 44
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 94 place count 32 transition count 42
Applied a total of 94 rules in 9 ms. Remains 32 /81 variables (removed 49) and now considering 42/91 (removed 49) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 32/81 places, 42/91 transitions.
[2024-06-01 17:23:21] [INFO ] Flatten gal took : 2 ms
[2024-06-01 17:23:21] [INFO ] Flatten gal took : 2 ms
[2024-06-01 17:23:21] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 91/91 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 70 transition count 80
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 70 transition count 80
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 69 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 69 transition count 79
Applied a total of 24 rules in 2 ms. Remains 69 /81 variables (removed 12) and now considering 79/91 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 69/81 places, 79/91 transitions.
[2024-06-01 17:23:21] [INFO ] Flatten gal took : 4 ms
[2024-06-01 17:23:21] [INFO ] Flatten gal took : 4 ms
[2024-06-01 17:23:21] [INFO ] Input system was already deterministic with 79 transitions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 91/91 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 69 transition count 79
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 69 transition count 79
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 68 transition count 78
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 68 transition count 78
Applied a total of 26 rules in 2 ms. Remains 68 /81 variables (removed 13) and now considering 78/91 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 68/81 places, 78/91 transitions.
[2024-06-01 17:23:21] [INFO ] Flatten gal took : 4 ms
[2024-06-01 17:23:21] [INFO ] Flatten gal took : 3 ms
[2024-06-01 17:23:21] [INFO ] Input system was already deterministic with 78 transitions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 91/91 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 69 transition count 79
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 69 transition count 79
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 68 transition count 78
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 68 transition count 78
Applied a total of 26 rules in 2 ms. Remains 68 /81 variables (removed 13) and now considering 78/91 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 68/81 places, 78/91 transitions.
[2024-06-01 17:23:21] [INFO ] Flatten gal took : 3 ms
[2024-06-01 17:23:21] [INFO ] Flatten gal took : 3 ms
[2024-06-01 17:23:22] [INFO ] Input system was already deterministic with 78 transitions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 91/91 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 69 transition count 79
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 69 transition count 79
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 68 transition count 78
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 68 transition count 78
Applied a total of 26 rules in 2 ms. Remains 68 /81 variables (removed 13) and now considering 78/91 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 68/81 places, 78/91 transitions.
[2024-06-01 17:23:22] [INFO ] Flatten gal took : 4 ms
[2024-06-01 17:23:22] [INFO ] Flatten gal took : 3 ms
[2024-06-01 17:23:22] [INFO ] Input system was already deterministic with 78 transitions.
[2024-06-01 17:23:22] [INFO ] Flatten gal took : 4 ms
[2024-06-01 17:23:22] [INFO ] Flatten gal took : 4 ms
[2024-06-01 17:23:22] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-06-01 17:23:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 81 places, 91 transitions and 284 arcs took 1 ms.
Total runtime 42701 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : ShieldRVs-PT-002B-CTLCardinality-2024-01
Could not compute solution for formula : ShieldRVs-PT-002B-CTLCardinality-2024-02
Could not compute solution for formula : ShieldRVs-PT-002B-CTLCardinality-2024-04
Could not compute solution for formula : ShieldRVs-PT-002B-CTLCardinality-2024-05
Could not compute solution for formula : ShieldRVs-PT-002B-CTLCardinality-2024-06
Could not compute solution for formula : ShieldRVs-PT-002B-CTLCardinality-2024-08
Could not compute solution for formula : ShieldRVs-PT-002B-CTLCardinality-2024-09
Could not compute solution for formula : ShieldRVs-PT-002B-CTLCardinality-2024-10
Could not compute solution for formula : ShieldRVs-PT-002B-CTLCardinality-2024-11
Could not compute solution for formula : ShieldRVs-PT-002B-CTLCardinality-2023-12
Could not compute solution for formula : ShieldRVs-PT-002B-CTLCardinality-2023-13
Could not compute solution for formula : ShieldRVs-PT-002B-CTLCardinality-2023-15

BK_STOP 1717262602404

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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
mcc2024
ctl formula name ShieldRVs-PT-002B-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/1054/ctl_0_
ctl formula name ShieldRVs-PT-002B-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/1054/ctl_1_
ctl formula name ShieldRVs-PT-002B-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/1054/ctl_2_
ctl formula name ShieldRVs-PT-002B-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/1054/ctl_3_
ctl formula name ShieldRVs-PT-002B-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/1054/ctl_4_
ctl formula name ShieldRVs-PT-002B-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/1054/ctl_5_
ctl formula name ShieldRVs-PT-002B-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/1054/ctl_6_
ctl formula name ShieldRVs-PT-002B-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/1054/ctl_7_
ctl formula name ShieldRVs-PT-002B-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/1054/ctl_8_
ctl formula name ShieldRVs-PT-002B-CTLCardinality-2023-12
ctl formula formula --ctl=/tmp/1054/ctl_9_
ctl formula name ShieldRVs-PT-002B-CTLCardinality-2023-13
ctl formula formula --ctl=/tmp/1054/ctl_10_
ctl formula name ShieldRVs-PT-002B-CTLCardinality-2023-15
ctl formula formula --ctl=/tmp/1054/ctl_11_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVs-PT-002B"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is ShieldRVs-PT-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 r528-tall-171683761700729"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-002B.tgz
mv ShieldRVs-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 ;