About the Execution of Marcie for SwimmingPool-PT-05
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
8556.630 | 3600000.00 | 3600029.00 | 20.40 | TT??????FFTFT??? | 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-05, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r288su-ebro-143385262200126
=====================================================================
--------------------
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-ReachabilityCardinality-0
FORMULA_NAME SwimmingPool-PT-05-ReachabilityCardinality-1
FORMULA_NAME SwimmingPool-PT-05-ReachabilityCardinality-10
FORMULA_NAME SwimmingPool-PT-05-ReachabilityCardinality-11
FORMULA_NAME SwimmingPool-PT-05-ReachabilityCardinality-12
FORMULA_NAME SwimmingPool-PT-05-ReachabilityCardinality-13
FORMULA_NAME SwimmingPool-PT-05-ReachabilityCardinality-14
FORMULA_NAME SwimmingPool-PT-05-ReachabilityCardinality-15
FORMULA_NAME SwimmingPool-PT-05-ReachabilityCardinality-2
FORMULA_NAME SwimmingPool-PT-05-ReachabilityCardinality-3
FORMULA_NAME SwimmingPool-PT-05-ReachabilityCardinality-4
FORMULA_NAME SwimmingPool-PT-05-ReachabilityCardinality-5
FORMULA_NAME SwimmingPool-PT-05-ReachabilityCardinality-6
FORMULA_NAME SwimmingPool-PT-05-ReachabilityCardinality-7
FORMULA_NAME SwimmingPool-PT-05-ReachabilityCardinality-8
FORMULA_NAME SwimmingPool-PT-05-ReachabilityCardinality-9
=== Now, execution of the tool begins
BK_START 1433940989712
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=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: 0m36sec
-> reachability set: #nodes 88309 (8.8e+04) #states 591,371,001 (8)
starting MCC model checker
--------------------------
checking: EF [~ [[[1<=Out | Dress<=Out] | [InBath<=Dress | Undress<=InBath]]]]
normalized: E [true U ~ [[[InBath<=Dress | Undress<=InBath] | [1<=Out | Dress<=Out]]]]
abstracting: (Dress<=Out) states: 443,707,056 (8)
abstracting: (1<=Out) states: 574,410,330 (8)
abstracting: (Undress<=InBath) states: 430,362,179 (8)
abstracting: (InBath<=Dress) states: 177,088,847 (8)
-> the formula is TRUE
FORMULA SwimmingPool-PT-05-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 9m28sec
checking: EF [Bags<=Cabins]
normalized: E [true U Bags<=Cabins]
abstracting: (Bags<=Cabins) states: 63,480,768 (7)
-> the formula is TRUE
FORMULA SwimmingPool-PT-05-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m28sec
checking: EF [[~ [Entered<=Entered] & [Undress<=Bags & [2<=Dress & 2<=Undress]]]]
normalized: E [true U [[Undress<=Bags & [2<=Dress & 2<=Undress]] & ~ [Entered<=Entered]]]
abstracting: (Entered<=Entered) states: 591,371,001 (8)
abstracting: (2<=Undress) states: 497,905,135 (8)
abstracting: (2<=Dress) states: 497,905,135 (8)
abstracting: (Undress<=Bags) states: 534,256,099 (8)
-> the formula is FALSE
FORMULA SwimmingPool-PT-05-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 2m50sec
checking: AG [~ [~ [[Dress<=Bags | Entered<=Out]]]]
normalized: ~ [E [true U ~ [[Dress<=Bags | Entered<=Out]]]]
abstracting: (Entered<=Out) states: 299,939,757 (8)
abstracting: (Dress<=Bags) states: 534,256,099 (8)
-> the formula is FALSE
FORMULA SwimmingPool-PT-05-ReachabilityCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 9m12sec
checking: EF [[~ [[2<=Undress | 2<=Entered]] & [~ [Bags<=Entered] & Cabins<=InBath]]]
normalized: E [true U [[Cabins<=InBath & ~ [Bags<=Entered]] & ~ [[2<=Undress | 2<=Entered]]]]
abstracting: (2<=Entered) states: 557,555,310 (8)
abstracting: (2<=Undress) states: 497,905,135 (8)
abstracting: (Bags<=Entered) states: 126,981,036 (8)
abstracting: (Cabins<=InBath) states: 401,093,316 (8)
-> the formula is TRUE
FORMULA SwimmingPool-PT-05-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 3m39sec
checking: AG [~ [[1<=Out & [3<=Bags & Bags<=Cabins]]]]
normalized: ~ [E [true U [1<=Out & [3<=Bags & Bags<=Cabins]]]]
abstracting: (Bags<=Cabins) states: 63,480,768 (7)
abstracting: (3<=Bags) states: 583,026,000 (8)
abstracting: (1<=Out) states: 574,410,330 (8)
-> the formula is FALSE
FORMULA SwimmingPool-PT-05-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m33sec
checking: EF [~ [[[Bags<=Out & Cabins<=Out] | [InBath<=Cabins & Cabins<=Bags]]]]
normalized: E [true U ~ [[[Bags<=Out & Cabins<=Out] | [InBath<=Cabins & Cabins<=Bags]]]]
abstracting: (Cabins<=Bags) states: 533,324,077 (8)
abstracting: (InBath<=Cabins) states: 206,406,486 (8)
abstracting: (Cabins<=Out) states: 414,717,381 (8)
abstracting: (Bags<=Out) states: 126,981,036 (8)
-> the formula is TRUE
FORMULA SwimmingPool-PT-05-ReachabilityCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 18m41sec
checking: AG [[~ [Dress<=Out] | [Cabins<=Bags & [2<=Bags | 1<=Dressed]]]]
normalized: ~ [E [true U ~ [[[Cabins<=Bags & [2<=Bags | 1<=Dressed]] | ~ [Dress<=Out]]]]]
abstracting: (Dress<=Out) states: 443,707,056 (8)
abstracting: (1<=Dressed) states: 545,275,770 (8)
abstracting: (2<=Bags) states: 586,041,768 (8)
abstracting: (Cabins<=Bags) states: 533,324,077 (8)
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:371 (53), effective:154 (22)
iterations count:29 (4), effective:7 (1)
iterations count:36 (5), effective:11 (1)
iterations count:42 (6), effective:10 (1)
iterations count:36 (5), effective:10 (1)
iterations count:44 (6), effective:12 (1)
iterations count:35 (5), effective:9 (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-05"
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-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 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-143385262200126"
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 ;