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.r001-oct2-167813588800529.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 AutonomousCar-PT-01a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r001-oct2-167813588800529
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 384K
-rw-r--r-- 1 mcc users 5.6K Feb 25 12:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Feb 25 12:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 12:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 12:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Feb 25 12:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 25 12:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 12:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 12:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 11K Mar 5 18:22 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 AutonomousCar-PT-01a-CTLCardinality-00
FORMULA_NAME AutonomousCar-PT-01a-CTLCardinality-01
FORMULA_NAME AutonomousCar-PT-01a-CTLCardinality-02
FORMULA_NAME AutonomousCar-PT-01a-CTLCardinality-03
FORMULA_NAME AutonomousCar-PT-01a-CTLCardinality-04
FORMULA_NAME AutonomousCar-PT-01a-CTLCardinality-05
FORMULA_NAME AutonomousCar-PT-01a-CTLCardinality-06
FORMULA_NAME AutonomousCar-PT-01a-CTLCardinality-07
FORMULA_NAME AutonomousCar-PT-01a-CTLCardinality-08
FORMULA_NAME AutonomousCar-PT-01a-CTLCardinality-09
FORMULA_NAME AutonomousCar-PT-01a-CTLCardinality-10
FORMULA_NAME AutonomousCar-PT-01a-CTLCardinality-11
FORMULA_NAME AutonomousCar-PT-01a-CTLCardinality-12
FORMULA_NAME AutonomousCar-PT-01a-CTLCardinality-13
FORMULA_NAME AutonomousCar-PT-01a-CTLCardinality-14
FORMULA_NAME AutonomousCar-PT-01a-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678395299885

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=AutonomousCar-PT-01a
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: AutonomousCar_PT_01a
(NrP: 25 NrTr: 35 NrArc: 143)

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

net check time: 0m 0.000sec

init dd package: 0m 2.909sec


RS generation: 0m 0.001sec


-> reachability set: #nodes 154 (1.5e+02) #states 227



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

checking: AF [EX [1<=p21]]
normalized: ~ [EG [~ [EX [1<=p21]]]]

abstracting: (1<=p21)
states: 41
...............
EG iterations: 14
-> the formula is FALSE

FORMULA AutonomousCar-PT-01a-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: EX [p14<=0]
normalized: EX [p14<=0]

abstracting: (p14<=0)
states: 213
.-> the formula is TRUE

FORMULA AutonomousCar-PT-01a-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: ~ [AG [p1<=p2]]
normalized: E [true U ~ [p1<=p2]]

abstracting: (p1<=p2)
states: 85
-> the formula is TRUE

FORMULA AutonomousCar-PT-01a-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: ~ [EX [EF [AX [EX [p12<=p7]]]]]
normalized: ~ [EX [E [true U ~ [EX [~ [EX [p12<=p7]]]]]]]

abstracting: (p12<=p7)
states: 215
...-> the formula is FALSE

FORMULA AutonomousCar-PT-01a-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AF [[EX [1<=p1] | ~ [1<=p12]]]
normalized: ~ [EG [~ [[~ [1<=p12] | EX [1<=p1]]]]]

abstracting: (1<=p1)
states: 226
.abstracting: (1<=p12)
states: 14
.
EG iterations: 1
-> the formula is TRUE

FORMULA AutonomousCar-PT-01a-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[AX [AX [~ [[p0<=p9 | 1<=p6]]]] & AG [EX [AG [1<=p3]]]]]
normalized: ~ [E [true U ~ [[~ [E [true U ~ [EX [~ [E [true U ~ [1<=p3]]]]]]] & ~ [EX [EX [[p0<=p9 | 1<=p6]]]]]]]]

abstracting: (1<=p6)
states: 28
abstracting: (p0<=p9)
states: 226
..abstracting: (1<=p3)
states: 77
.-> the formula is FALSE

FORMULA AutonomousCar-PT-01a-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: [EF [AF [p7<=0]] & AG [[~ [p12<=0] & ~ [E [EX [1<=p17] U [p16<=0 | 1<=p8]]]]]]
normalized: [~ [E [true U ~ [[~ [E [EX [1<=p17] U [p16<=0 | 1<=p8]]] & ~ [p12<=0]]]]] & E [true U ~ [EG [~ [p7<=0]]]]]

abstracting: (p7<=0)
states: 200
...
EG iterations: 3
abstracting: (p12<=0)
states: 213
abstracting: (1<=p8)
states: 43
abstracting: (p16<=0)
states: 217
abstracting: (1<=p17)
states: 97
.-> the formula is FALSE

FORMULA AutonomousCar-PT-01a-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: [EG [AG [~ [[[EX [1<=p17] & ~ [p15<=0]] | p9<=1]]]] | AX [~ [EG [[~ [p2<=0] | AX [p5<=1]]]]]]
normalized: [~ [EX [EG [[~ [EX [~ [p5<=1]]] | ~ [p2<=0]]]]] | EG [~ [E [true U [[~ [p15<=0] & EX [1<=p17]] | p9<=1]]]]]

abstracting: (p9<=1)
states: 227
abstracting: (1<=p17)
states: 97
.abstracting: (p15<=0)
states: 217
.
EG iterations: 1
abstracting: (p2<=0)
states: 143
abstracting: (p5<=1)
states: 227
.
EG iterations: 0
.-> the formula is FALSE

FORMULA AutonomousCar-PT-01a-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: [EG [EX [~ [[~ [p6<=p24] | [p6<=p17 & p2<=p22]]]]] | ~ [AG [E [AG [AX [1<=p10]] U p11<=p21]]]]
normalized: [E [true U ~ [E [~ [E [true U EX [~ [1<=p10]]]] U p11<=p21]]] | EG [EX [~ [[[p6<=p17 & p2<=p22] | ~ [p6<=p24]]]]]]

abstracting: (p6<=p24)
states: 201
abstracting: (p2<=p22)
states: 157
abstracting: (p6<=p17)
states: 213
.......
EG iterations: 6
abstracting: (p11<=p21)
states: 191
abstracting: (1<=p10)
states: 28
.-> the formula is TRUE

FORMULA AutonomousCar-PT-01a-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: AX [[~ [p24<=p16] & [AG [[[[p22<=p21 & 1<=p18] & A [p1<=1 U p10<=p10]] | EX [1<=p11]]] | ~ [p17<=1]]]]
normalized: ~ [EX [~ [[[~ [p17<=1] | ~ [E [true U ~ [[EX [1<=p11] | [[~ [EG [~ [p10<=p10]]] & ~ [E [~ [p10<=p10] U [~ [p1<=1] & ~ [p10<=p10]]]]] & [p22<=p21 & 1<=p18]]]]]]] & ~ [p24<=p16]]]]]

abstracting: (p24<=p16)
states: 209
abstracting: (1<=p18)
states: 67
abstracting: (p22<=p21)
states: 186
abstracting: (p10<=p10)
states: 227
abstracting: (p1<=1)
states: 227
abstracting: (p10<=p10)
states: 227
abstracting: (p10<=p10)
states: 227
.
EG iterations: 1
abstracting: (1<=p11)
states: 44
.abstracting: (p17<=1)
states: 227
.-> the formula is FALSE

FORMULA AutonomousCar-PT-01a-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: A [1<=p5 U [[[EX [A [p10<=p6 U p24<=p0]] & ~ [1<=p2]] & ~ [[~ [p6<=1] & [EF [1<=p5] | [p16<=1 | 1<=p24]]]]] | EX [AG [p9<=0]]]]
normalized: [~ [EG [~ [[EX [~ [E [true U ~ [p9<=0]]]] | [~ [[[[p16<=1 | 1<=p24] | E [true U 1<=p5]] & ~ [p6<=1]]] & [~ [1<=p2] & EX [[~ [EG [~ [p24<=p0]]] & ~ [E [~ [p24<=p0] U [~ [p10<=p6] & ~ [p24<=p0]]]]]]]]]]]] & ~ [E [~ [[EX [~ [E [true U ~ [p9<=0]]]] | [~ [[[[p16<=1 | 1<=p24] | E [true U 1<=p5]] & ~ [p6<=1]]] & [~ [1<=p2] & EX [[~ [EG [~ [p24<=p0]]] & ~ [E [~ [p24<=p0] U [~ [p10<=p6] & ~ [p24<=p0]]]]]]]]]] U [~ [1<=p5] & ~ [[EX [~ [E [true U ~ [p9<=0]]]] | [~ [[[[p16<=1 | 1<=p24] | E [true U 1<=p5]] & ~ [p6<=1]]] & [~ [1<=p2] & EX [[~ [EG [~ [p24<=p0]]] & ~ [E [~ [p24<=p0] U [~ [p10<=p6] & ~ [p24<=p0]]]]]]]]]]]]]]

abstracting: (p24<=p0)
states: 207
abstracting: (p10<=p6)
states: 199
abstracting: (p24<=p0)
states: 207
abstracting: (p24<=p0)
states: 207
.........
EG iterations: 9
.abstracting: (1<=p2)
states: 84
abstracting: (p6<=1)
states: 227
abstracting: (1<=p5)
states: 28
abstracting: (1<=p24)
states: 20
abstracting: (p16<=1)
states: 227
abstracting: (p9<=0)
states: 199
.abstracting: (1<=p5)
states: 28
abstracting: (p24<=p0)
states: 207
abstracting: (p10<=p6)
states: 199
abstracting: (p24<=p0)
states: 207
abstracting: (p24<=p0)
states: 207
.........
EG iterations: 9
.abstracting: (1<=p2)
states: 84
abstracting: (p6<=1)
states: 227
abstracting: (1<=p5)
states: 28
abstracting: (1<=p24)
states: 20
abstracting: (p16<=1)
states: 227
abstracting: (p9<=0)
states: 199
.abstracting: (p24<=p0)
states: 207
abstracting: (p10<=p6)
states: 199
abstracting: (p24<=p0)
states: 207
abstracting: (p24<=p0)
states: 207
.........
EG iterations: 9
.abstracting: (1<=p2)
states: 84
abstracting: (p6<=1)
states: 227
abstracting: (1<=p5)
states: 28
abstracting: (1<=p24)
states: 20
abstracting: (p16<=1)
states: 227
abstracting: (p9<=0)
states: 199
.......
EG iterations: 6
-> the formula is FALSE

FORMULA AutonomousCar-PT-01a-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

checking: ~ [[A [1<=p5 U EF [E [~ [p5<=0] U 1<=p4]]] & [A [1<=p9 U [~ [EF [p22<=0]] & [p24<=1 & EF [p3<=1]]]] | AF [A [EX [1<=p17] U [EG [1<=p15] & [p20<=p19 & p22<=0]]]]]]]
normalized: ~ [[[~ [EG [~ [[~ [EG [~ [[[p20<=p19 & p22<=0] & EG [1<=p15]]]]] & ~ [E [~ [[[p20<=p19 & p22<=0] & EG [1<=p15]]] U [~ [EX [1<=p17]] & ~ [[[p20<=p19 & p22<=0] & EG [1<=p15]]]]]]]]]] | [~ [EG [~ [[[E [true U p3<=1] & p24<=1] & ~ [E [true U p22<=0]]]]]] & ~ [E [~ [[[E [true U p3<=1] & p24<=1] & ~ [E [true U p22<=0]]]] U [~ [1<=p9] & ~ [[[E [true U p3<=1] & p24<=1] & ~ [E [true U p22<=0]]]]]]]]] & [~ [EG [~ [E [true U E [~ [p5<=0] U 1<=p4]]]]] & ~ [E [~ [E [true U E [~ [p5<=0] U 1<=p4]]] U [~ [1<=p5] & ~ [E [true U E [~ [p5<=0] U 1<=p4]]]]]]]]]

abstracting: (1<=p4)
states: 65
abstracting: (p5<=0)
states: 199
abstracting: (1<=p5)
states: 28
abstracting: (1<=p4)
states: 65
abstracting: (p5<=0)
states: 199
abstracting: (1<=p4)
states: 65
abstracting: (p5<=0)
states: 199
.
EG iterations: 1
abstracting: (p22<=0)
states: 186
abstracting: (p24<=1)
states: 227
abstracting: (p3<=1)
states: 227
abstracting: (1<=p9)
states: 28
abstracting: (p22<=0)
states: 186
abstracting: (p24<=1)
states: 227
abstracting: (p3<=1)
states: 227
abstracting: (p22<=0)
states: 186
abstracting: (p24<=1)
states: 227
abstracting: (p3<=1)
states: 227

EG iterations: 0
abstracting: (1<=p15)
states: 10
..
EG iterations: 2
abstracting: (p22<=0)
states: 186
abstracting: (p20<=p19)
states: 42
abstracting: (1<=p17)
states: 97
.abstracting: (1<=p15)
states: 10
..
EG iterations: 2
abstracting: (p22<=0)
states: 186
abstracting: (p20<=p19)
states: 42
abstracting: (1<=p15)
states: 10
..
EG iterations: 2
abstracting: (p22<=0)
states: 186
abstracting: (p20<=p19)
states: 42
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA AutonomousCar-PT-01a-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: ~ [EF [[E [[E [p5<=0 U 1<=p6] | ~ [AF [p4<=1]]] U AF [[1<=p4 | p22<=0]]] & A [[EX [p11<=p13] & 1<=p6] U [p23<=p2 | EF [p7<=p18]]]]]]
normalized: ~ [E [true U [[~ [EG [~ [[E [true U p7<=p18] | p23<=p2]]]] & ~ [E [~ [[E [true U p7<=p18] | p23<=p2]] U [~ [[EX [p11<=p13] & 1<=p6]] & ~ [[E [true U p7<=p18] | p23<=p2]]]]]] & E [[EG [~ [p4<=1]] | E [p5<=0 U 1<=p6]] U ~ [EG [~ [[1<=p4 | p22<=0]]]]]]]]

abstracting: (p22<=0)
states: 186
abstracting: (1<=p4)
states: 65
.......
EG iterations: 7
abstracting: (1<=p6)
states: 28
abstracting: (p5<=0)
states: 199
abstracting: (p4<=1)
states: 227
.
EG iterations: 1
abstracting: (p23<=p2)
states: 152
abstracting: (p7<=p18)
states: 208
abstracting: (1<=p6)
states: 28
abstracting: (p11<=p13)
states: 185
.abstracting: (p23<=p2)
states: 152
abstracting: (p7<=p18)
states: 208
abstracting: (p23<=p2)
states: 152
abstracting: (p7<=p18)
states: 208
.
EG iterations: 1
-> the formula is FALSE

FORMULA AutonomousCar-PT-01a-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: EG [~ [[AG [p4<=p20] | [~ [[EF [1<=p10] & [[p10<=p23 | p22<=p23] & ~ [p3<=p23]]]] & E [[AX [1<=p14] & E [p15<=1 U 1<=p1]] U EG [1<=p2]]]]]]
normalized: EG [~ [[[E [[E [p15<=1 U 1<=p1] & ~ [EX [~ [1<=p14]]]] U EG [1<=p2]] & ~ [[[~ [p3<=p23] & [p10<=p23 | p22<=p23]] & E [true U 1<=p10]]]] | ~ [E [true U ~ [p4<=p20]]]]]]

abstracting: (p4<=p20)
states: 214
abstracting: (1<=p10)
states: 28
abstracting: (p22<=p23)
states: 186
abstracting: (p10<=p23)
states: 215
abstracting: (p3<=p23)
states: 199
abstracting: (1<=p2)
states: 84
...
EG iterations: 3
abstracting: (1<=p14)
states: 14
.abstracting: (1<=p1)
states: 226
abstracting: (p15<=1)
states: 227
...............
EG iterations: 15
-> the formula is FALSE

FORMULA AutonomousCar-PT-01a-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: ~ [EX [[AF [[1<=p20 | [AX [1<=p1] | p11<=p8]]] | ~ [[[1<=p23 | [A [p14<=0 U p4<=1] | AX [p10<=p4]]] & [~ [p20<=p22] | [AG [p22<=p17] & [1<=p23 | 1<=p16]]]]]]]]
normalized: ~ [EX [[~ [[[[[1<=p23 | 1<=p16] & ~ [E [true U ~ [p22<=p17]]]] | ~ [p20<=p22]] & [1<=p23 | [~ [EX [~ [p10<=p4]]] | [~ [EG [~ [p4<=1]]] & ~ [E [~ [p4<=1] U [~ [p14<=0] & ~ [p4<=1]]]]]]]]] | ~ [EG [~ [[1<=p20 | [p11<=p8 | ~ [EX [~ [1<=p1]]]]]]]]]]]

abstracting: (1<=p1)
states: 226
.abstracting: (p11<=p8)
states: 183
abstracting: (1<=p20)
states: 185
.
EG iterations: 1
abstracting: (p4<=1)
states: 227
abstracting: (p14<=0)
states: 213
abstracting: (p4<=1)
states: 227
abstracting: (p4<=1)
states: 227
.
EG iterations: 1
abstracting: (p10<=p4)
states: 204
.abstracting: (1<=p23)
states: 124
abstracting: (p20<=p22)
states: 83
abstracting: (p22<=p17)
states: 207
abstracting: (1<=p16)
states: 10
abstracting: (1<=p23)
states: 124
.-> the formula is FALSE

FORMULA AutonomousCar-PT-01a-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EX [~ [A [AG [[[p6<=0 | p14<=p2] | EX [p17<=p12]]] U [p1<=p19 & [[[p20<=p18 | p20<=p16] & [p1<=p3 | 1<=p18]] | [~ [1<=p23] & ~ [1<=p0]]]]]]]
normalized: EX [~ [[~ [EG [~ [[p1<=p19 & [[~ [1<=p0] & ~ [1<=p23]] | [[p1<=p3 | 1<=p18] & [p20<=p18 | p20<=p16]]]]]]] & ~ [E [~ [[p1<=p19 & [[~ [1<=p0] & ~ [1<=p23]] | [[p1<=p3 | 1<=p18] & [p20<=p18 | p20<=p16]]]]] U [E [true U ~ [[EX [p17<=p12] | [p6<=0 | p14<=p2]]]] & ~ [[p1<=p19 & [[~ [1<=p0] & ~ [1<=p23]] | [[p1<=p3 | 1<=p18] & [p20<=p18 | p20<=p16]]]]]]]]]]]

abstracting: (p20<=p16)
states: 50
abstracting: (p20<=p18)
states: 93
abstracting: (1<=p18)
states: 67
abstracting: (p1<=p3)
states: 78
abstracting: (1<=p23)
states: 124
abstracting: (1<=p0)
states: 1
abstracting: (p1<=p19)
states: 42
abstracting: (p14<=p2)
states: 220
abstracting: (p6<=0)
states: 199
abstracting: (p17<=p12)
states: 130
.abstracting: (p20<=p16)
states: 50
abstracting: (p20<=p18)
states: 93
abstracting: (1<=p18)
states: 67
abstracting: (p1<=p3)
states: 78
abstracting: (1<=p23)
states: 124
abstracting: (1<=p0)
states: 1
abstracting: (p1<=p19)
states: 42
abstracting: (p20<=p16)
states: 50
abstracting: (p20<=p18)
states: 93
abstracting: (1<=p18)
states: 67
abstracting: (p1<=p3)
states: 78
abstracting: (1<=p23)
states: 124
abstracting: (1<=p0)
states: 1
abstracting: (p1<=p19)
states: 42
.....
EG iterations: 5
.-> the formula is TRUE

FORMULA AutonomousCar-PT-01a-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

totally nodes used: 25400 (2.5e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 27792 66095 93887
used/not used/entry size/cache size: 84356 67024508 16 1024MB
basic ops cache: hits/miss/sum: 13197 26754 39951
used/not used/entry size/cache size: 49089 16728127 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: 703 1370 2073
used/not used/entry size/cache size: 1370 8387238 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 67083782
1 24765
2 316
3 1
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 4.693sec


BK_STOP 1678395304632

--------------------
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:341 (9), effective:40 (1)

initing FirstDep: 0m 0.000sec


iterations count:172 (4), effective:15 (0)

iterations count:95 (2), effective:9 (0)

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

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

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

iterations count:76 (2), effective:8 (0)

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

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

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

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

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

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

iterations count:222 (6), effective:25 (0)

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

iterations count:133 (3), effective:11 (0)

iterations count:149 (4), effective:13 (0)

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

iterations count:133 (3), effective:11 (0)

iterations count:149 (4), effective:13 (0)

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

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

iterations count:133 (3), effective:11 (0)

iterations count:149 (4), effective:13 (0)

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

iterations count:156 (4), effective:17 (0)

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

iterations count:156 (4), effective:17 (0)

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

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

iterations count:156 (4), effective:17 (0)

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

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

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

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

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

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

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

iterations count:247 (7), effective:24 (0)

iterations count:128 (3), effective:10 (0)

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

iterations count:90 (2), effective:8 (0)

iterations count:90 (2), effective:8 (0)

iterations count:90 (2), effective:8 (0)

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

iterations count:351 (10), effective:37 (1)

iterations count:138 (3), effective:12 (0)

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

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

iterations count:218 (6), effective:23 (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="AutonomousCar-PT-01a"
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 AutonomousCar-PT-01a, 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 r001-oct2-167813588800529"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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