About the Execution of Marcie for SwimmingPool-PT-01
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
3971.610 | 14272.00 | 9476.00 | 4554.00 | FFFTTFFFTTFTFFTT | 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-2265
Executing tool marcie
Input is SwimmingPool-PT-01, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r288su-ebro-143385262200074
=====================================================================
--------------------
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-01-ReachabilityCardinality-0
FORMULA_NAME SwimmingPool-PT-01-ReachabilityCardinality-1
FORMULA_NAME SwimmingPool-PT-01-ReachabilityCardinality-10
FORMULA_NAME SwimmingPool-PT-01-ReachabilityCardinality-11
FORMULA_NAME SwimmingPool-PT-01-ReachabilityCardinality-12
FORMULA_NAME SwimmingPool-PT-01-ReachabilityCardinality-13
FORMULA_NAME SwimmingPool-PT-01-ReachabilityCardinality-14
FORMULA_NAME SwimmingPool-PT-01-ReachabilityCardinality-15
FORMULA_NAME SwimmingPool-PT-01-ReachabilityCardinality-2
FORMULA_NAME SwimmingPool-PT-01-ReachabilityCardinality-3
FORMULA_NAME SwimmingPool-PT-01-ReachabilityCardinality-4
FORMULA_NAME SwimmingPool-PT-01-ReachabilityCardinality-5
FORMULA_NAME SwimmingPool-PT-01-ReachabilityCardinality-6
FORMULA_NAME SwimmingPool-PT-01-ReachabilityCardinality-7
FORMULA_NAME SwimmingPool-PT-01-ReachabilityCardinality-8
FORMULA_NAME SwimmingPool-PT-01-ReachabilityCardinality-9
=== Now, execution of the tool begins
BK_START 1433940867479
Model: SwimmingPool-PT-01
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=ReachabilityCardinality.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 1419 (1.4e+03) #states 89,621 (4)
starting MCC model checker
--------------------------
checking: AG [[~ [[1<=WaitBag | Cabins<=Bags]] | ~ [[2<=InBath & Bags<=InBath]]]]
normalized: ~ [E [true U ~ [[~ [[2<=InBath & Bags<=InBath]] | ~ [[1<=WaitBag | Cabins<=Bags]]]]]]
abstracting: (Cabins<=Bags) states: 80,471 (4)
abstracting: (1<=WaitBag) states: 62,824 (4)
abstracting: (Bags<=InBath) states: 28,210 (4)
abstracting: (2<=InBath) states: 64,596 (4)
-> the formula is FALSE
FORMULA SwimmingPool-PT-01-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AG [[~ [Bags<=InBath] | 2<=Out]]
normalized: ~ [E [true U ~ [[2<=Out | ~ [Bags<=InBath]]]]]
abstracting: (Bags<=InBath) states: 28,210 (4)
abstracting: (2<=Out) states: 67,207 (4)
-> the formula is FALSE
FORMULA SwimmingPool-PT-01-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AG [[[Bags<=Out | ~ [3<=InBath]] | [[1<=Bags | Dressed<=WaitBag] & [1<=Undress | 1<=Bags]]]]
normalized: ~ [E [true U ~ [[[Bags<=Out | ~ [3<=InBath]] | [[1<=Bags | Dressed<=WaitBag] & [1<=Undress | 1<=Bags]]]]]]
abstracting: (1<=Bags) states: 87,297 (4)
abstracting: (1<=Undress) states: 61,536 (4)
abstracting: (Dressed<=WaitBag) states: 52,395 (4)
abstracting: (1<=Bags) states: 87,297 (4)
abstracting: (3<=InBath) states: 53,585 (4)
abstracting: (Bags<=Out) states: 24,808 (4)
-> the formula is TRUE
FORMULA SwimmingPool-PT-01-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AG [Dress<=Dress]
normalized: ~ [E [true U ~ [Dress<=Dress]]]
abstracting: (Dress<=Dress) states: 89,621 (4)
-> the formula is TRUE
FORMULA SwimmingPool-PT-01-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: EF [~ [Undress<=Undress]]
normalized: E [true U ~ [Undress<=Undress]]
abstracting: (Undress<=Undress) states: 89,621 (4)
-> the formula is FALSE
FORMULA SwimmingPool-PT-01-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: EF [[[[Dressed<=Undress & Cabins<=InBath] | ~ [1<=Out]] & 1<=WaitBag]]
normalized: E [true U [1<=WaitBag & [~ [1<=Out] | [Dressed<=Undress & Cabins<=InBath]]]]
abstracting: (Cabins<=InBath) states: 62,594 (4)
abstracting: (Dressed<=Undress) states: 51,751 (4)
abstracting: (1<=Out) states: 78,211 (4)
abstracting: (1<=WaitBag) states: 62,824 (4)
-> the formula is TRUE
FORMULA SwimmingPool-PT-01-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AG [3<=Bags]
normalized: ~ [E [true U ~ [3<=Bags]]]
abstracting: (3<=Bags) states: 80,091 (4)
-> the formula is FALSE
FORMULA SwimmingPool-PT-01-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AG [[[[WaitBag<=Undress | Dress<=InBath] | Undress<=Cabins] | ~ [[2<=Cabins | Undress<=Out]]]]
normalized: ~ [E [true U ~ [[[Undress<=Cabins | [WaitBag<=Undress | Dress<=InBath]] | ~ [[2<=Cabins | Undress<=Out]]]]]]
abstracting: (Undress<=Out) states: 69,937 (4)
abstracting: (2<=Cabins) states: 54,831 (4)
abstracting: (Dress<=InBath) states: 67,675 (4)
abstracting: (WaitBag<=Undress) states: 51,751 (4)
abstracting: (Undress<=Cabins) states: 59,627 (4)
-> the formula is FALSE
FORMULA SwimmingPool-PT-01-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: EF [~ [[[2<=Entered | 3<=Dress] | [1<=Out | 1<=Entered]]]]
normalized: E [true U ~ [[[1<=Out | 1<=Entered] | [2<=Entered | 3<=Dress]]]]
abstracting: (3<=Dress) states: 26,078 (4)
abstracting: (2<=Entered) states: 67,207 (4)
abstracting: (1<=Entered) states: 78,211 (4)
abstracting: (1<=Out) states: 78,211 (4)
-> the formula is TRUE
FORMULA SwimmingPool-PT-01-ReachabilityCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AG [[Cabins<=Cabins | [[3<=Entered & Out<=Dressed] & ~ [Undress<=Dress]]]]
normalized: ~ [E [true U ~ [[Cabins<=Cabins | [[3<=Entered & Out<=Dressed] & ~ [Undress<=Dress]]]]]]
abstracting: (Undress<=Dress) states: 52,865 (4)
abstracting: (Out<=Dressed) states: 30,932 (4)
abstracting: (3<=Entered) states: 56,749 (4)
abstracting: (Cabins<=Cabins) states: 89,621 (4)
-> the formula is TRUE
FORMULA SwimmingPool-PT-01-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AG [~ [[~ [Undress<=Out] & 3<=Dress]]]
normalized: ~ [E [true U [3<=Dress & ~ [Undress<=Out]]]]
abstracting: (Undress<=Out) states: 69,937 (4)
abstracting: (3<=Dress) states: 26,078 (4)
-> the formula is FALSE
FORMULA SwimmingPool-PT-01-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: EF [~ [1<=Cabins]]
normalized: E [true U ~ [1<=Cabins]]
abstracting: (1<=Cabins) states: 71,403 (4)
-> the formula is TRUE
FORMULA SwimmingPool-PT-01-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: EF [[Undress<=Dress & [[Dressed<=InBath | Out<=Dress] & ~ [Dressed<=Bags]]]]
normalized: E [true U [Undress<=Dress & [[Dressed<=InBath | Out<=Dress] & ~ [Dressed<=Bags]]]]
abstracting: (Dressed<=Bags) states: 85,169 (4)
abstracting: (Out<=Dress) states: 30,093 (4)
abstracting: (Dressed<=InBath) states: 67,599 (4)
abstracting: (Undress<=Dress) states: 52,865 (4)
-> the formula is TRUE
FORMULA SwimmingPool-PT-01-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AG [[[~ [Out<=Undress] | ~ [Out<=WaitBag]] | ~ [~ [Dressed<=Entered]]]]
normalized: ~ [E [true U ~ [[Dressed<=Entered | [~ [Out<=WaitBag] | ~ [Out<=Undress]]]]]]
abstracting: (Out<=Undress) states: 30,093 (4)
abstracting: (Out<=WaitBag) states: 30,932 (4)
abstracting: (Dressed<=Entered) states: 68,579 (4)
-> the formula is FALSE
FORMULA SwimmingPool-PT-01-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AG [[~ [[2<=InBath & Out<=Entered]] | [WaitBag<=Cabins & [3<=Cabins | 2<=InBath]]]]
normalized: ~ [E [true U ~ [[[WaitBag<=Cabins & [3<=Cabins | 2<=InBath]] | ~ [[2<=InBath & Out<=Entered]]]]]]
abstracting: (Out<=Entered) states: 47,723 (4)
abstracting: (2<=InBath) states: 64,596 (4)
abstracting: (2<=InBath) states: 64,596 (4)
abstracting: (3<=Cabins) states: 40,334 (4)
abstracting: (WaitBag<=Cabins) states: 58,513 (4)
-> the formula is FALSE
FORMULA SwimmingPool-PT-01-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AG [[[[Dress<=Dressed | 2<=Bags] | ~ [1<=Out]] | [[2<=Bags & Dressed<=InBath] | [3<=Cabins & 3<=Undress]]]]
normalized: ~ [E [true U ~ [[[[3<=Cabins & 3<=Undress] | [2<=Bags & Dressed<=InBath]] | [~ [1<=Out] | [Dress<=Dressed | 2<=Bags]]]]]]
abstracting: (2<=Bags) states: 84,147 (4)
abstracting: (Dress<=Dressed) states: 53,725 (4)
abstracting: (1<=Out) states: 78,211 (4)
abstracting: (Dressed<=InBath) states: 67,599 (4)
abstracting: (2<=Bags) states: 84,147 (4)
abstracting: (3<=Undress) states: 26,078 (4)
abstracting: (3<=Cabins) states: 40,334 (4)
-> the formula is FALSE
FORMULA SwimmingPool-PT-01-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
Total processing time: 0m14sec
BK_STOP 1433940881751
--------------------
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:407 (58), effective:120 (17)
initing FirstDep: 0m0sec
iterations count:36 (5), effective:9 (1)
iterations count:28 (4), effective:7 (1)
iterations count:24 (3), effective:6 (0)
iterations count:40 (5), effective:10 (1)
iterations count:122 (17), effective:45 (6)
iterations count:40 (5), effective:10 (1)
iterations count:37 (5), effective:11 (1)
iterations count:16 (2), effective:3 (0)
iterations count:56 (8), effective:16 (2)
iterations count:48 (6), effective:13 (1)
iterations count:46 (6), effective:13 (1)
iterations count:58 (8), effective:17 (2)
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-01"
export BK_EXAMINATION="ReachabilityCardinality"
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-01.tgz
mv SwimmingPool-PT-01 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-01, examination is ReachabilityCardinality"
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-143385262200074"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "ReachabilityComputeBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 ;