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-104, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r077kn-smll-146363816000192
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463737512567


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_104
(NrP: 65 NrTr: 97 NrArc: 284)

net check time: 0m 0.000sec

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

init dd package: 0m 4.041sec


RS generation: 0m 0.039sec


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



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

checking: EF [AG [~ [2<=p50]]]
normalized: E [true U ~ [E [true U 2<=p50]]]

abstracting: (2<=p50) states: 0
-> the formula is TRUE

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

MC time: 0m 0.007sec

checking: [EF [EF [2<=p17]] | AX [EX [2<=p31]]]
normalized: [~ [EX [~ [EX [2<=p31]]]] | E [true U E [true U 2<=p17]]]

abstracting: (2<=p17) states: 0
abstracting: (2<=p31) states: 0
..-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: E [EF [3<=p52] U ~ [~ [3<=p61]]]
normalized: E [E [true U 3<=p52] U 3<=p61]

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

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

MC time: 0m 0.000sec

checking: ~ [~ [EG [[p5<=p36 | 1<=p29]]]]
normalized: EG [[p5<=p36 | 1<=p29]]

abstracting: (1<=p29) states: 512
abstracting: (p5<=p36) states: 16,129 (4)
.................
EG iterations: 17
-> the formula is TRUE

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

MC time: 0m 0.703sec

checking: EF [AF [[3<=p60 & p22<=p4]]]
normalized: E [true U ~ [EG [~ [[3<=p60 & p22<=p4]]]]]

abstracting: (p22<=p4) states: 31,233 (4)
abstracting: (3<=p60) states: 0

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: A [EX [p3<=p13] U 2<=p16]
normalized: [~ [EG [~ [2<=p16]]] & ~ [E [~ [2<=p16] U [~ [EX [p3<=p13]] & ~ [2<=p16]]]]]

abstracting: (2<=p16) states: 0
abstracting: (p3<=p13) states: 23,809 (4)
.abstracting: (2<=p16) states: 0
abstracting: (2<=p16) states: 0

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.016sec

checking: ~ [~ [[AF [3<=p20] & p36<=p7]]]
normalized: [p36<=p7 & ~ [EG [~ [3<=p20]]]]

abstracting: (3<=p20) states: 0

EG iterations: 0
abstracting: (p36<=p7) states: 31,489 (4)
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: EF [[AG [p26<=p4] & AX [3<=p52]]]
normalized: E [true U [~ [EX [~ [3<=p52]]] & ~ [E [true U ~ [p26<=p4]]]]]

abstracting: (p26<=p4) states: 31,361 (4)
abstracting: (3<=p52) states: 0
.-> the formula is TRUE

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

MC time: 0m 0.139sec

checking: AF [A [p23<=p40 U 3<=p16]]
normalized: ~ [EG [~ [[~ [EG [~ [3<=p16]]] & ~ [E [~ [3<=p16] U [~ [p23<=p40] & ~ [3<=p16]]]]]]]]

abstracting: (3<=p16) states: 0
abstracting: (p23<=p40) states: 31,745 (4)
abstracting: (3<=p16) states: 0
abstracting: (3<=p16) states: 0

EG iterations: 0

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: ~ [EG [[p50<=p58 | [1<=p57 | p40<=p54]]]]
normalized: ~ [EG [[p50<=p58 | [1<=p57 | p40<=p54]]]]

abstracting: (p40<=p54) states: 6,145 (3)
abstracting: (1<=p57) states: 1,024 (3)
abstracting: (p50<=p58) states: 30,721 (4)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.004sec

checking: [[EX [p39<=p44] | ~ [~ [~ [p51<=p1]]]] & EG [p7<=p19]]
normalized: [EG [p7<=p19] & [~ [p51<=p1] | EX [p39<=p44]]]

abstracting: (p39<=p44) states: 30,721 (4)
.abstracting: (p51<=p1) states: 31,233 (4)
abstracting: (p7<=p19) states: 16,257 (4)
.....................
EG iterations: 21
-> the formula is TRUE

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

MC time: 0m 0.681sec

checking: [~ [E [p27<=p12 U 3<=p38]] & [AG [~ [3<=p8]] & AF [~ [p34<=p2]]]]
normalized: [[~ [EG [p34<=p2]] & ~ [E [true U 3<=p8]]] & ~ [E [p27<=p12 U 3<=p38]]]

abstracting: (3<=p38) states: 0
abstracting: (p27<=p12) states: 31,361 (4)
abstracting: (3<=p8) states: 0
abstracting: (p34<=p2) states: 31,361 (4)
..........
EG iterations: 10
-> the formula is FALSE

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

MC time: 0m 0.012sec

checking: [p40<=p50 & [~ [EG [p27<=p17]] | EX [[p36<=p22 & 3<=p9]]]]
normalized: [p40<=p50 & [EX [[p36<=p22 & 3<=p9]] | ~ [EG [p27<=p17]]]]

abstracting: (p27<=p17) states: 30,977 (4)
.
EG iterations: 1
abstracting: (3<=p9) states: 0
abstracting: (p36<=p22) states: 31,233 (4)
.abstracting: (p40<=p50) states: 6,145 (3)
-> the formula is FALSE

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

MC time: 0m 0.002sec

checking: [AF [[1<=p60 & ~ [p30<=p3]]] | A [[2<=p50 & p3<=p51] U ~ [p18<=p23]]]
normalized: [[~ [EG [p18<=p23]] & ~ [E [p18<=p23 U [p18<=p23 & ~ [[2<=p50 & p3<=p51]]]]]] | ~ [EG [~ [[1<=p60 & ~ [p30<=p3]]]]]]

abstracting: (p30<=p3) states: 31,233 (4)
abstracting: (1<=p60) states: 30,720 (4)
.
EG iterations: 1
abstracting: (p3<=p51) states: 16,385 (4)
abstracting: (2<=p50) states: 0
abstracting: (p18<=p23) states: 30,977 (4)
abstracting: (p18<=p23) states: 30,977 (4)
abstracting: (p18<=p23) states: 30,977 (4)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.006sec

checking: [[EG [[3<=p39 | p39<=p34]] | [AG [p59<=p15] & 2<=p29]] | EG [[[p45<=p35 & p44<=p9] & ~ [3<=p5]]]]
normalized: [[[2<=p29 & ~ [E [true U ~ [p59<=p15]]]] | EG [[3<=p39 | p39<=p34]]] | EG [[~ [3<=p5] & [p45<=p35 & p44<=p9]]]]

abstracting: (p44<=p9) states: 31,489 (4)
abstracting: (p45<=p35) states: 31,233 (4)
abstracting: (3<=p5) states: 0
.
EG iterations: 1
abstracting: (p39<=p34) states: 30,721 (4)
abstracting: (3<=p39) states: 0
.
EG iterations: 1
abstracting: (p59<=p15) states: 31,233 (4)
abstracting: (2<=p29) states: 0
-> the formula is TRUE

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

MC time: 0m 0.125sec

checking: [[[p54<=p37 & EF [3<=p37]] & [~ [[p4<=p45 & 1<=p30]] | p57<=p47]] & [EX [[2<=p46 & 1<=p38]] | [EX [p18<=p61] & p52<=p3]]]
normalized: [[[p52<=p3 & EX [p18<=p61]] | EX [[2<=p46 & 1<=p38]]] & [[p57<=p47 | ~ [[p4<=p45 & 1<=p30]]] & [p54<=p37 & E [true U 3<=p37]]]]

abstracting: (3<=p37) states: 0
abstracting: (p54<=p37) states: 30,721 (4)
abstracting: (1<=p30) states: 1,024 (3)
abstracting: (p4<=p45) states: 16,129 (4)
abstracting: (p57<=p47) states: 30,721 (4)
abstracting: (1<=p38) states: 1,024 (3)
abstracting: (2<=p46) states: 0
.abstracting: (p18<=p61) states: 31,233 (4)
.abstracting: (p52<=p3) states: 31,233 (4)
-> the formula is FALSE

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

MC time: 0m 0.004sec


Total processing time: 0m 7.170sec


BK_STOP 1463737519773

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

294
iterations count:1825 (18), effective:95 (0)

initing FirstDep: 0m 0.000sec


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

iterations count:773 (7), effective:46 (0)
1697
iterations count:1352 (13), effective:57 (0)

iterations count:875 (9), effective:49 (0)

iterations count:97 (1), effective:0 (0)
770 2098
iterations count:2413 (24), effective:94 (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-104"
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-104.tgz
mv Parking-PT-104 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-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 r077kn-smll-146363816000192"
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 ;