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-167813588800534.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 ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r001-oct2-167813588800534
=====================================================================

--------------------
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-ReachabilityCardinality-00
FORMULA_NAME AutonomousCar-PT-01a-ReachabilityCardinality-01
FORMULA_NAME AutonomousCar-PT-01a-ReachabilityCardinality-02
FORMULA_NAME AutonomousCar-PT-01a-ReachabilityCardinality-03
FORMULA_NAME AutonomousCar-PT-01a-ReachabilityCardinality-04
FORMULA_NAME AutonomousCar-PT-01a-ReachabilityCardinality-05
FORMULA_NAME AutonomousCar-PT-01a-ReachabilityCardinality-06
FORMULA_NAME AutonomousCar-PT-01a-ReachabilityCardinality-07
FORMULA_NAME AutonomousCar-PT-01a-ReachabilityCardinality-08
FORMULA_NAME AutonomousCar-PT-01a-ReachabilityCardinality-09
FORMULA_NAME AutonomousCar-PT-01a-ReachabilityCardinality-10
FORMULA_NAME AutonomousCar-PT-01a-ReachabilityCardinality-11
FORMULA_NAME AutonomousCar-PT-01a-ReachabilityCardinality-12
FORMULA_NAME AutonomousCar-PT-01a-ReachabilityCardinality-13
FORMULA_NAME AutonomousCar-PT-01a-ReachabilityCardinality-14
FORMULA_NAME AutonomousCar-PT-01a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678395305652

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-01a
Not applying reductions.
Model is PT
ReachabilityCardinality 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=ReachabilityCardinality.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 3.042sec


RS generation: 0m 0.001sec


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



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

checking: AG [~ [1<=p11]]
normalized: ~ [E [true U 1<=p11]]

abstracting: (1<=p11)
states: 44
-> the formula is FALSE

FORMULA AutonomousCar-PT-01a-ReachabilityCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [1<=p19]
normalized: ~ [E [true U ~ [1<=p19]]]

abstracting: (1<=p19)
states: 41
-> the formula is FALSE

FORMULA AutonomousCar-PT-01a-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [p19<=1]
normalized: ~ [E [true U ~ [p19<=1]]]

abstracting: (p19<=1)
states: 227
-> the formula is TRUE

FORMULA AutonomousCar-PT-01a-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (1<=p15)
states: 10
-> the formula is TRUE

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

MC time: 0m 0.002sec

checking: AG [~ [[~ [p21<=0] & 1<=p18]]]
normalized: ~ [E [true U [~ [p21<=0] & 1<=p18]]]

abstracting: (1<=p18)
states: 67
abstracting: (p21<=0)
states: 186
-> the formula is FALSE

FORMULA AutonomousCar-PT-01a-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [[p14<=1 | ~ [p8<=0]]]
normalized: E [true U [~ [p8<=0] | p14<=1]]

abstracting: (p14<=1)
states: 227
abstracting: (p8<=0)
states: 184
-> the formula is TRUE

FORMULA AutonomousCar-PT-01a-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [~ [[p8<=p20 | p12<=p8]]]
normalized: E [true U ~ [[p8<=p20 | p12<=p8]]]

abstracting: (p12<=p8)
states: 215
abstracting: (p8<=p20)
states: 219
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: EF [[p6<=0 | ~ [[[~ [p16<=0] | p9<=p18] | [[~ [p5<=0] | 1<=p22] & p17<=0]]]]]
normalized: E [true U [~ [[[[~ [p5<=0] | 1<=p22] & p17<=0] | [~ [p16<=0] | p9<=p18]]] | p6<=0]]

abstracting: (p6<=0)
states: 199
abstracting: (p9<=p18)
states: 207
abstracting: (p16<=0)
states: 217
abstracting: (p17<=0)
states: 130
abstracting: (1<=p22)
states: 41
abstracting: (p5<=0)
states: 199
-> the formula is TRUE

FORMULA AutonomousCar-PT-01a-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[~ [p6<=p6] | [~ [p9<=p19] & ~ [[[p10<=p24 | p5<=0] & p19<=p21]]]]]
normalized: ~ [E [true U ~ [[[~ [[[p10<=p24 | p5<=0] & p19<=p21]] & ~ [p9<=p19]] | ~ [p6<=p6]]]]]

abstracting: (p6<=p6)
states: 227
abstracting: (p9<=p19)
states: 204
abstracting: (p19<=p21)
states: 186
abstracting: (p5<=0)
states: 199
abstracting: (p10<=p24)
states: 201
-> the formula is FALSE

FORMULA AutonomousCar-PT-01a-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[[p24<=p5 | [~ [[1<=p20 | [1<=p15 & [1<=p9 | [~ [p5<=p5] | [1<=p19 | 1<=p5]]]]]] & ~ [p5<=0]]] | ~ [p3<=1]]]
normalized: E [true U [~ [p3<=1] | [[~ [p5<=0] & ~ [[[[[[1<=p19 | 1<=p5] | ~ [p5<=p5]] | 1<=p9] & 1<=p15] | 1<=p20]]] | p24<=p5]]]

abstracting: (p24<=p5)
states: 209
abstracting: (1<=p20)
states: 185
abstracting: (1<=p15)
states: 10
abstracting: (1<=p9)
states: 28
abstracting: (p5<=p5)
states: 227
abstracting: (1<=p5)
states: 28
abstracting: (1<=p19)
states: 41
abstracting: (p5<=0)
states: 199
abstracting: (p3<=1)
states: 227
-> the formula is TRUE

FORMULA AutonomousCar-PT-01a-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [[~ [[~ [[[p6<=1 | p6<=p20] | [[[~ [1<=p5] | [p14<=1 & 1<=p8]] | 1<=p19] | ~ [[[p22<=p15 & p14<=1] | 1<=p21]]]]] & ~ [[p2<=p9 | p22<=p17]]]] & p11<=p13]]
normalized: ~ [E [true U ~ [[~ [[~ [[p2<=p9 | p22<=p17]] & ~ [[[~ [[[p22<=p15 & p14<=1] | 1<=p21]] | [[[p14<=1 & 1<=p8] | ~ [1<=p5]] | 1<=p19]] | [p6<=1 | p6<=p20]]]]] & p11<=p13]]]]

abstracting: (p11<=p13)
states: 185
abstracting: (p6<=p20)
states: 222
abstracting: (p6<=1)
states: 227
abstracting: (1<=p19)
states: 41
abstracting: (1<=p5)
states: 28
abstracting: (1<=p8)
states: 43
abstracting: (p14<=1)
states: 227
abstracting: (1<=p21)
states: 41
abstracting: (p14<=1)
states: 227
abstracting: (p22<=p15)
states: 188
abstracting: (p22<=p17)
states: 207
abstracting: (p2<=p9)
states: 155
-> the formula is FALSE

FORMULA AutonomousCar-PT-01a-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [[[~ [[~ [[~ [p8<=p22] & 1<=p17]] | [p20<=0 & [[[1<=p17 | ~ [p13<=p14]] & [[1<=p19 & p20<=p23] & ~ [1<=p10]]] | p14<=p19]]]] & ~ [[[~ [[[~ [p14<=1] | ~ [1<=p20]] & [[p21<=p19 & 1<=p14] & [p22<=1 & p17<=p24]]]] | ~ [[p17<=1 & p13<=1]]] & p4<=p8]]] & ~ [[1<=p23 | ~ [p19<=p2]]]]]
normalized: E [true U [[~ [[~ [[~ [p8<=p22] & 1<=p17]] | [p20<=0 & [[[~ [1<=p10] & [1<=p19 & p20<=p23]] & [1<=p17 | ~ [p13<=p14]]] | p14<=p19]]]] & ~ [[[~ [[[[p21<=p19 & 1<=p14] & [p22<=1 & p17<=p24]] & [~ [1<=p20] | ~ [p14<=1]]]] | ~ [[p17<=1 & p13<=1]]] & p4<=p8]]] & ~ [[~ [p19<=p2] | 1<=p23]]]]

abstracting: (1<=p23)
states: 124
abstracting: (p19<=p2)
states: 200
abstracting: (p4<=p8)
states: 182
abstracting: (p13<=1)
states: 227
abstracting: (p17<=1)
states: 227
abstracting: (p14<=1)
states: 227
abstracting: (1<=p20)
states: 185
abstracting: (p17<=p24)
states: 143
abstracting: (p22<=1)
states: 227
abstracting: (1<=p14)
states: 14
abstracting: (p21<=p19)
states: 186
abstracting: (p14<=p19)
states: 213
abstracting: (p13<=p14)
states: 213
abstracting: (1<=p17)
states: 97
abstracting: (p20<=p23)
states: 125
abstracting: (1<=p19)
states: 41
abstracting: (1<=p10)
states: 28
abstracting: (p20<=0)
states: 42
abstracting: (1<=p17)
states: 97
abstracting: (p8<=p22)
states: 192
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: EF [[~ [[[[[p24<=p12 | p15<=p22] & [[[~ [p16<=1] | [p24<=0 | 1<=p17]] | p15<=0] & 1<=p14]] | [p14<=1 | [[[[1<=p6 | 1<=p22] | 1<=p11] | 1<=p1] & 1<=p1]]] & [[[[[p14<=1 & ~ [1<=p10]] | [p24<=p17 | ~ [p12<=p0]]] & [[[p6<=p1 & p11<=p21] | ~ [1<=p24]] & 1<=p24]] & ~ [[p6<=p7 | ~ [p7<=1]]]] | ~ [[p4<=p3 & [[~ [p10<=p13] & [p24<=1 | p0<=1]] & ~ [p7<=p15]]]]]]] | [p24<=0 & p1<=p12]]]
normalized: E [true U [[p24<=0 & p1<=p12] | ~ [[[~ [[[~ [p7<=p15] & [[p24<=1 | p0<=1] & ~ [p10<=p13]]] & p4<=p3]] | [~ [[~ [p7<=1] | p6<=p7]] & [[[~ [1<=p24] | [p6<=p1 & p11<=p21]] & 1<=p24] & [[~ [p12<=p0] | p24<=p17] | [~ [1<=p10] & p14<=1]]]]] & [[[[[[1<=p6 | 1<=p22] | 1<=p11] | 1<=p1] & 1<=p1] | p14<=1] | [[[[[p24<=0 | 1<=p17] | ~ [p16<=1]] | p15<=0] & 1<=p14] & [p24<=p12 | p15<=p22]]]]]]]

abstracting: (p15<=p22)
states: 219
abstracting: (p24<=p12)
states: 207
abstracting: (1<=p14)
states: 14
abstracting: (p15<=0)
states: 217
abstracting: (p16<=1)
states: 227
abstracting: (1<=p17)
states: 97
abstracting: (p24<=0)
states: 207
abstracting: (p14<=1)
states: 227
abstracting: (1<=p1)
states: 226
abstracting: (1<=p1)
states: 226
abstracting: (1<=p11)
states: 44
abstracting: (1<=p22)
states: 41
abstracting: (1<=p6)
states: 28
abstracting: (p14<=1)
states: 227
abstracting: (1<=p10)
states: 28
abstracting: (p24<=p17)
states: 220
abstracting: (p12<=p0)
states: 213
abstracting: (1<=p24)
states: 20
abstracting: (p11<=p21)
states: 191
abstracting: (p6<=p1)
states: 227
abstracting: (1<=p24)
states: 20
abstracting: (p6<=p7)
states: 199
abstracting: (p7<=1)
states: 227
abstracting: (p4<=p3)
states: 162
abstracting: (p10<=p13)
states: 201
abstracting: (p0<=1)
states: 227
abstracting: (p24<=1)
states: 227
abstracting: (p7<=p15)
states: 200
abstracting: (p1<=p12)
states: 15
abstracting: (p24<=0)
states: 207
-> the formula is TRUE

FORMULA AutonomousCar-PT-01a-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [~ [[~ [[[~ [[1<=p8 & 1<=p24]] & [p9<=p18 & p5<=0]] | [[[p24<=p14 | ~ [p17<=1]] & [[[p6<=1 | 1<=p20] & p5<=1] | p8<=p8]] & ~ [p0<=1]]]] | [[1<=p18 | [[1<=p24 | [p0<=p22 & p22<=1]] & [~ [p8<=0] & [p13<=p0 | p13<=p6]]]] | [[[[~ [[p17<=p9 & 1<=p23]] | 1<=p22] & p0<=1] & [[~ [[p0<=0 & p7<=1]] & 1<=p21] | [[~ [p20<=p5] & [p19<=p9 & 1<=p10]] | [[1<=p12 & 1<=p19] | ~ [p18<=p2]]]]] | [p1<=0 | p16<=p19]]]]]]
normalized: ~ [E [true U [[[[p1<=0 | p16<=p19] | [[[[~ [p18<=p2] | [1<=p12 & 1<=p19]] | [[p19<=p9 & 1<=p10] & ~ [p20<=p5]]] | [~ [[p0<=0 & p7<=1]] & 1<=p21]] & [[~ [[p17<=p9 & 1<=p23]] | 1<=p22] & p0<=1]]] | [[[[p13<=p0 | p13<=p6] & ~ [p8<=0]] & [[p0<=p22 & p22<=1] | 1<=p24]] | 1<=p18]] | ~ [[[~ [p0<=1] & [[[[p6<=1 | 1<=p20] & p5<=1] | p8<=p8] & [~ [p17<=1] | p24<=p14]]] | [[p9<=p18 & p5<=0] & ~ [[1<=p8 & 1<=p24]]]]]]]]

abstracting: (1<=p24)
states: 20
abstracting: (1<=p8)
states: 43
abstracting: (p5<=0)
states: 199
abstracting: (p9<=p18)
states: 207
abstracting: (p24<=p14)
states: 207
abstracting: (p17<=1)
states: 227
abstracting: (p8<=p8)
states: 227
abstracting: (p5<=1)
states: 227
abstracting: (1<=p20)
states: 185
abstracting: (p6<=1)
states: 227
abstracting: (p0<=1)
states: 227
abstracting: (1<=p18)
states: 67
abstracting: (1<=p24)
states: 20
abstracting: (p22<=1)
states: 227
abstracting: (p0<=p22)
states: 226
abstracting: (p8<=0)
states: 184
abstracting: (p13<=p6)
states: 215
abstracting: (p13<=p0)
states: 213
abstracting: (p0<=1)
states: 227
abstracting: (1<=p22)
states: 41
abstracting: (1<=p23)
states: 124
abstracting: (p17<=p9)
states: 144
abstracting: (1<=p21)
states: 41
abstracting: (p7<=1)
states: 227
abstracting: (p0<=0)
states: 226
abstracting: (p20<=p5)
states: 65
abstracting: (1<=p10)
states: 28
abstracting: (p19<=p9)
states: 191
abstracting: (1<=p19)
states: 41
abstracting: (1<=p12)
states: 14
abstracting: (p18<=p2)
states: 189
abstracting: (p16<=p19)
states: 219
abstracting: (p1<=0)
states: 1
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: EF [[[~ [[p14<=p16 & ~ [[1<=p24 & [p21<=p14 | [[1<=p5 & p10<=p12] | p11<=p12]]]]]] | [[[[p5<=p3 | 1<=p20] & [~ [[p0<=1 | 1<=p13]] & [~ [[1<=p19 | 1<=p11]] & [[p9<=1 | p11<=p16] | ~ [1<=p24]]]]] & [[[[~ [p8<=1] & [p18<=1 & p1<=p15]] & ~ [1<=p0]] | ~ [[p10<=0 | [1<=p18 & 1<=p19]]]] | ~ [p24<=p20]]] | [[[1<=p14 & [~ [1<=p19] | ~ [[p11<=p1 | p18<=p7]]]] & [[[~ [p12<=1] & ~ [p12<=1]] & p13<=0] | p16<=p14]] & 1<=p0]]] | p10<=p6]]
normalized: E [true U [[[[[[[[~ [p12<=1] & ~ [p12<=1]] & p13<=0] | p16<=p14] & [[~ [[p11<=p1 | p18<=p7]] | ~ [1<=p19]] & 1<=p14]] & 1<=p0] | [[~ [p24<=p20] | [~ [[[1<=p18 & 1<=p19] | p10<=0]] | [~ [1<=p0] & [[p18<=1 & p1<=p15] & ~ [p8<=1]]]]] & [[[[~ [1<=p24] | [p9<=1 | p11<=p16]] & ~ [[1<=p19 | 1<=p11]]] & ~ [[p0<=1 | 1<=p13]]] & [p5<=p3 | 1<=p20]]]] | ~ [[~ [[[[[1<=p5 & p10<=p12] | p11<=p12] | p21<=p14] & 1<=p24]] & p14<=p16]]] | p10<=p6]]

abstracting: (p10<=p6)
states: 199
abstracting: (p14<=p16)
states: 213
abstracting: (1<=p24)
states: 20
abstracting: (p21<=p14)
states: 186
abstracting: (p11<=p12)
states: 185
abstracting: (p10<=p12)
states: 201
abstracting: (1<=p5)
states: 28
abstracting: (1<=p20)
states: 185
abstracting: (p5<=p3)
states: 210
abstracting: (1<=p13)
states: 14
abstracting: (p0<=1)
states: 227
abstracting: (1<=p11)
states: 44
abstracting: (1<=p19)
states: 41
abstracting: (p11<=p16)
states: 188
abstracting: (p9<=1)
states: 227
abstracting: (1<=p24)
states: 20
abstracting: (p8<=1)
states: 227
abstracting: (p1<=p15)
states: 11
abstracting: (p18<=1)
states: 227
abstracting: (1<=p0)
states: 1
abstracting: (p10<=0)
states: 199
abstracting: (1<=p19)
states: 41
abstracting: (1<=p18)
states: 67
abstracting: (p24<=p20)
states: 227
abstracting: (1<=p0)
states: 1
abstracting: (1<=p14)
states: 14
abstracting: (1<=p19)
states: 41
abstracting: (p18<=p7)
states: 168
abstracting: (p11<=p1)
states: 227
abstracting: (p16<=p14)
states: 217
abstracting: (p13<=0)
states: 213
abstracting: (p12<=1)
states: 227
abstracting: (p12<=1)
states: 227
-> the formula is TRUE

FORMULA AutonomousCar-PT-01a-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AG [[~ [[[[[[[[1<=p2 | p2<=1] | [p16<=p2 | p2<=p20]] & p16<=p11] | [[~ [p20<=p5] & [p17<=p18 | p0<=1]] | p17<=0]] & p8<=p6] | [1<=p14 | 1<=p7]] & 1<=p24]] & ~ [[[~ [[p16<=p21 | p20<=p7]] | [p23<=0 & 1<=p20]] | ~ [[[[[~ [1<=p22] | [p9<=p12 & 1<=p5]] | ~ [[1<=p8 | 1<=p12]]] & ~ [[p14<=0 | [p10<=p2 & p0<=p17]]]] & [[[[p12<=1 | p1<=p21] | [p18<=1 | p24<=1]] | [[p8<=0 & p4<=p18] | ~ [p15<=1]]] | p13<=1]]]]]]]
normalized: ~ [E [true U ~ [[~ [[~ [[[[[~ [p15<=1] | [p8<=0 & p4<=p18]] | [[p18<=1 | p24<=1] | [p12<=1 | p1<=p21]]] | p13<=1] & [~ [[[p10<=p2 & p0<=p17] | p14<=0]] & [~ [[1<=p8 | 1<=p12]] | [[p9<=p12 & 1<=p5] | ~ [1<=p22]]]]]] | [[p23<=0 & 1<=p20] | ~ [[p16<=p21 | p20<=p7]]]]] & ~ [[[[1<=p14 | 1<=p7] | [[[[[p17<=p18 | p0<=1] & ~ [p20<=p5]] | p17<=0] | [[[p16<=p2 | p2<=p20] | [1<=p2 | p2<=1]] & p16<=p11]] & p8<=p6]] & 1<=p24]]]]]]

abstracting: (1<=p24)
states: 20
abstracting: (p8<=p6)
states: 184
abstracting: (p16<=p11)
states: 222
abstracting: (p2<=1)
states: 227
abstracting: (1<=p2)
states: 84
abstracting: (p2<=p20)
states: 213
abstracting: (p16<=p2)
states: 217
abstracting: (p17<=0)
states: 130
abstracting: (p20<=p5)
states: 65
abstracting: (p0<=1)
states: 227
abstracting: (p17<=p18)
states: 130
abstracting: (1<=p7)
states: 27
abstracting: (1<=p14)
states: 14
abstracting: (p20<=p7)
states: 64
abstracting: (p16<=p21)
states: 219
abstracting: (1<=p20)
states: 185
abstracting: (p23<=0)
states: 103
abstracting: (1<=p22)
states: 41
abstracting: (1<=p5)
states: 28
abstracting: (p9<=p12)
states: 201
abstracting: (1<=p12)
states: 14
abstracting: (1<=p8)
states: 43
abstracting: (p14<=0)
states: 213
abstracting: (p0<=p17)
states: 226
abstracting: (p10<=p2)
states: 211
abstracting: (p13<=1)
states: 227
abstracting: (p1<=p21)
states: 42
abstracting: (p12<=1)
states: 227
abstracting: (p24<=1)
states: 227
abstracting: (p18<=1)
states: 227
abstracting: (p4<=p18)
states: 172
abstracting: (p8<=0)
states: 184
abstracting: (p15<=1)
states: 227
-> the formula is FALSE

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

MC time: 0m 0.001sec

totally nodes used: 6506 (6.5e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 6573 17640 24213
used/not used/entry size/cache size: 20761 67088103 16 1024MB
basic ops cache: hits/miss/sum: 5866 16468 22334
used/not used/entry size/cache size: 27018 16750198 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: 911 1609 2520
used/not used/entry size/cache size: 1609 8386999 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 67102394
1 6434
2 36
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 4.733sec


BK_STOP 1678395310439

--------------------
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:91 (2), effective:7 (0)

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

iterations count:279 (7), effective:28 (0)

iterations count:237 (6), effective:26 (0)

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

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

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

iterations count:142 (4), effective:11 (0)

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

iterations count:230 (6), effective:24 (0)

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

iterations count:66 (1), effective:5 (0)

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