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 MAPK-PT-020, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r065kn-blw3-146358913500309
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463734498008


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_020
(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.816sec


RS generation: 0m 0.033sec


-> reachability set: #nodes 1012 (1.0e+03) #states 88,125,763,956 (10)



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

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

abstracting: (2<=ERK_MEKPP) states: 17,558,169,432 (10)
-> the formula is TRUE

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

MC time: 0m 0.010sec

checking: EF [AX [~ [MEKPP_Phase2<=Phase1]]]
normalized: E [true U ~ [EX [MEKPP_Phase2<=Phase1]]]

abstracting: (MEKPP_Phase2<=Phase1) states: 85,955,543,513 (10)
.-> the formula is TRUE

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

MC time: 0m 0.256sec

checking: E [EX [1<=RasGTP] U AX [3<=ERKP_Phase3]]
normalized: E [EX [1<=RasGTP] U ~ [EX [~ [3<=ERKP_Phase3]]]]

abstracting: (3<=ERKP_Phase3) states: 37,845,286,015 (10)
.abstracting: (1<=RasGTP) states: 77,436,914,880 (10)
.-> the formula is TRUE

FORMULA MAPK-PT-020-CTLCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.094sec

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

abstracting: (MEKPP_Phase2<=MEK) states: 54,827,055,446 (10)
-> the formula is FALSE

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

MC time: 0m 0.093sec

checking: ~ [AF [EF [Raf<=RafP_Phase1]]]
normalized: EG [~ [E [true U Raf<=RafP_Phase1]]]

abstracting: (Raf<=RafP_Phase1) states: 46,033,481,484 (10)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.075sec

checking: E [[~ [2<=RafP] & 1<=Phase3] U AF [2<=ERKP_MEKPP]]
normalized: E [[1<=Phase3 & ~ [2<=RafP]] U ~ [EG [~ [2<=ERKP_MEKPP]]]]

abstracting: (2<=ERKP_MEKPP) states: 17,558,169,432 (10)
.
EG iterations: 1
abstracting: (2<=RafP) states: 69,343,275,025 (10)
abstracting: (1<=Phase3) states: 88,024,261,668 (10)
-> the formula is TRUE

FORMULA MAPK-PT-020-CTLCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.144sec

checking: AG [EF [[ERKPP_Phase3<=Phase1 | 2<=Phase1]]]
normalized: ~ [E [true U ~ [E [true U [ERKPP_Phase3<=Phase1 | 2<=Phase1]]]]]

abstracting: (2<=Phase1) states: 85,545,290,284 (10)
abstracting: (ERKPP_Phase3<=Phase1) states: 82,252,218,556 (10)
-> the formula is TRUE

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

MC time: 0m 0.031sec

checking: AX [EF [[Phase3<=MEKP_RafP | 2<=ERKPP_Phase3]]]
normalized: ~ [EX [~ [E [true U [Phase3<=MEKP_RafP | 2<=ERKPP_Phase3]]]]]

abstracting: (2<=ERKPP_Phase3) states: 51,153,151,165 (10)
abstracting: (Phase3<=MEKP_RafP) states: 1,261,701,866 (9)
.-> the formula is TRUE

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

MC time: 0m 0.272sec

checking: AG [E [MEKPP_Phase2<=Phase2 U ERKP<=MEK_RafP]]
normalized: ~ [E [true U ~ [E [MEKPP_Phase2<=Phase2 U ERKP<=MEK_RafP]]]]

abstracting: (ERKP<=MEK_RafP) states: 34,730,252,784 (10)
abstracting: (MEKPP_Phase2<=Phase2) states: 85,062,830,196 (10)
-> the formula is FALSE

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

MC time: 0m 0.983sec

checking: ~ [[EF [2<=ERKP_Phase3] & [EG [RasGTP<=ERK_MEKPP] | [~ [3<=MEKP_Phase2] & 3<=ERK]]]]
normalized: ~ [[[[3<=ERK & ~ [3<=MEKP_Phase2]] | EG [RasGTP<=ERK_MEKPP]] & E [true U 2<=ERKP_Phase3]]]

abstracting: (2<=ERKP_Phase3) states: 51,153,151,165 (10)
abstracting: (RasGTP<=ERK_MEKPP) states: 21,020,858,796 (10)
..
EG iterations: 2
abstracting: (3<=MEKP_Phase2) states: 16,079,210,945 (10)
abstracting: (3<=ERK) states: 37,845,286,015 (10)
-> the formula is FALSE

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

MC time: 0m 0.094sec

checking: [2<=MEKPP | [~ [ERKPP<=ERKP_MEKPP] | AG [[MEKP_Phase2<=RafP | 1<=Phase1]]]]
normalized: [2<=MEKPP | [~ [E [true U ~ [[MEKP_Phase2<=RafP | 1<=Phase1]]]] | ~ [ERKPP<=ERKP_MEKPP]]]

abstracting: (ERKPP<=ERKP_MEKPP) states: 32,191,959,030 (10)
abstracting: (1<=Phase1) states: 87,070,522,956 (10)
abstracting: (MEKP_Phase2<=RafP) states: 76,697,673,756 (10)
abstracting: (2<=MEKPP) states: 29,932,559,300 (10)
-> the formula is FALSE

FORMULA MAPK-PT-020-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.248sec

checking: EX [[AG [RafP_Phase1<=RafP_Phase1] | [[2<=MEKPP & MEKP_Phase2<=ERKPP_Phase3] & [2<=MEK_RafP & ERKPP_Phase3<=ERKP_Phase3]]]]
normalized: EX [[[[2<=MEK_RafP & ERKPP_Phase3<=ERKP_Phase3] & [2<=MEKPP & MEKP_Phase2<=ERKPP_Phase3]] | ~ [E [true U ~ [RafP_Phase1<=RafP_Phase1]]]]]

abstracting: (RafP_Phase1<=RafP_Phase1) states: 88,125,763,956 (10)
abstracting: (MEKP_Phase2<=ERKPP_Phase3) states: 66,636,183,636 (10)
abstracting: (2<=MEKPP) states: 29,932,559,300 (10)
abstracting: (ERKPP_Phase3<=ERKP_Phase3) states: 49,665,009,566 (10)
abstracting: (2<=MEK_RafP) states: 23,741,837,052 (10)
.-> the formula is TRUE

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

MC time: 0m 0.031sec

checking: [[~ [[[3<=RafP | Raf<=MEK] | [1<=RafP_Phase1 & 1<=MEKPP]]] & AG [[1<=RafP | 1<=ERK]]] | ~ [EF [[RafP<=ERKP | 2<=ERK]]]]
normalized: [~ [E [true U [RafP<=ERKP | 2<=ERK]]] | [~ [E [true U ~ [[1<=RafP | 1<=ERK]]]] & ~ [[[3<=RafP | Raf<=MEK] | [1<=RafP_Phase1 & 1<=MEKPP]]]]]

abstracting: (1<=MEKPP) states: 52,616,276,700 (10)
abstracting: (1<=RafP_Phase1) states: 77,887,693,680 (10)
abstracting: (Raf<=MEK) states: 20,510,758,476 (10)
abstracting: (3<=RafP) states: 60,569,509,474 (10)
abstracting: (1<=ERK) states: 67,744,017,220 (10)
abstracting: (1<=RafP) states: 78,558,858,680 (10)
abstracting: (2<=ERK) states: 51,153,151,165 (10)
abstracting: (RafP<=ERKP) states: 31,344,128,969 (10)
-> the formula is FALSE

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

MC time: 0m 0.962sec

checking: [[MEKP_Phase2<=Raf_RasGTP & AG [[3<=ERKP_MEKPP | MEK<=Raf]]] & ~ [[ERK<=MEKP_Phase2 & [[3<=MEK & 1<=ERKP_Phase3] | RasGTP<=MEKPP_Phase2]]]]
normalized: [~ [[ERK<=MEKP_Phase2 & [RasGTP<=MEKPP_Phase2 | [3<=MEK & 1<=ERKP_Phase3]]]] & [MEKP_Phase2<=Raf_RasGTP & ~ [E [true U ~ [[3<=ERKP_MEKPP | MEK<=Raf]]]]]]

abstracting: (MEK<=Raf) states: 76,697,673,756 (10)
abstracting: (3<=ERKP_MEKPP) states: 7,081,176,804 (9)
abstracting: (MEKP_Phase2<=Raf_RasGTP) states: 66,345,854,376 (10)
abstracting: (1<=ERKP_Phase3) states: 67,744,017,220 (10)
abstracting: (3<=MEK) states: 16,079,210,945 (10)
abstracting: (RasGTP<=MEKPP_Phase2) states: 27,861,557,626 (10)
abstracting: (ERK<=MEKP_Phase2) states: 37,756,812,816 (10)
-> the formula is FALSE

FORMULA MAPK-PT-020-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.313sec

checking: [EF [[3<=MEKPP_Phase2 & [MEKPP<=MEKP_RafP | 1<=Phase2]]] & [[[RafP_Phase1<=MEKP_RafP & 2<=Raf_RasGTP] | AX [MEKP_RafP<=ERK_MEKPP]] | [[ERKP_MEKPP<=Raf & 2<=MEKP_Phase2] | MEK_RafP<=MEKP]]]
normalized: [[[MEK_RafP<=MEKP | [ERKP_MEKPP<=Raf & 2<=MEKP_Phase2]] | [~ [EX [~ [MEKP_RafP<=ERK_MEKPP]]] | [RafP_Phase1<=MEKP_RafP & 2<=Raf_RasGTP]]] & E [true U [3<=MEKPP_Phase2 & [MEKPP<=MEKP_RafP | 1<=Phase2]]]]

abstracting: (1<=Phase2) states: 88,080,740,340 (10)
abstracting: (MEKPP<=MEKP_RafP) states: 52,126,808,913 (10)
abstracting: (3<=MEKPP_Phase2) states: 16,079,210,945 (10)
abstracting: (2<=Raf_RasGTP) states: 52,182,188,125 (10)
abstracting: (RafP_Phase1<=MEKP_RafP) states: 20,004,109,236 (10)
abstracting: (MEKP_RafP<=ERK_MEKPP) states: 54,525,692,051 (10)
.abstracting: (2<=MEKP_Phase2) states: 29,932,559,300 (10)
abstracting: (ERKP_MEKPP<=Raf) states: 80,983,033,236 (10)
abstracting: (MEK_RafP<=MEKP) states: 59,760,229,504 (10)
-> the formula is TRUE

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

MC time: 0m 0.189sec

checking: [MEKPP<=MEK_RafP & [[EG [RasGTP<=Phase3] & [~ [2<=ERKPP_Phase3] & [2<=RasGTP & Phase2<=MEKP]]] | [[ERKP_Phase3<=ERK_MEKPP | [Raf_RasGTP<=MEKPP_Phase2 & 2<=RafP]] & EF [2<=ERKP_Phase3]]]]
normalized: [MEKPP<=MEK_RafP & [[E [true U 2<=ERKP_Phase3] & [ERKP_Phase3<=ERK_MEKPP | [Raf_RasGTP<=MEKPP_Phase2 & 2<=RafP]]] | [[[2<=RasGTP & Phase2<=MEKP] & ~ [2<=ERKPP_Phase3]] & EG [RasGTP<=Phase3]]]]

abstracting: (RasGTP<=Phase3) states: 85,779,755,946 (10)
.
EG iterations: 1
abstracting: (2<=ERKPP_Phase3) states: 51,153,151,165 (10)
abstracting: (Phase2<=MEKP) states: 270,141,696 (8)
abstracting: (2<=RasGTP) states: 65,217,899,800 (10)
abstracting: (2<=RafP) states: 69,343,275,025 (10)
abstracting: (Raf_RasGTP<=MEKPP_Phase2) states: 38,393,510,136 (10)
abstracting: (ERKP_Phase3<=ERK_MEKPP) states: 32,191,959,030 (10)
abstracting: (2<=ERKP_Phase3) states: 51,153,151,165 (10)
abstracting: (MEKPP<=MEK_RafP) states: 52,126,808,913 (10)
-> the formula is TRUE

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

MC time: 0m 0.079sec


Total processing time: 0m 9.083sec


BK_STOP 1463734507125

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

635 829
iterations count:2640 (88), effective:430 (14)

initing FirstDep: 0m 0.000sec


iterations count:66 (2), effective:9 (0)

iterations count:407 (13), effective:79 (2)

iterations count:458 (15), effective:72 (2)

iterations count:274 (9), effective:50 (1)

iterations count:137 (4), effective:28 (0)

iterations count:438 (14), effective:78 (2)

iterations count:32 (1), effective:2 (0)
1256
iterations count:1272 (42), effective:222 (7)

iterations count:663 (22), effective:113 (3)

iterations count:908 (30), effective:157 (5)

iterations count:244 (8), effective:36 (1)

iterations count:341 (11), effective:74 (2)
1059
iterations count:1292 (43), effective:226 (7)

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

iterations count:262 (8), effective:50 (1)

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

iterations count:244 (8), effective:36 (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-020"
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/MAPK-PT-020.tgz
mv MAPK-PT-020 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 MAPK-PT-020, 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 r065kn-blw3-146358913500309"
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 ;