About the Execution of Marcie for Parking-PT-416
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
4232.450 | 28954.00 | 29000.00 | 29.70 | TTTTTTTTTTTTTTTT | normal |
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-2270
Executing tool marcie
Input is Parking-PT-416, examination is ReachabilityBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r232su-smll-143354324800164
=====================================================================
--------------------
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-416-ReachabilityBounds-0
FORMULA_NAME Parking-PT-416-ReachabilityBounds-1
FORMULA_NAME Parking-PT-416-ReachabilityBounds-10
FORMULA_NAME Parking-PT-416-ReachabilityBounds-11
FORMULA_NAME Parking-PT-416-ReachabilityBounds-12
FORMULA_NAME Parking-PT-416-ReachabilityBounds-13
FORMULA_NAME Parking-PT-416-ReachabilityBounds-14
FORMULA_NAME Parking-PT-416-ReachabilityBounds-15
FORMULA_NAME Parking-PT-416-ReachabilityBounds-2
FORMULA_NAME Parking-PT-416-ReachabilityBounds-3
FORMULA_NAME Parking-PT-416-ReachabilityBounds-4
FORMULA_NAME Parking-PT-416-ReachabilityBounds-5
FORMULA_NAME Parking-PT-416-ReachabilityBounds-6
FORMULA_NAME Parking-PT-416-ReachabilityBounds-7
FORMULA_NAME Parking-PT-416-ReachabilityBounds-8
FORMULA_NAME Parking-PT-416-ReachabilityBounds-9
=== Now, execution of the tool begins
BK_START 1433645071373
Model: Parking-PT-416
reachability algorithm:
Saturation-based algorithm
variable ordering algorithm:
Calculated like in [Noa99]
--memory=6 --suppress --rs-algorithm=3 --place-order=5
Marcie rev. 1429:1432M (built: crohr on 2014-10-22)
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=ReachabilityBounds.xml --memory=6 --suppress --rs-algorithm=3 --place-order=5
parse successfull
net created successfully
(NrP: 305 NrTr: 433 NrArc: 1289)
net check time: 0m0sec
parse formulas successfull
formulas created successfully
place and transition orderings generation:0m0sec
init dd package: 0m3sec
RS generation: 0m8sec
-> reachability set: #nodes 39550 (4.0e+04) #states 8,440,470,781,232,316,153,857 (21)
starting MCC model checker
--------------------------
checking: [maxVal(p259)<=1 & maxVal(p76)<=3]
normalized: [maxVal(p259)<=1 & maxVal(p76)<=3]
abstracting: (1<=3) states: 8,440,470,781,232,316,153,857 (21)
abstracting: (1<=1) states: 8,440,470,781,232,316,153,857 (21)
-> the formula is TRUE
FORMULA Parking-PT-416-ReachabilityBounds-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: maxVal(p115)<=2
normalized: maxVal(p115)<=2
abstracting: (1<=2) states: 8,440,470,781,232,316,153,857 (21)
-> the formula is TRUE
FORMULA Parking-PT-416-ReachabilityBounds-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: [maxVal(p231)<=1 & [maxVal(p103)<=1 & [maxVal(p265)<=1 & maxVal(p254)<=3]]]
normalized: [maxVal(p231)<=1 & [maxVal(p103)<=1 & [maxVal(p265)<=1 & maxVal(p254)<=3]]]
abstracting: (1<=3) states: 8,440,470,781,232,316,153,857 (21)
abstracting: (1<=1) states: 8,440,470,781,232,316,153,857 (21)
abstracting: (1<=1) states: 8,440,470,781,232,316,153,857 (21)
abstracting: (1<=1) states: 8,440,470,781,232,316,153,857 (21)
-> the formula is TRUE
FORMULA Parking-PT-416-ReachabilityBounds-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: maxVal(p105)<=3
normalized: maxVal(p105)<=3
abstracting: (1<=3) states: 8,440,470,781,232,316,153,857 (21)
-> the formula is TRUE
FORMULA Parking-PT-416-ReachabilityBounds-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: [maxVal(p266)<=3 & maxVal(p109)<=1]
normalized: [maxVal(p266)<=3 & maxVal(p109)<=1]
abstracting: (1<=1) states: 8,440,470,781,232,316,153,857 (21)
abstracting: (1<=3) states: 8,440,470,781,232,316,153,857 (21)
-> the formula is TRUE
FORMULA Parking-PT-416-ReachabilityBounds-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: maxVal(p220)<=1
normalized: maxVal(p220)<=1
abstracting: (1<=1) states: 8,440,470,781,232,316,153,857 (21)
-> the formula is TRUE
FORMULA Parking-PT-416-ReachabilityBounds-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: [maxVal(p52)<=1 & [maxVal(p259)<=1 & [maxVal(p302)<=2 & [maxVal(p145)<=1 & [maxVal(p272)<=1 & [maxVal(p236)<=1 & maxVal(p191)<=2]]]]]]
normalized: [maxVal(p52)<=1 & [maxVal(p259)<=1 & [maxVal(p302)<=2 & [maxVal(p145)<=1 & [maxVal(p272)<=1 & [maxVal(p236)<=1 & maxVal(p191)<=2]]]]]]
abstracting: (1<=2) states: 8,440,470,781,232,316,153,857 (21)
abstracting: (1<=1) states: 8,440,470,781,232,316,153,857 (21)
abstracting: (1<=1) states: 8,440,470,781,232,316,153,857 (21)
abstracting: (1<=1) states: 8,440,470,781,232,316,153,857 (21)
abstracting: (1<=2) states: 8,440,470,781,232,316,153,857 (21)
abstracting: (1<=1) states: 8,440,470,781,232,316,153,857 (21)
abstracting: (1<=1) states: 8,440,470,781,232,316,153,857 (21)
-> the formula is TRUE
FORMULA Parking-PT-416-ReachabilityBounds-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: [maxVal(p208)<=2 & [maxVal(p202)<=3 & maxVal(p198)<=1]]
normalized: [maxVal(p208)<=2 & [maxVal(p202)<=3 & maxVal(p198)<=1]]
abstracting: (1<=1) states: 8,440,470,781,232,316,153,857 (21)
abstracting: (1<=3) states: 8,440,470,781,232,316,153,857 (21)
abstracting: (1<=2) states: 8,440,470,781,232,316,153,857 (21)
-> the formula is TRUE
FORMULA Parking-PT-416-ReachabilityBounds-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: maxVal(p182)<=1
normalized: maxVal(p182)<=1
abstracting: (1<=1) states: 8,440,470,781,232,316,153,857 (21)
-> the formula is TRUE
FORMULA Parking-PT-416-ReachabilityBounds-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: [maxVal(p177)<=1 & maxVal(p101)<=3]
normalized: [maxVal(p177)<=1 & maxVal(p101)<=3]
abstracting: (1<=3) states: 8,440,470,781,232,316,153,857 (21)
abstracting: (1<=1) states: 8,440,470,781,232,316,153,857 (21)
-> the formula is TRUE
FORMULA Parking-PT-416-ReachabilityBounds-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: maxVal(p189)<=2
normalized: maxVal(p189)<=2
abstracting: (1<=2) states: 8,440,470,781,232,316,153,857 (21)
-> the formula is TRUE
FORMULA Parking-PT-416-ReachabilityBounds-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: maxVal(p3)<=1
normalized: maxVal(p3)<=1
abstracting: (1<=1) states: 8,440,470,781,232,316,153,857 (21)
-> the formula is TRUE
FORMULA Parking-PT-416-ReachabilityBounds-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: [maxVal(p189)<=2 & maxVal(p56)<=2]
normalized: [maxVal(p189)<=2 & maxVal(p56)<=2]
abstracting: (1<=2) states: 8,440,470,781,232,316,153,857 (21)
abstracting: (1<=2) states: 8,440,470,781,232,316,153,857 (21)
-> the formula is TRUE
FORMULA Parking-PT-416-ReachabilityBounds-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: [[[maxVal(p218)<=2 & maxVal(p256)<=2] & [[[maxVal(p271)<=1 & [maxVal(p50)<=3 & maxVal(p30)<=1]] & [maxVal(p106)<=1 & [maxVal(p271)<=2 & maxVal(p168)<=1]]] & maxVal(p287)<=1]] & maxVal(p206)<=1]
normalized: [maxVal(p206)<=1 & [[maxVal(p218)<=2 & maxVal(p256)<=2] & [maxVal(p287)<=1 & [[maxVal(p271)<=1 & [maxVal(p50)<=3 & maxVal(p30)<=1]] & [maxVal(p106)<=1 & [maxVal(p271)<=2 & maxVal(p168)<=1]]]]]]
abstracting: (1<=1) states: 8,440,470,781,232,316,153,857 (21)
abstracting: (1<=2) states: 8,440,470,781,232,316,153,857 (21)
abstracting: (1<=1) states: 8,440,470,781,232,316,153,857 (21)
abstracting: (1<=1) states: 8,440,470,781,232,316,153,857 (21)
abstracting: (1<=3) states: 8,440,470,781,232,316,153,857 (21)
abstracting: (1<=1) states: 8,440,470,781,232,316,153,857 (21)
abstracting: (1<=1) states: 8,440,470,781,232,316,153,857 (21)
abstracting: (1<=2) states: 8,440,470,781,232,316,153,857 (21)
abstracting: (1<=2) states: 8,440,470,781,232,316,153,857 (21)
abstracting: (1<=1) states: 8,440,470,781,232,316,153,857 (21)
-> the formula is TRUE
FORMULA Parking-PT-416-ReachabilityBounds-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: [[maxVal(p174)<=1 & maxVal(p112)<=1] & [maxVal(p181)<=2 & [maxVal(p57)<=2 & maxVal(p107)<=1]]]
normalized: [[maxVal(p174)<=1 & maxVal(p112)<=1] & [maxVal(p181)<=2 & [maxVal(p57)<=2 & maxVal(p107)<=1]]]
abstracting: (1<=1) states: 8,440,470,781,232,316,153,857 (21)
abstracting: (1<=2) states: 8,440,470,781,232,316,153,857 (21)
abstracting: (1<=2) states: 8,440,470,781,232,316,153,857 (21)
abstracting: (1<=1) states: 8,440,470,781,232,316,153,857 (21)
abstracting: (1<=1) states: 8,440,470,781,232,316,153,857 (21)
-> the formula is TRUE
FORMULA Parking-PT-416-ReachabilityBounds-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: [[[maxVal(p47)<=1 & [maxVal(p229)<=2 & maxVal(p272)<=1]] & [maxVal(p206)<=2 & maxVal(p133)<=2]] & [maxVal(p295)<=1 & maxVal(p1)<=1]]
normalized: [[[maxVal(p206)<=2 & maxVal(p133)<=2] & [maxVal(p47)<=1 & [maxVal(p229)<=2 & maxVal(p272)<=1]]] & [maxVal(p295)<=1 & maxVal(p1)<=1]]
abstracting: (1<=1) states: 8,440,470,781,232,316,153,857 (21)
abstracting: (1<=1) states: 8,440,470,781,232,316,153,857 (21)
abstracting: (1<=1) states: 8,440,470,781,232,316,153,857 (21)
abstracting: (1<=2) states: 8,440,470,781,232,316,153,857 (21)
abstracting: (1<=1) states: 8,440,470,781,232,316,153,857 (21)
abstracting: (1<=2) states: 8,440,470,781,232,316,153,857 (21)
abstracting: (1<=2) states: 8,440,470,781,232,316,153,857 (21)
-> the formula is TRUE
FORMULA Parking-PT-416-ReachabilityBounds-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
Total processing time: 0m28sec
BK_STOP 1433645100327
--------------------
content from stderr:
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: 0m0sec
819 1157 2427 3627 7462 10047 12721 24391 28308 29933 42851
iterations count:11692 (27), effective:634 (1)
initing FirstDep: 0m0sec
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-416"
export BK_EXAMINATION="ReachabilityBounds"
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-416.tgz
mv Parking-PT-416 execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2270"
echo " Executing tool marcie"
echo " Input is Parking-PT-416, examination is ReachabilityBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r232su-smll-143354324800164"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityBounds" = "ReachabilityComputeBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityBounds" != "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 "ReachabilityBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityBounds.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 '
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 ;