fond
Model Checking Contest @ Petri Nets 2016
6th edition, Toruń, Poland, June 21, 2016
Execution of r161kn-blw3-146416418700331
Last Updated
June 30, 2016

About the Execution of Marcie for S_MAPK-PT-080

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15924.530 870311.00 870058.00 20.00 FTFFFFT?TFFFTTF? normal

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


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

=== Now, execution of the tool begins

BK_START 1464341448938


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_080
(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.826sec


RS generation: 0m 1.431sec


-> reachability set: #nodes 11932 (1.2e+04) #states 5,634,903,909,420,423,840 (18)



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

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

abstracting: (3<=ERK) states: 4,504,831,172,343,094,234 (18)
-> the formula is FALSE

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

MC time: 1m19.006sec

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

abstracting: (2<=ERKP_Phase3) states: 4,860,386,723,342,267,890 (18)
-> the formula is TRUE

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

MC time: 0m 5.987sec

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

abstracting: (3<=ERK_MEKPP) states: 2,741,724,210,690,654,393 (18)
-> the formula is FALSE

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

MC time: 0m 4.813sec

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

abstracting: (3<=ERK_MEKPP) states: 2,741,724,210,690,654,393 (18)
-> the formula is FALSE

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

MC time: 0m 0.001sec

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

abstracting: (3<=MEKPP_Phase2) states: 3,423,010,914,932,988,410 (18)
-> the formula is TRUE

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

MC time: 0m 4.905sec

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

abstracting: (ERKPP<=MEK) states: 1,867,371,330,764,512,950 (18)
-> the formula is FALSE

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

MC time: 0m19.553sec

checking: EF [[3<=MEKPP_Phase2 | Phase3<=MEKPP_Phase2]]
normalized: E [true U [3<=MEKPP_Phase2 | Phase3<=MEKPP_Phase2]]

abstracting: (Phase3<=MEKPP_Phase2) states: 31,160,817,327,187,745 (16)
abstracting: (3<=MEKPP_Phase2) states: 3,423,010,914,932,988,410 (18)
-> the formula is TRUE

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

MC time: 0m 1.112sec

checking: EF [[2<=ERKPP_Phase3 & [[2<=Phase3 & Raf<=RafP] & 1<=MEKP_RafP]]]
normalized: E [true U [2<=ERKPP_Phase3 & [1<=MEKP_RafP & [2<=Phase3 & Raf<=RafP]]]]

abstracting: (Raf<=RafP) states: 2,859,630,880,404,781,482 (18)
abstracting: (2<=Phase3) states: 5,634,779,271,134,439,276 (18)
abstracting: (1<=MEKP_RafP) states: 4,650,781,599,537,436,350 (18)
abstracting: (2<=ERKPP_Phase3) states: 4,860,386,723,342,267,890 (18)
-> the formula is TRUE

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

MC time: 0m14.557sec

checking: AG [[RafP<=Raf_RasGTP | [3<=RasGTP & [1<=MEK | 1<=Phase2]]]]
normalized: ~ [E [true U ~ [[RafP<=Raf_RasGTP | [3<=RasGTP & [1<=MEK | 1<=Phase2]]]]]]

abstracting: (1<=Phase2) states: 5,634,902,541,226,525,104 (18)
abstracting: (1<=MEK) states: 4,793,059,919,194,204,860 (18)
abstracting: (3<=RasGTP) states: 5,043,779,292,264,281,886 (18)
abstracting: (RafP<=Raf_RasGTP) states: 1,614,365,216,569,401,172 (18)
-> the formula is FALSE

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

MC time: 0m10.063sec

checking: AG [[[[MEKPP<=ERKPP & 1<=ERKP_Phase3] | ~ [ERK<=MEKPP_Phase2]] | 3<=ERK]]
normalized: ~ [E [true U ~ [[3<=ERK | [~ [ERK<=MEKPP_Phase2] | [MEKPP<=ERKPP & 1<=ERKP_Phase3]]]]]]

abstracting: (1<=ERKP_Phase3) states: 5,236,807,571,553,594,730 (18)
abstracting: (MEKPP<=ERKPP) states: 4,076,483,351,005,334,820 (18)
abstracting: (ERK<=MEKPP_Phase2) states: 1,867,371,330,764,512,950 (18)
abstracting: (3<=ERK) states: 4,504,831,172,343,094,234 (18)
-> the formula is FALSE

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

MC time: 5m40.870sec

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

abstracting: (2<=Phase1) states: 5,608,291,465,365,915,304 (18)
abstracting: (3<=Phase3) states: 5,634,491,244,583,574,949 (18)
abstracting: (Raf<=ERKPP_Phase3) states: 1,730,465,083,156,267,947 (18)
abstracting: (1<=ERKP_MEKPP) states: 4,455,346,573,836,523,080 (18)
abstracting: (2<=MEKPP_Phase2) states: 4,059,600,091,186,934,348 (18)
-> the formula is FALSE

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

MC time: 1m 1.915sec

checking: AG [[[~ [Phase2<=Raf] & [MEKP_RafP<=MEKP_Phase2 & 3<=ERKP_Phase3]] | Raf_RasGTP<=MEK]]
normalized: ~ [E [true U ~ [[Raf_RasGTP<=MEK | [[MEKP_RafP<=MEKP_Phase2 & 3<=ERKP_Phase3] & ~ [Phase2<=Raf]]]]]]

abstracting: (Phase2<=Raf) states: 1,637,315,793,170,627,262 (18)
abstracting: (3<=ERKP_Phase3) states: 4,504,831,172,343,094,234 (18)
abstracting: (MEKP_RafP<=MEKP_Phase2) states: 3,280,845,971,730,869,390 (18)
abstracting: (Raf_RasGTP<=MEK) states: 1,857,846,215,374,735,140 (18)
-> the formula is FALSE

FORMULA MAPK-PT-080-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m17.210sec

checking: AG [[[~ [3<=Raf_RasGTP] | [3<=Phase3 | MEKP_Phase2<=MEKPP]] | [[Phase1<=RafP_Phase1 & 2<=RafP_Phase1] & 2<=MEKPP]]]
normalized: ~ [E [true U ~ [[[2<=MEKPP & [Phase1<=RafP_Phase1 & 2<=RafP_Phase1]] | [[3<=Phase3 | MEKP_Phase2<=MEKPP] | ~ [3<=Raf_RasGTP]]]]]]

abstracting: (3<=Raf_RasGTP) states: 4,608,255,128,543,800,680 (18)
abstracting: (MEKP_Phase2<=MEKPP) states: 3,042,210,437,429,479,866 (18)
abstracting: (3<=Phase3) states: 5,634,491,244,583,574,949 (18)
abstracting: (2<=RafP_Phase1) states: 5,280,099,860,335,054,740 (18)
abstracting: (Phase1<=RafP_Phase1) states: 1,534,412,102,241,520,260 (18)
abstracting: (2<=MEKPP) states: 4,059,600,091,186,934,348 (18)
-> the formula is FALSE

FORMULA MAPK-PT-080-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m23.126sec

checking: EF [[~ [[2<=MEKP_RafP & 3<=Phase2]] & [[MEKPP_Phase2<=MEK | 1<=Phase2] & [2<=RafP & Phase2<=ERK_MEKPP]]]]
normalized: E [true U [[[2<=RafP & Phase2<=ERK_MEKPP] & [MEKPP_Phase2<=MEK | 1<=Phase2]] & ~ [[2<=MEKP_RafP & 3<=Phase2]]]]

abstracting: (3<=Phase2) states: 5,634,858,778,459,624,965 (18)
abstracting: (2<=MEKP_RafP) states: 3,820,663,975,153,611,204 (18)
abstracting: (1<=Phase2) states: 5,634,902,541,226,525,104 (18)
abstracting: (MEKPP_Phase2<=MEK) states: 3,042,210,437,429,479,866 (18)
abstracting: (Phase2<=ERK_MEKPP) states: 13,455,414,023,604 (13)
abstracting: (2<=RafP) states: 5,300,261,665,871,415,790 (18)
-> the formula is TRUE

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

MC time: 0m42.242sec

checking: AG [[[[1<=Raf | ERKP<=RafP] | ~ [ERKPP_Phase3<=RafP_Phase1]] | [1<=Raf | ~ [ERKPP<=Raf_RasGTP]]]]
normalized: ~ [E [true U ~ [[[1<=Raf | ~ [ERKPP<=Raf_RasGTP]] | [~ [ERKPP_Phase3<=RafP_Phase1] | [1<=Raf | ERKP<=RafP]]]]]]

abstracting: (ERKP<=RafP) states: 4,048,766,833,827,329,718 (18)
abstracting: (1<=Raf) states: 5,466,869,564,924,771,675 (18)
abstracting: (ERKPP_Phase3<=RafP_Phase1) states: 4,005,334,210,438,091,478 (18)
abstracting: (ERKPP<=Raf_RasGTP) states: 2,812,929,265,737,497,304 (18)
abstracting: (1<=Raf) states: 5,466,869,564,924,771,675 (18)

FORMULA MAPK-PT-080-ReachabilityCardinality-15 CANNOT_COMPUTE

MC time: 2m53.585sec

checking: EF [[[~ [ERK<=ERKPP] & [ERKP_Phase3<=Phase2 & 3<=ERKPP]] & [MEK_RafP<=RafP_Phase1 & ~ [Phase2<=Phase2]]]]
normalized: E [true U [[MEK_RafP<=RafP_Phase1 & ~ [Phase2<=Phase2]] & [[ERKP_Phase3<=Phase2 & 3<=ERKPP] & ~ [ERK<=ERKPP]]]]


FORMULA MAPK-PT-080-ReachabilityCardinality-9 CANNOT_COMPUTE

MC time: 0m 0.000sec


Total processing time: 14m29.957sec


BK_STOP 1464342319249

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

1838 3642 5301 5500 5719 5588 11864 9244 9829 10095
iterations count:10470 (349), effective:1720 (57)

initing FirstDep: 0m 0.000sec

11176 12678 13219 13548
iterations count:4553 (151), effective:773 (25)

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

iterations count:372 (12), effective:57 (1)

iterations count:372 (12), effective:57 (1)

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

iterations count:941 (31), effective:191 (6)

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

iterations count:957 (31), effective:189 (6)

iterations count:461 (15), effective:131 (4)
48451 25353 20082 22217 21498 22904 23949
iterations count:7800 (260), effective:1318 (43)
25399
iterations count:1487 (49), effective:347 (11)

iterations count:830 (27), effective:248 (8)
5664 8019 9184 8430 11338 10028
iterations count:6912 (230), effective:1207 (40)
8339 9492
iterations count:2376 (79), effective:406 (13)
std::bad_alloc

std::bad_alloc

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-080"
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-080.tgz
mv S_MAPK-PT-080 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-080, 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-146416418700331"
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 ;