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-D05N250, examination is ReachabilityBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r134st-blw3-143297579800151
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1433369607225

Model: S_Diffusion2D-PT-D05N250
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=ReachabilityBounds.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: 0m33sec


-> reachability set: #nodes 6025 (6.0e+03) #states 18,313,502,239,453,414,183,262,224,909,769,376 (34)



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

checking: [[maxVal(cAMP__1_5_)<=2 & maxVal(cAMP__3_4_)<=2] & maxVal(cAMP__5_1_)<=2]
normalized: [maxVal(cAMP__5_1_)<=2 & [maxVal(cAMP__1_5_)<=2 & maxVal(cAMP__3_4_)<=2]]

abstracting: (250<=2) states: 0
abstracting: (250<=2) states: 0
abstracting: (250<=2) states: 0
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N250-ReachabilityBounds-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(cAMP__3_5_)<=3
normalized: maxVal(cAMP__3_5_)<=3

abstracting: (250<=3) states: 0
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N250-ReachabilityBounds-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[[maxVal(cAMP__1_2_)<=2 & maxVal(cAMP__5_1_)<=3] & [[[[maxVal(cAMP__5_3_)<=1 & maxVal(cAMP__4_4_)<=1] & [maxVal(cAMP__2_3_)<=3 & maxVal(cAMP__1_4_)<=1]] & maxVal(cAMP__1_1_)<=3] & maxVal(cAMP__2_3_)<=1]] & maxVal(cAMP__2_3_)<=3]
normalized: [maxVal(cAMP__2_3_)<=3 & [[maxVal(cAMP__1_2_)<=2 & maxVal(cAMP__5_1_)<=3] & [maxVal(cAMP__2_3_)<=1 & [maxVal(cAMP__1_1_)<=3 & [[maxVal(cAMP__5_3_)<=1 & maxVal(cAMP__4_4_)<=1] & [maxVal(cAMP__2_3_)<=3 & maxVal(cAMP__1_4_)<=1]]]]]]

abstracting: (250<=1) states: 0
abstracting: (250<=3) states: 0
abstracting: (250<=1) states: 0
abstracting: (250<=1) states: 0
abstracting: (250<=3) states: 0
abstracting: (250<=1) states: 0
abstracting: (250<=3) states: 0
abstracting: (250<=2) states: 0
abstracting: (250<=3) states: 0
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N250-ReachabilityBounds-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(cAMP__4_3_)<=2 & [maxVal(cAMP__1_2_)<=3 & maxVal(cAMP__5_1_)<=3]]
normalized: [maxVal(cAMP__4_3_)<=2 & [maxVal(cAMP__1_2_)<=3 & maxVal(cAMP__5_1_)<=3]]

abstracting: (250<=3) states: 0
abstracting: (250<=3) states: 0
abstracting: (250<=2) states: 0
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N250-ReachabilityBounds-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[maxVal(cAMP__4_1_)<=1 & [maxVal(cAMP__3_5_)<=2 & maxVal(cAMP__5_2_)<=3]] & maxVal(cAMP__4_2_)<=3]
normalized: [maxVal(cAMP__4_2_)<=3 & [maxVal(cAMP__4_1_)<=1 & [maxVal(cAMP__3_5_)<=2 & maxVal(cAMP__5_2_)<=3]]]

abstracting: (250<=3) states: 0
abstracting: (250<=2) states: 0
abstracting: (250<=1) states: 0
abstracting: (250<=3) states: 0
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N250-ReachabilityBounds-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(cAMP__2_4_)<=3
normalized: maxVal(cAMP__2_4_)<=3

abstracting: (250<=3) states: 0
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N250-ReachabilityBounds-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(cAMP__2_3_)<=3
normalized: maxVal(cAMP__2_3_)<=3

abstracting: (250<=3) states: 0
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N250-ReachabilityBounds-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(cAMP__4_2_)<=2 & maxVal(cAMP__1_3_)<=2]
normalized: [maxVal(cAMP__4_2_)<=2 & maxVal(cAMP__1_3_)<=2]

abstracting: (250<=2) states: 0
abstracting: (250<=2) states: 0
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N250-ReachabilityBounds-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(cAMP__1_3_)<=1
normalized: maxVal(cAMP__1_3_)<=1

abstracting: (250<=1) states: 0
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N250-ReachabilityBounds-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(cAMP__5_3_)<=2
normalized: maxVal(cAMP__5_3_)<=2

abstracting: (250<=2) states: 0
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N250-ReachabilityBounds-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(cAMP__1_3_)<=3
normalized: maxVal(cAMP__1_3_)<=3

abstracting: (250<=3) states: 0
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N250-ReachabilityBounds-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[maxVal(cAMP__2_5_)<=1 & [maxVal(cAMP__3_4_)<=1 & [[maxVal(cAMP__4_4_)<=2 & [maxVal(cAMP__5_4_)<=1 & maxVal(cAMP__4_2_)<=2]] & [maxVal(cAMP__1_3_)<=2 & maxVal(cAMP__1_1_)<=1]]]] & maxVal(cAMP__1_1_)<=3]
normalized: [maxVal(cAMP__1_1_)<=3 & [maxVal(cAMP__2_5_)<=1 & [maxVal(cAMP__3_4_)<=1 & [[maxVal(cAMP__4_4_)<=2 & [maxVal(cAMP__5_4_)<=1 & maxVal(cAMP__4_2_)<=2]] & [maxVal(cAMP__1_3_)<=2 & maxVal(cAMP__1_1_)<=1]]]]]

abstracting: (250<=1) states: 0
abstracting: (250<=2) states: 0
abstracting: (250<=2) states: 0
abstracting: (250<=1) states: 0
abstracting: (250<=2) states: 0
abstracting: (250<=1) states: 0
abstracting: (250<=1) states: 0
abstracting: (250<=3) states: 0
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N250-ReachabilityBounds-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(cAMP__3_2_)<=2 & maxVal(cAMP__3_5_)<=2]
normalized: [maxVal(cAMP__3_2_)<=2 & maxVal(cAMP__3_5_)<=2]

abstracting: (250<=2) states: 0
abstracting: (250<=2) states: 0
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N250-ReachabilityBounds-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(cAMP__1_3_)<=1
normalized: maxVal(cAMP__1_3_)<=1

abstracting: (250<=1) states: 0
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N250-ReachabilityBounds-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[[[maxVal(cAMP__1_3_)<=2 & [[maxVal(cAMP__1_2_)<=1 & maxVal(cAMP__4_3_)<=2] & maxVal(cAMP__4_3_)<=2]] & maxVal(cAMP__3_2_)<=3] & [maxVal(cAMP__5_4_)<=1 & maxVal(cAMP__3_3_)<=3]] & maxVal(cAMP__5_3_)<=1]
normalized: [maxVal(cAMP__5_3_)<=1 & [[maxVal(cAMP__3_2_)<=3 & [maxVal(cAMP__1_3_)<=2 & [maxVal(cAMP__4_3_)<=2 & [maxVal(cAMP__1_2_)<=1 & maxVal(cAMP__4_3_)<=2]]]] & [maxVal(cAMP__5_4_)<=1 & maxVal(cAMP__3_3_)<=3]]]

abstracting: (250<=3) states: 0
abstracting: (250<=1) states: 0
abstracting: (250<=2) states: 0
abstracting: (250<=1) states: 0
abstracting: (250<=2) states: 0
abstracting: (250<=2) states: 0
abstracting: (250<=3) states: 0
abstracting: (250<=1) states: 0
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N250-ReachabilityBounds-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[maxVal(cAMP__3_1_)<=2 & [maxVal(cAMP__2_4_)<=3 & maxVal(cAMP__1_5_)<=3]] & maxVal(cAMP__1_2_)<=2]
normalized: [maxVal(cAMP__1_2_)<=2 & [maxVal(cAMP__3_1_)<=2 & [maxVal(cAMP__2_4_)<=3 & maxVal(cAMP__1_5_)<=3]]]

abstracting: (250<=3) states: 0
abstracting: (250<=3) states: 0
abstracting: (250<=2) states: 0
abstracting: (250<=2) states: 0
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N250-ReachabilityBounds-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec


Total processing time: 1m2sec


BK_STOP 1433369669370

--------------------
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 192 248 304 383 443 503 563 623 683 743 854 918 982 1046 1110 1174 1238 1381 1449 1517 1585 1653 1721 1789 1857 2036 2108 2180 2252 2324 2396 2468 2679 2755 2831 2907 3138 3218 3298 3378 3458 3713 3797 3881 4339 2508 2560 2612 2664 2716 2768 2820 2872 2924 2976 3028 3080 3370 3426 3482 3279 3301 3322 3343 3365 3386 3407 3428 3450 3471 3492 3513 3538 3569 3599 3629 3660 3690 3720 3751 3778 3793 3809 3824 3840 3855 3870 3886 3901 3917 3932 3947 3963 3978 3993 4009 4024 4043 4063 4083 4102 4122 4141 4161 4181 4200 4220 4239 4259 4278 4297 4315 4333 4351 4369 4387 4406 4424 4442 4460 4478 4497 4515 4531 4545 4558 4572 4586 4599 4613 4627 4641 4654 4668 4682 4695 4709 4723 4736 4750 4764 4780 4815 4849 4884 4918 4953 4987 5022 5041 5059 5076 5094 5111 5129 5146 5164 5181 5199 5216 5234 5252 5269 5286 5303 5320 5337 5354 5371 5388 5405 5422 5439 5456 5473 5489 5506 5523 5552 5582 5612 5643 5673 5703 5734 5764 5800 5840 5880 5920 5960 6000
iterations count:194644 (1351), effective:6000 (41)

initing FirstDep: 0m0sec

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-D05N250"
export BK_EXAMINATION="ReachabilityBounds"
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-D05N250.tgz
mv S_Diffusion2D-PT-D05N250 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-D05N250, examination is ReachabilityBounds"
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-143297579800151"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityBounds" = "ReachabilityComputeBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityBounds" != "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 "ReachabilityBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityBounds.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 '' ReachabilityBounds.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 ;