Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-2979
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 r077kn-smll-146363816000201
=====================================================================

--------------------
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-0
FORMULA_NAME Parking-PT-208-CTLCardinality-1
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
FORMULA_NAME Parking-PT-208-CTLCardinality-2
FORMULA_NAME Parking-PT-208-CTLCardinality-3
FORMULA_NAME Parking-PT-208-CTLCardinality-4
FORMULA_NAME Parking-PT-208-CTLCardinality-5
FORMULA_NAME Parking-PT-208-CTLCardinality-6
FORMULA_NAME Parking-PT-208-CTLCardinality-7
FORMULA_NAME Parking-PT-208-CTLCardinality-8
FORMULA_NAME Parking-PT-208-CTLCardinality-9

=== Now, execution of the tool begins

BK_START 1463737582175


Marcie rev. 8535M (built: crohr on 2016-04-27)
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: marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --mcc-mode --memory=6 --suppress

parse successfull
net created successfully

Net: Parking_PT_208
(NrP: 137 NrTr: 201 NrArc: 593)

net check time: 0m 0.000sec

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

init dd package: 0m 4.204sec


RS generation: 0m 0.156sec


-> reachability set: #nodes 700 (7.0e+02) #states 4,567,597,057 (9)



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

checking: AX [~ [EF [3<=p123]]]
normalized: ~ [EX [E [true U 3<=p123]]]

abstracting: (3<=p123) states: 0
.-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: ~ [AG [~ [3<=p4]]]
normalized: E [true U 3<=p4]

abstracting: (3<=p4) states: 0
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: EF [3<=p100]
normalized: E [true U 3<=p100]

abstracting: (3<=p100) states: 0
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: AF [EG [~ [p105<=p15]]]
normalized: ~ [EG [~ [EG [~ [p105<=p15]]]]]

abstracting: (p105<=p15) states: 4,532,994,049 (9)
........................................
EG iterations: 40
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 8.189sec

checking: ~ [AF [[[1<=p3 | 2<=p26] & ~ [3<=p21]]]]
normalized: EG [~ [[~ [3<=p21] & [1<=p3 | 2<=p26]]]]

abstracting: (2<=p26) states: 0
abstracting: (1<=p3) states: 2,283,798,528 (9)
abstracting: (3<=p21) states: 0
..............................................
EG iterations: 46
-> the formula is TRUE

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

MC time: 0m42.485sec

checking: ~ [[~ [EF [1<=p120]] | EX [[1<=p92 & 1<=p56]]]]
normalized: ~ [[EX [[1<=p92 & 1<=p56]] | ~ [E [true U 1<=p120]]]]

abstracting: (1<=p120) states: 138,412,032 (8)
abstracting: (1<=p56) states: 138,412,032 (8)
abstracting: (1<=p92) states: 138,412,032 (8)
.-> the formula is TRUE

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

MC time: 0m 0.782sec

checking: AF [[p87<=p36 & 1<=p90]]
normalized: ~ [EG [~ [[p87<=p36 & 1<=p90]]]]

abstracting: (1<=p90) states: 103,809,024 (8)
abstracting: (p87<=p36) states: 4,550,295,553 (9)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.033sec

checking: E [EG [p14<=p21] U EG [p60<=p86]]
normalized: E [EG [p14<=p21] U EG [p60<=p86]]

abstracting: (p60<=p86) states: 4,498,391,041 (9)
.....................................
EG iterations: 37
abstracting: (p14<=p21) states: 2,335,703,041 (9)
......................................
EG iterations: 38
-> the formula is TRUE

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

MC time: 0m 3.879sec

checking: AG [[p54<=p115 & p34<=p85]]
normalized: ~ [E [true U ~ [[p54<=p115 & p34<=p85]]]]

abstracting: (p34<=p85) states: 4,498,391,041 (9)
abstracting: (p54<=p115) states: 4,431,282,177 (9)
-> the formula is FALSE

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

MC time: 0m 0.936sec

checking: E [AF [p9<=p15] U ~ [p60<=p26]]
normalized: E [~ [EG [~ [p9<=p15]]] U ~ [p60<=p26]]

abstracting: (p60<=p26) states: 4,429,185,025 (9)
abstracting: (p9<=p15) states: 3,425,697,793 (9)
................................................
EG iterations: 48
-> the formula is TRUE

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

MC time: 0m30.815sec

checking: [p78<=p64 & EG [[~ [2<=p20] | [3<=p126 | 3<=p27]]]]
normalized: [p78<=p64 & EG [[~ [2<=p20] | [3<=p126 | 3<=p27]]]]

abstracting: (3<=p27) states: 0
abstracting: (3<=p126) states: 0
abstracting: (2<=p20) states: 0

EG iterations: 0
abstracting: (p78<=p64) states: 3,806,330,881 (9)
-> the formula is TRUE

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

MC time: 0m 0.001sec

checking: [EX [[3<=p122 & [p29<=p113 & 2<=p105]]] | ~ [EG [p8<=p2]]]
normalized: [EX [[3<=p122 & [p29<=p113 & 2<=p105]]] | ~ [EG [p8<=p2]]]

abstracting: (p8<=p2) states: 3,425,697,793 (9)
............................
EG iterations: 28
abstracting: (2<=p105) states: 0
abstracting: (p29<=p113) states: 4,465,360,897 (9)
abstracting: (3<=p122) states: 0
.-> the formula is FALSE

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

MC time: 0m 0.447sec

checking: A [AF [p110<=p108] U ~ [[p122<=p18 | p22<=p25]]]
normalized: [~ [EG [[p122<=p18 | p22<=p25]]] & ~ [E [[p122<=p18 | p22<=p25] U [EG [~ [p110<=p108]] & [p122<=p18 | p22<=p25]]]]]

abstracting: (p22<=p25) states: 4,463,788,033 (9)
abstracting: (p122<=p18) states: 4,498,391,041 (9)
abstracting: (p110<=p108) states: 692,060,161 (8)
.
EG iterations: 1
abstracting: (p22<=p25) states: 4,463,788,033 (9)
abstracting: (p122<=p18) states: 4,498,391,041 (9)
abstracting: (p22<=p25) states: 4,463,788,033 (9)
abstracting: (p122<=p18) states: 4,498,391,041 (9)
.....................
EG iterations: 21
-> the formula is FALSE

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

MC time: 0m 0.268sec

checking: ~ [[[AF [2<=p47] | EG [p52<=p128]] | [[p7<=p30 & [1<=p86 | 3<=p19]] & EG [3<=p13]]]]
normalized: ~ [[[EG [p52<=p128] | ~ [EG [~ [2<=p47]]]] | [[p7<=p30 & [1<=p86 | 3<=p19]] & EG [3<=p13]]]]

abstracting: (3<=p13) states: 0
.
EG iterations: 1
abstracting: (3<=p19) states: 0
abstracting: (1<=p86) states: 2,283,798,528 (9)
abstracting: (p7<=p30) states: 2,335,703,041 (9)
abstracting: (2<=p47) states: 0

EG iterations: 0
abstracting: (p52<=p128) states: 809,500,673 (8)
.....................................
EG iterations: 37
-> the formula is TRUE

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

MC time: 0m22.986sec

checking: [EF [EX [p60<=p15]] & [AG [[3<=p116 & 2<=p97]] | [~ [[p38<=p72 | 2<=p102]] | EG [p39<=p101]]]]
normalized: [[[EG [p39<=p101] | ~ [[p38<=p72 | 2<=p102]]] | ~ [E [true U ~ [[3<=p116 & 2<=p97]]]]] & E [true U EX [p60<=p15]]]

abstracting: (p60<=p15) states: 4,498,391,041 (9)
.abstracting: (2<=p97) states: 0
abstracting: (3<=p116) states: 0
abstracting: (2<=p102) states: 0
abstracting: (p38<=p72) states: 4,515,692,545 (9)
abstracting: (p39<=p101) states: 4,500,488,193 (9)
.....................................
EG iterations: 37
-> the formula is TRUE

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

MC time: 0m 2.003sec

checking: [EX [EG [p58<=p47]] & [[[[p126<=p6 | 2<=p1] & ~ [3<=p107]] & EX [p122<=p95]] | [[1<=p23 | ~ [1<=p86]] & EG [1<=p94]]]]
normalized: [EX [EG [p58<=p47]] & [[EG [1<=p94] & [1<=p23 | ~ [1<=p86]]] | [EX [p122<=p95] & [~ [3<=p107] & [p126<=p6 | 2<=p1]]]]]

abstracting: (2<=p1) states: 0
abstracting: (p126<=p6) states: 4,498,391,041 (9)
abstracting: (3<=p107) states: 0
abstracting: (p122<=p95) states: 4,429,185,025 (9)
.abstracting: (1<=p86) states: 2,283,798,528 (9)
abstracting: (1<=p23) states: 103,809,024 (8)
abstracting: (1<=p94) states: 3,806,330,880 (9)
.
EG iterations: 1
abstracting: (p58<=p47) states: 4,429,185,025 (9)
.............................................
EG iterations: 45
.-> the formula is TRUE

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

MC time: 0m 0.917sec


Total processing time: 2m 2.705sec


BK_STOP 1463737705070

--------------------
content from stderr:

check for maximal unmarked siphon
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

407 557 709
iterations count:3945 (19), effective:198 (0)

initing FirstDep: 0m 0.000sec

1415 1750 2169
iterations count:3921 (19), effective:168 (0)
2651
iterations count:1155 (5), effective:47 (0)
842 2507 6122 6319 6535
iterations count:5873 (29), effective:256 (1)
4572 6775 9391
iterations count:3858 (19), effective:173 (0)

iterations count:604 (3), effective:11 (0)

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

iterations count:201 (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="Parking-PT-208"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/root/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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

tar xzf /home/mcc/BenchKit/INPUTS/Parking-PT-208.tgz
mv Parking-PT-208 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
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 r077kn-smll-146363816000201"
echo "====================================================================="
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
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 ;