About the Execution of Marcie for RwMutex-PT-r0010w0050
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
3962.050 | 18382.00 | 18440.00 | 20.20 | FTFFFFFTFFFFTFTT | 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 RwMutex-PT-r0010w0050, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r092kn-qhx2-143267650200041
=====================================================================
--------------------
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 RwMutex-PT-r0010w0050-CTLCardinality-0
FORMULA_NAME RwMutex-PT-r0010w0050-CTLCardinality-1
FORMULA_NAME RwMutex-PT-r0010w0050-CTLCardinality-10
FORMULA_NAME RwMutex-PT-r0010w0050-CTLCardinality-11
FORMULA_NAME RwMutex-PT-r0010w0050-CTLCardinality-12
FORMULA_NAME RwMutex-PT-r0010w0050-CTLCardinality-13
FORMULA_NAME RwMutex-PT-r0010w0050-CTLCardinality-14
FORMULA_NAME RwMutex-PT-r0010w0050-CTLCardinality-15
FORMULA_NAME RwMutex-PT-r0010w0050-CTLCardinality-2
FORMULA_NAME RwMutex-PT-r0010w0050-CTLCardinality-3
FORMULA_NAME RwMutex-PT-r0010w0050-CTLCardinality-4
FORMULA_NAME RwMutex-PT-r0010w0050-CTLCardinality-5
FORMULA_NAME RwMutex-PT-r0010w0050-CTLCardinality-6
FORMULA_NAME RwMutex-PT-r0010w0050-CTLCardinality-7
FORMULA_NAME RwMutex-PT-r0010w0050-CTLCardinality-8
FORMULA_NAME RwMutex-PT-r0010w0050-CTLCardinality-9
=== Now, execution of the tool begins
BK_START 1432977982168
Model: RwMutex-PT-r0010w0050
reachability algorithm:
Transition chaining algorithm
variable ordering algorithm:
Calculated like in [Noa99]
--memory=6 --suppress --rs-algorithm=2 --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=2 --place-order=5
parse successfull
net created successfully
(NrP: 130 NrTr: 120 NrArc: 1260)
net check time: 0m0sec
parse formulas successfull
formulas created successfully
place and transition orderings generation:0m0sec
init dd package: 0m13sec
RS generation: 0m0sec
-> reachability set: #nodes 24291 (2.4e+04) #states 1,074 (3)
starting MCC model checker
--------------------------
checking: [~ [AX [[1<=p7 | 2<=p111]]] & ~ [AG [~ [2<=p111]]]]
normalized: [EX [~ [[1<=p7 | 2<=p111]]] & E [true U 2<=p111]]
abstracting: (2<=p111) states: 0
abstracting: (2<=p111) states: 0
abstracting: (1<=p7) states: 562
.-> the formula is FALSE
FORMULA RwMutex-PT-r0010w0050-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AG [AF [p58<=p52]]
normalized: ~ [E [true U EG [~ [p58<=p52]]]]
abstracting: (p58<=p52) states: 1,073 (3)
..
EG iterations: 2
-> the formula is TRUE
FORMULA RwMutex-PT-r0010w0050-CTLCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: [3<=p93 | AG [EF [2<=p123]]]
normalized: [3<=p93 | ~ [E [true U ~ [E [true U 2<=p123]]]]]
abstracting: (2<=p123) states: 0
abstracting: (3<=p93) states: 0
-> the formula is FALSE
FORMULA RwMutex-PT-r0010w0050-CTLCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: EF [EF [2<=p62]]
normalized: E [true U E [true U 2<=p62]]
abstracting: (2<=p62) states: 0
-> the formula is FALSE
FORMULA RwMutex-PT-r0010w0050-CTLCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: A [AG [1<=p31] U EF [2<=p106]]
normalized: [~ [EG [~ [E [true U 2<=p106]]]] & ~ [E [E [true U ~ [1<=p31]] U [~ [E [true U 2<=p106]] & E [true U ~ [1<=p31]]]]]]
abstracting: (1<=p31) states: 1,073 (3)
abstracting: (2<=p106) states: 0
abstracting: (1<=p31) states: 1,073 (3)
abstracting: (2<=p106) states: 0
EG iterations: 0
-> the formula is FALSE
FORMULA RwMutex-PT-r0010w0050-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AG [[p48<=p60 | EF [2<=p61]]]
normalized: ~ [E [true U ~ [[p48<=p60 | E [true U 2<=p61]]]]]
abstracting: (2<=p61) states: 0
abstracting: (p48<=p60) states: 1,073 (3)
-> the formula is FALSE
FORMULA RwMutex-PT-r0010w0050-CTLCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: [AG [[~ [p15<=p118] | p33<=p57]] | EF [[[2<=p37 & p75<=p78] | [2<=p24 | 3<=p48]]]]
normalized: [E [true U [[2<=p24 | 3<=p48] | [2<=p37 & p75<=p78]]] | ~ [E [true U ~ [[p33<=p57 | ~ [p15<=p118]]]]]]
abstracting: (p15<=p118) states: 2
abstracting: (p33<=p57) states: 1,073 (3)
abstracting: (p75<=p78) states: 818
abstracting: (2<=p37) states: 0
abstracting: (3<=p48) states: 0
abstracting: (2<=p24) states: 0
-> the formula is TRUE
FORMULA RwMutex-PT-r0010w0050-CTLCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: EF [[EG [p40<=p50] & 3<=p95]]
normalized: E [true U [3<=p95 & EG [p40<=p50]]]
abstracting: (p40<=p50) states: 1,073 (3)
.
EG iterations: 1
abstracting: (3<=p95) states: 0
-> the formula is FALSE
FORMULA RwMutex-PT-r0010w0050-CTLCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AG [EF [~ [p63<=p83]]]
normalized: ~ [E [true U ~ [E [true U ~ [p63<=p83]]]]]
abstracting: (p63<=p83) states: 562
-> the formula is TRUE
FORMULA RwMutex-PT-r0010w0050-CTLCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AG [~ [EX [3<=p44]]]
normalized: ~ [E [true U EX [3<=p44]]]
abstracting: (3<=p44) states: 0
.-> the formula is TRUE
FORMULA RwMutex-PT-r0010w0050-CTLCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: EG [EF [[2<=p73 & 3<=p89]]]
normalized: EG [E [true U [2<=p73 & 3<=p89]]]
abstracting: (3<=p89) states: 0
abstracting: (2<=p73) states: 0
.
EG iterations: 1
-> the formula is FALSE
FORMULA RwMutex-PT-r0010w0050-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: EF [A [p32<=p94 U 2<=p58]]
normalized: E [true U [~ [EG [~ [2<=p58]]] & ~ [E [~ [p32<=p94] U [~ [2<=p58] & ~ [p32<=p94]]]]]]
abstracting: (p32<=p94) states: 2
abstracting: (2<=p58) states: 0
abstracting: (p32<=p94) states: 2
abstracting: (2<=p58) states: 0
EG iterations: 0
-> the formula is FALSE
FORMULA RwMutex-PT-r0010w0050-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: E [[~ [p116<=p63] | [p84<=p72 | p36<=p59]] U ~ [[p104<=p45 | 1<=p102]]]
normalized: E [[~ [p116<=p63] | [p84<=p72 | p36<=p59]] U ~ [[p104<=p45 | 1<=p102]]]
abstracting: (1<=p102) states: 1
abstracting: (p104<=p45) states: 1,074 (3)
abstracting: (p36<=p59) states: 1,073 (3)
abstracting: (p84<=p72) states: 1,073 (3)
abstracting: (p116<=p63) states: 1,073 (3)
-> the formula is FALSE
FORMULA RwMutex-PT-r0010w0050-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: E [[[p108<=p95 | p129<=p28] | [1<=p85 & 1<=p76]] U AG [p33<=p90]]
normalized: E [[[p108<=p95 | p129<=p28] | [1<=p85 & 1<=p76]] U ~ [E [true U ~ [p33<=p90]]]]
abstracting: (p33<=p90) states: 2
abstracting: (1<=p76) states: 512
abstracting: (1<=p85) states: 1
abstracting: (p129<=p28) states: 1,074 (3)
abstracting: (p108<=p95) states: 1,073 (3)
-> the formula is FALSE
FORMULA RwMutex-PT-r0010w0050-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: E [[~ [1<=p30] | ~ [p117<=p101]] U EF [3<=p7]]
normalized: E [[~ [p117<=p101] | ~ [1<=p30]] U E [true U 3<=p7]]
abstracting: (3<=p7) states: 0
abstracting: (1<=p30) states: 1,073 (3)
abstracting: (p117<=p101) states: 1,073 (3)
-> the formula is FALSE
FORMULA RwMutex-PT-r0010w0050-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: [[[[~ [3<=p72] & ~ [3<=p122]] & [~ [3<=p108] | [2<=p22 | p13<=p54]]] | [EX [p35<=p103] | 3<=p89]] & AG [[~ [p103<=p1] | p107<=p28]]]
normalized: [~ [E [true U ~ [[p107<=p28 | ~ [p103<=p1]]]]] & [[3<=p89 | EX [p35<=p103]] | [[[2<=p22 | p13<=p54] | ~ [3<=p108]] & [~ [3<=p122] & ~ [3<=p72]]]]]
abstracting: (3<=p72) states: 0
abstracting: (3<=p122) states: 0
abstracting: (3<=p108) states: 0
abstracting: (p13<=p54) states: 1,073 (3)
abstracting: (2<=p22) states: 0
abstracting: (p35<=p103) states: 2
.abstracting: (3<=p89) states: 0
abstracting: (p103<=p1) states: 1,073 (3)
abstracting: (p107<=p28) states: 1,074 (3)
-> the formula is TRUE
FORMULA RwMutex-PT-r0010w0050-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
Total processing time: 0m18sec
BK_STOP 1432978000550
--------------------
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:120 (1), effective:0 (0)
24207 24246 24276
iterations count:3660 (30), effective:60 (0)
24207 24246 24276
iterations count:3660 (30), effective:60 (0)
iterations count:120 (1), effective:0 (0)
24227 24246 24276
iterations count:3662 (30), effective:60 (0)
24210 24246 24276
iterations count:3645 (30), effective:51 (0)
iterations count:120 (1), effective:0 (0)
iterations count:252 (2), effective:2 (0)
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="RwMutex-PT-r0010w0050"
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/RwMutex-PT-r0010w0050.tgz
mv RwMutex-PT-r0010w0050 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 RwMutex-PT-r0010w0050, 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 r092kn-qhx2-143267650200041"
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 '
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 ;