About the Execution of Marcie for S_CircularTrains-PT-024
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5412.950 | 23421.00 | 23040.00 | 20.00 | 1 2 1 1 2 1 1 2 1 1 1 2 1 1 1 2 | 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-2979
Executing tool marcie
Input is S_CircularTrains-PT-024, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r197kn-qhx2-146444262300065
=====================================================================
--------------------
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 CircularTrains-PT-024-UpperBounds-0
FORMULA_NAME CircularTrains-PT-024-UpperBounds-1
FORMULA_NAME CircularTrains-PT-024-UpperBounds-10
FORMULA_NAME CircularTrains-PT-024-UpperBounds-11
FORMULA_NAME CircularTrains-PT-024-UpperBounds-12
FORMULA_NAME CircularTrains-PT-024-UpperBounds-13
FORMULA_NAME CircularTrains-PT-024-UpperBounds-14
FORMULA_NAME CircularTrains-PT-024-UpperBounds-15
FORMULA_NAME CircularTrains-PT-024-UpperBounds-2
FORMULA_NAME CircularTrains-PT-024-UpperBounds-3
FORMULA_NAME CircularTrains-PT-024-UpperBounds-4
FORMULA_NAME CircularTrains-PT-024-UpperBounds-5
FORMULA_NAME CircularTrains-PT-024-UpperBounds-6
FORMULA_NAME CircularTrains-PT-024-UpperBounds-7
FORMULA_NAME CircularTrains-PT-024-UpperBounds-8
FORMULA_NAME CircularTrains-PT-024-UpperBounds-9
=== Now, execution of the tool begins
BK_START 1465118286313
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=UpperBounds.xml --mcc-mode --memory=6 --suppress
parse successfull
net created successfully
Net: CircularTrains_PT_024
(NrP: 48 NrTr: 24 NrArc: 96)
net check time: 0m 0.000sec
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
init dd package: 0m17.819sec
RS generation: 0m 0.039sec
-> reachability set: #nodes 779 (7.8e+02) #states 86,515 (4)
starting MCC model checker
--------------------------
checking: place_bound(Section_16)
normalized: place_bound(Section_16)
-> the formula is 1
FORMULA CircularTrains-PT-024-UpperBounds-0 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(F14)
normalized: place_bound(F14)
-> the formula is 2
FORMULA CircularTrains-PT-024-UpperBounds-1 2 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(Section_13)
normalized: place_bound(Section_13)
-> the formula is 1
FORMULA CircularTrains-PT-024-UpperBounds-2 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(F1)
normalized: place_bound(F1)
-> the formula is 1
FORMULA CircularTrains-PT-024-UpperBounds-3 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(Section_19)
normalized: place_bound(Section_19)
-> the formula is 1
FORMULA CircularTrains-PT-024-UpperBounds-4 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(F8)
normalized: place_bound(F8)
-> the formula is 2
FORMULA CircularTrains-PT-024-UpperBounds-5 2 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(Section_4)
normalized: place_bound(Section_4)
-> the formula is 1
FORMULA CircularTrains-PT-024-UpperBounds-6 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(Section_24)
normalized: place_bound(Section_24)
-> the formula is 1
FORMULA CircularTrains-PT-024-UpperBounds-7 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(F15)
normalized: place_bound(F15)
-> the formula is 1
FORMULA CircularTrains-PT-024-UpperBounds-8 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(F20)
normalized: place_bound(F20)
-> the formula is 2
FORMULA CircularTrains-PT-024-UpperBounds-9 2 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(F12)
normalized: place_bound(F12)
-> the formula is 1
FORMULA CircularTrains-PT-024-UpperBounds-10 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(F9)
normalized: place_bound(F9)
-> the formula is 1
FORMULA CircularTrains-PT-024-UpperBounds-11 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(F20)
normalized: place_bound(F20)
-> the formula is 2
FORMULA CircularTrains-PT-024-UpperBounds-12 2 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(Section_14)
normalized: place_bound(Section_14)
-> the formula is 1
FORMULA CircularTrains-PT-024-UpperBounds-13 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(F1)
normalized: place_bound(F1)
-> the formula is 1
FORMULA CircularTrains-PT-024-UpperBounds-14 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(F17)
normalized: place_bound(F17)
-> the formula is 2
FORMULA CircularTrains-PT-024-UpperBounds-15 2 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
Total processing time: 0m23.366sec
BK_STOP 1465118309734
--------------------
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.003sec
iterations count:464 (19), effective:96 (4)
initing FirstDep: 0m 0.000sec
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="S_CircularTrains-PT-024"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/home/fko/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/S_CircularTrains-PT-024.tgz
mv S_CircularTrains-PT-024 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 S_CircularTrains-PT-024, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r197kn-qhx2-146444262300065"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 ;