fond
Model Checking Contest @ Petri Nets 2015
Bruxelles, Belgium, June 23, 2015
Execution of r022kn-blw3-143214376400216
Last Updated
August 19, 2015

About the Execution of Marcie for Diffusion2D-PT-D10N100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4829.130 241019.00 240990.00 40.00 FFFFFFFFFFFFFFFF 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-2265
Executing tool marcie
Input is Diffusion2D-PT-D10N100, examination is ReachabilityBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r022kn-blw3-143214376400216
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1432486795482

Model: Diffusion2D-PT-D10N100
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: 100 NrTr: 684 NrArc: 1368)

net check time: 0m0sec

parse formulas successfull
formulas created successfully
place and transition orderings generation:0m0sec

init dd package: 0m3sec


RS generation: 2m42sec


-> reachability set: #nodes 10000 (1.0e+04) #states 45,274,257,328,051,640,582,702,088,538,742,081,937,252,294,837,706,668,420,660 (58)



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

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

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

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec

checking: [maxVal(cAMP__1_4_)<=1 & maxVal(cAMP__9_2_)<=3]
normalized: [maxVal(cAMP__1_4_)<=1 & maxVal(cAMP__9_2_)<=3]

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

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec

checking: [[maxVal(cAMP__6_3_)<=2 & [[maxVal(cAMP__9_1_)<=1 & maxVal(cAMP__3_4_)<=2] & maxVal(cAMP__3_5_)<=3]] & maxVal(cAMP__7_4_)<=3]
normalized: [maxVal(cAMP__7_4_)<=3 & [maxVal(cAMP__6_3_)<=2 & [maxVal(cAMP__3_5_)<=3 & [maxVal(cAMP__9_1_)<=1 & maxVal(cAMP__3_4_)<=2]]]]

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

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec

checking: [[maxVal(cAMP__8_7_)<=3 & maxVal(cAMP__9_1_)<=1] & maxVal(cAMP__5_2_)<=1]
normalized: [maxVal(cAMP__5_2_)<=1 & [maxVal(cAMP__8_7_)<=3 & maxVal(cAMP__9_1_)<=1]]

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

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec

checking: [[[[[maxVal(cAMP__9_6_)<=3 & [maxVal(cAMP__8_10_)<=1 & maxVal(cAMP__7_2_)<=1]] & maxVal(cAMP__3_3_)<=1] & maxVal(cAMP__7_2_)<=2] & [[maxVal(cAMP__8_10_)<=1 & maxVal(cAMP__9_4_)<=3] & maxVal(cAMP__6_3_)<=1]] & [[maxVal(cAMP__10_5_)<=2 & [maxVal(cAMP__1_2_)<=2 & [[maxVal(cAMP__6_9_)<=3 & maxVal(cAMP__4_9_)<=3] & maxVal(cAMP__4_10_)<=2]]] & [maxVal(cAMP__8_1_)<=3 & maxVal(cAMP__6_2_)<=1]]]
normalized: [[[maxVal(cAMP__8_1_)<=3 & maxVal(cAMP__6_2_)<=1] & [maxVal(cAMP__10_5_)<=2 & [maxVal(cAMP__1_2_)<=2 & [maxVal(cAMP__4_10_)<=2 & [maxVal(cAMP__6_9_)<=3 & maxVal(cAMP__4_9_)<=3]]]]] & [[maxVal(cAMP__6_3_)<=1 & [maxVal(cAMP__8_10_)<=1 & maxVal(cAMP__9_4_)<=3]] & [maxVal(cAMP__7_2_)<=2 & [maxVal(cAMP__3_3_)<=1 & [maxVal(cAMP__9_6_)<=3 & [maxVal(cAMP__8_10_)<=1 & maxVal(cAMP__7_2_)<=1]]]]]]

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

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec

checking: [maxVal(cAMP__8_5_)<=3 & [maxVal(cAMP__9_9_)<=1 & maxVal(cAMP__2_4_)<=3]]
normalized: [maxVal(cAMP__8_5_)<=3 & [maxVal(cAMP__9_9_)<=1 & maxVal(cAMP__2_4_)<=3]]

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

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec


Total processing time: 4m0sec


BK_STOP 1432487036501

--------------------
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

139 139 194 181 253 225 316 271 379 319 449 369 523 421 608 468 691 531 802 589 490 649 529 711 579 775 631 867 698 951 741 1024 799 1099 859 1193 921 1291 985 1412 1051 1539 1119 919 1210 958 1283 997 1358 1059 1459 1123 1539 1214 1647 1283 1732 1327 1847 1399 1966 1473 2089 1549 2247 1627 2411 1707 1387 1822 1426 1907 1465 1994 1539 2119 1651 2248 1730 2343 1811 2479 1894 2579 1939 2722 2025 2869 2113 3106 2203 3307 2339 1855 2434 1894 2531 1933 2630 2066 2779 2155 2932 2246 3089 2339 3199 2434 3311 2531 3531 2577 3649 2677 3934 2834 4339 2939 2323 3046 2362 3155 2459 3266 2558 3499 2659 3677 2762 3797 2867 3919 2974 4107 3083 4299 3194 4561 3307 4829 3422 2752 3607 2791 3727 2830 3849 2939 4044 3050 4171 3235 4373 3351 4505 3395 4639 3514 4927 3635 5067 3758 5443 3883 5748 4010 3220 4219 3259 4351 3298 4485 3419 4704 3625 4927 3751 5069 3879 5213 4009 5446 4054 5683 4187 5924 4322 6349 4459 6691 4689 3688 4831 3727 4975 3766 5121 3993 5364 4129 5611 4267 5862 4407 6019 4549 6178 4693 4003 4012 4021 4030 4039 4048 4057 4066 4076 4085 4094 4103 4112 4121 4130 4139 4148 4157 4166 4176 4185 4194 4203 4212 4222 4231 4241 4250 4259 4269 4278 4288 4297 4310 4326 4342 4357 4373 4389 4404 4420 4435 4451 4467 4482 4498 4512 4526 4540 4554 4568 4583 4597 4646 4707 4759 4802 4810 4817 4824 4832 4839 4847 4854 4862 4869 4877 4884 4892 4899 4906 4914 4921 4928 4936 4943 4951 4958 4965 4973 4980 4987 4995 5002 5009 5017 5024 5031 5039 5046 5053 5061 5068 5075 5083 5090 5098 5105 5112 5120 5127 5134 5142 5149 5156 5164 5171 5178 5186 5193 5200 5208 5215 5222 5230 5237 5244 5252 5259 5267 5274 5281 5289 5296 5303 5311 5318 5325 5333 5340 5347 5355 5362 5369 5377 5384 5391 5399 5406 5414 5421 5429 5437 5444 5452 5459 5467 5474 5482 5490 5497 5508 5520 5533 5546 5559 5572 5585 5597 5610 5622 5634 5646 5658 5671 5683 5695 5706 5716 5726 5736 5746 5756 5766 5776 5786 5796 5820 5855 5891 5906 5915 5923 5931 5939 5947 5956 5964 5972 5980 5988 5997 6011 6031 6051 6071 6091 6117 6148 6179 6203 6209 6216 6222 6229 6235 6242 6249 6255 6262 6268 6275 6281 6288 6295 6302 6314 6327 6339 6352 6364 6377 6389 6403 6428 6453 6478 6503 6528 6553 6578 6601 6606 6611 6617 6622 6627 6632 6638 6643 6648 6654 6659 6664 6669 6675 6680 6685 6690 6696 6701 6710 6718 6727 6735 6743 6752 6760 6769 6777 6786 6794 6806 6827 6848 6868 6889 6910 6931 6952 6972 6993 7014 7035 7056 7076 7097 7104 7108 7113 7117 7121 7125 7129 7134 7138 7142 7146 7151 7155 7159 7163 7168 7172 7176 7180 7185 7189 7193 7197 7202 7208 7214 7220 7226 7232 7239 7245 7251 7257 7263 7269 7275 7281 7287 7293 7299 7315 7333 7351 7369 7387 7404 7422 7440 7458 7476 7494 7511 7529 7547 7565 7583 7601 7618 7636 7654 7672 7690 7702 7705 7709 7712 7716 7719 7723 7726 7729 7733 7736 7740 7743 7747 7750 7754 7757 7760 7764 7767 7771 7774 7778 7781 7785 7788 7792 7795 7798 7802 7805 7808 7812 7815 7818 7822 7825 7828 7831 7835 7838 7841 7845 7848 7851 7854 7858 7861 7864 7868 7871 7874 7877 7881 7884 7887 7891 7894 7897 7900 7904 7908 7912 7916 7920 7924 7928 7932 7936 7940 7944 7948 7952 7956 7960 7964 7968 7972 7976 7980 7984 7988 7992 7996 8000 8004 8008 8012 8017 8021 8025 8029 8034 8038 8042 8047 8051 8055 8059 8064 8068 8072 8076 8081 8085 8089 8094 8098 8102 8106 8110 8114 8118 8122 8126 8130 8134 8138 8142 8146 8150 8154 8158 8162 8166 8170 8174 8178 8182 8186 8190 8194 8198 8210 8238 8266 8294 8308 8319 8329 8340 8350 8360 8371 8381 8392 8403 8420 8437 8455 8472 8489 8510 8537 8565 8593 8607 8616 8625 8634 8643 8652 8661 8669 8678 8687 8696 8709 8727 8744 8761 8778 8796 8820 8848 8876 8901 8909 8917 8925 8933 8940 8948 8956 8964 8972 8979 8987 8995 9006 9023 9040 9057 9074 9092 9114 9142 9169 9197 9207 9214 9220 9227 9234 9241 9248 9255 9262 9269 9276 9283 9290 9297 9309 9326 9343 9360 9378 9395 9405 9411 9418 9424 9431 9437 9444 9450 9457 9463 9470 9476 9483 9489 9496 9506 9530 9554 9578 9601 9619 9637 9655 9673 9691 9711 9735 9758 9782 9806 9831 9856 9881 9909 9947 9986
iterations count:802384 (1173), effective:9900 (14)

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="Diffusion2D-PT-D10N100"
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/Diffusion2D-PT-D10N100.tgz
mv Diffusion2D-PT-D10N100 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2265"
echo " Executing tool marcie"
echo " Input is Diffusion2D-PT-D10N100, 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 r022kn-blw3-143214376400216"
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 ;