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-167863532700409.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 CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r257-smll-167863532700409
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1678841966277

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-104
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_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.535sec


RS generation: 0m 0.016sec


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



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

checking: EG [AX [AX [p27<=1]]]
normalized: EG [~ [EX [EX [~ [p27<=1]]]]]

abstracting: (p27<=1)
states: 31,745 (4)
..
EG iterations: 0
-> the formula is TRUE

FORMULA Parking-PT-104-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

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

abstracting: (1<=p52)
states: 1,024 (3)
abstracting: (p13<=1)
states: 31,745 (4)
-> the formula is TRUE

FORMULA Parking-PT-104-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.082sec

checking: A [AF [~ [AF [A [p39<=0 U p6<=0]]]] U EF [~ [p62<=0]]]
normalized: [~ [EG [~ [E [true U ~ [p62<=0]]]]] & ~ [E [~ [E [true U ~ [p62<=0]]] U [EG [~ [EG [~ [[~ [EG [~ [p6<=0]]] & ~ [E [~ [p6<=0] U [~ [p39<=0] & ~ [p6<=0]]]]]]]]] & ~ [E [true U ~ [p62<=0]]]]]]]

abstracting: (p62<=0)
states: 26,113 (4)
abstracting: (p6<=0)
states: 15,873 (4)
abstracting: (p39<=0)
states: 30,721 (4)
abstracting: (p6<=0)
states: 15,873 (4)
abstracting: (p6<=0)
states: 15,873 (4)
.................
EG iterations: 17
..........
EG iterations: 10
..
EG iterations: 2
abstracting: (p62<=0)
states: 26,113 (4)
abstracting: (p62<=0)
states: 26,113 (4)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.228sec

checking: EF [~ [E [A [~ [1<=p20] U AF [p28<=1]] U ~ [EF [AX [p11<=p25]]]]]]
normalized: E [true U ~ [E [[~ [EG [EG [~ [p28<=1]]]] & ~ [E [EG [~ [p28<=1]] U [EG [~ [p28<=1]] & 1<=p20]]]] U ~ [E [true U ~ [EX [~ [p11<=p25]]]]]]]]

abstracting: (p11<=p25)
states: 16,257 (4)
.abstracting: (1<=p20)
states: 768
abstracting: (p28<=1)
states: 31,745 (4)
.
EG iterations: 1
abstracting: (p28<=1)
states: 31,745 (4)
.
EG iterations: 1
abstracting: (p28<=1)
states: 31,745 (4)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA Parking-PT-104-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.020sec

checking: A [EF [EG [[p59<=p6 | AG [p35<=p62]]]] U AG [AX [p5<=1]]]
normalized: [~ [EG [E [true U EX [~ [p5<=1]]]]] & ~ [E [E [true U EX [~ [p5<=1]]] U [~ [E [true U EG [[~ [E [true U ~ [p35<=p62]]] | p59<=p6]]]] & E [true U EX [~ [p5<=1]]]]]]]

abstracting: (p5<=1)
states: 31,745 (4)
.abstracting: (p59<=p6)
states: 31,233 (4)
abstracting: (p35<=p62)
states: 31,233 (4)
.
EG iterations: 1
abstracting: (p5<=1)
states: 31,745 (4)
.abstracting: (p5<=1)
states: 31,745 (4)
..
EG iterations: 1
-> the formula is TRUE

FORMULA Parking-PT-104-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.022sec

checking: E [AG [A [EG [[p57<=0 | p32<=1]] U [p45<=0 | p47<=1]]] U ~ [p8<=p38]]
normalized: E [~ [E [true U ~ [[~ [EG [~ [[p45<=0 | p47<=1]]]] & ~ [E [~ [[p45<=0 | p47<=1]] U [~ [EG [[p57<=0 | p32<=1]]] & ~ [[p45<=0 | p47<=1]]]]]]]]] U ~ [p8<=p38]]

abstracting: (p8<=p38)
states: 16,385 (4)
abstracting: (p47<=1)
states: 31,745 (4)
abstracting: (p45<=0)
states: 31,233 (4)
abstracting: (p32<=1)
states: 31,745 (4)
abstracting: (p57<=0)
states: 30,721 (4)

EG iterations: 0
abstracting: (p47<=1)
states: 31,745 (4)
abstracting: (p45<=0)
states: 31,233 (4)
abstracting: (p47<=1)
states: 31,745 (4)
abstracting: (p45<=0)
states: 31,233 (4)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Parking-PT-104-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.023sec

checking: ~ [EG [EG [[E [A [p11<=p23 U p48<=1] U AX [p37<=p16]] & p50<=0]]]]
normalized: ~ [EG [EG [[p50<=0 & E [[~ [EG [~ [p48<=1]]] & ~ [E [~ [p48<=1] U [~ [p11<=p23] & ~ [p48<=1]]]]] U ~ [EX [~ [p37<=p16]]]]]]]]

abstracting: (p37<=p16)
states: 31,489 (4)
.abstracting: (p48<=1)
states: 31,745 (4)
abstracting: (p11<=p23)
states: 16,385 (4)
abstracting: (p48<=1)
states: 31,745 (4)
abstracting: (p48<=1)
states: 31,745 (4)
.
EG iterations: 1
abstracting: (p50<=0)
states: 30,721 (4)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA Parking-PT-104-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

checking: EG [[EX [1<=p8] & A [[A [~ [p63<=1] U AF [1<=p51]] | AF [A [p2<=1 U p53<=0]]] U p2<=1]]]
normalized: EG [[[~ [EG [~ [p2<=1]]] & ~ [E [~ [p2<=1] U [~ [[~ [EG [~ [[~ [EG [~ [p53<=0]]] & ~ [E [~ [p53<=0] U [~ [p2<=1] & ~ [p53<=0]]]]]]]] | [~ [EG [EG [~ [1<=p51]]]] & ~ [E [EG [~ [1<=p51]] U [p63<=1 & EG [~ [1<=p51]]]]]]]] & ~ [p2<=1]]]]] & EX [1<=p8]]]

abstracting: (1<=p8)
states: 15,872 (4)
.abstracting: (p2<=1)
states: 31,745 (4)
abstracting: (1<=p51)
states: 1,024 (3)
.
EG iterations: 1
abstracting: (p63<=1)
states: 31,745 (4)
abstracting: (1<=p51)
states: 1,024 (3)
.
EG iterations: 1
abstracting: (1<=p51)
states: 1,024 (3)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p53<=0)
states: 30,721 (4)
abstracting: (p2<=1)
states: 31,745 (4)
abstracting: (p53<=0)
states: 30,721 (4)
abstracting: (p53<=0)
states: 30,721 (4)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p2<=1)
states: 31,745 (4)
abstracting: (p2<=1)
states: 31,745 (4)
.
EG iterations: 1
....................
EG iterations: 20
-> the formula is TRUE

FORMULA Parking-PT-104-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.195sec

checking: AF [[[AG [EG [[p45<=p15 | 1<=p27]]] & E [p5<=p25 U 1<=p16]] & p64<=0]]
normalized: ~ [EG [~ [[p64<=0 & [E [p5<=p25 U 1<=p16] & ~ [E [true U ~ [EG [[p45<=p15 | 1<=p27]]]]]]]]]]

abstracting: (1<=p27)
states: 768
abstracting: (p45<=p15)
states: 31,489 (4)
.
EG iterations: 1
abstracting: (1<=p16)
states: 15,872 (4)
abstracting: (p5<=p25)
states: 16,257 (4)
abstracting: (p64<=0)
states: 22,017 (4)
........
EG iterations: 8
-> the formula is FALSE

FORMULA Parking-PT-104-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.073sec

checking: AF [[[EF [~ [[EG [p18<=p4] | 1<=p38]]] & AG [E [p32<=0 U E [p56<=0 U p13<=0]]]] | [1<=p60 & 1<=p29]]]
normalized: ~ [EG [~ [[[1<=p60 & 1<=p29] | [~ [E [true U ~ [E [p32<=0 U E [p56<=0 U p13<=0]]]]] & E [true U ~ [[1<=p38 | EG [p18<=p4]]]]]]]]]

abstracting: (p18<=p4)
states: 31,361 (4)
..........
EG iterations: 10
abstracting: (1<=p38)
states: 1,024 (3)
abstracting: (p13<=0)
states: 15,873 (4)
abstracting: (p56<=0)
states: 30,721 (4)
abstracting: (p32<=0)
states: 5,633 (3)
abstracting: (1<=p29)
states: 512
abstracting: (1<=p60)
states: 30,720 (4)
..............
EG iterations: 14
-> the formula is FALSE

FORMULA Parking-PT-104-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.094sec

checking: EG [~ [[[p56<=p60 & [[1<=p5 & [p15<=1 | [p32<=1 | 1<=p50]]] & ~ [[AG [p49<=p58] & 1<=p49]]]] | 1<=p36]]]
normalized: EG [~ [[1<=p36 | [p56<=p60 & [~ [[1<=p49 & ~ [E [true U ~ [p49<=p58]]]]] & [1<=p5 & [p15<=1 | [p32<=1 | 1<=p50]]]]]]]]

abstracting: (1<=p50)
states: 1,024 (3)
abstracting: (p32<=1)
states: 31,745 (4)
abstracting: (p15<=1)
states: 31,745 (4)
abstracting: (1<=p5)
states: 15,872 (4)
abstracting: (p49<=p58)
states: 30,721 (4)
abstracting: (1<=p49)
states: 1,024 (3)
abstracting: (p56<=p60)
states: 31,745 (4)
abstracting: (1<=p36)
states: 512
.................
EG iterations: 17
-> the formula is TRUE

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

MC time: 0m 0.180sec

checking: A [[AF [[[EG [p39<=p54] & EF [p23<=p63]] & ~ [E [p26<=p62 U p43<=p38]]]] & p30<=1] U [AG [[1<=p14 | AG [AX [1<=p11]]]] & [p40<=0 & AF [1<=p6]]]]
normalized: [~ [EG [~ [[[~ [EG [~ [1<=p6]]] & p40<=0] & ~ [E [true U ~ [[1<=p14 | ~ [E [true U EX [~ [1<=p11]]]]]]]]]]]] & ~ [E [~ [[[~ [EG [~ [1<=p6]]] & p40<=0] & ~ [E [true U ~ [[1<=p14 | ~ [E [true U EX [~ [1<=p11]]]]]]]]]] U [~ [[p30<=1 & ~ [EG [~ [[~ [E [p26<=p62 U p43<=p38]] & [EG [p39<=p54] & E [true U p23<=p63]]]]]]]] & ~ [[[~ [EG [~ [1<=p6]]] & p40<=0] & ~ [E [true U ~ [[1<=p14 | ~ [E [true U EX [~ [1<=p11]]]]]]]]]]]]]]

abstracting: (1<=p11)
states: 15,872 (4)
.abstracting: (1<=p14)
states: 15,872 (4)
abstracting: (p40<=0)
states: 5,121 (3)
abstracting: (1<=p6)
states: 15,872 (4)
...............
EG iterations: 15
abstracting: (p23<=p63)
states: 30,977 (4)
abstracting: (p39<=p54)
states: 30,721 (4)
.
EG iterations: 1
abstracting: (p43<=p38)
states: 31,233 (4)
abstracting: (p26<=p62)
states: 30,977 (4)
...........
EG iterations: 11
abstracting: (p30<=1)
states: 31,745 (4)
abstracting: (1<=p11)
states: 15,872 (4)
.abstracting: (1<=p14)
states: 15,872 (4)
abstracting: (p40<=0)
states: 5,121 (3)
abstracting: (1<=p6)
states: 15,872 (4)
...............
EG iterations: 15
abstracting: (1<=p11)
states: 15,872 (4)
.abstracting: (1<=p14)
states: 15,872 (4)
abstracting: (p40<=0)
states: 5,121 (3)
abstracting: (1<=p6)
states: 15,872 (4)
...............
EG iterations: 15
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.103sec

checking: E [AX [[[[[~ [p30<=p19] & [p22<=1 | 1<=p15]] & 1<=p20] | EG [p29<=p46]] & p16<=p10]] U ~ [[~ [[~ [[AF [1<=p24] | p1<=p54]] | E [AG [p11<=p41] U ~ [1<=p13]]]] | ~ [EF [[[1<=p4 & p19<=1] & EG [p41<=1]]]]]]]
normalized: E [~ [EX [~ [[p16<=p10 & [EG [p29<=p46] | [1<=p20 & [[p22<=1 | 1<=p15] & ~ [p30<=p19]]]]]]]] U ~ [[~ [E [true U [EG [p41<=1] & [1<=p4 & p19<=1]]]] | ~ [[E [~ [E [true U ~ [p11<=p41]]] U ~ [1<=p13]] | ~ [[p1<=p54 | ~ [EG [~ [1<=p24]]]]]]]]]]

abstracting: (1<=p24)
states: 26,112 (4)
............
EG iterations: 12
abstracting: (p1<=p54)
states: 16,385 (4)
abstracting: (1<=p13)
states: 15,872 (4)
abstracting: (p11<=p41)
states: 16,257 (4)
abstracting: (p19<=1)
states: 31,745 (4)
abstracting: (1<=p4)
states: 15,872 (4)
abstracting: (p41<=1)
states: 31,745 (4)

EG iterations: 0
abstracting: (p30<=p19)
states: 30,721 (4)
abstracting: (1<=p15)
states: 15,872 (4)
abstracting: (p22<=1)
states: 31,745 (4)
abstracting: (1<=p20)
states: 768
abstracting: (p29<=p46)
states: 31,233 (4)
..............
EG iterations: 14
abstracting: (p16<=p10)
states: 23,809 (4)
.-> the formula is TRUE

FORMULA Parking-PT-104-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.056sec

checking: [[AF [[p48<=0 | [~ [[~ [p8<=p12] | AX [p41<=p7]]] & AG [p0<=0]]]] | EG [[[E [AG [1<=p55] U p59<=1] | [[[p51<=0 & p46<=p8] & [p35<=p44 | p46<=p53]] | EF [1<=p17]]] | AG [EG [p27<=p43]]]]] & AG [AF [EX [AX [1<=p31]]]]]
normalized: [[~ [EG [~ [[p48<=0 | [~ [[~ [EX [~ [p41<=p7]]] | ~ [p8<=p12]]] & ~ [E [true U ~ [p0<=0]]]]]]]] | EG [[~ [E [true U ~ [EG [p27<=p43]]]] | [[E [true U 1<=p17] | [[p35<=p44 | p46<=p53] & [p51<=0 & p46<=p8]]] | E [~ [E [true U ~ [1<=p55]]] U p59<=1]]]]] & ~ [E [true U EG [~ [EX [~ [EX [~ [1<=p31]]]]]]]]]

abstracting: (1<=p31)
states: 1,024 (3)
........................
EG iterations: 22
abstracting: (p59<=1)
states: 31,745 (4)
abstracting: (1<=p55)
states: 1,024 (3)
abstracting: (p46<=p8)
states: 31,233 (4)
abstracting: (p51<=0)
states: 30,721 (4)
abstracting: (p46<=p53)
states: 30,721 (4)
abstracting: (p35<=p44)
states: 31,233 (4)
abstracting: (1<=p17)
states: 768
abstracting: (p27<=p43)
states: 30,977 (4)
.
EG iterations: 1

EG iterations: 0
abstracting: (p0<=0)
states: 31,744 (4)
abstracting: (p8<=p12)
states: 23,809 (4)
abstracting: (p41<=p7)
states: 31,361 (4)
.abstracting: (p48<=0)
states: 5,121 (3)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.341sec

checking: [AG [AX [[[[p20<=0 | A [p25<=p15 U p28<=p32]] | 1<=p30] | ~ [[[p41<=p59 & p33<=p37] & EG [1<=p38]]]]]] & E [~ [[[[AF [p2<=0] | [E [1<=p16 U p6<=0] | EX [1<=p21]]] | ~ [p25<=p26]] | [AF [EG [p55<=p4]] | EG [1<=p51]]]] U AX [AF [A [1<=p3 U p37<=p61]]]]]
normalized: [E [~ [[[EG [1<=p51] | ~ [EG [~ [EG [p55<=p4]]]]] | [~ [p25<=p26] | [[EX [1<=p21] | E [1<=p16 U p6<=0]] | ~ [EG [~ [p2<=0]]]]]]] U ~ [EX [EG [~ [[~ [EG [~ [p37<=p61]]] & ~ [E [~ [p37<=p61] U [~ [1<=p3] & ~ [p37<=p61]]]]]]]]]] & ~ [E [true U EX [~ [[~ [[EG [1<=p38] & [p41<=p59 & p33<=p37]]] | [1<=p30 | [p20<=0 | [~ [EG [~ [p28<=p32]]] & ~ [E [~ [p28<=p32] U [~ [p25<=p15] & ~ [p28<=p32]]]]]]]]]]]]]

abstracting: (p28<=p32)
states: 30,977 (4)
abstracting: (p25<=p15)
states: 31,361 (4)
abstracting: (p28<=p32)
states: 30,977 (4)
abstracting: (p28<=p32)
states: 30,977 (4)
............
EG iterations: 12
abstracting: (p20<=0)
states: 30,977 (4)
abstracting: (1<=p30)
states: 1,024 (3)
abstracting: (p33<=p37)
states: 30,977 (4)
abstracting: (p41<=p59)
states: 30,977 (4)
abstracting: (1<=p38)
states: 1,024 (3)
.
EG iterations: 1
.abstracting: (p37<=p61)
states: 31,233 (4)
abstracting: (1<=p3)
states: 15,872 (4)
abstracting: (p37<=p61)
states: 31,233 (4)
abstracting: (p37<=p61)
states: 31,233 (4)
...........
EG iterations: 11
..........
EG iterations: 10
.abstracting: (p2<=0)
states: 15,873 (4)
.................
EG iterations: 17
abstracting: (p6<=0)
states: 15,873 (4)
abstracting: (1<=p16)
states: 15,872 (4)
abstracting: (1<=p21)
states: 512
.abstracting: (p25<=p26)
states: 30,977 (4)
abstracting: (p55<=p4)
states: 31,233 (4)
.............
EG iterations: 13
...............
EG iterations: 15
abstracting: (1<=p51)
states: 1,024 (3)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Parking-PT-104-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.134sec

checking: A [AF [[[AX [[p64<=p63 & p37<=p46]] & E [[p12<=1 | 1<=p0] U ~ [p32<=p44]]] | [[EX [p39<=0] | AX [1<=p11]] | [1<=p22 | [p44<=p52 | [p16<=p21 | p64<=0]]]]]] U [A [1<=p14 U p21<=p19] & [[AX [p50<=p54] | EX [[[1<=p38 & p2<=p28] & AG [p34<=p50]]]] & AX [[~ [EF [1<=p37]] & 1<=p32]]]]]
normalized: [~ [EG [~ [[[~ [EX [~ [[1<=p32 & ~ [E [true U 1<=p37]]]]]] & [EX [[~ [E [true U ~ [p34<=p50]]] & [1<=p38 & p2<=p28]]] | ~ [EX [~ [p50<=p54]]]]] & [~ [EG [~ [p21<=p19]]] & ~ [E [~ [p21<=p19] U [~ [1<=p14] & ~ [p21<=p19]]]]]]]]] & ~ [E [~ [[[~ [EX [~ [[1<=p32 & ~ [E [true U 1<=p37]]]]]] & [EX [[~ [E [true U ~ [p34<=p50]]] & [1<=p38 & p2<=p28]]] | ~ [EX [~ [p50<=p54]]]]] & [~ [EG [~ [p21<=p19]]] & ~ [E [~ [p21<=p19] U [~ [1<=p14] & ~ [p21<=p19]]]]]]] U [EG [~ [[[[1<=p22 | [p44<=p52 | [p16<=p21 | p64<=0]]] | [~ [EX [~ [1<=p11]]] | EX [p39<=0]]] | [E [[p12<=1 | 1<=p0] U ~ [p32<=p44]] & ~ [EX [~ [[p64<=p63 & p37<=p46]]]]]]]] & ~ [[[~ [EX [~ [[1<=p32 & ~ [E [true U 1<=p37]]]]]] & [EX [[~ [E [true U ~ [p34<=p50]]] & [1<=p38 & p2<=p28]]] | ~ [EX [~ [p50<=p54]]]]] & [~ [EG [~ [p21<=p19]]] & ~ [E [~ [p21<=p19] U [~ [1<=p14] & ~ [p21<=p19]]]]]]]]]]]

abstracting: (p21<=p19)
states: 31,233 (4)
abstracting: (1<=p14)
states: 15,872 (4)
abstracting: (p21<=p19)
states: 31,233 (4)
abstracting: (p21<=p19)
states: 31,233 (4)
.
EG iterations: 1
abstracting: (p50<=p54)
states: 30,721 (4)
.abstracting: (p2<=p28)
states: 16,257 (4)
abstracting: (1<=p38)
states: 1,024 (3)
abstracting: (p34<=p50)
states: 30,977 (4)
.abstracting: (1<=p37)
states: 512
abstracting: (1<=p32)
states: 26,112 (4)
.abstracting: (p37<=p46)
states: 31,233 (4)
abstracting: (p64<=p63)
states: 22,017 (4)
.abstracting: (p32<=p44)
states: 6,145 (3)
abstracting: (1<=p0)
states: 1
abstracting: (p12<=1)
states: 31,745 (4)
abstracting: (p39<=0)
states: 30,721 (4)
.abstracting: (1<=p11)
states: 15,872 (4)
.abstracting: (p64<=0)
states: 22,017 (4)
abstracting: (p16<=p21)
states: 16,129 (4)
abstracting: (p44<=p52)
states: 31,233 (4)
abstracting: (1<=p22)
states: 1,024 (3)
.
EG iterations: 1
abstracting: (p21<=p19)
states: 31,233 (4)
abstracting: (1<=p14)
states: 15,872 (4)
abstracting: (p21<=p19)
states: 31,233 (4)
abstracting: (p21<=p19)
states: 31,233 (4)
.
EG iterations: 1
abstracting: (p50<=p54)
states: 30,721 (4)
.abstracting: (p2<=p28)
states: 16,257 (4)
abstracting: (1<=p38)
states: 1,024 (3)
abstracting: (p34<=p50)
states: 30,977 (4)
.abstracting: (1<=p37)
states: 512
abstracting: (1<=p32)
states: 26,112 (4)
.abstracting: (p21<=p19)
states: 31,233 (4)
abstracting: (1<=p14)
states: 15,872 (4)
abstracting: (p21<=p19)
states: 31,233 (4)
abstracting: (p21<=p19)
states: 31,233 (4)
.
EG iterations: 1
abstracting: (p50<=p54)
states: 30,721 (4)
.abstracting: (p2<=p28)
states: 16,257 (4)
abstracting: (1<=p38)
states: 1,024 (3)
abstracting: (p34<=p50)
states: 30,977 (4)
.abstracting: (1<=p37)
states: 512
abstracting: (1<=p32)
states: 26,112 (4)
...................
EG iterations: 18
-> the formula is FALSE

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

MC time: 0m 0.208sec

totally nodes used: 949265 (9.5e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1299159 2949933 4249092
used/not used/entry size/cache size: 3845756 63263108 16 1024MB
basic ops cache: hits/miss/sum: 200377 538293 738670
used/not used/entry size/cache size: 957485 15819731 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: 3481 8460 11941
used/not used/entry size/cache size: 8458 8380150 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 66210035
1 852993
2 41580
3 3932
4 307
5 14
6 3
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 7.193sec


BK_STOP 1678841973542

--------------------
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:1281 (13), effective:130 (1)

initing FirstDep: 0m 0.000sec


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

iterations count:1854 (19), effective:123 (1)

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

iterations count:1353 (13), effective:103 (1)

iterations count:792 (8), effective:45 (0)

iterations count:1353 (13), effective:103 (1)

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

iterations count:1353 (13), effective:103 (1)

iterations count:519 (5), effective:48 (0)

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

iterations count:1309 (13), effective:105 (1)

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

iterations count:865 (8), effective:44 (0)

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

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

iterations count:1457 (15), effective:109 (1)

iterations count:807 (8), effective:44 (0)

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

iterations count:664 (6), effective:41 (0)

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

iterations count:240 (2), effective:18 (0)

iterations count:3211 (33), effective:208 (2)

iterations count:754 (7), effective:42 (0)

iterations count:252 (2), effective:10 (0)

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

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

iterations count:754 (7), effective:42 (0)

iterations count:252 (2), effective:10 (0)

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

iterations count:754 (7), effective:42 (0)

iterations count:252 (2), effective:10 (0)

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

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

iterations count:784 (8), effective:41 (0)

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

iterations count:578 (5), effective:59 (0)

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

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

iterations count:2384 (24), effective:158 (1)

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

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

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

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

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

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

iterations count:1307 (13), effective:102 (1)

iterations count:1382 (14), effective:105 (1)

iterations count:309 (3), effective:13 (0)

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

iterations count:1307 (13), effective:102 (1)

iterations count:1382 (14), effective:105 (1)

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

iterations count:1307 (13), effective:102 (1)

iterations count:1382 (14), effective:105 (1)

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="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-104, 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-167863532700409"
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 [ "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 ;