About the Execution of Marcie for MAPK-PT-008
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
3973.120 | 68081.00 | 68040.00 | 19.80 | TTTFFTFFTFFFTTFF | 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-2265
Executing tool marcie
Input is MAPK-PT-008, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r050kn-ebro-143236504000724
=====================================================================
--------------------
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 MAPK-PT-008-ReachabilityCardinality-0
FORMULA_NAME MAPK-PT-008-ReachabilityCardinality-1
FORMULA_NAME MAPK-PT-008-ReachabilityCardinality-10
FORMULA_NAME MAPK-PT-008-ReachabilityCardinality-11
FORMULA_NAME MAPK-PT-008-ReachabilityCardinality-12
FORMULA_NAME MAPK-PT-008-ReachabilityCardinality-13
FORMULA_NAME MAPK-PT-008-ReachabilityCardinality-14
FORMULA_NAME MAPK-PT-008-ReachabilityCardinality-15
FORMULA_NAME MAPK-PT-008-ReachabilityCardinality-2
FORMULA_NAME MAPK-PT-008-ReachabilityCardinality-3
FORMULA_NAME MAPK-PT-008-ReachabilityCardinality-4
FORMULA_NAME MAPK-PT-008-ReachabilityCardinality-5
FORMULA_NAME MAPK-PT-008-ReachabilityCardinality-6
FORMULA_NAME MAPK-PT-008-ReachabilityCardinality-7
FORMULA_NAME MAPK-PT-008-ReachabilityCardinality-8
FORMULA_NAME MAPK-PT-008-ReachabilityCardinality-9
=== Now, execution of the tool begins
BK_START 1432548899368
Model: MAPK-PT-008
reachability algorithm:
Saturation-based algorithm
variable ordering algorithm:
Calculated like in [Noa99]
--memory=6 --suppress --rs-algorithm=3 --place-order=5
Marcie rev. 1429:1432M (built: crohr on 2014-10-22)
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 --suppress --rs-algorithm=3 --place-order=5
parse successfull
net created successfully
(NrP: 22 NrTr: 30 NrArc: 90)
net check time: 0m0sec
parse formulas successfull
formulas created successfully
place and transition orderings generation:0m0sec
init dd package: 0m6sec
RS generation: 0m0sec
-> reachability set: #nodes 667 (6.7e+02) #states 6,110,643 (6)
starting MCC model checker
--------------------------
checking: EF [[Raf_RasGTP<=RafP & [[ERK_MEKPP<=MEKP_RafP & ERKP_MEKPP<=MEK_RafP] & [2<=ERKPP_Phase3 & 2<=RasGTP]]]]
normalized: E [true U [Raf_RasGTP<=RafP & [[2<=ERKPP_Phase3 & 2<=RasGTP] & [ERK_MEKPP<=MEKP_RafP & ERKP_MEKPP<=MEK_RafP]]]]
abstracting: (ERKP_MEKPP<=MEK_RafP) states: 5,044,452 (6)
abstracting: (ERK_MEKPP<=MEKP_RafP) states: 5,044,452 (6)
abstracting: (2<=RasGTP) states: 2,528,288 (6)
abstracting: (2<=ERKPP_Phase3) states: 1,848,380 (6)
abstracting: (Raf_RasGTP<=RafP) states: 4,838,377 (6)
-> the formula is TRUE
FORMULA MAPK-PT-008-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m13sec
checking: AG [ERKPP_Phase3<=ERKPP_Phase3]
normalized: ~ [E [true U ~ [ERKPP_Phase3<=ERKPP_Phase3]]]
abstracting: (ERKPP_Phase3<=ERKPP_Phase3) states: 6,110,643 (6)
-> the formula is TRUE
FORMULA MAPK-PT-008-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: EF [[[Phase1<=ERKP & ~ [ERKPP_Phase3<=MEK]] & [~ [3<=Raf] | ~ [3<=ERK_MEKPP]]]]
normalized: E [true U [[~ [3<=ERK_MEKPP] | ~ [3<=Raf]] & [Phase1<=ERKP & ~ [ERKPP_Phase3<=MEK]]]]
abstracting: (ERKPP_Phase3<=MEK) states: 3,378,312 (6)
abstracting: (Phase1<=ERKP) states: 910,315 (5)
abstracting: (3<=Raf) states: 2,345,930 (6)
abstracting: (3<=ERK_MEKPP) states: 27,405 (4)
-> the formula is TRUE
FORMULA MAPK-PT-008-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m2sec
checking: AG [~ [~ [[2<=ERKP | 2<=Phase1]]]]
normalized: ~ [E [true U ~ [[2<=ERKP | 2<=Phase1]]]]
abstracting: (2<=Phase1) states: 5,416,560 (6)
abstracting: (2<=ERKP) states: 1,848,380 (6)
-> the formula is FALSE
FORMULA MAPK-PT-008-ReachabilityCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AG [MEKP<=Phase3]
normalized: ~ [E [true U ~ [MEKP<=Phase3]]]
abstracting: (MEKP<=Phase3) states: 5,975,888 (6)
-> the formula is FALSE
FORMULA MAPK-PT-008-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AG [[[[3<=MEK | ERKP_Phase3<=Phase1] | ERK_MEKPP<=ERKP] | 1<=MEK_RafP]]
normalized: ~ [E [true U ~ [[1<=MEK_RafP | [ERK_MEKPP<=ERKP | [3<=MEK | ERKP_Phase3<=Phase1]]]]]]
abstracting: (ERKP_Phase3<=Phase1) states: 5,672,318 (6)
abstracting: (3<=MEK) states: 171,990 (5)
abstracting: (ERK_MEKPP<=ERKP) states: 5,401,147 (6)
abstracting: (1<=MEK_RafP) states: 1,831,956 (6)
-> the formula is FALSE
FORMULA MAPK-PT-008-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m11sec
checking: EF [[1<=RafP_Phase1 & [[3<=ERKPP & 2<=Phase2] & [2<=ERKP | ERKPP_Phase3<=RafP]]]]
normalized: E [true U [1<=RafP_Phase1 & [[2<=ERKP | ERKPP_Phase3<=RafP] & [3<=ERKPP & 2<=Phase2]]]]
abstracting: (2<=Phase2) states: 5,488,833 (6)
abstracting: (3<=ERKPP) states: 863,522 (5)
abstracting: (ERKPP_Phase3<=RafP) states: 4,700,658 (6)
abstracting: (2<=ERKP) states: 1,848,380 (6)
abstracting: (1<=RafP_Phase1) states: 4,594,323 (6)
-> the formula is TRUE
FORMULA MAPK-PT-008-ReachabilityCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: EF [[~ [[1<=ERKP | Raf_RasGTP<=Raf]] & 2<=RafP_Phase1]]
normalized: E [true U [2<=RafP_Phase1 & ~ [[1<=ERKP | Raf_RasGTP<=Raf]]]]
abstracting: (Raf_RasGTP<=Raf) states: 4,838,377 (6)
abstracting: (1<=ERKP) states: 3,510,710 (6)
abstracting: (2<=RafP_Phase1) states: 3,294,612 (6)
-> the formula is TRUE
FORMULA MAPK-PT-008-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AG [[[[RafP_Phase1<=ERKP_Phase3 & 1<=Phase3] | [2<=ERKP_Phase3 | 2<=Raf]] | [[Phase1<=Phase2 & ERKPP_Phase3<=MEKPP] | 3<=MEKP_Phase2]]]
normalized: ~ [E [true U ~ [[[3<=MEKP_Phase2 | [Phase1<=Phase2 & ERKPP_Phase3<=MEKPP]] | [[2<=ERKP_Phase3 | 2<=Raf] | [RafP_Phase1<=ERKP_Phase3 & 1<=Phase3]]]]]]
abstracting: (1<=Phase3) states: 5,990,348 (6)
abstracting: (RafP_Phase1<=ERKP_Phase3) states: 2,757,588 (6)
abstracting: (2<=Raf) states: 3,429,032 (6)
abstracting: (2<=ERKP_Phase3) states: 1,848,380 (6)
abstracting: (ERKPP_Phase3<=MEKPP) states: 3,378,312 (6)
abstracting: (Phase1<=Phase2) states: 2,245,788 (6)
abstracting: (3<=MEKP_Phase2) states: 171,990 (5)
-> the formula is FALSE
FORMULA MAPK-PT-008-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m7sec
checking: AG [[[ERKP_Phase3<=MEK & [1<=ERKP_MEKPP | 1<=Phase1]] | [[2<=MEKPP & 2<=MEK_RafP] & [1<=MEK & MEKPP_Phase2<=MEK_RafP]]]]
normalized: ~ [E [true U ~ [[[ERKP_Phase3<=MEK & [1<=ERKP_MEKPP | 1<=Phase1]] | [[2<=MEKPP & 2<=MEK_RafP] & [1<=MEK & MEKPP_Phase2<=MEK_RafP]]]]]]
abstracting: (MEKPP_Phase2<=MEK_RafP) states: 4,213,167 (6)
abstracting: (1<=MEK) states: 2,358,384 (6)
abstracting: (2<=MEK_RafP) states: 434,994 (5)
abstracting: (2<=MEKPP) states: 744,156 (5)
abstracting: (1<=Phase1) states: 5,858,193 (6)
abstracting: (1<=ERKP_MEKPP) states: 1,368,759 (6)
abstracting: (ERKP_Phase3<=MEK) states: 3,378,312 (6)
-> the formula is FALSE
FORMULA MAPK-PT-008-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m1sec
checking: EF [2<=ERKPP_Phase3]
normalized: E [true U 2<=ERKPP_Phase3]
abstracting: (2<=ERKPP_Phase3) states: 1,848,380 (6)
-> the formula is TRUE
FORMULA MAPK-PT-008-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AG [[~ [3<=Phase3] | [~ [3<=MEKP_RafP] | MEKP_Phase2<=ERK]]]
normalized: ~ [E [true U ~ [[[MEKP_Phase2<=ERK | ~ [3<=MEKP_RafP]] | ~ [3<=Phase3]]]]]
abstracting: (3<=Phase3) states: 4,818,125 (6)
abstracting: (3<=MEKP_RafP) states: 72,912 (4)
abstracting: (MEKP_Phase2<=ERK) states: 4,889,661 (6)
-> the formula is FALSE
FORMULA MAPK-PT-008-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m8sec
checking: AG [~ [[[3<=ERKPP & 3<=ERKP_Phase3] & ~ [2<=MEKP]]]]
normalized: ~ [E [true U [~ [2<=MEKP] & [3<=ERKPP & 3<=ERKP_Phase3]]]]
abstracting: (3<=ERKP_Phase3) states: 863,522 (5)
abstracting: (3<=ERKPP) states: 863,522 (5)
abstracting: (2<=MEKP) states: 744,156 (5)
-> the formula is FALSE
FORMULA MAPK-PT-008-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: EF [3<=ERKP_Phase3]
normalized: E [true U 3<=ERKP_Phase3]
abstracting: (3<=ERKP_Phase3) states: 863,522 (5)
-> the formula is TRUE
FORMULA MAPK-PT-008-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AG [[ERKPP<=Raf_RasGTP | ERKP<=MEKPP]]
normalized: ~ [E [true U ~ [[ERKPP<=Raf_RasGTP | ERKP<=MEKPP]]]]
abstracting: (ERKP<=MEKPP) states: 3,378,312 (6)
abstracting: (ERKPP<=Raf_RasGTP) states: 3,824,610 (6)
-> the formula is FALSE
FORMULA MAPK-PT-008-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m6sec
checking: AG [ERKP_MEKPP<=Raf]
normalized: ~ [E [true U ~ [ERKP_MEKPP<=Raf]]]
abstracting: (ERKP_MEKPP<=Raf) states: 5,752,573 (6)
-> the formula is FALSE
FORMULA MAPK-PT-008-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m4sec
Total processing time: 1m8sec
BK_STOP 1432548967449
--------------------
content from stderr:
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: 0m0sec
iterations count:761 (25), effective:112 (3)
initing FirstDep: 0m0sec
iterations count:174 (5), effective:24 (0)
iterations count:514 (17), effective:73 (2)
iterations count:119 (3), effective:12 (0)
iterations count:223 (7), effective:42 (1)
iterations count:283 (9), effective:38 (1)
iterations count:305 (10), effective:46 (1)
iterations count:134 (4), effective:15 (0)
iterations count:320 (10), effective:54 (1)
iterations count:155 (5), effective:22 (0)
iterations count:169 (5), effective:22 (0)
iterations count:318 (10), effective:52 (1)
iterations count:260 (8), effective:42 (1)
iterations count:146 (4), effective:19 (0)
iterations count:273 (9), effective:42 (1)
iterations count:338 (11), effective:37 (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="MAPK-PT-008"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/users/gast00/fkordon/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/MAPK-PT-008.tgz
mv MAPK-PT-008 execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2265"
echo " Executing tool marcie"
echo " Input is MAPK-PT-008, 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 r050kn-ebro-143236504000724"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "ReachabilityComputeBounds" ] ; 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 ;