About the Execution of Marcie for S_SwimmingPool-PT-04
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15953.080 | 1409253.00 | 1351560.00 | 31510.30 | FF?TTFF?F?FF??T? | normal |
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 S_SwimmingPool-PT-04, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r197kn-qhx2-146444263800597
=====================================================================
--------------------
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-04-CTLCardinality-0
FORMULA_NAME SwimmingPool-PT-04-CTLCardinality-1
FORMULA_NAME SwimmingPool-PT-04-CTLCardinality-10
FORMULA_NAME SwimmingPool-PT-04-CTLCardinality-11
FORMULA_NAME SwimmingPool-PT-04-CTLCardinality-12
FORMULA_NAME SwimmingPool-PT-04-CTLCardinality-13
FORMULA_NAME SwimmingPool-PT-04-CTLCardinality-14
FORMULA_NAME SwimmingPool-PT-04-CTLCardinality-15
FORMULA_NAME SwimmingPool-PT-04-CTLCardinality-2
FORMULA_NAME SwimmingPool-PT-04-CTLCardinality-3
FORMULA_NAME SwimmingPool-PT-04-CTLCardinality-4
FORMULA_NAME SwimmingPool-PT-04-CTLCardinality-5
FORMULA_NAME SwimmingPool-PT-04-CTLCardinality-6
FORMULA_NAME SwimmingPool-PT-04-CTLCardinality-7
FORMULA_NAME SwimmingPool-PT-04-CTLCardinality-8
FORMULA_NAME SwimmingPool-PT-04-CTLCardinality-9
=== Now, execution of the tool begins
BK_START 1465215389567
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_04
(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.147sec
RS generation: 1m18.539sec
-> reachability set: #nodes 325739 (3.3e+05) #states 164,385,221 (8)
starting MCC model checker
--------------------------
checking: AG [3<=Cabins]
normalized: ~ [E [true U ~ [3<=Cabins]]]
abstracting: (3<=Cabins) states: 134,169,526 (8)
-> the formula is FALSE
FORMULA SwimmingPool-PT-04-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 1m13.899sec
checking: AG [1<=Out]
normalized: ~ [E [true U ~ [1<=Out]]]
abstracting: (1<=Out) states: 158,538,534 (8)
-> the formula is FALSE
FORMULA SwimmingPool-PT-04-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m47.943sec
checking: EF [AG [~ [Bags<=Dress]]]
normalized: E [true U ~ [E [true U Bags<=Dress]]]
abstracting: (Bags<=Dress) states: 17,743,792 (7)
-> the formula is FALSE
FORMULA SwimmingPool-PT-04-CTLCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 2m10.412sec
checking: EG [WaitBag<=InBath]
normalized: EG [WaitBag<=InBath]
abstracting: (WaitBag<=InBath) states: 119,858,893 (8)
..................................................................................................................................................................
EG iterations: 162
-> the formula is FALSE
FORMULA SwimmingPool-PT-04-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 2m 9.568sec
checking: E [~ [Bags<=Undress] U AG [3<=Dress]]
normalized: E [~ [Bags<=Undress] U ~ [E [true U ~ [3<=Dress]]]]
abstracting: (3<=Dress) states: 118,857,502 (8)
abstracting: (Bags<=Undress) states: 17,743,792 (7)
-> the formula is FALSE
FORMULA SwimmingPool-PT-04-CTLCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 1m 1.455sec
checking: AG [A [Dress<=InBath U 1<=Out]]
normalized: ~ [E [true U ~ [[~ [EG [~ [1<=Out]]] & ~ [E [~ [1<=Out] U [~ [Dress<=InBath] & ~ [1<=Out]]]]]]]]
abstracting: (1<=Out) states: 158,538,534 (8)
abstracting: (Dress<=InBath) states: 119,940,975 (8)
abstracting: (1<=Out) states: 158,538,534 (8)
abstracting: (1<=Out) states: 158,538,534 (8)
......................................................................................................
FORMULA SwimmingPool-PT-04-CTLCardinality-7 CANNOT_COMPUTE
MC time: 1m28.366sec
checking: AG [EF [[Entered<=Entered & 3<=Undress]]]
normalized: ~ [E [true U ~ [E [true U [Entered<=Entered & 3<=Undress]]]]]
before gc: list nodes free: 149
after gc: idd nodes used:325745, unused:63674255; list nodes free:681652285
abstracting: (3<=Undress) states: 118,857,502 (8)
abstracting: (Entered<=Entered) states: 164,385,221 (8)
-> the formula is TRUE
FORMULA SwimmingPool-PT-04-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m34.628sec
checking: AG [EF [[Undress<=Undress & 3<=Dress]]]
normalized: ~ [E [true U ~ [E [true U [Undress<=Undress & 3<=Dress]]]]]
abstracting: (3<=Dress) states: 118,857,502 (8)
abstracting: (Undress<=Undress) states: 164,385,221 (8)
-> the formula is TRUE
FORMULA SwimmingPool-PT-04-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m23.629sec
checking: ~ [~ [AG [[Cabins<=Dressed | 1<=Bags]]]]
normalized: ~ [E [true U ~ [[Cabins<=Dressed | 1<=Bags]]]]
abstracting: (1<=Bags) states: 163,485,553 (8)
abstracting: (Cabins<=Dressed) states: 72,173,486 (7)
-> the formula is FALSE
FORMULA SwimmingPool-PT-04-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 2m 1.021sec
checking: AG [~ [[Cabins<=InBath & Dressed<=Dressed]]]
normalized: ~ [E [true U [Cabins<=InBath & Dressed<=Dressed]]]
abstracting: (Dressed<=Dressed) states: 164,385,221 (8)
abstracting: (Cabins<=InBath) states: 111,713,833 (8)
-> the formula is FALSE
FORMULA SwimmingPool-PT-04-CTLCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m54.614sec
checking: [~ [AG [Cabins<=Entered]] & AX [AG [Entered<=Entered]]]
normalized: [~ [EX [E [true U ~ [Entered<=Entered]]]] & E [true U ~ [Cabins<=Entered]]]
abstracting: (Cabins<=Entered) states: 115,542,735 (8)
abstracting: (Entered<=Entered) states: 164,385,221 (8)
.-> the formula is TRUE
FORMULA SwimmingPool-PT-04-CTLCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 1m 6.438sec
checking: AG [AG [[Dress<=Cabins | InBath<=Dress]]]
normalized: ~ [E [true U E [true U ~ [[Dress<=Cabins | InBath<=Dress]]]]]
abstracting: (InBath<=Dress) states: 49,992,448 (7)
abstracting: (Dress<=Cabins) states: 100,425,193 (8)
BK_STOP 1465216798820
--------------------
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.001sec
iterations count:22 (3), effective:3 (0)
iterations count:13 (1), effective:1 (0)
iterations count:30 (4), effective:7 (1)
iterations count:11 (1), effective:1 (0)
iterations count:22 (3), effective:4 (0)
std::bad_alloc
iterations count:35 (5), effective:8 (1)
iterations count:30 (4), effective:7 (1)
iterations count:64 (9), effective:16 (2)
iterations count:20 (2), effective:2 (0)
iterations count:43 (6), effective:10 (1)
iterations count:63 (9), effective:16 (2)
iterations count:7 (1), effective:0 (0)
/home/mcc/BenchKit/BenchKit_head.sh: line 13: 290 Killed ${TIMEOUT} marcie --net-file=model.pnml --mcc-file=${BK_EXAMINATION}.xml ${MARCIE_CONFIG}
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="S_SwimmingPool-PT-04"
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/S_SwimmingPool-PT-04.tgz
mv S_SwimmingPool-PT-04 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 S_SwimmingPool-PT-04, 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 r197kn-qhx2-146444263800597"
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 '
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 ;