About the Execution of MARCIE for S_DNAwalker-PT-09ringLR
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
7580.010 | 11416.00 | 11010.00 | 30.00 | TTFTFTTTTFFFTFFF | 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 S_DNAwalker-PT-09ringLR, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r101-blw3-149441598600079
=====================================================================
--------------------
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 DNAwalker-PT-09ringLR-ReachabilityCardinality-0
FORMULA_NAME DNAwalker-PT-09ringLR-ReachabilityCardinality-1
FORMULA_NAME DNAwalker-PT-09ringLR-ReachabilityCardinality-10
FORMULA_NAME DNAwalker-PT-09ringLR-ReachabilityCardinality-11
FORMULA_NAME DNAwalker-PT-09ringLR-ReachabilityCardinality-12
FORMULA_NAME DNAwalker-PT-09ringLR-ReachabilityCardinality-13
FORMULA_NAME DNAwalker-PT-09ringLR-ReachabilityCardinality-14
FORMULA_NAME DNAwalker-PT-09ringLR-ReachabilityCardinality-15
FORMULA_NAME DNAwalker-PT-09ringLR-ReachabilityCardinality-2
FORMULA_NAME DNAwalker-PT-09ringLR-ReachabilityCardinality-3
FORMULA_NAME DNAwalker-PT-09ringLR-ReachabilityCardinality-4
FORMULA_NAME DNAwalker-PT-09ringLR-ReachabilityCardinality-5
FORMULA_NAME DNAwalker-PT-09ringLR-ReachabilityCardinality-6
FORMULA_NAME DNAwalker-PT-09ringLR-ReachabilityCardinality-7
FORMULA_NAME DNAwalker-PT-09ringLR-ReachabilityCardinality-8
FORMULA_NAME DNAwalker-PT-09ringLR-ReachabilityCardinality-9
=== Now, execution of the tool begins
BK_START 1494867632365
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: DNAwalker_PT_09ringLR
(NrP: 27 NrTr: 260 NrArc: 760)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 1.190sec
parse successfull
net created successfully
Net: DNAwalker_PT_09ringLR
(NrP: 27 NrTr: 260 NrArc: 760)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 3.525sec
RS generation: 0m 1.881sec
-> reachability set: #nodes 1516 (1.5e+03) #states 28,209,796 (7)
starting MCC model checker
--------------------------
checking: AG [~ [3<=A7]]
normalized: ~ [E [true U 3<=A7]]
abstracting: (3<=A7)
states: 0
-> the formula is TRUE
FORMULA DNAwalker-PT-09ringLR-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [3<=A2]
normalized: E [true U 3<=A2]
abstracting: (3<=A2)
states: 0
-> the formula is FALSE
FORMULA DNAwalker-PT-09ringLR-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [1<=A7]
normalized: ~ [E [true U ~ [1<=A7]]]
abstracting: (1<=A7)
states: 28,209,796 (7)
-> the formula is TRUE
FORMULA DNAwalker-PT-09ringLR-ReachabilityCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [3<=A18]
normalized: E [true U 3<=A18]
abstracting: (3<=A18)
states: 0
-> the formula is FALSE
FORMULA DNAwalker-PT-09ringLR-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EF [3<=A4]
normalized: E [true U 3<=A4]
abstracting: (3<=A4)
states: 0
-> the formula is FALSE
FORMULA DNAwalker-PT-09ringLR-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [2<=B10]
normalized: E [true U 2<=B10]
abstracting: (2<=B10)
states: 0
-> the formula is FALSE
FORMULA DNAwalker-PT-09ringLR-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [3<=A13]
normalized: E [true U 3<=A13]
abstracting: (3<=A13)
states: 0
-> the formula is FALSE
FORMULA DNAwalker-PT-09ringLR-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [~ [~ [[1<=A17 | 1<=A20]]]]
normalized: ~ [E [true U ~ [[1<=A17 | 1<=A20]]]]
abstracting: (1<=A20)
states: 9,932,919 (6)
abstracting: (1<=A17)
states: 28,209,796 (7)
-> the formula is TRUE
FORMULA DNAwalker-PT-09ringLR-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.005sec
checking: AG [~ [[3<=A3 & ~ [A9<=B2]]]]
normalized: ~ [E [true U [3<=A3 & ~ [A9<=B2]]]]
abstracting: (A9<=B2)
states: 17,709,710 (7)
abstracting: (3<=A3)
states: 0
-> the formula is TRUE
FORMULA DNAwalker-PT-09ringLR-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EF [~ [[B11<=A5 | [1<=A6 & 1<=B2]]]]
normalized: E [true U ~ [[B11<=A5 | [1<=A6 & 1<=B2]]]]
abstracting: (1<=B2)
states: 8,833,102 (6)
abstracting: (1<=A6)
states: 14,698,688 (7)
abstracting: (B11<=A5)
states: 23,891,706 (7)
-> the formula is TRUE
FORMULA DNAwalker-PT-09ringLR-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.431sec
checking: AG [[1<=A13 | [~ [B2<=A2] | ~ [A7<=A15]]]]
normalized: ~ [E [true U ~ [[[~ [B2<=A2] | ~ [A7<=A15]] | 1<=A13]]]]
abstracting: (1<=A13)
states: 14,054,156 (7)
abstracting: (A7<=A15)
states: 13,242,466 (7)
abstracting: (B2<=A2)
states: 19,376,694 (7)
-> the formula is FALSE
FORMULA DNAwalker-PT-09ringLR-ReachabilityCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.218sec
checking: AG [[[[A16<=A13 | B21<=A4] | 3<=B11] | A2<=A16]]
normalized: ~ [E [true U ~ [[[[A16<=A13 | B21<=A4] | 3<=B11] | A2<=A16]]]]
abstracting: (A2<=A16)
states: 23,008,125 (7)
abstracting: (3<=B11)
states: 0
abstracting: (B21<=A4)
states: 23,837,368 (7)
abstracting: (A16<=A13)
states: 20,099,558 (7)
-> the formula is FALSE
FORMULA DNAwalker-PT-09ringLR-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.350sec
checking: AG [[A15<=A6 | [A6<=A16 | [A21<=A1 | 3<=A14]]]]
normalized: ~ [E [true U ~ [[[[A21<=A1 | 3<=A14] | A6<=A16] | A15<=A6]]]]
abstracting: (A15<=A6)
states: 20,453,064 (7)
abstracting: (A6<=A16)
states: 20,406,654 (7)
abstracting: (3<=A14)
states: 0
abstracting: (A21<=A1)
states: 18,259,191 (7)
-> the formula is FALSE
FORMULA DNAwalker-PT-09ringLR-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.522sec
checking: AG [[[~ [3<=A18] | A11<=B2] & [[3<=B3 | 2<=A3] | [3<=B3 | 1<=A17]]]]
normalized: ~ [E [true U ~ [[[[3<=B3 | 2<=A3] | [3<=B3 | 1<=A17]] & [~ [3<=A18] | A11<=B2]]]]]
abstracting: (A11<=B2)
states: 21,054,774 (7)
abstracting: (3<=A18)
states: 0
abstracting: (1<=A17)
states: 28,209,796 (7)
abstracting: (3<=B3)
states: 0
abstracting: (2<=A3)
states: 942,332 (5)
abstracting: (3<=B3)
states: 0
-> the formula is TRUE
FORMULA DNAwalker-PT-09ringLR-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: AG [[A16<=A19 | [A13<=B3 | [A13<=A17 | A6<=A17]]]]
normalized: ~ [E [true U ~ [[A16<=A19 | [[A13<=A17 | A6<=A17] | A13<=B3]]]]]
abstracting: (A13<=B3)
states: 18,147,522 (7)
abstracting: (A6<=A17)
states: 26,797,958 (7)
abstracting: (A13<=A17)
states: 26,834,258 (7)
abstracting: (A16<=A19)
states: 20,519,286 (7)
-> the formula is TRUE
FORMULA DNAwalker-PT-09ringLR-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.007sec
checking: EF [[[2<=A21 & [B2<=A8 & A8<=B21]] & [[2<=B3 & 3<=A11] | A8<=A12]]]
normalized: E [true U [[[2<=B3 & 3<=A11] | A8<=A12] & [[B2<=A8 & A8<=B21] & 2<=A21]]]
abstracting: (2<=A21)
states: 939,780 (5)
abstracting: (A8<=B21)
states: 17,941,742 (7)
abstracting: (B2<=A8)
states: 23,826,328 (7)
abstracting: (A8<=A12)
states: 20,587,090 (7)
abstracting: (3<=A11)
states: 0
abstracting: (2<=B3)
states: 0
-> the formula is TRUE
FORMULA DNAwalker-PT-09ringLR-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.243sec
totally nodes used: 1197740 (1.2e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 3910269 5223377 9133646
used/not used/entry size/cache size: 6004988 61103876 16 1024MB
basic ops cache: hits/miss/sum: 615812 463278 1079090
used/not used/entry size/cache size: 822116 15955100 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 15847 15397 31244
used/not used/entry size/cache size: 15387 8373221 32 256MB
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 66000939
1 1034861
2 64037
3 5299
4 1916
5 1016
6 492
7 71
8 41
9 17
>= 10 175
Total processing time: 0m11.317sec
BK_STOP 1494867643781
--------------------
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
ptnet_zbdd.cc:255: Boundedness exception: net is not 1-bounded!
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
.........10 9454.........20 1516.................................................10 1534..
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_DNAwalker-PT-09ringLR"
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_DNAwalker-PT-09ringLR.tgz
mv S_DNAwalker-PT-09ringLR 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 S_DNAwalker-PT-09ringLR, 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 r101-blw3-149441598600079"
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 ;