About the Execution of Marcie for S_MAPK-PT-160
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15919.440 | 637430.00 | 637020.00 | 20.00 | ??FTF???TT?TT??? | 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-160, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r161kn-blw3-146416418700336
=====================================================================
--------------------
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-160-CTLCardinality-0
FORMULA_NAME MAPK-PT-160-CTLCardinality-1
FORMULA_NAME MAPK-PT-160-CTLCardinality-10
FORMULA_NAME MAPK-PT-160-CTLCardinality-11
FORMULA_NAME MAPK-PT-160-CTLCardinality-12
FORMULA_NAME MAPK-PT-160-CTLCardinality-13
FORMULA_NAME MAPK-PT-160-CTLCardinality-14
FORMULA_NAME MAPK-PT-160-CTLCardinality-15
FORMULA_NAME MAPK-PT-160-CTLCardinality-2
FORMULA_NAME MAPK-PT-160-CTLCardinality-3
FORMULA_NAME MAPK-PT-160-CTLCardinality-4
FORMULA_NAME MAPK-PT-160-CTLCardinality-5
FORMULA_NAME MAPK-PT-160-CTLCardinality-6
FORMULA_NAME MAPK-PT-160-CTLCardinality-7
FORMULA_NAME MAPK-PT-160-CTLCardinality-8
FORMULA_NAME MAPK-PT-160-CTLCardinality-9
=== Now, execution of the tool begins
BK_START 1464341518730
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_160
(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.832sec
RS generation: 0m11.982sec
-> reachability set: #nodes 45042 (4.5e+04) #states 106,396,433,139,394,621,907,453 (23)
starting MCC model checker
--------------------------
checking: ~ [~ [EF [2<=ERKPP_Phase3]]]
normalized: E [true U 2<=ERKPP_Phase3]
abstracting: (2<=ERKPP_Phase3) states: 98,698,513,935,436,414,461,630 (22)
-> the formula is TRUE
FORMULA MAPK-PT-160-CTLCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 3.477sec
checking: ~ [AG [AG [1<=MEK]]]
normalized: E [true U E [true U ~ [1<=MEK]]]
abstracting: (1<=MEK) states: 97,745,613,474,080,011,476,940 (22)
-> the formula is TRUE
FORMULA MAPK-PT-160-CTLCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 3m37.212sec
checking: ~ [EF [AG [1<=MEKPP_Phase2]]]
normalized: ~ [E [true U ~ [E [true U ~ [1<=MEKPP_Phase2]]]]]
abstracting: (1<=MEKPP_Phase2) states: 97,745,613,474,080,011,476,940 (22)
-> the formula is TRUE
FORMULA MAPK-PT-160-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 1m12.273sec
checking: EX [~ [EF [3<=MEKP_RafP]]]
normalized: EX [~ [E [true U 3<=MEKP_RafP]]]
abstracting: (3<=MEKP_RafP) states: 78,511,864,673,280,488,628,953 (22)
.-> the formula is FALSE
FORMULA MAPK-PT-160-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m25.885sec
checking: AG [A [2<=ERKP_Phase3 U 1<=Phase2]]
normalized: ~ [E [true U ~ [[~ [EG [~ [1<=Phase2]]] & ~ [E [~ [1<=Phase2] U [~ [2<=ERKP_Phase3] & ~ [1<=Phase2]]]]]]]]
abstracting: (1<=Phase2) states: 106,396,432,834,043,147,977,082 (23)
abstracting: (2<=ERKP_Phase3) states: 98,698,513,935,436,414,461,630 (22)
abstracting: (1<=Phase2) states: 106,396,432,834,043,147,977,082 (23)
abstracting: (1<=Phase2) states: 106,396,432,834,043,147,977,082 (23)
.
EG iterations: 1
-> the formula is FALSE
FORMULA MAPK-PT-160-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 4m 3.406sec
checking: AG [EF [[1<=Raf_RasGTP | Phase2<=ERK_MEKPP]]]
normalized: ~ [E [true U ~ [E [true U [1<=Raf_RasGTP | Phase2<=ERK_MEKPP]]]]]
abstracting: (Phase2<=ERK_MEKPP) states: 5,751,737,823,228,507 (15)
abstracting: (1<=Raf_RasGTP) states: 102,992,967,839,613,618,244,940 (23)
-> the formula is TRUE
FORMULA MAPK-PT-160-CTLCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m16.356sec
checking: EX [EF [[ERKPP<=ERKPP_Phase3 & 2<=ERKPP]]]
normalized: EX [E [true U [ERKPP<=ERKPP_Phase3 & 2<=ERKPP]]]
abstracting: (2<=ERKPP) states: 98,698,513,935,436,414,461,630 (22)
abstracting: (ERKPP<=ERKPP_Phase3) states: 54,187,938,556,893,178,736,827 (22)
.-> the formula is TRUE
FORMULA MAPK-PT-160-CTLCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m14.390sec
checking: AF [[AG [RafP_Phase1<=ERK] & ~ [3<=ERKP_Phase3]]]
normalized: ~ [EG [~ [[~ [3<=ERKP_Phase3] & ~ [E [true U ~ [RafP_Phase1<=ERK]]]]]]]
abstracting: (RafP_Phase1<=ERK) states: 32,518,505,254,584,477,281,924 (22)
FORMULA MAPK-PT-160-CTLCardinality-9 CANNOT_COMPUTE
MC time: 0m19.436sec
checking: [~ [MEK<=Phase3] | EF [~ [[1<=ERK | 2<=Raf]]]]
normalized: [E [true U ~ [[1<=ERK | 2<=Raf]]] | ~ [MEK<=Phase3]]
FORMULA MAPK-PT-160-CTLCardinality-0 CANNOT_COMPUTE
MC time: 0m 0.000sec
checking: AG [[MEKP_Phase2<=ERKP | MEKPP<=Phase2]]
normalized: ~ [E [true U ~ [[MEKP_Phase2<=ERKP | MEKPP<=Phase2]]]]
FORMULA MAPK-PT-160-CTLCardinality-7 CANNOT_COMPUTE
MC time: 0m 0.000sec
checking: E [[3<=RasGTP | 3<=RasGTP] U EF [Raf<=ERK]]
normalized: E [[3<=RasGTP | 3<=RasGTP] U E [true U Raf<=ERK]]
FORMULA MAPK-PT-160-CTLCardinality-8 CANNOT_COMPUTE
MC time: 0m 0.000sec
checking: [E [ERK_MEKPP<=RafP_Phase1 U [2<=ERKPP & 3<=MEKPP]] | ~ [~ [EX [1<=MEKPP_Phase2]]]]
normalized: [E [ERK_MEKPP<=RafP_Phase1 U [2<=ERKPP & 3<=MEKPP]] | EX [1<=MEKPP_Phase2]]
FORMULA MAPK-PT-160-CTLCardinality-14 CANNOT_COMPUTE
MC time: 0m 0.001sec
checking: E [~ [[Phase2<=RafP | 3<=RafP_Phase1]] U AG [ERKP_Phase3<=MEKP_RafP]]
normalized: E [~ [[Phase2<=RafP | 3<=RafP_Phase1]] U ~ [E [true U ~ [ERKP_Phase3<=MEKP_RafP]]]]
FORMULA MAPK-PT-160-CTLCardinality-15 CANNOT_COMPUTE
MC time: 0m 0.000sec
checking: ~ [[3<=ERKP | [~ [[Phase1<=Phase3 | ERKPP_Phase3<=ERKPP_Phase3]] | AG [ERKPP_Phase3<=Phase3]]]]
normalized: ~ [[3<=ERKP | [~ [E [true U ~ [ERKPP_Phase3<=Phase3]]] | ~ [[Phase1<=Phase3 | ERKPP_Phase3<=ERKPP_Phase3]]]]]
FORMULA MAPK-PT-160-CTLCardinality-1 CANNOT_COMPUTE
MC time: 0m 0.000sec
checking: E [[[MEKP<=ERKP_Phase3 | Phase1<=ERKP_MEKPP] & [MEK_RafP<=ERKP | 2<=ERKP_MEKPP]] U [3<=ERKP_MEKPP | Raf<=RasGTP]]
normalized: E [[[MEK_RafP<=ERKP | 2<=ERKP_MEKPP] & [MEKP<=ERKP_Phase3 | Phase1<=ERKP_MEKPP]] U [3<=ERKP_MEKPP | Raf<=RasGTP]]
FORMULA MAPK-PT-160-CTLCardinality-13 CANNOT_COMPUTE
MC time: 0m 0.000sec
checking: [EF [[[3<=Raf_RasGTP | 2<=Raf_RasGTP] & [Raf_RasGTP<=ERKP_MEKPP & MEK_RafP<=ERKPP_Phase3]]] | [A [ERKP<=RafP U 2<=MEKPP_Phase2] & [MEKPP<=RafP_Phase1 & EG [ERKP<=ERKP_MEKPP]]]]
normalized: [[[MEKPP<=RafP_Phase1 & EG [ERKP<=ERKP_MEKPP]] & [~ [EG [~ [2<=MEKPP_Phase2]]] & ~ [E [~ [2<=MEKPP_Phase2] U [~ [ERKP<=RafP] & ~ [2<=MEKPP_Phase2]]]]]] | E [true U [[Raf_RasGTP<=ERKP_MEKPP & MEK_RafP<=ERKPP_Phase3] & [3<=Raf_RasGTP | 2<=Raf_RasGTP]]]]
FORMULA MAPK-PT-160-CTLCardinality-4 CANNOT_COMPUTE
MC time: 0m 0.000sec
Total processing time: 10m37.090sec
BK_STOP 1464342156160
--------------------
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
6307 6456 6674 13266 16059 19637 23860 23900 23861 20609 20310 20354 30114 31344 44624 34464 35769 36795 39819 38284
iterations count:20910 (697), effective:3440 (114)
initing FirstDep: 0m 0.000sec
iterations count:410 (13), effective:62 (2)
46507
iterations count:1470 (49), effective:320 (10)
iterations count:30 (1), effective:0 (0)
iterations count:590 (19), effective:80 (2)
iterations count:258 (8), effective:42 (1)
iterations count:744 (24), effective:119 (3)
24460 27889 32200 38982
iterations count:4430 (147), effective:800 (26)
iterations count:38 (1), effective:3 (0)
44467
iterations count:1140 (38), effective:182 (6)
std::bad_alloc
std::bad_alloc
std::bad_alloc
std::bad_alloc
std::bad_alloc
std::bad_alloc
std::bad_alloc
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-160"
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-160.tgz
mv S_MAPK-PT-160 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-160, 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-146416418700336"
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 '
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 ;