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 CSRepetitions-COL-03, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r005kn-ebro-146347673100443
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463603788522


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|=58|T|=81|A|=279
Time for unfolding: 0m 1.182sec

Net: CSRepetitions_COL_03
(NrP: 58 NrTr: 81 NrArc: 279)

net check time: 0m 0.000sec

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.001sec

init dd package: 0m 7.441sec


RS generation: 0m34.824sec


-> reachability set: #nodes 17237 (1.7e+04) #states 134,074,721 (8)



starting MCC model checker
--------------------------

checking: place_bound(requestBufferSlots_dot)
normalized: place_bound(requestBufferSlots_dot)

-> the formula is 3

FORMULA CSRepetitions-COL-03-UpperBounds-4 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.018sec

checking: place_bound(requestBufferSlots_dot)
normalized: place_bound(requestBufferSlots_dot)

-> the formula is 3

FORMULA CSRepetitions-COL-03-UpperBounds-13 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(serverWaiting_sId1,serverWaiting_sId2,serverWaiting_sId3)
normalized: place_bound(serverWaiting_sId1,serverWaiting_sId2,serverWaiting_sId3)

-> the formula is 3

FORMULA CSRepetitions-COL-03-UpperBounds-1 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(serverWaiting_sId1,serverWaiting_sId2,serverWaiting_sId3)
normalized: place_bound(serverWaiting_sId1,serverWaiting_sId2,serverWaiting_sId3)

-> the formula is 3

FORMULA CSRepetitions-COL-03-UpperBounds-5 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(serverWaiting_sId1,serverWaiting_sId2,serverWaiting_sId3)
normalized: place_bound(serverWaiting_sId1,serverWaiting_sId2,serverWaiting_sId3)

-> the formula is 3

FORMULA CSRepetitions-COL-03-UpperBounds-7 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(serverWaiting_sId1,serverWaiting_sId2,serverWaiting_sId3)
normalized: place_bound(serverWaiting_sId1,serverWaiting_sId2,serverWaiting_sId3)

-> the formula is 3

FORMULA CSRepetitions-COL-03-UpperBounds-8 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(requestBuffer_cId1,requestBuffer_cId2,requestBuffer_cId3,requestBuffer_cId4,requestBuffer_cId5,requestBuffer_cId6,requestBuffer_cId7,requestBuffer_cId8,requestBuffer_cId9)
normalized: place_bound(requestBuffer_cId1,requestBuffer_cId2,requestBuffer_cId3,requestBuffer_cId4,requestBuffer_cId5,requestBuffer_cId6,requestBuffer_cId7,requestBuffer_cId8,requestBuffer_cId9)

-> the formula is 3

FORMULA CSRepetitions-COL-03-UpperBounds-0 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(clientSending_cId1,clientSending_cId2,clientSending_cId3,clientSending_cId4,clientSending_cId5,clientSending_cId6,clientSending_cId7,clientSending_cId8,clientSending_cId9)
normalized: place_bound(clientSending_cId1,clientSending_cId2,clientSending_cId3,clientSending_cId4,clientSending_cId5,clientSending_cId6,clientSending_cId7,clientSending_cId8,clientSending_cId9)

-> the formula is 9

FORMULA CSRepetitions-COL-03-UpperBounds-3 9 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(clientWaiting_cId1,clientWaiting_cId2,clientWaiting_cId3,clientWaiting_cId4,clientWaiting_cId5,clientWaiting_cId6,clientWaiting_cId7,clientWaiting_cId8,clientWaiting_cId9)
normalized: place_bound(clientWaiting_cId1,clientWaiting_cId2,clientWaiting_cId3,clientWaiting_cId4,clientWaiting_cId5,clientWaiting_cId6,clientWaiting_cId7,clientWaiting_cId8,clientWaiting_cId9)

-> the formula is 9

FORMULA CSRepetitions-COL-03-UpperBounds-6 9 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(requestBuffer_cId1,requestBuffer_cId2,requestBuffer_cId3,requestBuffer_cId4,requestBuffer_cId5,requestBuffer_cId6,requestBuffer_cId7,requestBuffer_cId8,requestBuffer_cId9)
normalized: place_bound(requestBuffer_cId1,requestBuffer_cId2,requestBuffer_cId3,requestBuffer_cId4,requestBuffer_cId5,requestBuffer_cId6,requestBuffer_cId7,requestBuffer_cId8,requestBuffer_cId9)

-> the formula is 3

FORMULA CSRepetitions-COL-03-UpperBounds-10 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(requestBuffer_cId1,requestBuffer_cId2,requestBuffer_cId3,requestBuffer_cId4,requestBuffer_cId5,requestBuffer_cId6,requestBuffer_cId7,requestBuffer_cId8,requestBuffer_cId9)
normalized: place_bound(requestBuffer_cId1,requestBuffer_cId2,requestBuffer_cId3,requestBuffer_cId4,requestBuffer_cId5,requestBuffer_cId6,requestBuffer_cId7,requestBuffer_cId8,requestBuffer_cId9)

-> the formula is 3

FORMULA CSRepetitions-COL-03-UpperBounds-12 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(clientSending_cId1,clientSending_cId2,clientSending_cId3,clientSending_cId4,clientSending_cId5,clientSending_cId6,clientSending_cId7,clientSending_cId8,clientSending_cId9)
normalized: place_bound(clientSending_cId1,clientSending_cId2,clientSending_cId3,clientSending_cId4,clientSending_cId5,clientSending_cId6,clientSending_cId7,clientSending_cId8,clientSending_cId9)

-> the formula is 9

FORMULA CSRepetitions-COL-03-UpperBounds-14 9 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(serverAnwering_cId1_sId1,serverAnwering_cId1_sId2,serverAnwering_cId1_sId3,serverAnwering_cId2_sId1,serverAnwering_cId2_sId2,serverAnwering_cId2_sId3,serverAnwering_cId3_sId1,serverAnwering_cId3_sId2,serverAnwering_cId3_sId3,serverAnwering_cId4_sId1,serverAnwering_cId4_sId2,serverAnwering_cId4_sId3,serverAnwering_cId5_sId1,serverAnwering_cId5_sId2,serverAnwering_cId5_sId3,serverAnwering_cId6_sId1,serverAnwering_cId6_sId2,serverAnwering_cId6_sId3,serverAnwering_cId7_sId1,serverAnwering_cId7_sId2,serverAnwering_cId7_sId3,serverAnwering_cId8_sId1,serverAnwering_cId8_sId2,serverAnwering_cId8_sId3,serverAnwering_cId9_sId1,serverAnwering_cId9_sId2,serverAnwering_cId9_sId3)
normalized: place_bound(serverAnwering_cId1_sId1,serverAnwering_cId1_sId2,serverAnwering_cId1_sId3,serverAnwering_cId2_sId1,serverAnwering_cId2_sId2,serverAnwering_cId2_sId3,serverAnwering_cId3_sId1,serverAnwering_cId3_sId2,serverAnwering_cId3_sId3,serverAnwering_cId4_sId1,serverAnwering_cId4_sId2,serverAnwering_cId4_sId3,serverAnwering_cId5_sId1,serverAnwering_cId5_sId2,serverAnwering_cId5_sId3,serverAnwering_cId6_sId1,serverAnwering_cId6_sId2,serverAnwering_cId6_sId3,serverAnwering_cId7_sId1,serverAnwering_cId7_sId2,serverAnwering_cId7_sId3,serverAnwering_cId8_sId1,serverAnwering_cId8_sId2,serverAnwering_cId8_sId3,serverAnwering_cId9_sId1,serverAnwering_cId9_sId2,serverAnwering_cId9_sId3)

-> the formula is 3

FORMULA CSRepetitions-COL-03-UpperBounds-2 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(serverAnwering_cId1_sId1,serverAnwering_cId1_sId2,serverAnwering_cId1_sId3,serverAnwering_cId2_sId1,serverAnwering_cId2_sId2,serverAnwering_cId2_sId3,serverAnwering_cId3_sId1,serverAnwering_cId3_sId2,serverAnwering_cId3_sId3,serverAnwering_cId4_sId1,serverAnwering_cId4_sId2,serverAnwering_cId4_sId3,serverAnwering_cId5_sId1,serverAnwering_cId5_sId2,serverAnwering_cId5_sId3,serverAnwering_cId6_sId1,serverAnwering_cId6_sId2,serverAnwering_cId6_sId3,serverAnwering_cId7_sId1,serverAnwering_cId7_sId2,serverAnwering_cId7_sId3,serverAnwering_cId8_sId1,serverAnwering_cId8_sId2,serverAnwering_cId8_sId3,serverAnwering_cId9_sId1,serverAnwering_cId9_sId2,serverAnwering_cId9_sId3)
normalized: place_bound(serverAnwering_cId1_sId1,serverAnwering_cId1_sId2,serverAnwering_cId1_sId3,serverAnwering_cId2_sId1,serverAnwering_cId2_sId2,serverAnwering_cId2_sId3,serverAnwering_cId3_sId1,serverAnwering_cId3_sId2,serverAnwering_cId3_sId3,serverAnwering_cId4_sId1,serverAnwering_cId4_sId2,serverAnwering_cId4_sId3,serverAnwering_cId5_sId1,serverAnwering_cId5_sId2,serverAnwering_cId5_sId3,serverAnwering_cId6_sId1,serverAnwering_cId6_sId2,serverAnwering_cId6_sId3,serverAnwering_cId7_sId1,serverAnwering_cId7_sId2,serverAnwering_cId7_sId3,serverAnwering_cId8_sId1,serverAnwering_cId8_sId2,serverAnwering_cId8_sId3,serverAnwering_cId9_sId1,serverAnwering_cId9_sId2,serverAnwering_cId9_sId3)

-> the formula is 3

FORMULA CSRepetitions-COL-03-UpperBounds-9 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(serverAnwering_cId1_sId1,serverAnwering_cId1_sId2,serverAnwering_cId1_sId3,serverAnwering_cId2_sId1,serverAnwering_cId2_sId2,serverAnwering_cId2_sId3,serverAnwering_cId3_sId1,serverAnwering_cId3_sId2,serverAnwering_cId3_sId3,serverAnwering_cId4_sId1,serverAnwering_cId4_sId2,serverAnwering_cId4_sId3,serverAnwering_cId5_sId1,serverAnwering_cId5_sId2,serverAnwering_cId5_sId3,serverAnwering_cId6_sId1,serverAnwering_cId6_sId2,serverAnwering_cId6_sId3,serverAnwering_cId7_sId1,serverAnwering_cId7_sId2,serverAnwering_cId7_sId3,serverAnwering_cId8_sId1,serverAnwering_cId8_sId2,serverAnwering_cId8_sId3,serverAnwering_cId9_sId1,serverAnwering_cId9_sId2,serverAnwering_cId9_sId3)
normalized: place_bound(serverAnwering_cId1_sId1,serverAnwering_cId1_sId2,serverAnwering_cId1_sId3,serverAnwering_cId2_sId1,serverAnwering_cId2_sId2,serverAnwering_cId2_sId3,serverAnwering_cId3_sId1,serverAnwering_cId3_sId2,serverAnwering_cId3_sId3,serverAnwering_cId4_sId1,serverAnwering_cId4_sId2,serverAnwering_cId4_sId3,serverAnwering_cId5_sId1,serverAnwering_cId5_sId2,serverAnwering_cId5_sId3,serverAnwering_cId6_sId1,serverAnwering_cId6_sId2,serverAnwering_cId6_sId3,serverAnwering_cId7_sId1,serverAnwering_cId7_sId2,serverAnwering_cId7_sId3,serverAnwering_cId8_sId1,serverAnwering_cId8_sId2,serverAnwering_cId8_sId3,serverAnwering_cId9_sId1,serverAnwering_cId9_sId2,serverAnwering_cId9_sId3)

-> the formula is 3

FORMULA CSRepetitions-COL-03-UpperBounds-11 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(serverAnwering_cId1_sId1,serverAnwering_cId1_sId2,serverAnwering_cId1_sId3,serverAnwering_cId2_sId1,serverAnwering_cId2_sId2,serverAnwering_cId2_sId3,serverAnwering_cId3_sId1,serverAnwering_cId3_sId2,serverAnwering_cId3_sId3,serverAnwering_cId4_sId1,serverAnwering_cId4_sId2,serverAnwering_cId4_sId3,serverAnwering_cId5_sId1,serverAnwering_cId5_sId2,serverAnwering_cId5_sId3,serverAnwering_cId6_sId1,serverAnwering_cId6_sId2,serverAnwering_cId6_sId3,serverAnwering_cId7_sId1,serverAnwering_cId7_sId2,serverAnwering_cId7_sId3,serverAnwering_cId8_sId1,serverAnwering_cId8_sId2,serverAnwering_cId8_sId3,serverAnwering_cId9_sId1,serverAnwering_cId9_sId2,serverAnwering_cId9_sId3)
normalized: place_bound(serverAnwering_cId1_sId1,serverAnwering_cId1_sId2,serverAnwering_cId1_sId3,serverAnwering_cId2_sId1,serverAnwering_cId2_sId2,serverAnwering_cId2_sId3,serverAnwering_cId3_sId1,serverAnwering_cId3_sId2,serverAnwering_cId3_sId3,serverAnwering_cId4_sId1,serverAnwering_cId4_sId2,serverAnwering_cId4_sId3,serverAnwering_cId5_sId1,serverAnwering_cId5_sId2,serverAnwering_cId5_sId3,serverAnwering_cId6_sId1,serverAnwering_cId6_sId2,serverAnwering_cId6_sId3,serverAnwering_cId7_sId1,serverAnwering_cId7_sId2,serverAnwering_cId7_sId3,serverAnwering_cId8_sId1,serverAnwering_cId8_sId2,serverAnwering_cId8_sId3,serverAnwering_cId9_sId1,serverAnwering_cId9_sId2,serverAnwering_cId9_sId3)

-> the formula is 3

FORMULA CSRepetitions-COL-03-UpperBounds-15 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec


Total processing time: 0m49.507sec


BK_STOP 1463603838090

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

check for maximal unmarked siphon
ok
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.000sec

1305 1030 1797 1436 2684 2772 2103 3411 4023 4671 4036 5973 7117 5523 7794 7181 6174 10125 12697 12665 14890 14718 13297 12480 10333 18729 23684 23779 18059 28590 26257 26325 24522 23207 19339
iterations count:35576 (439), effective:2004 (24)

initing FirstDep: 0m 0.000sec

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="CSRepetitions-COL-03"
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/CSRepetitions-COL-03.tgz
mv CSRepetitions-COL-03 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 CSRepetitions-COL-03, 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 r005kn-ebro-146347673100443"
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 ;