About the Execution of Marcie for BridgeAndVehicles-PT-V10P10N10
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
4012.710 | 12784.00 | 11989.00 | 30.30 | 11 2 10 10 10 10 10 10 11 2 10 2 11 10 10 10 | 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 BridgeAndVehicles-PT-V10P10N10, examination is ReachabilityComputeBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r190su-smll-143330904700283
=====================================================================
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-ReachabilityComputeBounds-0
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-ReachabilityComputeBounds-1
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-ReachabilityComputeBounds-10
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-ReachabilityComputeBounds-11
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-ReachabilityComputeBounds-12
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-ReachabilityComputeBounds-13
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-ReachabilityComputeBounds-14
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-ReachabilityComputeBounds-15
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-ReachabilityComputeBounds-2
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-ReachabilityComputeBounds-3
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-ReachabilityComputeBounds-4
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-ReachabilityComputeBounds-5
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-ReachabilityComputeBounds-6
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-ReachabilityComputeBounds-7
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-ReachabilityComputeBounds-8
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-ReachabilityComputeBounds-9
=== Now, execution of the tool begins
BK_START 1433549904177
Model: BridgeAndVehicles-PT-V10P10N10
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=ReachabilityComputeBounds.xml --memory=6 --suppress --rs-algorithm=3 --place-order=5
parse successfull
net created successfully
(NrP: 48 NrTr: 288 NrArc: 2090)
net check time: 0m0sec
parse formulas successfull
formulas created successfully
place and transition orderings generation:0m0sec
init dd package: 0m3sec
RS generation: 0m5sec
-> reachability set: #nodes 103718 (1.0e+05) #states 259,556 (5)
starting MCC model checker
--------------------------
checking: sum(maxVal(COMPTEUR_10), maxVal(COMPTEUR_9), maxVal(COMPTEUR_8), maxVal(COMPTEUR_7), maxVal(COMPTEUR_6), maxVal(COMPTEUR_5), maxVal(COMPTEUR_4), maxVal(COMPTEUR_3), maxVal(COMPTEUR_2), maxVal(COMPTEUR_1), maxVal(COMPTEUR_0))
normalized: sum(maxVal(COMPTEUR_10), maxVal(COMPTEUR_9), maxVal(COMPTEUR_8), maxVal(COMPTEUR_7), maxVal(COMPTEUR_6), maxVal(COMPTEUR_5), maxVal(COMPTEUR_4), maxVal(COMPTEUR_3), maxVal(COMPTEUR_2), maxVal(COMPTEUR_1), maxVal(COMPTEUR_0))
-> the formula is 11
FORMULA BridgeAndVehicles-COL-V10P10N10-ReachabilityComputeBounds-0 11 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: sum(maxVal(VIDANGE_2), maxVal(VIDANGE_1))
normalized: sum(maxVal(VIDANGE_2), maxVal(VIDANGE_1))
-> the formula is 2
FORMULA BridgeAndVehicles-COL-V10P10N10-ReachabilityComputeBounds-1 2 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: sum(maxVal(NB_ATTENTE_A_10), maxVal(NB_ATTENTE_A_9), maxVal(NB_ATTENTE_A_8), maxVal(NB_ATTENTE_A_7), maxVal(NB_ATTENTE_A_6), maxVal(NB_ATTENTE_A_5), maxVal(NB_ATTENTE_A_4), maxVal(NB_ATTENTE_A_3), maxVal(NB_ATTENTE_A_2), maxVal(NB_ATTENTE_A_1), maxVal(NB_ATTENTE_A_0))
normalized: sum(maxVal(NB_ATTENTE_A_10), maxVal(NB_ATTENTE_A_9), maxVal(NB_ATTENTE_A_8), maxVal(NB_ATTENTE_A_7), maxVal(NB_ATTENTE_A_6), maxVal(NB_ATTENTE_A_5), maxVal(NB_ATTENTE_A_4), maxVal(NB_ATTENTE_A_3), maxVal(NB_ATTENTE_A_2), maxVal(NB_ATTENTE_A_1), maxVal(NB_ATTENTE_A_0))
-> the formula is 11
FORMULA BridgeAndVehicles-COL-V10P10N10-ReachabilityComputeBounds-2 11 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: sum(maxVal(CONTROLEUR_2), maxVal(CONTROLEUR_1))
normalized: sum(maxVal(CONTROLEUR_2), maxVal(CONTROLEUR_1))
-> the formula is 2
FORMULA BridgeAndVehicles-COL-V10P10N10-ReachabilityComputeBounds-3 2 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: maxVal(SUR_PONT_A)
normalized: maxVal(SUR_PONT_A)
-> the formula is 10
FORMULA BridgeAndVehicles-COL-V10P10N10-ReachabilityComputeBounds-4 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: sum(maxVal(CONTROLEUR_2), maxVal(CONTROLEUR_1))
normalized: sum(maxVal(CONTROLEUR_2), maxVal(CONTROLEUR_1))
-> the formula is 2
FORMULA BridgeAndVehicles-COL-V10P10N10-ReachabilityComputeBounds-5 2 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: sum(maxVal(NB_ATTENTE_A_10), maxVal(NB_ATTENTE_A_9), maxVal(NB_ATTENTE_A_8), maxVal(NB_ATTENTE_A_7), maxVal(NB_ATTENTE_A_6), maxVal(NB_ATTENTE_A_5), maxVal(NB_ATTENTE_A_4), maxVal(NB_ATTENTE_A_3), maxVal(NB_ATTENTE_A_2), maxVal(NB_ATTENTE_A_1), maxVal(NB_ATTENTE_A_0))
normalized: sum(maxVal(NB_ATTENTE_A_10), maxVal(NB_ATTENTE_A_9), maxVal(NB_ATTENTE_A_8), maxVal(NB_ATTENTE_A_7), maxVal(NB_ATTENTE_A_6), maxVal(NB_ATTENTE_A_5), maxVal(NB_ATTENTE_A_4), maxVal(NB_ATTENTE_A_3), maxVal(NB_ATTENTE_A_2), maxVal(NB_ATTENTE_A_1), maxVal(NB_ATTENTE_A_0))
-> the formula is 11
FORMULA BridgeAndVehicles-COL-V10P10N10-ReachabilityComputeBounds-6 11 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: maxVal(SUR_PONT_B)
normalized: maxVal(SUR_PONT_B)
-> the formula is 10
FORMULA BridgeAndVehicles-COL-V10P10N10-ReachabilityComputeBounds-7 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: maxVal(ROUTE_B)
normalized: maxVal(ROUTE_B)
-> the formula is 10
FORMULA BridgeAndVehicles-COL-V10P10N10-ReachabilityComputeBounds-8 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: maxVal(ATTENTE_B)
normalized: maxVal(ATTENTE_B)
-> the formula is 10
FORMULA BridgeAndVehicles-COL-V10P10N10-ReachabilityComputeBounds-9 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: maxVal(SUR_PONT_B)
normalized: maxVal(SUR_PONT_B)
-> the formula is 10
FORMULA BridgeAndVehicles-COL-V10P10N10-ReachabilityComputeBounds-10 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: maxVal(ATTENTE_B)
normalized: maxVal(ATTENTE_B)
-> the formula is 10
FORMULA BridgeAndVehicles-COL-V10P10N10-ReachabilityComputeBounds-11 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: maxVal(ATTENTE_B)
normalized: maxVal(ATTENTE_B)
-> the formula is 10
FORMULA BridgeAndVehicles-COL-V10P10N10-ReachabilityComputeBounds-12 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: maxVal(ROUTE_B)
normalized: maxVal(ROUTE_B)
-> the formula is 10
FORMULA BridgeAndVehicles-COL-V10P10N10-ReachabilityComputeBounds-13 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: maxVal(ATTENTE_B)
normalized: maxVal(ATTENTE_B)
-> the formula is 10
FORMULA BridgeAndVehicles-COL-V10P10N10-ReachabilityComputeBounds-14 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: maxVal(ROUTE_A)
normalized: maxVal(ROUTE_A)
-> the formula is 10
FORMULA BridgeAndVehicles-COL-V10P10N10-ReachabilityComputeBounds-15 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
Total processing time: 0m12sec
BK_STOP 1433549916961
--------------------
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
268 495 739 4973 11016 11344 12350 13004 19089 19530 19682 19781 19864 19933 20139 20223 20306 20375 24540 24629 24784 25406 26382 26320 26413 26504 29453 29509 29661 29789 30987 30885 30972 31059 33213 33254 33398 34329 34240 34310 34391 35865 35963 36685 36607 36672 36745 37708 37756 38193 38242 38825 38883 39205 39225 39549 39625 39768 39913 40020 40059 40072 40129 40228 40320 42645 42529 42412 42361 41855 41744 41793 41886 43028 42962 42907 42687 42571 42603 42651 43203 43161 43039 43006 43024 43217 43207 43154 43174 43248 43289 44436 44351 44320 44137 44009 44015 44027 44077 44455 44420 44313 44313 44319 44351 44411 44390 44402 44412 44480 45141 45076 45007 44885 44885 44890 44906 45059 45032 45008 45020 45030 45083 45560 45518 45434 45371 45382 45381 45386 45726 45705 45647 45602 45608 45613 45633 45886 45865 45803 45807 45812 45829 46016 46005 45965 45976 45975 45980 46107 46079
iterations count:151826 (527), effective:2667 (9)
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="BridgeAndVehicles-PT-V10P10N10"
export BK_EXAMINATION="ReachabilityComputeBounds"
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/BridgeAndVehicles-PT-V10P10N10.tgz
mv BridgeAndVehicles-PT-V10P10N10 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 BridgeAndVehicles-PT-V10P10N10, examination is ReachabilityComputeBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r190su-smll-143330904700283"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityComputeBounds" = "ReachabilityComputeBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityComputeBounds" != "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 "ReachabilityComputeBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityComputeBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityComputeBounds.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 ;