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-3, examination is ReachabilityBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r204st-blw3-143341204600255
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1433642050621

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

parse successfull
net created successfully

Unfolding complete |P|=256|T|=356|A|=1112
Time for unfolding: 0m0sec

(NrP: 256 NrTr: 356 NrArc: 1112)

net check time: 0m0sec

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

init dd package: 0m3sec


RS generation: 0m51sec


-> reachability set: #nodes 68698 (6.9e+04) #states 3,407,946 (6)



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

checking: [[[maxVal(beginLoop)<=1 & [[maxVal(turn)<=1 & maxVal(CS)<=1] & maxVal(isEndLoop)<=1]] & maxVal(turn)<=3] & [maxVal(testIdentity)<=3 & maxVal(turn)<=3]]
normalized: [[maxVal(testIdentity)<=3 & maxVal(turn)<=3] & [maxVal(turn)<=3 & [maxVal(beginLoop)<=1 & [maxVal(isEndLoop)<=1 & [maxVal(turn)<=1 & maxVal(CS)<=1]]]]]


FORMULA Peterson-COL-3-ReachabilityBounds-0CANNOT_COMPUTE

MC time: 0m0sec

checking: [maxVal(beginLoop)<=1 & [maxVal(isEndLoop)<=2 & [maxVal(CS)<=2 & maxVal(turn)<=3]]]
normalized: [maxVal(beginLoop)<=1 & [maxVal(isEndLoop)<=2 & [maxVal(CS)<=2 & maxVal(turn)<=3]]]


FORMULA Peterson-COL-3-ReachabilityBounds-1CANNOT_COMPUTE

MC time: 0m0sec

checking: [[[maxVal(turn)<=2 & [maxVal(isEndLoop)<=2 & [[maxVal(askForSection)<=2 & maxVal(askForSection)<=2] & [maxVal(askForSection)<=1 & maxVal(beginLoop)<=1]]]] & [maxVal(testIdentity)<=3 & maxVal(isEndLoop)<=1]] & maxVal(askForSection)<=1]
normalized: [maxVal(askForSection)<=1 & [[maxVal(turn)<=2 & [maxVal(isEndLoop)<=2 & [[maxVal(askForSection)<=2 & maxVal(askForSection)<=2] & [maxVal(askForSection)<=1 & maxVal(beginLoop)<=1]]]] & [maxVal(testIdentity)<=3 & maxVal(isEndLoop)<=1]]]


FORMULA Peterson-COL-3-ReachabilityBounds-2CANNOT_COMPUTE

MC time: 0m0sec

checking: maxVal(endTurn)<=2
normalized: maxVal(endTurn)<=2


FORMULA Peterson-COL-3-ReachabilityBounds-3CANNOT_COMPUTE

MC time: 0m0sec

checking: [[maxVal(wantSection)<=1 & [[maxVal(isEndLoop)<=3 & [[maxVal(askForSection)<=2 & maxVal(testIdentity)<=3] & [maxVal(isEndLoop)<=3 & maxVal(testAlone)<=3]]] & maxVal(wantSection)<=1]] & maxVal(testIdentity)<=2]
normalized: [maxVal(testIdentity)<=2 & [maxVal(wantSection)<=1 & [maxVal(wantSection)<=1 & [maxVal(isEndLoop)<=3 & [[maxVal(isEndLoop)<=3 & maxVal(testAlone)<=3] & [maxVal(askForSection)<=2 & maxVal(testIdentity)<=3]]]]]]


FORMULA Peterson-COL-3-ReachabilityBounds-4CANNOT_COMPUTE

MC time: 0m0sec

checking: [[[maxVal(wantSection)<=3 & [maxVal(askForSection)<=1 & maxVal(testAlone)<=3]] & maxVal(testTurn)<=2] & maxVal(askForSection)<=3]
normalized: [maxVal(askForSection)<=3 & [maxVal(testTurn)<=2 & [maxVal(wantSection)<=3 & [maxVal(askForSection)<=1 & maxVal(testAlone)<=3]]]]


FORMULA Peterson-COL-3-ReachabilityBounds-5CANNOT_COMPUTE

MC time: 0m0sec

checking: maxVal(idle)<=3
normalized: maxVal(idle)<=3


FORMULA Peterson-COL-3-ReachabilityBounds-6CANNOT_COMPUTE

MC time: 0m0sec

checking: [[[maxVal(wantSection)<=3 & maxVal(turn)<=2] & [[maxVal(testAlone)<=3 & [[maxVal(testTurn)<=1 & maxVal(idle)<=1] & maxVal(testIdentity)<=1]] & [maxVal(idle)<=1 & [maxVal(wantSection)<=3 & [maxVal(endTurn)<=2 & maxVal(turn)<=1]]]]] & maxVal(testAlone)<=1]
normalized: [maxVal(testAlone)<=1 & [[[maxVal(idle)<=1 & [maxVal(wantSection)<=3 & [maxVal(endTurn)<=2 & maxVal(turn)<=1]]] & [maxVal(testAlone)<=3 & [maxVal(testIdentity)<=1 & [maxVal(testTurn)<=1 & maxVal(idle)<=1]]]] & [maxVal(wantSection)<=3 & maxVal(turn)<=2]]]


FORMULA Peterson-COL-3-ReachabilityBounds-7CANNOT_COMPUTE

MC time: 0m0sec

checking: maxVal(testTurn)<=2
normalized: maxVal(testTurn)<=2


FORMULA Peterson-COL-3-ReachabilityBounds-8CANNOT_COMPUTE

MC time: 0m0sec

checking: maxVal(testAlone)<=3
normalized: maxVal(testAlone)<=3


FORMULA Peterson-COL-3-ReachabilityBounds-9CANNOT_COMPUTE

MC time: 0m0sec

checking: maxVal(testAlone)<=3
normalized: maxVal(testAlone)<=3


FORMULA Peterson-COL-3-ReachabilityBounds-10CANNOT_COMPUTE

MC time: 0m0sec

checking: [maxVal(turn)<=3 & maxVal(CS)<=2]
normalized: [maxVal(turn)<=3 & maxVal(CS)<=2]


FORMULA Peterson-COL-3-ReachabilityBounds-11CANNOT_COMPUTE

MC time: 0m0sec

checking: maxVal(testAlone)<=3
normalized: maxVal(testAlone)<=3


FORMULA Peterson-COL-3-ReachabilityBounds-12CANNOT_COMPUTE

MC time: 0m0sec

checking: maxVal(isEndLoop)<=1
normalized: maxVal(isEndLoop)<=1


FORMULA Peterson-COL-3-ReachabilityBounds-13CANNOT_COMPUTE

MC time: 0m0sec

checking: maxVal(endTurn)<=2
normalized: maxVal(endTurn)<=2


FORMULA Peterson-COL-3-ReachabilityBounds-14CANNOT_COMPUTE

MC time: 0m0sec

checking: [maxVal(askForSection)<=3 & [maxVal(turn)<=2 & [maxVal(CS)<=3 & maxVal(beginLoop)<=2]]]
normalized: [maxVal(askForSection)<=3 & [maxVal(turn)<=2 & [maxVal(CS)<=3 & maxVal(beginLoop)<=2]]]


FORMULA Peterson-COL-3-ReachabilityBounds-15CANNOT_COMPUTE

MC time: 0m0sec


Total processing time: 1m20sec


BK_STOP 1433642131111

--------------------
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

717 1614 1767 3265 3420 4490 4557 4883 4808 10450 10843 11251 13394 13909 14329 15363 18058 18336 18749 18512 19599 20202 23830 25266 25830 27104 27274 28063 28883 29389 29764 29265 29606 29990 30592 30705 30628 30853 30493 30823 31475 32380 34051 34425 34424 34079 34720 35355 35382 35108 37444 39209 40180 40608 40398 40808 40600 40265 42372 42426 42611 45030 44594 44686 44129 45322 45818 45804 45671 46837 46699 46964 46981 47813 47953 47850 47384 46768 46459 46155 46250 45443 45240 44870 44409 44458 48554 48420 48309 48433 49094 49268 49866 49694 51204 54220 54479 54452 54684 54401 54073 56275 55830 55830 57241 57346 57342 57048 56929 58219 58102 57308 58870 59326 59591 59276 59121 59839 59857 59662 59910 59364 59211 58716 58352 57982 57818 56932 56199 55683 60690 61198 61379 60570 60674 61722 62251 62494 61922 63237 65095 65501 65367 65160 65071 65753 66777 67292 67238 67269 67861 67142 67302 67708 67719 67177 67767 67374 67125 67130 66846 66818 66878 67028 67477 68480 68388 68090 68328 68253 68785 68971 68104 68230 68196 68139 67638 67463 67228
iterations count:179890 (505), effective:8650 (24)

initing FirstDep: 0m0sec

Unknown names:
maxVal(CS)
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
maxVal(turn)
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
maxVal(isEndLoop)
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
maxVal(endTurn)
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
maxVal(testIdentity)
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
maxVal(testAlone)
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
maxVal(idle)
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
maxVal(turn)
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
maxVal(testTurn)
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
maxVal(testAlone)
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
maxVal(testAlone)
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
maxVal(CS)
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
maxVal(testAlone)
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
maxVal(isEndLoop)
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
maxVal(endTurn)
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
maxVal(beginLoop)
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

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-3"
export BK_EXAMINATION="ReachabilityBounds"
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-3.tgz
mv S_Peterson-COL-3 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-3, examination is ReachabilityBounds"
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-143341204600255"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityBounds" = "ReachabilityComputeBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityBounds" != "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 "ReachabilityBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityBounds.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 '' ReachabilityBounds.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 ;