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 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 r162st-ebro-143319441200717
=====================================================================

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

Model: S_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=CTLCardinality.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: 0m5sec


RS generation: 0m0sec


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



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

checking: [EF [AG [3<=ERKPP_Phase3]] | A [~ [ERK<=Phase3] U [1<=MEKP_Phase2 & 1<=RafP]]]
normalized: [E [true U ~ [E [true U ~ [3<=ERKPP_Phase3]]]] | [~ [E [ERK<=Phase3 U [ERK<=Phase3 & ~ [[1<=MEKP_Phase2 & 1<=RafP]]]]] & ~ [EG [~ [[1<=MEKP_Phase2 & 1<=RafP]]]]]]

abstracting: (1<=RafP) states: 4,701,298 (6)
abstracting: (1<=MEKP_Phase2) states: 2,358,384 (6)
.
EG iterations: 1
abstracting: (1<=RafP) states: 4,701,298 (6)
abstracting: (1<=MEKP_Phase2) states: 2,358,384 (6)
abstracting: (ERK<=Phase3) states: 6,110,643 (6)
abstracting: (ERK<=Phase3) states: 6,110,643 (6)
abstracting: (3<=ERKPP_Phase3) states: 863,522 (5)
-> the formula is FALSE

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

MC time: 0m14sec

checking: [[[[2<=MEKP_Phase2 & [Phase2<=RafP & RafP_Phase1<=RafP]] | EG [MEKPP<=MEKPP]] & E [1<=ERK U 3<=ERKPP_Phase3]] & [[[~ [RasGTP<=RasGTP] & [1<=RafP & ERK_MEKPP<=Phase2]] | ~ [~ [MEK_RafP<=ERK]]] & 3<=Phase1]]
normalized: [[3<=Phase1 & [MEK_RafP<=ERK | [[1<=RafP & ERK_MEKPP<=Phase2] & ~ [RasGTP<=RasGTP]]]] & [E [1<=ERK U 3<=ERKPP_Phase3] & [EG [MEKPP<=MEKPP] | [2<=MEKP_Phase2 & [Phase2<=RafP & RafP_Phase1<=RafP]]]]]

abstracting: (RafP_Phase1<=RafP) states: 3,530,251 (6)
abstracting: (Phase2<=RafP) states: 2,518,685 (6)
abstracting: (2<=MEKP_Phase2) states: 744,156 (5)
abstracting: (MEKPP<=MEKPP) states: 6,110,643 (6)

EG iterations: 0
abstracting: (3<=ERKPP_Phase3) states: 863,522 (5)
abstracting: (1<=ERK) states: 3,510,710 (6)
abstracting: (RasGTP<=RasGTP) states: 6,110,643 (6)
abstracting: (ERK_MEKPP<=Phase2) states: 6,110,643 (6)
abstracting: (1<=RafP) states: 4,701,298 (6)
abstracting: (MEK_RafP<=ERK) states: 5,211,423 (6)
abstracting: (3<=Phase1) states: 4,765,626 (6)
-> the formula is TRUE

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

MC time: 0m21sec

checking: E [AF [MEKP<=ERKP] U AX [3<=ERKPP_Phase3]]
normalized: E [~ [EG [~ [MEKP<=ERKP]]] U ~ [EX [~ [3<=ERKPP_Phase3]]]]

abstracting: (3<=ERKPP_Phase3) states: 863,522 (5)
.abstracting: (MEKP<=ERKP) states: 4,889,661 (6)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m2sec

checking: EF [[EG [Raf<=ERKP_MEKPP] & ~ [~ [ERKP_MEKPP<=ERKPP]]]]
normalized: E [true U [ERKP_MEKPP<=ERKPP & EG [Raf<=ERKP_MEKPP]]]

abstracting: (Raf<=ERKP_MEKPP) states: 1,734,188 (6)
.
EG iterations: 1
abstracting: (ERKP_MEKPP<=ERKPP) states: 5,401,147 (6)
-> the formula is TRUE

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

MC time: 0m7sec

checking: EF [[[Phase1<=ERKP_Phase3 | [ERK_MEKPP<=Phase3 | 3<=RasGTP]] & ~ [MEK<=MEK]]]
normalized: E [true U [[Phase1<=ERKP_Phase3 | [ERK_MEKPP<=Phase3 | 3<=RasGTP]] & ~ [MEK<=MEK]]]

abstracting: (MEK<=MEK) states: 6,110,643 (6)
abstracting: (3<=RasGTP) states: 0
abstracting: (ERK_MEKPP<=Phase3) states: 6,110,643 (6)
abstracting: (Phase1<=ERKP_Phase3) states: 910,315 (5)
-> the formula is FALSE

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

MC time: 0m10sec

checking: E [EX [Phase2<=Raf] U [[ERKP_MEKPP<=MEK & Raf<=RafP_Phase1] & [Phase3<=RafP | 1<=ERKPP_Phase3]]]
normalized: E [EX [Phase2<=Raf] U [[Phase3<=RafP | 1<=ERKPP_Phase3] & [ERKP_MEKPP<=MEK & Raf<=RafP_Phase1]]]

abstracting: (Raf<=RafP_Phase1) states: 3,395,831 (6)
abstracting: (ERKP_MEKPP<=MEK) states: 5,129,901 (6)
abstracting: (1<=ERKPP_Phase3) states: 3,510,710 (6)
abstracting: (Phase3<=RafP) states: 1,878,035 (6)
abstracting: (Phase2<=Raf) states: 2,518,685 (6)
.-> the formula is TRUE

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

MC time: 0m4sec

checking: AG [~ [AG [MEKP<=MEKPP_Phase2]]]
normalized: ~ [E [true U ~ [E [true U ~ [MEKP<=MEKPP_Phase2]]]]]

abstracting: (MEKP<=MEKPP_Phase2) states: 4,346,475 (6)
-> the formula is TRUE

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

MC time: 0m0sec

checking: EF [~ [[1<=Phase2 | 3<=MEKPP_Phase2]]]
normalized: E [true U ~ [[1<=Phase2 | 3<=MEKPP_Phase2]]]

abstracting: (3<=MEKPP_Phase2) states: 171,990 (5)
abstracting: (1<=Phase2) states: 6,000,393 (6)
-> the formula is TRUE

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

MC time: 0m0sec

checking: EF [AG [[3<=MEKPP & 1<=ERK]]]
normalized: E [true U ~ [E [true U ~ [[3<=MEKPP & 1<=ERK]]]]]

abstracting: (1<=ERK) states: 3,510,710 (6)
abstracting: (3<=MEKPP) states: 171,990 (5)
-> the formula is FALSE

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

MC time: 0m0sec

checking: AG [EG [[ERKP_MEKPP<=ERKP_Phase3 | ERKPP_Phase3<=ERKP_Phase3]]]
normalized: ~ [E [true U ~ [EG [[ERKP_MEKPP<=ERKP_Phase3 | ERKPP_Phase3<=ERKP_Phase3]]]]]

abstracting: (ERKPP_Phase3<=ERKP_Phase3) states: 3,840,359 (6)
abstracting: (ERKP_MEKPP<=ERKP_Phase3) states: 5,401,147 (6)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m4sec

checking: EF [EG [~ [RafP<=Phase1]]]
normalized: E [true U EG [~ [RafP<=Phase1]]]

abstracting: (RafP<=Phase1) states: 5,361,818 (6)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m0sec

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

abstracting: (3<=ERKPP) states: 863,522 (5)
abstracting: (1<=MEK_RafP) states: 1,831,956 (6)
-> the formula is TRUE

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

MC time: 0m0sec

checking: AG [[~ [[ERK<=MEK_RafP | MEKPP_Phase2<=ERKP_MEKPP]] | MEKP<=Phase3]]
normalized: ~ [E [true U ~ [[MEKP<=Phase3 | ~ [[ERK<=MEK_RafP | MEKPP_Phase2<=ERKP_MEKPP]]]]]]

abstracting: (MEKPP_Phase2<=ERKP_MEKPP) states: 4,094,118 (6)
abstracting: (ERK<=MEK_RafP) states: 3,175,002 (6)
abstracting: (MEKP<=Phase3) states: 5,975,888 (6)
-> the formula is FALSE

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

MC time: 0m12sec

checking: AG [ERKPP<=Phase3]
normalized: ~ [E [true U ~ [ERKPP<=Phase3]]]

abstracting: (ERKPP<=Phase3) states: 6,110,643 (6)
-> the formula is TRUE

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

MC time: 0m0sec

checking: ~ [AG [3<=Phase3]]
normalized: E [true U ~ [3<=Phase3]]

abstracting: (3<=Phase3) states: 4,818,125 (6)
-> the formula is TRUE

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

MC time: 0m0sec

checking: [EF [EG [3<=MEKP_RafP]] & [AX [ERKP_Phase3<=Phase2] & AF [[3<=RasGTP | Phase3<=ERK]]]]
normalized: [[~ [EG [~ [[3<=RasGTP | Phase3<=ERK]]]] & ~ [EX [~ [ERKP_Phase3<=Phase2]]]] & E [true U EG [3<=MEKP_RafP]]]

abstracting: (3<=MEKP_RafP) states: 72,912 (4)
.
EG iterations: 1
abstracting: (ERKP_Phase3<=Phase2) states: 5,547,264 (6)
.abstracting: (Phase3<=ERK) states: 481,180 (5)
abstracting: (3<=RasGTP) states: 0
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m9sec


Total processing time: 1m37sec


BK_STOP 1433382388567

--------------------
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:34 (1), effective:1 (0)

iterations count:37 (1), effective:1 (0)

iterations count:196 (6), effective:28 (0)

iterations count:233 (7), effective:36 (1)

iterations count:316 (10), effective:39 (1)

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

iterations count:125 (4), effective:12 (0)

iterations count:228 (7), effective:23 (0)

iterations count:32 (1), effective:1 (0)

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

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

iterations count:218 (7), effective:31 (1)

iterations count:225 (7), effective:43 (1)

iterations count:144 (4), effective:20 (0)

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

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="/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/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-2265"
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 r162st-ebro-143319441200717"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "ReachabilityComputeBounds" ] ; 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 ;