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 SwimmingPool-PT-04, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r125kn-qhx2-146373371500394
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1464508225362


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=ReachabilityCardinality.xml --mcc-mode --memory=6 --suppress

parse successfull
net created successfully

Net: SwimmingPool_PT_04
(NrP: 9 NrTr: 7 NrArc: 20)

net check time: 0m 0.000sec

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

init dd package: 0m16.229sec


RS generation: 1m18.759sec


-> reachability set: #nodes 325739 (3.3e+05) #states 164,385,221 (8)



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

checking: AG [Entered<=Cabins]
normalized: ~ [E [true U ~ [Entered<=Cabins]]]

abstracting: (Entered<=Cabins) states: 54,146,169 (7)
-> the formula is FALSE

FORMULA SwimmingPool-PT-04-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m36.691sec

checking: EF [~ [Dressed<=Out]]
normalized: E [true U ~ [Dressed<=Out]]

abstracting: (Dressed<=Out) states: 121,879,274 (8)
-> the formula is TRUE

FORMULA SwimmingPool-PT-04-ReachabilityCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m 3.917sec

checking: EF [Bags<=Undress]
normalized: E [true U Bags<=Undress]

abstracting: (Bags<=Undress) states: 17,743,792 (7)
-> the formula is TRUE

FORMULA SwimmingPool-PT-04-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m42.103sec

checking: EF [Bags<=WaitBag]
normalized: E [true U Bags<=WaitBag]

abstracting: (Bags<=WaitBag) states: 10,342,640 (7)
-> the formula is TRUE

FORMULA SwimmingPool-PT-04-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m41.415sec

checking: AG [Undress<=Undress]
normalized: ~ [E [true U ~ [Undress<=Undress]]]

abstracting: (Undress<=Undress) states: 164,385,221 (8)
-> the formula is TRUE

FORMULA SwimmingPool-PT-04-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.585sec

checking: AG [[1<=Out & WaitBag<=Cabins]]
normalized: ~ [E [true U ~ [[1<=Out & WaitBag<=Cabins]]]]

abstracting: (WaitBag<=Cabins) states: 98,858,529 (7)
abstracting: (1<=Out) states: 158,538,534 (8)

FORMULA SwimmingPool-PT-04-ReachabilityCardinality-4 CANNOT_COMPUTE

MC time: 2m53.889sec

checking: AG [[2<=Cabins | Out<=WaitBag]]
normalized: ~ [E [true U ~ [[2<=Cabins | Out<=WaitBag]]]]


FORMULA SwimmingPool-PT-04-ReachabilityCardinality-5 CANNOT_COMPUTE

MC time: 0m 0.000sec

checking: EF [[3<=Undress & ~ [Undress<=Bags]]]
normalized: E [true U [3<=Undress & ~ [Undress<=Bags]]]


FORMULA SwimmingPool-PT-04-ReachabilityCardinality-10 CANNOT_COMPUTE

MC time: 0m 0.000sec

checking: AG [[~ [[3<=Dressed & 3<=Entered]] | ~ [~ [Dressed<=Out]]]]
normalized: ~ [E [true U ~ [[Dressed<=Out | ~ [[3<=Dressed & 3<=Entered]]]]]]


FORMULA SwimmingPool-PT-04-ReachabilityCardinality-1 CANNOT_COMPUTE

MC time: 0m 0.001sec

checking: EF [[Bags<=InBath & [~ [InBath<=Entered] | 1<=Out]]]
normalized: E [true U [Bags<=InBath & [1<=Out | ~ [InBath<=Entered]]]]


FORMULA SwimmingPool-PT-04-ReachabilityCardinality-15 CANNOT_COMPUTE

MC time: 0m 0.000sec

checking: EF [[Out<=Dress & ~ [[Dress<=Bags & Entered<=Dress]]]]
normalized: E [true U [Out<=Dress & ~ [[Dress<=Bags & Entered<=Dress]]]]


FORMULA SwimmingPool-PT-04-ReachabilityCardinality-7 CANNOT_COMPUTE

MC time: 0m 0.000sec

checking: EF [[~ [Dressed<=Cabins] & [[1<=Bags & Bags<=Entered] | Dressed<=Dressed]]]
normalized: E [true U [[Dressed<=Dressed | [1<=Bags & Bags<=Entered]] & ~ [Dressed<=Cabins]]]


FORMULA SwimmingPool-PT-04-ReachabilityCardinality-0 CANNOT_COMPUTE

MC time: 0m 0.000sec

checking: EF [[~ [~ [Bags<=Cabins]] & [[WaitBag<=InBath & Bags<=InBath] & [Bags<=Cabins | Out<=Entered]]]]
normalized: E [true U [Bags<=Cabins & [[Bags<=Cabins | Out<=Entered] & [WaitBag<=InBath & Bags<=InBath]]]]


FORMULA SwimmingPool-PT-04-ReachabilityCardinality-8 CANNOT_COMPUTE

MC time: 0m 0.000sec

checking: AG [[[[Out<=Out | WaitBag<=Entered] & [Cabins<=Bags | Entered<=Undress]] | ~ [~ [InBath<=Dressed]]]]
normalized: ~ [E [true U ~ [[InBath<=Dressed | [[Cabins<=Bags | Entered<=Undress] & [Out<=Out | WaitBag<=Entered]]]]]]


FORMULA SwimmingPool-PT-04-ReachabilityCardinality-13 CANNOT_COMPUTE

MC time: 0m 0.000sec

checking: AG [[[[WaitBag<=Out | 2<=Dress] | [2<=Dressed & 3<=Dressed]] & [[WaitBag<=Out & 1<=Cabins] | [Dressed<=Dress | 2<=Entered]]]]
normalized: ~ [E [true U ~ [[[[Dressed<=Dress | 2<=Entered] | [WaitBag<=Out & 1<=Cabins]] & [[2<=Dressed & 3<=Dressed] | [WaitBag<=Out | 2<=Dress]]]]]]


FORMULA SwimmingPool-PT-04-ReachabilityCardinality-3 CANNOT_COMPUTE

MC time: 0m 0.000sec

checking: AG [[[[Bags<=Bags & InBath<=Entered] | [WaitBag<=Out & Cabins<=Out]] | [[2<=Bags & 3<=WaitBag] | [Cabins<=Cabins & 3<=Dressed]]]]
normalized: ~ [E [true U ~ [[[[Cabins<=Cabins & 3<=Dressed] | [2<=Bags & 3<=WaitBag]] | [[WaitBag<=Out & Cabins<=Out] | [Bags<=Bags & InBath<=Entered]]]]]]


FORMULA SwimmingPool-PT-04-ReachabilityCardinality-9 CANNOT_COMPUTE

MC time: 0m 0.000sec


Total processing time: 10m17.648sec


BK_STOP 1464508843704

--------------------
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.004sec


iterations count:63 (9), effective:15 (2)

initing FirstDep: 0m 0.001sec


iterations count:28 (4), effective:7 (1)

iterations count:38 (5), effective:7 (1)

iterations count:32 (4), effective:7 (1)

iterations count:49 (7), effective:11 (1)
std::bad_alloc

std::bad_alloc

std::bad_alloc

std::bad_alloc

std::bad_alloc

std::bad_alloc

std::bad_alloc

std::bad_alloc

std::bad_alloc

std::bad_alloc

std::bad_alloc

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="SwimmingPool-PT-04"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/home/fko/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/SwimmingPool-PT-04.tgz
mv SwimmingPool-PT-04 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 SwimmingPool-PT-04, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r125kn-qhx2-146373371500394"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.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 ;