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 CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r125kn-qhx2-146373371400372
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1464507585377


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=CTLCardinality.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: 0m16.891sec


RS generation: 0m 3.537sec


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



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

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

abstracting: (3<=Bags) states: 3,263,302 (6)
-> the formula is TRUE

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

MC time: 0m 3.881sec

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

abstracting: (Dressed<=Bags) states: 3,233,307 (6)
-> the formula is TRUE

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

MC time: 0m 3.824sec

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

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

FORMULA SwimmingPool-PT-02-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (Bags<=Bags) states: 3,408,031 (6)
abstracting: (1<=Dress) states: 2,782,912 (6)
-> the formula is TRUE

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

MC time: 0m 0.333sec

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

abstracting: (Out<=Undress) states: 1,021,350 (6)
......................
EG iterations: 22
abstracting: (1<=Out) states: 3,174,787 (6)
-> the formula is TRUE

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

MC time: 0m 5.105sec

checking: AG [EX [[Dressed<=Bags | 2<=Undress]]]
normalized: ~ [E [true U ~ [EX [[Dressed<=Bags | 2<=Undress]]]]]

abstracting: (2<=Undress) states: 2,251,634 (6)
abstracting: (Dressed<=Bags) states: 3,233,307 (6)
.-> the formula is FALSE

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

MC time: 0m 3.020sec

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

abstracting: (2<=Cabins) states: 2,633,477 (6)
abstracting: (Out<=Dressed) states: 1,054,144 (6)
.-> the formula is FALSE

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

MC time: 0m 3.317sec

checking: EG [EG [[Dress<=Dressed | 3<=Dressed]]]
normalized: EG [EG [[Dress<=Dressed | 3<=Dressed]]]

abstracting: (3<=Dressed) states: 1,857,009 (6)
abstracting: (Dress<=Dressed) states: 1,904,034 (6)
..............................................................................................................................................
EG iterations: 142
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m18.500sec

checking: AG [EF [[Undress<=Undress & 1<=Dressed]]]
normalized: ~ [E [true U ~ [E [true U [Undress<=Undress & 1<=Dressed]]]]]

abstracting: (1<=Dressed) states: 2,811,688 (6)
abstracting: (Undress<=Undress) states: 3,408,031 (6)
-> the formula is TRUE

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

MC time: 0m 1.610sec

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

abstracting: (3<=WaitBag) states: 1,857,009 (6)
abstracting: (Out<=Cabins) states: 1,198,450 (6)
abstracting: (1<=WaitBag) states: 2,811,688 (6)
-> the formula is FALSE

FORMULA SwimmingPool-PT-02-CTLCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.366sec

checking: [A [[1<=Out & 1<=Out] U 2<=InBath] | AF [AG [2<=Cabins]]]
normalized: [~ [EG [E [true U ~ [2<=Cabins]]]] | [~ [EG [~ [2<=InBath]]] & ~ [E [~ [2<=InBath] U [~ [[1<=Out & 1<=Out]] & ~ [2<=InBath]]]]]]

abstracting: (2<=InBath) states: 2,887,357 (6)
abstracting: (1<=Out) states: 3,174,787 (6)
abstracting: (1<=Out) states: 3,174,787 (6)
abstracting: (2<=InBath) states: 2,887,357 (6)
abstracting: (2<=InBath) states: 2,887,357 (6)
.........................................
EG iterations: 41
abstracting: (2<=Cabins) states: 2,633,477 (6)

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 1.671sec

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

abstracting: (3<=Out) states: 2,720,662 (6)
abstracting: (Entered<=Bags) states: 2,752,893 (6)
abstracting: (2<=Bags) states: 3,320,086 (6)
-> the formula is TRUE

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

MC time: 0m 1.997sec

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

abstracting: (Cabins<=Entered) states: 2,421,573 (6)
abstracting: (WaitBag<=Bags) states: 3,233,307 (6)
-> the formula is FALSE

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

MC time: 0m 1.434sec

checking: [EF [AX [Bags<=Entered]] & [Dress<=Undress | [1<=Cabins | EX [Entered<=Out]]]]
normalized: [[Dress<=Undress | [1<=Cabins | EX [Entered<=Out]]] & E [true U ~ [EX [~ [Bags<=Entered]]]]]

abstracting: (Bags<=Entered) states: 815,815 (5)
.abstracting: (Entered<=Out) states: 1,762,888 (6)
.abstracting: (1<=Cabins) states: 3,011,371 (6)
abstracting: (Dress<=Undress) states: 1,872,733 (6)
-> the formula is TRUE

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

MC time: 0m 3.013sec

checking: E [[Dress<=Out | [Entered<=InBath & 1<=Bags]] U [[3<=Entered & Dressed<=Out] & Out<=InBath]]
normalized: E [[Dress<=Out | [Entered<=InBath & 1<=Bags]] U [Out<=InBath & [3<=Entered & Dressed<=Out]]]

abstracting: (Dressed<=Out) states: 2,556,120 (6)
abstracting: (3<=Entered) states: 2,720,662 (6)
abstracting: (Out<=InBath) states: 1,713,745 (6)
abstracting: (1<=Bags) states: 3,368,134 (6)
abstracting: (Entered<=InBath) states: 1,713,745 (6)
abstracting: (Dress<=Out) states: 2,598,673 (6)
-> the formula is TRUE

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

MC time: 0m 5.617sec

checking: A [[[Dress<=Entered | 3<=Bags] | [2<=WaitBag | Dress<=Dressed]] U [[1<=WaitBag & Undress<=Dress] & [Out<=WaitBag | 1<=Bags]]]
normalized: [~ [EG [~ [[[Out<=WaitBag | 1<=Bags] & [1<=WaitBag & Undress<=Dress]]]]] & ~ [E [~ [[[Out<=WaitBag | 1<=Bags] & [1<=WaitBag & Undress<=Dress]]] U [~ [[[2<=WaitBag | Dress<=Dressed] | [Dress<=Entered | 3<=Bags]]] & ~ [[[Out<=WaitBag | 1<=Bags] & [1<=WaitBag & Undress<=Dress]]]]]]]

abstracting: (Undress<=Dress) states: 1,872,733 (6)
abstracting: (1<=WaitBag) states: 2,811,688 (6)
abstracting: (1<=Bags) states: 3,368,134 (6)
abstracting: (Out<=WaitBag) states: 1,054,144 (6)
abstracting: (3<=Bags) states: 3,263,302 (6)
abstracting: (Dress<=Entered) states: 2,598,673 (6)
abstracting: (Dress<=Dressed) states: 1,904,034 (6)
abstracting: (2<=WaitBag) states: 2,297,196 (6)
abstracting: (Undress<=Dress) states: 1,872,733 (6)
abstracting: (1<=WaitBag) states: 2,811,688 (6)
abstracting: (1<=Bags) states: 3,368,134 (6)
abstracting: (Out<=WaitBag) states: 1,054,144 (6)
abstracting: (Undress<=Dress) states: 1,872,733 (6)
abstracting: (1<=WaitBag) states: 2,811,688 (6)
abstracting: (1<=Bags) states: 3,368,134 (6)
abstracting: (Out<=WaitBag) states: 1,054,144 (6)
..............................................................................................................................................
EG iterations: 142
-> the formula is TRUE

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

MC time: 0m13.777sec


Total processing time: 1m35.965sec


BK_STOP 1464507681459

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


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

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

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

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

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

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

iterations count:69 (9), effective:16 (2)

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

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

iterations count:123 (17), effective:41 (5)

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

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

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

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

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

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

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

iterations count:163 (23), effective:56 (8)

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="CTLCardinality"
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 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 r125kn-qhx2-146373371400372"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; 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 ;