About the Execution of MARCIE for S_DES-PT-30a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
6673.710 | 778861.00 | 778038.00 | 30.60 | FFTFTTFTFTTFFFFF | 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-3253
Executing tool marcie
Input is S_DES-PT-30a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r091-ebro-149488438500286
=====================================================================
--------------------
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-30a-ReachabilityCardinality-0
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-1
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-10
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-11
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-12
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-13
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-14
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-15
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-2
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-3
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-4
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-5
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-6
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-7
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-8
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-9
=== Now, execution of the tool begins
BK_START 1495056508683
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=ReachabilityCardinality.xml --memory=6
parse successfull
net created successfully
Net: DES_PT_30a
(NrP: 234 NrTr: 191 NrArc: 926)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.010sec
net check time: 0m 0.001sec
init dd package: 0m 2.172sec
after gc: zbdd nodes used:77683, unused:18672317
RS generation: 0m30.043sec
-> reachability set: #nodes 78180 (7.8e+04) #states 19,177,775,757,445 (13)
starting MCC model checker
--------------------------
checking: EF [2<=p23]
normalized: E [true U 2<=p23]
abstracting: (2<=p23)
states: 0
-> the formula is FALSE
FORMULA DES-PT-30a-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.061sec
checking: AG [~ [3<=p123]]
normalized: ~ [E [true U 3<=p123]]
abstracting: (3<=p123)
states: 0
-> the formula is TRUE
FORMULA DES-PT-30a-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [~ [3<=p107]]
normalized: ~ [E [true U 3<=p107]]
abstracting: (3<=p107)
states: 0
-> the formula is TRUE
FORMULA DES-PT-30a-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [p26<=p219]
normalized: ~ [E [true U ~ [p26<=p219]]]
abstracting: (p26<=p219)
states: 18,557,521,603,427 (13)
after gc: zbdd nodes used:143815, unused:37356185-> the formula is FALSE
FORMULA DES-PT-30a-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m27.302sec
checking: EF [[~ [~ [3<=p121]] & 2<=p172]]
normalized: E [true U [3<=p121 & 2<=p172]]
abstracting: (2<=p172)
states: 0
abstracting: (3<=p121)
states: 0
-> the formula is FALSE
FORMULA DES-PT-30a-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.074sec
checking: EF [~ [[~ [3<=p52] | [3<=p39 & 2<=p35]]]]
normalized: E [true U ~ [[[3<=p39 & 2<=p35] | ~ [3<=p52]]]]
abstracting: (3<=p52)
states: 0
abstracting: (2<=p35)
states: 0
abstracting: (3<=p39)
states: 0
-> the formula is FALSE
FORMULA DES-PT-30a-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EF [[~ [[p199<=p121 | 1<=p197]] & ~ [~ [1<=p83]]]]
normalized: E [true U [1<=p83 & ~ [[p199<=p121 | 1<=p197]]]]
abstracting: (1<=p197)
states: 6,406,983,260,937 (12)
abstracting: (p199<=p121)
states: 15,934,346,350,042 (13)
abstracting: (1<=p83)
states: 661,463,220,496 (11)
after gc: zbdd nodes used:267490, unused:74732510-> the formula is TRUE
FORMULA DES-PT-30a-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 2m 2.599sec
checking: EF [~ [[[1<=p71 | 1<=p177] | p102<=p38]]]
normalized: E [true U ~ [[p102<=p38 | [1<=p71 | 1<=p177]]]]
abstracting: (1<=p177)
states: 12,097,627,311,256 (13)
abstracting: (1<=p71)
states: 661,463,220,496 (11)
abstracting: (p102<=p38)
states: 18,524,188,883,627 (13)
after gc: zbdd nodes used:318298, unused:149681702-> the formula is TRUE
FORMULA DES-PT-30a-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 2m 5.455sec
checking: EF [[~ [2<=p72] & [~ [2<=p149] & [2<=p42 & 3<=p42]]]]
normalized: E [true U [[~ [2<=p149] & [2<=p42 & 3<=p42]] & ~ [2<=p72]]]
abstracting: (2<=p72)
states: 0
abstracting: (3<=p42)
states: 0
abstracting: (2<=p42)
states: 0
abstracting: (2<=p149)
states: 0
-> the formula is FALSE
FORMULA DES-PT-30a-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.084sec
checking: EF [[p58<=p87 & [3<=p29 | ~ [p117<=p51]]]]
normalized: E [true U [p58<=p87 & [3<=p29 | ~ [p117<=p51]]]]
abstracting: (p117<=p51)
states: 18,500,697,761,506 (13)
abstracting: (3<=p29)
states: 0
abstracting: (p58<=p87)
states: 19,063,171,379,751 (13)
-> the formula is TRUE
FORMULA DES-PT-30a-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m19.499sec
checking: EF [[3<=p112 & [[3<=p96 & p19<=p13] & ~ [p146<=p51]]]]
normalized: E [true U [3<=p112 & [~ [p146<=p51] & [3<=p96 & p19<=p13]]]]
abstracting: (p19<=p13)
states: 18,476,426,270,621 (13)
abstracting: (3<=p96)
states: 0
abstracting: (p146<=p51)
states: 9,312,694,851,123 (12)
abstracting: (3<=p112)
states: 0
-> the formula is FALSE
FORMULA DES-PT-30a-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.128sec
checking: AG [[p205<=p32 | [[3<=p157 & p156<=p175] & p180<=p136]]]
normalized: ~ [E [true U ~ [[p205<=p32 | [p180<=p136 & [3<=p157 & p156<=p175]]]]]]
abstracting: (p156<=p175)
states: 18,654,087,674,428 (13)
abstracting: (3<=p157)
states: 0
abstracting: (p180<=p136)
states: 13,816,023,398,775 (13)
abstracting: (p205<=p32)
states: 13,005,349,191,292 (13)
-> the formula is FALSE
FORMULA DES-PT-30a-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 1m15.664sec
checking: EF [[[~ [p106<=p14] & ~ [p218<=p189]] | [~ [p101<=p182] & ~ [3<=p199]]]]
normalized: E [true U [[~ [3<=p199] & ~ [p101<=p182]] | [~ [p218<=p189] & ~ [p106<=p14]]]]
abstracting: (p106<=p14)
states: 18,534,738,168,679 (13)
abstracting: (p218<=p189)
states: 17,569,575,432,442 (13)
abstracting: (p101<=p182)
states: 18,735,897,660,885 (13)
abstracting: (3<=p199)
states: 0
-> the formula is TRUE
FORMULA DES-PT-30a-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 2m18.531sec
checking: AG [[[[p102<=p169 & p100<=p66] | [3<=p148 | 1<=p14]] | [3<=p213 & ~ [1<=p127]]]]
normalized: ~ [E [true U ~ [[[3<=p213 & ~ [1<=p127]] | [[3<=p148 | 1<=p14] | [p102<=p169 & p100<=p66]]]]]]
abstracting: (p100<=p66)
states: 18,500,623,227,149 (13)
abstracting: (p102<=p169)
states: 18,918,304,367,181 (13)
abstracting: (1<=p14)
states: 701,349,486,824 (11)
abstracting: (3<=p148)
states: 0
abstracting: (1<=p127)
states: 6,690,034,165,637 (12)
abstracting: (3<=p213)
states: 0
after gc: zbdd nodes used:554810, unused:299445190-> the formula is FALSE
FORMULA DES-PT-30a-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 2m29.093sec
checking: EF [[[[p189<=p125 | 2<=p33] & 1<=p140] & [~ [2<=p102] & [p99<=p139 & 2<=p113]]]]
normalized: E [true U [[[p99<=p139 & 2<=p113] & ~ [2<=p102]] & [1<=p140 & [p189<=p125 | 2<=p33]]]]
abstracting: (2<=p33)
states: 0
abstracting: (p189<=p125)
states: 11,108,291,545,191 (13)
abstracting: (1<=p140)
states: 3,841,728,246,976 (12)
abstracting: (2<=p102)
states: 0
abstracting: (2<=p113)
states: 0
abstracting: (p99<=p139)
states: 18,614,325,034,893 (13)
-> the formula is FALSE
FORMULA DES-PT-30a-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.370sec
checking: AG [[[[1<=p54 | p210<=p179] | ~ [p227<=p202]] & [p109<=p212 & ~ [2<=p28]]]]
normalized: ~ [E [true U ~ [[[p109<=p212 & ~ [2<=p28]] & [~ [p227<=p202] | [1<=p54 | p210<=p179]]]]]]
abstracting: (p210<=p179)
states: 19,121,688,432,517 (13)
abstracting: (1<=p54)
states: 697,647,531,200 (11)
abstracting: (p227<=p202)
states: 17,176,529,056,581 (13)
abstracting: (2<=p28)
states: 0
abstracting: (p109<=p212)
states: 18,533,844,919,709 (13)
-> the formula is FALSE
FORMULA DES-PT-30a-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 1m16.718sec
totally nodes used: 388583530(3.9e+08)
number of garbage collections: 5
fire ops cache: hits/miss/sum: 264484648 357534695 622019343
used/not used/entry size/cache size: 46224300 20884564 16 1024MB
basic ops cache: hits/miss/sum: 519498048 736154135 1255652183
used/not used/entry size/cache size: 16777216 0 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: 691350 915918 1607268
used/not used/entry size/cache size: 228926 1868226 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 15339963
1 22578569
2 16671038
3 8244875
4 3068467
5 917088
6 229022
7 48833
8 9249
9 1531
>= 10 229
Total processing time: 12m58.758sec
BK_STOP 1495057287544
--------------------
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.001sec
71760 80718 77208 78702
iterations count:471034 (2466), effective:37457 (196)
initing FirstDep: 0m 0.002sec
iterations count:28806 (150), effective:2035 (10)
iterations count:65036 (340), effective:6329 (33)
137351
iterations count:140567 (735), effective:10883 (56)
iterations count:13331 (69), effective:1124 (5)
iterations count:31131 (162), effective:2037 (10)
134755
iterations count:130682 (684), effective:9894 (51)
159045
iterations count:149094 (780), effective:11546 (60)
iterations count:81754 (428), effective:5516 (28)
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="S_DES-PT-30a"
export BK_EXAMINATION="ReachabilityCardinality"
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/S_DES-PT-30a.tgz
mv S_DES-PT-30a execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3253"
echo " Executing tool marcie"
echo " Input is S_DES-PT-30a, 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 r091-ebro-149488438500286"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; 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 ;