About the Execution of Marcie for AutonomousCar-PT-04b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
10030.560 | 1943581.00 | 1943020.00 | 9.80 | TFFTFTTFFTTTTTFF | normal |
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-167813588900585.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-04b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r001-oct2-167813588900585
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 5.2K Feb 25 12:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K Feb 25 12:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 12:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 12:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K 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 16K Feb 25 15:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 25 12:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 12:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 12:50 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 110K 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-04b-CTLCardinality-00
FORMULA_NAME AutonomousCar-PT-04b-CTLCardinality-01
FORMULA_NAME AutonomousCar-PT-04b-CTLCardinality-02
FORMULA_NAME AutonomousCar-PT-04b-CTLCardinality-03
FORMULA_NAME AutonomousCar-PT-04b-CTLCardinality-04
FORMULA_NAME AutonomousCar-PT-04b-CTLCardinality-05
FORMULA_NAME AutonomousCar-PT-04b-CTLCardinality-06
FORMULA_NAME AutonomousCar-PT-04b-CTLCardinality-07
FORMULA_NAME AutonomousCar-PT-04b-CTLCardinality-08
FORMULA_NAME AutonomousCar-PT-04b-CTLCardinality-09
FORMULA_NAME AutonomousCar-PT-04b-CTLCardinality-10
FORMULA_NAME AutonomousCar-PT-04b-CTLCardinality-11
FORMULA_NAME AutonomousCar-PT-04b-CTLCardinality-12
FORMULA_NAME AutonomousCar-PT-04b-CTLCardinality-13
FORMULA_NAME AutonomousCar-PT-04b-CTLCardinality-14
FORMULA_NAME AutonomousCar-PT-04b-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678395385303
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-04b
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_04b
(NrP: 221 NrTr: 368 NrArc: 1658)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.008sec
net check time: 0m 0.000sec
init dd package: 0m 2.971sec
RS generation: 0m 5.514sec
-> reachability set: #nodes 39062 (3.9e+04) #states 4,906,165,480 (9)
starting MCC model checker
--------------------------
checking: AG [AF [EX [p148<=0]]]
normalized: ~ [E [true U EG [~ [EX [p148<=0]]]]]
abstracting: (p148<=0)
states: 4,728,339,602 (9)
...
EG iterations: 2
-> the formula is FALSE
FORMULA AutonomousCar-PT-04b-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m12.175sec
checking: EG [EF [AX [AF [~ [1<=p151]]]]]
normalized: EG [E [true U ~ [EX [EG [1<=p151]]]]]
abstracting: (1<=p151)
states: 41,400 (4)
.................................
EG iterations: 33
.
EG iterations: 0
-> the formula is TRUE
FORMULA AutonomousCar-PT-04b-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 5.970sec
checking: AG [EF [[p81<=1 & 1<=p21]]]
normalized: ~ [E [true U ~ [E [true U [p81<=1 & 1<=p21]]]]]
abstracting: (1<=p21)
states: 600
abstracting: (p81<=1)
states: 4,906,165,480 (9)
-> the formula is FALSE
FORMULA AutonomousCar-PT-04b-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.076sec
checking: EG [p204<=p32]
normalized: EG [p204<=p32]
abstracting: (p204<=p32)
states: 4,762,214,116 (9)
.
EG iterations: 1
-> the formula is TRUE
FORMULA AutonomousCar-PT-04b-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.981sec
checking: EX [AF [~ [p20<=p92]]]
normalized: EX [~ [EG [p20<=p92]]]
abstracting: (p20<=p92)
states: 4,906,164,880 (9)
..............................
EG iterations: 30
.-> the formula is TRUE
FORMULA AutonomousCar-PT-04b-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.370sec
checking: [~ [EX [AG [AG [AG [p159<=1]]]]] & EG [AG [~ [1<=p5]]]]
normalized: [EG [~ [E [true U 1<=p5]]] & ~ [EX [~ [E [true U E [true U E [true U ~ [p159<=1]]]]]]]]
abstracting: (p159<=1)
states: 4,906,165,480 (9)
.abstracting: (1<=p5)
states: 512,668,712 (8)
.
EG iterations: 1
-> the formula is FALSE
FORMULA AutonomousCar-PT-04b-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 5.735sec
checking: ~ [AG [E [1<=p89 U AF [AX [1<=p194]]]]]
normalized: E [true U ~ [E [1<=p89 U ~ [EG [EX [~ [1<=p194]]]]]]]
abstracting: (1<=p194)
states: 1,040,242,523 (9)
.........................
before gc: list nodes free: 1628390
after gc: idd nodes used:853043, unused:63146957; list nodes free:285590297
.........................................................................................
before gc: list nodes free: 1467804
after gc: idd nodes used:357480, unused:63642520; list nodes free:292007836
...................................................
EG iterations: 164
abstracting: (1<=p89)
states: 38,400 (4)
-> the formula is TRUE
FORMULA AutonomousCar-PT-04b-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 4m39.984sec
checking: AX [~ [E [p194<=1 U ~ [AF [1<=p87]]]]]
normalized: ~ [EX [E [p194<=1 U EG [~ [1<=p87]]]]]
abstracting: (1<=p87)
states: 256,428,068 (8)
...........................................................
EG iterations: 59
abstracting: (p194<=1)
states: 4,906,165,480 (9)
.-> the formula is FALSE
FORMULA AutonomousCar-PT-04b-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m37.894sec
checking: EG [AF [[EG [p114<=p83] & AF [~ [E [1<=p12 U 1<=p209]]]]]]
normalized: EG [~ [EG [~ [[~ [EG [E [1<=p12 U 1<=p209]]] & EG [p114<=p83]]]]]]
abstracting: (p114<=p83)
states: 4,734,452,898 (9)
............................................
before gc: list nodes free: 1359470
after gc: idd nodes used:276071, unused:63723929; list nodes free:292361300
.....................
EG iterations: 65
abstracting: (1<=p209)
states: 147,893,472 (8)
abstracting: (1<=p12)
states: 256,334,356 (8)
..............................................................................................................................................................................................
EG iterations: 190
........
before gc: list nodes free: 3524917
after gc: idd nodes used:301168, unused:63698832; list nodes free:292288876
..........................................................
EG iterations: 66
.
EG iterations: 1
-> the formula is TRUE
FORMULA AutonomousCar-PT-04b-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 5m 1.866sec
checking: AX [EG [E [AG [p56<=1] U [[1<=p2 | p200<=0] | p92<=p148]]]]
normalized: ~ [EX [~ [EG [E [~ [E [true U ~ [p56<=1]]] U [p92<=p148 | [1<=p2 | p200<=0]]]]]]]
abstracting: (p200<=0)
states: 4,758,272,008 (9)
abstracting: (1<=p2)
states: 7,061,671 (6)
abstracting: (p92<=p148)
states: 4,734,452,898 (9)
abstracting: (p56<=1)
states: 4,906,165,480 (9)
EG iterations: 0
.-> the formula is TRUE
FORMULA AutonomousCar-PT-04b-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 3.640sec
checking: ~ [E [A [AG [EF [p9<=1]] U A [[EG [p33<=1] | ~ [1<=p207]] U EF [p65<=p67]]] U ~ [EX [p48<=0]]]]
normalized: ~ [E [[~ [EG [~ [[~ [EG [~ [E [true U p65<=p67]]]] & ~ [E [~ [E [true U p65<=p67]] U [~ [[~ [1<=p207] | EG [p33<=1]]] & ~ [E [true U p65<=p67]]]]]]]]] & ~ [E [~ [[~ [EG [~ [E [true U p65<=p67]]]] & ~ [E [~ [E [true U p65<=p67]] U [~ [[~ [1<=p207] | EG [p33<=1]]] & ~ [E [true U p65<=p67]]]]]]] U [E [true U ~ [E [true U p9<=1]]] & ~ [[~ [EG [~ [E [true U p65<=p67]]]] & ~ [E [~ [E [true U p65<=p67]] U [~ [[~ [1<=p207] | EG [p33<=1]]] & ~ [E [true U p65<=p67]]]]]]]]]]] U ~ [EX [p48<=0]]]]
abstracting: (p48<=0)
states: 4,795,129,438 (9)
.abstracting: (p65<=p67)
states: 4,728,339,602 (9)
abstracting: (p33<=1)
states: 4,906,165,480 (9)
EG iterations: 0
abstracting: (1<=p207)
states: 147,893,472 (8)
abstracting: (p65<=p67)
states: 4,728,339,602 (9)
abstracting: (p65<=p67)
states: 4,728,339,602 (9)
.
EG iterations: 1
abstracting: (p9<=1)
states: 4,906,165,480 (9)
abstracting: (p65<=p67)
states: 4,728,339,602 (9)
abstracting: (p33<=1)
states: 4,906,165,480 (9)
EG iterations: 0
abstracting: (1<=p207)
states: 147,893,472 (8)
abstracting: (p65<=p67)
states: 4,728,339,602 (9)
abstracting: (p65<=p67)
states: 4,728,339,602 (9)
.
EG iterations: 1
abstracting: (p65<=p67)
states: 4,728,339,602 (9)
abstracting: (p33<=1)
states: 4,906,165,480 (9)
EG iterations: 0
abstracting: (1<=p207)
states: 147,893,472 (8)
abstracting: (p65<=p67)
states: 4,728,339,602 (9)
abstracting: (p65<=p67)
states: 4,728,339,602 (9)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE
FORMULA AutonomousCar-PT-04b-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m11.868sec
checking: EF [~ [EF [[EG [EG [p111<=p111]] & E [E [1<=p100 U p184<=0] U AF [p182<=p88]]]]]]
normalized: E [true U ~ [E [true U [E [E [1<=p100 U p184<=0] U ~ [EG [~ [p182<=p88]]]] & EG [EG [p111<=p111]]]]]]
abstracting: (p111<=p111)
states: 4,906,165,480 (9)
EG iterations: 0
EG iterations: 0
abstracting: (p182<=p88)
states: 4,864,807,881 (9)
...........................................................................................................................................................................
EG iterations: 171
abstracting: (p184<=0)
states: 4,864,806,601 (9)
abstracting: (1<=p100)
states: 177,825,878 (8)
-> the formula is FALSE
FORMULA AutonomousCar-PT-04b-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 1m33.145sec
checking: [[EG [p192<=p17] & AG [[EX [[E [p157<=p182 U 1<=p25] | ~ [p26<=0]]] & p107<=0]]] & EG [EG [[AX [AX [p217<=p26]] & [EX [p68<=1] & p203<=p207]]]]]
normalized: [EG [EG [[[p203<=p207 & EX [p68<=1]] & ~ [EX [EX [~ [p217<=p26]]]]]]] & [~ [E [true U ~ [[p107<=0 & EX [[~ [p26<=0] | E [p157<=p182 U 1<=p25]]]]]]] & EG [p192<=p17]]]
abstracting: (p192<=p17)
states: 4,708,974,184 (9)
.
EG iterations: 1
abstracting: (1<=p25)
states: 600
abstracting: (p157<=p182)
states: 4,868,107,104 (9)
abstracting: (p26<=0)
states: 4,906,163,080 (9)
.abstracting: (p107<=0)
states: 4,728,339,602 (9)
abstracting: (p217<=p26)
states: 4,906,165,480 (9)
..abstracting: (p68<=1)
states: 4,906,165,480 (9)
.abstracting: (p203<=p207)
states: 4,758,272,008 (9)
.....
before gc: list nodes free: 4560080
after gc: idd nodes used:470200, unused:63529800; list nodes free:291529078
..........................
before gc: list nodes free: 5198209
after gc: idd nodes used:820872, unused:63179128; list nodes free:289992664
.....................................................................................
before gc: list nodes free: 1456677
after gc: idd nodes used:503763, unused:63496237; list nodes free:291378813
..................................................
EG iterations: 166
.
EG iterations: 1
-> the formula is FALSE
FORMULA AutonomousCar-PT-04b-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 7m15.212sec
checking: E [[[[p169<=0 | p35<=p41] & [AF [~ [E [1<=p182 U 1<=p30]]] | [AF [[p145<=p51 & 1<=p119]] | EG [[p174<=0 | p197<=1]]]]] & AG [[~ [p53<=1] | AG [[1<=p203 | p203<=p195]]]]] U EX [E [p36<=1 U EF [~ [p176<=0]]]]]
normalized: E [[~ [E [true U ~ [[~ [E [true U ~ [[1<=p203 | p203<=p195]]]] | ~ [p53<=1]]]]] & [[[EG [[p174<=0 | p197<=1]] | ~ [EG [~ [[p145<=p51 & 1<=p119]]]]] | ~ [EG [E [1<=p182 U 1<=p30]]]] & [p169<=0 | p35<=p41]]] U EX [E [p36<=1 U E [true U ~ [p176<=0]]]]]
abstracting: (p176<=0)
states: 4,513,212,676 (9)
abstracting: (p36<=1)
states: 4,906,165,480 (9)
.abstracting: (p35<=p41)
states: 4,728,339,602 (9)
abstracting: (p169<=0)
states: 4,868,107,104 (9)
abstracting: (1<=p30)
states: 177,825,878 (8)
abstracting: (1<=p182)
states: 41,358,879 (7)
......................................................................
EG iterations: 70
abstracting: (1<=p119)
states: 40,800 (4)
abstracting: (p145<=p51)
states: 4,738,395,708 (9)
............................................
EG iterations: 44
abstracting: (p197<=1)
states: 4,906,165,480 (9)
abstracting: (p174<=0)
states: 4,513,212,676 (9)
EG iterations: 0
abstracting: (p53<=1)
states: 4,906,165,480 (9)
abstracting: (p203<=p195)
states: 4,807,569,832 (9)
abstracting: (1<=p203)
states: 147,893,472 (8)
-> the formula is TRUE
FORMULA AutonomousCar-PT-04b-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 1m52.597sec
checking: EG [[[AF [~ [AG [p16<=p2]]] & AF [AF [AX [1<=p192]]]] | [AG [[[A [p174<=p203 U p101<=1] & [p202<=1 & p48<=0]] | p137<=p1]] | [[[p124<=p217 | AX [p93<=p49]] & EF [EF [p207<=0]]] & AG [1<=p219]]]]]
normalized: EG [[[[~ [E [true U ~ [1<=p219]]] & [E [true U E [true U p207<=0]] & [p124<=p217 | ~ [EX [~ [p93<=p49]]]]]] | ~ [E [true U ~ [[p137<=p1 | [[p202<=1 & p48<=0] & [~ [EG [~ [p101<=1]]] & ~ [E [~ [p101<=1] U [~ [p174<=p203] & ~ [p101<=1]]]]]]]]]]] | [~ [EG [EG [EX [~ [1<=p192]]]]] & ~ [EG [~ [E [true U ~ [p16<=p2]]]]]]]]
abstracting: (p16<=p2)
states: 3,998,778,940 (9)
.
EG iterations: 1
abstracting: (1<=p192)
states: 197,191,296 (8)
.....
before gc: list nodes free: 4601392
after gc: idd nodes used:573882, unused:63426118; list nodes free:291071880
............................
before gc: list nodes free: 4664345
after gc: idd nodes used:864120, unused:63135880; list nodes free:289769785
.................................................................................................................................
before gc: list nodes free: 842483
after gc: idd nodes used:533813, unused:63466187; list nodes free:291242832
....
EG iterations: 165
.
EG iterations: 1
abstracting: (p101<=1)
states: 4,906,165,480 (9)
abstracting: (p174<=p203)
states: 4,526,287,192 (9)
abstracting: (p101<=1)
states: 4,906,165,480 (9)
abstracting: (p101<=1)
states: 4,906,165,480 (9)
.
EG iterations: 1
abstracting: (p48<=0)
states: 4,795,129,438 (9)
abstracting: (p202<=1)
states: 4,906,165,480 (9)
abstracting: (p137<=p1)
states: 4,786,504,558 (9)
abstracting: (p93<=p49)
states: 4,791,332,212 (9)
.abstracting: (p124<=p217)
states: 4,786,504,558 (9)
abstracting: (p207<=0)
states: 4,758,272,008 (9)
abstracting: (1<=p219)
states: 206,794,395 (8)
EG iterations: 0
-> the formula is TRUE
FORMULA AutonomousCar-PT-04b-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 6m51.307sec
checking: [EF [[[p184<=p215 | ~ [AF [[p81<=p41 | 1<=p90]]]] & [EG [[[1<=p56 | p42<=1] & [1<=p91 | 1<=p135]]] | AX [A [p73<=p189 U 1<=p30]]]]] & [AX [[[[AX [1<=p105] | ~ [1<=p140]] | ~ [[~ [p161<=1] | ~ [1<=p10]]]] & p16<=0]] | EF [EX [EG [A [p118<=p1 U p77<=p110]]]]]]
normalized: [[E [true U EX [EG [[~ [EG [~ [p77<=p110]]] & ~ [E [~ [p77<=p110] U [~ [p118<=p1] & ~ [p77<=p110]]]]]]]] | ~ [EX [~ [[p16<=0 & [~ [[~ [1<=p10] | ~ [p161<=1]]] | [~ [1<=p140] | ~ [EX [~ [1<=p105]]]]]]]]]] & E [true U [[~ [EX [~ [[~ [EG [~ [1<=p30]]] & ~ [E [~ [1<=p30] U [~ [p73<=p189] & ~ [1<=p30]]]]]]]] | EG [[[1<=p91 | 1<=p135] & [1<=p56 | p42<=1]]]] & [p184<=p215 | EG [~ [[p81<=p41 | 1<=p90]]]]]]]
abstracting: (1<=p90)
states: 40,800 (4)
abstracting: (p81<=p41)
states: 4,659,831,918 (9)
......................................................
EG iterations: 54
abstracting: (p184<=p215)
states: 4,864,806,601 (9)
abstracting: (p42<=1)
states: 4,906,165,480 (9)
abstracting: (1<=p56)
states: 256,428,068 (8)
abstracting: (1<=p135)
states: 177,825,878 (8)
abstracting: (1<=p91)
states: 177,825,878 (8)
.................................................................
EG iterations: 65
abstracting: (1<=p30)
states: 177,825,878 (8)
abstracting: (p73<=p189)
states: 4,757,442,122 (9)
abstracting: (1<=p30)
states: 177,825,878 (8)
abstracting: (1<=p30)
states: 177,825,878 (8)
.
EG iterations: 1
.abstracting: (1<=p105)
states: 177,825,878 (8)
.abstracting: (1<=p140)
states: 119,660,922 (8)
abstracting: (p161<=1)
states: 4,906,165,480 (9)
abstracting: (1<=p10)
states: 256,334,356 (8)
abstracting: (p16<=0)
states: 3,998,778,940 (9)
.abstracting: (p77<=p110)
states: 4,733,167,256 (9)
abstracting: (p118<=p1)
states: 4,650,062,612 (9)
abstracting: (p77<=p110)
states: 4,733,167,256 (9)
abstracting: (p77<=p110)
states: 4,733,167,256 (9)
.............
before gc: list nodes free: 5525098
after gc: idd nodes used:689582, unused:63310418; list nodes free:290539870
....................................................
EG iterations: 65
.
EG iterations: 1
.-> the formula is TRUE
FORMULA AutonomousCar-PT-04b-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 3m35.589sec
totally nodes used: 716064434 (7.2e+08)
number of garbage collections: 11
fire ops cache: hits/miss/sum: 1065160696 2894405352 3959566048
used/not used/entry size/cache size: 47763393 19345471 16 1024MB
basic ops cache: hits/miss/sum: 43022736 95262846 138285582
used/not used/entry size/cache size: 3897490 12879726 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: 248160 754062 1002222
used/not used/entry size/cache size: 0 8388608 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 52638157
1 11382898
2 2461353
3 520117
4 91232
5 13276
6 1658
7 167
8 6
9 0
>= 10 0
Total processing time: 32m23.448sec
BK_STOP 1678397328884
--------------------
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.001sec
41155 39543
iterations count:238444 (647), effective:11611 (31)
initing FirstDep: 0m 0.001sec
iterations count:38479 (104), effective:1819 (4)
iterations count:368 (1), effective:0 (0)
iterations count:388 (1), effective:8 (0)
iterations count:392 (1), effective:9 (0)
iterations count:46919 (127), effective:2419 (6)
iterations count:416 (1), effective:9 (0)
iterations count:46049 (125), effective:2165 (5)
iterations count:27947 (75), effective:814 (2)
iterations count:490 (1), effective:30 (0)
iterations count:370 (1), effective:1 (0)
iterations count:505 (1), effective:1 (0)
iterations count:505 (1), effective:1 (0)
iterations count:505 (1), effective:1 (0)
iterations count:368 (1), effective:0 (0)
iterations count:505 (1), effective:1 (0)
iterations count:505 (1), effective:1 (0)
iterations count:505 (1), effective:1 (0)
iterations count:505 (1), effective:1 (0)
iterations count:505 (1), effective:1 (0)
iterations count:505 (1), effective:1 (0)
iterations count:38479 (104), effective:1819 (4)
iterations count:390 (1), effective:1 (0)
iterations count:368 (1), effective:0 (0)
iterations count:368 (1), effective:0 (0)
iterations count:380 (1), effective:4 (0)
iterations count:390 (1), effective:8 (0)
iterations count:49312 (134), effective:2478 (6)
iterations count:368 (1), effective:0 (0)
iterations count:23206 (63), effective:562 (1)
iterations count:368 (1), effective:0 (0)
iterations count:44141 (119), effective:2255 (6)
iterations count:36844 (100), effective:1784 (4)
iterations count:368 (1), effective:0 (0)
iterations count:370 (1), effective:1 (0)
iterations count:27656 (75), effective:802 (2)
iterations count:38067 (103), effective:1488 (4)
iterations count:4601 (12), effective:93 (0)
iterations count:368 (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="AutonomousCar-PT-04b"
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-04b, 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-167813588900585"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-04b.tgz
mv AutonomousCar-PT-04b 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 '
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 ;