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 SwimmingPool-PT-03, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r288su-ebro-143385262200100
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1433940925689

Model: SwimmingPool-PT-03
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=ReachabilityCardinality.xml --memory=6 --suppress --rs-algorithm=3 --place-order=5

parse successfull
net created successfully

(NrP: 9 NrTr: 7 NrArc: 20)

net check time: 0m0sec

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

init dd package: 0m6sec


RS generation: 0m4sec


-> reachability set: #nodes 21864 (2.2e+04) #states 32,209,356 (7)



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

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

abstracting: (InBath<=Entered) states: 17,060,928 (7)
abstracting: (1<=Out) states: 30,701,728 (7)
abstracting: (Dress<=WaitBag) states: 17,494,428 (7)
-> the formula is FALSE

FORMULA SwimmingPool-PT-03-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m15sec

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

abstracting: (3<=Bags) states: 31,381,878 (7)
abstracting: (3<=Dress) states: 20,961,829 (7)
abstracting: (Entered<=Out) states: 16,483,800 (7)
abstracting: (2<=Dressed) states: 24,624,004 (7)
abstracting: (3<=Dressed) states: 21,379,036 (7)
abstracting: (3<=Out) states: 27,737,115 (7)
-> the formula is FALSE

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

MC time: 0m26sec

checking: EF [[[1<=Out | Dress<=WaitBag] & [[3<=Cabins | Dress<=WaitBag] & [Cabins<=Entered | Out<=InBath]]]]
normalized: E [true U [[[Cabins<=Entered | Out<=InBath] & [3<=Cabins | Dress<=WaitBag]] & [1<=Out | Dress<=WaitBag]]]

abstracting: (Dress<=WaitBag) states: 17,494,428 (7)
abstracting: (1<=Out) states: 30,701,728 (7)
abstracting: (Dress<=WaitBag) states: 17,494,428 (7)
abstracting: (3<=Cabins) states: 24,586,597 (7)
abstracting: (Out<=InBath) states: 16,018,692 (7)
abstracting: (Cabins<=Entered) states: 22,723,424 (7)
-> the formula is TRUE

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

MC time: 0m42sec

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

abstracting: (3<=Out) states: 27,737,115 (7)
abstracting: (Undress<=Dressed) states: 17,494,428 (7)
-> the formula is FALSE

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

MC time: 0m14sec

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

abstracting: (Cabins<=Cabins) states: 32,209,356 (7)
abstracting: (WaitBag<=WaitBag) states: 32,209,356 (7)
abstracting: (Bags<=Dress) states: 3,609,280 (6)
-> the formula is FALSE

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

MC time: 0m2sec

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

abstracting: (Cabins<=Out) states: 22,723,424 (7)
abstracting: (InBath<=Entered) states: 17,060,928 (7)
abstracting: (Bags<=Out) states: 7,276,272 (6)
-> the formula is TRUE

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

MC time: 1m6sec

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

abstracting: (WaitBag<=InBath) states: 23,583,420 (7)
abstracting: (3<=Out) states: 27,737,115 (7)
abstracting: (InBath<=Cabins) states: 11,686,752 (7)
-> the formula is FALSE

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

MC time: 0m6sec

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

abstracting: (InBath<=Dressed) states: 10,063,592 (7)
abstracting: (1<=Cabins) states: 29,580,904 (7)
abstracting: (Out<=Undress) states: 9,231,272 (6)
abstracting: (2<=Cabins) states: 27,036,688 (7)
abstracting: (2<=Bags) states: 31,693,440 (7)
-> the formula is TRUE

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

MC time: 0m31sec

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

abstracting: (Bags<=Entered) states: 7,276,272 (6)
abstracting: (Bags<=Entered) states: 7,276,272 (6)
abstracting: (Dress<=Bags) states: 29,077,132 (7)
abstracting: (Out<=InBath) states: 16,018,692 (7)
abstracting: (1<=Dress) states: 28,034,128 (7)
-> the formula is FALSE

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

MC time: 0m51sec

checking: EF [~ [[~ [2<=WaitBag] | 1<=WaitBag]]]
normalized: E [true U ~ [[1<=WaitBag | ~ [2<=WaitBag]]]]

abstracting: (2<=WaitBag) states: 24,624,004 (7)
abstracting: (1<=WaitBag) states: 28,226,092 (7)
-> the formula is FALSE

FORMULA SwimmingPool-PT-03-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [[~ [[2<=Dress | Dress<=Bags]] | 3<=Cabins]]
normalized: ~ [E [true U ~ [[3<=Cabins | ~ [[2<=Dress | Dress<=Bags]]]]]]

abstracting: (Dress<=Bags) states: 29,077,132 (7)
abstracting: (2<=Dress) states: 24,296,536 (7)
abstracting: (3<=Cabins) states: 24,586,597 (7)
-> the formula is FALSE

FORMULA SwimmingPool-PT-03-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m3sec

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

abstracting: (Cabins<=Out) states: 22,723,424 (7)
abstracting: (3<=InBath) states: 27,200,748 (7)
abstracting: (Entered<=InBath) states: 16,018,692 (7)
-> the formula is TRUE

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

MC time: 0m45sec

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

abstracting: (Dress<=WaitBag) states: 17,494,428 (7)
abstracting: (Cabins<=InBath) states: 21,960,260 (7)
abstracting: (WaitBag<=Dress) states: 16,886,916 (7)
abstracting: (Undress<=InBath) states: 23,600,892 (7)
abstracting: (3<=InBath) states: 27,200,748 (7)
abstracting: (2<=Dressed) states: 24,624,004 (7)
-> the formula is TRUE

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

MC time: 0m9sec

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

abstracting: (Bags<=WaitBag) states: 2,139,144 (6)
-> the formula is TRUE

FORMULA SwimmingPool-PT-03-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m1sec

checking: AG [[[[2<=Bags & Dress<=Dress] | 1<=Bags] & [[Dressed<=Dressed & Dress<=Bags] | [2<=WaitBag & 2<=Undress]]]]
normalized: ~ [E [true U ~ [[[[2<=WaitBag & 2<=Undress] | [Dressed<=Dressed & Dress<=Bags]] & [1<=Bags | [2<=Bags & Dress<=Dress]]]]]]

abstracting: (Dress<=Dress) states: 32,209,356 (7)
abstracting: (2<=Bags) states: 31,693,440 (7)
abstracting: (1<=Bags) states: 31,968,636 (7)
abstracting: (Dress<=Bags) states: 29,077,132 (7)
abstracting: (Dressed<=Dressed) states: 32,209,356 (7)
abstracting: (2<=Undress) states: 24,296,536 (7)
abstracting: (2<=WaitBag) states: 24,624,004 (7)
-> the formula is FALSE

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

MC time: 0m8sec

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

abstracting: (Bags<=Bags) states: 32,209,356 (7)
-> the formula is TRUE

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

MC time: 0m0sec


Total processing time: 5m42sec


BK_STOP 1433941268145

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

58610
iterations count:1207 (172), effective:360 (51)

initing FirstDep: 0m0sec


iterations count:51 (7), effective:16 (2)

iterations count:23 (3), effective:6 (0)

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

iterations count:31 (4), effective:9 (1)

iterations count:53 (7), effective:16 (2)

iterations count:27 (3), effective:6 (0)

iterations count:35 (5), effective:10 (1)

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

iterations count:223 (31), effective:92 (13)

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

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

iterations count:28 (4), effective:7 (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-03"
export BK_EXAMINATION="ReachabilityCardinality"
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/SwimmingPool-PT-03.tgz
mv SwimmingPool-PT-03 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 SwimmingPool-PT-03, 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 r288su-ebro-143385262200100"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "ReachabilityComputeBounds" ] ; 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 ;