About the Execution of Marcie for S_NeoElection-COL-7
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
4595.030 | 3600000.00 | 3599489.00 | 550.00 | [undef] | Time out reached |
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-2265
Executing tool marcie
Input is S_NeoElection-COL-7, examination is ReachabilityBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r162st-ebro-143319441400879
=====================================================================
--------------------
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 NeoElection-COL-7-ReachabilityBounds-0
FORMULA_NAME NeoElection-COL-7-ReachabilityBounds-1
FORMULA_NAME NeoElection-COL-7-ReachabilityBounds-10
FORMULA_NAME NeoElection-COL-7-ReachabilityBounds-11
FORMULA_NAME NeoElection-COL-7-ReachabilityBounds-12
FORMULA_NAME NeoElection-COL-7-ReachabilityBounds-13
FORMULA_NAME NeoElection-COL-7-ReachabilityBounds-14
FORMULA_NAME NeoElection-COL-7-ReachabilityBounds-15
FORMULA_NAME NeoElection-COL-7-ReachabilityBounds-2
FORMULA_NAME NeoElection-COL-7-ReachabilityBounds-3
FORMULA_NAME NeoElection-COL-7-ReachabilityBounds-4
FORMULA_NAME NeoElection-COL-7-ReachabilityBounds-5
FORMULA_NAME NeoElection-COL-7-ReachabilityBounds-6
FORMULA_NAME NeoElection-COL-7-ReachabilityBounds-7
FORMULA_NAME NeoElection-COL-7-ReachabilityBounds-8
FORMULA_NAME NeoElection-COL-7-ReachabilityBounds-9
=== Now, execution of the tool begins
BK_START 1433385952120
Model: S_NeoElection-COL-7
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
Unfolding complete |P|=2240|T|=14240|A|=82608
Time for unfolding: 0m1sec
(NrP: 2240 NrTr: 14240 NrArc: 82608)
net check time: 0m0sec
parse formulas successfull
formulas created successfully
place and transition orderings generation:1m36sec
init dd package: 0m5sec
BK_TIME_CONFINEMENT_REACHED
--------------------
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: 0m6sec
7459 8019 8019 15034 15034 30156 30156 30393 62717 62717 65790 65853 65853 66195 66491 79569 79569 87395 87863 87863 88507 88699 89163 89627 89627 85801 87683 89363 89363 98216 98216 109134 121269 117820 117820 117820 126674 126674 126674 126674 137107 137107 145956 145956 145956 145956 154773 163590 163590 163590 163590 172384 172384 181178 181178 181178 181178 189950 189950 198722 198722 198722 207476 207476 216230 216230 216230 216230 224938 224938 233646 233646 233646 233646 238896 246955 246955 254781 254781 246722 246722 267261 267261 283305 279314 279314 296131 296131 308946 308946 304971 304971 318539 318539 328145 328145 324183 324183 334533 334533 340936 336989 336989 344121 344121 347327 347327 343401 343401 347325 347325 347343 347343 343437 343437 486553 486553 486553 493690 493690 370740 370740 497219 498901 498901 498901 501538 501538 373738 373738 499633 500045 502457 502759 503875
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_NeoElection-COL-7"
export BK_EXAMINATION="ReachabilityBounds"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/users/gast00/fkordon/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_NeoElection-COL-7.tgz
mv S_NeoElection-COL-7 execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2265"
echo " Executing tool marcie"
echo " Input is S_NeoElection-COL-7, 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 r162st-ebro-143319441400879"
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 ;