About the Execution of MARCIE for S_DES-PT-20a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
4372.940 | 463183.00 | 463059.00 | 20.40 | FFTTTFTFTTFFTFFF | 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-20a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r091-ebro-149488438500268
=====================================================================
--------------------
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-20a-ReachabilityCardinality-0
FORMULA_NAME DES-PT-20a-ReachabilityCardinality-1
FORMULA_NAME DES-PT-20a-ReachabilityCardinality-10
FORMULA_NAME DES-PT-20a-ReachabilityCardinality-11
FORMULA_NAME DES-PT-20a-ReachabilityCardinality-12
FORMULA_NAME DES-PT-20a-ReachabilityCardinality-13
FORMULA_NAME DES-PT-20a-ReachabilityCardinality-14
FORMULA_NAME DES-PT-20a-ReachabilityCardinality-15
FORMULA_NAME DES-PT-20a-ReachabilityCardinality-2
FORMULA_NAME DES-PT-20a-ReachabilityCardinality-3
FORMULA_NAME DES-PT-20a-ReachabilityCardinality-4
FORMULA_NAME DES-PT-20a-ReachabilityCardinality-5
FORMULA_NAME DES-PT-20a-ReachabilityCardinality-6
FORMULA_NAME DES-PT-20a-ReachabilityCardinality-7
FORMULA_NAME DES-PT-20a-ReachabilityCardinality-8
FORMULA_NAME DES-PT-20a-ReachabilityCardinality-9
=== Now, execution of the tool begins
BK_START 1495056414855
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_20a
(NrP: 195 NrTr: 152 NrArc: 742)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.007sec
net check time: 0m 0.001sec
init dd package: 0m 2.714sec
RS generation: 0m20.050sec
-> reachability set: #nodes 62085 (6.2e+04) #states 7,969,347,823,493 (12)
starting MCC model checker
--------------------------
checking: EF [2<=p141]
normalized: E [true U 2<=p141]
abstracting: (2<=p141)
states: 0
-> the formula is FALSE
FORMULA DES-PT-20a-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.095sec
checking: EF [2<=p111]
normalized: E [true U 2<=p111]
abstracting: (2<=p111)
states: 0
-> the formula is FALSE
FORMULA DES-PT-20a-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [1<=p169]
normalized: E [true U 1<=p169]
abstracting: (1<=p169)
states: 268,887,287,591 (11)
after gc: zbdd nodes used:127161, unused:18622839
after gc: zbdd nodes used:157066, unused:37342934-> the formula is TRUE
FORMULA DES-PT-20a-ReachabilityCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 1m 2.648sec
checking: AG [~ [2<=p118]]
normalized: ~ [E [true U 2<=p118]]
abstracting: (2<=p118)
states: 0
-> the formula is TRUE
FORMULA DES-PT-20a-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.060sec
checking: AG [p7<=p76]
normalized: ~ [E [true U ~ [p7<=p76]]]
abstracting: (p7<=p76)
states: 7,509,967,901,949 (12)
after gc: zbdd nodes used:163228, unused:74836772-> the formula is FALSE
FORMULA DES-PT-20a-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m39.967sec
checking: EF [~ [~ [[3<=p90 | 2<=p85]]]]
normalized: E [true U [3<=p90 | 2<=p85]]
abstracting: (2<=p85)
states: 0
abstracting: (3<=p90)
states: 0
-> the formula is FALSE
FORMULA DES-PT-20a-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.082sec
checking: EF [[3<=p177 & ~ [~ [3<=p15]]]]
normalized: E [true U [3<=p177 & 3<=p15]]
abstracting: (3<=p15)
states: 0
abstracting: (3<=p177)
states: 0
-> the formula is FALSE
FORMULA DES-PT-20a-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [~ [[[1<=p126 & 2<=p40] | ~ [1<=p8]]]]
normalized: E [true U ~ [[~ [1<=p8] | [1<=p126 & 2<=p40]]]]
abstracting: (2<=p40)
states: 0
abstracting: (1<=p126)
states: 5,030,738,730,184 (12)
abstracting: (1<=p8)
states: 459,379,921,544 (11)
-> the formula is TRUE
FORMULA DES-PT-20a-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m27.944sec
checking: EF [~ [[~ [1<=p58] | ~ [p87<=p28]]]]
normalized: E [true U ~ [[~ [p87<=p28] | ~ [1<=p58]]]]
abstracting: (1<=p58)
states: 404,277,547,512 (11)
abstracting: (p87<=p28)
states: 5,456,665,447,513 (12)
-> the formula is TRUE
FORMULA DES-PT-20a-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m27.756sec
checking: AG [[~ [[p106<=p73 & 2<=p39]] | ~ [~ [1<=p23]]]]
normalized: ~ [E [true U ~ [[1<=p23 | ~ [[p106<=p73 & 2<=p39]]]]]]
abstracting: (2<=p39)
states: 0
abstracting: (p106<=p73)
states: 4,420,175,867,795 (12)
abstracting: (1<=p23)
states: 459,379,525,316 (11)
-> the formula is TRUE
FORMULA DES-PT-20a-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.093sec
checking: EF [~ [[p126<=p129 | p13<=p125]]]
normalized: E [true U ~ [[p126<=p129 | p13<=p125]]]
abstracting: (p13<=p125)
states: 7,679,920,379,413 (12)
abstracting: (p126<=p129)
states: 4,722,693,399,997 (12)
-> the formula is TRUE
FORMULA DES-PT-20a-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m21.152sec
checking: EF [[2<=p80 | ~ [[p175<=p112 & p54<=p152]]]]
normalized: E [true U [2<=p80 | ~ [[p175<=p112 & p54<=p152]]]]
abstracting: (p54<=p152)
states: 7,689,915,242,427 (12)
abstracting: (p175<=p112)
states: 7,969,080,512,316 (12)
abstracting: (2<=p80)
states: 0
after gc: zbdd nodes used:383557, unused:149616443-> the formula is TRUE
FORMULA DES-PT-20a-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 2m40.117sec
checking: EF [[[p77<=p44 | [2<=p36 | 1<=p51]] & 3<=p100]]
normalized: E [true U [3<=p100 & [p77<=p44 | [2<=p36 | 1<=p51]]]]
abstracting: (1<=p51)
states: 419,493,839,120 (11)
abstracting: (2<=p36)
states: 0
abstracting: (p77<=p44)
states: 7,534,165,040,077 (12)
abstracting: (3<=p100)
states: 0
-> the formula is FALSE
FORMULA DES-PT-20a-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.137sec
checking: AG [[[~ [3<=p78] & [p137<=p173 | p28<=p152]] | 1<=p67]]
normalized: ~ [E [true U ~ [[1<=p67 | [[p137<=p173 | p28<=p152] & ~ [3<=p78]]]]]]
abstracting: (3<=p78)
states: 0
abstracting: (p28<=p152)
states: 7,663,600,697,853 (12)
abstracting: (p137<=p173)
states: 5,257,295,472,058 (12)
abstracting: (1<=p67)
states: 459,379,921,544 (11)
-> the formula is FALSE
FORMULA DES-PT-20a-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m44.521sec
checking: AG [[[[3<=p53 & 3<=p165] & p104<=p98] | [[p73<=p193 | 3<=p103] | 2<=p98]]]
normalized: ~ [E [true U ~ [[[2<=p98 | [p73<=p193 | 3<=p103]] | [p104<=p98 & [3<=p53 & 3<=p165]]]]]]
abstracting: (3<=p165)
states: 0
abstracting: (3<=p53)
states: 0
abstracting: (p104<=p98)
states: 6,016,880,159,661 (12)
abstracting: (3<=p103)
states: 0
abstracting: (p73<=p193)
states: 7,805,083,781,237 (12)
abstracting: (2<=p98)
states: 0
-> the formula is FALSE
FORMULA DES-PT-20a-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m42.805sec
checking: EF [[[[1<=p6 & 1<=p134] | [p47<=p45 & p160<=p79]] & [3<=p152 & [3<=p83 | 3<=p83]]]]
normalized: E [true U [[3<=p152 & [3<=p83 | 3<=p83]] & [[p47<=p45 & p160<=p79] | [1<=p6 & 1<=p134]]]]
abstracting: (1<=p134)
states: 5,030,738,730,184 (12)
abstracting: (1<=p6)
states: 459,379,921,544 (11)
abstracting: (p160<=p79)
states: 5,428,372,493,450 (12)
abstracting: (p47<=p45)
states: 7,549,853,984,373 (12)
abstracting: (3<=p83)
states: 0
abstracting: (3<=p83)
states: 0
abstracting: (3<=p152)
states: 0
-> the formula is FALSE
FORMULA DES-PT-20a-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.324sec
totally nodes used: 238729647(2.4e+08)
number of garbage collections: 4
fire ops cache: hits/miss/sum: 157923553 206438914 364362467
used/not used/entry size/cache size: 45361220 21747644 16 1024MB
basic ops cache: hits/miss/sum: 290288336 406792949 697081285
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: 443518 631086 1074604
used/not used/entry size/cache size: 226411 1870741 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 15493264
1 22581768
2 16582503
3 8191311
4 3052117
5 916225
6 230100
7 50073
8 9623
9 1577
>= 10 303
Total processing time: 7m43.139sec
BK_STOP 1495056878038
--------------------
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
49673
iterations count:183582 (1207), effective:19892 (130)
initing FirstDep: 0m 0.001sec
iterations count:10849 (71), effective:974 (6)
iterations count:73579 (484), effective:7096 (46)
iterations count:68361 (449), effective:6564 (43)
iterations count:14123 (92), effective:1230 (8)
iterations count:42261 (278), effective:3960 (26)
iterations count:52323 (344), effective:5267 (34)
iterations count:64722 (425), effective:6218 (40)
iterations count:38249 (251), effective:3754 (24)
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-20a"
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-20a.tgz
mv S_DES-PT-20a 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-20a, 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-149488438500268"
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 ;