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

About the Execution of Marcie for Planning-PT-none

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15915.110 3600000.00 3599979.00 69.70 [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 Planning-PT-none, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r078kn-ebro-143262778600003
=====================================================================


--------------------
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 Planning-PT-none-CTLFireability-0
FORMULA_NAME Planning-PT-none-CTLFireability-1
FORMULA_NAME Planning-PT-none-CTLFireability-10
FORMULA_NAME Planning-PT-none-CTLFireability-11
FORMULA_NAME Planning-PT-none-CTLFireability-12
FORMULA_NAME Planning-PT-none-CTLFireability-13
FORMULA_NAME Planning-PT-none-CTLFireability-14
FORMULA_NAME Planning-PT-none-CTLFireability-15
FORMULA_NAME Planning-PT-none-CTLFireability-2
FORMULA_NAME Planning-PT-none-CTLFireability-3
FORMULA_NAME Planning-PT-none-CTLFireability-4
FORMULA_NAME Planning-PT-none-CTLFireability-5
FORMULA_NAME Planning-PT-none-CTLFireability-6
FORMULA_NAME Planning-PT-none-CTLFireability-7
FORMULA_NAME Planning-PT-none-CTLFireability-8
FORMULA_NAME Planning-PT-none-CTLFireability-9

=== Now, execution of the tool begins

BK_START 1432880461209

Model: Planning-PT-none
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=CTLFireability.xml --memory=6 --suppress --rs-algorithm=3 --place-order=5

parse successfull
net created successfully

(NrP: 126 NrTr: 128 NrArc: 652)

net check time: 0m0sec

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

init dd package: 0m5sec


before gc: list nodes free: 72282

after gc: idd nodes used:19584, unused:63980416; list nodes free:702531312

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

7063 7277 7231 7313 7777 7481 7563 8277 7731 7813 8777 7981 8063 9277 8231 8313 9777 8481 8563 10277 8731 8813 10777 8981 9063 11277 9231 9313 11777 9481 9563 12277 9731 9813 12777 9981 10063 13277 10231 10313 13777 10481 10563 14277 10731 10813 14777 10981 11063 15277 11231 11313 15777 11481 11563 16277 11731 11813 16777 11981 12063 17277 12231 12313 17777 12481 12563 18277 12731 12813 18777 12981 13063 19277 13231 13313 19777 13481 13563 20277 13731 13813 20777 13981 14063 21277 14231 14313 21777 14481 14563 22277 14731 14813 22777 14981 15063 23277 15231 15313 23777 15481 15563 24277 15731 15813 24777 15981 16063 25277 16231 16313 25777 16481 16563 26277 16731 16813 26777 16981 17063 27277 17231 17313 27777 17481 17563 28277 17731 17813 28777 17981 18063 29277 18231 18313 29777 18481 18563 30277 18731 18813 30777 18981 19063 31277 19231 19313 31777 19481 19563 32277 19731 19813 32777 19981 20063 33277 20231 20313 33777 20481 20563

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="Planning-PT-none"
export BK_EXAMINATION="CTLFireability"
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/Planning-PT-none.tgz
mv Planning-PT-none 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 Planning-PT-none, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r078kn-ebro-143262778600003"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "ReachabilityComputeBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.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 ;