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

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

=== Now, execution of the tool begins

BK_START 1464507640191


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_02
(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: 0m17.380sec


RS generation: 0m 3.672sec


-> reachability set: #nodes 44324 (4.4e+04) #states 3,408,031 (6)



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

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

abstracting: (Bags<=Cabins) states: 420,224 (5)
-> the formula is TRUE

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

MC time: 0m 5.184sec

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

abstracting: (Cabins<=Bags) states: 3,067,204 (6)
-> the formula is TRUE

FORMULA SwimmingPool-PT-02-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.946sec

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

abstracting: (Cabins<=Out) states: 2,421,573 (6)
-> the formula is FALSE

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

MC time: 0m 2.260sec

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

abstracting: (Cabins<=Entered) states: 2,421,573 (6)
-> the formula is TRUE

FORMULA SwimmingPool-PT-02-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.223sec

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

abstracting: (Entered<=Entered) states: 3,408,031 (6)
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: EF [Cabins<=Dress]
normalized: E [true U Cabins<=Dress]

abstracting: (Cabins<=Dress) states: 1,520,810 (6)
-> the formula is TRUE

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

MC time: 0m 3.656sec

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

abstracting: (Out<=Dress) states: 1,021,350 (6)
-> the formula is TRUE

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

MC time: 0m 2.021sec

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

abstracting: (3<=Dressed) states: 1,857,009 (6)
abstracting: (1<=Dressed) states: 2,811,688 (6)
abstracting: (3<=Bags) states: 3,263,302 (6)
-> the formula is TRUE

FORMULA SwimmingPool-PT-02-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.843sec

checking: AG [[~ [Bags<=InBath] & Dressed<=Dressed]]
normalized: ~ [E [true U ~ [[Dressed<=Dressed & ~ [Bags<=InBath]]]]]

abstracting: (Bags<=InBath) states: 1,023,814 (6)
abstracting: (Dressed<=Dressed) states: 3,408,031 (6)
-> the formula is FALSE

FORMULA SwimmingPool-PT-02-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.697sec

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

abstracting: (Dressed<=Dress) states: 1,836,681 (6)
abstracting: (Out<=Out) states: 3,408,031 (6)
-> the formula is TRUE

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

MC time: 0m 0.550sec

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

abstracting: (2<=Out) states: 2,945,404 (6)
abstracting: (Entered<=Bags) states: 2,752,893 (6)
abstracting: (2<=Cabins) states: 2,633,477 (6)
-> the formula is TRUE

FORMULA SwimmingPool-PT-02-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.325sec

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

abstracting: (WaitBag<=Dressed) states: 1,863,819 (6)
abstracting: (Dress<=Entered) states: 2,598,673 (6)
abstracting: (1<=Cabins) states: 3,011,371 (6)
-> the formula is TRUE

FORMULA SwimmingPool-PT-02-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.490sec

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

abstracting: (Bags<=Bags) states: 3,408,031 (6)
abstracting: (3<=InBath) states: 2,642,959 (6)
abstracting: (InBath<=Bags) states: 2,459,017 (6)
-> the formula is FALSE

FORMULA SwimmingPool-PT-02-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.077sec

checking: AG [[~ [[InBath<=Out | Out<=Out]] | [InBath<=Out & 2<=Out]]]
normalized: ~ [E [true U ~ [[[InBath<=Out & 2<=Out] | ~ [[InBath<=Out | Out<=Out]]]]]]

abstracting: (Out<=Out) states: 3,408,031 (6)
abstracting: (InBath<=Out) states: 1,830,004 (6)
abstracting: (2<=Out) states: 2,945,404 (6)
abstracting: (InBath<=Out) states: 1,830,004 (6)
-> the formula is FALSE

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

MC time: 0m 4.911sec

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

abstracting: (Entered<=Bags) states: 2,752,893 (6)
abstracting: (3<=InBath) states: 2,642,959 (6)
abstracting: (3<=Out) states: 2,720,662 (6)
abstracting: (1<=Dressed) states: 2,811,688 (6)
abstracting: (Cabins<=WaitBag) states: 1,552,111 (6)
-> the formula is TRUE

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

MC time: 0m 4.034sec

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

abstracting: (Out<=Undress) states: 1,021,350 (6)
abstracting: (2<=Cabins) states: 2,633,477 (6)
abstracting: (Out<=InBath) states: 1,713,745 (6)
abstracting: (WaitBag<=Dress) states: 1,836,681 (6)
abstracting: (Bags<=Undress) states: 409,654 (5)
-> the formula is TRUE

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

MC time: 0m 7.205sec


Total processing time: 1m19.682sec


BK_STOP 1464507719975

--------------------
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:35 (5), effective:8 (1)

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

iterations count:28 (4), effective:6 (0)

iterations count:15 (2), effective:2 (0)

iterations count:28 (4), effective:5 (0)

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

iterations count:53 (7), effective:13 (1)

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

iterations count:41 (5), effective:11 (1)

iterations count:68 (9), effective:18 (2)

iterations count:19 (2), effective:3 (0)

iterations count:79 (11), effective:22 (3)

iterations count:33 (4), effective:10 (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="SwimmingPool-PT-02"
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-02.tgz
mv SwimmingPool-PT-02 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-02, 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-146373371400376"
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 ;