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-3254
Executing tool marcie
Input is HypertorusGrid-PT-d2k1p8b00, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r031-blw7-149440473700034
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494448575651

timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie rev. 8852M (built: crohr on 2017-05-03)
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=ReachabilityCardinality.xml --memory=6

parse successfull
net created successfully

Net: HypertorusGrid_PT_d2k1p8b00
(NrP: 13 NrTr: 16 NrArc: 64)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec

net check time: 0m 0.000sec

init dd package: 0m 1.163sec

parse successfull
net created successfully

Net: HypertorusGrid_PT_d2k1p8b00
(NrP: 13 NrTr: 16 NrArc: 64)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec

net check time: 0m 0.000sec

init dd package: 0m 3.785sec


RS generation: 0m 0.027sec


-> reachability set: #nodes 900 (9.0e+02) #states 87,552 (4)



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

checking: AG [3<=pb_d2_n1_1_1]
normalized: ~ [E [true U ~ [3<=pb_d2_n1_1_1]]]

abstracting: (3<=pb_d2_n1_1_1)
states: 65,192 (4)
-> the formula is FALSE

FORMULA HypertorusGrid-PT-d2k1p8b00-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.090sec

checking: AG [3<=pb_d2_n2_1_1]
normalized: ~ [E [true U ~ [3<=pb_d2_n2_1_1]]]

abstracting: (3<=pb_d2_n2_1_1)
states: 65,192 (4)
-> the formula is FALSE

FORMULA HypertorusGrid-PT-d2k1p8b00-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: EF [~ [~ [3<=po_d1_n1_1_1]]]
normalized: E [true U 3<=po_d1_n1_1_1]

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

FORMULA HypertorusGrid-PT-d2k1p8b00-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [2<=pb_d1_n2_1_1]
normalized: ~ [E [true U ~ [2<=pb_d1_n2_1_1]]]

abstracting: (2<=pb_d1_n2_1_1)
states: 72,160 (4)
-> the formula is FALSE

FORMULA HypertorusGrid-PT-d2k1p8b00-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.088sec

checking: EF [pb_d1_n1_1_1<=pol_d2_n1_1_1]
normalized: E [true U pb_d1_n1_1_1<=pol_d2_n1_1_1]

abstracting: (pb_d1_n1_1_1<=pol_d2_n1_1_1)
states: 11,790 (4)
-> the formula is TRUE

FORMULA HypertorusGrid-PT-d2k1p8b00-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.073sec

checking: AG [pb_d2_n1_1_1<=pb_d2_n1_1_1]
normalized: ~ [E [true U ~ [pb_d2_n1_1_1<=pb_d2_n1_1_1]]]

abstracting: (pb_d2_n1_1_1<=pb_d2_n1_1_1)
states: 87,552 (4)
-> the formula is TRUE

FORMULA HypertorusGrid-PT-d2k1p8b00-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[[2<=pb_d1_n2_1_1 | ~ [2<=pol_d2_n1_1_1]] | 3<=pi_d1_n1_1_1]]
normalized: ~ [E [true U ~ [[[~ [2<=pol_d2_n1_1_1] | 2<=pb_d1_n2_1_1] | 3<=pi_d1_n1_1_1]]]]

abstracting: (3<=pi_d1_n1_1_1)
states: 0
abstracting: (2<=pb_d1_n2_1_1)
states: 72,160 (4)
abstracting: (2<=pol_d2_n1_1_1)
states: 0
-> the formula is TRUE

FORMULA HypertorusGrid-PT-d2k1p8b00-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [~ [~ [[pb_d1_n2_1_1<=po_d2_n1_1_1 | 2<=po_d2_n1_1_1]]]]
normalized: E [true U [pb_d1_n2_1_1<=po_d2_n1_1_1 | 2<=po_d2_n1_1_1]]

abstracting: (2<=po_d2_n1_1_1)
states: 0
abstracting: (pb_d1_n2_1_1<=po_d2_n1_1_1)
states: 11,546 (4)
-> the formula is TRUE

FORMULA HypertorusGrid-PT-d2k1p8b00-ReachabilityCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.051sec

checking: AG [[~ [pi_d2_n1_1_1<=pb_d1_n1_1_1] | pi_d1_n1_1_1<=pb_d2_n1_1_1]]
normalized: ~ [E [true U ~ [[pi_d1_n1_1_1<=pb_d2_n1_1_1 | ~ [pi_d2_n1_1_1<=pb_d1_n1_1_1]]]]]

abstracting: (pi_d2_n1_1_1<=pb_d1_n1_1_1)
states: 83,706 (4)
abstracting: (pi_d1_n1_1_1<=pb_d2_n1_1_1)
states: 83,706 (4)
-> the formula is FALSE

FORMULA HypertorusGrid-PT-d2k1p8b00-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.101sec

checking: AG [[pol_d2_n1_1_1<=pol_d2_n1_1_1 | ~ [[pi_d2_n1_1_1<=pi_d2_n1_1_1 | pb_d1_n1_1_1<=pbl_1_1]]]]
normalized: ~ [E [true U ~ [[pol_d2_n1_1_1<=pol_d2_n1_1_1 | ~ [[pi_d2_n1_1_1<=pi_d2_n1_1_1 | pb_d1_n1_1_1<=pbl_1_1]]]]]]

abstracting: (pb_d1_n1_1_1<=pbl_1_1)
states: 21,664 (4)
abstracting: (pi_d2_n1_1_1<=pi_d2_n1_1_1)
states: 87,552 (4)
abstracting: (pol_d2_n1_1_1<=pol_d2_n1_1_1)
states: 87,552 (4)
-> the formula is TRUE

FORMULA HypertorusGrid-PT-d2k1p8b00-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: EF [[[[3<=pbl_1_1 | 1<=pb_d2_n1_1_1] & ~ [3<=pb_d2_n2_1_1]] | [[3<=pil_d2_n1_1_1 & pbl_1_1<=pi_d1_n1_1_1] & ~ [pi_d2_n1_1_1<=pi_d1_n1_1_1]]]]
normalized: E [true U [[~ [pi_d2_n1_1_1<=pi_d1_n1_1_1] & [3<=pil_d2_n1_1_1 & pbl_1_1<=pi_d1_n1_1_1]] | [~ [3<=pb_d2_n2_1_1] & [3<=pbl_1_1 | 1<=pb_d2_n1_1_1]]]]

abstracting: (1<=pb_d2_n1_1_1)
states: 79,608 (4)
abstracting: (3<=pbl_1_1)
states: 24,335 (4)
abstracting: (3<=pb_d2_n2_1_1)
states: 65,192 (4)
abstracting: (pbl_1_1<=pi_d1_n1_1_1)
states: 12,529 (4)
abstracting: (3<=pil_d2_n1_1_1)
states: 0
abstracting: (pi_d2_n1_1_1<=pi_d1_n1_1_1)
states: 65,696 (4)
-> the formula is TRUE

FORMULA HypertorusGrid-PT-d2k1p8b00-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: EF [[[[pb_d2_n1_1_1<=pi_d1_n1_1_1 & 3<=pol_d1_n1_1_1] | ~ [po_d1_n1_1_1<=pbl_1_1]] & [pol_d2_n1_1_1<=pb_d2_n1_1_1 | pb_d2_n1_1_1<=pb_d1_n1_1_1]]]
normalized: E [true U [[pol_d2_n1_1_1<=pb_d2_n1_1_1 | pb_d2_n1_1_1<=pb_d1_n1_1_1] & [~ [po_d1_n1_1_1<=pbl_1_1] | [pb_d2_n1_1_1<=pi_d1_n1_1_1 & 3<=pol_d1_n1_1_1]]]]

abstracting: (3<=pol_d1_n1_1_1)
states: 0
abstracting: (pb_d2_n1_1_1<=pi_d1_n1_1_1)
states: 11,546 (4)
abstracting: (po_d1_n1_1_1<=pbl_1_1)
states: 87,552 (4)
abstracting: (pb_d2_n1_1_1<=pb_d1_n1_1_1)
states: 45,825 (4)
abstracting: (pol_d2_n1_1_1<=pb_d2_n1_1_1)
states: 83,454 (4)
-> the formula is FALSE

FORMULA HypertorusGrid-PT-d2k1p8b00-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.028sec

checking: AG [[[[1<=pb_d2_n2_1_1 | 2<=pol_d1_n1_1_1] | pbl_1_1<=pil_d2_n1_1_1] | [[pb_d1_n2_1_1<=pb_d2_n2_1_1 | 3<=pb_d1_n1_1_1] | [1<=pbl_1_1 & pb_d2_n2_1_1<=pb_d2_n2_1_1]]]]
normalized: ~ [E [true U ~ [[[[1<=pbl_1_1 & pb_d2_n2_1_1<=pb_d2_n2_1_1] | [pb_d1_n2_1_1<=pb_d2_n2_1_1 | 3<=pb_d1_n1_1_1]] | [pbl_1_1<=pil_d2_n1_1_1 | [1<=pb_d2_n2_1_1 | 2<=pol_d1_n1_1_1]]]]]]

abstracting: (2<=pol_d1_n1_1_1)
states: 0
abstracting: (1<=pb_d2_n2_1_1)
states: 79,608 (4)
abstracting: (pbl_1_1<=pil_d2_n1_1_1)
states: 24,497 (4)
abstracting: (3<=pb_d1_n1_1_1)
states: 65,192 (4)
abstracting: (pb_d1_n2_1_1<=pb_d2_n2_1_1)
states: 45,825 (4)
abstracting: (pb_d2_n2_1_1<=pb_d2_n2_1_1)
states: 87,552 (4)
abstracting: (1<=pbl_1_1)
states: 81,007 (4)
-> the formula is TRUE

FORMULA HypertorusGrid-PT-d2k1p8b00-ReachabilityCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.023sec

checking: AG [[[[pol_d2_n1_1_1<=pil_d2_n1_1_1 & 3<=pb_d1_n1_1_1] | 1<=pb_d2_n2_1_1] | [[pi_d2_n1_1_1<=pb_d1_n2_1_1 | 1<=pil_d2_n1_1_1] & [pb_d2_n1_1_1<=pb_d1_n1_1_1 | 2<=pol_d2_n1_1_1]]]]
normalized: ~ [E [true U ~ [[[[pb_d2_n1_1_1<=pb_d1_n1_1_1 | 2<=pol_d2_n1_1_1] & [pi_d2_n1_1_1<=pb_d1_n2_1_1 | 1<=pil_d2_n1_1_1]] | [1<=pb_d2_n2_1_1 | [pol_d2_n1_1_1<=pil_d2_n1_1_1 & 3<=pb_d1_n1_1_1]]]]]]

abstracting: (3<=pb_d1_n1_1_1)
states: 65,192 (4)
abstracting: (pol_d2_n1_1_1<=pil_d2_n1_1_1)
states: 65,696 (4)
abstracting: (1<=pb_d2_n2_1_1)
states: 79,608 (4)
abstracting: (1<=pil_d2_n1_1_1)
states: 45,825 (4)
abstracting: (pi_d2_n1_1_1<=pb_d1_n2_1_1)
states: 83,706 (4)
abstracting: (2<=pol_d2_n1_1_1)
states: 0
abstracting: (pb_d2_n1_1_1<=pb_d1_n1_1_1)
states: 45,825 (4)
-> the formula is FALSE

FORMULA HypertorusGrid-PT-d2k1p8b00-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.021sec

checking: AG [[[[pi_d1_n1_1_1<=pi_d2_n1_1_1 | pbl_1_1<=pb_d1_n1_1_1] | po_d2_n1_1_1<=pb_d2_n1_1_1] | [[3<=po_d1_n1_1_1 | 2<=pb_d1_n2_1_1] | pb_d1_n1_1_1<=pi_d1_n1_1_1]]]
normalized: ~ [E [true U ~ [[[pb_d1_n1_1_1<=pi_d1_n1_1_1 | [3<=po_d1_n1_1_1 | 2<=pb_d1_n2_1_1]] | [po_d2_n1_1_1<=pb_d2_n1_1_1 | [pi_d1_n1_1_1<=pi_d2_n1_1_1 | pbl_1_1<=pb_d1_n1_1_1]]]]]]

abstracting: (pbl_1_1<=pb_d1_n1_1_1)
states: 72,880 (4)
abstracting: (pi_d1_n1_1_1<=pi_d2_n1_1_1)
states: 65,696 (4)
abstracting: (po_d2_n1_1_1<=pb_d2_n1_1_1)
states: 83,706 (4)
abstracting: (2<=pb_d1_n2_1_1)
states: 72,160 (4)
abstracting: (3<=po_d1_n1_1_1)
states: 0
abstracting: (pb_d1_n1_1_1<=pi_d1_n1_1_1)
states: 11,546 (4)
-> the formula is FALSE

FORMULA HypertorusGrid-PT-d2k1p8b00-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.053sec

checking: EF [[[[pb_d1_n1_1_1<=po_d2_n1_1_1 & pi_d1_n1_1_1<=pol_d2_n1_1_1] & [3<=pb_d1_n2_1_1 | pb_d1_n2_1_1<=pb_d2_n1_1_1]] & [[3<=pb_d1_n2_1_1 & po_d1_n1_1_1<=pi_d1_n1_1_1] & pi_d2_n1_1_1<=pol_d2_n1_1_1]]]
normalized: E [true U [[pi_d2_n1_1_1<=pol_d2_n1_1_1 & [3<=pb_d1_n2_1_1 & po_d1_n1_1_1<=pi_d1_n1_1_1]] & [[3<=pb_d1_n2_1_1 | pb_d1_n2_1_1<=pb_d2_n1_1_1] & [pb_d1_n1_1_1<=po_d2_n1_1_1 & pi_d1_n1_1_1<=pol_d2_n1_1_1]]]]

abstracting: (pi_d1_n1_1_1<=pol_d2_n1_1_1)
states: 67,681 (4)
abstracting: (pb_d1_n1_1_1<=po_d2_n1_1_1)
states: 11,546 (4)
abstracting: (pb_d1_n2_1_1<=pb_d2_n1_1_1)
states: 45,825 (4)
abstracting: (3<=pb_d1_n2_1_1)
states: 65,192 (4)
abstracting: (po_d1_n1_1_1<=pi_d1_n1_1_1)
states: 65,696 (4)
abstracting: (3<=pb_d1_n2_1_1)
states: 65,192 (4)
abstracting: (pi_d2_n1_1_1<=pol_d2_n1_1_1)
states: 67,681 (4)
-> the formula is TRUE

FORMULA HypertorusGrid-PT-d2k1p8b00-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.049sec

totally nodes used: 91001 (9.1e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1708351 335333 2043684
used/not used/entry size/cache size: 403524 66705340 16 1024MB
basic ops cache: hits/miss/sum: 366465 173894 540359
used/not used/entry size/cache size: 295976 16481240 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 63868 18766 82634
used/not used/entry size/cache size: 18764 8369844 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 67023693
1 83351
2 1584
3 144
4 1
5 2
6 2
7 1
8 0
9 1
>= 10 85

Total processing time: 0m 7.721sec


BK_STOP 1494448583467

--------------------
content from stderr:

check for maximal unmarked siphon
ok
check for constant places
ok
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

ptnet_zbdd.cc:255: Boundedness exception: net is not 1-bounded!

check for maximal unmarked siphon
ok
check for constant places
ok
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: 0m 0.000sec


iterations count:1256 (78), effective:190 (11)

initing FirstDep: 0m 0.000sec


iterations count:312 (19), effective:59 (3)

iterations count:873 (54), effective:59 (3)

iterations count:168 (10), effective:61 (3)

iterations count:600 (37), effective:62 (3)

iterations count:173 (10), effective:63 (3)

iterations count:412 (25), effective:74 (4)

iterations count:903 (56), effective:65 (4)

iterations count:1573 (98), effective:154 (9)

iterations count:1407 (87), effective:193 (12)

iterations count:740 (46), effective:80 (5)

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="HypertorusGrid-PT-d2k1p8b00"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/tmp/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/HypertorusGrid-PT-d2k1p8b00.tgz
mv HypertorusGrid-PT-d2k1p8b00 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool marcie"
echo " Input is HypertorusGrid-PT-d2k1p8b00, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r031-blw7-149440473700034"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.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 ;