About the Execution of MARCIE for RwMutex-PT-r0010w0010
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
1692.670 | 2067.00 | 2019.00 | 20.20 | TTTTTTTTTTFTFFTT | 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-3254
Executing tool marcie
Input is RwMutex-PT-r0010w0010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r061-csrt-149440955200138
=====================================================================
--------------------
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-r0010w0010-CTLCardinality-0
FORMULA_NAME RwMutex-PT-r0010w0010-CTLCardinality-1
FORMULA_NAME RwMutex-PT-r0010w0010-CTLCardinality-10
FORMULA_NAME RwMutex-PT-r0010w0010-CTLCardinality-11
FORMULA_NAME RwMutex-PT-r0010w0010-CTLCardinality-12
FORMULA_NAME RwMutex-PT-r0010w0010-CTLCardinality-13
FORMULA_NAME RwMutex-PT-r0010w0010-CTLCardinality-14
FORMULA_NAME RwMutex-PT-r0010w0010-CTLCardinality-15
FORMULA_NAME RwMutex-PT-r0010w0010-CTLCardinality-2
FORMULA_NAME RwMutex-PT-r0010w0010-CTLCardinality-3
FORMULA_NAME RwMutex-PT-r0010w0010-CTLCardinality-4
FORMULA_NAME RwMutex-PT-r0010w0010-CTLCardinality-5
FORMULA_NAME RwMutex-PT-r0010w0010-CTLCardinality-6
FORMULA_NAME RwMutex-PT-r0010w0010-CTLCardinality-7
FORMULA_NAME RwMutex-PT-r0010w0010-CTLCardinality-8
FORMULA_NAME RwMutex-PT-r0010w0010-CTLCardinality-9
=== Now, execution of the tool begins
BK_START 1494705897000
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie rev. 8852M (built: crohr on 2017-05-03)
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
parse successfull
net created successfully
Net: RwMutex_PT_r0010w0010
(NrP: 50 NrTr: 40 NrArc: 300)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 1.366sec
RS generation: 0m 0.001sec
-> reachability set: #nodes 105 (1.0e+02) #states 1,034 (3)
starting MCC model checker
--------------------------
checking: AG [~ [~ [~ [3<=p46]]]]
normalized: ~ [E [true U 3<=p46]]
abstracting: (3<=p46)
states: 0
-> the formula is TRUE
FORMULA RwMutex-PT-r0010w0010-CTLCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: ~ [EX [EF [3<=p6]]]
normalized: ~ [EX [E [true U 3<=p6]]]
abstracting: (3<=p6)
states: 0
.-> the formula is TRUE
FORMULA RwMutex-PT-r0010w0010-CTLCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: ~ [~ [AG [p7<=p7]]]
normalized: ~ [E [true U ~ [p7<=p7]]]
abstracting: (p7<=p7)
states: 1,034 (3)
-> the formula is TRUE
FORMULA RwMutex-PT-r0010w0010-CTLCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: [AG [AG [p46<=p11]] & 1<=p35]
normalized: [~ [E [true U E [true U ~ [p46<=p11]]]] & 1<=p35]
abstracting: (1<=p35)
states: 512
abstracting: (p46<=p11)
states: 1,034 (3)
-> the formula is TRUE
FORMULA RwMutex-PT-r0010w0010-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [[p35<=p21 & EF [p6<=p8]]]
normalized: ~ [E [true U ~ [[p35<=p21 & E [true U p6<=p8]]]]]
abstracting: (p6<=p8)
states: 778
abstracting: (p35<=p21)
states: 1,034 (3)
-> the formula is TRUE
FORMULA RwMutex-PT-r0010w0010-CTLCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AG [[~ [[2<=p20 & 2<=p7]] | AG [p2<=p36]]]
normalized: ~ [E [true U ~ [[~ [E [true U ~ [p2<=p36]]] | ~ [[2<=p20 & 2<=p7]]]]]]
abstracting: (2<=p7)
states: 0
abstracting: (2<=p20)
states: 0
abstracting: (p2<=p36)
states: 768
-> the formula is TRUE
FORMULA RwMutex-PT-r0010w0010-CTLCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: [~ [EX [[2<=p8 & 1<=p46]]] & AG [AF [p17<=p15]]]
normalized: [~ [E [true U EG [~ [p17<=p15]]]] & ~ [EX [[2<=p8 & 1<=p46]]]]
abstracting: (1<=p46)
states: 1
abstracting: (2<=p8)
states: 0
.abstracting: (p17<=p15)
states: 1,033 (3)
..
EG iterations: 2
-> the formula is TRUE
FORMULA RwMutex-PT-r0010w0010-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AG [[EX [1<=p7] | ~ [[p2<=p27 | p39<=p39]]]]
normalized: ~ [E [true U ~ [[~ [[p2<=p27 | p39<=p39]] | EX [1<=p7]]]]]
abstracting: (1<=p7)
states: 522
.abstracting: (p39<=p39)
states: 1,034 (3)
abstracting: (p2<=p27)
states: 768
-> the formula is TRUE
FORMULA RwMutex-PT-r0010w0010-CTLCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: ~ [EF [[[2<=p30 & p17<=p18] | [2<=p7 & 2<=p38]]]]
normalized: ~ [E [true U [[2<=p7 & 2<=p38] | [2<=p30 & p17<=p18]]]]
abstracting: (p17<=p18)
states: 1,033 (3)
abstracting: (2<=p30)
states: 0
abstracting: (2<=p38)
states: 0
abstracting: (2<=p7)
states: 0
-> the formula is TRUE
FORMULA RwMutex-PT-r0010w0010-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: ~ [[EX [[p6<=p49 & p4<=p23]] | EF [3<=p21]]]
normalized: ~ [[E [true U 3<=p21] | EX [[p6<=p49 & p4<=p23]]]]
abstracting: (p4<=p23)
states: 768
abstracting: (p6<=p49)
states: 513
.abstracting: (3<=p21)
states: 0
-> the formula is TRUE
FORMULA RwMutex-PT-r0010w0010-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [~ [[[3<=p42 | p37<=p4] | [p46<=p3 | p11<=p26]]]]
normalized: E [true U ~ [[[p46<=p3 | p11<=p26] | [3<=p42 | p37<=p4]]]]
abstracting: (p37<=p4)
states: 778
abstracting: (3<=p42)
states: 0
abstracting: (p11<=p26)
states: 768
abstracting: (p46<=p3)
states: 1,034 (3)
-> the formula is FALSE
FORMULA RwMutex-PT-r0010w0010-CTLCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [~ [[[p50<=p41 | p22<=p38] & [p22<=p33 & 2<=p47]]]]
normalized: ~ [E [true U [[p22<=p33 & 2<=p47] & [p50<=p41 | p22<=p38]]]]
abstracting: (p22<=p38)
states: 778
abstracting: (p50<=p41)
states: 1,033 (3)
abstracting: (2<=p47)
states: 0
abstracting: (p22<=p33)
states: 778
-> the formula is TRUE
FORMULA RwMutex-PT-r0010w0010-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: [AG [EX [p4<=p9]] | [AX [~ [1<=p22]] & [EX [3<=p11] | [[1<=p30 & 2<=p23] & p17<=p26]]]]
normalized: [[[[[1<=p30 & 2<=p23] & p17<=p26] | EX [3<=p11]] & ~ [EX [1<=p22]]] | ~ [E [true U ~ [EX [p4<=p9]]]]]
abstracting: (p4<=p9)
states: 778
.abstracting: (1<=p22)
states: 512
.abstracting: (3<=p11)
states: 0
.abstracting: (p17<=p26)
states: 513
abstracting: (2<=p23)
states: 0
abstracting: (1<=p30)
states: 512
-> the formula is TRUE
FORMULA RwMutex-PT-r0010w0010-CTLCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: [EX [[3<=p1 | [p42<=p45 | 1<=p14]]] & [[AX [p25<=p40] & AG [1<=p47]] | AG [[3<=p48 | p44<=p5]]]]
normalized: [[~ [E [true U ~ [[3<=p48 | p44<=p5]]]] | [~ [E [true U ~ [1<=p47]]] & ~ [EX [~ [p25<=p40]]]]] & EX [[[p42<=p45 | 1<=p14] | 3<=p1]]]
abstracting: (3<=p1)
states: 0
abstracting: (1<=p14)
states: 1,033 (3)
abstracting: (p42<=p45)
states: 1,033 (3)
.abstracting: (p25<=p40)
states: 778
.abstracting: (1<=p47)
states: 1
abstracting: (p44<=p5)
states: 1,034 (3)
abstracting: (3<=p48)
states: 0
-> the formula is TRUE
FORMULA RwMutex-PT-r0010w0010-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: [[EF [[3<=p3 | 2<=p49]] & [EX [p2<=p36] & [[1<=p9 | p20<=p50] | [p28<=p25 | p7<=p34]]]] & EG [[p44<=p4 | p11<=p17]]]
normalized: [[[EX [p2<=p36] & [[1<=p9 | p20<=p50] | [p28<=p25 | p7<=p34]]] & E [true U [3<=p3 | 2<=p49]]] & EG [[p44<=p4 | p11<=p17]]]
abstracting: (p11<=p17)
states: 1,033 (3)
abstracting: (p44<=p4)
states: 1,034 (3)
EG iterations: 0
abstracting: (2<=p49)
states: 0
abstracting: (3<=p3)
states: 0
abstracting: (p7<=p34)
states: 768
abstracting: (p28<=p25)
states: 778
abstracting: (p20<=p50)
states: 1
abstracting: (1<=p9)
states: 522
abstracting: (p2<=p36)
states: 768
.-> the formula is FALSE
FORMULA RwMutex-PT-r0010w0010-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: [EF [AX [3<=p20]] | [[[~ [p36<=p21] | [1<=p47 & 1<=p17]] | AF [2<=p23]] | [[[p36<=p32 | 2<=p42] & [p7<=p39 & p11<=p12]] & ~ [[2<=p48 | p7<=p11]]]]]
normalized: [[[~ [[2<=p48 | p7<=p11]] & [[p36<=p32 | 2<=p42] & [p7<=p39 & p11<=p12]]] | [[[1<=p47 & 1<=p17] | ~ [p36<=p21]] | ~ [EG [~ [2<=p23]]]]] | E [true U ~ [EX [~ [3<=p20]]]]]
abstracting: (3<=p20)
states: 0
.abstracting: (2<=p23)
states: 0
EG iterations: 0
abstracting: (p36<=p21)
states: 1,034 (3)
abstracting: (1<=p17)
states: 1,033 (3)
abstracting: (1<=p47)
states: 1
abstracting: (p11<=p12)
states: 1,033 (3)
abstracting: (p7<=p39)
states: 768
abstracting: (2<=p42)
states: 0
abstracting: (p36<=p32)
states: 778
abstracting: (p7<=p11)
states: 778
abstracting: (2<=p48)
states: 0
-> the formula is FALSE
FORMULA RwMutex-PT-r0010w0010-CTLCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
totally nodes used: 12591(1.3e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 2035 9721 11756
used/not used/entry size/cache size: 8583 67100281 16 1024MB
basic ops cache: hits/miss/sum: 5044 17134 22178
used/not used/entry size/cache size: 34383 16742833 12 192MB
unary ops cache: hits/miss/sum: 0 435 435
used/not used/entry size/cache size: 435 8388173 8 64MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 12 96MB
state nr cache: hits/miss/sum: 291 700 991
used/not used/entry size/cache size: 700 2096452 32 64MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 67096274
1 12589
2 1
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 2.038sec
BK_STOP 1494705899067
--------------------
content from stderr:
check for maximal unmarked siphon
ok
check for constant places
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
.........................
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-r0010w0010"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/tmp/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-r0010w0010.tgz
mv RwMutex-PT-r0010w0010 execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool marcie"
echo " Input is RwMutex-PT-r0010w0010, 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 r061-csrt-149440955200138"
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 ;