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 S_SwimmingPool-PT-01, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r197kn-qhx2-146444263700574
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1465214633586


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_01
(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.324sec


RS generation: 0m 0.236sec


-> reachability set: #nodes 6529 (6.5e+03) #states 89,621 (4)



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

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

abstracting: (1<=Bags) states: 87,297 (4)
-> the formula is FALSE

FORMULA SwimmingPool-PT-01-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.186sec

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

abstracting: (3<=Bags) states: 80,091 (4)
-> the formula is FALSE

FORMULA SwimmingPool-PT-01-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.088sec

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

abstracting: (Cabins<=Bags) states: 80,471 (4)
-> the formula is FALSE

FORMULA SwimmingPool-PT-01-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.166sec

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

abstracting: (Dressed<=Out) states: 68,579 (4)
-> the formula is FALSE

FORMULA SwimmingPool-PT-01-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.231sec

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

abstracting: (Bags<=InBath) states: 28,210 (4)
-> the formula is TRUE

FORMULA SwimmingPool-PT-01-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.102sec

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

abstracting: (Out<=Undress) states: 30,093 (4)
-> the formula is TRUE

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

MC time: 0m 0.158sec

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

abstracting: (Out<=WaitBag) states: 30,932 (4)
-> the formula is FALSE

FORMULA SwimmingPool-PT-01-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.051sec

checking: AG [~ [~ [[2<=Cabins | Dressed<=InBath]]]]
normalized: ~ [E [true U ~ [[2<=Cabins | Dressed<=InBath]]]]

abstracting: (Dressed<=InBath) states: 67,599 (4)
abstracting: (2<=Cabins) states: 54,831 (4)
-> the formula is FALSE

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

MC time: 0m 0.210sec

checking: AG [~ [[[Entered<=Dressed & 1<=Bags] & ~ [2<=Bags]]]]
normalized: ~ [E [true U [~ [2<=Bags] & [Entered<=Dressed & 1<=Bags]]]]

abstracting: (1<=Bags) states: 87,297 (4)
abstracting: (Entered<=Dressed) states: 30,932 (4)
abstracting: (2<=Bags) states: 84,147 (4)
-> the formula is FALSE

FORMULA SwimmingPool-PT-01-ReachabilityCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.124sec

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

abstracting: (Undress<=Cabins) states: 59,627 (4)
abstracting: (1<=Entered) states: 78,211 (4)
abstracting: (1<=Entered) states: 78,211 (4)
-> the formula is FALSE

FORMULA SwimmingPool-PT-01-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.038sec

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

abstracting: (Out<=WaitBag) states: 30,932 (4)
abstracting: (Entered<=Bags) states: 72,877 (4)
abstracting: (InBath<=Undress) states: 32,890 (4)
-> the formula is TRUE

FORMULA SwimmingPool-PT-01-ReachabilityCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.203sec

checking: EF [[~ [[3<=Bags | Dress<=Undress]] & ~ [[WaitBag<=Out & 3<=Cabins]]]]
normalized: E [true U [~ [[WaitBag<=Out & 3<=Cabins]] & ~ [[3<=Bags | Dress<=Undress]]]]

abstracting: (Dress<=Undress) states: 52,865 (4)
abstracting: (3<=Bags) states: 80,091 (4)
abstracting: (3<=Cabins) states: 40,334 (4)
abstracting: (WaitBag<=Out) states: 68,579 (4)
-> the formula is TRUE

FORMULA SwimmingPool-PT-01-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.160sec

checking: EF [~ [[[Entered<=Undress | 3<=Dress] | [InBath<=Bags | WaitBag<=Dress]]]]
normalized: E [true U ~ [[[InBath<=Bags | WaitBag<=Dress] | [Entered<=Undress | 3<=Dress]]]]

abstracting: (3<=Dress) states: 26,078 (4)
abstracting: (Entered<=Undress) states: 30,093 (4)
abstracting: (WaitBag<=Dress) states: 51,751 (4)
abstracting: (InBath<=Bags) states: 65,093 (4)
-> the formula is TRUE

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

MC time: 0m 0.242sec

checking: EF [[[~ [InBath<=WaitBag] & ~ [2<=Dressed]] & [[Bags<=Dress | Bags<=Dressed] & 3<=Undress]]]
normalized: E [true U [[3<=Undress & [Bags<=Dress | Bags<=Dressed]] & [~ [2<=Dressed] & ~ [InBath<=WaitBag]]]]

abstracting: (InBath<=WaitBag) states: 33,033 (4)
abstracting: (2<=Dressed) states: 42,528 (4)
abstracting: (Bags<=Dressed) states: 8,512 (3)
abstracting: (Bags<=Dress) states: 12,872 (4)
abstracting: (3<=Undress) states: 26,078 (4)
-> the formula is TRUE

FORMULA SwimmingPool-PT-01-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.242sec

checking: AG [[~ [Dress<=Dress] | [[Entered<=InBath | WaitBag<=Bags] | [Dress<=InBath & 1<=InBath]]]]
normalized: ~ [E [true U ~ [[[[Entered<=InBath | WaitBag<=Bags] | [Dress<=InBath & 1<=InBath]] | ~ [Dress<=Dress]]]]]

abstracting: (Dress<=Dress) states: 89,621 (4)
abstracting: (1<=InBath) states: 76,608 (4)
abstracting: (Dress<=InBath) states: 67,675 (4)
abstracting: (WaitBag<=Bags) states: 85,169 (4)
abstracting: (Entered<=InBath) states: 46,473 (4)
-> the formula is TRUE

FORMULA SwimmingPool-PT-01-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.103sec

checking: AG [[[[Cabins<=WaitBag & WaitBag<=Cabins] | [InBath<=InBath | 1<=Undress]] | [Cabins<=Cabins | 2<=InBath]]]
normalized: ~ [E [true U ~ [[[Cabins<=Cabins | 2<=InBath] | [[InBath<=InBath | 1<=Undress] | [Cabins<=WaitBag & WaitBag<=Cabins]]]]]]

abstracting: (WaitBag<=Cabins) states: 58,513 (4)
abstracting: (Cabins<=WaitBag) states: 43,351 (4)
abstracting: (1<=Undress) states: 61,536 (4)
abstracting: (InBath<=InBath) states: 89,621 (4)
abstracting: (2<=InBath) states: 64,596 (4)
abstracting: (Cabins<=Cabins) states: 89,621 (4)
-> the formula is TRUE

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

MC time: 0m 0.104sec


Total processing time: 0m23.311sec


BK_STOP 1465214656953

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


iterations count:52 (7), effective:12 (1)

iterations count:52 (7), effective:12 (1)

iterations count:39 (5), effective:9 (1)

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

iterations count:37 (5), effective:8 (1)

iterations count:22 (3), effective:4 (0)

iterations count:13 (1), effective:1 (0)

iterations count:134 (19), effective:47 (6)

iterations count:78 (11), effective:21 (3)

iterations count:50 (7), effective:12 (1)

iterations count:58 (8), effective:15 (2)

iterations count:62 (8), effective:16 (2)

iterations count:45 (6), effective:13 (1)

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_SwimmingPool-PT-01"
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/S_SwimmingPool-PT-01.tgz
mv S_SwimmingPool-PT-01 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 S_SwimmingPool-PT-01, 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 r197kn-qhx2-146444263700574"
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 ;