About the Execution of Marcie for S_Diffusion2D-PT-D05N010
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
3991.520 | 767359.00 | 767010.00 | 19.80 | FTFTTFTTTTTTFFTT | 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-2270
Executing tool marcie
Input is S_Diffusion2D-PT-D05N010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r134st-blw3-143297579700080
=====================================================================
--------------------
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 Diffusion2D-PT-D05N010-CTLCardinality-0
FORMULA_NAME Diffusion2D-PT-D05N010-CTLCardinality-1
FORMULA_NAME Diffusion2D-PT-D05N010-CTLCardinality-10
FORMULA_NAME Diffusion2D-PT-D05N010-CTLCardinality-11
FORMULA_NAME Diffusion2D-PT-D05N010-CTLCardinality-12
FORMULA_NAME Diffusion2D-PT-D05N010-CTLCardinality-13
FORMULA_NAME Diffusion2D-PT-D05N010-CTLCardinality-14
FORMULA_NAME Diffusion2D-PT-D05N010-CTLCardinality-15
FORMULA_NAME Diffusion2D-PT-D05N010-CTLCardinality-2
FORMULA_NAME Diffusion2D-PT-D05N010-CTLCardinality-3
FORMULA_NAME Diffusion2D-PT-D05N010-CTLCardinality-4
FORMULA_NAME Diffusion2D-PT-D05N010-CTLCardinality-5
FORMULA_NAME Diffusion2D-PT-D05N010-CTLCardinality-6
FORMULA_NAME Diffusion2D-PT-D05N010-CTLCardinality-7
FORMULA_NAME Diffusion2D-PT-D05N010-CTLCardinality-8
FORMULA_NAME Diffusion2D-PT-D05N010-CTLCardinality-9
=== Now, execution of the tool begins
BK_START 1433366032323
Model: S_Diffusion2D-PT-D05N010
reachability algorithm:
Saturation-based algorithm
variable ordering algorithm:
Calculated like in [Noa99]
--memory=6 --suppress --rs-algorithm=3 --place-order=5
Marcie rev. 1429:1432M (built: crohr on 2014-10-22)
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 --memory=6 --suppress --rs-algorithm=3 --place-order=5
parse successfull
net created successfully
(NrP: 25 NrTr: 144 NrArc: 288)
net check time: 0m0sec
parse formulas successfull
formulas created successfully
place and transition orderings generation:0m0sec
init dd package: 0m3sec
RS generation: 0m0sec
-> reachability set: #nodes 265 (2.6e+02) #states 131,128,140 (8)
starting MCC model checker
--------------------------
checking: EF [AG [[cAMP__4_2_<=cAMP__1_2_ & cAMP__5_4_<=cAMP__1_2_]]]
normalized: E [true U ~ [E [true U ~ [[cAMP__4_2_<=cAMP__1_2_ & cAMP__5_4_<=cAMP__1_2_]]]]]
abstracting: (cAMP__5_4_<=cAMP__1_2_) states: 100,942,636 (8)
abstracting: (cAMP__4_2_<=cAMP__1_2_) states: 100,942,636 (8)
-> the formula is FALSE
FORMULA Diffusion2D-PT-D05N010-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 2m21sec
checking: [E [[cAMP__4_2_<=cAMP__3_1_ | 3<=cAMP__3_2_] U 3<=cAMP__5_1_] & EG [EX [cAMP__1_4_<=cAMP__3_2_]]]
normalized: [E [[cAMP__4_2_<=cAMP__3_1_ | 3<=cAMP__3_2_] U 3<=cAMP__5_1_] & EG [EX [cAMP__1_4_<=cAMP__3_2_]]]
abstracting: (cAMP__1_4_<=cAMP__3_2_) states: 100,942,636 (8)
..
EG iterations: 1
abstracting: (3<=cAMP__5_1_) states: 2,629,575 (6)
abstracting: (3<=cAMP__3_2_) states: 2,629,575 (6)
abstracting: (cAMP__4_2_<=cAMP__3_1_) states: 100,942,636 (8)
-> the formula is TRUE
FORMULA Diffusion2D-PT-D05N010-CTLCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m21sec
checking: [[~ [EX [cAMP__2_1_<=cAMP__1_3_]] & [AF [1<=cAMP__5_1_] | [[2<=cAMP__4_1_ | 1<=cAMP__1_1_] & [cAMP__4_3_<=cAMP__5_2_ | 1<=cAMP__2_4_]]]] | E [[3<=cAMP__5_2_ | cAMP__1_1_<=cAMP__1_4_] U [cAMP__3_3_<=cAMP__1_1_ & cAMP__4_4_<=cAMP__2_5_]]]
normalized: [[[~ [EG [~ [1<=cAMP__5_1_]]] | [[2<=cAMP__4_1_ | 1<=cAMP__1_1_] & [cAMP__4_3_<=cAMP__5_2_ | 1<=cAMP__2_4_]]] & ~ [EX [cAMP__2_1_<=cAMP__1_3_]]] | E [[3<=cAMP__5_2_ | cAMP__1_1_<=cAMP__1_4_] U [cAMP__3_3_<=cAMP__1_1_ & cAMP__4_4_<=cAMP__2_5_]]]
abstracting: (cAMP__4_4_<=cAMP__2_5_) states: 100,942,636 (8)
abstracting: (cAMP__3_3_<=cAMP__1_1_) states: 100,942,636 (8)
abstracting: (cAMP__1_1_<=cAMP__1_4_) states: 100,942,636 (8)
abstracting: (3<=cAMP__5_2_) states: 2,629,575 (6)
abstracting: (cAMP__2_1_<=cAMP__1_3_) states: 100,942,636 (8)
.abstracting: (1<=cAMP__2_4_) states: 38,567,100 (7)
abstracting: (cAMP__4_3_<=cAMP__5_2_) states: 100,942,636 (8)
abstracting: (1<=cAMP__1_1_) states: 38,567,100 (7)
abstracting: (2<=cAMP__4_1_) states: 10,518,300 (7)
abstracting: (1<=cAMP__5_1_) states: 38,567,100 (7)
.
EG iterations: 1
-> the formula is TRUE
FORMULA Diffusion2D-PT-D05N010-CTLCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 4m6sec
checking: E [EF [2<=cAMP__3_3_] U [[cAMP__1_2_<=cAMP__3_4_ & 3<=cAMP__1_5_] & [cAMP__5_5_<=cAMP__2_2_ | 2<=cAMP__5_4_]]]
normalized: E [E [true U 2<=cAMP__3_3_] U [[cAMP__5_5_<=cAMP__2_2_ | 2<=cAMP__5_4_] & [cAMP__1_2_<=cAMP__3_4_ & 3<=cAMP__1_5_]]]
abstracting: (3<=cAMP__1_5_) states: 2,629,575 (6)
abstracting: (cAMP__1_2_<=cAMP__3_4_) states: 100,942,636 (8)
abstracting: (2<=cAMP__5_4_) states: 10,518,300 (7)
abstracting: (cAMP__5_5_<=cAMP__2_2_) states: 100,942,636 (8)
abstracting: (2<=cAMP__3_3_) states: 10,518,300 (7)
-> the formula is TRUE
FORMULA Diffusion2D-PT-D05N010-CTLCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 1m56sec
checking: [AX [AF [3<=cAMP__5_3_]] | EG [EF [3<=cAMP__1_2_]]]
normalized: [EG [E [true U 3<=cAMP__1_2_]] | ~ [EX [EG [~ [3<=cAMP__5_3_]]]]]
abstracting: (3<=cAMP__5_3_) states: 2,629,575 (6)
.
EG iterations: 1
.abstracting: (3<=cAMP__1_2_) states: 2,629,575 (6)
EG iterations: 0
-> the formula is TRUE
FORMULA Diffusion2D-PT-D05N010-CTLCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AX [EF [3<=cAMP__1_5_]]
normalized: ~ [EX [~ [E [true U 3<=cAMP__1_5_]]]]
abstracting: (3<=cAMP__1_5_) states: 2,629,575 (6)
.-> the formula is TRUE
FORMULA Diffusion2D-PT-D05N010-CTLCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: E [~ [1<=cAMP__3_4_] U AG [cAMP__3_5_<=cAMP__3_1_]]
normalized: E [~ [1<=cAMP__3_4_] U ~ [E [true U ~ [cAMP__3_5_<=cAMP__3_1_]]]]
abstracting: (cAMP__3_5_<=cAMP__3_1_) states: 100,942,636 (8)
abstracting: (1<=cAMP__3_4_) states: 38,567,100 (7)
-> the formula is FALSE
FORMULA Diffusion2D-PT-D05N010-CTLCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m18sec
checking: AG [AG [~ [3<=cAMP__4_1_]]]
normalized: ~ [E [true U E [true U 3<=cAMP__4_1_]]]
abstracting: (3<=cAMP__4_1_) states: 2,629,575 (6)
-> the formula is FALSE
FORMULA Diffusion2D-PT-D05N010-CTLCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AG [EF [~ [cAMP__1_2_<=cAMP__2_1_]]]
normalized: ~ [E [true U ~ [E [true U ~ [cAMP__1_2_<=cAMP__2_1_]]]]]
abstracting: (cAMP__1_2_<=cAMP__2_1_) states: 100,942,636 (8)
-> the formula is TRUE
FORMULA Diffusion2D-PT-D05N010-CTLCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 1m22sec
checking: EF [2<=cAMP__1_2_]
normalized: E [true U 2<=cAMP__1_2_]
abstracting: (2<=cAMP__1_2_) states: 10,518,300 (7)
-> the formula is TRUE
FORMULA Diffusion2D-PT-D05N010-CTLCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AG [[[~ [1<=cAMP__1_3_] & ~ [3<=cAMP__1_5_]] | AF [cAMP__2_5_<=cAMP__1_4_]]]
normalized: ~ [E [true U ~ [[[~ [3<=cAMP__1_5_] & ~ [1<=cAMP__1_3_]] | ~ [EG [~ [cAMP__2_5_<=cAMP__1_4_]]]]]]]
abstracting: (cAMP__2_5_<=cAMP__1_4_) states: 100,942,636 (8)
.
EG iterations: 1
abstracting: (1<=cAMP__1_3_) states: 38,567,100 (7)
abstracting: (3<=cAMP__1_5_) states: 2,629,575 (6)
-> the formula is FALSE
FORMULA Diffusion2D-PT-D05N010-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m4sec
checking: AG [[~ [~ [1<=cAMP__5_5_]] | EF [cAMP__2_5_<=cAMP__3_4_]]]
normalized: ~ [E [true U ~ [[1<=cAMP__5_5_ | E [true U cAMP__2_5_<=cAMP__3_4_]]]]]
abstracting: (cAMP__2_5_<=cAMP__3_4_) states: 100,942,636 (8)
abstracting: (1<=cAMP__5_5_) states: 38,567,100 (7)
-> the formula is TRUE
FORMULA Diffusion2D-PT-D05N010-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AG [cAMP__2_4_<=cAMP__2_4_]
normalized: ~ [E [true U ~ [cAMP__2_4_<=cAMP__2_4_]]]
abstracting: (cAMP__2_4_<=cAMP__2_4_) states: 131,128,140 (8)
-> the formula is TRUE
FORMULA Diffusion2D-PT-D05N010-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m1sec
checking: AF [~ [EF [3<=cAMP__3_1_]]]
normalized: ~ [EG [E [true U 3<=cAMP__3_1_]]]
abstracting: (3<=cAMP__3_1_) states: 2,629,575 (6)
EG iterations: 0
-> the formula is FALSE
FORMULA Diffusion2D-PT-D05N010-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: EX [EF [cAMP__3_3_<=cAMP__1_1_]]
normalized: EX [E [true U cAMP__3_3_<=cAMP__1_1_]]
abstracting: (cAMP__3_3_<=cAMP__1_1_) states: 100,942,636 (8)
.-> the formula is TRUE
FORMULA Diffusion2D-PT-D05N010-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 2m6sec
checking: AG [[AX [1<=cAMP__1_3_] | EF [cAMP__4_5_<=cAMP__4_1_]]]
normalized: ~ [E [true U ~ [[E [true U cAMP__4_5_<=cAMP__4_1_] | ~ [EX [~ [1<=cAMP__1_3_]]]]]]]
abstracting: (1<=cAMP__1_3_) states: 38,567,100 (7)
.abstracting: (cAMP__4_5_<=cAMP__4_1_) states: 100,942,636 (8)
-> the formula is TRUE
FORMULA Diffusion2D-PT-D05N010-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m2sec
Total processing time: 12m47sec
BK_STOP 1433366799682
--------------------
content from stderr:
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: 0m0sec
80 136 165 185 203 220 240
iterations count:7924 (55), effective:240 (1)
initing FirstDep: 0m0sec
iterations count:909 (6), effective:24 (0)
550
iterations count:1943 (13), effective:74 (0)
981
iterations count:1266 (8), effective:61 (0)
iterations count:942 (6), effective:24 (0)
257
iterations count:1899 (13), effective:59 (0)
iterations count:943 (6), effective:24 (0)
iterations count:940 (6), effective:24 (0)
iterations count:956 (6), effective:25 (0)
iterations count:941 (6), effective:24 (0)
iterations count:144 (1), effective:0 (0)
iterations count:943 (6), effective:24 (0)
iterations count:943 (6), effective:24 (0)
259
iterations count:1146 (7), effective:36 (0)
iterations count:164 (1), effective:1 (0)
iterations count:942 (6), effective:24 (0)
iterations count:406 (2), effective:13 (0)
iterations count:881 (6), effective:22 (0)
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_Diffusion2D-PT-D05N010"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/user/u8/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_Diffusion2D-PT-D05N010.tgz
mv S_Diffusion2D-PT-D05N010 execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2270"
echo " Executing tool marcie"
echo " Input is S_Diffusion2D-PT-D05N010, 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 r134st-blw3-143297579700080"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "ReachabilityComputeBounds" ] ; 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 ;