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

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

=== Now, execution of the tool begins

BK_START 1433369818566

Model: S_Diffusion2D-PT-D05N350
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: 1m32sec


-> reachability set: #nodes 8425 (8.4e+03) #states 42,538,836,580,623,522,046,533,599,172,737,556,876 (37)



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

checking: [[maxVal(cAMP__1_2_)<=2 & maxVal(cAMP__3_1_)<=3] & [[maxVal(cAMP__5_4_)<=1 & [[[maxVal(cAMP__5_4_)<=3 & maxVal(cAMP__3_1_)<=2] & [maxVal(cAMP__3_5_)<=2 & maxVal(cAMP__5_4_)<=3]] & [[maxVal(cAMP__5_3_)<=1 & maxVal(cAMP__3_4_)<=1] & [maxVal(cAMP__1_3_)<=1 & maxVal(cAMP__1_3_)<=2]]]] & [maxVal(cAMP__5_3_)<=2 & maxVal(cAMP__2_2_)<=3]]]
normalized: [[maxVal(cAMP__1_2_)<=2 & maxVal(cAMP__3_1_)<=3] & [[maxVal(cAMP__5_3_)<=2 & maxVal(cAMP__2_2_)<=3] & [maxVal(cAMP__5_4_)<=1 & [[[maxVal(cAMP__5_4_)<=3 & maxVal(cAMP__3_1_)<=2] & [maxVal(cAMP__3_5_)<=2 & maxVal(cAMP__5_4_)<=3]] & [[maxVal(cAMP__5_3_)<=1 & maxVal(cAMP__3_4_)<=1] & [maxVal(cAMP__1_3_)<=1 & maxVal(cAMP__1_3_)<=2]]]]]]

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

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

MC time: 0m0sec

checking: [[[[[maxVal(cAMP__2_1_)<=3 & maxVal(cAMP__2_5_)<=2] & maxVal(cAMP__3_1_)<=2] & maxVal(cAMP__2_1_)<=3] & maxVal(cAMP__3_5_)<=1] & [[[maxVal(cAMP__3_4_)<=1 & maxVal(cAMP__5_1_)<=2] & maxVal(cAMP__3_4_)<=1] & maxVal(cAMP__3_5_)<=3]]
normalized: [[maxVal(cAMP__3_5_)<=3 & [maxVal(cAMP__3_4_)<=1 & [maxVal(cAMP__3_4_)<=1 & maxVal(cAMP__5_1_)<=2]]] & [maxVal(cAMP__3_5_)<=1 & [maxVal(cAMP__2_1_)<=3 & [maxVal(cAMP__3_1_)<=2 & [maxVal(cAMP__2_1_)<=3 & maxVal(cAMP__2_5_)<=2]]]]]

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

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec

checking: [[[[[[maxVal(cAMP__4_4_)<=3 & maxVal(cAMP__3_1_)<=1] & [maxVal(cAMP__5_4_)<=2 & maxVal(cAMP__5_1_)<=1]] & [[maxVal(cAMP__2_4_)<=1 & maxVal(cAMP__5_2_)<=1] & maxVal(cAMP__1_4_)<=2]] & maxVal(cAMP__5_5_)<=1] & maxVal(cAMP__2_2_)<=3] & [[[maxVal(cAMP__2_5_)<=3 & maxVal(cAMP__1_5_)<=1] & [[[maxVal(cAMP__3_3_)<=1 & maxVal(cAMP__4_4_)<=1] & [maxVal(cAMP__4_5_)<=1 & maxVal(cAMP__1_1_)<=2]] & [maxVal(cAMP__5_5_)<=1 & maxVal(cAMP__2_4_)<=2]]] & [[[maxVal(cAMP__1_5_)<=2 & maxVal(cAMP__2_4_)<=2] & maxVal(cAMP__3_1_)<=2] & maxVal(cAMP__5_3_)<=1]]]
normalized: [[maxVal(cAMP__2_2_)<=3 & [maxVal(cAMP__5_5_)<=1 & [[maxVal(cAMP__1_4_)<=2 & [maxVal(cAMP__2_4_)<=1 & maxVal(cAMP__5_2_)<=1]] & [[maxVal(cAMP__5_4_)<=2 & maxVal(cAMP__5_1_)<=1] & [maxVal(cAMP__4_4_)<=3 & maxVal(cAMP__3_1_)<=1]]]]] & [[[[[maxVal(cAMP__3_3_)<=1 & maxVal(cAMP__4_4_)<=1] & [maxVal(cAMP__4_5_)<=1 & maxVal(cAMP__1_1_)<=2]] & [maxVal(cAMP__5_5_)<=1 & maxVal(cAMP__2_4_)<=2]] & [maxVal(cAMP__2_5_)<=3 & maxVal(cAMP__1_5_)<=1]] & [maxVal(cAMP__5_3_)<=1 & [maxVal(cAMP__3_1_)<=2 & [maxVal(cAMP__1_5_)<=2 & maxVal(cAMP__2_4_)<=2]]]]]

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

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec

checking: [maxVal(cAMP__5_2_)<=3 & maxVal(cAMP__2_1_)<=3]
normalized: [maxVal(cAMP__5_2_)<=3 & maxVal(cAMP__2_1_)<=3]

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

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec

checking: [maxVal(cAMP__1_4_)<=1 & [maxVal(cAMP__4_3_)<=2 & maxVal(cAMP__4_1_)<=1]]
normalized: [maxVal(cAMP__1_4_)<=1 & [maxVal(cAMP__4_3_)<=2 & maxVal(cAMP__4_1_)<=1]]

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

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec

checking: [[[[[maxVal(cAMP__5_4_)<=1 & [maxVal(cAMP__4_5_)<=1 & maxVal(cAMP__5_1_)<=1]] & maxVal(cAMP__5_3_)<=3] & [[maxVal(cAMP__3_2_)<=1 & [maxVal(cAMP__1_1_)<=3 & maxVal(cAMP__5_3_)<=2]] & maxVal(cAMP__2_5_)<=1]] & [maxVal(cAMP__1_1_)<=2 & [maxVal(cAMP__1_4_)<=2 & maxVal(cAMP__2_2_)<=2]]] & maxVal(cAMP__5_3_)<=2]
normalized: [maxVal(cAMP__5_3_)<=2 & [[[maxVal(cAMP__2_5_)<=1 & [maxVal(cAMP__3_2_)<=1 & [maxVal(cAMP__1_1_)<=3 & maxVal(cAMP__5_3_)<=2]]] & [maxVal(cAMP__5_3_)<=3 & [maxVal(cAMP__5_4_)<=1 & [maxVal(cAMP__4_5_)<=1 & maxVal(cAMP__5_1_)<=1]]]] & [maxVal(cAMP__1_1_)<=2 & [maxVal(cAMP__1_4_)<=2 & maxVal(cAMP__2_2_)<=2]]]]

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

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

MC time: 0m0sec

checking: [[[[maxVal(cAMP__1_2_)<=2 & [maxVal(cAMP__5_2_)<=2 & maxVal(cAMP__2_3_)<=3]] & maxVal(cAMP__3_5_)<=3] & maxVal(cAMP__3_3_)<=3] & maxVal(cAMP__3_4_)<=1]
normalized: [maxVal(cAMP__3_4_)<=1 & [maxVal(cAMP__3_3_)<=3 & [maxVal(cAMP__3_5_)<=3 & [maxVal(cAMP__1_2_)<=2 & [maxVal(cAMP__5_2_)<=2 & maxVal(cAMP__2_3_)<=3]]]]]

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

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

MC time: 0m0sec

checking: [maxVal(cAMP__2_4_)<=1 & maxVal(cAMP__3_1_)<=2]
normalized: [maxVal(cAMP__2_4_)<=1 & maxVal(cAMP__3_1_)<=2]

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

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec

checking: [maxVal(cAMP__2_1_)<=1 & maxVal(cAMP__5_5_)<=1]
normalized: [maxVal(cAMP__2_1_)<=1 & maxVal(cAMP__5_5_)<=1]

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

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

MC time: 0m0sec

checking: [maxVal(cAMP__4_3_)<=2 & [maxVal(cAMP__2_2_)<=3 & [[[maxVal(cAMP__5_5_)<=2 & maxVal(cAMP__3_1_)<=3] & maxVal(cAMP__5_4_)<=2] & [maxVal(cAMP__4_4_)<=3 & maxVal(cAMP__1_4_)<=2]]]]
normalized: [maxVal(cAMP__4_3_)<=2 & [maxVal(cAMP__2_2_)<=3 & [[maxVal(cAMP__5_4_)<=2 & [maxVal(cAMP__5_5_)<=2 & maxVal(cAMP__3_1_)<=3]] & [maxVal(cAMP__4_4_)<=3 & maxVal(cAMP__1_4_)<=2]]]]

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

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

MC time: 0m0sec

checking: [[[maxVal(cAMP__5_4_)<=3 & maxVal(cAMP__5_5_)<=2] & [[[[maxVal(cAMP__3_3_)<=1 & maxVal(cAMP__5_4_)<=3] & [maxVal(cAMP__3_3_)<=1 & maxVal(cAMP__2_1_)<=1]] & maxVal(cAMP__4_2_)<=2] & [[maxVal(cAMP__2_3_)<=3 & maxVal(cAMP__4_3_)<=3] & maxVal(cAMP__5_5_)<=2]]] & maxVal(cAMP__5_5_)<=3]
normalized: [maxVal(cAMP__5_5_)<=3 & [[maxVal(cAMP__5_4_)<=3 & maxVal(cAMP__5_5_)<=2] & [[maxVal(cAMP__5_5_)<=2 & [maxVal(cAMP__2_3_)<=3 & maxVal(cAMP__4_3_)<=3]] & [maxVal(cAMP__4_2_)<=2 & [[maxVal(cAMP__3_3_)<=1 & maxVal(cAMP__2_1_)<=1] & [maxVal(cAMP__3_3_)<=1 & maxVal(cAMP__5_4_)<=3]]]]]]

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

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

MC time: 0m0sec


Total processing time: 2m41sec


BK_STOP 1433369980297

--------------------
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 4870 4934 4998 5062 5126 5190 5580 5648 5716 5784 5852 5920 4577 4599 4620 4641 4662 4684 4705 4726 4747 4769 4790 4811 4833 4854 4875 4896 4918 4944 4975 5005 5035 5066 5096 5126 5157 5187 5217 5247 5277 5292 5307 5323 5338 5353 5369 5384 5400 5415 5430 5446 5461 5477 5492 5507 5523 5538 5553 5569 5584 5600 5615 5632 5651 5671 5690 5710 5730 5749 5769 5788 5808 5828 5847 5867 5887 5906 5926 5945 5965 5984 6002 6020 6038 6057 6075 6093 6111 6129 6147 6166 6184 6202 6220 6238 6257 6275 6293 6311 6328 6342 6356 6369 6383 6397 6410 6424 6438 6452 6465 6479 6493 6506 6520 6534 6547 6561 6575 6589 6602 6616 6630 6643 6657 6671 6698 6732 6767 6801 6836 6870 6905 6939 6973 7008 7034 7052 7069 7087 7104 7122 7139 7157 7174 7192 7209 7227 7245 7262 7280 7297 7315 7332 7350 7367 7384 7401 7418 7435 7452 7469 7486 7503 7520 7537 7554 7571 7588 7605 7622 7639 7656 7673 7689 7706 7723 7752 7782 7812 7843 7873 7903 7934 7964 7994 8025 8055 8088 8128 8168 8208 8248 8288 8328 8368 8408
iterations count:272444 (1891), effective:8400 (58)

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