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

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

=== Now, execution of the tool begins

BK_START 1464507743216


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_03
(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.165sec


RS generation: 0m17.864sec


-> reachability set: #nodes 141394 (1.4e+05) #states 32,209,356 (7)



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

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

abstracting: (1<=Out) states: 30,701,728 (7)

EG iterations: 0
-> the formula is TRUE

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

MC time: 0m14.739sec

checking: EF [AF [~ [3<=Out]]]
normalized: E [true U ~ [EG [3<=Out]]]

abstracting: (3<=Out) states: 27,737,115 (7)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 5.323sec

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

abstracting: (3<=Bags) states: 31,381,878 (7)
.-> the formula is TRUE

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

MC time: 0m21.297sec

checking: ~ [EF [AX [3<=Dress]]]
normalized: ~ [E [true U ~ [EX [~ [3<=Dress]]]]]

abstracting: (3<=Dress) states: 20,961,829 (7)
.-> the formula is FALSE

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

MC time: 0m15.255sec

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

abstracting: (2<=Cabins) states: 27,036,688 (7)
-> the formula is FALSE

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

MC time: 0m 4.312sec

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

abstracting: (Out<=InBath) states: 16,018,692 (7)
-> the formula is TRUE

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

MC time: 0m23.462sec

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

abstracting: (3<=Undress) states: 20,961,829 (7)
abstracting: (Bags<=InBath) states: 9,504,768 (6)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m18.591sec

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

abstracting: (2<=Entered) states: 29,210,216 (7)
abstracting: (Dress<=Dressed) states: 17,494,428 (7)
-> the formula is FALSE

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

MC time: 0m11.514sec

checking: A [~ [~ [Dressed<=Bags]] U [3<=Out & 1<=Undress]]
normalized: [~ [EG [~ [[3<=Out & 1<=Undress]]]] & ~ [E [~ [[3<=Out & 1<=Undress]] U [~ [Dressed<=Bags] & ~ [[3<=Out & 1<=Undress]]]]]]

abstracting: (1<=Undress) states: 28,034,128 (7)
abstracting: (3<=Out) states: 27,737,115 (7)
abstracting: (Dressed<=Bags) states: 30,542,540 (7)
abstracting: (1<=Undress) states: 28,034,128 (7)
abstracting: (3<=Out) states: 27,737,115 (7)
abstracting: (1<=Undress) states: 28,034,128 (7)
abstracting: (3<=Out) states: 27,737,115 (7)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m42.340sec

checking: [~ [~ [AG [Undress<=Bags]]] & AX [EF [Out<=Dress]]]
normalized: [~ [EX [~ [E [true U Out<=Dress]]]] & ~ [E [true U ~ [Undress<=Bags]]]]

abstracting: (Undress<=Bags) states: 29,077,132 (7)
abstracting: (Out<=Dress) states: 9,231,272 (6)
.-> the formula is FALSE

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

MC time: 0m23.226sec

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

abstracting: (Entered<=Entered) states: 32,209,356 (7)
abstracting: (Entered<=Cabins) states: 10,854,432 (7)
abstracting: (2<=Out) states: 29,210,216 (7)
-> the formula is TRUE

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

MC time: 0m12.218sec

checking: [EG [[[3<=Out | Dress<=Undress] & ~ [3<=WaitBag]]] & EF [~ [WaitBag<=Cabins]]]
normalized: [E [true U ~ [WaitBag<=Cabins]] & EG [[~ [3<=WaitBag] & [3<=Out | Dress<=Undress]]]]

abstracting: (Dress<=Undress) states: 17,205,432 (7)
abstracting: (3<=Out) states: 27,737,115 (7)
abstracting: (3<=WaitBag) states: 21,379,036 (7)
........
EG iterations: 8
abstracting: (WaitBag<=Cabins) states: 19,586,652 (7)
-> the formula is TRUE

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

MC time: 0m48.284sec

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

abstracting: (2<=Dress) states: 24,296,536 (7)
abstracting: (3<=Cabins) states: 24,586,597 (7)
abstracting: (3<=InBath) states: 27,200,748 (7)
abstracting: (2<=Cabins) states: 27,036,688 (7)
abstracting: (1<=Bags) states: 31,968,636 (7)
abstracting: (3<=Bags) states: 31,381,878 (7)
abstracting: (1<=Bags) states: 31,968,636 (7)
abstracting: (1<=Bags) states: 31,968,636 (7)
.............................................................................
EG iterations: 77
-> the formula is TRUE

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

MC time: 0m17.709sec

checking: [EF [AF [Out<=WaitBag]] | E [~ [InBath<=Cabins] U [Dress<=Out & 3<=WaitBag]]]
normalized: [E [~ [InBath<=Cabins] U [Dress<=Out & 3<=WaitBag]] | E [true U ~ [EG [~ [Out<=WaitBag]]]]]

abstracting: (Out<=WaitBag) states: 9,540,770 (6)
..
EG iterations: 2
abstracting: (3<=WaitBag) states: 21,379,036 (7)
abstracting: (Dress<=Out) states: 24,346,584 (7)
abstracting: (InBath<=Cabins) states: 11,686,752 (7)
-> the formula is TRUE

FORMULA SwimmingPool-PT-03-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m59.933sec

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

abstracting: (2<=Out) states: 29,210,216 (7)
abstracting: (3<=InBath) states: 27,200,748 (7)
abstracting: (Entered<=Dress) states: 9,231,272 (6)
abstracting: (2<=InBath) states: 28,823,908 (7)
abstracting: (1<=Cabins) states: 29,580,904 (7)
abstracting: (Out<=Out) states: 32,209,356 (7)
abstracting: (Bags<=WaitBag) states: 2,139,144 (6)
abstracting: (Undress<=InBath) states: 23,600,892 (7)
-> the formula is TRUE

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

MC time: 0m21.411sec

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

abstracting: (Bags<=Cabins) states: 3,686,830 (6)
abstracting: (Undress<=InBath) states: 23,600,892 (7)
...........
EG iterations: 11
abstracting: (2<=Out) states: 29,210,216 (7)
abstracting: (1<=InBath) states: 30,493,444 (7)
abstracting: (3<=Entered) states: 27,737,115 (7)
abstracting: (Dressed<=WaitBag) states: 17,149,668 (7)
abstracting: (Cabins<=Undress) states: 14,034,660 (7)
abstracting: (3<=Dressed) states: 21,379,036 (7)
abstracting: (2<=Dressed) states: 24,624,004 (7)
-> the formula is TRUE

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

MC time: 1m10.772sec


Total processing time: 7m40.667sec


BK_STOP 1464508204247

--------------------
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:13 (1), effective:1 (0)

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

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

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

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

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

iterations count:44 (6), effective:11 (1)

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

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

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

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

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

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

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

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

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

iterations count:82 (11), effective:20 (2)

iterations count:34 (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="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-03.tgz
mv SwimmingPool-PT-03 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-03, 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-146373371400381"
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 ;