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

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

=== Now, execution of the tool begins

BK_START 1433940961558

Model: SwimmingPool-PT-05
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: 0m33sec


-> reachability set: #nodes 88309 (8.8e+04) #states 591,371,001 (8)



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

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

abstracting: (3<=Cabins) states: 502,535,320 (8)
-> the formula is TRUE

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

MC time: 0m13sec

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

abstracting: (WaitBag<=Undress) states: 302,661,801 (8)
abstracting: (Bags<=Entered) states: 126,981,036 (8)
abstracting: (Dress<=Entered) states: 443,707,056 (8)
-> the formula is FALSE

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

MC time: 9m1sec

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

abstracting: (Cabins<=Entered) states: 414,717,381 (8)
-> the formula is FALSE

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

MC time: 4m5sec

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

abstracting: (Out<=WaitBag) states: 168,696,008 (8)
-> the formula is FALSE

FORMULA SwimmingPool-PT-05-CTLCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 7m21sec

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

abstracting: (Dress<=Entered) states: 443,707,056 (8)
.abstracting: (1<=WaitBag) states: 545,275,770 (8)
abstracting: (2<=Undress) states: 497,905,135 (8)
abstracting: (Cabins<=Entered) states: 414,717,381 (8)
....................................................
EG iterations: 52
abstracting: (WaitBag<=InBath) states: 430,082,991 (8)
abstracting: (3<=Cabins) states: 502,535,320 (8)
abstracting: (1<=Dressed) states: 545,275,770 (8)
.........................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 377
-> the formula is FALSE

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

MC time: 12m18sec

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

abstracting: (Undress<=Bags) states: 534,256,099 (8)
abstracting: (Bags<=Out) states: 126,981,036 (8)
-> the formula is FALSE

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

MC time: 6m47sec

checking: EF [[[[WaitBag<=Entered & Cabins<=Entered] | Bags<=Entered] & AF [Undress<=Undress]]]
normalized: E [true U [~ [EG [~ [Undress<=Undress]]] & [Bags<=Entered | [WaitBag<=Entered & Cabins<=Entered]]]]

abstracting: (Cabins<=Entered) states: 414,717,381 (8)
abstracting: (WaitBag<=Entered) states: 437,384,467 (8)
abstracting: (Bags<=Entered) states: 126,981,036 (8)
abstracting: (Undress<=Undress) states: 591,371,001 (8)
.
EG iterations: 1

BK_TIME_CONFINEMENT_REACHED

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

212873 88308
iterations count:2007 (286), effective:600 (85)

initing FirstDep: 0m0sec


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

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

iterations count:74 (10), effective:27 (3)

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

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

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

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

iterations count:270 (38), effective:112 (16)

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

iterations count:359 (51), effective:150 (21)

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-05"
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-05.tgz
mv SwimmingPool-PT-05 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-05, 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-143385262200119"
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 ;