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

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

=== Now, execution of the tool begins

BK_START 1432534108546

Model: FMS-PT-005
reachability algorithm:
Saturation-based algorithm
variable ordering algorithm:
Plain order (as read)
--memory=6 --suppress --rs-algorithm=3 --place-order=1

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

parse successfull
net created successfully

(NrP: 22 NrTr: 20 NrArc: 50)

net check time: 0m0sec

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

init dd package: 0m6sec


RS generation: 0m0sec


-> reachability set: #nodes 517 (5.2e+02) #states 2,895,018 (6)



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

checking: [maxVal(M2)<=1 & [maxVal(P3)<=3 & maxVal(P1wM1)<=1]]
normalized: [maxVal(M2)<=1 & [maxVal(P3)<=3 & maxVal(P1wM1)<=1]]

abstracting: (5<=1) states: 0
abstracting: (5<=3) states: 0
abstracting: (1<=1) states: 2,895,018 (6)
-> the formula is FALSE

FORMULA FMS-PT-005-ReachabilityBounds-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (2<=3) states: 2,895,018 (6)
-> the formula is TRUE

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

MC time: 0m0sec

checking: [[[maxVal(P12M3)<=1 & maxVal(P12M3)<=2] & [[[[maxVal(M1)<=1 & maxVal(P12wM3)<=3] & maxVal(P1s)<=3] & maxVal(P12)<=3] & maxVal(P1M1)<=3]] & maxVal(P1M1)<=2]
normalized: [maxVal(P1M1)<=2 & [[maxVal(P12M3)<=1 & maxVal(P12M3)<=2] & [maxVal(P1M1)<=3 & [maxVal(P12)<=3 & [maxVal(P1s)<=3 & [maxVal(M1)<=1 & maxVal(P12wM3)<=3]]]]]]

abstracting: (5<=3) states: 0
abstracting: (3<=1) states: 0
abstracting: (5<=3) states: 0
abstracting: (5<=3) states: 0
abstracting: (3<=3) states: 2,895,018 (6)
abstracting: (2<=2) states: 2,895,018 (6)
abstracting: (2<=1) states: 0
abstracting: (3<=2) states: 0
-> the formula is FALSE

FORMULA FMS-PT-005-ReachabilityBounds-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (5<=1) states: 0
-> the formula is FALSE

FORMULA FMS-PT-005-ReachabilityBounds-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[[[[[maxVal(P3M2)<=1 & maxVal(P1M1)<=3] & maxVal(P1d)<=1] & [maxVal(P2)<=2 & [maxVal(P12)<=3 & maxVal(P12s)<=3]]] & maxVal(P12M3)<=3] & maxVal(P2M2)<=2] & [[maxVal(P2)<=3 & maxVal(M2)<=1] & maxVal(P1wP2)<=1]]
normalized: [[maxVal(P1wP2)<=1 & [maxVal(P2)<=3 & maxVal(M2)<=1]] & [maxVal(P2M2)<=2 & [maxVal(P12M3)<=3 & [[maxVal(P2)<=2 & [maxVal(P12)<=3 & maxVal(P12s)<=3]] & [maxVal(P1d)<=1 & [maxVal(P3M2)<=1 & maxVal(P1M1)<=3]]]]]]

abstracting: (3<=3) states: 2,895,018 (6)
abstracting: (5<=1) states: 0
abstracting: (5<=1) states: 0
abstracting: (5<=3) states: 0
abstracting: (5<=3) states: 0
abstracting: (5<=2) states: 0
abstracting: (2<=3) states: 2,895,018 (6)
abstracting: (1<=2) states: 2,895,018 (6)
abstracting: (1<=1) states: 2,895,018 (6)
abstracting: (5<=3) states: 0
abstracting: (5<=1) states: 0
-> the formula is FALSE

FORMULA FMS-PT-005-ReachabilityBounds-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

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

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

MC time: 0m0sec

checking: [maxVal(P2wM2)<=3 & [maxVal(P12s)<=3 & maxVal(M2)<=1]]
normalized: [maxVal(P2wM2)<=3 & [maxVal(P12s)<=3 & maxVal(M2)<=1]]

abstracting: (1<=1) states: 2,895,018 (6)
abstracting: (5<=3) states: 0
abstracting: (5<=3) states: 0
-> the formula is FALSE

FORMULA FMS-PT-005-ReachabilityBounds-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (5<=1) states: 0
-> the formula is FALSE

FORMULA FMS-PT-005-ReachabilityBounds-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[maxVal(P12)<=2 & [maxVal(P3M2)<=2 & maxVal(P2d)<=2]] & [maxVal(M3)<=1 & [[[[maxVal(P12M3)<=2 & maxVal(P2d)<=1] & maxVal(P3s)<=3] & maxVal(P3s)<=2] & maxVal(P2M2)<=1]]]
normalized: [[maxVal(M3)<=1 & [maxVal(P2M2)<=1 & [maxVal(P3s)<=2 & [maxVal(P3s)<=3 & [maxVal(P12M3)<=2 & maxVal(P2d)<=1]]]]] & [maxVal(P12)<=2 & [maxVal(P3M2)<=2 & maxVal(P2d)<=2]]]

abstracting: (5<=2) states: 0
abstracting: (5<=2) states: 0
abstracting: (5<=2) states: 0
abstracting: (5<=1) states: 0
abstracting: (2<=2) states: 2,895,018 (6)
abstracting: (5<=3) states: 0
abstracting: (5<=2) states: 0
abstracting: (1<=1) states: 2,895,018 (6)
abstracting: (2<=1) states: 0
-> the formula is FALSE

FORMULA FMS-PT-005-ReachabilityBounds-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (1<=1) states: 2,895,018 (6)
-> the formula is TRUE

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

MC time: 0m0sec

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

abstracting: (5<=1) states: 0
-> the formula is FALSE

FORMULA FMS-PT-005-ReachabilityBounds-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[maxVal(P12s)<=3 & [maxVal(P12wM3)<=1 & maxVal(P12)<=1]] & maxVal(P2M2)<=2]
normalized: [maxVal(P2M2)<=2 & [maxVal(P12s)<=3 & [maxVal(P12wM3)<=1 & maxVal(P12)<=1]]]

abstracting: (5<=1) states: 0
abstracting: (5<=1) states: 0
abstracting: (5<=3) states: 0
abstracting: (1<=2) states: 2,895,018 (6)
-> the formula is FALSE

FORMULA FMS-PT-005-ReachabilityBounds-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (5<=1) states: 0
-> the formula is FALSE

FORMULA FMS-PT-005-ReachabilityBounds-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[[[maxVal(P3)<=3 & maxVal(M2)<=2] & [[[maxVal(P2wP1)<=3 & maxVal(P2)<=2] & maxVal(P1wP2)<=1] & [[maxVal(M1)<=1 & maxVal(P3)<=3] & maxVal(P12s)<=1]]] & maxVal(P1M1)<=1] & [[[[maxVal(P3M2)<=1 & [maxVal(P2s)<=3 & maxVal(P3)<=3]] & maxVal(P2wM2)<=2] & [maxVal(P2)<=3 & maxVal(P2wP1)<=3]] & [[maxVal(P12wM3)<=2 & [[maxVal(P1s)<=2 & maxVal(P1wP2)<=3] & maxVal(P2s)<=3]] & [maxVal(P12)<=2 & maxVal(P1M1)<=3]]]]
normalized: [[[[maxVal(P12)<=2 & maxVal(P1M1)<=3] & [maxVal(P12wM3)<=2 & [maxVal(P2s)<=3 & [maxVal(P1s)<=2 & maxVal(P1wP2)<=3]]]] & [[maxVal(P2)<=3 & maxVal(P2wP1)<=3] & [maxVal(P2wM2)<=2 & [maxVal(P3M2)<=1 & [maxVal(P2s)<=3 & maxVal(P3)<=3]]]]] & [maxVal(P1M1)<=1 & [[[maxVal(P12s)<=1 & [maxVal(M1)<=1 & maxVal(P3)<=3]] & [maxVal(P1wP2)<=1 & [maxVal(P2wP1)<=3 & maxVal(P2)<=2]]] & [maxVal(P3)<=3 & maxVal(M2)<=2]]]]

abstracting: (1<=2) states: 2,895,018 (6)
abstracting: (5<=3) states: 0
abstracting: (5<=2) states: 0
abstracting: (5<=3) states: 0
abstracting: (5<=1) states: 0
abstracting: (5<=3) states: 0
abstracting: (3<=1) states: 0
abstracting: (5<=1) states: 0
abstracting: (3<=1) states: 0
abstracting: (5<=3) states: 0
abstracting: (5<=3) states: 0
abstracting: (5<=1) states: 0
abstracting: (5<=2) states: 0
abstracting: (5<=3) states: 0
abstracting: (5<=3) states: 0
abstracting: (5<=3) states: 0
abstracting: (5<=2) states: 0
abstracting: (5<=3) states: 0
abstracting: (5<=2) states: 0
abstracting: (3<=3) states: 2,895,018 (6)
abstracting: (5<=2) states: 0
-> the formula is FALSE

FORMULA FMS-PT-005-ReachabilityBounds-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (5<=2) states: 0
-> the formula is FALSE

FORMULA FMS-PT-005-ReachabilityBounds-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(P3s)<=2 & maxVal(M2)<=1]
normalized: [maxVal(P3s)<=2 & maxVal(M2)<=1]

abstracting: (1<=1) states: 2,895,018 (6)
abstracting: (5<=2) states: 0
-> the formula is FALSE

FORMULA FMS-PT-005-ReachabilityBounds-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec


Total processing time: 0m8sec


BK_STOP 1432534117190

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


iterations count:380 (19), effective:80 (4)

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="FMS-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/FMS-PT-005.tgz
mv FMS-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 FMS-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 r050kn-ebro-143236503500112"
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 ;