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 S_MAPK-PT-008, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r161kn-blw3-146416418600304
=====================================================================

--------------------
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 1464341355447


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: MAPK_PT_008
(NrP: 22 NrTr: 30 NrArc: 90)

net check time: 0m 0.000sec

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec

init dd package: 0m 3.781sec


RS generation: 0m 0.009sec


-> reachability set: #nodes 259 (2.6e+02) #states 6,110,643 (6)



starting MCC model checker
--------------------------

checking: EF [~ [~ [2<=ERKP_MEKPP]]]
normalized: E [true U 2<=ERKP_MEKPP]

abstracting: (2<=ERKP_MEKPP) states: 235,725 (5)
-> the formula is TRUE

FORMULA MAPK-PT-008-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.018sec

checking: EF [3<=MEKPP]
normalized: E [true U 3<=MEKPP]

abstracting: (3<=MEKPP) states: 171,990 (5)
-> the formula is TRUE

FORMULA MAPK-PT-008-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.025sec

checking: EF [ERK<=RasGTP]
normalized: E [true U ERK<=RasGTP]

abstracting: (ERK<=RasGTP) states: 4,247,558 (6)
-> the formula is TRUE

FORMULA MAPK-PT-008-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

checking: EF [~ [[2<=Phase1 | ~ [Raf<=ERK]]]]
normalized: E [true U ~ [[2<=Phase1 | ~ [Raf<=ERK]]]]

abstracting: (Raf<=ERK) states: 2,634,993 (6)
abstracting: (2<=Phase1) states: 5,416,560 (6)
-> the formula is TRUE

FORMULA MAPK-PT-008-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.022sec

checking: AG [~ [[[2<=ERKPP_Phase3 & 1<=Phase1] & 2<=ERKP_Phase3]]]
normalized: ~ [E [true U [2<=ERKP_Phase3 & [2<=ERKPP_Phase3 & 1<=Phase1]]]]

abstracting: (1<=Phase1) states: 5,858,193 (6)
abstracting: (2<=ERKPP_Phase3) states: 1,848,380 (6)
abstracting: (2<=ERKP_Phase3) states: 1,848,380 (6)
-> the formula is FALSE

FORMULA MAPK-PT-008-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: AG [~ [[3<=MEKPP_Phase2 | [2<=Phase3 & 3<=ERKPP]]]]
normalized: ~ [E [true U [3<=MEKPP_Phase2 | [2<=Phase3 & 3<=ERKPP]]]]

abstracting: (3<=ERKPP) states: 863,522 (5)
abstracting: (2<=Phase3) states: 5,592,950 (6)
abstracting: (3<=MEKPP_Phase2) states: 171,990 (5)
-> the formula is FALSE

FORMULA MAPK-PT-008-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.016sec

checking: EF [~ [[RasGTP<=MEKP_Phase2 | ~ [Phase3<=MEKPP_Phase2]]]]
normalized: E [true U ~ [[RasGTP<=MEKP_Phase2 | ~ [Phase3<=MEKPP_Phase2]]]]

abstracting: (Phase3<=MEKPP_Phase2) states: 421,741 (5)
abstracting: (RasGTP<=MEKP_Phase2) states: 2,639,546 (6)
-> the formula is TRUE

FORMULA MAPK-PT-008-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.025sec

checking: EF [~ [[[2<=ERKPP | 2<=ERK] & MEKPP_Phase2<=ERK]]]
normalized: E [true U ~ [[MEKPP_Phase2<=ERK & [2<=ERKPP | 2<=ERK]]]]

abstracting: (2<=ERK) states: 1,848,380 (6)
abstracting: (2<=ERKPP) states: 1,848,380 (6)
abstracting: (MEKPP_Phase2<=ERK) states: 4,889,661 (6)
-> the formula is TRUE

FORMULA MAPK-PT-008-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.024sec

checking: AG [~ [[[3<=MEK & ERK<=MEKP] & MEK<=MEK_RafP]]]
normalized: ~ [E [true U [MEK<=MEK_RafP & [3<=MEK & ERK<=MEKP]]]]

abstracting: (ERK<=MEKP) states: 3,378,312 (6)
abstracting: (3<=MEK) states: 171,990 (5)
abstracting: (MEK<=MEK_RafP) states: 4,213,167 (6)
-> the formula is TRUE

FORMULA MAPK-PT-008-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [~ [[[2<=ERKP_MEKPP | 3<=ERK_MEKPP] & [1<=ERK | MEK<=Raf]]]]
normalized: ~ [E [true U [[1<=ERK | MEK<=Raf] & [2<=ERKP_MEKPP | 3<=ERK_MEKPP]]]]

abstracting: (3<=ERK_MEKPP) states: 27,405 (4)
abstracting: (2<=ERKP_MEKPP) states: 235,725 (5)
abstracting: (MEK<=Raf) states: 5,402,607 (6)
abstracting: (1<=ERK) states: 3,510,710 (6)
-> the formula is FALSE

FORMULA MAPK-PT-008-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.018sec

checking: AG [[~ [2<=ERKP_MEKPP] | [[ERKP<=ERKP & MEKPP<=MEKPP_Phase2] & ~ [3<=ERKP_Phase3]]]]
normalized: ~ [E [true U ~ [[[~ [3<=ERKP_Phase3] & [ERKP<=ERKP & MEKPP<=MEKPP_Phase2]] | ~ [2<=ERKP_MEKPP]]]]]

abstracting: (2<=ERKP_MEKPP) states: 235,725 (5)
abstracting: (MEKPP<=MEKPP_Phase2) states: 4,346,475 (6)
abstracting: (ERKP<=ERKP) states: 6,110,643 (6)
abstracting: (3<=ERKP_Phase3) states: 863,522 (5)
-> the formula is FALSE

FORMULA MAPK-PT-008-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: AG [[[2<=MEKP & ~ [2<=Raf]] | [[3<=Phase2 | Raf<=MEKPP_Phase2] | 1<=Raf]]]
normalized: ~ [E [true U ~ [[[2<=MEKP & ~ [2<=Raf]] | [1<=Raf | [3<=Phase2 | Raf<=MEKPP_Phase2]]]]]]

abstracting: (Raf<=MEKPP_Phase2) states: 2,047,605 (6)
abstracting: (3<=Phase2) states: 4,222,155 (6)
abstracting: (1<=Raf) states: 4,701,298 (6)
abstracting: (2<=Raf) states: 3,429,032 (6)
abstracting: (2<=MEKP) states: 744,156 (5)
-> the formula is TRUE

FORMULA MAPK-PT-008-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EF [[[[1<=Phase2 | RafP_Phase1<=ERK] & [ERKPP_Phase3<=RafP_Phase1 & 1<=MEKP_RafP]] & 3<=MEKPP_Phase2]]
normalized: E [true U [3<=MEKPP_Phase2 & [[ERKPP_Phase3<=RafP_Phase1 & 1<=MEKP_RafP] & [1<=Phase2 | RafP_Phase1<=ERK]]]]

abstracting: (RafP_Phase1<=ERK) states: 2,757,588 (6)
abstracting: (1<=Phase2) states: 6,000,393 (6)
abstracting: (1<=MEKP_RafP) states: 1,831,956 (6)
abstracting: (ERKPP_Phase3<=RafP_Phase1) states: 4,631,478 (6)
abstracting: (3<=MEKPP_Phase2) states: 171,990 (5)
-> the formula is TRUE

FORMULA MAPK-PT-008-ReachabilityCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.030sec

checking: EF [[[[3<=MEKPP_Phase2 & MEKPP<=ERK] | 2<=ERKP] & [~ [2<=MEKPP] & ~ [ERK_MEKPP<=MEK]]]]
normalized: E [true U [[~ [ERK_MEKPP<=MEK] & ~ [2<=MEKPP]] & [2<=ERKP | [3<=MEKPP_Phase2 & MEKPP<=ERK]]]]

abstracting: (MEKPP<=ERK) states: 4,889,661 (6)
abstracting: (3<=MEKPP_Phase2) states: 171,990 (5)
abstracting: (2<=ERKP) states: 1,848,380 (6)
abstracting: (2<=MEKPP) states: 744,156 (5)
abstracting: (ERK_MEKPP<=MEK) states: 5,129,901 (6)
-> the formula is TRUE

FORMULA MAPK-PT-008-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.027sec

checking: EF [[~ [[ERK_MEKPP<=MEK | 2<=Raf]] & [[2<=MEKPP_Phase2 | 2<=MEKPP] | [2<=MEKP_RafP | Raf<=MEKPP_Phase2]]]]
normalized: E [true U [[[2<=MEKP_RafP | Raf<=MEKPP_Phase2] | [2<=MEKPP_Phase2 | 2<=MEKPP]] & ~ [[ERK_MEKPP<=MEK | 2<=Raf]]]]

abstracting: (2<=Raf) states: 3,429,032 (6)
abstracting: (ERK_MEKPP<=MEK) states: 5,129,901 (6)
abstracting: (2<=MEKPP) states: 744,156 (5)
abstracting: (2<=MEKPP_Phase2) states: 744,156 (5)
abstracting: (Raf<=MEKPP_Phase2) states: 2,047,605 (6)
abstracting: (2<=MEKP_RafP) states: 434,994 (5)
-> the formula is TRUE

FORMULA MAPK-PT-008-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.016sec

checking: AG [[~ [[ERKP_MEKPP<=MEKP_RafP & 2<=ERKPP]] | [[3<=ERKP & Phase2<=ERK] | [MEKP_RafP<=Raf_RasGTP & 2<=Raf_RasGTP]]]]
normalized: ~ [E [true U ~ [[[[MEKP_RafP<=Raf_RasGTP & 2<=Raf_RasGTP] | [3<=ERKP & Phase2<=ERK]] | ~ [[ERKP_MEKPP<=MEKP_RafP & 2<=ERKPP]]]]]]

abstracting: (2<=ERKPP) states: 1,848,380 (6)
abstracting: (ERKP_MEKPP<=MEKP_RafP) states: 5,044,452 (6)
abstracting: (Phase2<=ERK) states: 1,207,565 (6)
abstracting: (3<=ERKP) states: 863,522 (5)
abstracting: (2<=Raf_RasGTP) states: 1,552,180 (6)
abstracting: (MEKP_RafP<=Raf_RasGTP) states: 5,168,177 (6)
-> the formula is FALSE

FORMULA MAPK-PT-008-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.013sec


Total processing time: 0m 5.395sec


BK_STOP 1464341360876

--------------------
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.002sec

257
iterations count:1074 (35), effective:172 (5)

initing FirstDep: 0m 0.000sec


iterations count:398 (13), effective:62 (2)

iterations count:276 (9), effective:42 (1)

iterations count:338 (11), effective:54 (1)

iterations count:115 (3), effective:21 (0)

iterations count:625 (20), effective:99 (3)

iterations count:276 (9), effective:42 (1)

iterations count:580 (19), effective:95 (3)

iterations count:707 (23), effective:115 (3)

iterations count:632 (21), effective:105 (3)

iterations count:487 (16), effective:77 (2)

iterations count:424 (14), effective:74 (2)

iterations count:594 (19), effective:99 (3)

iterations count:252 (8), effective:45 (1)

iterations count:566 (18), effective:91 (3)

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_MAPK-PT-008"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/home/hulinhub/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_MAPK-PT-008.tgz
mv S_MAPK-PT-008 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 S_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 r161kn-blw3-146416418600304"
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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;