fond
Model Checking Contest @ Petri Nets 2015
Bruxelles, Belgium, June 23, 2015
Execution of r050kn-ebro-143236504200970
Last Updated
August 19, 2015

About the Execution of Marcie for NeoElection-PT-7

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
6130.780 3600000.00 3600159.00 300.10 [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 NeoElection-PT-7, examination is ReachabilityBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r050kn-ebro-143236504200970
=====================================================================


--------------------
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 1432555681349

Model: NeoElection-PT-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

(NrP: 7128 NrTr: 14112 NrArc: 81968)

net check time: 0m0sec

parse formulas successfull
formulas created successfully
place and transition orderings generation:1m44sec

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

11305 11305 16533 16533 28195 28195 53768 53405 53483 56095 56095 56262 56642 65121 65121 69149 70013 70057 70393 70553 70553 69017 70599 70599 74666 74666 82969 86917 86917 86917 86917 90985 90985 90985 95656 95656 100079 100079 108197 108197 108197 112193 112193 116189 116189 116189 120175 120175 124161 124161 124161 128141 132121 132121 132121 132121 136079 140037 140037 140037 140037 145287 153346 153346 159948 151889 151889 164445 164445 174689 192485 192485 188153 188153 196232 202150 202150 199989 199989 206078 210017 210017 207867 207867 211974 213948 213948 211815 211815 213946 213956 213956 211835 211835 298053 298053 298053 298053 301840 231167 231167 306568 306668 308542 309346 309956 309956 309956 309956 313643 313643 235327 305801 305801 359836 359836 347269 347269 471685 471685 557550 518421 518421 530014 639382 704172 722524 731700 933386 933386 921793 921793 921793

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="NeoElection-PT-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/NeoElection-PT-7.tgz
mv NeoElection-PT-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 NeoElection-PT-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 r050kn-ebro-143236504200970"
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 ;