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

About the Execution of Marcie for S_NeoElection-PT-6

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4955.900 3600000.00 3600059.00 10.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 S_NeoElection-PT-6, examination is ReachabilityComputeBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r162st-ebro-143319441400959
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1433388265078

Model: S_NeoElection-PT-6
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: 4830 NrTr: 8435 NrArc: 49028)

net check time: 0m0sec

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

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

8859 8937 13968 24830 24830 25605 25807 29985 29985 32438 33270 32784 33108 33108 32609 34525 37120 39029 39029 39029 40946 40946 50119 50119 53413 50480 55154 55154 56486 51630 55242 56228 56635 57098 57098 58398 53468 55622 55988 58602 58156 61161 62585 62561 66695 66424 68184 70299 70299 70299 70299 76607 82501 82501 82501 85459 85460 82593 82593 91731 100327 100327 100327 103271 103272 100405 100405 112126 123424 123424 123424 126310 126311 123444 138453 138453 152453 152453 155453 155453 155454 152587 169928 186630 186630 186630 189514 189515 186648 186648 353877 353877 353877 515599 517245 517245 517245 530088 530088 530088 530088

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-PT-6"
export BK_EXAMINATION="ReachabilityComputeBounds"
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-PT-6.tgz
mv S_NeoElection-PT-6 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-PT-6, 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 r162st-ebro-143319441400959"
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 '' ReachabilityComputeBounds.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 ;