fond
Model Checking Contest @ Petri Nets 2016
6th edition, Toruń, Poland, June 21, 2016
Execution of r089kn-ebro-146369094400902
Last Updated
June 30, 2016

About the Execution of Marcie for PolyORBNT-COL-S10J80

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5658.700 3600000.00 3600444.00 30.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-2979
Executing tool marcie
Input is PolyORBNT-COL-S10J80, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r089kn-ebro-146369094400902
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1464136179818


Marcie rev. 8535M (built: crohr on 2016-04-27)
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=UpperBounds.xml --mcc-mode --memory=6 --suppress

parse successfull
net created successfully

Unfolding complete |P|=1694|T|=13580|A|=131739
Time for unfolding: 0m12.270sec

Net: PolyORBNT_COL_S10J80
(NrP: 1694 NrTr: 13580 NrArc: 119919)

net check time: 0m 0.065sec

parse formulas
formulas created successfully
place and transition orderings generation:0m53.383sec

init dd package: 0m 7.252sec


BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

check for maximal unmarked siphon
found
The net has a maximal unmarked siphon:
Schedule_Task_E_Threads1_States1_Jobs1
Schedule_Task_E_Threads1_States1_Jobs2
Schedule_Task_E_Threads1_States1_Jobs3
Schedule_Task_E_Threads1_States1_Jobs4
Schedule_Task_E_Threads1_States1_Jobs5
Schedule_Task_E_Threads1_States1_Jobs6
Schedule_Task_E_Threads1_States1_Jobs7
Schedule_Task_E_Threads1_States1_Jobs8
Schedule_Task_E_Threads1_States1_Jobs9
Schedule_Task_E_Threads1_States1_Jobs10
Schedule_Task_E_Threads1_States1_Jobs11
Schedule_Task_E_Threads1_States1_Jobs12
Schedule_Task_E_Threads1_States1_Jobs13
Schedule_Task_E_Threads1_States1_Jobs14
Schedule_Task_E_Threads1_States1_Jobs15
Schedule_Task_E_Threads1_States1_Jobs16
Schedule_Task_E_Threads1_States1_Jobs17
Schedule_Task_E_Threads1_States1_Jobs18
Schedule_Task_E_Threads1_States1_Jobs19
Schedule_Task_E_Threads1_States1_Jobs20
Schedule_Task_E_Threads1_States1_Jobs21
Schedule_Task_E_Threads1_States1_Jobs22
Schedule_Task_E_Threads1_States1_Jobs23
Schedule_Task_E_Threads1_States1_Jobs24
Schedule_Task_E_Threads1_States1_Jobs25
Schedule_Task_E_Threads1_States1_Jobs26
Schedule_Task_E_Threads1_States1_Jobs27
Schedule_Task_E_Threads1_States1_Jobs28
Schedule_Task_E_Threads1_States1_Jobs29
Schedule_Task_E_Threads1_States1_Jobs30
Schedule_Task_E_Threads1_States1_Jobs31
Schedule_Task_E_Threads1_States1_Jobs32
Schedule_Task_E_Threads1_States1_Jobs33
Schedule_Task_E_Threads1_States1_Jobs34
Schedule_Task_E_Threads1_States1_Jobs35
Schedule_Task_E_Threads1_States1_Jobs36
Schedule_Task_E_Threads1_States1_Jobs37
Schedule_Task_E_Threads1_States1_Jobs38
Schedule_Task_E_Threads1_States1_Jobs39
Schedule_Task_E_Threads1_States1_Jobs40
Schedule_Task_E_Threads1_States1_Jobs41
Schedule_Task_E_Threads1_States1_Jobs42
Schedule_Task_E_Threads1_States1_Jobs43
Schedule_Task_E_Threads1_States1_Jobs44
Schedule_Task_E_Threads1_States1_Jobs45
Schedule_Task_E_Threads1_States1_Jobs46
Schedule_Task_E_Threads1_States1_Jobs47
Schedule_Task_E_Threads1_States1_Jobs48
Schedule_Task_E_Threads1_States1_Jobs49
Schedule_Task_E_Threads1_States1_Jobs50
Schedule_Task_E_Threads1_States1_Jobs51
Schedule_Task_E_Threads1_States1_Jobs52
Schedule_Task_E_Threads1_States1_Jobs53
Schedule_Task_E_Threads1_States1_Jobs54
Schedule_Task_E_Threads1_States1_Jobs55
Schedule_Task_E_Threads1_States1_Jobs56
Schedule_Task_E_Threads1_States1_Jobs57
Schedule_Task_E_Threads1_States1_Jobs58
Schedule_Task_E_Threads1_States1_Jobs59
Schedule_Task_E_Threads1_States1_Jobs60
Schedule_Task_E_Threads1_States1_Jobs61
Schedule_Task_E_Threads1_States1_Jobs62
Schedule_Task_E_Threads1_States1_Jobs63
Schedule_Task_E_Threads1_States1_Jobs64
Schedule_Task_E_Threads1_States1_Jobs65
Schedule_Task_E_Threads1_States1_Jobs66
Schedule_Task_E_Threads1_States1_Jobs67
Schedule_Task_E_Threads1_States1_Jobs68
Schedule_Task_E_Threads1_States1_Jobs69
Schedule_Task_E_Threads1_States1_Jobs70
Schedule_Task_E_Threads1_States1_Jobs71
Schedule_Task_E_Threads1_States1_Jobs72
Schedule_Task_E_Threads1_States1_Jobs73
Schedule_Task_E_Threads1_States1_Jobs74
Schedule_Task_E_Threads1_States1_Jobs75
Schedule_Task_E_Threads1_States1_Jobs76
Schedule_Task_E_Threads1_States1_Jobs77
Schedule_Task_E_Threads1_States1_Jobs78
Schedule_Task_E_Threads1_States1_Jobs79
Schedule_Task_E_Threads1_States1_Jobs80

The net has transition(s) that can never fire:
GoCheckSource_1_1_0
GoCheckSource_2_1_0
GoCheckSource_3_1_0
GoCheckSource_5_1_0
GoCheckSource_4_1_0
GoCheckSource_6_1_0
GoCheckSource_7_1_0
GoCheckSource_8_1_0
GoCheckSource_9_1_0
GoCheckSource_10_1_0
GoCheckSource_11_1_0
GoCheckSource_12_1_0
GoCheckSource_13_1_0
GoCheckSource_14_1_0
GoCheckSource_16_1_0
GoCheckSource_17_1_0
GoCheckSource_15_1_0
GoCheckSource_19_1_0
GoCheckSource_18_1_0
GoCheckSource_33_1_0
GoCheckSource_20_1_0
GoCheckSource_22_1_0
GoCheckSource_23_1_0
GoCheckSource_21_1_0
GoCheckSource_24_1_0
GoCheckSource_26_1_0
GoCheckSource_27_1_0
GoCheckSource_25_1_0
GoCheckSource_28_1_0
GoCheckSource_30_1_0
GoCheckSource_31_1_0
GoCheckSource_29_1_0
GoCheckSource_32_1_0
GoCheckSource_35_1_0
GoCheckSource_36_1_0
GoCheckSource_34_1_0
GoCheckSource_37_1_0
GoCheckSource_39_1_0
GoCheckSource_40_1_0
GoCheckSource_38_1_0
GoCheckSource_41_1_0
GoCheckSource_43_1_0
GoCheckSource_44_1_0
GoCheckSource_42_1_0
GoCheckSource_45_1_0
GoCheckSource_47_1_0
GoCheckSource_48_1_0
GoCheckSource_46_1_0
GoCheckSource_49_1_0
GoCheckSource_51_1_0
GoCheckSource_52_1_0
GoCheckSource_50_1_0
GoCheckSource_53_1_0
GoCheckSource_55_1_0
GoCheckSource_56_1_0
GoCheckSource_54_1_0
GoCheckSource_57_1_0
GoCheckSource_59_1_0
GoCheckSource_60_1_0
GoCheckSource_58_1_0
GoCheckSource_61_1_0
GoCheckSource_63_1_0
GoCheckSource_64_1_0
GoCheckSource_62_1_0
GoCheckSource_65_1_0
GoCheckSource_66_1_0
GoCheckSource_67_1_0
GoCheckSource_69_1_0
GoCheckSource_68_1_0
GoCheckSource_71_1_0
GoCheckSource_70_1_0
GoCheckSource_73_1_0
GoCheckSource_72_1_0
GoCheckSource_75_1_0
GoCheckSource_74_1_0
GoCheckSource_77_1_0
GoCheckSource_76_1_0
GoCheckSource_79_1_0
GoCheckSource_78_1_0
GoCheckSource_80_1_0

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: 0m 0.508sec

1739 3321 3321 3321 5054 5058 8209 8217 14144 14152 14160 25707 25739 48206 48238 92769 92833 92897 181540 181732 181796 358375 358887 710378 711402 1370349 1372397 1372419 1374293 1375872

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="PolyORBNT-COL-S10J80"
export BK_EXAMINATION="UpperBounds"
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/PolyORBNT-COL-S10J80.tgz
mv PolyORBNT-COL-S10J80 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool marcie"
echo " Input is PolyORBNT-COL-S10J80, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r089kn-ebro-146369094400902"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '' UpperBounds.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 ;