Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r417-tajo-167905971900177.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marcie
Input is ShieldRVt-PT-001A, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r417-tajo-167905971900177
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 7.2K Feb 25 23:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 23:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 23:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 23:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 17:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 17:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 23:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 179K Feb 25 23:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 23:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 25 23:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 3.7K Mar 5 18:23 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 ShieldRVt-PT-001A-CTLCardinality-00
FORMULA_NAME ShieldRVt-PT-001A-CTLCardinality-01
FORMULA_NAME ShieldRVt-PT-001A-CTLCardinality-02
FORMULA_NAME ShieldRVt-PT-001A-CTLCardinality-03
FORMULA_NAME ShieldRVt-PT-001A-CTLCardinality-04
FORMULA_NAME ShieldRVt-PT-001A-CTLCardinality-05
FORMULA_NAME ShieldRVt-PT-001A-CTLCardinality-06
FORMULA_NAME ShieldRVt-PT-001A-CTLCardinality-07
FORMULA_NAME ShieldRVt-PT-001A-CTLCardinality-08
FORMULA_NAME ShieldRVt-PT-001A-CTLCardinality-09
FORMULA_NAME ShieldRVt-PT-001A-CTLCardinality-10
FORMULA_NAME ShieldRVt-PT-001A-CTLCardinality-11
FORMULA_NAME ShieldRVt-PT-001A-CTLCardinality-12
FORMULA_NAME ShieldRVt-PT-001A-CTLCardinality-13
FORMULA_NAME ShieldRVt-PT-001A-CTLCardinality-14
FORMULA_NAME ShieldRVt-PT-001A-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679068856195

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marcie
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-001A
Not applying reductions.
Model is PT
CTLCardinality PT
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: ShieldRVt_PT_001A
(NrP: 11 NrTr: 11 NrArc: 40)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec

net check time: 0m 0.000sec

init dd package: 0m 3.359sec


RS generation: 0m 0.000sec


-> reachability set: #nodes 25 (2.5e+01) #states 33



starting MCC model checker
--------------------------

checking: ~ [EG [EF [~ [1<=p3]]]]
normalized: ~ [EG [E [true U ~ [1<=p3]]]]

abstracting: (1<=p3)
states: 16

EG iterations: 0
-> the formula is FALSE

FORMULA ShieldRVt-PT-001A-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EX [EF [1<=p2]]
normalized: EX [E [true U 1<=p2]]

abstracting: (1<=p2)
states: 16
.-> the formula is TRUE

FORMULA ShieldRVt-PT-001A-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: ~ [AX [E [~ [A [AX [p8<=p10] U p4<=0]] U ~ [1<=p2]]]]
normalized: EX [~ [E [~ [[~ [E [~ [p4<=0] U [EX [~ [p8<=p10]] & ~ [p4<=0]]]] & ~ [EG [~ [p4<=0]]]]] U ~ [1<=p2]]]]

abstracting: (1<=p2)
states: 16
abstracting: (p4<=0)
states: 17
.
EG iterations: 1
abstracting: (p4<=0)
states: 17
abstracting: (p8<=p10)
states: 25
.abstracting: (p4<=0)
states: 17
.-> the formula is FALSE

FORMULA ShieldRVt-PT-001A-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: ~ [AF [~ [A [p8<=p0 U [p0<=p1 | EF [p6<=1]]]]]]
normalized: EG [[~ [E [~ [[E [true U p6<=1] | p0<=p1]] U [~ [[E [true U p6<=1] | p0<=p1]] & ~ [p8<=p0]]]] & ~ [EG [~ [[E [true U p6<=1] | p0<=p1]]]]]]

abstracting: (p0<=p1)
states: 32
abstracting: (p6<=1)
states: 33
.
EG iterations: 1
abstracting: (p8<=p0)
states: 17
abstracting: (p0<=p1)
states: 32
abstracting: (p6<=1)
states: 33
abstracting: (p0<=p1)
states: 32
abstracting: (p6<=1)
states: 33

EG iterations: 0
-> the formula is TRUE

FORMULA ShieldRVt-PT-001A-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [AG [~ [[[[[1<=p0 | p2<=1] & ~ [p5<=1]] | 1<=p10] & EX [EG [p4<=1]]]]]]
normalized: ~ [E [true U E [true U [EX [EG [p4<=1]] & [[~ [p5<=1] & [1<=p0 | p2<=1]] | 1<=p10]]]]]

abstracting: (1<=p10)
states: 16
abstracting: (p2<=1)
states: 33
abstracting: (1<=p0)
states: 1
abstracting: (p5<=1)
states: 33
abstracting: (p4<=1)
states: 33

EG iterations: 0
.-> the formula is FALSE

FORMULA ShieldRVt-PT-001A-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AF [[1<=p10 | ~ [AF [[AG [p3<=p9] & [[p2<=1 | p5<=1] | ~ [p5<=p4]]]]]]]
normalized: ~ [EG [~ [[EG [~ [[[~ [p5<=p4] | [p2<=1 | p5<=1]] & ~ [E [true U ~ [p3<=p9]]]]]] | 1<=p10]]]]

abstracting: (1<=p10)
states: 16
abstracting: (p3<=p9)
states: 25
abstracting: (p5<=1)
states: 33
abstracting: (p2<=1)
states: 33
abstracting: (p5<=p4)
states: 25

EG iterations: 0
.
EG iterations: 1
-> the formula is TRUE

FORMULA ShieldRVt-PT-001A-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: [~ [EG [E [A [1<=p10 U p1<=0] U p2<=0]]] & [AX [[p3<=1 | p9<=p6]] & AG [p2<=p2]]]
normalized: [~ [EG [E [[~ [EG [~ [p1<=0]]] & ~ [E [~ [p1<=0] U [~ [1<=p10] & ~ [p1<=0]]]]] U p2<=0]]] & [~ [E [true U ~ [p2<=p2]]] & ~ [EX [~ [[p3<=1 | p9<=p6]]]]]]

abstracting: (p9<=p6)
states: 25
abstracting: (p3<=1)
states: 33
.abstracting: (p2<=p2)
states: 33
abstracting: (p2<=0)
states: 17
abstracting: (p1<=0)
states: 17
abstracting: (1<=p10)
states: 16
abstracting: (p1<=0)
states: 17
abstracting: (p1<=0)
states: 17
.
EG iterations: 1

EG iterations: 0
-> the formula is FALSE

FORMULA ShieldRVt-PT-001A-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: E [~ [[[[p6<=1 | 1<=p10] | ~ [E [1<=p2 U p1<=p3]]] | AF [[EG [p8<=p6] | AX [1<=p7]]]]] U EF [EX [p3<=1]]]
normalized: E [~ [[~ [EG [~ [[~ [EX [~ [1<=p7]]] | EG [p8<=p6]]]]] | [~ [E [1<=p2 U p1<=p3]] | [p6<=1 | 1<=p10]]]] U E [true U EX [p3<=1]]]

abstracting: (p3<=1)
states: 33
.abstracting: (1<=p10)
states: 16
abstracting: (p6<=1)
states: 33
abstracting: (p1<=p3)
states: 25
abstracting: (1<=p2)
states: 16
abstracting: (p8<=p6)
states: 25
.
EG iterations: 1
abstracting: (1<=p7)
states: 16
........
EG iterations: 7
-> the formula is TRUE

FORMULA ShieldRVt-PT-001A-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: A [p10<=0 U [~ [E [E [~ [1<=p2] U 1<=p4] U [AF [p7<=0] & 1<=p2]]] | ~ [[~ [AG [E [1<=p1 U p8<=p0]]] | p6<=p1]]]]
normalized: [~ [EG [~ [[~ [E [E [~ [1<=p2] U 1<=p4] U [~ [EG [~ [p7<=0]]] & 1<=p2]]] | ~ [[E [true U ~ [E [1<=p1 U p8<=p0]]] | p6<=p1]]]]]] & ~ [E [~ [[~ [E [E [~ [1<=p2] U 1<=p4] U [~ [EG [~ [p7<=0]]] & 1<=p2]]] | ~ [[E [true U ~ [E [1<=p1 U p8<=p0]]] | p6<=p1]]]] U [~ [[~ [E [E [~ [1<=p2] U 1<=p4] U [~ [EG [~ [p7<=0]]] & 1<=p2]]] | ~ [[E [true U ~ [E [1<=p1 U p8<=p0]]] | p6<=p1]]]] & ~ [p10<=0]]]]]

abstracting: (p10<=0)
states: 17
abstracting: (p6<=p1)
states: 25
abstracting: (p8<=p0)
states: 17
abstracting: (1<=p1)
states: 16
abstracting: (1<=p2)
states: 16
abstracting: (p7<=0)
states: 17
..........
EG iterations: 10
abstracting: (1<=p4)
states: 16
abstracting: (1<=p2)
states: 16
abstracting: (p6<=p1)
states: 25
abstracting: (p8<=p0)
states: 17
abstracting: (1<=p1)
states: 16
abstracting: (1<=p2)
states: 16
abstracting: (p7<=0)
states: 17
..........
EG iterations: 10
abstracting: (1<=p4)
states: 16
abstracting: (1<=p2)
states: 16
abstracting: (p6<=p1)
states: 25
abstracting: (p8<=p0)
states: 17
abstracting: (1<=p1)
states: 16
abstracting: (1<=p2)
states: 16
abstracting: (p7<=0)
states: 17
..........
EG iterations: 10
abstracting: (1<=p4)
states: 16
abstracting: (1<=p2)
states: 16

EG iterations: 0
-> the formula is FALSE

FORMULA ShieldRVt-PT-001A-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: ~ [A [[~ [1<=p2] | [E [p8<=p3 U 1<=p3] & [p2<=0 | p3<=1]]] U [[E [1<=p1 U p3<=p0] & EF [p8<=p0]] | p4<=0]]]
normalized: ~ [[~ [EG [~ [[[E [true U p8<=p0] & E [1<=p1 U p3<=p0]] | p4<=0]]]] & ~ [E [~ [[[E [true U p8<=p0] & E [1<=p1 U p3<=p0]] | p4<=0]] U [~ [[[[p2<=0 | p3<=1] & E [p8<=p3 U 1<=p3]] | ~ [1<=p2]]] & ~ [[[E [true U p8<=p0] & E [1<=p1 U p3<=p0]] | p4<=0]]]]]]]

abstracting: (p4<=0)
states: 17
abstracting: (p3<=p0)
states: 17
abstracting: (1<=p1)
states: 16
abstracting: (p8<=p0)
states: 17
abstracting: (1<=p2)
states: 16
abstracting: (1<=p3)
states: 16
abstracting: (p8<=p3)
states: 25
abstracting: (p3<=1)
states: 33
abstracting: (p2<=0)
states: 17
abstracting: (p4<=0)
states: 17
abstracting: (p3<=p0)
states: 17
abstracting: (1<=p1)
states: 16
abstracting: (p8<=p0)
states: 17
abstracting: (p4<=0)
states: 17
abstracting: (p3<=p0)
states: 17
abstracting: (1<=p1)
states: 16
abstracting: (p8<=p0)
states: 17
.
EG iterations: 1
-> the formula is FALSE

FORMULA ShieldRVt-PT-001A-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: [~ [A [[AG [[[1<=p3 & p0<=p1] | [p2<=p4 | p10<=0]]] & p3<=1] U [~ [EG [~ [p10<=p5]]] | p10<=1]]] & ~ [EF [EF [AG [E [p10<=p7 U p2<=0]]]]]]
normalized: [~ [[~ [EG [~ [[~ [EG [~ [p10<=p5]]] | p10<=1]]]] & ~ [E [~ [[~ [EG [~ [p10<=p5]]] | p10<=1]] U [~ [[~ [EG [~ [p10<=p5]]] | p10<=1]] & ~ [[~ [E [true U ~ [[[p2<=p4 | p10<=0] | [1<=p3 & p0<=p1]]]]] & p3<=1]]]]]]] & ~ [E [true U E [true U ~ [E [true U ~ [E [p10<=p7 U p2<=0]]]]]]]]

abstracting: (p2<=0)
states: 17
abstracting: (p10<=p7)
states: 25
abstracting: (p3<=1)
states: 33
abstracting: (p0<=p1)
states: 32
abstracting: (1<=p3)
states: 16
abstracting: (p10<=0)
states: 17
abstracting: (p2<=p4)
states: 25
abstracting: (p10<=1)
states: 33
abstracting: (p10<=p5)
states: 25
....
EG iterations: 4
abstracting: (p10<=1)
states: 33
abstracting: (p10<=p5)
states: 25
....
EG iterations: 4
abstracting: (p10<=1)
states: 33
abstracting: (p10<=p5)
states: 25
....
EG iterations: 4
.
EG iterations: 1
-> the formula is FALSE

FORMULA ShieldRVt-PT-001A-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: A [p10<=p5 U [~ [[~ [AF [[1<=p7 | p5<=1]]] & EG [[1<=p0 | ~ [p9<=1]]]]] & [~ [[~ [[[1<=p4 | 1<=p0] & E [p10<=p0 U p2<=0]]] & p0<=p3]] & ~ [AG [p4<=p0]]]]]
normalized: [~ [EG [~ [[[E [true U ~ [p4<=p0]] & ~ [[~ [[E [p10<=p0 U p2<=0] & [1<=p4 | 1<=p0]]] & p0<=p3]]] & ~ [[EG [[~ [p9<=1] | 1<=p0]] & EG [~ [[1<=p7 | p5<=1]]]]]]]]] & ~ [E [~ [[[E [true U ~ [p4<=p0]] & ~ [[~ [[E [p10<=p0 U p2<=0] & [1<=p4 | 1<=p0]]] & p0<=p3]]] & ~ [[EG [[~ [p9<=1] | 1<=p0]] & EG [~ [[1<=p7 | p5<=1]]]]]]] U [~ [p10<=p5] & ~ [[[E [true U ~ [p4<=p0]] & ~ [[~ [[E [p10<=p0 U p2<=0] & [1<=p4 | 1<=p0]]] & p0<=p3]]] & ~ [[EG [[~ [p9<=1] | 1<=p0]] & EG [~ [[1<=p7 | p5<=1]]]]]]]]]]]

abstracting: (p5<=1)
states: 33
abstracting: (1<=p7)
states: 16
.
EG iterations: 1
abstracting: (1<=p0)
states: 1
abstracting: (p9<=1)
states: 33
..
EG iterations: 2
abstracting: (p0<=p3)
states: 32
abstracting: (1<=p0)
states: 1
abstracting: (1<=p4)
states: 16
abstracting: (p2<=0)
states: 17
abstracting: (p10<=p0)
states: 17
abstracting: (p4<=p0)
states: 17
abstracting: (p10<=p5)
states: 25
abstracting: (p5<=1)
states: 33
abstracting: (1<=p7)
states: 16
.
EG iterations: 1
abstracting: (1<=p0)
states: 1
abstracting: (p9<=1)
states: 33
..
EG iterations: 2
abstracting: (p0<=p3)
states: 32
abstracting: (1<=p0)
states: 1
abstracting: (1<=p4)
states: 16
abstracting: (p2<=0)
states: 17
abstracting: (p10<=p0)
states: 17
abstracting: (p4<=p0)
states: 17
abstracting: (p5<=1)
states: 33
abstracting: (1<=p7)
states: 16
.
EG iterations: 1
abstracting: (1<=p0)
states: 1
abstracting: (p9<=1)
states: 33
..
EG iterations: 2
abstracting: (p0<=p3)
states: 32
abstracting: (1<=p0)
states: 1
abstracting: (1<=p4)
states: 16
abstracting: (p2<=0)
states: 17
abstracting: (p10<=p0)
states: 17
abstracting: (p4<=p0)
states: 17
.
EG iterations: 1
-> the formula is TRUE

FORMULA ShieldRVt-PT-001A-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: [AF [AG [AG [~ [[p7<=0 | p7<=p4]]]]] & EF [[[[[[EF [p9<=p7] & EG [1<=p1]] & p2<=p4] | EF [A [1<=p9 U 1<=p7]]] | [1<=p3 & ~ [[AF [p4<=p3] | AG [p5<=p7]]]]] & A [~ [[p1<=p3 | p6<=p10]] U 1<=p6]]]]
normalized: [~ [EG [E [true U E [true U [p7<=0 | p7<=p4]]]]] & E [true U [[[~ [[~ [EG [~ [p4<=p3]]] | ~ [E [true U ~ [p5<=p7]]]]] & 1<=p3] | [E [true U [~ [EG [~ [1<=p7]]] & ~ [E [~ [1<=p7] U [~ [1<=p9] & ~ [1<=p7]]]]]] | [[EG [1<=p1] & E [true U p9<=p7]] & p2<=p4]]] & [~ [EG [~ [1<=p6]]] & ~ [E [~ [1<=p6] U [[p1<=p3 | p6<=p10] & ~ [1<=p6]]]]]]]]

abstracting: (1<=p6)
states: 16
abstracting: (p6<=p10)
states: 25
abstracting: (p1<=p3)
states: 25
abstracting: (1<=p6)
states: 16
abstracting: (1<=p6)
states: 16
..
EG iterations: 2
abstracting: (p2<=p4)
states: 25
abstracting: (p9<=p7)
states: 25
abstracting: (1<=p1)
states: 16
.
EG iterations: 1
abstracting: (1<=p7)
states: 16
abstracting: (1<=p9)
states: 16
abstracting: (1<=p7)
states: 16
abstracting: (1<=p7)
states: 16
..........
EG iterations: 10
abstracting: (1<=p3)
states: 16
abstracting: (p5<=p7)
states: 25
abstracting: (p4<=p3)
states: 17
.
EG iterations: 1
abstracting: (p7<=p4)
states: 25
abstracting: (p7<=0)
states: 17

EG iterations: 0
-> the formula is FALSE

FORMULA ShieldRVt-PT-001A-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: ~ [[[E [[~ [p1<=p8] & ~ [EF [p0<=0]]] U [AX [[p3<=0 & p8<=0]] & [EX [p7<=1] & p10<=p6]]] | AF [[AG [A [p9<=0 U p2<=p6]] | [[[1<=p8 | 1<=p10] | [p3<=1 | 1<=p4]] & EF [p3<=0]]]]] & A [EX [p0<=1] U [1<=p9 | AF [[~ [p9<=p5] & AG [p4<=1]]]]]]]
normalized: ~ [[[E [[~ [E [true U p0<=0]] & ~ [p1<=p8]] U [~ [EX [~ [[p3<=0 & p8<=0]]]] & [p10<=p6 & EX [p7<=1]]]] | ~ [EG [~ [[[E [true U p3<=0] & [[p3<=1 | 1<=p4] | [1<=p8 | 1<=p10]]] | ~ [E [true U ~ [[~ [EG [~ [p2<=p6]]] & ~ [E [~ [p2<=p6] U [~ [p9<=0] & ~ [p2<=p6]]]]]]]]]]]]] & [~ [EG [~ [[~ [EG [~ [[~ [E [true U ~ [p4<=1]]] & ~ [p9<=p5]]]]] | 1<=p9]]]] & ~ [E [~ [[~ [EG [~ [[~ [E [true U ~ [p4<=1]]] & ~ [p9<=p5]]]]] | 1<=p9]] U [~ [EX [p0<=1]] & ~ [[~ [EG [~ [[~ [E [true U ~ [p4<=1]]] & ~ [p9<=p5]]]]] | 1<=p9]]]]]]]]

abstracting: (1<=p9)
states: 16
abstracting: (p9<=p5)
states: 25
abstracting: (p4<=1)
states: 33
....
EG iterations: 4
abstracting: (p0<=1)
states: 33
.abstracting: (1<=p9)
states: 16
abstracting: (p9<=p5)
states: 25
abstracting: (p4<=1)
states: 33
....
EG iterations: 4
abstracting: (1<=p9)
states: 16
abstracting: (p9<=p5)
states: 25
abstracting: (p4<=1)
states: 33
....
EG iterations: 4
....
EG iterations: 4
abstracting: (p2<=p6)
states: 25
abstracting: (p9<=0)
states: 17
abstracting: (p2<=p6)
states: 25
abstracting: (p2<=p6)
states: 25
.
EG iterations: 1
abstracting: (1<=p10)
states: 16
abstracting: (1<=p8)
states: 16
abstracting: (1<=p4)
states: 16
abstracting: (p3<=1)
states: 33
abstracting: (p3<=0)
states: 17
.
EG iterations: 1
abstracting: (p7<=1)
states: 33
.abstracting: (p10<=p6)
states: 25
abstracting: (p8<=0)
states: 17
abstracting: (p3<=0)
states: 17
.abstracting: (p1<=p8)
states: 25
abstracting: (p0<=0)
states: 32
-> the formula is FALSE

FORMULA ShieldRVt-PT-001A-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AF [A [EG [[~ [A [1<=p10 U p7<=0]] | [[1<=p7 & 1<=p10] | [1<=p0 & p10<=1]]]] U [[E [p1<=p8 U [p9<=1 & p7<=p5]] & [[[p0<=p10 & p2<=0] & AG [p8<=0]] | [~ [p2<=p10] | ~ [p2<=0]]]] & [~ [[1<=p0 | 1<=p2]] | [p1<=p9 & AG [p10<=0]]]]]]
normalized: ~ [EG [~ [[~ [EG [~ [[[[~ [E [true U ~ [p10<=0]]] & p1<=p9] | ~ [[1<=p0 | 1<=p2]]] & [[[~ [p2<=0] | ~ [p2<=p10]] | [~ [E [true U ~ [p8<=0]]] & [p0<=p10 & p2<=0]]] & E [p1<=p8 U [p9<=1 & p7<=p5]]]]]]] & ~ [E [~ [[[[~ [E [true U ~ [p10<=0]]] & p1<=p9] | ~ [[1<=p0 | 1<=p2]]] & [[[~ [p2<=0] | ~ [p2<=p10]] | [~ [E [true U ~ [p8<=0]]] & [p0<=p10 & p2<=0]]] & E [p1<=p8 U [p9<=1 & p7<=p5]]]]] U [~ [EG [[[[1<=p0 & p10<=1] | [1<=p7 & 1<=p10]] | ~ [[~ [EG [~ [p7<=0]]] & ~ [E [~ [p7<=0] U [~ [1<=p10] & ~ [p7<=0]]]]]]]]] & ~ [[[[~ [E [true U ~ [p10<=0]]] & p1<=p9] | ~ [[1<=p0 | 1<=p2]]] & [[[~ [p2<=0] | ~ [p2<=p10]] | [~ [E [true U ~ [p8<=0]]] & [p0<=p10 & p2<=0]]] & E [p1<=p8 U [p9<=1 & p7<=p5]]]]]]]]]]]]

abstracting: (p7<=p5)
states: 25
abstracting: (p9<=1)
states: 33
abstracting: (p1<=p8)
states: 25
abstracting: (p2<=0)
states: 17
abstracting: (p0<=p10)
states: 32
abstracting: (p8<=0)
states: 17
abstracting: (p2<=p10)
states: 25
abstracting: (p2<=0)
states: 17
abstracting: (1<=p2)
states: 16
abstracting: (1<=p0)
states: 1
abstracting: (p1<=p9)
states: 25
abstracting: (p10<=0)
states: 17
abstracting: (p7<=0)
states: 17
abstracting: (1<=p10)
states: 16
abstracting: (p7<=0)
states: 17
abstracting: (p7<=0)
states: 17
..........
EG iterations: 10
abstracting: (1<=p10)
states: 16
abstracting: (1<=p7)
states: 16
abstracting: (p10<=1)
states: 33
abstracting: (1<=p0)
states: 1
..........
EG iterations: 10
abstracting: (p7<=p5)
states: 25
abstracting: (p9<=1)
states: 33
abstracting: (p1<=p8)
states: 25
abstracting: (p2<=0)
states: 17
abstracting: (p0<=p10)
states: 32
abstracting: (p8<=0)
states: 17
abstracting: (p2<=p10)
states: 25
abstracting: (p2<=0)
states: 17
abstracting: (1<=p2)
states: 16
abstracting: (1<=p0)
states: 1
abstracting: (p1<=p9)
states: 25
abstracting: (p10<=0)
states: 17
abstracting: (p7<=p5)
states: 25
abstracting: (p9<=1)
states: 33
abstracting: (p1<=p8)
states: 25
abstracting: (p2<=0)
states: 17
abstracting: (p0<=p10)
states: 32
abstracting: (p8<=0)
states: 17
abstracting: (p2<=p10)
states: 25
abstracting: (p2<=0)
states: 17
abstracting: (1<=p2)
states: 16
abstracting: (1<=p0)
states: 1
abstracting: (p1<=p9)
states: 25
abstracting: (p10<=0)
states: 17

EG iterations: 0

EG iterations: 0
-> the formula is FALSE

FORMULA ShieldRVt-PT-001A-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: E [p9<=p10 U [AF [[A [p3<=p2 U [1<=p10 & p6<=p1]] | E [~ [1<=p2] U E [p6<=0 U 1<=p7]]]] | [[EX [[[1<=p7 | 1<=p7] & [1<=p5 & p9<=p0]]] | EG [EF [p5<=1]]] & ~ [[[[[p7<=1 | p5<=p8] | [p9<=p2 | 1<=p2]] | [AX [p0<=p10] | AG [p0<=p4]]] | A [~ [p1<=1] U ~ [1<=p0]]]]]]]
normalized: E [p9<=p10 U [[~ [[[~ [EG [1<=p0]] & ~ [E [1<=p0 U [p1<=1 & 1<=p0]]]] | [[~ [E [true U ~ [p0<=p4]]] | ~ [EX [~ [p0<=p10]]]] | [[p9<=p2 | 1<=p2] | [p7<=1 | p5<=p8]]]]] & [EG [E [true U p5<=1]] | EX [[[1<=p5 & p9<=p0] & [1<=p7 | 1<=p7]]]]] | ~ [EG [~ [[E [~ [1<=p2] U E [p6<=0 U 1<=p7]] | [~ [EG [~ [[1<=p10 & p6<=p1]]]] & ~ [E [~ [[1<=p10 & p6<=p1]] U [~ [p3<=p2] & ~ [[1<=p10 & p6<=p1]]]]]]]]]]]]

abstracting: (p6<=p1)
states: 25
abstracting: (1<=p10)
states: 16
abstracting: (p3<=p2)
states: 25
abstracting: (p6<=p1)
states: 25
abstracting: (1<=p10)
states: 16
abstracting: (p6<=p1)
states: 25
abstracting: (1<=p10)
states: 16
...
EG iterations: 3
abstracting: (1<=p7)
states: 16
abstracting: (p6<=0)
states: 17
abstracting: (1<=p2)
states: 16
....
EG iterations: 4
abstracting: (1<=p7)
states: 16
abstracting: (1<=p7)
states: 16
abstracting: (p9<=p0)
states: 17
abstracting: (1<=p5)
states: 16
.abstracting: (p5<=1)
states: 33

EG iterations: 0
abstracting: (p5<=p8)
states: 25
abstracting: (p7<=1)
states: 33
abstracting: (1<=p2)
states: 16
abstracting: (p9<=p2)
states: 25
abstracting: (p0<=p10)
states: 32
.abstracting: (p0<=p4)
states: 32
abstracting: (1<=p0)
states: 1
abstracting: (p1<=1)
states: 33
abstracting: (1<=p0)
states: 1
abstracting: (1<=p0)
states: 1
..
EG iterations: 2
abstracting: (p9<=p10)
states: 17
-> the formula is TRUE

FORMULA ShieldRVt-PT-001A-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

totally nodes used: 1508 (1.5e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 3148 4835 7983
used/not used/entry size/cache size: 5855 67103009 16 1024MB
basic ops cache: hits/miss/sum: 2035 2675 4710
used/not used/entry size/cache size: 4954 16772262 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 334 203 537
used/not used/entry size/cache size: 203 8388405 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 67107369
1 1482
2 13
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 5.628sec


BK_STOP 1679068861887

--------------------
content from stderr:

check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec


iterations count:56 (5), effective:16 (1)

initing FirstDep: 0m 0.000sec


iterations count:15 (1), effective:1 (0)

iterations count:24 (2), effective:4 (0)

iterations count:19 (1), effective:4 (0)

iterations count:21 (1), effective:2 (0)

iterations count:11 (1), effective:0 (0)

iterations count:11 (1), effective:0 (0)

iterations count:11 (1), effective:0 (0)

iterations count:20 (1), effective:2 (0)

iterations count:11 (1), effective:0 (0)

iterations count:36 (3), effective:7 (0)

iterations count:16 (1), effective:2 (0)

iterations count:25 (2), effective:3 (0)

iterations count:11 (1), effective:0 (0)

iterations count:11 (1), effective:0 (0)

iterations count:11 (1), effective:0 (0)

iterations count:16 (1), effective:2 (0)

iterations count:26 (2), effective:5 (0)

iterations count:22 (2), effective:2 (0)

iterations count:24 (2), effective:4 (0)

iterations count:16 (1), effective:2 (0)

iterations count:26 (2), effective:5 (0)

iterations count:22 (2), effective:2 (0)

iterations count:24 (2), effective:4 (0)

iterations count:20 (1), effective:2 (0)

iterations count:16 (1), effective:2 (0)

iterations count:26 (2), effective:5 (0)

iterations count:22 (2), effective:2 (0)

iterations count:24 (2), effective:4 (0)

iterations count:15 (1), effective:1 (0)

iterations count:16 (1), effective:2 (0)

iterations count:21 (1), effective:2 (0)

iterations count:15 (1), effective:1 (0)

iterations count:16 (1), effective:2 (0)

iterations count:15 (1), effective:1 (0)

iterations count:16 (1), effective:2 (0)

iterations count:38 (3), effective:5 (0)

iterations count:31 (2), effective:7 (0)

iterations count:11 (1), effective:0 (0)

iterations count:22 (2), effective:2 (0)

iterations count:11 (1), effective:0 (0)

iterations count:22 (2), effective:2 (0)

iterations count:15 (1), effective:2 (0)

iterations count:11 (1), effective:0 (0)

iterations count:22 (2), effective:2 (0)

iterations count:11 (1), effective:0 (0)

iterations count:13 (1), effective:1 (0)

iterations count:13 (1), effective:1 (0)

iterations count:23 (2), effective:3 (0)

iterations count:30 (2), effective:7 (0)

iterations count:20 (1), effective:2 (0)

iterations count:14 (1), effective:2 (0)

iterations count:11 (1), effective:0 (0)

iterations count:16 (1), effective:2 (0)

iterations count:33 (3), effective:8 (0)

iterations count:15 (1), effective:1 (0)

iterations count:18 (1), effective:1 (0)

iterations count:11 (1), effective:0 (0)

iterations count:13 (1), effective:1 (0)

iterations count:21 (1), effective:3 (0)

iterations count:20 (1), effective:2 (0)

iterations count:23 (2), effective:2 (0)

iterations count:13 (1), effective:1 (0)

iterations count:21 (1), effective:3 (0)

iterations count:20 (1), effective:2 (0)

iterations count:11 (1), effective:0 (0)

iterations count:13 (1), effective:1 (0)

iterations count:21 (1), effective:3 (0)

iterations count:20 (1), effective:2 (0)

iterations count:37 (3), effective:6 (0)

iterations count:16 (1), effective:2 (0)

iterations count:23 (2), effective:3 (0)

iterations count:11 (1), effective:0 (0)

iterations count:11 (1), effective:0 (0)

iterations count:11 (1), effective:0 (0)

iterations count:11 (1), effective:0 (0)

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="ShieldRVt-PT-001A"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marcie"
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-5348"
echo " Executing tool marcie"
echo " Input is ShieldRVt-PT-001A, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r417-tajo-167905971900177"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-001A.tgz
mv ShieldRVt-PT-001A 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 ;