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

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

Model: SwimmingPool-PT-02
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 7579 (7.6e+03) #states 3,408,031 (6)



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

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

abstracting: (Dressed<=Entered) states: 2,556,120 (6)
abstracting: (Cabins<=Dressed) states: 1,552,111 (6)
-> the formula is TRUE

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

MC time: 0m1sec

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

abstracting: (2<=InBath) states: 2,887,357 (6)
abstracting: (1<=Bags) states: 3,368,134 (6)
abstracting: (3<=Bags) states: 3,263,302 (6)
abstracting: (3<=Cabins) states: 2,277,408 (6)
abstracting: (3<=Undress) states: 1,803,396 (6)
-> the formula is FALSE

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

MC time: 0m0sec

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

abstracting: (1<=Entered) states: 3,174,787 (6)
abstracting: (InBath<=Out) states: 1,830,004 (6)
abstracting: (Dress<=Out) states: 2,598,673 (6)
abstracting: (1<=WaitBag) states: 2,811,688 (6)
abstracting: (3<=Dressed) states: 1,857,009 (6)
abstracting: (Entered<=Entered) states: 3,408,031 (6)
abstracting: (1<=InBath) states: 3,142,381 (6)
abstracting: (Undress<=Bags) states: 3,074,288 (6)
abstracting: (2<=InBath) states: 2,887,357 (6)
abstracting: (2<=Dressed) states: 2,297,196 (6)
..........................
EG iterations: 26
-> the formula is FALSE

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

MC time: 0m6sec

checking: EG [AF [[Cabins<=Cabins & 1<=Undress]]]
normalized: EG [~ [EG [~ [[Cabins<=Cabins & 1<=Undress]]]]]

abstracting: (1<=Undress) states: 2,782,912 (6)
abstracting: (Cabins<=Cabins) states: 3,408,031 (6)
..................................................................................................................................................................
EG iterations: 162

EG iterations: 0
-> the formula is TRUE

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

MC time: 0m4sec

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

abstracting: (Out<=Entered) states: 1,762,888 (6)
-> the formula is FALSE

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

MC time: 0m3sec

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

abstracting: (Undress<=Cabins) states: 2,151,407 (6)
.-> the formula is TRUE

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

MC time: 0m1sec

checking: AG [[EG [InBath<=Cabins] & AF [Undress<=Bags]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [Undress<=Bags]]] & EG [InBath<=Cabins]]]]]

abstracting: (InBath<=Cabins) states: 1,292,830 (6)
.
EG iterations: 1
abstracting: (Undress<=Bags) states: 3,074,288 (6)
.........................................
EG iterations: 41
-> the formula is FALSE

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

MC time: 0m0sec

checking: A [EX [2<=Out] U EG [1<=Dress]]
normalized: [~ [EG [~ [EG [1<=Dress]]]] & ~ [E [~ [EX [2<=Out]] U [~ [EG [1<=Dress]] & ~ [EX [2<=Out]]]]]]

abstracting: (2<=Out) states: 2,945,404 (6)
.abstracting: (1<=Dress) states: 2,782,912 (6)
.
EG iterations: 1
abstracting: (2<=Out) states: 2,945,404 (6)
.abstracting: (1<=Dress) states: 2,782,912 (6)
.
EG iterations: 1
..................................................................................................................................................................
EG iterations: 162
-> the formula is TRUE

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

MC time: 0m2sec

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

abstracting: (3<=Out) states: 2,720,662 (6)
-> the formula is FALSE

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

MC time: 0m0sec

checking: AF [1<=InBath]
normalized: ~ [EG [~ [1<=InBath]]]

abstracting: (1<=InBath) states: 3,142,381 (6)
..........................................................................................................................
EG iterations: 122
-> the formula is TRUE

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

MC time: 0m0sec

checking: E [AG [3<=Dressed] U AG [Dress<=Cabins]]
normalized: E [~ [E [true U ~ [3<=Dressed]]] U ~ [E [true U ~ [Dress<=Cabins]]]]

abstracting: (Dress<=Cabins) states: 2,151,407 (6)
abstracting: (3<=Dressed) states: 1,857,009 (6)
-> the formula is FALSE

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

MC time: 0m1sec

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

abstracting: (3<=Cabins) states: 2,277,408 (6)
-> the formula is FALSE

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

MC time: 0m0sec

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

abstracting: (Cabins<=InBath) states: 2,338,347 (6)
-> the formula is FALSE

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

MC time: 0m0sec

checking: ~ [A [InBath<=Out U 1<=Dress]]
normalized: ~ [[~ [EG [~ [1<=Dress]]] & ~ [E [~ [InBath<=Out] U [~ [InBath<=Out] & ~ [1<=Dress]]]]]]

abstracting: (1<=Dress) states: 2,782,912 (6)
abstracting: (InBath<=Out) states: 1,830,004 (6)
abstracting: (InBath<=Out) states: 1,830,004 (6)
abstracting: (1<=Dress) states: 2,782,912 (6)
..................................................................................................................................................................
EG iterations: 162
-> the formula is FALSE

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

MC time: 0m5sec

checking: A [EG [1<=Bags] U EG [WaitBag<=InBath]]
normalized: [~ [EG [~ [EG [WaitBag<=InBath]]]] & ~ [E [~ [EG [1<=Bags]] U [~ [EG [1<=Bags]] & ~ [EG [WaitBag<=InBath]]]]]]

abstracting: (WaitBag<=InBath) states: 2,515,447 (6)
..................................................................................
EG iterations: 82
abstracting: (1<=Bags) states: 3,368,134 (6)
.
EG iterations: 1
abstracting: (1<=Bags) states: 3,368,134 (6)
.
EG iterations: 1
abstracting: (WaitBag<=InBath) states: 2,515,447 (6)
..................................................................................
EG iterations: 82
......................
EG iterations: 22
-> the formula is FALSE

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

MC time: 0m0sec

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

abstracting: (2<=Entered) states: 2,945,404 (6)
abstracting: (Out<=Cabins) states: 1,198,450 (6)
abstracting: (3<=Dressed) states: 1,857,009 (6)
-> the formula is FALSE

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

MC time: 0m2sec


Total processing time: 0m46sec


BK_STOP 1433940934006

--------------------
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:807 (115), effective:240 (34)

initing FirstDep: 0m0sec


iterations count:10 (1), effective:2 (0)

iterations count:50 (7), effective:14 (2)

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

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

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

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

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

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

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

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

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

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

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

iterations count:9 (1), effective:1 (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-02"
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-02.tgz
mv SwimmingPool-PT-02 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-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 r288su-ebro-143385262200080"
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 ;