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-01, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r288su-ebro-143385262200067
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1433940859638

Model: SwimmingPool-PT-01
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=CTLCardinality.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: 0m5sec


RS generation: 0m0sec


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



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

checking: [[[1<=WaitBag | EG [2<=Dressed]] | 1<=Dress] | EF [Out<=Undress]]
normalized: [E [true U Out<=Undress] | [1<=Dress | [1<=WaitBag | EG [2<=Dressed]]]]

abstracting: (2<=Dressed) states: 42,528 (4)
.
EG iterations: 1
abstracting: (1<=WaitBag) states: 62,824 (4)
abstracting: (1<=Dress) states: 61,536 (4)
abstracting: (Out<=Undress) states: 30,093 (4)
-> the formula is TRUE

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec

checking: E [~ [[Cabins<=Bags & 3<=WaitBag]] U [3<=Undress & [3<=Cabins & Bags<=Entered]]]
normalized: E [~ [[Cabins<=Bags & 3<=WaitBag]] U [3<=Undress & [3<=Cabins & Bags<=Entered]]]

abstracting: (Bags<=Entered) states: 24,808 (4)
abstracting: (3<=Cabins) states: 40,334 (4)
abstracting: (3<=Undress) states: 26,078 (4)
abstracting: (3<=WaitBag) states: 27,622 (4)
abstracting: (Cabins<=Bags) states: 80,471 (4)
-> the formula is TRUE

FORMULA SwimmingPool-PT-01-CTLCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (Dressed<=Cabins) states: 58,513 (4)
.-> the formula is TRUE

FORMULA SwimmingPool-PT-01-CTLCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (Dress<=Cabins) states: 59,627 (4)
-> the formula is TRUE

FORMULA SwimmingPool-PT-01-CTLCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (2<=Dress) states: 40,872 (4)
abstracting: (1<=WaitBag) states: 62,824 (4)
abstracting: (3<=InBath) states: 53,585 (4)
abstracting: (3<=InBath) states: 53,585 (4)
-> the formula is TRUE

FORMULA SwimmingPool-PT-01-CTLCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

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

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

MC time: 0m0sec

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

abstracting: (Out<=Cabins) states: 35,098 (4)
abstracting: (Dressed<=Undress) states: 51,751 (4)
abstracting: (Cabins<=InBath) states: 62,594 (4)
abstracting: (2<=Cabins) states: 54,831 (4)
abstracting: (2<=Dressed) states: 42,528 (4)
abstracting: (Dress<=Dress) states: 89,621 (4)
abstracting: (2<=InBath) states: 64,596 (4)
abstracting: (WaitBag<=Dressed) states: 52,395 (4)
......................
EG iterations: 22
abstracting: (Cabins<=Bags) states: 80,471 (4)
abstracting: (InBath<=Entered) states: 49,945 (4)
-> the formula is TRUE

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

MC time: 0m0sec

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

abstracting: (3<=Dress) states: 26,078 (4)
abstracting: (2<=Dress) states: 40,872 (4)
abstracting: (1<=Dressed) states: 62,824 (4)
-> the formula is TRUE

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

MC time: 0m0sec

checking: [[EG [~ [1<=Dressed]] | ~ [3<=Out]] & ~ [AF [[1<=Dressed & 3<=Cabins]]]]
normalized: [EG [~ [[1<=Dressed & 3<=Cabins]]] & [~ [3<=Out] | EG [~ [1<=Dressed]]]]

abstracting: (1<=Dressed) states: 62,824 (4)
.............................................................................
EG iterations: 77
abstracting: (3<=Out) states: 56,749 (4)
abstracting: (3<=Cabins) states: 40,334 (4)
abstracting: (1<=Dressed) states: 62,824 (4)
.
EG iterations: 1
-> the formula is FALSE

FORMULA SwimmingPool-PT-01-CTLCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: ~ [AG [AF [InBath<=Out]]]
normalized: E [true U EG [~ [InBath<=Out]]]

abstracting: (InBath<=Out) states: 49,945 (4)
............
EG iterations: 12
-> the formula is TRUE

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

MC time: 0m0sec

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

abstracting: (2<=Undress) states: 40,872 (4)
abstracting: (2<=Undress) states: 40,872 (4)
abstracting: (3<=Cabins) states: 40,334 (4)
abstracting: (Undress<=Dressed) states: 53,725 (4)
abstracting: (Out<=Entered) states: 47,723 (4)
abstracting: (WaitBag<=InBath) states: 67,599 (4)
..........................................
EG iterations: 42
abstracting: (1<=Out) states: 78,211 (4)
abstracting: (Out<=WaitBag) states: 30,932 (4)
-> the formula is FALSE

FORMULA SwimmingPool-PT-01-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EG [[2<=Bags & ~ [[1<=Undress & 1<=Undress]]]]
normalized: EG [[2<=Bags & ~ [[1<=Undress & 1<=Undress]]]]

abstracting: (1<=Undress) states: 61,536 (4)
abstracting: (1<=Undress) states: 61,536 (4)
abstracting: (2<=Bags) states: 84,147 (4)
..............................................................................
EG iterations: 78
-> the formula is FALSE

FORMULA SwimmingPool-PT-01-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EG [AX [~ [1<=Dressed]]]
normalized: EG [~ [EX [1<=Dressed]]]

abstracting: (1<=Dressed) states: 62,824 (4)
.........................................................................
EG iterations: 72
-> the formula is FALSE

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

MC time: 0m0sec

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

abstracting: (Dress<=InBath) states: 67,675 (4)
abstracting: (2<=Out) states: 67,207 (4)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m0sec

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

abstracting: (2<=Dress) states: 40,872 (4)
.abstracting: (Cabins<=Bags) states: 80,471 (4)
-> the formula is FALSE

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

MC time: 0m0sec


Total processing time: 0m9sec


BK_STOP 1433940869535

--------------------
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:407 (58), effective:120 (17)

initing FirstDep: 0m0sec


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

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

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

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

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

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

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

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

iterations count:68 (9), effective:23 (3)

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

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

iterations count:20 (2), effective:4 (0)

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

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

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

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

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-01"
export BK_EXAMINATION="CTLCardinality"
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-01.tgz
mv SwimmingPool-PT-01 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-01, examination is CTLCardinality"
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-143385262200067"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "ReachabilityComputeBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;