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.r257-smll-167863532700417.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marcie
Input is Parking-PT-208, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r257-smll-167863532700417
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 6.1K Feb 26 14:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 26 14:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 26 14:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 26 14:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Feb 26 15:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 15:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 26 15:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Feb 26 15:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 49K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Parking-PT-208-CTLCardinality-00
FORMULA_NAME Parking-PT-208-CTLCardinality-01
FORMULA_NAME Parking-PT-208-CTLCardinality-02
FORMULA_NAME Parking-PT-208-CTLCardinality-03
FORMULA_NAME Parking-PT-208-CTLCardinality-04
FORMULA_NAME Parking-PT-208-CTLCardinality-05
FORMULA_NAME Parking-PT-208-CTLCardinality-06
FORMULA_NAME Parking-PT-208-CTLCardinality-07
FORMULA_NAME Parking-PT-208-CTLCardinality-08
FORMULA_NAME Parking-PT-208-CTLCardinality-09
FORMULA_NAME Parking-PT-208-CTLCardinality-10
FORMULA_NAME Parking-PT-208-CTLCardinality-11
FORMULA_NAME Parking-PT-208-CTLCardinality-12
FORMULA_NAME Parking-PT-208-CTLCardinality-13
FORMULA_NAME Parking-PT-208-CTLCardinality-14
FORMULA_NAME Parking-PT-208-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678842037993

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=Parking-PT-208
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: Parking_PT_208
(NrP: 137 NrTr: 201 NrArc: 593)

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

net check time: 0m 0.000sec

init dd package: 0m 3.344sec


RS generation: 0m 0.092sec


-> reachability set: #nodes 1406 (1.4e+03) #states 4,567,597,057 (9)



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

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

abstracting: (1<=p104)
states: 103,809,024 (8)
.-> the formula is FALSE

FORMULA Parking-PT-208-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.256sec

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

abstracting: (p111<=1)
states: 4,567,597,057 (9)

EG iterations: 0
-> the formula is FALSE

FORMULA Parking-PT-208-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[EX [1<=p96] & EG [~ [AX [[1<=p114 | p26<=1]]]]]]
normalized: E [true U [EG [EX [~ [[1<=p114 | p26<=1]]]] & EX [1<=p96]]]

abstracting: (1<=p96)
states: 103,809,024 (8)
.abstracting: (p26<=1)
states: 4,567,597,057 (9)
abstracting: (1<=p114)
states: 69,206,016 (7)
..
EG iterations: 1
-> the formula is FALSE

FORMULA Parking-PT-208-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.033sec

checking: AF [EG [E [1<=p99 U AG [AG [p99<=p65]]]]]
normalized: ~ [EG [~ [EG [E [1<=p99 U ~ [E [true U E [true U ~ [p99<=p65]]]]]]]]]

abstracting: (p99<=p65)
states: 4,500,488,193 (9)
abstracting: (1<=p99)
states: 69,206,016 (7)
.
EG iterations: 1
........................................
EG iterations: 40
-> the formula is FALSE

FORMULA Parking-PT-208-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.169sec

checking: EG [A [EG [[EG [1<=p69] & AG [p105<=0]]] U p120<=p115]]
normalized: EG [[~ [E [~ [p120<=p115] U [~ [EG [[EG [1<=p69] & ~ [E [true U ~ [p105<=0]]]]]] & ~ [p120<=p115]]]] & ~ [EG [~ [p120<=p115]]]]]

abstracting: (p120<=p115)
states: 4,429,185,025 (9)
.
EG iterations: 1
abstracting: (p120<=p115)
states: 4,429,185,025 (9)
abstracting: (p105<=0)
states: 4,498,391,041 (9)
abstracting: (1<=p69)
states: 1,384,120,320 (9)
.....................................
EG iterations: 37
.
EG iterations: 1
abstracting: (p120<=p115)
states: 4,429,185,025 (9)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Parking-PT-208-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.437sec

checking: AF [EF [[EX [1<=p128] & EF [~ [A [p124<=0 U p66<=p128]]]]]]
normalized: ~ [EG [~ [E [true U [E [true U ~ [[~ [EG [~ [p66<=p128]]] & ~ [E [~ [p66<=p128] U [~ [p66<=p128] & ~ [p124<=0]]]]]]] & EX [1<=p128]]]]]]

abstracting: (1<=p128)
states: 138,412,032 (8)
.abstracting: (p124<=0)
states: 4,429,185,025 (9)
abstracting: (p66<=p128)
states: 272,629,761 (8)
abstracting: (p66<=p128)
states: 272,629,761 (8)
abstracting: (p66<=p128)
states: 272,629,761 (8)
.......................................
EG iterations: 39
.
EG iterations: 1
-> the formula is TRUE

FORMULA Parking-PT-208-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.825sec

checking: E [p88<=p79 U ~ [AG [[p67<=p99 & p97<=0]]]]
normalized: E [p88<=p79 U E [true U ~ [[p67<=p99 & p97<=0]]]]

abstracting: (p97<=0)
states: 4,463,788,033 (9)
abstracting: (p67<=p99)
states: 3,613,392,897 (9)
abstracting: (p88<=p79)
states: 4,515,692,545 (9)
-> the formula is TRUE

FORMULA Parking-PT-208-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.287sec

checking: AF [[EX [AF [[~ [1<=p133] & p98<=p101]]] & A [AF [p103<=p136] U 1<=p81]]]
normalized: ~ [EG [~ [[[~ [EG [~ [1<=p81]]] & ~ [E [~ [1<=p81] U [EG [~ [p103<=p136]] & ~ [1<=p81]]]]] & EX [~ [EG [~ [[p98<=p101 & ~ [1<=p133]]]]]]]]]]

abstracting: (1<=p133)
states: 968,884,224 (8)
abstracting: (p98<=p101)
states: 4,463,788,033 (9)
...................................................
EG iterations: 51
.abstracting: (1<=p81)
states: 2,283,798,528 (9)
abstracting: (p103<=p136)
states: 4,498,391,041 (9)
...................................
EG iterations: 35
abstracting: (1<=p81)
states: 2,283,798,528 (9)
abstracting: (1<=p81)
states: 2,283,798,528 (9)
....................................................
EG iterations: 52
....................
EG iterations: 20
-> the formula is FALSE

FORMULA Parking-PT-208-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.484sec

checking: ~ [[EG [EF [[p5<=p67 & ~ [[p46<=1 & p48<=p88]]]]] | AG [EX [EX [A [1<=p84 U p126<=1]]]]]]
normalized: ~ [[EG [E [true U [~ [[p46<=1 & p48<=p88]] & p5<=p67]]] | ~ [E [true U ~ [EX [EX [[~ [E [~ [p126<=1] U [~ [p126<=1] & ~ [1<=p84]]]] & ~ [EG [~ [p126<=1]]]]]]]]]]]

abstracting: (p126<=1)
states: 4,567,597,057 (9)
.
EG iterations: 1
abstracting: (1<=p84)
states: 2,283,798,528 (9)
abstracting: (p126<=1)
states: 4,567,597,057 (9)
abstracting: (p126<=1)
states: 4,567,597,057 (9)
..abstracting: (p5<=p67)
states: 2,768,240,641 (9)
abstracting: (p48<=p88)
states: 4,499,963,905 (9)
abstracting: (p46<=1)
states: 4,567,597,057 (9)
.......................................
EG iterations: 39
-> the formula is FALSE

FORMULA Parking-PT-208-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.271sec

checking: E [AX [AG [~ [1<=p84]]] U ~ [[1<=p122 | EG [[A [p50<=p12 U p88<=p78] | AX [p84<=1]]]]]]
normalized: E [~ [EX [E [true U 1<=p84]]] U ~ [[1<=p122 | EG [[[~ [EG [~ [p88<=p78]]] & ~ [E [~ [p88<=p78] U [~ [p50<=p12] & ~ [p88<=p78]]]]] | ~ [EX [~ [p84<=1]]]]]]]]

abstracting: (p84<=1)
states: 4,567,597,057 (9)
.abstracting: (p88<=p78)
states: 4,515,692,545 (9)
abstracting: (p50<=p12)
states: 4,498,391,041 (9)
abstracting: (p88<=p78)
states: 4,515,692,545 (9)
abstracting: (p88<=p78)
states: 4,515,692,545 (9)
.
EG iterations: 1

EG iterations: 0
abstracting: (1<=p122)
states: 138,412,032 (8)
abstracting: (1<=p84)
states: 2,283,798,528 (9)
.-> the formula is FALSE

FORMULA Parking-PT-208-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.196sec

checking: A [~ [1<=p49] U [~ [[~ [[EG [p123<=1] | p35<=p17]] | [AG [EX [p41<=p72]] | ~ [AF [p78<=p51]]]]] & p79<=1]]
normalized: [~ [EG [~ [[p79<=1 & ~ [[[EG [~ [p78<=p51]] | ~ [E [true U ~ [EX [p41<=p72]]]]] | ~ [[p35<=p17 | EG [p123<=1]]]]]]]]] & ~ [E [~ [[p79<=1 & ~ [[[EG [~ [p78<=p51]] | ~ [E [true U ~ [EX [p41<=p72]]]]] | ~ [[p35<=p17 | EG [p123<=1]]]]]]] U [1<=p49 & ~ [[p79<=1 & ~ [[[EG [~ [p78<=p51]] | ~ [E [true U ~ [EX [p41<=p72]]]]] | ~ [[p35<=p17 | EG [p123<=1]]]]]]]]]]]

abstracting: (p123<=1)
states: 4,567,597,057 (9)

EG iterations: 0
abstracting: (p35<=p17)
states: 4,498,391,041 (9)
abstracting: (p41<=p72)
states: 4,532,994,049 (9)
.abstracting: (p78<=p51)
states: 2,353,004,545 (9)
..........................................................
EG iterations: 58
abstracting: (p79<=1)
states: 4,567,597,057 (9)
abstracting: (1<=p49)
states: 69,206,016 (7)
abstracting: (p123<=1)
states: 4,567,597,057 (9)

EG iterations: 0
abstracting: (p35<=p17)
states: 4,498,391,041 (9)
abstracting: (p41<=p72)
states: 4,532,994,049 (9)
.abstracting: (p78<=p51)
states: 2,353,004,545 (9)
..........................................................
EG iterations: 58
abstracting: (p79<=1)
states: 4,567,597,057 (9)
abstracting: (p123<=1)
states: 4,567,597,057 (9)

EG iterations: 0
abstracting: (p35<=p17)
states: 4,498,391,041 (9)
abstracting: (p41<=p72)
states: 4,532,994,049 (9)
.abstracting: (p78<=p51)
states: 2,353,004,545 (9)
..........................................................
EG iterations: 58
abstracting: (p79<=1)
states: 4,567,597,057 (9)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Parking-PT-208-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.515sec

checking: AG [E [AG [[[p120<=p115 | ~ [p29<=p76]] & p38<=p24]] U [p122<=p54 & AF [EG [1<=p80]]]]]
normalized: ~ [E [true U ~ [E [~ [E [true U ~ [[p38<=p24 & [p120<=p115 | ~ [p29<=p76]]]]]] U [p122<=p54 & ~ [EG [~ [EG [1<=p80]]]]]]]]]

abstracting: (1<=p80)
states: 2,283,798,528 (9)
...............................................
EG iterations: 47
..
EG iterations: 2
abstracting: (p122<=p54)
states: 4,433,379,329 (9)
abstracting: (p29<=p76)
states: 4,515,692,545 (9)
abstracting: (p120<=p115)
states: 4,429,185,025 (9)
abstracting: (p38<=p24)
states: 4,463,788,033 (9)
-> the formula is FALSE

FORMULA Parking-PT-208-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.101sec

checking: AF [[[EG [[A [1<=p1 U p44<=p122] & [[p102<=p11 & p130<=p16] | ~ [p117<=p131]]]] | EG [~ [A [p51<=p78 U 1<=p100]]]] & EG [1<=p115]]]
normalized: ~ [EG [~ [[[EG [~ [[~ [E [~ [1<=p100] U [~ [1<=p100] & ~ [p51<=p78]]]] & ~ [EG [~ [1<=p100]]]]]] | EG [[[~ [EG [~ [p44<=p122]]] & ~ [E [~ [p44<=p122] U [~ [p44<=p122] & ~ [1<=p1]]]]] & [~ [p117<=p131] | [p102<=p11 & p130<=p16]]]]] & EG [1<=p115]]]]]

abstracting: (1<=p115)
states: 69,206,016 (7)
....................................
EG iterations: 36
abstracting: (p130<=p16)
states: 3,045,064,705 (9)
abstracting: (p102<=p11)
states: 2,664,431,617 (9)
abstracting: (p117<=p131)
states: 4,429,185,025 (9)
abstracting: (1<=p1)
states: 2,283,798,528 (9)
abstracting: (p44<=p122)
states: 809,500,673 (8)
abstracting: (p44<=p122)
states: 809,500,673 (8)
abstracting: (p44<=p122)
states: 809,500,673 (8)
.
EG iterations: 1
.....................................
EG iterations: 37
abstracting: (1<=p100)
states: 138,412,032 (8)
.....................................
EG iterations: 37
abstracting: (p51<=p78)
states: 4,498,391,041 (9)
abstracting: (1<=p100)
states: 138,412,032 (8)
abstracting: (1<=p100)
states: 138,412,032 (8)
.........................
EG iterations: 25
.
EG iterations: 1
-> the formula is FALSE

FORMULA Parking-PT-208-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.830sec

checking: E [[[EF [EX [p75<=p18]] & [~ [EF [~ [p127<=p54]]] | AF [EG [p57<=p1]]]] & EG [E [~ [AG [1<=p9]] U ~ [AG [p24<=1]]]]] U EF [[~ [[p130<=1 | [~ [1<=p78] & AG [1<=p136]]]] & A [EG [p86<=1] U [A [p77<=p53 U 1<=p83] & [p71<=1 & p79<=p46]]]]]]
normalized: E [[EG [E [E [true U ~ [1<=p9]] U E [true U ~ [p24<=1]]]] & [[~ [EG [~ [EG [p57<=p1]]]] | ~ [E [true U ~ [p127<=p54]]]] & E [true U EX [p75<=p18]]]] U E [true U [[~ [EG [~ [[[p71<=1 & p79<=p46] & [~ [EG [~ [1<=p83]]] & ~ [E [~ [1<=p83] U [~ [p77<=p53] & ~ [1<=p83]]]]]]]]] & ~ [E [~ [[[p71<=1 & p79<=p46] & [~ [EG [~ [1<=p83]]] & ~ [E [~ [1<=p83] U [~ [p77<=p53] & ~ [1<=p83]]]]]]] U [~ [EG [p86<=1]] & ~ [[[p71<=1 & p79<=p46] & [~ [EG [~ [1<=p83]]] & ~ [E [~ [1<=p83] U [~ [p77<=p53] & ~ [1<=p83]]]]]]]]]]] & ~ [[p130<=1 | [~ [E [true U ~ [1<=p136]]] & ~ [1<=p78]]]]]]]

abstracting: (1<=p78)
states: 2,283,798,528 (9)
abstracting: (1<=p136)
states: 1,384,120,320 (9)
abstracting: (p130<=1)
states: 4,567,597,057 (9)
abstracting: (1<=p83)
states: 2,283,798,528 (9)
abstracting: (p77<=p53)
states: 2,353,004,545 (9)
abstracting: (1<=p83)
states: 2,283,798,528 (9)
abstracting: (1<=p83)
states: 2,283,798,528 (9)
...............................................
EG iterations: 47
abstracting: (p79<=p46)
states: 2,335,703,041 (9)
abstracting: (p71<=1)
states: 4,567,597,057 (9)
abstracting: (p86<=1)
states: 4,567,597,057 (9)

EG iterations: 0
abstracting: (1<=p83)
states: 2,283,798,528 (9)
abstracting: (p77<=p53)
states: 2,353,004,545 (9)
abstracting: (1<=p83)
states: 2,283,798,528 (9)
abstracting: (1<=p83)
states: 2,283,798,528 (9)
...............................................
EG iterations: 47
abstracting: (p79<=p46)
states: 2,335,703,041 (9)
abstracting: (p71<=1)
states: 4,567,597,057 (9)
abstracting: (1<=p83)
states: 2,283,798,528 (9)
abstracting: (p77<=p53)
states: 2,353,004,545 (9)
abstracting: (1<=p83)
states: 2,283,798,528 (9)
abstracting: (1<=p83)
states: 2,283,798,528 (9)
...............................................
EG iterations: 47
abstracting: (p79<=p46)
states: 2,335,703,041 (9)
abstracting: (p71<=1)
states: 4,567,597,057 (9)
...................................
EG iterations: 35
abstracting: (p75<=p18)
states: 3,425,697,793 (9)
.abstracting: (p127<=p54)
states: 4,433,379,329 (9)
abstracting: (p57<=p1)
states: 4,498,391,041 (9)
..............................
EG iterations: 30
....................................
EG iterations: 36
abstracting: (p24<=1)
states: 4,567,597,057 (9)
abstracting: (1<=p9)
states: 2,283,798,528 (9)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Parking-PT-208-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.529sec

checking: A [E [[AF [1<=p68] & A [AF [p50<=p67] U p87<=p133]] U [[AX [EX [p60<=1]] & [AF [p133<=1] | [[p16<=p41 | p0<=p90] & AG [1<=p125]]]] | AX [[[p54<=1 & 1<=p15] & EX [1<=p97]]]]] U EX [[AF [p7<=p75] & ~ [EG [p7<=p71]]]]]
normalized: [~ [EG [~ [EX [[~ [EG [p7<=p71]] & ~ [EG [~ [p7<=p75]]]]]]]] & ~ [E [~ [EX [[~ [EG [p7<=p71]] & ~ [EG [~ [p7<=p75]]]]]] U [~ [E [[[~ [EG [~ [p87<=p133]]] & ~ [E [~ [p87<=p133] U [EG [~ [p50<=p67]] & ~ [p87<=p133]]]]] & ~ [EG [~ [1<=p68]]]] U [~ [EX [~ [[EX [1<=p97] & [p54<=1 & 1<=p15]]]]] | [[[~ [E [true U ~ [1<=p125]]] & [p16<=p41 | p0<=p90]] | ~ [EG [~ [p133<=1]]]] & ~ [EX [~ [EX [p60<=1]]]]]]]] & ~ [EX [[~ [EG [p7<=p71]] & ~ [EG [~ [p7<=p75]]]]]]]]]]

abstracting: (p7<=p75)
states: 3,425,697,793 (9)
...............................................
EG iterations: 47
abstracting: (p7<=p71)
states: 3,425,697,793 (9)
.........................................
EG iterations: 41
.abstracting: (p60<=1)
states: 4,567,597,057 (9)
..abstracting: (p133<=1)
states: 4,567,597,057 (9)
.
EG iterations: 1
abstracting: (p0<=p90)
states: 4,567,597,056 (9)
abstracting: (p16<=p41)
states: 2,318,401,537 (9)
abstracting: (1<=p125)
states: 138,412,032 (8)
abstracting: (1<=p15)
states: 2,283,798,528 (9)
abstracting: (p54<=1)
states: 4,567,597,057 (9)
abstracting: (1<=p97)
states: 103,809,024 (8)
..abstracting: (1<=p68)
states: 830,472,192 (8)
.
EG iterations: 1
abstracting: (p87<=p133)
states: 4,498,391,041 (9)
abstracting: (p50<=p67)
states: 4,463,788,033 (9)
.
EG iterations: 1
abstracting: (p87<=p133)
states: 4,498,391,041 (9)
abstracting: (p87<=p133)
states: 4,498,391,041 (9)
....................................
EG iterations: 36
abstracting: (p7<=p75)
states: 3,425,697,793 (9)
...............................................
EG iterations: 47
abstracting: (p7<=p71)
states: 3,425,697,793 (9)
.........................................
EG iterations: 41
.abstracting: (p7<=p75)
states: 3,425,697,793 (9)
...............................................
EG iterations: 47
abstracting: (p7<=p71)
states: 3,425,697,793 (9)
.........................................
EG iterations: 41
....................................
EG iterations: 35
-> the formula is FALSE

FORMULA Parking-PT-208-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.248sec

checking: E [[[p34<=p104 | ~ [[[[[p69<=p13 & p73<=p29] & ~ [1<=p65]] & EX [p40<=p119]] & AX [[p63<=p22 | 1<=p61]]]]] & p22<=p69] U ~ [[[EG [EG [p36<=1]] | ~ [[[[1<=p45 & p97<=p76] | AG [p66<=p120]] | ~ [[1<=p110 & p25<=p4]]]]] & E [EF [[p4<=1 | p94<=p51]] U E [[p71<=1 & 1<=p15] U AX [p120<=p53]]]]]]
normalized: E [[p22<=p69 & [p34<=p104 | ~ [[~ [EX [~ [[p63<=p22 | 1<=p61]]]] & [EX [p40<=p119] & [~ [1<=p65] & [p69<=p13 & p73<=p29]]]]]]] U ~ [[E [E [true U [p4<=1 | p94<=p51]] U E [[p71<=1 & 1<=p15] U ~ [EX [~ [p120<=p53]]]]] & [EG [EG [p36<=1]] | ~ [[[[1<=p45 & p97<=p76] | ~ [E [true U ~ [p66<=p120]]]] | ~ [[1<=p110 & p25<=p4]]]]]]]]

abstracting: (p25<=p4)
states: 4,532,994,049 (9)
abstracting: (1<=p110)
states: 3,875,536,896 (9)
abstracting: (p66<=p120)
states: 272,629,761 (8)
abstracting: (p97<=p76)
states: 4,515,692,545 (9)
abstracting: (1<=p45)
states: 103,809,024 (8)
abstracting: (p36<=1)
states: 4,567,597,057 (9)

EG iterations: 0

EG iterations: 0
abstracting: (p120<=p53)
states: 4,433,379,329 (9)
.abstracting: (1<=p15)
states: 2,283,798,528 (9)
abstracting: (p71<=1)
states: 4,567,597,057 (9)
abstracting: (p94<=p51)
states: 876,609,537 (8)
abstracting: (p4<=1)
states: 4,567,597,057 (9)
abstracting: (p73<=p29)
states: 2,335,703,041 (9)
abstracting: (p69<=p13)
states: 3,875,536,897 (9)
abstracting: (1<=p65)
states: 138,412,032 (8)
abstracting: (p40<=p119)
states: 4,500,488,193 (9)
.abstracting: (1<=p61)
states: 138,412,032 (8)
abstracting: (p63<=p22)
states: 4,429,185,025 (9)
.abstracting: (p34<=p104)
states: 4,432,330,753 (9)
abstracting: (p22<=p69)
states: 4,498,391,041 (9)
-> the formula is FALSE

FORMULA Parking-PT-208-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.278sec

totally nodes used: 34312596 (3.4e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 29358940 68037249 97396189
used/not used/entry size/cache size: 52288517 14820347 16 1024MB
basic ops cache: hits/miss/sum: 2790335 7074383 9864718
used/not used/entry size/cache size: 9294937 7482279 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: 9708 30850 40558
used/not used/entry size/cache size: 30804 8357804 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 40953656
1 19518314
2 5350390
3 1083258
4 176009
5 24073
6 2849
7 289
8 24
9 2
>= 10 0

Total processing time: 0m45.052sec


BK_STOP 1678842083131

--------------------
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


iterations count:2847 (14), effective:253 (1)

initing FirstDep: 0m 0.000sec


iterations count:4535 (22), effective:319 (1)

iterations count:2104 (10), effective:118 (0)

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

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

iterations count:4575 (22), effective:323 (1)

iterations count:616 (3), effective:29 (0)

iterations count:268 (1), effective:6 (0)

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

iterations count:2075 (10), effective:112 (0)

iterations count:2681 (13), effective:163 (0)

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

iterations count:359 (1), effective:8 (0)

iterations count:2090 (10), effective:158 (0)

iterations count:5727 (28), effective:364 (1)

iterations count:1124 (5), effective:57 (0)

iterations count:1895 (9), effective:105 (0)

iterations count:1261 (6), effective:98 (0)

iterations count:1261 (6), effective:98 (0)

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

iterations count:1261 (6), effective:98 (0)

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

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

iterations count:936 (4), effective:70 (0)

iterations count:1696 (8), effective:95 (0)

iterations count:2156 (10), effective:120 (0)

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

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

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

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

iterations count:1662 (8), effective:105 (0)

iterations count:4737 (23), effective:339 (1)

iterations count:1864 (9), effective:106 (0)

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

iterations count:1122 (5), effective:56 (0)

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

iterations count:2641 (13), effective:193 (0)

iterations count:1315 (6), effective:61 (0)

iterations count:1504 (7), effective:110 (0)

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

iterations count:206 (1), effective:3 (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="Parking-PT-208"
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 Parking-PT-208, 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 r257-smll-167863532700417"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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