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 Railroad-PT-005, examination is ReachabilityBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r078kn-ebro-143262779500944
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1432915025679

Model: Railroad-PT-005
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

(NrP: 68 NrTr: 56 NrArc: 313)

net check time: 0m0sec

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

init dd package: 0m5sec


RS generation: 0m0sec


-> reachability set: #nodes 1751 (1.8e+03) #states 1,838 (3)



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

checking: [maxVal(pl_P0_3)<=3 & [maxVal(pl_P34_2)<=1 & maxVal(pl_P2_1)<=1]]
normalized: [maxVal(pl_P0_3)<=3 & [maxVal(pl_P34_2)<=1 & maxVal(pl_P2_1)<=1]]

abstracting: (1<=1) states: 1,838 (3)
abstracting: (1<=1) states: 1,838 (3)
abstracting: (1<=3) states: 1,838 (3)
-> the formula is TRUE

FORMULA Railroad-PT-005-ReachabilityBounds-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (1<=3) states: 1,838 (3)
-> the formula is TRUE

FORMULA Railroad-PT-005-ReachabilityBounds-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (1<=2) states: 1,838 (3)
-> the formula is TRUE

FORMULA Railroad-PT-005-ReachabilityBounds-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (1<=2) states: 1,838 (3)
-> the formula is TRUE

FORMULA Railroad-PT-005-ReachabilityBounds-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(pl_P26_1)<=2 & maxVal(pl_P32_1)<=3]
normalized: [maxVal(pl_P26_1)<=2 & maxVal(pl_P32_1)<=3]

abstracting: (1<=3) states: 1,838 (3)
abstracting: (1<=2) states: 1,838 (3)
-> the formula is TRUE

FORMULA Railroad-PT-005-ReachabilityBounds-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(pl_P27_1)<=3 & [maxVal(pl_P7_4)<=1 & [[maxVal(pl_P3_1)<=3 & maxVal(pl_P2_1)<=2] & [maxVal(pl_P11_1)<=1 & maxVal(pl_P7_4)<=1]]]]
normalized: [maxVal(pl_P27_1)<=3 & [maxVal(pl_P7_4)<=1 & [[maxVal(pl_P3_1)<=3 & maxVal(pl_P2_1)<=2] & [maxVal(pl_P11_1)<=1 & maxVal(pl_P7_4)<=1]]]]

abstracting: (0<=1) states: 1,838 (3)
abstracting: (1<=1) states: 1,838 (3)
abstracting: (1<=2) states: 1,838 (3)
abstracting: (0<=3) states: 1,838 (3)
abstracting: (0<=1) states: 1,838 (3)
abstracting: (1<=3) states: 1,838 (3)
-> the formula is TRUE

FORMULA Railroad-PT-005-ReachabilityBounds-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (1<=2) states: 1,838 (3)
-> the formula is TRUE

FORMULA Railroad-PT-005-ReachabilityBounds-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(pl_P5_1)<=3 & maxVal(pl_P0_6)<=2]
normalized: [maxVal(pl_P5_1)<=3 & maxVal(pl_P0_6)<=2]

abstracting: (0<=2) states: 1,838 (3)
abstracting: (1<=3) states: 1,838 (3)
-> the formula is TRUE

FORMULA Railroad-PT-005-ReachabilityBounds-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (1<=3) states: 1,838 (3)
-> the formula is TRUE

FORMULA Railroad-PT-005-ReachabilityBounds-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (1<=1) states: 1,838 (3)
-> the formula is TRUE

FORMULA Railroad-PT-005-ReachabilityBounds-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(pl_P40_2)<=3 & [maxVal(pl_P40_5)<=2 & maxVal(pl_P42_1)<=2]]
normalized: [maxVal(pl_P40_2)<=3 & [maxVal(pl_P40_5)<=2 & maxVal(pl_P42_1)<=2]]

abstracting: (1<=2) states: 1,838 (3)
abstracting: (1<=2) states: 1,838 (3)
abstracting: (1<=3) states: 1,838 (3)
-> the formula is TRUE

FORMULA Railroad-PT-005-ReachabilityBounds-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(pl_P14_1)<=3 & [[maxVal(pl_P39_1)<=2 & [[maxVal(pl_P31_1)<=1 & maxVal(pl_P0_3)<=2] & [[maxVal(pl_P34_6)<=2 & maxVal(pl_P16_1)<=2] & maxVal(pl_P41_1)<=3]]] & maxVal(pl_P3_1)<=1]]
normalized: [maxVal(pl_P14_1)<=3 & [maxVal(pl_P3_1)<=1 & [maxVal(pl_P39_1)<=2 & [[maxVal(pl_P31_1)<=1 & maxVal(pl_P0_3)<=2] & [maxVal(pl_P41_1)<=3 & [maxVal(pl_P34_6)<=2 & maxVal(pl_P16_1)<=2]]]]]]

abstracting: (1<=2) states: 1,838 (3)
abstracting: (1<=2) states: 1,838 (3)
abstracting: (1<=3) states: 1,838 (3)
abstracting: (1<=2) states: 1,838 (3)
abstracting: (1<=1) states: 1,838 (3)
abstracting: (1<=2) states: 1,838 (3)
abstracting: (0<=1) states: 1,838 (3)
abstracting: (0<=3) states: 1,838 (3)
-> the formula is TRUE

FORMULA Railroad-PT-005-ReachabilityBounds-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(pl_P0_6)<=1 & maxVal(pl_P33_1)<=2]
normalized: [maxVal(pl_P0_6)<=1 & maxVal(pl_P33_1)<=2]

abstracting: (1<=2) states: 1,838 (3)
abstracting: (0<=1) states: 1,838 (3)
-> the formula is TRUE

FORMULA Railroad-PT-005-ReachabilityBounds-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(pl_P40_2)<=1 & [[maxVal(pl_P37_1)<=3 & [maxVal(pl_P7_1)<=3 & maxVal(pl_P9_1)<=1]] & [[[maxVal(pl_P34_4)<=2 & [maxVal(pl_P29_6)<=3 & maxVal(pl_P34_1)<=2]] & [[maxVal(pl_P26_1)<=2 & maxVal(pl_P29_6)<=3] & [maxVal(pl_P17_1)<=3 & maxVal(pl_P27_1)<=2]]] & maxVal(pl_P5_1)<=1]]]
normalized: [maxVal(pl_P40_2)<=1 & [[maxVal(pl_P5_1)<=1 & [[[maxVal(pl_P17_1)<=3 & maxVal(pl_P27_1)<=2] & [maxVal(pl_P26_1)<=2 & maxVal(pl_P29_6)<=3]] & [maxVal(pl_P34_4)<=2 & [maxVal(pl_P29_6)<=3 & maxVal(pl_P34_1)<=2]]]] & [maxVal(pl_P37_1)<=3 & [maxVal(pl_P7_1)<=3 & maxVal(pl_P9_1)<=1]]]]

abstracting: (0<=1) states: 1,838 (3)
abstracting: (1<=3) states: 1,838 (3)
abstracting: (0<=3) states: 1,838 (3)
abstracting: (1<=2) states: 1,838 (3)
abstracting: (0<=3) states: 1,838 (3)
abstracting: (1<=2) states: 1,838 (3)
abstracting: (0<=3) states: 1,838 (3)
abstracting: (1<=2) states: 1,838 (3)
abstracting: (1<=2) states: 1,838 (3)
abstracting: (1<=3) states: 1,838 (3)
abstracting: (1<=1) states: 1,838 (3)
abstracting: (1<=1) states: 1,838 (3)
-> the formula is TRUE

FORMULA Railroad-PT-005-ReachabilityBounds-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[maxVal(pl_P11_1)<=2 & maxVal(pl_P27_1)<=3] & [[[[maxVal(pl_P0_3)<=1 & maxVal(pl_P29_5)<=3] & maxVal(pl_P29_3)<=3] & maxVal(pl_P0_5)<=1] & [maxVal(pl_P7_4)<=3 & maxVal(pl_P0_2)<=2]]]
normalized: [[maxVal(pl_P11_1)<=2 & maxVal(pl_P27_1)<=3] & [[maxVal(pl_P7_4)<=3 & maxVal(pl_P0_2)<=2] & [maxVal(pl_P0_5)<=1 & [maxVal(pl_P29_3)<=3 & [maxVal(pl_P0_3)<=1 & maxVal(pl_P29_5)<=3]]]]]

abstracting: (0<=3) states: 1,838 (3)
abstracting: (1<=1) states: 1,838 (3)
abstracting: (1<=3) states: 1,838 (3)
abstracting: (1<=1) states: 1,838 (3)
abstracting: (1<=2) states: 1,838 (3)
abstracting: (0<=3) states: 1,838 (3)
abstracting: (1<=3) states: 1,838 (3)
abstracting: (1<=2) states: 1,838 (3)
-> the formula is TRUE

FORMULA Railroad-PT-005-ReachabilityBounds-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[maxVal(pl_P33_1)<=2 & maxVal(pl_P13_1)<=2] & maxVal(pl_P16_1)<=2]
normalized: [maxVal(pl_P16_1)<=2 & [maxVal(pl_P33_1)<=2 & maxVal(pl_P13_1)<=2]]

abstracting: (1<=2) states: 1,838 (3)
abstracting: (1<=2) states: 1,838 (3)
abstracting: (1<=2) states: 1,838 (3)
-> the formula is TRUE

FORMULA Railroad-PT-005-ReachabilityBounds-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec


Total processing time: 0m9sec


BK_STOP 1432915035175

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

1244
iterations count:1690 (30), effective:66 (1)

initing FirstDep: 0m0sec

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="Railroad-PT-005"
export BK_EXAMINATION="ReachabilityBounds"
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/Railroad-PT-005.tgz
mv Railroad-PT-005 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 Railroad-PT-005, 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 r078kn-ebro-143262779500944"
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 ;