Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r321-tall-167889192000297.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marcie
Input is Raft-PT-03, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r321-tall-167889192000297
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 5.3K Feb 26 17:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 26 17:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 17:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 17:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Feb 25 16:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 17:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Feb 26 17:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Feb 26 17:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Feb 26 17:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 16:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 24K 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 Raft-PT-03-CTLCardinality-00
FORMULA_NAME Raft-PT-03-CTLCardinality-01
FORMULA_NAME Raft-PT-03-CTLCardinality-02
FORMULA_NAME Raft-PT-03-CTLCardinality-03
FORMULA_NAME Raft-PT-03-CTLCardinality-04
FORMULA_NAME Raft-PT-03-CTLCardinality-05
FORMULA_NAME Raft-PT-03-CTLCardinality-06
FORMULA_NAME Raft-PT-03-CTLCardinality-07
FORMULA_NAME Raft-PT-03-CTLCardinality-08
FORMULA_NAME Raft-PT-03-CTLCardinality-09
FORMULA_NAME Raft-PT-03-CTLCardinality-10
FORMULA_NAME Raft-PT-03-CTLCardinality-11
FORMULA_NAME Raft-PT-03-CTLCardinality-12
FORMULA_NAME Raft-PT-03-CTLCardinality-13
FORMULA_NAME Raft-PT-03-CTLCardinality-14
FORMULA_NAME Raft-PT-03-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678927227655

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=Raft-PT-03
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: Raft_PT_03
(NrP: 53 NrTr: 98 NrArc: 328)

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

net check time: 0m 0.000sec

init dd package: 0m 2.891sec


RS generation: 0m 0.130sec


-> reachability set: #nodes 622 (6.2e+02) #states 33,819,621 (7)



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

checking: ~ [AX [AG [AX [EF [p42<=1]]]]]
normalized: EX [E [true U EX [~ [E [true U p42<=1]]]]]

abstracting: (p42<=1)
states: 33,819,621 (7)
..-> the formula is FALSE

FORMULA Raft-PT-03-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: EF [AG [[AG [1<=p16] | p7<=0]]]
normalized: E [true U ~ [E [true U ~ [[p7<=0 | ~ [E [true U ~ [1<=p16]]]]]]]]

abstracting: (1<=p16)
states: 6,501,780 (6)
abstracting: (p7<=0)
states: 27,317,841 (7)
-> the formula is FALSE

FORMULA Raft-PT-03-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.028sec

checking: AG [~ [EX [~ [[EX [p22<=1] | [1<=p15 | p34<=1]]]]]]
normalized: ~ [E [true U EX [~ [[[1<=p15 | p34<=1] | EX [p22<=1]]]]]]

abstracting: (p22<=1)
states: 33,819,621 (7)
.abstracting: (p34<=1)
states: 33,819,621 (7)
abstracting: (1<=p15)
states: 7,812,500 (6)
.-> the formula is TRUE

FORMULA Raft-PT-03-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

checking: [~ [EX [~ [AG [p38<=1]]]] & A [1<=p19 U EF [p10<=1]]]
normalized: [[~ [EG [~ [E [true U p10<=1]]]] & ~ [E [~ [E [true U p10<=1]] U [~ [1<=p19] & ~ [E [true U p10<=1]]]]]] & ~ [EX [E [true U ~ [p38<=1]]]]]

abstracting: (p38<=1)
states: 33,819,621 (7)
.abstracting: (p10<=1)
states: 33,819,621 (7)
abstracting: (1<=p19)
states: 6,501,780 (6)
abstracting: (p10<=1)
states: 33,819,621 (7)
abstracting: (p10<=1)
states: 33,819,621 (7)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Raft-PT-03-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AG [[~ [AX [p46<=p32]] | 1<=p49]]
normalized: ~ [E [true U ~ [[1<=p49 | EX [~ [p46<=p32]]]]]]

abstracting: (p46<=p32)
states: 28,356,053 (7)
.abstracting: (1<=p49)
states: 6,763,924 (6)
-> the formula is FALSE

FORMULA Raft-PT-03-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.043sec

checking: EF [~ [AG [EG [[[p14<=1 | p31<=p51] | ~ [p44<=1]]]]]]
normalized: E [true U E [true U ~ [EG [[~ [p44<=1] | [p14<=1 | p31<=p51]]]]]]

abstracting: (p31<=p51)
states: 28,943,286 (7)
abstracting: (p14<=1)
states: 33,819,621 (7)
abstracting: (p44<=1)
states: 33,819,621 (7)

EG iterations: 0
-> the formula is FALSE

FORMULA Raft-PT-03-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [EX [[p10<=1 | [~ [E [1<=p16 U 1<=p29]] & ~ [EG [p19<=1]]]]]]
normalized: ~ [E [true U ~ [EX [[p10<=1 | [~ [EG [p19<=1]] & ~ [E [1<=p16 U 1<=p29]]]]]]]]

abstracting: (1<=p29)
states: 6,501,780 (6)
abstracting: (1<=p16)
states: 6,501,780 (6)
abstracting: (p19<=1)
states: 33,819,621 (7)

EG iterations: 0
abstracting: (p10<=1)
states: 33,819,621 (7)
.-> the formula is TRUE

FORMULA Raft-PT-03-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: AG [E [E [AG [EX [1<=p1]] U EG [[p15<=p41 | p8<=0]]] U EG [AG [A [1<=p18 U p13<=1]]]]]
normalized: ~ [E [true U ~ [E [E [~ [E [true U ~ [EX [1<=p1]]]] U EG [[p15<=p41 | p8<=0]]] U EG [~ [E [true U ~ [[~ [EG [~ [p13<=1]]] & ~ [E [~ [p13<=1] U [~ [1<=p18] & ~ [p13<=1]]]]]]]]]]]]]

abstracting: (p13<=1)
states: 33,819,621 (7)
abstracting: (1<=p18)
states: 6,501,780 (6)
abstracting: (p13<=1)
states: 33,819,621 (7)
abstracting: (p13<=1)
states: 33,819,621 (7)
.
EG iterations: 1

EG iterations: 0
abstracting: (p8<=0)
states: 27,317,841 (7)
abstracting: (p15<=p41)
states: 27,569,621 (7)
.
EG iterations: 1
abstracting: (1<=p1)
states: 6,501,780 (6)
.-> the formula is TRUE

FORMULA Raft-PT-03-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.029sec

checking: AF [[~ [p14<=p30] | A [EF [[AX [1<=p44] & [p35<=0 & p47<=p21]]] U 1<=p6]]]
normalized: ~ [EG [~ [[[~ [EG [~ [1<=p6]]] & ~ [E [~ [1<=p6] U [~ [E [true U [[p35<=0 & p47<=p21] & ~ [EX [~ [1<=p44]]]]]] & ~ [1<=p6]]]]] | ~ [p14<=p30]]]]]

abstracting: (p14<=p30)
states: 28,880,341 (7)
abstracting: (1<=p6)
states: 6,501,780 (6)
abstracting: (1<=p44)
states: 6,501,780 (6)
.abstracting: (p47<=p21)
states: 28,356,053 (7)
abstracting: (p35<=0)
states: 26,007,121 (7)
abstracting: (1<=p6)
states: 6,501,780 (6)
abstracting: (1<=p6)
states: 6,501,780 (6)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA Raft-PT-03-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.015sec

checking: EF [EG [[AG [[AG [p30<=1] & EF [1<=p41]]] & ~ [[EF [1<=p43] | [E [p37<=1 U p42<=0] & E [p29<=p41 U p7<=0]]]]]]]
normalized: E [true U EG [[~ [[[E [p29<=p41 U p7<=0] & E [p37<=1 U p42<=0]] | E [true U 1<=p43]]] & ~ [E [true U ~ [[E [true U 1<=p41] & ~ [E [true U ~ [p30<=1]]]]]]]]]]

abstracting: (p30<=1)
states: 33,819,621 (7)
abstracting: (1<=p41)
states: 6,501,780 (6)
abstracting: (1<=p43)
states: 6,501,780 (6)
abstracting: (p42<=0)
states: 27,317,841 (7)
abstracting: (p37<=1)
states: 33,819,621 (7)
abstracting: (p7<=0)
states: 27,317,841 (7)
abstracting: (p29<=p41)
states: 28,552,661 (7)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Raft-PT-03-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.058sec

checking: ~ [EF [E [[1<=p17 | EF [[p43<=p15 & 1<=p15]]] U AG [[E [1<=p9 U p25<=p28] | AG [p9<=1]]]]]]
normalized: ~ [E [true U E [[1<=p17 | E [true U [p43<=p15 & 1<=p15]]] U ~ [E [true U ~ [[~ [E [true U ~ [p9<=1]]] | E [1<=p9 U p25<=p28]]]]]]]]

abstracting: (p25<=p28)
states: 27,569,621 (7)
abstracting: (1<=p9)
states: 6,501,780 (6)
abstracting: (p9<=1)
states: 33,819,621 (7)
abstracting: (1<=p15)
states: 7,812,500 (6)
abstracting: (p43<=p15)
states: 28,880,341 (7)
abstracting: (1<=p17)
states: 6,501,780 (6)
-> the formula is FALSE

FORMULA Raft-PT-03-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.025sec

checking: [AX [[EF [1<=p17] & EG [EX [[1<=p3 & p22<=0]]]]] & ~ [EG [E [E [[p38<=1 | 1<=p36] U 1<=p43] U AG [p25<=p50]]]]]
normalized: [~ [EG [E [E [[p38<=1 | 1<=p36] U 1<=p43] U ~ [E [true U ~ [p25<=p50]]]]]] & ~ [EX [~ [[EG [EX [[1<=p3 & p22<=0]]] & E [true U 1<=p17]]]]]]

abstracting: (1<=p17)
states: 6,501,780 (6)
abstracting: (p22<=0)
states: 27,317,841 (7)
abstracting: (1<=p3)
states: 6,501,780 (6)
..
EG iterations: 1
.abstracting: (p25<=p50)
states: 27,960,246 (7)
abstracting: (1<=p43)
states: 6,501,780 (6)
abstracting: (1<=p36)
states: 6,501,780 (6)
abstracting: (p38<=1)
states: 33,819,621 (7)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Raft-PT-03-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.047sec

checking: [AF [[[p2<=0 | ~ [E [p9<=1 U 1<=p42]]] | [~ [[1<=p9 & AX [p17<=p8]]] & EG [[1<=p31 & ~ [p29<=p3]]]]]] & EG [EF [AG [1<=p33]]]]
normalized: [EG [E [true U ~ [E [true U ~ [1<=p33]]]]] & ~ [EG [~ [[[EG [[1<=p31 & ~ [p29<=p3]]] & ~ [[1<=p9 & ~ [EX [~ [p17<=p8]]]]]] | [p2<=0 | ~ [E [p9<=1 U 1<=p42]]]]]]]]

abstracting: (1<=p42)
states: 6,501,780 (6)
abstracting: (p9<=1)
states: 33,819,621 (7)
abstracting: (p2<=0)
states: 27,317,841 (7)
abstracting: (p17<=p8)
states: 28,552,661 (7)
.abstracting: (1<=p9)
states: 6,501,780 (6)
abstracting: (p29<=p3)
states: 28,552,661 (7)
abstracting: (1<=p31)
states: 6,501,780 (6)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p33)
states: 6,501,780 (6)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Raft-PT-03-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.049sec

checking: AF [[[AX [AG [E [p14<=p8 U p44<=p38]]] | p5<=p15] & ~ [AG [[~ [p48<=1] & [EX [p2<=p17] | AX [p45<=1]]]]]]]
normalized: ~ [EG [~ [[[~ [EX [E [true U ~ [E [p14<=p8 U p44<=p38]]]]] | p5<=p15] & E [true U ~ [[[~ [EX [~ [p45<=1]]] | EX [p2<=p17]] & ~ [p48<=1]]]]]]]]

abstracting: (p48<=1)
states: 33,819,621 (7)
abstracting: (p2<=p17)
states: 28,552,661 (7)
.abstracting: (p45<=1)
states: 33,819,621 (7)
.abstracting: (p5<=p15)
states: 27,569,621 (7)
abstracting: (p44<=p38)
states: 28,552,661 (7)
abstracting: (p14<=p8)
states: 28,552,661 (7)
..
EG iterations: 1
-> the formula is TRUE

FORMULA Raft-PT-03-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.048sec

checking: AG [[[[[p26<=p14 | EF [EF [1<=p23]]] & p26<=p46] | [p19<=0 | EF [EX [p35<=0]]]] & ~ [E [[p21<=0 | [p11<=p4 & 1<=p33]] U AX [AX [1<=p42]]]]]]
normalized: ~ [E [true U ~ [[~ [E [[p21<=0 | [p11<=p4 & 1<=p33]] U ~ [EX [EX [~ [1<=p42]]]]]] & [[p19<=0 | E [true U EX [p35<=0]]] | [p26<=p46 & [p26<=p14 | E [true U E [true U 1<=p23]]]]]]]]]

abstracting: (1<=p23)
states: 6,501,780 (6)
abstracting: (p26<=p14)
states: 28,552,661 (7)
abstracting: (p26<=p46)
states: 28,618,197 (7)
abstracting: (p35<=0)
states: 26,007,121 (7)
.abstracting: (p19<=0)
states: 27,317,841 (7)
abstracting: (1<=p42)
states: 6,501,780 (6)
..abstracting: (1<=p33)
states: 6,501,780 (6)
abstracting: (p11<=p4)
states: 28,552,661 (7)
abstracting: (p21<=0)
states: 27,317,841 (7)
-> the formula is TRUE

FORMULA Raft-PT-03-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.028sec

checking: A [[E [[[EF [1<=p45] & [EF [p23<=p52] | EX [p18<=p42]]] | [[[1<=p10 & 1<=p52] | 1<=p51] | [AF [p42<=p5] & [p35<=0 | 1<=p13]]]] U ~ [[~ [AX [p9<=1]] & [AF [p30<=p21] | AX [1<=p4]]]]] | p11<=0] U [~ [EX [EG [[p28<=0 & 1<=p42]]]] | ~ [p26<=1]]]
normalized: [~ [EG [~ [[~ [p26<=1] | ~ [EX [EG [[p28<=0 & 1<=p42]]]]]]]] & ~ [E [~ [[~ [p26<=1] | ~ [EX [EG [[p28<=0 & 1<=p42]]]]]] U [~ [[p11<=0 | E [[[[[p35<=0 | 1<=p13] & ~ [EG [~ [p42<=p5]]]] | [1<=p51 | [1<=p10 & 1<=p52]]] | [[EX [p18<=p42] | E [true U p23<=p52]] & E [true U 1<=p45]]] U ~ [[[~ [EX [~ [1<=p4]]] | ~ [EG [~ [p30<=p21]]]] & EX [~ [p9<=1]]]]]]] & ~ [[~ [p26<=1] | ~ [EX [EG [[p28<=0 & 1<=p42]]]]]]]]]]

abstracting: (1<=p42)
states: 6,501,780 (6)
abstracting: (p28<=0)
states: 27,317,841 (7)
.
EG iterations: 1
.abstracting: (p26<=1)
states: 33,819,621 (7)
abstracting: (p9<=1)
states: 33,819,621 (7)
.abstracting: (p30<=p21)
states: 27,569,621 (7)
.
EG iterations: 1
abstracting: (1<=p4)
states: 6,501,780 (6)
.abstracting: (1<=p45)
states: 7,812,500 (6)
abstracting: (p23<=p52)
states: 28,943,286 (7)
abstracting: (p18<=p42)
states: 28,552,661 (7)
.abstracting: (1<=p52)
states: 8,454,905 (6)
abstracting: (1<=p10)
states: 7,812,500 (6)
abstracting: (1<=p51)
states: 8,454,905 (6)
abstracting: (p42<=p5)
states: 28,880,341 (7)
.
EG iterations: 1
abstracting: (1<=p13)
states: 6,501,780 (6)
abstracting: (p35<=0)
states: 26,007,121 (7)
abstracting: (p11<=0)
states: 27,317,841 (7)
abstracting: (1<=p42)
states: 6,501,780 (6)
abstracting: (p28<=0)
states: 27,317,841 (7)
.
EG iterations: 1
.abstracting: (p26<=1)
states: 33,819,621 (7)
abstracting: (1<=p42)
states: 6,501,780 (6)
abstracting: (p28<=0)
states: 27,317,841 (7)
.
EG iterations: 1
.abstracting: (p26<=1)
states: 33,819,621 (7)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Raft-PT-03-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.036sec

totally nodes used: 267749 (2.7e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 693987 1600022 2294009
used/not used/entry size/cache size: 1786332 65322532 16 1024MB
basic ops cache: hits/miss/sum: 95903 180726 276629
used/not used/entry size/cache size: 338493 16438723 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: 5749 12305 18054
used/not used/entry size/cache size: 12302 8376306 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 66856540
1 238340
2 12659
3 1216
4 102
5 7
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 5.143sec


BK_STOP 1678927233074

--------------------
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:21300 (217), effective:895 (9)

initing FirstDep: 0m 0.000sec


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

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

iterations count:830 (8), effective:19 (0)

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

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

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

iterations count:722 (7), effective:38 (0)

iterations count:714 (7), effective:20 (0)

iterations count:240 (2), effective:6 (0)

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

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

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

iterations count:1183 (12), effective:27 (0)

iterations count:1283 (13), effective:34 (0)

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

iterations count:448 (4), effective:10 (0)

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

iterations count:425 (4), effective:21 (0)

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

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

iterations count:836 (8), effective:19 (0)

iterations count:445 (4), effective:22 (0)

iterations count:1283 (13), effective:34 (0)

iterations count:1641 (16), effective:33 (0)

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

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

iterations count:499 (5), effective:19 (0)

iterations count:1313 (13), effective:43 (0)

iterations count:581 (5), effective:21 (0)

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

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

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

iterations count:169 (1), effective:7 (0)

iterations count:98 (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="Raft-PT-03"
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 Raft-PT-03, 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 r321-tall-167889192000297"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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