About the Execution of Marcie for DES-PT-00a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
9843.870 | 149811.00 | 148889.00 | 189.60 | TFTTFTTFFFTTTFFF | 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-2979
Executing tool marcie
Input is DES-PT-00a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r221su-smll-146468026600003
=====================================================================
--------------------
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 DES-PT-00a-CTLCardinality-0
FORMULA_NAME DES-PT-00a-CTLCardinality-1
FORMULA_NAME DES-PT-00a-CTLCardinality-10
FORMULA_NAME DES-PT-00a-CTLCardinality-11
FORMULA_NAME DES-PT-00a-CTLCardinality-12
FORMULA_NAME DES-PT-00a-CTLCardinality-13
FORMULA_NAME DES-PT-00a-CTLCardinality-14
FORMULA_NAME DES-PT-00a-CTLCardinality-15
FORMULA_NAME DES-PT-00a-CTLCardinality-2
FORMULA_NAME DES-PT-00a-CTLCardinality-3
FORMULA_NAME DES-PT-00a-CTLCardinality-4
FORMULA_NAME DES-PT-00a-CTLCardinality-5
FORMULA_NAME DES-PT-00a-CTLCardinality-6
FORMULA_NAME DES-PT-00a-CTLCardinality-7
FORMULA_NAME DES-PT-00a-CTLCardinality-8
FORMULA_NAME DES-PT-00a-CTLCardinality-9
=== Now, execution of the tool begins
BK_START 1464784899542
Marcie rev. 8535M (built: crohr on 2016-04-27)
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 --mcc-mode --memory=6 --suppress
parse successfull
net created successfully
Net: DES_PT_00a
(NrP: 115 NrTr: 76 NrArc: 373)
net check time: 0m 0.006sec
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.001sec
init dd package: 0m 4.393sec
RS generation: 0m 5.712sec
-> reachability set: #nodes 7956 (8.0e+03) #states 24,196,956,529 (10)
starting MCC model checker
--------------------------
checking: AG [~ [AG [3<=p5]]]
normalized: ~ [E [true U ~ [E [true U ~ [3<=p5]]]]]
abstracting: (3<=p5) states: 0
-> the formula is TRUE
FORMULA DES-PT-00a-CTLCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.308sec
checking: EG [AX [~ [3<=p60]]]
normalized: EG [~ [EX [3<=p60]]]
abstracting: (3<=p60) states: 0
.
EG iterations: 0
-> the formula is TRUE
FORMULA DES-PT-00a-CTLCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: EG [AG [~ [3<=p59]]]
normalized: EG [~ [E [true U 3<=p59]]]
abstracting: (3<=p59) states: 0
EG iterations: 0
-> the formula is TRUE
FORMULA DES-PT-00a-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: EF [[EX [3<=p112] & 3<=p93]]
normalized: E [true U [3<=p93 & EX [3<=p112]]]
abstracting: (3<=p112) states: 0
.abstracting: (3<=p93) states: 0
-> the formula is FALSE
FORMULA DES-PT-00a-CTLCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EF [A [3<=p80 U 2<=p77]]
normalized: E [true U [~ [E [~ [2<=p77] U [~ [2<=p77] & ~ [3<=p80]]]] & ~ [EG [~ [2<=p77]]]]]
abstracting: (2<=p77) states: 0
EG iterations: 0
abstracting: (3<=p80) states: 0
abstracting: (2<=p77) states: 0
abstracting: (2<=p77) states: 0
-> the formula is FALSE
FORMULA DES-PT-00a-CTLCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.008sec
checking: ~ [AF [AG [p52<=p65]]]
normalized: EG [E [true U ~ [p52<=p65]]]
abstracting: (p52<=p65) states: 14,369,831,761 (10)
.............................................................................
EG iterations: 77
-> the formula is TRUE
FORMULA DES-PT-00a-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m14.083sec
checking: [1<=p72 | ~ [EG [p39<=p113]]]
normalized: [1<=p72 | ~ [EG [p39<=p113]]]
abstracting: (p39<=p113) states: 18,456,848,113 (10)
..........................................
EG iterations: 42
abstracting: (1<=p72) states: 8,092,389,888 (9)
-> the formula is FALSE
FORMULA DES-PT-00a-CTLCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.735sec
checking: EG [E [3<=p62 U p58<=p34]]
normalized: EG [E [3<=p62 U p58<=p34]]
abstracting: (p58<=p34) states: 14,211,499,489 (10)
abstracting: (3<=p62) states: 0
.............................................................................................
EG iterations: 93
-> the formula is TRUE
FORMULA DES-PT-00a-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m38.792sec
checking: ~ [[EF [[3<=p67 | 3<=p40]] & p38<=p98]]
normalized: ~ [[p38<=p98 & E [true U [3<=p67 | 3<=p40]]]]
abstracting: (3<=p40) states: 0
abstracting: (3<=p67) states: 0
abstracting: (p38<=p98) states: 19,175,649,313 (10)
-> the formula is TRUE
FORMULA DES-PT-00a-CTLCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.005sec
checking: AG [[AF [p65<=p14] | EG [p70<=p106]]]
normalized: ~ [E [true U ~ [[EG [p70<=p106] | ~ [EG [~ [p65<=p14]]]]]]]
abstracting: (p65<=p14) states: 19,712,538,481 (10)
...................................................................................
EG iterations: 83
abstracting: (p70<=p106) states: 12,529,598,593 (10)
..........................................................................
EG iterations: 74
-> the formula is TRUE
FORMULA DES-PT-00a-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m22.821sec
checking: A [EX [p67<=p37] U [~ [2<=p1] & ~ [p68<=p62]]]
normalized: [~ [EG [~ [[~ [p68<=p62] & ~ [2<=p1]]]]] & ~ [E [~ [[~ [p68<=p62] & ~ [2<=p1]]] U [~ [EX [p67<=p37]] & ~ [[~ [p68<=p62] & ~ [2<=p1]]]]]]]
abstracting: (2<=p1) states: 0
abstracting: (p68<=p62) states: 18,779,016,049 (10)
abstracting: (p67<=p37) states: 15,923,818,273 (10)
.abstracting: (2<=p1) states: 0
abstracting: (p68<=p62) states: 18,779,016,049 (10)
abstracting: (2<=p1) states: 0
abstracting: (p68<=p62) states: 18,779,016,049 (10)
............................................................................
EG iterations: 76
-> the formula is FALSE
FORMULA DES-PT-00a-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 9.048sec
checking: A [EF [p6<=p77] U [[3<=p10 | 3<=p86] & p36<=p41]]
normalized: [~ [EG [~ [[p36<=p41 & [3<=p10 | 3<=p86]]]]] & ~ [E [~ [[p36<=p41 & [3<=p10 | 3<=p86]]] U [~ [E [true U p6<=p77]] & ~ [[p36<=p41 & [3<=p10 | 3<=p86]]]]]]]
abstracting: (3<=p86) states: 0
abstracting: (3<=p10) states: 0
abstracting: (p36<=p41) states: 10,249,379,953 (10)
abstracting: (p6<=p77) states: 20,920,397,169 (10)
abstracting: (3<=p86) states: 0
abstracting: (3<=p10) states: 0
abstracting: (p36<=p41) states: 10,249,379,953 (10)
abstracting: (3<=p86) states: 0
abstracting: (3<=p10) states: 0
abstracting: (p36<=p41) states: 10,249,379,953 (10)
EG iterations: 0
-> the formula is FALSE
FORMULA DES-PT-00a-CTLCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.087sec
checking: A [[p75<=p109 | [3<=p98 | p30<=p84]] U EG [p89<=p78]]
normalized: [~ [EG [~ [EG [p89<=p78]]]] & ~ [E [~ [EG [p89<=p78]] U [~ [[p75<=p109 | [3<=p98 | p30<=p84]]] & ~ [EG [p89<=p78]]]]]]
abstracting: (p89<=p78) states: 23,343,547,393 (10)
..................................................................................................................
EG iterations: 114
abstracting: (p30<=p84) states: 16,144,673,209 (10)
abstracting: (3<=p98) states: 0
abstracting: (p75<=p109) states: 11,303,145,841 (10)
abstracting: (p89<=p78) states: 23,343,547,393 (10)
..................................................................................................................
EG iterations: 114
abstracting: (p89<=p78) states: 23,343,547,393 (10)
..................................................................................................................
EG iterations: 114
................
before gc: list nodes free: 1670122
after gc: idd nodes used:117632, unused:63882368; list nodes free:293061150
............................................................................................................
EG iterations: 124
-> the formula is TRUE
FORMULA DES-PT-00a-CTLCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m43.969sec
checking: ~ [[~ [AF [2<=p60]] & [[~ [p68<=p33] | [p37<=p23 | p26<=p45]] | ~ [~ [3<=p75]]]]]
normalized: ~ [[EG [~ [2<=p60]] & [3<=p75 | [~ [p68<=p33] | [p37<=p23 | p26<=p45]]]]]
abstracting: (p26<=p45) states: 17,266,686,961 (10)
abstracting: (p37<=p23) states: 22,699,399,489 (10)
abstracting: (p68<=p33) states: 14,211,499,489 (10)
abstracting: (3<=p75) states: 0
abstracting: (2<=p60) states: 0
EG iterations: 0
-> the formula is FALSE
FORMULA DES-PT-00a-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.060sec
checking: [[2<=p87 & AX [p4<=p51]] | AF [[[p91<=p65 & 2<=p19] & [3<=p102 | p34<=p14]]]]
normalized: [~ [EG [~ [[[p91<=p65 & 2<=p19] & [3<=p102 | p34<=p14]]]]] | [2<=p87 & ~ [EX [~ [p4<=p51]]]]]
abstracting: (p4<=p51) states: 16,577,851,665 (10)
.abstracting: (2<=p87) states: 0
abstracting: (p34<=p14) states: 20,112,302,065 (10)
abstracting: (3<=p102) states: 0
abstracting: (2<=p19) states: 0
abstracting: (p91<=p65) states: 24,119,302,513 (10)
EG iterations: 0
-> the formula is FALSE
FORMULA DES-PT-00a-CTLCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.264sec
checking: [[EF [[p71<=p7 & p48<=p54]] | ~ [~ [[p28<=p50 | 1<=p83]]]] & [A [p76<=p13 U 2<=p17] & ~ [EG [p81<=p29]]]]
normalized: [[~ [EG [p81<=p29]] & [~ [EG [~ [2<=p17]]] & ~ [E [~ [2<=p17] U [~ [p76<=p13] & ~ [2<=p17]]]]]] & [E [true U [p71<=p7 & p48<=p54]] | [p28<=p50 | 1<=p83]]]
abstracting: (1<=p83) states: 14,363,762,688 (10)
abstracting: (p28<=p50) states: 19,719,257,977 (10)
abstracting: (p48<=p54) states: 18,779,016,049 (10)
abstracting: (p71<=p7) states: 18,230,197,617 (10)
abstracting: (2<=p17) states: 0
abstracting: (p76<=p13) states: 20,150,761,585 (10)
abstracting: (2<=p17) states: 0
abstracting: (2<=p17) states: 0
EG iterations: 0
abstracting: (p81<=p29) states: 17,015,075,185 (10)
...........................................
EG iterations: 43
-> the formula is FALSE
FORMULA DES-PT-00a-CTLCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 6.463sec
Total processing time: 2m29.526sec
BK_STOP 1464785049353
--------------------
content from stderr:
check for maximal unmarked siphon
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.000sec
8737 38929 24597 24465 20507 24423 18371 27713 21584 14739
iterations count:10891 (143), effective:1446 (19)
initing FirstDep: 0m 0.002sec
iterations count:76 (1), effective:0 (0)
iterations count:76 (1), effective:0 (0)
iterations count:774 (10), effective:81 (1)
iterations count:76 (1), effective:0 (0)
13868 13143
iterations count:2089 (27), effective:269 (3)
iterations count:77 (1), effective:1 (0)
31660 39629 26931
iterations count:3428 (45), effective:413 (5)
iterations count:92 (1), effective:4 (0)
19225 21954 22324 23913
iterations count:4043 (53), effective:501 (6)
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="DES-PT-00a"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/root/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/DES-PT-00a.tgz
mv DES-PT-00a execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool marcie"
echo " Input is DES-PT-00a, 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 r221su-smll-146468026600003"
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 ;