About the Execution of Marcie for ERK-PT-000100
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
6380.300 | 35228.00 | 34949.00 | 109.70 | TFTFFFFTTTFFTTFF | 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 ERK-PT-000100, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r041kn-smll-146351484500106
=====================================================================
--------------------
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 ERK-PT-000100-ReachabilityCardinality-0
FORMULA_NAME ERK-PT-000100-ReachabilityCardinality-1
FORMULA_NAME ERK-PT-000100-ReachabilityCardinality-10
FORMULA_NAME ERK-PT-000100-ReachabilityCardinality-11
FORMULA_NAME ERK-PT-000100-ReachabilityCardinality-12
FORMULA_NAME ERK-PT-000100-ReachabilityCardinality-13
FORMULA_NAME ERK-PT-000100-ReachabilityCardinality-14
FORMULA_NAME ERK-PT-000100-ReachabilityCardinality-15
FORMULA_NAME ERK-PT-000100-ReachabilityCardinality-2
FORMULA_NAME ERK-PT-000100-ReachabilityCardinality-3
FORMULA_NAME ERK-PT-000100-ReachabilityCardinality-4
FORMULA_NAME ERK-PT-000100-ReachabilityCardinality-5
FORMULA_NAME ERK-PT-000100-ReachabilityCardinality-6
FORMULA_NAME ERK-PT-000100-ReachabilityCardinality-7
FORMULA_NAME ERK-PT-000100-ReachabilityCardinality-8
FORMULA_NAME ERK-PT-000100-ReachabilityCardinality-9
=== Now, execution of the tool begins
BK_START 1463532439007
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=ReachabilityCardinality.xml --mcc-mode --memory=6 --suppress
parse successfull
net created successfully
Net: ERK_PT_000100
(NrP: 11 NrTr: 11 NrArc: 34)
net check time: 0m 0.000sec
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
init dd package: 0m 3.893sec
RS generation: 0m 0.053sec
-> reachability set: #nodes 1011 (1.0e+03) #states 15,914,114,086 (10)
starting MCC model checker
--------------------------
checking: AG [1<=RP]
normalized: ~ [E [true U ~ [1<=RP]]]
abstracting: (1<=RP) states: 15,914,108,935 (10)
-> the formula is FALSE
FORMULA ERK-PT-000100-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.066sec
checking: AG [3<=RP]
normalized: ~ [E [true U ~ [3<=RP]]]
abstracting: (3<=RP) states: 15,914,037,426 (10)
-> the formula is FALSE
FORMULA ERK-PT-000100-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AG [3<=MEKPP]
normalized: ~ [E [true U ~ [3<=MEKPP]]]
abstracting: (3<=MEKPP) states: 15,912,371,230 (10)
-> the formula is FALSE
FORMULA ERK-PT-000100-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.113sec
checking: AG [~ [Raf1Star<=RKIPP_RP]]
normalized: ~ [E [true U Raf1Star<=RKIPP_RP]]
abstracting: (Raf1Star<=RKIPP_RP) states: 13,440,676 (7)
-> the formula is FALSE
FORMULA ERK-PT-000100-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.243sec
checking: EF [~ [ERKPP<=RKIP]]
normalized: E [true U ~ [ERKPP<=RKIP]]
abstracting: (ERKPP<=RKIP) states: 6,533,937,046 (9)
-> the formula is TRUE
FORMULA ERK-PT-000100-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.524sec
checking: EF [Raf1Star<=Raf1Star_RKIP_ERKPP]
normalized: E [true U Raf1Star<=Raf1Star_RKIP_ERKPP]
abstracting: (Raf1Star<=Raf1Star_RKIP_ERKPP) states: 862,451,616 (8)
-> the formula is TRUE
FORMULA ERK-PT-000100-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.339sec
checking: EF [RKIP<=Raf1Star_RKIP_ERKPP]
normalized: E [true U RKIP<=Raf1Star_RKIP_ERKPP]
abstracting: (RKIP<=Raf1Star_RKIP_ERKPP) states: 6,338,798,466 (9)
-> the formula is TRUE
FORMULA ERK-PT-000100-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.408sec
checking: AG [RKIPP_RP<=ERK]
normalized: ~ [E [true U ~ [RKIPP_RP<=ERK]]]
abstracting: (RKIPP_RP<=ERK) states: 9,660,662,726 (9)
-> the formula is FALSE
FORMULA ERK-PT-000100-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.179sec
checking: AG [[RKIPP<=MEKPP | 2<=RKIPP]]
normalized: ~ [E [true U ~ [[RKIPP<=MEKPP | 2<=RKIPP]]]]
abstracting: (2<=RKIPP) states: 14,823,650,820 (10)
abstracting: (RKIPP<=MEKPP) states: 15,085,887,856 (10)
-> the formula is FALSE
FORMULA ERK-PT-000100-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 3.148sec
checking: EF [~ [[[1<=RP & RKIPP_RP<=RKIPP_RP] | ~ [3<=RKIPP_RP]]]]
normalized: E [true U ~ [[~ [3<=RKIPP_RP] | [1<=RP & RKIPP_RP<=RKIPP_RP]]]]
abstracting: (RKIPP_RP<=RKIPP_RP) states: 15,914,114,086 (10)
abstracting: (1<=RP) states: 15,914,108,935 (10)
abstracting: (3<=RKIPP_RP) states: 14,298,403,350 (10)
-> the formula is TRUE
FORMULA ERK-PT-000100-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.006sec
checking: AG [[~ [Raf1Star_RKIP<=RKIPP_RP] | Raf1Star_RKIP<=RP]]
normalized: ~ [E [true U ~ [[Raf1Star_RKIP<=RP | ~ [Raf1Star_RKIP<=RKIPP_RP]]]]]
abstracting: (Raf1Star_RKIP<=RKIPP_RP) states: 8,096,736,336 (9)
abstracting: (Raf1Star_RKIP<=RP) states: 15,914,114,086 (10)
-> the formula is TRUE
FORMULA ERK-PT-000100-ReachabilityCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.957sec
checking: EF [[RKIPP_RP<=RKIPP & MEKPP<=RKIPP_RP]]
normalized: E [true U [RKIPP_RP<=RKIPP & MEKPP<=RKIPP_RP]]
abstracting: (MEKPP<=RKIPP_RP) states: 877,678,516 (8)
abstracting: (RKIPP_RP<=RKIPP) states: 8,096,736,336 (9)
-> the formula is TRUE
FORMULA ERK-PT-000100-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 7.081sec
checking: AG [[[2<=MEKPP | ~ [Raf1Star_RKIP<=MEKPP]] & ~ [~ [3<=MEKPP]]]]
normalized: ~ [E [true U ~ [[3<=MEKPP & [2<=MEKPP | ~ [Raf1Star_RKIP<=MEKPP]]]]]]
abstracting: (Raf1Star_RKIP<=MEKPP) states: 15,085,887,856 (10)
abstracting: (2<=MEKPP) states: 15,913,411,833 (10)
abstracting: (3<=MEKPP) states: 15,912,371,230 (10)
-> the formula is FALSE
FORMULA ERK-PT-000100-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.165sec
checking: AG [~ [[~ [3<=RKIPP_RP] & [1<=RP & RKIP<=ERKPP]]]]
normalized: ~ [E [true U [~ [3<=RKIPP_RP] & [1<=RP & RKIP<=ERKPP]]]]
abstracting: (RKIP<=ERKPP) states: 9,660,662,726 (9)
abstracting: (1<=RP) states: 15,914,108,935 (10)
abstracting: (3<=RKIPP_RP) states: 14,298,403,350 (10)
-> the formula is FALSE
FORMULA ERK-PT-000100-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.615sec
checking: AG [[[[MEKPP_ERK<=RP | 1<=Raf1Star_RKIP] & [ERK<=ERK | MEKPP_ERK<=ERKPP]] | ~ [2<=RKIPP]]]
normalized: ~ [E [true U ~ [[~ [2<=RKIPP] | [[ERK<=ERK | MEKPP_ERK<=ERKPP] & [MEKPP_ERK<=RP | 1<=Raf1Star_RKIP]]]]]]
abstracting: (1<=Raf1Star_RKIP) states: 15,362,162,115 (10)
abstracting: (MEKPP_ERK<=RP) states: 15,085,887,856 (10)
abstracting: (MEKPP_ERK<=ERKPP) states: 8,050,755,076 (9)
abstracting: (ERK<=ERK) states: 15,914,114,086 (10)
abstracting: (2<=RKIPP) states: 14,823,650,820 (10)
-> the formula is FALSE
FORMULA ERK-PT-000100-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m11.224sec
checking: EF [[[[1<=Raf1Star_RKIP | RKIPP<=RKIPP] & [RKIP<=ERK | 2<=ERKPP]] & [1<=RP & ~ [3<=RP]]]]
normalized: E [true U [[1<=RP & ~ [3<=RP]] & [[RKIP<=ERK | 2<=ERKPP] & [1<=Raf1Star_RKIP | RKIPP<=RKIPP]]]]
abstracting: (RKIPP<=RKIPP) states: 15,914,114,086 (10)
abstracting: (1<=Raf1Star_RKIP) states: 15,362,162,115 (10)
abstracting: (2<=ERKPP) states: 15,173,815,800 (10)
abstracting: (RKIP<=ERK) states: 9,660,662,726 (9)
abstracting: (3<=RP) states: 15,914,037,426 (10)
abstracting: (1<=RP) states: 15,914,108,935 (10)
-> the formula is TRUE
FORMULA ERK-PT-000100-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.175sec
Total processing time: 0m35.156sec
BK_STOP 1463532474235
--------------------
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
719 939
iterations count:2411 (219), effective:800 (72)
initing FirstDep: 0m 0.000sec
661 1011
iterations count:2011 (182), effective:600 (54)
675
iterations count:1971 (179), effective:588 (53)
10584 2276
iterations count:2069 (188), effective:588 (53)
iterations count:611 (55), effective:200 (18)
iterations count:417 (37), effective:202 (18)
iterations count:811 (73), effective:300 (27)
iterations count:461 (41), effective:200 (18)
iterations count:131 (11), effective:106 (9)
13445 25220
iterations count:2412 (219), effective:701 (63)
661 1011
iterations count:2011 (182), effective:600 (54)
28764 4341
iterations count:2111 (191), effective:650 (59)
10584 2276
iterations count:2069 (188), effective:588 (53)
iterations count:803 (73), effective:298 (27)
24958 25722
iterations count:2414 (219), effective:751 (68)
777
iterations count:1979 (179), effective:591 (53)
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="ERK-PT-000100"
export BK_EXAMINATION="ReachabilityCardinality"
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/ERK-PT-000100.tgz
mv ERK-PT-000100 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 ERK-PT-000100, 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 r041kn-smll-146351484500106"
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 ;