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 S_MultiwaySync-PT-none, examination is ReachabilityBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r162st-ebro-143319441300801
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1433383056210

Model: S_MultiwaySync-PT-none
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: 222 NrTr: 472 NrArc: 1496)

net check time: 0m0sec

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

init dd package: 0m5sec


RS generation: 1m30sec


-> reachability set: #nodes 103813 (1.0e+05) #states 52,595,997,309,385,113,601 (19)



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

checking: [[[maxVal(p46)<=2 & maxVal(p48)<=1] & maxVal(p111)<=3] & maxVal(p17)<=2]
normalized: [maxVal(p17)<=2 & [maxVal(p111)<=3 & [maxVal(p46)<=2 & maxVal(p48)<=1]]]

abstracting: (1<=1) states: 52,595,997,309,385,113,601 (19)
abstracting: (1<=2) states: 52,595,997,309,385,113,601 (19)
abstracting: (1<=3) states: 52,595,997,309,385,113,601 (19)
abstracting: (1<=2) states: 52,595,997,309,385,113,601 (19)
-> the formula is TRUE

FORMULA MultiwaySync-PT-none-ReachabilityBounds-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (1<=2) states: 52,595,997,309,385,113,601 (19)
-> the formula is TRUE

FORMULA MultiwaySync-PT-none-ReachabilityBounds-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(p70)<=3 & [[[maxVal(p186)<=1 & maxVal(p5)<=2] & [maxVal(p192)<=3 & maxVal(p167)<=1]] & maxVal(p115)<=3]]
normalized: [maxVal(p70)<=3 & [maxVal(p115)<=3 & [[maxVal(p192)<=3 & maxVal(p167)<=1] & [maxVal(p186)<=1 & maxVal(p5)<=2]]]]

abstracting: (1<=2) states: 52,595,997,309,385,113,601 (19)
abstracting: (1<=1) states: 52,595,997,309,385,113,601 (19)
abstracting: (1<=1) states: 52,595,997,309,385,113,601 (19)
abstracting: (1<=3) states: 52,595,997,309,385,113,601 (19)
abstracting: (1<=3) states: 52,595,997,309,385,113,601 (19)
abstracting: (1<=3) states: 52,595,997,309,385,113,601 (19)
-> the formula is TRUE

FORMULA MultiwaySync-PT-none-ReachabilityBounds-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(p106)<=2 & maxVal(p161)<=2]
normalized: [maxVal(p106)<=2 & maxVal(p161)<=2]

abstracting: (1<=2) states: 52,595,997,309,385,113,601 (19)
abstracting: (1<=2) states: 52,595,997,309,385,113,601 (19)
-> the formula is TRUE

FORMULA MultiwaySync-PT-none-ReachabilityBounds-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[[[[[maxVal(p12)<=1 & maxVal(p111)<=2] & maxVal(p205)<=2] & [[maxVal(p88)<=3 & maxVal(p40)<=2] & [maxVal(p2)<=2 & maxVal(p27)<=3]]] & maxVal(p216)<=3] & maxVal(p108)<=3] & maxVal(p26)<=1]
normalized: [maxVal(p26)<=1 & [maxVal(p108)<=3 & [maxVal(p216)<=3 & [[maxVal(p205)<=2 & [maxVal(p12)<=1 & maxVal(p111)<=2]] & [[maxVal(p2)<=2 & maxVal(p27)<=3] & [maxVal(p88)<=3 & maxVal(p40)<=2]]]]]]

abstracting: (1<=2) states: 52,595,997,309,385,113,601 (19)
abstracting: (1<=3) states: 52,595,997,309,385,113,601 (19)
abstracting: (1<=3) states: 52,595,997,309,385,113,601 (19)
abstracting: (1<=2) states: 52,595,997,309,385,113,601 (19)
abstracting: (1<=2) states: 52,595,997,309,385,113,601 (19)
abstracting: (1<=1) states: 52,595,997,309,385,113,601 (19)
abstracting: (1<=2) states: 52,595,997,309,385,113,601 (19)
abstracting: (1<=3) states: 52,595,997,309,385,113,601 (19)
abstracting: (1<=3) states: 52,595,997,309,385,113,601 (19)
abstracting: (1<=1) states: 52,595,997,309,385,113,601 (19)
-> the formula is TRUE

FORMULA MultiwaySync-PT-none-ReachabilityBounds-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(p205)<=3 & [maxVal(p13)<=3 & [[[maxVal(p3)<=3 & [maxVal(p208)<=3 & maxVal(p44)<=3]] & maxVal(p116)<=1] & [[[maxVal(p67)<=2 & maxVal(p156)<=2] & maxVal(p2)<=2] & [[maxVal(p21)<=1 & maxVal(p154)<=3] & [maxVal(p164)<=1 & maxVal(p207)<=2]]]]]]
normalized: [maxVal(p205)<=3 & [maxVal(p13)<=3 & [[[maxVal(p2)<=2 & [maxVal(p67)<=2 & maxVal(p156)<=2]] & [[maxVal(p21)<=1 & maxVal(p154)<=3] & [maxVal(p164)<=1 & maxVal(p207)<=2]]] & [maxVal(p116)<=1 & [maxVal(p3)<=3 & [maxVal(p208)<=3 & maxVal(p44)<=3]]]]]]

abstracting: (1<=3) states: 52,595,997,309,385,113,601 (19)
abstracting: (1<=3) states: 52,595,997,309,385,113,601 (19)
abstracting: (1<=3) states: 52,595,997,309,385,113,601 (19)
abstracting: (1<=1) states: 52,595,997,309,385,113,601 (19)
abstracting: (1<=2) states: 52,595,997,309,385,113,601 (19)
abstracting: (1<=1) states: 52,595,997,309,385,113,601 (19)
abstracting: (1<=3) states: 52,595,997,309,385,113,601 (19)
abstracting: (1<=1) states: 52,595,997,309,385,113,601 (19)
abstracting: (1<=2) states: 52,595,997,309,385,113,601 (19)
abstracting: (1<=2) states: 52,595,997,309,385,113,601 (19)
abstracting: (1<=2) states: 52,595,997,309,385,113,601 (19)
abstracting: (1<=3) states: 52,595,997,309,385,113,601 (19)
abstracting: (1<=3) states: 52,595,997,309,385,113,601 (19)
-> the formula is TRUE

FORMULA MultiwaySync-PT-none-ReachabilityBounds-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (1<=2) states: 52,595,997,309,385,113,601 (19)
-> the formula is TRUE

FORMULA MultiwaySync-PT-none-ReachabilityBounds-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[[maxVal(p213)<=1 & maxVal(p76)<=2] & maxVal(p47)<=2] & maxVal(p73)<=1]
normalized: [maxVal(p73)<=1 & [maxVal(p47)<=2 & [maxVal(p213)<=1 & maxVal(p76)<=2]]]

abstracting: (1<=2) states: 52,595,997,309,385,113,601 (19)
abstracting: (1<=1) states: 52,595,997,309,385,113,601 (19)
abstracting: (1<=2) states: 52,595,997,309,385,113,601 (19)
abstracting: (1<=1) states: 52,595,997,309,385,113,601 (19)
-> the formula is TRUE

FORMULA MultiwaySync-PT-none-ReachabilityBounds-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(p102)<=2 & maxVal(p91)<=1]
normalized: [maxVal(p102)<=2 & maxVal(p91)<=1]

abstracting: (1<=1) states: 52,595,997,309,385,113,601 (19)
abstracting: (1<=2) states: 52,595,997,309,385,113,601 (19)
-> the formula is TRUE

FORMULA MultiwaySync-PT-none-ReachabilityBounds-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (1<=1) states: 52,595,997,309,385,113,601 (19)
-> the formula is TRUE

FORMULA MultiwaySync-PT-none-ReachabilityBounds-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (1<=1) states: 52,595,997,309,385,113,601 (19)
-> the formula is TRUE

FORMULA MultiwaySync-PT-none-ReachabilityBounds-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (1<=1) states: 52,595,997,309,385,113,601 (19)
-> the formula is TRUE

FORMULA MultiwaySync-PT-none-ReachabilityBounds-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (1<=3) states: 52,595,997,309,385,113,601 (19)
-> the formula is TRUE

FORMULA MultiwaySync-PT-none-ReachabilityBounds-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(p24)<=2 & [maxVal(p165)<=1 & [maxVal(p193)<=1 & maxVal(p44)<=2]]]
normalized: [maxVal(p24)<=2 & [maxVal(p165)<=1 & [maxVal(p193)<=1 & maxVal(p44)<=2]]]

abstracting: (1<=2) states: 52,595,997,309,385,113,601 (19)
abstracting: (1<=1) states: 52,595,997,309,385,113,601 (19)
abstracting: (1<=1) states: 52,595,997,309,385,113,601 (19)
abstracting: (1<=2) states: 52,595,997,309,385,113,601 (19)
-> the formula is TRUE

FORMULA MultiwaySync-PT-none-ReachabilityBounds-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (1<=1) states: 52,595,997,309,385,113,601 (19)
-> the formula is TRUE

FORMULA MultiwaySync-PT-none-ReachabilityBounds-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(p37)<=2 & maxVal(p8)<=3]
normalized: [maxVal(p37)<=2 & maxVal(p8)<=3]

abstracting: (1<=3) states: 52,595,997,309,385,113,601 (19)
abstracting: (1<=2) states: 52,595,997,309,385,113,601 (19)
-> the formula is TRUE

FORMULA MultiwaySync-PT-none-ReachabilityBounds-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec


Total processing time: 2m59sec


BK_STOP 1433383236116

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

491 559 737 674 748 690 546 647 549 688 778 1001 1626 1734 1859 1851 1971 1851 2383 1851 2402 3345 3519 4310 4294 5076 4298 5582 5598 5583 5599 6193 5588 4812 5591 4815 4810 5509 6183 6636 6660 5486 7252 7264 7253 7277 6104 7258 7246 7261 7285 6107 7094 7931 14037 15598 17560 17821 17470 17481 20188 17502 19466 19727 18341 20304 18348 18296 23154 21203 20303 21840 18343 20302 18346 22485 25166 24438 25975 28794 30745 36606 32981 26621 31539 27401 26611 34757 48859 48955 81761 95954 104974 111391 104982 111615 104985 119682 95965 104988 95974 104991 119688 104994 111627 95971 114198 95973 105000 95986 105003 111636 96000 103771 103763 111229 111225 127527 122031 103803 112836 119469 103823 112855 103841 127551 122055 103824 112841 119475 112841 126939 103827 135021 111280 111266 112845 119478 103811 112849 119482 103836 111274 112850 119483 103814 112853 119486 103840 111278
iterations count:150595 (319), effective:1583 (3)

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="S_MultiwaySync-PT-none"
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/S_MultiwaySync-PT-none.tgz
mv S_MultiwaySync-PT-none 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 S_MultiwaySync-PT-none, 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 r162st-ebro-143319441300801"
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 ;