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 CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r161kn-blw3-146416418600300
=====================================================================

--------------------
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-CTLCardinality-0
FORMULA_NAME MAPK-PT-008-CTLCardinality-1
FORMULA_NAME MAPK-PT-008-CTLCardinality-10
FORMULA_NAME MAPK-PT-008-CTLCardinality-11
FORMULA_NAME MAPK-PT-008-CTLCardinality-12
FORMULA_NAME MAPK-PT-008-CTLCardinality-13
FORMULA_NAME MAPK-PT-008-CTLCardinality-14
FORMULA_NAME MAPK-PT-008-CTLCardinality-15
FORMULA_NAME MAPK-PT-008-CTLCardinality-2
FORMULA_NAME MAPK-PT-008-CTLCardinality-3
FORMULA_NAME MAPK-PT-008-CTLCardinality-4
FORMULA_NAME MAPK-PT-008-CTLCardinality-5
FORMULA_NAME MAPK-PT-008-CTLCardinality-6
FORMULA_NAME MAPK-PT-008-CTLCardinality-7
FORMULA_NAME MAPK-PT-008-CTLCardinality-8
FORMULA_NAME MAPK-PT-008-CTLCardinality-9

=== Now, execution of the tool begins

BK_START 1464341348746


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=CTLCardinality.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.648sec


RS generation: 0m 0.009sec


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



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

checking: AF [EF [~ [2<=Phase3]]]
normalized: ~ [EG [~ [E [true U ~ [2<=Phase3]]]]]

abstracting: (2<=Phase3) states: 5,592,950 (6)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.012sec

checking: EF [AG [ERKP<=MEK]]
normalized: E [true U ~ [E [true U ~ [ERKP<=MEK]]]]

abstracting: (ERKP<=MEK) states: 3,378,312 (6)
-> the formula is FALSE

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

MC time: 0m 0.011sec

checking: EF [EX [[3<=RasGTP & 3<=ERKP_Phase3]]]
normalized: E [true U EX [[3<=RasGTP & 3<=ERKP_Phase3]]]

abstracting: (3<=ERKP_Phase3) states: 863,522 (5)
abstracting: (3<=RasGTP) states: 0
.-> the formula is FALSE

FORMULA MAPK-PT-008-CTLCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [~ [EX [MEKP<=MEKP]]]
normalized: E [true U ~ [EX [MEKP<=MEKP]]]

abstracting: (MEKP<=MEKP) states: 6,110,643 (6)
.-> the formula is FALSE

FORMULA MAPK-PT-008-CTLCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[AF [3<=MEKP_RafP] | EG [3<=ERKP]]]
normalized: E [true U [~ [EG [~ [3<=MEKP_RafP]]] | EG [3<=ERKP]]]

abstracting: (3<=ERKP) states: 863,522 (5)
.
EG iterations: 1
abstracting: (3<=MEKP_RafP) states: 72,912 (4)
.
EG iterations: 1
-> the formula is TRUE

FORMULA MAPK-PT-008-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.025sec

checking: [1<=MEK_RafP | EF [AG [ERKP_Phase3<=MEKP_Phase2]]]
normalized: [1<=MEK_RafP | E [true U ~ [E [true U ~ [ERKP_Phase3<=MEKP_Phase2]]]]]

abstracting: (ERKP_Phase3<=MEKP_Phase2) states: 3,378,312 (6)
abstracting: (1<=MEK_RafP) states: 1,831,956 (6)
-> the formula is FALSE

FORMULA MAPK-PT-008-CTLCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: EF [AG [[MEKPP<=ERKPP | 1<=RafP_Phase1]]]
normalized: E [true U ~ [E [true U ~ [[MEKPP<=ERKPP | 1<=RafP_Phase1]]]]]

abstracting: (1<=RafP_Phase1) states: 4,594,323 (6)
abstracting: (MEKPP<=ERKPP) states: 4,889,661 (6)
-> the formula is FALSE

FORMULA MAPK-PT-008-CTLCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.036sec

checking: AF [[AG [ERKP_Phase3<=ERKP_Phase3] | EG [1<=MEKPP_Phase2]]]
normalized: ~ [EG [~ [[EG [1<=MEKPP_Phase2] | ~ [E [true U ~ [ERKP_Phase3<=ERKP_Phase3]]]]]]]

abstracting: (ERKP_Phase3<=ERKP_Phase3) states: 6,110,643 (6)
abstracting: (1<=MEKPP_Phase2) states: 2,358,384 (6)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA MAPK-PT-008-CTLCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EF [AG [[RasGTP<=Raf_RasGTP & 3<=RafP]]]
normalized: E [true U ~ [E [true U ~ [[RasGTP<=Raf_RasGTP & 3<=RafP]]]]]

abstracting: (3<=RafP) states: 2,345,930 (6)
abstracting: (RasGTP<=Raf_RasGTP) states: 3,582,355 (6)
-> the formula is FALSE

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

MC time: 0m 0.003sec

checking: E [MEKPP<=Phase2 U AX [3<=MEKP_RafP]]
normalized: E [MEKPP<=Phase2 U ~ [EX [~ [3<=MEKP_RafP]]]]

abstracting: (3<=MEKP_RafP) states: 72,912 (4)
.abstracting: (MEKPP<=Phase2) states: 6,110,643 (6)
-> the formula is TRUE

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

MC time: 0m 0.020sec

checking: EG [~ [[~ [MEKPP<=MEKP_RafP] & ~ [2<=MEK]]]]
normalized: EG [~ [[~ [2<=MEK] & ~ [MEKPP<=MEKP_RafP]]]]

abstracting: (MEKPP<=MEKP_RafP) states: 4,213,167 (6)
abstracting: (2<=MEK) states: 744,156 (5)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.004sec

checking: AG [[RafP_Phase1<=ERKP_MEKPP | [~ [ERK<=ERKPP_Phase3] | 3<=RafP]]]
normalized: ~ [E [true U ~ [[RafP_Phase1<=ERKP_MEKPP | [3<=RafP | ~ [ERK<=ERKPP_Phase3]]]]]]

abstracting: (ERK<=ERKPP_Phase3) states: 3,840,359 (6)
abstracting: (3<=RafP) states: 2,345,930 (6)
abstracting: (RafP_Phase1<=ERKP_MEKPP) states: 1,848,258 (6)
-> the formula is FALSE

FORMULA MAPK-PT-008-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.033sec

checking: AG [[MEKP<=Raf | [[3<=ERK & 1<=MEKP] | ~ [MEKP_RafP<=Raf_RasGTP]]]]
normalized: ~ [E [true U ~ [[MEKP<=Raf | [~ [MEKP_RafP<=Raf_RasGTP] | [3<=ERK & 1<=MEKP]]]]]]

abstracting: (1<=MEKP) states: 2,358,384 (6)
abstracting: (3<=ERK) states: 863,522 (5)
abstracting: (MEKP_RafP<=Raf_RasGTP) states: 5,168,177 (6)
abstracting: (MEKP<=Raf) states: 5,402,607 (6)
-> the formula is FALSE

FORMULA MAPK-PT-008-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.026sec

checking: AG [[[[Raf_RasGTP<=ERK_MEKPP & 2<=RafP] & [Phase2<=RafP_Phase1 & 2<=ERKP_MEKPP]] | EF [ERK_MEKPP<=MEKPP_Phase2]]]
normalized: ~ [E [true U ~ [[E [true U ERK_MEKPP<=MEKPP_Phase2] | [[Raf_RasGTP<=ERK_MEKPP & 2<=RafP] & [Phase2<=RafP_Phase1 & 2<=ERKP_MEKPP]]]]]]

abstracting: (2<=ERKP_MEKPP) states: 235,725 (5)
abstracting: (Phase2<=RafP_Phase1) states: 2,391,993 (6)
abstracting: (2<=RafP) states: 3,429,032 (6)
abstracting: (Raf_RasGTP<=ERK_MEKPP) states: 3,044,853 (6)
abstracting: (ERK_MEKPP<=MEKPP_Phase2) states: 5,129,901 (6)
-> the formula is TRUE

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

MC time: 0m 0.016sec

checking: [[[AX [ERK_MEKPP<=ERKP_MEKPP] & [~ [1<=RafP_Phase1] & [3<=RasGTP & 3<=ERKP_Phase3]]] & [[Phase3<=Raf_RasGTP | [1<=MEKP & Raf<=MEKP_RafP]] & ERKP<=ERKP]] | AG [[1<=ERK | [RafP_Phase1<=ERKP & 3<=ERKP_Phase3]]]]
normalized: [~ [E [true U ~ [[1<=ERK | [RafP_Phase1<=ERKP & 3<=ERKP_Phase3]]]]] | [[ERKP<=ERKP & [Phase3<=Raf_RasGTP | [1<=MEKP & Raf<=MEKP_RafP]]] & [[[3<=RasGTP & 3<=ERKP_Phase3] & ~ [1<=RafP_Phase1]] & ~ [EX [~ [ERK_MEKPP<=ERKP_MEKPP]]]]]]

abstracting: (ERK_MEKPP<=ERKP_MEKPP) states: 4,951,779 (6)
.abstracting: (1<=RafP_Phase1) states: 4,594,323 (6)
abstracting: (3<=ERKP_Phase3) states: 863,522 (5)
abstracting: (3<=RasGTP) states: 0
abstracting: (Raf<=MEKP_RafP) states: 1,916,075 (6)
abstracting: (1<=MEKP) states: 2,358,384 (6)
abstracting: (Phase3<=Raf_RasGTP) states: 549,220 (5)
abstracting: (ERKP<=ERKP) states: 6,110,643 (6)
abstracting: (3<=ERKP_Phase3) states: 863,522 (5)
abstracting: (RafP_Phase1<=ERKP) states: 2,757,588 (6)
abstracting: (1<=ERK) states: 3,510,710 (6)
-> the formula is FALSE

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

MC time: 0m 0.020sec

checking: [EF [~ [[1<=MEKP | MEKP<=ERKPP_Phase3]]] | [[[[MEKP_Phase2<=RafP | 3<=Phase3] | ~ [3<=MEK]] & [[3<=Phase1 & 3<=MEKPP_Phase2] & [1<=MEKP | MEK_RafP<=Raf]]] & [RafP<=RasGTP & [~ [ERKP<=Phase1] | [MEK<=MEK_RafP & Raf<=ERKP]]]]]
normalized: [[[RafP<=RasGTP & [[MEK<=MEK_RafP & Raf<=ERKP] | ~ [ERKP<=Phase1]]] & [[~ [3<=MEK] | [MEKP_Phase2<=RafP | 3<=Phase3]] & [[1<=MEKP | MEK_RafP<=Raf] & [3<=Phase1 & 3<=MEKPP_Phase2]]]] | E [true U ~ [[1<=MEKP | MEKP<=ERKPP_Phase3]]]]

abstracting: (MEKP<=ERKPP_Phase3) states: 4,889,661 (6)
abstracting: (1<=MEKP) states: 2,358,384 (6)
abstracting: (3<=MEKPP_Phase2) states: 171,990 (5)
abstracting: (3<=Phase1) states: 4,765,626 (6)
abstracting: (MEK_RafP<=Raf) states: 5,508,167 (6)
abstracting: (1<=MEKP) states: 2,358,384 (6)
abstracting: (3<=Phase3) states: 4,818,125 (6)
abstracting: (MEKP_Phase2<=RafP) states: 5,402,607 (6)
abstracting: (3<=MEK) states: 171,990 (5)
abstracting: (ERKP<=Phase1) states: 5,672,318 (6)
abstracting: (Raf<=ERKP) states: 2,634,993 (6)
abstracting: (MEK<=MEK_RafP) states: 4,213,167 (6)
abstracting: (RafP<=RasGTP) states: 2,753,814 (6)
-> the formula is FALSE

FORMULA MAPK-PT-008-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec


Total processing time: 0m 5.187sec


BK_STOP 1464341353968

--------------------
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:530 (17), effective:85 (2)

iterations count:210 (7), effective:34 (1)

iterations count:504 (16), effective:84 (2)

iterations count:161 (5), effective:22 (0)

iterations count:371 (12), effective:63 (2)

iterations count:34 (1), effective:2 (0)

iterations count:334 (11), effective:56 (1)

iterations count:569 (18), effective:97 (3)

iterations count:473 (15), effective:83 (2)

iterations count:180 (6), effective:26 (0)

iterations count:553 (18), effective:93 (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="CTLCardinality"
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 CTLCardinality"
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-146416418600300"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;