About the Execution of Marcie for S_ERK-PT-000010
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5413.860 | 5877.00 | 5039.00 | 10.10 | TFTTTFTTFTTFFTTF | 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_ERK-PT-000010, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r149kn-smll-146416258900448
=====================================================================
--------------------
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 ERK-PT-000010-ReachabilityCardinality-0
FORMULA_NAME ERK-PT-000010-ReachabilityCardinality-1
FORMULA_NAME ERK-PT-000010-ReachabilityCardinality-10
FORMULA_NAME ERK-PT-000010-ReachabilityCardinality-11
FORMULA_NAME ERK-PT-000010-ReachabilityCardinality-12
FORMULA_NAME ERK-PT-000010-ReachabilityCardinality-13
FORMULA_NAME ERK-PT-000010-ReachabilityCardinality-14
FORMULA_NAME ERK-PT-000010-ReachabilityCardinality-15
FORMULA_NAME ERK-PT-000010-ReachabilityCardinality-2
FORMULA_NAME ERK-PT-000010-ReachabilityCardinality-3
FORMULA_NAME ERK-PT-000010-ReachabilityCardinality-4
FORMULA_NAME ERK-PT-000010-ReachabilityCardinality-5
FORMULA_NAME ERK-PT-000010-ReachabilityCardinality-6
FORMULA_NAME ERK-PT-000010-ReachabilityCardinality-7
FORMULA_NAME ERK-PT-000010-ReachabilityCardinality-8
FORMULA_NAME ERK-PT-000010-ReachabilityCardinality-9
=== Now, execution of the tool begins
BK_START 1464353879262
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: ERK_PT_000010
(NrP: 11 NrTr: 11 NrArc: 34)
net check time: 0m 0.000sec
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
init dd package: 0m 4.277sec
RS generation: 0m 0.001sec
-> reachability set: #nodes 111 (1.1e+02) #states 47,047 (4)
starting MCC model checker
--------------------------
checking: AG [2<=RP]
normalized: ~ [E [true U ~ [2<=RP]]]
abstracting: (2<=RP) states: 46,728 (4)
-> the formula is FALSE
FORMULA ERK-PT-000010-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EF [RP<=Raf1Star_RKIP_ERKPP]
normalized: E [true U RP<=Raf1Star_RKIP_ERKPP]
abstracting: (RP<=Raf1Star_RKIP_ERKPP) states: 286
-> the formula is TRUE
FORMULA ERK-PT-000010-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: AG [Raf1Star_RKIP_ERKPP<=RP]
normalized: ~ [E [true U ~ [Raf1Star_RKIP_ERKPP<=RP]]]
abstracting: (Raf1Star_RKIP_ERKPP<=RP) states: 47,047 (4)
-> the formula is TRUE
FORMULA ERK-PT-000010-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [~ [~ [MEKPP_ERK<=MEKPP_ERK]]]
normalized: ~ [E [true U ~ [MEKPP_ERK<=MEKPP_ERK]]]
abstracting: (MEKPP_ERK<=MEKPP_ERK) states: 47,047 (4)
-> the formula is TRUE
FORMULA ERK-PT-000010-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [RKIPP<=MEKPP]
normalized: ~ [E [true U ~ [RKIPP<=MEKPP]]]
abstracting: (RKIPP<=MEKPP) states: 43,939 (4)
-> the formula is FALSE
FORMULA ERK-PT-000010-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.011sec
checking: AG [Raf1Star_RKIP_ERKPP<=Raf1Star_RKIP_ERKPP]
normalized: ~ [E [true U ~ [Raf1Star_RKIP_ERKPP<=Raf1Star_RKIP_ERKPP]]]
abstracting: (Raf1Star_RKIP_ERKPP<=Raf1Star_RKIP_ERKPP) states: 47,047 (4)
-> the formula is TRUE
FORMULA ERK-PT-000010-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [~ [[~ [RP<=RP] & 3<=RKIP]]]
normalized: ~ [E [true U [3<=RKIP & ~ [RP<=RP]]]]
abstracting: (RP<=RP) states: 47,047 (4)
abstracting: (3<=RKIP) states: 17,160 (4)
-> the formula is TRUE
FORMULA ERK-PT-000010-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [[3<=RKIPP_RP | [[1<=Raf1Star | 1<=Raf1Star] & [1<=MEKPP_ERK | 2<=RP]]]]
normalized: ~ [E [true U ~ [[3<=RKIPP_RP | [[1<=MEKPP_ERK | 2<=RP] & [1<=Raf1Star | 1<=Raf1Star]]]]]]
abstracting: (1<=Raf1Star) states: 46,761 (4)
abstracting: (1<=Raf1Star) states: 46,761 (4)
abstracting: (2<=RP) states: 46,728 (4)
abstracting: (1<=MEKPP_ERK) states: 38,038 (4)
abstracting: (3<=RKIPP_RP) states: 17,160 (4)
-> the formula is FALSE
FORMULA ERK-PT-000010-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [~ [[RKIPP_RP<=RKIPP_RP | [ERKPP<=RP | 3<=MEKPP_ERK]]]]
normalized: E [true U ~ [[RKIPP_RP<=RKIPP_RP | [ERKPP<=RP | 3<=MEKPP_ERK]]]]
abstracting: (3<=MEKPP_ERK) states: 23,022 (4)
abstracting: (ERKPP<=RP) states: 43,939 (4)
abstracting: (RKIPP_RP<=RKIPP_RP) states: 47,047 (4)
-> the formula is FALSE
FORMULA ERK-PT-000010-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EF [~ [[[3<=Raf1Star_RKIP & Raf1Star<=Raf1Star_RKIP] | [2<=Raf1Star & 2<=Raf1Star]]]]
normalized: E [true U ~ [[[2<=Raf1Star & 2<=Raf1Star] | [3<=Raf1Star_RKIP & Raf1Star<=Raf1Star_RKIP]]]]
abstracting: (Raf1Star<=Raf1Star_RKIP) states: 8,904 (3)
abstracting: (3<=Raf1Star_RKIP) states: 17,160 (4)
abstracting: (2<=Raf1Star) states: 45,906 (4)
abstracting: (2<=Raf1Star) states: 45,906 (4)
-> the formula is TRUE
FORMULA ERK-PT-000010-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EF [~ [[[RKIP<=RKIP | 1<=ERK] & [2<=Raf1Star | Raf1Star_RKIP_ERKPP<=ERK]]]]
normalized: E [true U ~ [[[RKIP<=RKIP | 1<=ERK] & [2<=Raf1Star | Raf1Star_RKIP_ERKPP<=ERK]]]]
abstracting: (Raf1Star_RKIP_ERKPP<=ERK) states: 35,756 (4)
abstracting: (2<=Raf1Star) states: 45,906 (4)
abstracting: (1<=ERK) states: 38,038 (4)
abstracting: (RKIP<=RKIP) states: 47,047 (4)
-> the formula is TRUE
FORMULA ERK-PT-000010-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AG [[[[MEKPP<=RKIPP & ERKPP<=RKIPP] | ~ [1<=ERK]] | 1<=RP]]
normalized: ~ [E [true U ~ [[1<=RP | [~ [1<=ERK] | [MEKPP<=RKIPP & ERKPP<=RKIPP]]]]]]
abstracting: (ERKPP<=RKIPP) states: 23,023 (4)
abstracting: (MEKPP<=RKIPP) states: 4,900 (3)
abstracting: (1<=ERK) states: 38,038 (4)
abstracting: (1<=RP) states: 46,981 (4)
-> the formula is FALSE
FORMULA ERK-PT-000010-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: AG [[Raf1Star_RKIP_ERKPP<=MEKPP | [[3<=ERKPP & 1<=RKIP] & RKIPP_RP<=MEKPP_ERK]]]
normalized: ~ [E [true U ~ [[Raf1Star_RKIP_ERKPP<=MEKPP | [RKIPP_RP<=MEKPP_ERK & [3<=ERKPP & 1<=RKIP]]]]]]
abstracting: (1<=RKIP) states: 34,749 (4)
abstracting: (3<=ERKPP) states: 23,022 (4)
abstracting: (RKIPP_RP<=MEKPP_ERK) states: 31,031 (4)
abstracting: (Raf1Star_RKIP_ERKPP<=MEKPP) states: 47,047 (4)
-> the formula is TRUE
FORMULA ERK-PT-000010-ReachabilityCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EF [[[[3<=RP & 1<=Raf1Star] & [1<=RP & 3<=RKIPP]] | RP<=RKIPP]]
normalized: E [true U [RP<=RKIPP | [[1<=RP & 3<=RKIPP] & [3<=RP & 1<=Raf1Star]]]]
abstracting: (1<=Raf1Star) states: 46,761 (4)
abstracting: (3<=RP) states: 46,122 (4)
abstracting: (3<=RKIPP) states: 17,160 (4)
abstracting: (1<=RP) states: 46,981 (4)
abstracting: (RP<=RKIPP) states: 726
-> the formula is TRUE
FORMULA ERK-PT-000010-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AG [[[~ [3<=RKIP] | 1<=Raf1Star] | [[2<=ERKPP | RKIPP_RP<=RP] | ~ [MEKPP_ERK<=RKIPP_RP]]]]
normalized: ~ [E [true U ~ [[[~ [MEKPP_ERK<=RKIPP_RP] | [2<=ERKPP | RKIPP_RP<=RP]] | [1<=Raf1Star | ~ [3<=RKIP]]]]]]
abstracting: (3<=RKIP) states: 17,160 (4)
abstracting: (1<=Raf1Star) states: 46,761 (4)
abstracting: (RKIPP_RP<=RP) states: 43,015 (4)
abstracting: (2<=ERKPP) states: 30,030 (4)
abstracting: (MEKPP_ERK<=RKIPP_RP) states: 23,023 (4)
-> the formula is TRUE
FORMULA ERK-PT-000010-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EF [[[[RP<=Raf1Star_RKIP | 2<=ERKPP] & [RP<=RP | RP<=MEKPP_ERK]] & ~ [[MEKPP<=RKIP | ERK<=MEKPP]]]]
normalized: E [true U [~ [[MEKPP<=RKIP | ERK<=MEKPP]] & [[RP<=RP | RP<=MEKPP_ERK] & [RP<=Raf1Star_RKIP | 2<=ERKPP]]]]
abstracting: (2<=ERKPP) states: 30,030 (4)
abstracting: (RP<=Raf1Star_RKIP) states: 726
abstracting: (RP<=MEKPP_ERK) states: 4,900 (3)
abstracting: (RP<=RP) states: 47,047 (4)
abstracting: (ERK<=MEKPP) states: 47,047 (4)
abstracting: (MEKPP<=RKIP) states: 4,900 (3)
-> the formula is FALSE
FORMULA ERK-PT-000010-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
Total processing time: 0m 5.841sec
BK_STOP 1464353885139
--------------------
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
iterations count:251 (22), effective:80 (7)
initing FirstDep: 0m 0.000sec
iterations count:191 (17), effective:54 (4)
iterations count:131 (11), effective:50 (4)
iterations count:130 (11), effective:37 (3)
iterations count:111 (10), effective:30 (2)
iterations count:149 (13), effective:51 (4)
iterations count:116 (10), effective:39 (3)
iterations count:220 (20), effective:63 (5)
iterations count:62 (5), effective:15 (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="S_ERK-PT-000010"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/root/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_ERK-PT-000010.tgz
mv S_ERK-PT-000010 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_ERK-PT-000010, 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 r149kn-smll-146416258900448"
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 '
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 ;