About the Execution of MARCIE for S_UtahNoC-PT-none
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
2640.370 | 152764.00 | 152020.00 | 30.30 | FFFFFFFTFTTTFFTF | 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_UtahNoC-PT-none, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r151-ebro-149443454600376
=====================================================================
--------------------
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 UtahNoC-PT-none-ReachabilityCardinality-0
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-1
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-10
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-11
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-12
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-13
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-14
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-15
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-2
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-3
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-4
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-5
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-6
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-7
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-8
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-9
=== Now, execution of the tool begins
BK_START 1496690894492
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: UtahNoC_PT_none
(NrP: 216 NrTr: 977 NrArc: 2905)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.026sec
net check time: 0m 0.001sec
init dd package: 0m 2.066sec
RS generation: 0m53.868sec
-> reachability set: #nodes 5673 (5.7e+03) #states 4,759,924,249 (9)
starting MCC model checker
--------------------------
checking: EF [3<=p93]
normalized: E [true U 3<=p93]
abstracting: (3<=p93)
states: 0
-> the formula is FALSE
FORMULA UtahNoC-PT-none-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.007sec
checking: EF [2<=p206]
normalized: E [true U 2<=p206]
abstracting: (2<=p206)
states: 0
-> the formula is FALSE
FORMULA UtahNoC-PT-none-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [1<=p125]
normalized: E [true U 1<=p125]
abstracting: (1<=p125)
states: 110,072,520 (8)
after gc: zbdd nodes used:7185, unused:18742815-> the formula is TRUE
FORMULA UtahNoC-PT-none-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 8.823sec
checking: EF [1<=p166]
normalized: E [true U 1<=p166]
abstracting: (1<=p166)
states: 165,416,184 (8)
-> the formula is TRUE
FORMULA UtahNoC-PT-none-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m11.686sec
checking: EF [2<=p38]
normalized: E [true U 2<=p38]
abstracting: (2<=p38)
states: 0
-> the formula is FALSE
FORMULA UtahNoC-PT-none-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [3<=p60]
normalized: E [true U 3<=p60]
abstracting: (3<=p60)
states: 0
-> the formula is FALSE
FORMULA UtahNoC-PT-none-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [1<=p80]
normalized: E [true U 1<=p80]
abstracting: (1<=p80)
states: 110,072,520 (8)
-> the formula is TRUE
FORMULA UtahNoC-PT-none-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 8.831sec
checking: AG [p121<=p69]
normalized: ~ [E [true U ~ [p121<=p69]]]
abstracting: (p121<=p69)
states: 4,652,442,793 (9)
-> the formula is FALSE
FORMULA UtahNoC-PT-none-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.428sec
checking: EF [[[~ [3<=p143] | [2<=p54 & 2<=p59]] & 2<=p45]]
normalized: E [true U [2<=p45 & [[2<=p54 & 2<=p59] | ~ [3<=p143]]]]
abstracting: (3<=p143)
states: 0
abstracting: (2<=p59)
states: 0
abstracting: (2<=p54)
states: 0
abstracting: (2<=p45)
states: 0
-> the formula is FALSE
FORMULA UtahNoC-PT-none-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AG [[~ [~ [p101<=p148]] | [~ [1<=p61] | 1<=p1]]]
normalized: ~ [E [true U ~ [[p101<=p148 | [1<=p1 | ~ [1<=p61]]]]]]
abstracting: (1<=p61)
states: 111,545,928 (8)
abstracting: (1<=p1)
states: 1,586,641,416 (9)
abstracting: (p101<=p148)
states: 4,652,234,425 (9)
-> the formula is FALSE
FORMULA UtahNoC-PT-none-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 3.229sec
checking: EF [[[3<=p88 | ~ [p157<=p213]] & [~ [3<=p145] | 3<=p70]]]
normalized: E [true U [[3<=p88 | ~ [p157<=p213]] & [3<=p70 | ~ [3<=p145]]]]
abstracting: (3<=p145)
states: 0
abstracting: (3<=p70)
states: 0
abstracting: (p157<=p213)
states: 4,604,454,550 (9)
abstracting: (3<=p88)
states: 0
after gc: zbdd nodes used:12806, unused:37487194-> the formula is TRUE
FORMULA UtahNoC-PT-none-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m18.432sec
checking: AG [[p193<=p65 | ~ [[p149<=p106 | p133<=p116]]]]
normalized: ~ [E [true U ~ [[~ [[p149<=p106 | p133<=p116]] | p193<=p65]]]]
abstracting: (p193<=p65)
states: 4,564,746,523 (9)
abstracting: (p133<=p116)
states: 4,648,378,321 (9)
abstracting: (p149<=p106)
states: 4,598,364,169 (9)
-> the formula is FALSE
FORMULA UtahNoC-PT-none-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 7.945sec
checking: EF [[[[2<=p133 & 3<=p12] & [p44<=p177 | 2<=p12]] & ~ [p118<=p114]]]
normalized: E [true U [[[p44<=p177 | 2<=p12] & [2<=p133 & 3<=p12]] & ~ [p118<=p114]]]
abstracting: (p118<=p114)
states: 4,649,926,033 (9)
abstracting: (3<=p12)
states: 0
abstracting: (2<=p133)
states: 0
abstracting: (2<=p12)
states: 0
abstracting: (p44<=p177)
states: 4,653,645,625 (9)
-> the formula is FALSE
FORMULA UtahNoC-PT-none-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.010sec
checking: EF [~ [[[p11<=p15 | 3<=p206] | [p43<=p16 & p111<=p104]]]]
normalized: E [true U ~ [[[p11<=p15 | 3<=p206] | [p43<=p16 & p111<=p104]]]]
abstracting: (p111<=p104)
states: 4,649,926,033 (9)
abstracting: (p43<=p16)
states: 4,649,851,729 (9)
abstracting: (3<=p206)
states: 0
abstracting: (p11<=p15)
states: 4,648,378,321 (9)
-> the formula is TRUE
FORMULA UtahNoC-PT-none-ReachabilityCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m10.355sec
checking: AG [[[2<=p94 | [3<=p16 & p189<=p197]] | [[p23<=p122 & p200<=p138] | ~ [1<=p72]]]]
normalized: ~ [E [true U ~ [[[[p23<=p122 & p200<=p138] | ~ [1<=p72]] | [2<=p94 | [3<=p16 & p189<=p197]]]]]]
abstracting: (p189<=p197)
states: 4,601,359,126 (9)
abstracting: (3<=p16)
states: 0
abstracting: (2<=p94)
states: 0
abstracting: (1<=p72)
states: 109,998,216 (8)
abstracting: (p200<=p138)
states: 4,567,037,773 (9)
abstracting: (p23<=p122)
states: 4,652,442,793 (9)
-> the formula is FALSE
FORMULA UtahNoC-PT-none-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m22.322sec
checking: EF [[[[2<=p194 | p46<=p52] | ~ [p134<=p130]] & [[p7<=p182 | p185<=p181] & [3<=p73 & p86<=p14]]]]
normalized: E [true U [[[3<=p73 & p86<=p14] & [p7<=p182 | p185<=p181]] & [~ [p134<=p130] | [2<=p194 | p46<=p52]]]]
abstracting: (p46<=p52)
states: 4,650,982,057 (9)
abstracting: (2<=p194)
states: 0
abstracting: (p134<=p130)
states: 4,598,339,401 (9)
abstracting: (p185<=p181)
states: 4,597,603,489 (9)
abstracting: (p7<=p182)
states: 4,652,234,425 (9)
abstracting: (p86<=p14)
states: 4,652,438,761 (9)
abstracting: (3<=p73)
states: 0
-> the formula is FALSE
FORMULA UtahNoC-PT-none-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.046sec
totally nodes used: 56851461(5.7e+07)
number of garbage collections: 2
fire ops cache: hits/miss/sum: 138644109 158665062 297309171
used/not used/entry size/cache size: 31534159 35574705 16 1024MB
basic ops cache: hits/miss/sum: 121045825 166330081 287375906
used/not used/entry size/cache size: 16772117 5099 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: 61620 63737 125357
used/not used/entry size/cache size: 47450 2049702 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 43736420
1 18715063
2 4014762
3 574884
4 61914
5 5399
6 392
7 30
8 0
9 0
>= 10 0
Total processing time: 2m32.712sec
BK_STOP 1496691047256
--------------------
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.007sec
520 1557 3048 4432 4476 4806 4903 5432 4802 4917 3437 3608 3598 5079 5102 5538 4750 4046 4605 4614 5163 5023 7081 7948 7375 7917
iterations count:2659652 (2722), effective:29063 (29)
initing FirstDep: 0m 0.011sec
iterations count:11905 (12), effective:220 (0)
iterations count:20888 (21), effective:389 (0)
iterations count:13552 (13), effective:263 (0)
iterations count:24242 (24), effective:423 (0)
iterations count:16689 (17), effective:333 (0)
iterations count:30226 (30), effective:682 (0)
iterations count:12881 (13), effective:226 (0)
iterations count:38600 (39), effective:841 (0)
iterations count:54452 (55), effective:1196 (1)
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_UtahNoC-PT-none"
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_UtahNoC-PT-none.tgz
mv S_UtahNoC-PT-none 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_UtahNoC-PT-none, 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 r151-ebro-149443454600376"
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 ;