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-040, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r065kn-blw3-146358913600322
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463734536021


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_040
(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.869sec


RS generation: 0m 0.226sec


-> reachability set: #nodes 3327 (3.3e+03) #states 478,293,389,221,095 (14)



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

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

abstracting: (2<=ERKP_MEKPP) states: 195,719,123,809,955 (14)
-> the formula is TRUE

FORMULA MAPK-PT-040-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.680sec

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

abstracting: (2<=ERKP_MEKPP) states: 195,719,123,809,955 (14)
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: EF [~ [1<=Raf]]
normalized: E [true U ~ [1<=Raf]]

abstracting: (1<=Raf) states: 450,680,841,133,320 (14)
-> the formula is TRUE

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

MC time: 0m 1.546sec

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

abstracting: (Raf<=RafP_Phase1) states: 243,689,416,932,211 (14)
-> the formula is TRUE

FORMULA MAPK-PT-040-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.909sec

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

abstracting: (ERKPP<=Phase1) states: 447,848,730,924,810 (14)
-> the formula is FALSE

FORMULA MAPK-PT-040-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 8.306sec

checking: EF [~ [~ [[MEKP<=ERK_MEKPP & 3<=MEKP_RafP]]]]
normalized: E [true U [MEKP<=ERK_MEKPP & 3<=MEKP_RafP]]

abstracting: (3<=MEKP_RafP) states: 156,121,732,727,640 (14)
abstracting: (MEKP<=ERK_MEKPP) states: 238,961,664,204,931 (14)
-> the formula is TRUE

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

MC time: 0m 1.760sec

checking: AG [~ [[Raf<=RasGTP & ~ [ERKP_Phase3<=Phase3]]]]
normalized: ~ [E [true U [Raf<=RasGTP & ~ [ERKP_Phase3<=Phase3]]]]

abstracting: (ERKP_Phase3<=Phase3) states: 437,617,024,271,435 (14)
abstracting: (Raf<=RasGTP) states: 161,399,073,962,970 (14)
-> the formula is FALSE

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

MC time: 0m 1.294sec

checking: EF [~ [[~ [3<=ERK_MEKPP] | [MEKP_RafP<=Raf_RasGTP | 2<=ERKP]]]]
normalized: E [true U ~ [[[MEKP_RafP<=Raf_RasGTP | 2<=ERKP] | ~ [3<=ERK_MEKPP]]]]

abstracting: (3<=ERK_MEKPP) states: 121,600,149,813,245 (14)
abstracting: (2<=ERKP) states: 358,949,521,865,990 (14)
abstracting: (MEKP_RafP<=Raf_RasGTP) states: 369,668,527,879,475 (14)
-> the formula is TRUE

FORMULA MAPK-PT-040-ReachabilityCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.161sec

checking: AG [[~ [[3<=RafP | 3<=Phase2]] | ~ [[MEK<=ERKPP & 2<=Phase2]]]]
normalized: ~ [E [true U ~ [[~ [[MEK<=ERKPP & 2<=Phase2]] | ~ [[3<=RafP | 3<=Phase2]]]]]]

abstracting: (3<=Phase2) states: 478,081,778,752,135 (14)
abstracting: (3<=RafP) states: 396,985,919,387,714 (14)
abstracting: (2<=Phase2) states: 478,242,116,742,079 (14)
abstracting: (MEK<=ERKPP) states: 351,786,678,760,665 (14)
-> the formula is FALSE

FORMULA MAPK-PT-040-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.892sec

checking: EF [[1<=Raf_RasGTP & ~ [[MEKPP_Phase2<=Phase1 | MEKPP_Phase2<=RafP_Phase1]]]]
normalized: E [true U [1<=Raf_RasGTP & ~ [[MEKPP_Phase2<=Phase1 | MEKPP_Phase2<=RafP_Phase1]]]]

abstracting: (MEKPP_Phase2<=RafP_Phase1) states: 410,620,100,810,895 (14)
abstracting: (MEKPP_Phase2<=Phase1) states: 467,876,349,943,666 (14)
abstracting: (1<=Raf_RasGTP) states: 421,872,267,018,945 (14)
-> the formula is TRUE

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

MC time: 0m 2.930sec

checking: AG [[[~ [1<=ERKPP_Phase3] & [ERK<=MEKPP_Phase2 & ERKP_MEKPP<=ERKPP_Phase3]] | ~ [3<=ERKP]]]
normalized: ~ [E [true U ~ [[~ [3<=ERKP] | [[ERK<=MEKPP_Phase2 & ERKP_MEKPP<=ERKPP_Phase3] & ~ [1<=ERKPP_Phase3]]]]]]

abstracting: (1<=ERKPP_Phase3) states: 415,381,133,003,140 (14)
abstracting: (ERKP_MEKPP<=ERKPP_Phase3) states: 383,870,723,900,969 (14)
abstracting: (ERK<=MEKPP_Phase2) states: 175,833,833,481,000 (14)
abstracting: (3<=ERKP) states: 308,532,129,402,744 (14)
-> the formula is FALSE

FORMULA MAPK-PT-040-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.647sec

checking: EF [[[1<=Phase2 | [2<=ERKPP_Phase3 & 1<=ERKP_MEKPP]] & [[2<=ERKP & ERK_MEKPP<=Raf_RasGTP] & 2<=RafP_Phase1]]]
normalized: E [true U [[2<=RafP_Phase1 & [2<=ERKP & ERK_MEKPP<=Raf_RasGTP]] & [1<=Phase2 | [2<=ERKPP_Phase3 & 1<=ERKP_MEKPP]]]]

abstracting: (1<=ERKP_MEKPP) states: 308,783,391,699,665 (14)
abstracting: (2<=ERKPP_Phase3) states: 358,949,521,865,990 (14)
abstracting: (1<=Phase2) states: 478,286,415,151,839 (14)
abstracting: (ERK_MEKPP<=Raf_RasGTP) states: 390,731,701,631,815 (14)
abstracting: (2<=ERKP) states: 358,949,521,865,990 (14)
abstracting: (2<=RafP_Phase1) states: 420,332,765,230,980 (14)
-> the formula is TRUE

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

MC time: 0m 0.901sec

checking: EF [~ [[[MEK_RafP<=MEKP & 1<=MEKP_RafP] | [ERKP_Phase3<=MEKPP_Phase2 | RafP_Phase1<=MEK]]]]
normalized: E [true U ~ [[[ERKP_Phase3<=MEKPP_Phase2 | RafP_Phase1<=MEK] | [MEK_RafP<=MEKP & 1<=MEKP_RafP]]]]

abstracting: (1<=MEKP_RafP) states: 334,955,717,201,040 (14)
abstracting: (MEK_RafP<=MEKP) states: 296,508,544,270,819 (14)
abstracting: (RafP_Phase1<=MEK) states: 94,865,126,138,640 (13)
abstracting: (ERKP_Phase3<=MEKPP_Phase2) states: 175,833,833,481,000 (14)
-> the formula is TRUE

FORMULA MAPK-PT-040-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m12.856sec

checking: AG [[RasGTP<=Phase1 & [[Raf_RasGTP<=MEK | 2<=RafP] | [MEKP_Phase2<=MEKPP & 1<=ERKP_Phase3]]]]
normalized: ~ [E [true U ~ [[RasGTP<=Phase1 & [[MEKP_Phase2<=MEKPP & 1<=ERKP_Phase3] | [Raf_RasGTP<=MEK | 2<=RafP]]]]]]

abstracting: (2<=RafP) states: 423,552,509,485,080 (14)
abstracting: (Raf_RasGTP<=MEK) states: 176,471,595,698,610 (14)
abstracting: (1<=ERKP_Phase3) states: 415,381,133,003,140 (14)
abstracting: (MEKP_Phase2<=MEKPP) states: 273,715,601,971,329 (14)
abstracting: (RasGTP<=Phase1) states: 447,311,686,815,023 (14)
-> the formula is FALSE

FORMULA MAPK-PT-040-ReachabilityCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.580sec

checking: AG [[[2<=Raf & [3<=Phase3 & 1<=ERK]] | [[1<=MEK & ERKPP_Phase3<=ERKP] | Phase1<=RafP_Phase1]]]
normalized: ~ [E [true U ~ [[[Phase1<=RafP_Phase1 | [1<=MEK & ERKPP_Phase3<=ERKP]] | [2<=Raf & [3<=Phase3 & 1<=ERK]]]]]]

abstracting: (1<=ERK) states: 415,381,133,003,140 (14)
abstracting: (3<=Phase3) states: 477,647,663,818,597 (14)
abstracting: (2<=Raf) states: 423,552,509,485,080 (14)
abstracting: (ERKPP_Phase3<=ERKP) states: 255,714,555,085,625 (14)
abstracting: (1<=MEK) states: 355,287,985,065,900 (14)
abstracting: (Phase1<=RafP_Phase1) states: 135,598,300,736,080 (14)
-> the formula is FALSE

FORMULA MAPK-PT-040-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 8.549sec

checking: AG [[[~ [2<=Phase3] | [MEK<=Phase1 & 3<=MEK]] | ~ [[MEKPP_Phase2<=ERKP_MEKPP & MEKPP_Phase2<=Phase2]]]]
normalized: ~ [E [true U ~ [[~ [[MEKPP_Phase2<=ERKP_MEKPP & MEKPP_Phase2<=Phase2]] | [[MEK<=Phase1 & 3<=MEK] | ~ [2<=Phase3]]]]]]

abstracting: (2<=Phase3) states: 478,089,011,670,850 (14)
abstracting: (3<=MEK) states: 187,175,191,943,790 (14)
abstracting: (MEK<=Phase1) states: 467,876,349,943,666 (14)
abstracting: (MEKPP_Phase2<=Phase2) states: 466,816,707,932,655 (14)
abstracting: (MEKPP_Phase2<=ERKP_MEKPP) states: 238,961,664,204,931 (14)
-> the formula is FALSE

FORMULA MAPK-PT-040-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.132sec


Total processing time: 1m 1.144sec


BK_STOP 1463734597221

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

1081 1611 1655 2634 2859
iterations count:5250 (175), effective:860 (28)

initing FirstDep: 0m 0.000sec


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

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

iterations count:300 (10), effective:70 (2)

iterations count:240 (8), effective:55 (1)

iterations count:691 (23), effective:141 (4)

iterations count:615 (20), effective:110 (3)
2923
iterations count:1975 (65), effective:347 (11)
3150
iterations count:1797 (59), effective:305 (10)

iterations count:455 (15), effective:93 (3)
2399
iterations count:1545 (51), effective:287 (9)

iterations count:589 (19), effective:90 (3)

iterations count:403 (13), effective:84 (2)

iterations count:849 (28), effective:161 (5)

iterations count:345 (11), effective:87 (2)

iterations count:753 (25), effective:189 (6)

iterations count:598 (19), effective:123 (4)

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-040"
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/MAPK-PT-040.tgz
mv MAPK-PT-040 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-040, 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 r065kn-blw3-146358913600322"
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 ;