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-167813588800553.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-02b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r001-oct2-167813588800553
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 7.4K Feb 25 12:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 12:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 12:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 12:57 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.2K Feb 25 15:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Feb 25 12:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 25 12:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 25 12:57 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 49K 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-02b-CTLCardinality-00
FORMULA_NAME AutonomousCar-PT-02b-CTLCardinality-01
FORMULA_NAME AutonomousCar-PT-02b-CTLCardinality-02
FORMULA_NAME AutonomousCar-PT-02b-CTLCardinality-03
FORMULA_NAME AutonomousCar-PT-02b-CTLCardinality-04
FORMULA_NAME AutonomousCar-PT-02b-CTLCardinality-05
FORMULA_NAME AutonomousCar-PT-02b-CTLCardinality-06
FORMULA_NAME AutonomousCar-PT-02b-CTLCardinality-07
FORMULA_NAME AutonomousCar-PT-02b-CTLCardinality-08
FORMULA_NAME AutonomousCar-PT-02b-CTLCardinality-09
FORMULA_NAME AutonomousCar-PT-02b-CTLCardinality-10
FORMULA_NAME AutonomousCar-PT-02b-CTLCardinality-11
FORMULA_NAME AutonomousCar-PT-02b-CTLCardinality-12
FORMULA_NAME AutonomousCar-PT-02b-CTLCardinality-13
FORMULA_NAME AutonomousCar-PT-02b-CTLCardinality-14
FORMULA_NAME AutonomousCar-PT-02b-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678395342714

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-02b
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_02b
(NrP: 155 NrTr: 194 NrArc: 620)

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

net check time: 0m 0.000sec

init dd package: 0m 2.969sec


RS generation: 0m 0.310sec


-> reachability set: #nodes 7148 (7.1e+03) #states 4,051,732 (6)



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

checking: EF [AG [EF [E [AG [p146<=0] U EG [1<=p46]]]]]
normalized: E [true U ~ [E [true U ~ [E [true U E [~ [E [true U ~ [p146<=0]]] U EG [1<=p46]]]]]]]

abstracting: (1<=p46)
states: 237,752 (5)
........................................
EG iterations: 40
abstracting: (p146<=0)
states: 3,945,964 (6)
-> the formula is TRUE

FORMULA AutonomousCar-PT-02b-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.076sec

checking: AG [[EX [p3<=0] & p64<=p83]]
normalized: ~ [E [true U ~ [[p64<=p83 & EX [p3<=0]]]]]

abstracting: (p3<=0)
states: 3,376,092 (6)
.abstracting: (p64<=p83)
states: 3,912,530 (6)
-> the formula is FALSE

FORMULA AutonomousCar-PT-02b-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.642sec

checking: AF [A [AF [[~ [AF [1<=p145]] & AX [p48<=p16]]] U 1<=p33]]
normalized: ~ [EG [~ [[~ [EG [~ [1<=p33]]] & ~ [E [~ [1<=p33] U [~ [1<=p33] & EG [~ [[~ [EX [~ [p48<=p16]]] & EG [~ [1<=p145]]]]]]]]]]]]

abstracting: (1<=p145)
states: 105,768 (5)
.
EG iterations: 1
abstracting: (p48<=p16)
states: 3,912,530 (6)
.............................................................................
EG iterations: 76
abstracting: (1<=p33)
states: 139,202 (5)
abstracting: (1<=p33)
states: 139,202 (5)
abstracting: (1<=p33)
states: 139,202 (5)
.........................................
EG iterations: 41
.............
EG iterations: 13
-> the formula is FALSE

FORMULA AutonomousCar-PT-02b-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.314sec

checking: ~ [A [[EF [[p21<=p146 | [p57<=p23 & 1<=p98]]] | EX [p113<=1]] U EF [AF [EG [1<=p84]]]]]
normalized: ~ [[~ [EG [~ [E [true U ~ [EG [~ [EG [1<=p84]]]]]]]] & ~ [E [~ [E [true U ~ [EG [~ [EG [1<=p84]]]]]] U [~ [E [true U ~ [EG [~ [EG [1<=p84]]]]]] & ~ [[EX [p113<=1] | E [true U [p21<=p146 | [p57<=p23 & 1<=p98]]]]]]]]]]

abstracting: (1<=p98)
states: 71,944 (4)
abstracting: (p57<=p23)
states: 3,912,530 (6)
abstracting: (p21<=p146)
states: 4,051,132 (6)
abstracting: (p113<=1)
states: 4,051,732 (6)
.abstracting: (1<=p84)
states: 2,400 (3)
.........................
EG iterations: 25

EG iterations: 0
abstracting: (1<=p84)
states: 2,400 (3)
.........................
EG iterations: 25

EG iterations: 0
abstracting: (1<=p84)
states: 2,400 (3)
.........................
EG iterations: 25

EG iterations: 0

EG iterations: 0
-> the formula is TRUE

FORMULA AutonomousCar-PT-02b-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.444sec

checking: AF [[EG [EX [[EG [p127<=p14] & ~ [p109<=0]]]] & A [AF [EG [1<=p5]] U ~ [[E [p68<=1 U 1<=p115] | EF [p101<=0]]]]]]
normalized: ~ [EG [~ [[[~ [EG [[E [true U p101<=0] | E [p68<=1 U 1<=p115]]]] & ~ [E [[E [true U p101<=0] | E [p68<=1 U 1<=p115]] U [EG [~ [EG [1<=p5]]] & [E [true U p101<=0] | E [p68<=1 U 1<=p115]]]]]] & EG [EX [[~ [p109<=0] & EG [p127<=p14]]]]]]]]

abstracting: (p127<=p14)
states: 3,955,828 (6)
............................................
EG iterations: 44
abstracting: (p109<=0)
states: 3,858,964 (6)
...............................
EG iterations: 30
abstracting: (1<=p115)
states: 3,450 (3)
abstracting: (p68<=1)
states: 4,051,732 (6)
abstracting: (p101<=0)
states: 3,979,788 (6)
abstracting: (1<=p5)
states: 969,128 (5)
.......................................
EG iterations: 39
..............................................................
EG iterations: 62
abstracting: (1<=p115)
states: 3,450 (3)
abstracting: (p68<=1)
states: 4,051,732 (6)
abstracting: (p101<=0)
states: 3,979,788 (6)
abstracting: (1<=p115)
states: 3,450 (3)
abstracting: (p68<=1)
states: 4,051,732 (6)
abstracting: (p101<=0)
states: 3,979,788 (6)

EG iterations: 0

EG iterations: 0
-> the formula is FALSE

FORMULA AutonomousCar-PT-02b-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.607sec

checking: ~ [[A [E [EG [p41<=0] U ~ [[1<=p109 | p12<=1]]] U EG [[E [1<=p110 U 1<=p142] | EG [p97<=1]]]] & EG [AX [p69<=1]]]]
normalized: ~ [[EG [~ [EX [~ [p69<=1]]]] & [~ [EG [~ [EG [[EG [p97<=1] | E [1<=p110 U 1<=p142]]]]]] & ~ [E [~ [EG [[EG [p97<=1] | E [1<=p110 U 1<=p142]]]] U [~ [E [EG [p41<=0] U ~ [[1<=p109 | p12<=1]]]] & ~ [EG [[EG [p97<=1] | E [1<=p110 U 1<=p142]]]]]]]]]]

abstracting: (1<=p142)
states: 105,768 (5)
abstracting: (1<=p110)
states: 192,768 (5)
abstracting: (p97<=1)
states: 4,051,732 (6)

EG iterations: 0

EG iterations: 0
abstracting: (p12<=1)
states: 4,051,732 (6)
abstracting: (1<=p109)
states: 192,768 (5)
abstracting: (p41<=0)
states: 3,912,530 (6)
.
EG iterations: 1
abstracting: (1<=p142)
states: 105,768 (5)
abstracting: (1<=p110)
states: 192,768 (5)
abstracting: (p97<=1)
states: 4,051,732 (6)

EG iterations: 0

EG iterations: 0
abstracting: (1<=p142)
states: 105,768 (5)
abstracting: (1<=p110)
states: 192,768 (5)
abstracting: (p97<=1)
states: 4,051,732 (6)

EG iterations: 0

EG iterations: 0
.
EG iterations: 1
abstracting: (p69<=1)
states: 4,051,732 (6)
.
EG iterations: 0
-> the formula is FALSE

FORMULA AutonomousCar-PT-02b-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.127sec

checking: ~ [E [EX [[p20<=p152 | [A [p147<=0 U 1<=p97] & EX [p103<=1]]]] U [AX [~ [p74<=1]] & [1<=p151 & 1<=p72]]]]
normalized: ~ [E [EX [[p20<=p152 | [EX [p103<=1] & [~ [EG [~ [1<=p97]]] & ~ [E [~ [1<=p97] U [~ [p147<=0] & ~ [1<=p97]]]]]]]] U [[1<=p151 & 1<=p72] & ~ [EX [p74<=1]]]]]

abstracting: (p74<=1)
states: 4,051,732 (6)
.abstracting: (1<=p72)
states: 139,202 (5)
abstracting: (1<=p151)
states: 0
abstracting: (1<=p97)
states: 71,944 (4)
abstracting: (p147<=0)
states: 3,945,964 (6)
abstracting: (1<=p97)
states: 71,944 (4)
abstracting: (1<=p97)
states: 71,944 (4)
...................................
EG iterations: 35
abstracting: (p103<=1)
states: 4,051,732 (6)
.abstracting: (p20<=p152)
states: 4,051,232 (6)
.-> the formula is TRUE

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

MC time: 0m 1.369sec

checking: AG [AF [[[[E [1<=p61 U 1<=p102] | [AF [p50<=p130] & ~ [p50<=1]]] | [~ [E [p106<=1 U p49<=0]] & p127<=0]] | AX [p20<=p37]]]]
normalized: ~ [E [true U EG [~ [[~ [EX [~ [p20<=p37]]] | [[p127<=0 & ~ [E [p106<=1 U p49<=0]]] | [[~ [p50<=1] & ~ [EG [~ [p50<=p130]]]] | E [1<=p61 U 1<=p102]]]]]]]]

abstracting: (1<=p102)
states: 71,944 (4)
abstracting: (1<=p61)
states: 139,202 (5)
abstracting: (p50<=p130)
states: 3,921,683 (6)
......................................
EG iterations: 38
abstracting: (p50<=1)
states: 4,051,732 (6)
abstracting: (p49<=0)
states: 3,912,530 (6)
abstracting: (p106<=1)
states: 4,051,732 (6)
abstracting: (p127<=0)
states: 3,910,708 (6)
abstracting: (p20<=p37)
states: 4,051,132 (6)
.......................
EG iterations: 22
-> the formula is TRUE

FORMULA AutonomousCar-PT-02b-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.401sec

checking: EG [[~ [[[EG [[1<=p92 & 1<=p71]] & AG [[1<=p42 | p154<=0]]] | ~ [EX [[1<=p12 | p68<=p30]]]]] | EF [[EF [[1<=p108 & p149<=p149]] & 1<=p5]]]]
normalized: EG [[E [true U [1<=p5 & E [true U [1<=p108 & p149<=p149]]]] | ~ [[~ [EX [[1<=p12 | p68<=p30]]] | [~ [E [true U ~ [[1<=p42 | p154<=0]]]] & EG [[1<=p92 & 1<=p71]]]]]]]

abstracting: (1<=p71)
states: 113,454 (5)
abstracting: (1<=p92)
states: 71,944 (4)
.
EG iterations: 1
abstracting: (p154<=0)
states: 3,932,607 (6)
abstracting: (1<=p42)
states: 139,202 (5)
abstracting: (p68<=p30)
states: 3,916,896 (6)
abstracting: (1<=p12)
states: 484,564 (5)
.abstracting: (p149<=p149)
states: 4,051,732 (6)
abstracting: (1<=p108)
states: 192,768 (5)
abstracting: (1<=p5)
states: 969,128 (5)
...................................................................................
EG iterations: 83
-> the formula is TRUE

FORMULA AutonomousCar-PT-02b-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.321sec

checking: AF [[[A [[EG [p45<=0] | AG [1<=p103]] U ~ [AX [1<=p99]]] | ~ [[[AX [p145<=1] | EX [p78<=p14]] & EX [p13<=p42]]]] & ~ [AG [EX [[p115<=p28 | p73<=p7]]]]]]
normalized: ~ [EG [~ [[E [true U ~ [EX [[p115<=p28 | p73<=p7]]]] & [~ [[EX [p13<=p42] & [EX [p78<=p14] | ~ [EX [~ [p145<=1]]]]]] | [~ [EG [~ [EX [~ [1<=p99]]]]] & ~ [E [~ [EX [~ [1<=p99]]] U [~ [[~ [E [true U ~ [1<=p103]]] | EG [p45<=0]]] & ~ [EX [~ [1<=p99]]]]]]]]]]]]

abstracting: (1<=p99)
states: 71,944 (4)
.abstracting: (p45<=0)
states: 3,921,500 (6)
.........................................
EG iterations: 41
abstracting: (1<=p103)
states: 71,944 (4)
abstracting: (1<=p99)
states: 71,944 (4)
.abstracting: (1<=p99)
states: 71,944 (4)
...
EG iterations: 2
abstracting: (p145<=1)
states: 4,051,732 (6)
.abstracting: (p78<=p14)
states: 3,888,260 (6)
.abstracting: (p13<=p42)
states: 3,040,192 (6)
.abstracting: (p73<=p7)
states: 3,913,190 (6)
abstracting: (p115<=p28)
states: 4,048,282 (6)
..
EG iterations: 1
-> the formula is TRUE

FORMULA AutonomousCar-PT-02b-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.648sec

checking: ~ [[EG [A [[[~ [1<=p16] | [1<=p76 & p16<=p69]] & ~ [[1<=p112 | p83<=p34]]] U p69<=1]] & EX [[EG [~ [AF [p147<=p0]]] | [EG [[p4<=0 | p45<=0]] | AX [1<=p142]]]]]]
normalized: ~ [[EX [[[~ [EX [~ [1<=p142]]] | EG [[p4<=0 | p45<=0]]] | EG [EG [~ [p147<=p0]]]]] & EG [[~ [EG [~ [p69<=1]]] & ~ [E [~ [p69<=1] U [~ [[~ [[1<=p112 | p83<=p34]] & [[1<=p76 & p16<=p69] | ~ [1<=p16]]]] & ~ [p69<=1]]]]]]]]

abstracting: (p69<=1)
states: 4,051,732 (6)
abstracting: (1<=p16)
states: 150
abstracting: (p16<=p69)
states: 4,051,582 (6)
abstracting: (1<=p76)
states: 130,232 (5)
abstracting: (p83<=p34)
states: 3,820,914 (6)
abstracting: (1<=p112)
states: 626,992 (5)
abstracting: (p69<=1)
states: 4,051,732 (6)
abstracting: (p69<=1)
states: 4,051,732 (6)
.
EG iterations: 1

EG iterations: 0
abstracting: (p147<=p0)
states: 3,945,964 (6)
....................................................................................
EG iterations: 84
.
EG iterations: 1
abstracting: (p45<=0)
states: 3,921,500 (6)
abstracting: (p4<=0)
states: 3,376,092 (6)
.
EG iterations: 1
abstracting: (1<=p142)
states: 105,768 (5)
..-> the formula is FALSE

FORMULA AutonomousCar-PT-02b-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.969sec

checking: AG [[AF [[[~ [p143<=1] & p142<=p149] | ~ [A [p111<=p43 U 1<=p33]]]] & [A [AF [A [p121<=0 U p40<=0]] U [EG [p154<=p103] | EG [1<=p96]]] | [p29<=0 | EF [AG [1<=p153]]]]]]
normalized: ~ [E [true U ~ [[[[~ [EG [~ [[EG [1<=p96] | EG [p154<=p103]]]]] & ~ [E [~ [[EG [1<=p96] | EG [p154<=p103]]] U [EG [~ [[~ [EG [~ [p40<=0]]] & ~ [E [~ [p40<=0] U [~ [p121<=0] & ~ [p40<=0]]]]]]] & ~ [[EG [1<=p96] | EG [p154<=p103]]]]]]] | [p29<=0 | E [true U ~ [E [true U ~ [1<=p153]]]]]] & ~ [EG [~ [[~ [[~ [EG [~ [1<=p33]]] & ~ [E [~ [1<=p33] U [~ [p111<=p43] & ~ [1<=p33]]]]]] | [p142<=p149 & ~ [p143<=1]]]]]]]]]]

abstracting: (p143<=1)
states: 4,051,732 (6)
abstracting: (p142<=p149)
states: 3,945,964 (6)
abstracting: (1<=p33)
states: 139,202 (5)
abstracting: (p111<=p43)
states: 3,871,570 (6)
abstracting: (1<=p33)
states: 139,202 (5)
abstracting: (1<=p33)
states: 139,202 (5)
.........................................
EG iterations: 41
.........................................
EG iterations: 41
abstracting: (1<=p153)
states: 119,125 (5)
abstracting: (p29<=0)
states: 3,912,530 (6)
abstracting: (p154<=p103)
states: 3,932,607 (6)
...........................................................................................................
EG iterations: 107
abstracting: (1<=p96)
states: 71,944 (4)
...................................
EG iterations: 35
abstracting: (p40<=0)
states: 3,938,278 (6)
abstracting: (p121<=0)
states: 3,797,183 (6)
abstracting: (p40<=0)
states: 3,938,278 (6)
abstracting: (p40<=0)
states: 3,938,278 (6)
..................................
EG iterations: 34
..............................
EG iterations: 30
abstracting: (p154<=p103)
states: 3,932,607 (6)
...........................................................................................................
EG iterations: 107
abstracting: (1<=p96)
states: 71,944 (4)
...................................
EG iterations: 35
abstracting: (p154<=p103)
states: 3,932,607 (6)
...........................................................................................................
EG iterations: 107
abstracting: (1<=p96)
states: 71,944 (4)
...................................
EG iterations: 35
............................................................................................................
EG iterations: 108
-> the formula is FALSE

FORMULA AutonomousCar-PT-02b-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m11.717sec

checking: ~ [E [AX [A [[1<=p61 | 1<=p62] U ~ [1<=p44]]] U [A [[[p33<=0 | p143<=1] | AX [p101<=0]] U [EG [p100<=p76] & AF [1<=p111]]] & [[1<=p102 & ~ [AX [p39<=0]]] | [AX [1<=p146] & p8<=p61]]]]]
normalized: ~ [E [~ [EX [~ [[~ [E [1<=p44 U [1<=p44 & ~ [[1<=p61 | 1<=p62]]]]] & ~ [EG [1<=p44]]]]]] U [[[p8<=p61 & ~ [EX [~ [1<=p146]]]] | [1<=p102 & EX [~ [p39<=0]]]] & [~ [EG [~ [[~ [EG [~ [1<=p111]]] & EG [p100<=p76]]]]] & ~ [E [~ [[~ [EG [~ [1<=p111]]] & EG [p100<=p76]]] U [~ [[~ [EX [~ [p101<=0]]] | [p33<=0 | p143<=1]]] & ~ [[~ [EG [~ [1<=p111]]] & EG [p100<=p76]]]]]]]]]]

abstracting: (p100<=p76)
states: 3,982,916 (6)
....................................
EG iterations: 36
abstracting: (1<=p111)
states: 192,768 (5)
..........................................
EG iterations: 42
abstracting: (p143<=1)
states: 4,051,732 (6)
abstracting: (p33<=0)
states: 3,912,530 (6)
abstracting: (p101<=0)
states: 3,979,788 (6)
.abstracting: (p100<=p76)
states: 3,982,916 (6)
....................................
EG iterations: 36
abstracting: (1<=p111)
states: 192,768 (5)
..........................................
EG iterations: 42
abstracting: (p100<=p76)
states: 3,982,916 (6)
....................................
EG iterations: 36
abstracting: (1<=p111)
states: 192,768 (5)
..........................................
EG iterations: 42
.
EG iterations: 1
abstracting: (p39<=0)
states: 3,912,530 (6)
.abstracting: (1<=p102)
states: 71,944 (4)
abstracting: (1<=p146)
states: 105,768 (5)
.abstracting: (p8<=p61)
states: 4,035,081 (6)
abstracting: (1<=p44)
states: 95,634 (4)
..................................
EG iterations: 34
abstracting: (1<=p62)
states: 139,202 (5)
abstracting: (1<=p61)
states: 139,202 (5)
abstracting: (1<=p44)
states: 95,634 (4)
abstracting: (1<=p44)
states: 95,634 (4)
.-> the formula is TRUE

FORMULA AutonomousCar-PT-02b-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.068sec

checking: A [[EX [EF [[[1<=p51 & 1<=p119] & 1<=p88]]] | [[[p22<=p1 & E [EG [1<=p97] U AX [1<=p136]]] | [~ [[1<=p148 & 1<=p109]] & E [AG [p81<=1] U AG [1<=p63]]]] | [~ [AF [A [p133<=p52 U 1<=p98]]] | ~ [1<=p71]]]] U [~ [p35<=1] | ~ [p52<=1]]]
normalized: [~ [EG [~ [[~ [p52<=1] | ~ [p35<=1]]]]] & ~ [E [~ [[~ [p52<=1] | ~ [p35<=1]]] U [~ [[[[[~ [[1<=p148 & 1<=p109]] & E [~ [E [true U ~ [p81<=1]]] U ~ [E [true U ~ [1<=p63]]]]] | [p22<=p1 & E [EG [1<=p97] U ~ [EX [~ [1<=p136]]]]]] | [EG [~ [[~ [EG [~ [1<=p98]]] & ~ [E [~ [1<=p98] U [~ [p133<=p52] & ~ [1<=p98]]]]]]] | ~ [1<=p71]]] | EX [E [true U [1<=p88 & [1<=p51 & 1<=p119]]]]]] & ~ [[~ [p52<=1] | ~ [p35<=1]]]]]]]

abstracting: (p35<=1)
states: 4,051,732 (6)
abstracting: (p52<=1)
states: 4,051,732 (6)
abstracting: (1<=p119)
states: 23,825 (4)
abstracting: (1<=p51)
states: 139,202 (5)
abstracting: (1<=p88)
states: 262,384 (5)
.abstracting: (1<=p71)
states: 113,454 (5)
abstracting: (1<=p98)
states: 71,944 (4)
abstracting: (p133<=p52)
states: 3,952,570 (6)
abstracting: (1<=p98)
states: 71,944 (4)
abstracting: (1<=p98)
states: 71,944 (4)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p136)
states: 105,768 (5)
.abstracting: (1<=p97)
states: 71,944 (4)
...................................
EG iterations: 35
abstracting: (p22<=p1)
states: 4,051,252 (6)
abstracting: (1<=p63)
states: 139,202 (5)
abstracting: (p81<=1)
states: 4,051,732 (6)
abstracting: (1<=p109)
states: 192,768 (5)
abstracting: (1<=p148)
states: 688,320 (5)
abstracting: (p35<=1)
states: 4,051,732 (6)
abstracting: (p52<=1)
states: 4,051,732 (6)
abstracting: (p35<=1)
states: 4,051,732 (6)
abstracting: (p52<=1)
states: 4,051,732 (6)

EG iterations: 0
-> the formula is FALSE

FORMULA AutonomousCar-PT-02b-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.101sec

checking: E [~ [[AG [p63<=p25] & [A [EG [p117<=p65] U p36<=p113] | ~ [[~ [p62<=p42] | p55<=1]]]]] U [1<=p129 & A [p92<=p22 U [EX [[p41<=1 & p77<=1]] | [[AF [p131<=p91] | p100<=0] & ~ [1<=p97]]]]]]
normalized: E [~ [[[~ [[p55<=1 | ~ [p62<=p42]]] | [~ [EG [~ [p36<=p113]]] & ~ [E [~ [p36<=p113] U [~ [EG [p117<=p65]] & ~ [p36<=p113]]]]]] & ~ [E [true U ~ [p63<=p25]]]]] U [1<=p129 & [~ [EG [~ [[[~ [1<=p97] & [p100<=0 | ~ [EG [~ [p131<=p91]]]]] | EX [[p41<=1 & p77<=1]]]]]] & ~ [E [~ [[[~ [1<=p97] & [p100<=0 | ~ [EG [~ [p131<=p91]]]]] | EX [[p41<=1 & p77<=1]]]] U [~ [p92<=p22] & ~ [[[~ [1<=p97] & [p100<=0 | ~ [EG [~ [p131<=p91]]]]] | EX [[p41<=1 & p77<=1]]]]]]]]]]

abstracting: (p77<=1)
states: 4,051,732 (6)
abstracting: (p41<=1)
states: 4,051,732 (6)
.abstracting: (p131<=p91)
states: 3,805,647 (6)
..........................................
EG iterations: 42
abstracting: (p100<=0)
states: 3,979,788 (6)
abstracting: (1<=p97)
states: 71,944 (4)
abstracting: (p92<=p22)
states: 3,979,788 (6)
abstracting: (p77<=1)
states: 4,051,732 (6)
abstracting: (p41<=1)
states: 4,051,732 (6)
.abstracting: (p131<=p91)
states: 3,805,647 (6)
..........................................
EG iterations: 42
abstracting: (p100<=0)
states: 3,979,788 (6)
abstracting: (1<=p97)
states: 71,944 (4)
abstracting: (p77<=1)
states: 4,051,732 (6)
abstracting: (p41<=1)
states: 4,051,732 (6)
.abstracting: (p131<=p91)
states: 3,805,647 (6)
..........................................
EG iterations: 42
abstracting: (p100<=0)
states: 3,979,788 (6)
abstracting: (1<=p97)
states: 71,944 (4)
.
EG iterations: 1
abstracting: (1<=p129)
states: 883,557 (5)
abstracting: (p63<=p25)
states: 3,916,896 (6)
abstracting: (p36<=p113)
states: 3,928,264 (6)
abstracting: (p117<=p65)
states: 4,028,560 (6)
.........................................................................
EG iterations: 73
abstracting: (p36<=p113)
states: 3,928,264 (6)
abstracting: (p36<=p113)
states: 3,928,264 (6)
........................................
EG iterations: 40
abstracting: (p62<=p42)
states: 3,916,896 (6)
abstracting: (p55<=1)
states: 4,051,732 (6)
-> the formula is TRUE

FORMULA AutonomousCar-PT-02b-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.380sec

checking: [[A [~ [1<=p150] U AG [E [[1<=p113 & p41<=p53] U [p2<=p135 | 1<=p19]]]] & EF [[[AF [1<=p52] & AF [[p46<=0 & p77<=p61]]] | [AX [[p126<=p30 | p9<=p6]] | ~ [AG [p72<=p59]]]]]] | EF [[EF [~ [p115<=p138]] & ~ [AX [[p30<=p1 | p123<=p109]]]]]]
normalized: [E [true U [EX [~ [[p30<=p1 | p123<=p109]]] & E [true U ~ [p115<=p138]]]] | [E [true U [[E [true U ~ [p72<=p59]] | ~ [EX [~ [[p126<=p30 | p9<=p6]]]]] | [~ [EG [~ [[p46<=0 & p77<=p61]]]] & ~ [EG [~ [1<=p52]]]]]] & [~ [EG [E [true U ~ [E [[1<=p113 & p41<=p53] U [p2<=p135 | 1<=p19]]]]]] & ~ [E [E [true U ~ [E [[1<=p113 & p41<=p53] U [p2<=p135 | 1<=p19]]]] U [1<=p150 & E [true U ~ [E [[1<=p113 & p41<=p53] U [p2<=p135 | 1<=p19]]]]]]]]]]

abstracting: (1<=p19)
states: 600
abstracting: (p2<=p135)
states: 4,034,421 (6)
abstracting: (p41<=p53)
states: 3,912,530 (6)
abstracting: (1<=p113)
states: 458,602 (5)
abstracting: (1<=p150)
states: 119,125 (5)
abstracting: (1<=p19)
states: 600
abstracting: (p2<=p135)
states: 4,034,421 (6)
abstracting: (p41<=p53)
states: 3,912,530 (6)
abstracting: (1<=p113)
states: 458,602 (5)
abstracting: (1<=p19)
states: 600
abstracting: (p2<=p135)
states: 4,034,421 (6)
abstracting: (p41<=p53)
states: 3,912,530 (6)
abstracting: (1<=p113)
states: 458,602 (5)
............................................................
EG iterations: 60
abstracting: (1<=p52)
states: 240,152 (5)
........................................
EG iterations: 40
abstracting: (p77<=p61)
states: 3,813,980 (6)
abstracting: (p46<=0)
states: 3,813,980 (6)
........................................
EG iterations: 40
abstracting: (p9<=p6)
states: 3,757,517 (6)
abstracting: (p126<=p30)
states: 3,915,196 (6)
.abstracting: (p72<=p59)
states: 3,912,530 (6)
abstracting: (p115<=p138)
states: 4,048,282 (6)
abstracting: (p123<=p109)
states: 3,385,168 (6)
abstracting: (p30<=p1)
states: 3,913,190 (6)
.-> the formula is FALSE

FORMULA AutonomousCar-PT-02b-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.264sec

totally nodes used: 43818422 (4.4e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 53716416 150006983 203723399
used/not used/entry size/cache size: 63158536 3950328 16 1024MB
basic ops cache: hits/miss/sum: 3106346 8253956 11360302
used/not used/entry size/cache size: 10475598 6301618 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: 38840 119823 158663
used/not used/entry size/cache size: 119060 8269548 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 36003534
1 21306822
2 7430430
3 1908116
4 385226
5 64378
6 9077
7 1128
8 140
9 11
>= 10 2

Total processing time: 1m 4.155sec


BK_STOP 1678395406937

--------------------
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:18188 (93), effective:1668 (8)

initing FirstDep: 0m 0.000sec


iterations count:10538 (54), effective:500 (2)

iterations count:5029 (25), effective:318 (1)

iterations count:8889 (45), effective:444 (2)

iterations count:5785 (29), effective:295 (1)

iterations count:5791 (29), effective:311 (1)

iterations count:10866 (56), effective:606 (3)

iterations count:6746 (34), effective:341 (1)

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

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

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

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

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

iterations count:2423 (12), effective:195 (1)

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

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

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

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

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

iterations count:277 (1), effective:22 (0)

iterations count:538 (2), effective:29 (0)

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

iterations count:228 (1), effective:9 (0)

iterations count:8116 (41), effective:464 (2)

iterations count:10652 (54), effective:538 (2)

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

iterations count:11612 (59), effective:693 (3)

iterations count:8204 (42), effective:493 (2)

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

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

iterations count:7080 (36), effective:382 (1)

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

iterations count:1882 (9), effective:147 (0)

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

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

iterations count:5651 (29), effective:281 (1)

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

iterations count:6181 (31), effective:326 (1)

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

iterations count:589 (3), effective:17 (0)

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

iterations count:589 (3), effective:17 (0)

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

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

iterations count:589 (3), effective:17 (0)

iterations count:4872 (25), effective:288 (1)

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

iterations count:211 (1), effective:4 (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-02b"
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-02b, 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-167813588800553"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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