fond
Model Checking Contest @ Petri Nets 2015
Bruxelles, Belgium, June 23, 2015
Execution of r204st-blw3-143341204700281
Last Updated
August 19, 2015

About the Execution of Marcie for S_Peterson-COL-5

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4259.250 3600000.00 3600038.00 20.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-2270
Executing tool marcie
Input is S_Peterson-COL-5, examination is ReachabilityBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r204st-blw3-143341204700281
=====================================================================


--------------------
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 Peterson-COL-5-ReachabilityBounds-0
FORMULA_NAME Peterson-COL-5-ReachabilityBounds-1
FORMULA_NAME Peterson-COL-5-ReachabilityBounds-10
FORMULA_NAME Peterson-COL-5-ReachabilityBounds-11
FORMULA_NAME Peterson-COL-5-ReachabilityBounds-12
FORMULA_NAME Peterson-COL-5-ReachabilityBounds-13
FORMULA_NAME Peterson-COL-5-ReachabilityBounds-14
FORMULA_NAME Peterson-COL-5-ReachabilityBounds-15
FORMULA_NAME Peterson-COL-5-ReachabilityBounds-2
FORMULA_NAME Peterson-COL-5-ReachabilityBounds-3
FORMULA_NAME Peterson-COL-5-ReachabilityBounds-4
FORMULA_NAME Peterson-COL-5-ReachabilityBounds-5
FORMULA_NAME Peterson-COL-5-ReachabilityBounds-6
FORMULA_NAME Peterson-COL-5-ReachabilityBounds-7
FORMULA_NAME Peterson-COL-5-ReachabilityBounds-8
FORMULA_NAME Peterson-COL-5-ReachabilityBounds-9

=== Now, execution of the tool begins

BK_START 1433642629868

Model: S_Peterson-COL-5
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|=864|T|=1302|A|=4068
Time for unfolding: 0m0sec

(NrP: 864 NrTr: 1302 NrArc: 4068)

net check time: 0m0sec

parse formulas successfull
formulas created successfully
place and transition orderings generation:0m0sec

init dd package: 0m3sec


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: 0m0sec

1438 2653 4525 5030 5030 3920 6232 7179 8453 8449 20969 21741 21741 22949 25474 27802 29802 31632 36654 38186 37279 46248 48049 52775 55679 57947 59010 60996 65202 65678 66465 67737 68570 70984 73168 75276 75153 77199 79716 81732 84257 85608 85958 87672 90313 89685 88800 88351 89657 90889 90639 90410 91622 88150 92214 91967 89338 143647 147708 162930 164035 172812 183379 190041 186688 185990 186316 189180 186809 195689 201837 210053 213118 213411 215016 208649 204599 202839 224677 223720 224693 226165 228758 229810 229805 234225 238048 243853 255439 257837 257630 261821 261846 258375 253503 259620 261659 266596 270920 280227 284455 297252 296994 300007 304827 307536 307185 309216 316541 314265 309320 304627 308615 309977 313932 313478 317648 319274 322733 324664 324391 329204 329501 331011 332129 336106 335157 334461 333935 328589 320872 323133 321424 326833 326714 325748 325481 325624 328632 327184 327425 329970 327864 329570 330741 329315 329783 332628 331713 329108 329831 330290 325555 321848 321828 323844 327296 327661 320943 320483 320861 319788 320293 318131 318560 315283 314305 317688 317526 317608 317101 316309 312806 313512 313647 314407 314316 313868 313382 312662 312893 313683 313551 313270 313270 313433 441447 452561 496727 498903 522983 552241 572071 568376 572698 568365 598231 605653

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_Peterson-COL-5"
export BK_EXAMINATION="ReachabilityBounds"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/user/u8/hulinhub/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_Peterson-COL-5.tgz
mv S_Peterson-COL-5 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 S_Peterson-COL-5, 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 r204st-blw3-143341204700281"
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 '' ReachabilityBounds.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 ;