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

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

=== Now, execution of the tool begins

BK_START 1433369654566

Model: S_Diffusion2D-PT-D05N300
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: 0m48sec


-> reachability set: #nodes 7225 (7.2e+03) #states 1,205,415,014,974,454,321,389,844,651,253,260,376 (36)



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

checking: [[[maxVal(cAMP__3_5_)<=2 & [[maxVal(cAMP__1_3_)<=2 & maxVal(cAMP__2_4_)<=2] & maxVal(cAMP__1_2_)<=3]] & [[[maxVal(cAMP__5_4_)<=2 & maxVal(cAMP__1_1_)<=3] & [[maxVal(cAMP__3_1_)<=1 & maxVal(cAMP__2_5_)<=2] & maxVal(cAMP__4_4_)<=3]] & [[[maxVal(cAMP__2_5_)<=2 & maxVal(cAMP__1_5_)<=1] & [maxVal(cAMP__1_5_)<=3 & maxVal(cAMP__3_4_)<=1]] & [maxVal(cAMP__1_2_)<=3 & maxVal(cAMP__2_4_)<=2]]]] & [[maxVal(cAMP__3_1_)<=1 & maxVal(cAMP__1_4_)<=2] & maxVal(cAMP__3_2_)<=3]]
normalized: [[[maxVal(cAMP__3_5_)<=2 & [maxVal(cAMP__1_2_)<=3 & [maxVal(cAMP__1_3_)<=2 & maxVal(cAMP__2_4_)<=2]]] & [[[maxVal(cAMP__5_4_)<=2 & maxVal(cAMP__1_1_)<=3] & [maxVal(cAMP__4_4_)<=3 & [maxVal(cAMP__3_1_)<=1 & maxVal(cAMP__2_5_)<=2]]] & [[[maxVal(cAMP__2_5_)<=2 & maxVal(cAMP__1_5_)<=1] & [maxVal(cAMP__1_5_)<=3 & maxVal(cAMP__3_4_)<=1]] & [maxVal(cAMP__1_2_)<=3 & maxVal(cAMP__2_4_)<=2]]]] & [maxVal(cAMP__3_2_)<=3 & [maxVal(cAMP__3_1_)<=1 & maxVal(cAMP__1_4_)<=2]]]

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

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

MC time: 0m0sec

checking: [[[maxVal(cAMP__3_2_)<=3 & [maxVal(cAMP__1_4_)<=2 & [maxVal(cAMP__4_3_)<=2 & [maxVal(cAMP__5_4_)<=3 & maxVal(cAMP__3_5_)<=2]]]] & maxVal(cAMP__2_1_)<=1] & maxVal(cAMP__2_4_)<=2]
normalized: [maxVal(cAMP__2_4_)<=2 & [maxVal(cAMP__2_1_)<=1 & [maxVal(cAMP__3_2_)<=3 & [maxVal(cAMP__1_4_)<=2 & [maxVal(cAMP__4_3_)<=2 & [maxVal(cAMP__5_4_)<=3 & maxVal(cAMP__3_5_)<=2]]]]]]

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

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

MC time: 0m0sec

checking: [[maxVal(cAMP__1_4_)<=3 & [maxVal(cAMP__2_5_)<=1 & maxVal(cAMP__4_1_)<=2]] & [maxVal(cAMP__5_2_)<=3 & [[maxVal(cAMP__1_2_)<=3 & maxVal(cAMP__5_5_)<=3] & [[maxVal(cAMP__1_2_)<=2 & maxVal(cAMP__4_2_)<=1] & maxVal(cAMP__2_1_)<=1]]]]
normalized: [[maxVal(cAMP__5_2_)<=3 & [[maxVal(cAMP__1_2_)<=3 & maxVal(cAMP__5_5_)<=3] & [maxVal(cAMP__2_1_)<=1 & [maxVal(cAMP__1_2_)<=2 & maxVal(cAMP__4_2_)<=1]]]] & [maxVal(cAMP__1_4_)<=3 & [maxVal(cAMP__2_5_)<=1 & maxVal(cAMP__4_1_)<=2]]]

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

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

MC time: 0m0sec

checking: [maxVal(cAMP__2_5_)<=2 & [maxVal(cAMP__2_4_)<=2 & [[maxVal(cAMP__4_5_)<=3 & [maxVal(cAMP__3_4_)<=2 & maxVal(cAMP__2_4_)<=3]] & [[[maxVal(cAMP__3_5_)<=3 & maxVal(cAMP__3_4_)<=1] & maxVal(cAMP__1_4_)<=1] & [maxVal(cAMP__3_2_)<=1 & [maxVal(cAMP__3_5_)<=1 & maxVal(cAMP__2_1_)<=2]]]]]]
normalized: [maxVal(cAMP__2_5_)<=2 & [maxVal(cAMP__2_4_)<=2 & [[[maxVal(cAMP__1_4_)<=1 & [maxVal(cAMP__3_5_)<=3 & maxVal(cAMP__3_4_)<=1]] & [maxVal(cAMP__3_2_)<=1 & [maxVal(cAMP__3_5_)<=1 & maxVal(cAMP__2_1_)<=2]]] & [maxVal(cAMP__4_5_)<=3 & [maxVal(cAMP__3_4_)<=2 & maxVal(cAMP__2_4_)<=3]]]]]

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

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec

checking: [maxVal(cAMP__4_4_)<=2 & [[[maxVal(cAMP__3_4_)<=3 & [maxVal(cAMP__5_3_)<=1 & maxVal(cAMP__4_1_)<=1]] & maxVal(cAMP__2_3_)<=2] & maxVal(cAMP__4_4_)<=2]]
normalized: [maxVal(cAMP__4_4_)<=2 & [maxVal(cAMP__4_4_)<=2 & [maxVal(cAMP__2_3_)<=2 & [maxVal(cAMP__3_4_)<=3 & [maxVal(cAMP__5_3_)<=1 & maxVal(cAMP__4_1_)<=1]]]]]

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

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec

checking: [[maxVal(cAMP__5_4_)<=1 & maxVal(cAMP__2_4_)<=1] & maxVal(cAMP__1_3_)<=1]
normalized: [maxVal(cAMP__1_3_)<=1 & [maxVal(cAMP__5_4_)<=1 & maxVal(cAMP__2_4_)<=1]]

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

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec


Total processing time: 1m36sec


BK_STOP 1433369751602

--------------------
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 3538 3594 3650 3706 3762 3818 4148 4208 4268 4328 4388 4448 4508 3939 3960 3982 4003 4024 4045 4067 4088 4109 4130 4152 4173 4194 4216 4241 4272 4302 4332 4363 4393 4423 4454 4484 4514 4535 4550 4566 4581 4597 4612 4627 4643 4658 4673 4689 4704 4720 4735 4750 4766 4781 4797 4812 4828 4847 4867 4887 4906 4926 4945 4965 4985 5004 5024 5043 5063 5083 5102 5122 5140 5158 5177 5195 5213 5231 5249 5267 5286 5304 5322 5340 5358 5377 5395 5413 5430 5443 5457 5471 5484 5498 5512 5526 5539 5553 5567 5580 5594 5608 5621 5635 5649 5663 5676 5690 5704 5717 5739 5773 5808 5842 5877 5911 5946 5980 6015 6038 6055 6073 6090 6108 6125 6143 6160 6178 6195 6213 6231 6248 6266 6283 6301 6318 6335 6352 6369 6386 6403 6420 6437 6454 6471 6488 6505 6522 6539 6556 6573 6589 6606 6623 6652 6682 6712 6743 6773 6803 6834 6864 6894 6925 6964 7004 7044 7084 7124 7164 7204
iterations count:233544 (1621), effective:7200 (50)

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-D05N300"
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-D05N300.tgz
mv S_Diffusion2D-PT-D05N300 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-D05N300, 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-143297579800164"
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 ;