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

About the Execution of Marcie for S_Peterson-COL-6

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4199.530 3600000.00 3600019.00 20.20 [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-6, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r204st-blw3-143341204700289
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1433643449519

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

parse successfull
net created successfully

Unfolding complete |P|=1372|T|=2114|A|=6608
Time for unfolding: 0m0sec

(NrP: 1372 NrTr: 2114 NrArc: 6608)

net check time: 0m0sec

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

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

1372 2291 3989 9640 10896 11860 12638 12638 12638 11394 9688 15021 15892 15892 18570 17366 24414 25040 26900 25814 31608 31608 34653 35450 32013 36833 36898 36898 38282 38168 42223 44745 42989 44787 45543 43964 47247 48694 46428 49985 51092 66440 67852 67852 67852 67852 71016 68449 72910 76606 82390 83399 83354 83446 92614 96485 105647 105647 109840 113796 115078 116165 120415 120415 122629 130681 134213 138036 138034 139443 143156 144655 145356 143744 137120 137456 134694 133679 134060 133200 134721 218859 260679 260714 266569 289469 292243 289995 306854 306885 322517 325341 325882 332621 326368 326002 325269 342030 345719 361098 363960 361144 364779 366385 367553 367553 360772 356843 356986 355931 360685 360376 357884 357505 361708 358677 356617 357156 353610 353110 351690 349368 347876 347876 346431 345292 369683 368479 366314 367932 376396 376392 376868 376378 393086 398909

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-6"
export BK_EXAMINATION="CTLFireability"
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-6.tgz
mv S_Peterson-COL-6 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-6, 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 r204st-blw3-143341204700289"
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 ;