About the Execution of MARCIE for DLCround-PT-04a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
2208.640 | 4526.00 | 4019.00 | 20.40 | TFFTTTFTTTTFFFTT | 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 DLCround-PT-04a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r171-csrt-149580951500219
=====================================================================
--------------------
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 DLCround-PT-04a-CTLCardinality-0
FORMULA_NAME DLCround-PT-04a-CTLCardinality-1
FORMULA_NAME DLCround-PT-04a-CTLCardinality-10
FORMULA_NAME DLCround-PT-04a-CTLCardinality-11
FORMULA_NAME DLCround-PT-04a-CTLCardinality-12
FORMULA_NAME DLCround-PT-04a-CTLCardinality-13
FORMULA_NAME DLCround-PT-04a-CTLCardinality-14
FORMULA_NAME DLCround-PT-04a-CTLCardinality-15
FORMULA_NAME DLCround-PT-04a-CTLCardinality-2
FORMULA_NAME DLCround-PT-04a-CTLCardinality-3
FORMULA_NAME DLCround-PT-04a-CTLCardinality-4
FORMULA_NAME DLCround-PT-04a-CTLCardinality-5
FORMULA_NAME DLCround-PT-04a-CTLCardinality-6
FORMULA_NAME DLCround-PT-04a-CTLCardinality-7
FORMULA_NAME DLCround-PT-04a-CTLCardinality-8
FORMULA_NAME DLCround-PT-04a-CTLCardinality-9
=== Now, execution of the tool begins
BK_START 1495823096680
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: DLCround_PT_04a
(NrP: 139 NrTr: 823 NrArc: 3074)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.010sec
net check time: 0m 0.000sec
init dd package: 0m 1.269sec
RS generation: 0m 0.379sec
-> reachability set: #nodes 8594 (8.6e+03) #states 240,100,001 (8)
starting MCC model checker
--------------------------
checking: ~ [EF [AG [1<=p78]]]
normalized: ~ [E [true U ~ [E [true U ~ [1<=p78]]]]]
abstracting: (1<=p78)
states: 24,010,000 (7)
-> the formula is TRUE
FORMULA DLCround-PT-04a-CTLCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.481sec
checking: AG [~ [~ [~ [3<=p95]]]]
normalized: ~ [E [true U 3<=p95]]
abstracting: (3<=p95)
states: 0
-> the formula is TRUE
FORMULA DLCround-PT-04a-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AF [EF [2<=p21]]
normalized: ~ [EG [~ [E [true U 2<=p21]]]]
abstracting: (2<=p21)
states: 0
EG iterations: 0
-> the formula is FALSE
FORMULA DLCround-PT-04a-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [EF [[1<=p113 & 2<=p8]]]
normalized: E [true U E [true U [1<=p113 & 2<=p8]]]
abstracting: (2<=p8)
states: 0
abstracting: (1<=p113)
states: 240,100,000 (8)
-> the formula is FALSE
FORMULA DLCround-PT-04a-CTLCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: ~ [EF [~ [p94<=p100]]]
normalized: ~ [E [true U ~ [p94<=p100]]]
abstracting: (p94<=p100)
states: 240,100,001 (8)
-> the formula is TRUE
FORMULA DLCround-PT-04a-CTLCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [A [3<=p82 U 2<=p52]]
normalized: E [true U [~ [E [~ [2<=p52] U [~ [2<=p52] & ~ [3<=p82]]]] & ~ [EG [~ [2<=p52]]]]]
abstracting: (2<=p52)
states: 0
EG iterations: 0
abstracting: (3<=p82)
states: 0
abstracting: (2<=p52)
states: 0
abstracting: (2<=p52)
states: 0
-> the formula is FALSE
FORMULA DLCround-PT-04a-CTLCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.026sec
checking: AF [AG [[p35<=p126 & 1<=p83]]]
normalized: ~ [EG [E [true U ~ [[p35<=p126 & 1<=p83]]]]]
abstracting: (1<=p83)
states: 240,100,000 (8)
abstracting: (p35<=p126)
states: 240,100,001 (8)
..
EG iterations: 2
-> the formula is TRUE
FORMULA DLCround-PT-04a-CTLCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.453sec
checking: EF [AF [[p53<=p44 & 3<=p5]]]
normalized: E [true U ~ [EG [~ [[p53<=p44 & 3<=p5]]]]]
abstracting: (3<=p5)
states: 0
abstracting: (p53<=p44)
states: 218,491,001 (8)
EG iterations: 0
-> the formula is FALSE
FORMULA DLCround-PT-04a-CTLCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: A [~ [~ [p119<=p1]] U EF [3<=p92]]
normalized: [~ [EG [~ [E [true U 3<=p92]]]] & ~ [E [~ [E [true U 3<=p92]] U [~ [p119<=p1] & ~ [E [true U 3<=p92]]]]]]
abstracting: (3<=p92)
states: 0
abstracting: (p119<=p1)
states: 34,300,001 (7)
abstracting: (3<=p92)
states: 0
abstracting: (3<=p92)
states: 0
EG iterations: 0
-> the formula is FALSE
FORMULA DLCround-PT-04a-CTLCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.105sec
checking: AG [A [1<=p105 U p51<=p125]]
normalized: ~ [E [true U ~ [[~ [EG [~ [p51<=p125]]] & ~ [E [~ [p51<=p125] U [~ [1<=p105] & ~ [p51<=p125]]]]]]]]
abstracting: (p51<=p125)
states: 240,100,001 (8)
abstracting: (1<=p105)
states: 240,100,000 (8)
abstracting: (p51<=p125)
states: 240,100,001 (8)
abstracting: (p51<=p125)
states: 240,100,001 (8)
.
EG iterations: 1
-> the formula is TRUE
FORMULA DLCround-PT-04a-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: ~ [[EF [2<=p62] & EF [[p106<=p112 & 2<=p91]]]]
normalized: ~ [[E [true U 2<=p62] & E [true U [p106<=p112 & 2<=p91]]]]
abstracting: (2<=p91)
states: 0
abstracting: (p106<=p112)
states: 240,100,001 (8)
abstracting: (2<=p62)
states: 0
-> the formula is TRUE
FORMULA DLCround-PT-04a-CTLCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: EF [EG [[p133<=p35 & p126<=p117]]]
normalized: E [true U EG [[p133<=p35 & p126<=p117]]]
abstracting: (p126<=p117)
states: 240,100,001 (8)
abstracting: (p133<=p35)
states: 24,010,001 (7)
..
EG iterations: 2
-> the formula is TRUE
FORMULA DLCround-PT-04a-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.267sec
checking: EF [[[~ [p54<=p79] | 2<=p112] & ~ [p103<=p49]]]
normalized: E [true U [[2<=p112 | ~ [p54<=p79]] & ~ [p103<=p49]]]
abstracting: (p103<=p49)
states: 24,010,001 (7)
abstracting: (p54<=p79)
states: 240,100,001 (8)
abstracting: (2<=p112)
states: 0
-> the formula is FALSE
FORMULA DLCround-PT-04a-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
checking: AF [[[[2<=p131 & p25<=p76] | [p59<=p89 & 3<=p58]] | AG [p55<=p93]]]
normalized: ~ [EG [~ [[~ [E [true U ~ [p55<=p93]]] | [[p59<=p89 & 3<=p58] | [2<=p131 & p25<=p76]]]]]]
abstracting: (p25<=p76)
states: 209,230,001 (8)
abstracting: (2<=p131)
states: 0
abstracting: (3<=p58)
states: 0
abstracting: (p59<=p89)
states: 240,100,001 (8)
abstracting: (p55<=p93)
states: 240,100,001 (8)
.
EG iterations: 1
-> the formula is TRUE
FORMULA DLCround-PT-04a-CTLCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: [~ [AG [p34<=p31]] | [E [1<=p22 U p89<=p8] & [[[1<=p54 | p75<=p16] & ~ [1<=p123]] & AG [p80<=p34]]]]
normalized: [[[~ [E [true U ~ [p80<=p34]]] & [~ [1<=p123] & [1<=p54 | p75<=p16]]] & E [1<=p22 U p89<=p8]] | E [true U ~ [p34<=p31]]]
abstracting: (p34<=p31)
states: 216,090,001 (8)
abstracting: (p89<=p8)
states: 34,300,001 (7)
abstracting: (1<=p22)
states: 34,300,000 (7)
abstracting: (p75<=p16)
states: 219,520,001 (8)
abstracting: (1<=p54)
states: 24,010,000 (7)
abstracting: (1<=p123)
states: 240,100,000 (8)
abstracting: (p80<=p34)
states: 24,010,001 (7)
-> the formula is TRUE
FORMULA DLCround-PT-04a-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.544sec
checking: [~ [E [p29<=p127 U 2<=p94]] | [[EG [3<=p16] | EG [2<=p51]] | [AG [p14<=p68] & [[3<=p21 | p55<=p66] & [1<=p61 & 3<=p138]]]]]
normalized: [~ [E [p29<=p127 U 2<=p94]] | [[~ [E [true U ~ [p14<=p68]]] & [[3<=p21 | p55<=p66] & [1<=p61 & 3<=p138]]] | [EG [2<=p51] | EG [3<=p16]]]]
abstracting: (3<=p16)
states: 0
.
EG iterations: 1
abstracting: (2<=p51)
states: 0
.
EG iterations: 1
abstracting: (3<=p138)
states: 0
abstracting: (1<=p61)
states: 24,010,000 (7)
abstracting: (p55<=p66)
states: 218,491,001 (8)
abstracting: (3<=p21)
states: 0
abstracting: (p14<=p68)
states: 209,230,001 (8)
abstracting: (2<=p94)
states: 0
abstracting: (p29<=p127)
states: 240,100,001 (8)
-> the formula is TRUE
FORMULA DLCround-PT-04a-CTLCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.128sec
totally nodes used: 1860045(1.9e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1915623 6563937 8479560
used/not used/entry size/cache size: 6074256 61034608 16 1024MB
basic ops cache: hits/miss/sum: 984359 3716777 4701136
used/not used/entry size/cache size: 5525889 11251327 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 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: 7080 22046 29126
used/not used/entry size/cache size: 21959 2075193 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 65266635
1 1824503
2 17636
3 90
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 4.497sec
BK_STOP 1495823101206
--------------------
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
initing FirstDep: 0m 0.003sec
iterations count:17669 (21), effective:70 (0)
initing FirstDep: 0m 0.005sec
iterations count:1375 (1), effective:1 (0)
iterations count:823 (1), effective:0 (0)
iterations count:823 (1), effective:0 (0)
iterations count:1646 (2), effective:2 (0)
iterations count:2316 (2), effective:10 (0)
iterations count:2523 (3), effective:10 (0)
iterations count:1129 (1), effective:6 (0)
iterations count:1679 (2), effective:2 (0)
iterations count:2362 (2), effective:8 (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="DLCround-PT-04a"
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/DLCround-PT-04a.tgz
mv DLCround-PT-04a 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 DLCround-PT-04a, 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 r171-csrt-149580951500219"
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 ;