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-167863532700414.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-104, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r257-smll-167863532700414
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 6.7K Feb 26 14:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 14:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 26 14:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 26 14:58 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.8K Feb 25 16:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 16K Feb 25 16:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 15:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 15:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 14:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K Feb 26 14:59 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 23K 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-104-ReachabilityCardinality-00
FORMULA_NAME Parking-PT-104-ReachabilityCardinality-01
FORMULA_NAME Parking-PT-104-ReachabilityCardinality-02
FORMULA_NAME Parking-PT-104-ReachabilityCardinality-03
FORMULA_NAME Parking-PT-104-ReachabilityCardinality-04
FORMULA_NAME Parking-PT-104-ReachabilityCardinality-05
FORMULA_NAME Parking-PT-104-ReachabilityCardinality-06
FORMULA_NAME Parking-PT-104-ReachabilityCardinality-07
FORMULA_NAME Parking-PT-104-ReachabilityCardinality-08
FORMULA_NAME Parking-PT-104-ReachabilityCardinality-09
FORMULA_NAME Parking-PT-104-ReachabilityCardinality-10
FORMULA_NAME Parking-PT-104-ReachabilityCardinality-11
FORMULA_NAME Parking-PT-104-ReachabilityCardinality-12
FORMULA_NAME Parking-PT-104-ReachabilityCardinality-13
FORMULA_NAME Parking-PT-104-ReachabilityCardinality-14
FORMULA_NAME Parking-PT-104-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678842008019

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=Parking-PT-104
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: Parking_PT_104
(NrP: 65 NrTr: 97 NrArc: 284)

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

net check time: 0m 0.000sec

init dd package: 0m 3.569sec


RS generation: 0m 0.027sec


-> reachability set: #nodes 503 (5.0e+02) #states 31,745 (4)



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

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

abstracting: (1<=p50)
states: 1,024 (3)
-> the formula is TRUE

FORMULA Parking-PT-104-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.084sec

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

abstracting: (p10<=1)
states: 31,745 (4)
-> the formula is FALSE

FORMULA Parking-PT-104-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[~ [p28<=0] | p33<=0]]
normalized: ~ [E [true U ~ [[~ [p28<=0] | p33<=0]]]]

abstracting: (p33<=0)
states: 30,977 (4)
abstracting: (p28<=0)
states: 30,977 (4)
-> the formula is FALSE

FORMULA Parking-PT-104-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.059sec

checking: EF [[p37<=1 & ~ [p64<=1]]]
normalized: E [true U [~ [p64<=1] & p37<=1]]

abstracting: (p37<=1)
states: 31,745 (4)
abstracting: (p64<=1)
states: 31,745 (4)
-> the formula is FALSE

FORMULA Parking-PT-104-ReachabilityCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [~ [[1<=p28 & p23<=0]]]
normalized: ~ [E [true U [1<=p28 & p23<=0]]]

abstracting: (p23<=0)
states: 30,721 (4)
abstracting: (1<=p28)
states: 768
-> the formula is FALSE

FORMULA Parking-PT-104-ReachabilityCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.013sec

checking: AG [p44<=p12]
normalized: ~ [E [true U ~ [p44<=p12]]]

abstracting: (p44<=p12)
states: 31,489 (4)
-> the formula is FALSE

FORMULA Parking-PT-104-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.018sec

checking: AG [p27<=p3]
normalized: ~ [E [true U ~ [p27<=p3]]]

abstracting: (p27<=p3)
states: 31,361 (4)
-> the formula is FALSE

FORMULA Parking-PT-104-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.020sec

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

abstracting: (1<=p21)
states: 512
abstracting: (1<=p8)
states: 15,872 (4)
-> the formula is FALSE

FORMULA Parking-PT-104-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

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

abstracting: (1<=p27)
states: 768
abstracting: (p11<=1)
states: 31,745 (4)
abstracting: (p57<=1)
states: 31,745 (4)
-> the formula is FALSE

FORMULA Parking-PT-104-ReachabilityCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: AG [[1<=p13 | [p38<=1 | [p21<=0 | ~ [[[~ [[p50<=1 | 1<=p59]] & p44<=p29] & [[p32<=p23 & [1<=p19 & p13<=0]] & [1<=p4 | [p6<=0 & p11<=p55]]]]]]]]]
normalized: ~ [E [true U ~ [[[[~ [[[[[p6<=0 & p11<=p55] | 1<=p4] & [[1<=p19 & p13<=0] & p32<=p23]] & [~ [[p50<=1 | 1<=p59]] & p44<=p29]]] | p21<=0] | p38<=1] | 1<=p13]]]]

abstracting: (1<=p13)
states: 15,872 (4)
abstracting: (p38<=1)
states: 31,745 (4)
abstracting: (p21<=0)
states: 31,233 (4)
abstracting: (p44<=p29)
states: 31,233 (4)
abstracting: (1<=p59)
states: 1,024 (3)
abstracting: (p50<=1)
states: 31,745 (4)
abstracting: (p32<=p23)
states: 6,657 (3)
abstracting: (p13<=0)
states: 15,873 (4)
abstracting: (1<=p19)
states: 768
abstracting: (1<=p4)
states: 15,872 (4)
abstracting: (p11<=p55)
states: 16,385 (4)
abstracting: (p6<=0)
states: 15,873 (4)
-> the formula is TRUE

FORMULA Parking-PT-104-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [[[~ [1<=p14] | ~ [[[[~ [[~ [1<=p5] | p31<=1]] & p15<=p23] & [~ [[p58<=0 & [1<=p5 | p32<=p41]]] | [p15<=1 | p15<=0]]] & ~ [[1<=p5 | p21<=0]]]]] | [p40<=1 & 1<=p19]]]
normalized: ~ [E [true U ~ [[[p40<=1 & 1<=p19] | [~ [[~ [[1<=p5 | p21<=0]] & [[[p15<=1 | p15<=0] | ~ [[p58<=0 & [1<=p5 | p32<=p41]]]] & [p15<=p23 & ~ [[p31<=1 | ~ [1<=p5]]]]]]] | ~ [1<=p14]]]]]]

abstracting: (1<=p14)
states: 15,872 (4)
abstracting: (1<=p5)
states: 15,872 (4)
abstracting: (p31<=1)
states: 31,745 (4)
abstracting: (p15<=p23)
states: 16,385 (4)
abstracting: (p32<=p41)
states: 6,401 (3)
abstracting: (1<=p5)
states: 15,872 (4)
abstracting: (p58<=0)
states: 9,217 (3)
abstracting: (p15<=0)
states: 15,873 (4)
abstracting: (p15<=1)
states: 31,745 (4)
abstracting: (p21<=0)
states: 31,233 (4)
abstracting: (1<=p5)
states: 15,872 (4)
abstracting: (1<=p19)
states: 768
abstracting: (p40<=1)
states: 31,745 (4)
-> the formula is TRUE

FORMULA Parking-PT-104-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EF [[~ [[[[[[p54<=p0 & [p30<=p52 | p48<=0]] & ~ [[[p4<=1 | p63<=p9] | [1<=p36 | p30<=p15]]]] | [p35<=1 & [~ [p19<=1] & 1<=p50]]] & ~ [1<=p17]] | ~ [1<=p25]]] | ~ [p17<=p12]]]
normalized: E [true U [~ [p17<=p12] | ~ [[~ [1<=p25] | [~ [1<=p17] & [[p35<=1 & [1<=p50 & ~ [p19<=1]]] | [~ [[[1<=p36 | p30<=p15] | [p4<=1 | p63<=p9]]] & [p54<=p0 & [p30<=p52 | p48<=0]]]]]]]]]

abstracting: (p48<=0)
states: 5,121 (3)
abstracting: (p30<=p52)
states: 30,721 (4)
abstracting: (p54<=p0)
states: 30,721 (4)
abstracting: (p63<=p9)
states: 26,881 (4)
abstracting: (p4<=1)
states: 31,745 (4)
abstracting: (p30<=p15)
states: 31,233 (4)
abstracting: (1<=p36)
states: 512
abstracting: (p19<=1)
states: 31,745 (4)
abstracting: (1<=p50)
states: 1,024 (3)
abstracting: (p35<=1)
states: 31,745 (4)
abstracting: (1<=p17)
states: 768
abstracting: (1<=p25)
states: 768
abstracting: (p17<=p12)
states: 31,361 (4)
-> the formula is TRUE

FORMULA Parking-PT-104-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.031sec

checking: EF [~ [[[p30<=p35 | [[[~ [[[1<=p48 & p32<=p39] | [p0<=p60 | 1<=p50]]] & p21<=0] & [[[~ [1<=p38] & ~ [1<=p59]] & ~ [[p47<=0 | 1<=p53]]] | ~ [1<=p40]]] | [~ [[[1<=p48 & 1<=p31] | ~ [p24<=1]]] & ~ [[~ [[p32<=1 | p18<=0]] & 1<=p32]]]]] | p49<=0]]]
normalized: E [true U ~ [[p49<=0 | [p30<=p35 | [[~ [[1<=p32 & ~ [[p32<=1 | p18<=0]]]] & ~ [[~ [p24<=1] | [1<=p48 & 1<=p31]]]] | [[~ [1<=p40] | [~ [[p47<=0 | 1<=p53]] & [~ [1<=p59] & ~ [1<=p38]]]] & [p21<=0 & ~ [[[p0<=p60 | 1<=p50] | [1<=p48 & p32<=p39]]]]]]]]]]

abstracting: (p32<=p39)
states: 6,657 (3)
abstracting: (1<=p48)
states: 26,624 (4)
abstracting: (1<=p50)
states: 1,024 (3)
abstracting: (p0<=p60)
states: 31,744 (4)
abstracting: (p21<=0)
states: 31,233 (4)
abstracting: (1<=p38)
states: 1,024 (3)
abstracting: (1<=p59)
states: 1,024 (3)
abstracting: (1<=p53)
states: 1,024 (3)
abstracting: (p47<=0)
states: 30,721 (4)
abstracting: (1<=p40)
states: 26,624 (4)
abstracting: (1<=p31)
states: 1,024 (3)
abstracting: (1<=p48)
states: 26,624 (4)
abstracting: (p24<=1)
states: 31,745 (4)
abstracting: (p18<=0)
states: 30,977 (4)
abstracting: (p32<=1)
states: 31,745 (4)
abstracting: (1<=p32)
states: 26,112 (4)
abstracting: (p30<=p35)
states: 30,721 (4)
abstracting: (p49<=0)
states: 30,721 (4)
-> the formula is FALSE

FORMULA Parking-PT-104-ReachabilityCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: EF [[[[p61<=1 | p43<=p34] & ~ [[p38<=1 | [[[~ [[p51<=1 | p59<=0]] | p55<=p54] | ~ [[p31<=p13 & p14<=p55]]] & [1<=p51 & [[[p48<=p29 | 1<=p40] | [p7<=0 & p46<=0]] & [~ [1<=p35] | 1<=p7]]]]]]] & ~ [[~ [[[[~ [1<=p38] & [1<=p35 | p26<=p15]] & [[1<=p7 | 1<=p35] & p64<=1]] & ~ [[~ [p44<=p27] | ~ [p58<=1]]]]] & ~ [[~ [1<=p18] & p51<=0]]]]]]
normalized: E [true U [~ [[~ [[p51<=0 & ~ [1<=p18]]] & ~ [[~ [[~ [p58<=1] | ~ [p44<=p27]]] & [[p64<=1 & [1<=p7 | 1<=p35]] & [[1<=p35 | p26<=p15] & ~ [1<=p38]]]]]]] & [~ [[p38<=1 | [[1<=p51 & [[1<=p7 | ~ [1<=p35]] & [[p7<=0 & p46<=0] | [p48<=p29 | 1<=p40]]]] & [~ [[p31<=p13 & p14<=p55]] | [p55<=p54 | ~ [[p51<=1 | p59<=0]]]]]]] & [p61<=1 | p43<=p34]]]]

abstracting: (p43<=p34)
states: 31,233 (4)
abstracting: (p61<=1)
states: 31,745 (4)
abstracting: (p59<=0)
states: 30,721 (4)
abstracting: (p51<=1)
states: 31,745 (4)
abstracting: (p55<=p54)
states: 30,721 (4)
abstracting: (p14<=p55)
states: 16,385 (4)
abstracting: (p31<=p13)
states: 31,233 (4)
abstracting: (1<=p40)
states: 26,624 (4)
abstracting: (p48<=p29)
states: 5,633 (3)
abstracting: (p46<=0)
states: 30,721 (4)
abstracting: (p7<=0)
states: 15,873 (4)
abstracting: (1<=p35)
states: 512
abstracting: (1<=p7)
states: 15,872 (4)
abstracting: (1<=p51)
states: 1,024 (3)
abstracting: (p38<=1)
states: 31,745 (4)
abstracting: (1<=p38)
states: 1,024 (3)
abstracting: (p26<=p15)
states: 31,361 (4)
abstracting: (1<=p35)
states: 512
abstracting: (1<=p35)
states: 512
abstracting: (1<=p7)
states: 15,872 (4)
abstracting: (p64<=1)
states: 31,745 (4)
abstracting: (p44<=p27)
states: 31,233 (4)
abstracting: (p58<=1)
states: 31,745 (4)
abstracting: (1<=p18)
states: 768
abstracting: (p51<=0)
states: 30,721 (4)
-> the formula is FALSE

FORMULA Parking-PT-104-ReachabilityCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: AG [~ [[[[[[[p15<=p22 | ~ [[p54<=p3 | p7<=p31]]] & [p60<=1 | [[p34<=p51 | 1<=p21] & [p10<=1 | p48<=0]]]] | ~ [[~ [[p0<=p27 | p43<=1]] & ~ [[1<=p62 & p40<=p39]]]]] & [[~ [p18<=p22] | [p25<=0 & [p17<=1 & ~ [p48<=0]]]] & [~ [[1<=p49 & p20<=1]] | ~ [[~ [p38<=p26] | [p45<=p31 | p47<=1]]]]]] | [~ [1<=p35] | [p12<=1 & ~ [[p12<=1 & [1<=p2 & [p42<=0 | p18<=0]]]]]]] & 1<=p18]]]
normalized: ~ [E [true U [1<=p18 & [[[p12<=1 & ~ [[p12<=1 & [1<=p2 & [p42<=0 | p18<=0]]]]] | ~ [1<=p35]] | [[[~ [[[p45<=p31 | p47<=1] | ~ [p38<=p26]]] | ~ [[1<=p49 & p20<=1]]] & [[p25<=0 & [p17<=1 & ~ [p48<=0]]] | ~ [p18<=p22]]] & [~ [[~ [[1<=p62 & p40<=p39]] & ~ [[p0<=p27 | p43<=1]]]] | [[p60<=1 | [[p10<=1 | p48<=0] & [p34<=p51 | 1<=p21]]] & [p15<=p22 | ~ [[p54<=p3 | p7<=p31]]]]]]]]]]

abstracting: (p7<=p31)
states: 16,385 (4)
abstracting: (p54<=p3)
states: 31,233 (4)
abstracting: (p15<=p22)
states: 16,385 (4)
abstracting: (1<=p21)
states: 512
abstracting: (p34<=p51)
states: 30,977 (4)
abstracting: (p48<=0)
states: 5,121 (3)
abstracting: (p10<=1)
states: 31,745 (4)
abstracting: (p60<=1)
states: 31,745 (4)
abstracting: (p43<=1)
states: 31,745 (4)
abstracting: (p0<=p27)
states: 31,744 (4)
abstracting: (p40<=p39)
states: 5,121 (3)
abstracting: (1<=p62)
states: 5,632 (3)
abstracting: (p18<=p22)
states: 30,977 (4)
abstracting: (p48<=0)
states: 5,121 (3)
abstracting: (p17<=1)
states: 31,745 (4)
abstracting: (p25<=0)
states: 30,977 (4)
abstracting: (p20<=1)
states: 31,745 (4)
abstracting: (1<=p49)
states: 1,024 (3)
abstracting: (p38<=p26)
states: 30,721 (4)
abstracting: (p47<=1)
states: 31,745 (4)
abstracting: (p45<=p31)
states: 31,233 (4)
abstracting: (1<=p35)
states: 512
abstracting: (p18<=0)
states: 30,977 (4)
abstracting: (p42<=0)
states: 30,977 (4)
abstracting: (1<=p2)
states: 15,872 (4)
abstracting: (p12<=1)
states: 31,745 (4)
abstracting: (p12<=1)
states: 31,745 (4)
abstracting: (1<=p18)
states: 768
-> the formula is FALSE

FORMULA Parking-PT-104-ReachabilityCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: EF [[[p22<=0 | [[[[[[p38<=p5 & ~ [1<=p9]] | p8<=1] | ~ [p0<=p53]] & p62<=p29] & [~ [[~ [1<=p15] | [p53<=0 | p63<=p18]]] | p61<=0]] | [[~ [[[[p26<=0 | p56<=0] & [p9<=0 & 1<=p37]] & [[p26<=1 & 1<=p48] | 1<=p61]]] & ~ [[[~ [1<=p41] & ~ [p4<=1]] & 1<=p49]]] | [1<=p4 & [[[~ [p9<=1] | p51<=1] | ~ [1<=p28]] | [p15<=p61 & p36<=1]]]]]] & [p58<=p12 & ~ [[~ [1<=p33] | [[[[[p56<=p42 | p45<=p11] | p45<=0] | [[p35<=p48 | 1<=p10] & ~ [1<=p6]]] & [[~ [p5<=p1] | [p37<=p24 & p18<=p55]] & ~ [p59<=p33]]] & ~ [[~ [1<=p5] | [[1<=p39 & 1<=p28] | p20<=0]]]]]]]]]
normalized: E [true U [[p58<=p12 & ~ [[[~ [[[p20<=0 | [1<=p39 & 1<=p28]] | ~ [1<=p5]]] & [[~ [p59<=p33] & [[p37<=p24 & p18<=p55] | ~ [p5<=p1]]] & [[~ [1<=p6] & [p35<=p48 | 1<=p10]] | [p45<=0 | [p56<=p42 | p45<=p11]]]]] | ~ [1<=p33]]]] & [p22<=0 | [[[1<=p4 & [[p15<=p61 & p36<=1] | [~ [1<=p28] | [p51<=1 | ~ [p9<=1]]]]] | [~ [[1<=p49 & [~ [p4<=1] & ~ [1<=p41]]]] & ~ [[[1<=p61 | [p26<=1 & 1<=p48]] & [[p9<=0 & 1<=p37] & [p26<=0 | p56<=0]]]]]] | [[p61<=0 | ~ [[[p53<=0 | p63<=p18] | ~ [1<=p15]]]] & [p62<=p29 & [~ [p0<=p53] | [p8<=1 | [p38<=p5 & ~ [1<=p9]]]]]]]]]]

abstracting: (1<=p9)
states: 15,872 (4)
abstracting: (p38<=p5)
states: 31,233 (4)
abstracting: (p8<=1)
states: 31,745 (4)
abstracting: (p0<=p53)
states: 31,744 (4)
abstracting: (p62<=p29)
states: 26,113 (4)
abstracting: (1<=p15)
states: 15,872 (4)
abstracting: (p63<=p18)
states: 22,273 (4)
abstracting: (p53<=0)
states: 30,721 (4)
abstracting: (p61<=0)
states: 25,089 (4)
abstracting: (p56<=0)
states: 30,721 (4)
abstracting: (p26<=0)
states: 30,977 (4)
abstracting: (1<=p37)
states: 512
abstracting: (p9<=0)
states: 15,873 (4)
abstracting: (1<=p48)
states: 26,624 (4)
abstracting: (p26<=1)
states: 31,745 (4)
abstracting: (1<=p61)
states: 6,656 (3)
abstracting: (1<=p41)
states: 768
abstracting: (p4<=1)
states: 31,745 (4)
abstracting: (1<=p49)
states: 1,024 (3)
abstracting: (p9<=1)
states: 31,745 (4)
abstracting: (p51<=1)
states: 31,745 (4)
abstracting: (1<=p28)
states: 768
abstracting: (p36<=1)
states: 31,745 (4)
abstracting: (p15<=p61)
states: 19,201 (4)
abstracting: (1<=p4)
states: 15,872 (4)
abstracting: (p22<=0)
states: 30,721 (4)
abstracting: (1<=p33)
states: 768
abstracting: (p45<=p11)
states: 31,489 (4)
abstracting: (p56<=p42)
states: 30,721 (4)
abstracting: (p45<=0)
states: 31,233 (4)
abstracting: (1<=p10)
states: 15,872 (4)
abstracting: (p35<=p48)
states: 31,745 (4)
abstracting: (1<=p6)
states: 15,872 (4)
abstracting: (p5<=p1)
states: 23,809 (4)
abstracting: (p18<=p55)
states: 30,977 (4)
abstracting: (p37<=p24)
states: 31,745 (4)
abstracting: (p59<=p33)
states: 30,721 (4)
abstracting: (1<=p5)
states: 15,872 (4)
abstracting: (1<=p28)
states: 768
abstracting: (1<=p39)
states: 1,024 (3)
abstracting: (p20<=0)
states: 30,977 (4)
abstracting: (p58<=p12)
states: 20,481 (4)
-> the formula is TRUE

FORMULA Parking-PT-104-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.049sec

totally nodes used: 82665 (8.3e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 268901 641297 910198
used/not used/entry size/cache size: 690788 66418076 16 1024MB
basic ops cache: hits/miss/sum: 65844 158662 224506
used/not used/entry size/cache size: 267885 16509331 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: 3524 8683 12207
used/not used/entry size/cache size: 8678 8379930 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 67027533
1 80023
2 1284
3 23
4 0
5 1
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 5.506sec


BK_STOP 1678842013652

--------------------
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.003sec


iterations count:1281 (13), effective:130 (1)

initing FirstDep: 0m 0.000sec


iterations count:2780 (28), effective:184 (1)

iterations count:2690 (27), effective:206 (2)

iterations count:904 (9), effective:56 (0)

iterations count:1375 (14), effective:106 (1)

iterations count:1377 (14), effective:87 (0)

iterations count:898 (9), effective:57 (0)

iterations count:895 (9), effective:56 (0)

iterations count:1682 (17), effective:109 (1)

iterations count:883 (9), effective:56 (0)

iterations count:2925 (30), effective:218 (2)

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-104"
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 Parking-PT-104, 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 r257-smll-167863532700414"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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