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 IBM5964-PT-none, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r232su-smll-143354324700054
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1433633200161

Model: IBM5964-PT-none
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=CTLCardinality.xml --memory=6 --suppress --rs-algorithm=3 --place-order=5

parse successfull
net created successfully

(NrP: 263 NrTr: 139 NrArc: 541)

net check time: 0m0sec

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

init dd package: 0m3sec


RS generation: 0m0sec


-> reachability set: #nodes 1027 (1.0e+03) #states 15,546 (4)



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

checking: ~ [EF [[1<=callToTask_s00002741_input_s00000935 & [callToProcess_s00005925_inputCriterion_s00000937_used<=callToTask_s00002741_output_s00000960 | callToProcess_s00001273_input_s00000950<=fork_s00001537_activated_s00000993]]]]
normalized: ~ [E [true U [1<=callToTask_s00002741_input_s00000935 & [callToProcess_s00005925_inputCriterion_s00000937_used<=callToTask_s00002741_output_s00000960 | callToProcess_s00001273_input_s00000950<=fork_s00001537_activated_s00000993]]]]

abstracting: (callToProcess_s00001273_input_s00000950<=fork_s00001537_activated_s00000993) states: 15,546 (4)
abstracting: (callToProcess_s00005925_inputCriterion_s00000937_used<=callToTask_s00002741_output_s00000960) states: 12,658 (4)
abstracting: (1<=callToTask_s00002741_input_s00000935) states: 0
-> the formula is TRUE

FORMULA IBM5964-PT-none-CTLCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [[3<=fork_s00001067_input_s00000935 & [[decision_s00001617_activated<=callToTask_s00001971_output_s00000956 | merge_s00001291_input_s00000950<=merge_s00000945_input_s00000987] & [2<=callToTask_s00002190_output_s00000979 | 3<=callToTask_s00002183_output_s00000962]]]]
normalized: E [true U [3<=fork_s00001067_input_s00000935 & [[decision_s00001617_activated<=callToTask_s00001971_output_s00000956 | merge_s00001291_input_s00000950<=merge_s00000945_input_s00000987] & [2<=callToTask_s00002190_output_s00000979 | 3<=callToTask_s00002183_output_s00000962]]]]

abstracting: (3<=callToTask_s00002183_output_s00000962) states: 0
abstracting: (2<=callToTask_s00002190_output_s00000979) states: 0
abstracting: (merge_s00001291_input_s00000950<=merge_s00000945_input_s00000987) states: 15,546 (4)
abstracting: (decision_s00001617_activated<=callToTask_s00001971_output_s00000956) states: 15,546 (4)
abstracting: (3<=fork_s00001067_input_s00000935) states: 0
-> the formula is FALSE

FORMULA IBM5964-PT-none-CTLCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: ~ [~ [[[[3<=callToProcess_s00004075_output_s00000956 | 3<=join_s00001295_activated_s00000946] & ~ [callToTask_s00001971_input_s00000985<=callToTask_s00002189_inputCriterion_s00000937_used]] | AF [1<=callToTask_s00005971_output_s00000938]]]]
normalized: [[[3<=callToProcess_s00004075_output_s00000956 | 3<=join_s00001295_activated_s00000946] & ~ [callToTask_s00001971_input_s00000985<=callToTask_s00002189_inputCriterion_s00000937_used]] | ~ [EG [~ [1<=callToTask_s00005971_output_s00000938]]]]

abstracting: (1<=callToTask_s00005971_output_s00000938) states: 0

EG iterations: 0
abstracting: (callToTask_s00001971_input_s00000985<=callToTask_s00002189_inputCriterion_s00000937_used) states: 15,546 (4)
abstracting: (3<=join_s00001295_activated_s00000946) states: 0
abstracting: (3<=callToProcess_s00004075_output_s00000956) states: 0
-> the formula is FALSE

FORMULA IBM5964-PT-none-CTLCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AF [EG [join_s00001295_activated_s00000948<=merge_s00001120_input_s00001010]]
normalized: ~ [EG [~ [EG [join_s00001295_activated_s00000948<=merge_s00001120_input_s00001010]]]]

abstracting: (join_s00001295_activated_s00000948<=merge_s00001120_input_s00001010) states: 15,546 (4)

EG iterations: 0
.
EG iterations: 1
-> the formula is TRUE

FORMULA IBM5964-PT-none-CTLCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [[AG [2<=merge_s00001291_input_s00001009] | AX [3<=callToTask_s00005849_output_s00000960]]]
normalized: E [true U [~ [E [true U ~ [2<=merge_s00001291_input_s00001009]]] | ~ [EX [~ [3<=callToTask_s00005849_output_s00000960]]]]]

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

FORMULA IBM5964-PT-none-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: ~ [~ [AG [[2<=callToProcess_s00005925_output_s00000959 | callToTask_s00002427_input_s00001013<=callToTask_s00002185_input_s00000950]]]]
normalized: ~ [E [true U ~ [[2<=callToProcess_s00005925_output_s00000959 | callToTask_s00002427_input_s00001013<=callToTask_s00002185_input_s00000950]]]]

abstracting: (callToTask_s00002427_input_s00001013<=callToTask_s00002185_input_s00000950) states: 14,783 (4)
abstracting: (2<=callToProcess_s00005925_output_s00000959) states: 369
-> the formula is FALSE

FORMULA IBM5964-PT-none-CTLCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: A [[merge_s00001120_input_s00001513<=merge_s00001292_input_s00000952 | [callToTask_s00002183_inputCriterion_s00000937_used<=fork_s00001293_input_s00000952 & 2<=callToTask_s00002526_inputCriterion_s00000937_used]] U [[3<=callToTask_s00005849_inputCriterion_s00000937_used | 1<=fork_s00001067_input_s00000935] & 3<=callToTask_s00001632_inputCriterion_s00000937_used]]
normalized: [~ [EG [~ [[3<=callToTask_s00001632_inputCriterion_s00000937_used & [3<=callToTask_s00005849_inputCriterion_s00000937_used | 1<=fork_s00001067_input_s00000935]]]]] & ~ [E [~ [[merge_s00001120_input_s00001513<=merge_s00001292_input_s00000952 | [callToTask_s00002183_inputCriterion_s00000937_used<=fork_s00001293_input_s00000952 & 2<=callToTask_s00002526_inputCriterion_s00000937_used]]] U [~ [[merge_s00001120_input_s00001513<=merge_s00001292_input_s00000952 | [callToTask_s00002183_inputCriterion_s00000937_used<=fork_s00001293_input_s00000952 & 2<=callToTask_s00002526_inputCriterion_s00000937_used]]] & ~ [[3<=callToTask_s00001632_inputCriterion_s00000937_used & [3<=callToTask_s00005849_inputCriterion_s00000937_used | 1<=fork_s00001067_input_s00000935]]]]]]]

abstracting: (1<=fork_s00001067_input_s00000935) states: 0
abstracting: (3<=callToTask_s00005849_inputCriterion_s00000937_used) states: 0
abstracting: (3<=callToTask_s00001632_inputCriterion_s00000937_used) states: 0
abstracting: (2<=callToTask_s00002526_inputCriterion_s00000937_used) states: 0
abstracting: (callToTask_s00002183_inputCriterion_s00000937_used<=fork_s00001293_input_s00000952) states: 15,546 (4)
abstracting: (merge_s00001120_input_s00001513<=merge_s00001292_input_s00000952) states: 15,546 (4)
abstracting: (2<=callToTask_s00002526_inputCriterion_s00000937_used) states: 0
abstracting: (callToTask_s00002183_inputCriterion_s00000937_used<=fork_s00001293_input_s00000952) states: 15,546 (4)
abstracting: (merge_s00001120_input_s00001513<=merge_s00001292_input_s00000952) states: 15,546 (4)
abstracting: (1<=fork_s00001067_input_s00000935) states: 0
abstracting: (3<=callToTask_s00005849_inputCriterion_s00000937_used) states: 0
abstracting: (3<=callToTask_s00001632_inputCriterion_s00000937_used) states: 0

EG iterations: 0
-> the formula is FALSE

FORMULA IBM5964-PT-none-CTLCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: E [callToTask_s00002183_output_s00000956<=callToTask_s00005966_output_s00000956 U [1<=callToTask_s00002741_output_s00000981 | 3<=callToTask_s00002741_inputCriterion_s00000937_used]]
normalized: E [callToTask_s00002183_output_s00000956<=callToTask_s00005966_output_s00000956 U [1<=callToTask_s00002741_output_s00000981 | 3<=callToTask_s00002741_inputCriterion_s00000937_used]]

abstracting: (3<=callToTask_s00002741_inputCriterion_s00000937_used) states: 0
abstracting: (1<=callToTask_s00002741_output_s00000981) states: 0
abstracting: (callToTask_s00002183_output_s00000956<=callToTask_s00005966_output_s00000956) states: 15,546 (4)
-> the formula is FALSE

FORMULA IBM5964-PT-none-CTLCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [[callToProcess_s00002411_output_s00000956<=process_s00000383__s00005964_input_s00000936 & AF [2<=decision_s00001617_activated]]]
normalized: ~ [E [true U ~ [[callToProcess_s00002411_output_s00000956<=process_s00000383__s00005964_input_s00000936 & ~ [EG [~ [2<=decision_s00001617_activated]]]]]]]

abstracting: (2<=decision_s00001617_activated) states: 0

EG iterations: 0
abstracting: (callToProcess_s00002411_output_s00000956<=process_s00000383__s00005964_input_s00000936) states: 15,546 (4)
-> the formula is FALSE

FORMULA IBM5964-PT-none-CTLCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[EF [2<=callToTask_s00001971_output_s00000979] & callToTask_s00005967_output_s00000979<=callToProcess_s00004075_inputCriterion_s00000937_used] | [EX [~ [callToTask_s00001746_output_s00000960<=process_s00000383__s00005964_input_s00001512]] & [AG [callToTask_s00002427_input_s00000950<=callToTask_s00005849_input_s00000985] | fork_s00001536_activated_s00000991<=callToTask_s00005968_input_s00000952]]]
normalized: [[callToTask_s00005967_output_s00000979<=callToProcess_s00004075_inputCriterion_s00000937_used & E [true U 2<=callToTask_s00001971_output_s00000979]] | [[fork_s00001536_activated_s00000991<=callToTask_s00005968_input_s00000952 | ~ [E [true U ~ [callToTask_s00002427_input_s00000950<=callToTask_s00005849_input_s00000985]]]] & EX [~ [callToTask_s00001746_output_s00000960<=process_s00000383__s00005964_input_s00001512]]]]

abstracting: (callToTask_s00001746_output_s00000960<=process_s00000383__s00005964_input_s00001512) states: 15,546 (4)
.abstracting: (callToTask_s00002427_input_s00000950<=callToTask_s00005849_input_s00000985) states: 14,783 (4)
abstracting: (fork_s00001536_activated_s00000991<=callToTask_s00005968_input_s00000952) states: 15,546 (4)
abstracting: (2<=callToTask_s00001971_output_s00000979) states: 0
abstracting: (callToTask_s00005967_output_s00000979<=callToProcess_s00004075_inputCriterion_s00000937_used) states: 15,546 (4)
-> the formula is FALSE

FORMULA IBM5964-PT-none-CTLCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: ~ [E [[2<=callToTask_s00001746_inputCriterion_s00000937_used | callToProcess_s00002538_output_s00000961<=callToTask_s00005897_output_s00000956] U [fork_s00001536_activated_s00000993<=callToTask_s00001632_output_s00000956 & 3<=callToTask_s00005969_output_s00000938]]]
normalized: ~ [E [[2<=callToTask_s00001746_inputCriterion_s00000937_used | callToProcess_s00002538_output_s00000961<=callToTask_s00005897_output_s00000956] U [fork_s00001536_activated_s00000993<=callToTask_s00001632_output_s00000956 & 3<=callToTask_s00005969_output_s00000938]]]

abstracting: (3<=callToTask_s00005969_output_s00000938) states: 0
abstracting: (fork_s00001536_activated_s00000993<=callToTask_s00001632_output_s00000956) states: 15,546 (4)
abstracting: (callToProcess_s00002538_output_s00000961<=callToTask_s00005897_output_s00000956) states: 14,946 (4)
abstracting: (2<=callToTask_s00001746_inputCriterion_s00000937_used) states: 0
-> the formula is TRUE

FORMULA IBM5964-PT-none-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [~ [1<=merge_s00000945_input_s00000950] & E [~ [3<=callToProcess_s00002411_input_s00000935] U ~ [callToTask_s00005970_inputCriterion_s00000937_used<=callToTask_s00001632_inputCriterion_s00000937_used]]]
normalized: [~ [1<=merge_s00000945_input_s00000950] & E [~ [3<=callToProcess_s00002411_input_s00000935] U ~ [callToTask_s00005970_inputCriterion_s00000937_used<=callToTask_s00001632_inputCriterion_s00000937_used]]]

abstracting: (callToTask_s00005970_inputCriterion_s00000937_used<=callToTask_s00001632_inputCriterion_s00000937_used) states: 15,546 (4)
abstracting: (3<=callToProcess_s00002411_input_s00000935) states: 0
abstracting: (1<=merge_s00000945_input_s00000950) states: 0
-> the formula is FALSE

FORMULA IBM5964-PT-none-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EG [callToTask_s00002186_inputCriterion_s00000937_used<=callToTask_s00001971_input_s00000952]
normalized: EG [callToTask_s00002186_inputCriterion_s00000937_used<=callToTask_s00001971_input_s00000952]

abstracting: (callToTask_s00002186_inputCriterion_s00000937_used<=callToTask_s00001971_input_s00000952) states: 15,546 (4)

EG iterations: 0
-> the formula is TRUE

FORMULA IBM5964-PT-none-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [[fork_s00001067_input_s00000950<=callToTask_s00005849_output_s00000938 & ~ [[3<=callToTask_s00005968_output_s00000979 & 1<=callToTask_s00005969_output_s00000960]]]]
normalized: ~ [E [true U ~ [[fork_s00001067_input_s00000950<=callToTask_s00005849_output_s00000938 & ~ [[3<=callToTask_s00005968_output_s00000979 & 1<=callToTask_s00005969_output_s00000960]]]]]]

abstracting: (1<=callToTask_s00005969_output_s00000960) states: 0
abstracting: (3<=callToTask_s00005968_output_s00000979) states: 0
abstracting: (fork_s00001067_input_s00000950<=callToTask_s00005849_output_s00000938) states: 15,546 (4)
-> the formula is TRUE

FORMULA IBM5964-PT-none-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[E [join_s00001295_activated_s00000946<=callToTask_s00005966_inputCriterion_s00000937_used U 3<=callToTask_s00002190_output_s00000938] | AG [[callToTask_s00002185_input_s00000952<=callToTask_s00002183_output_s00000956 | 1<=callToProcess_s00001273_input_s00000950]]] | ~ [decision_s00000999_activated<=merge_s00001292_activated]]
normalized: [[~ [E [true U ~ [[callToTask_s00002185_input_s00000952<=callToTask_s00002183_output_s00000956 | 1<=callToProcess_s00001273_input_s00000950]]]] | E [join_s00001295_activated_s00000946<=callToTask_s00005966_inputCriterion_s00000937_used U 3<=callToTask_s00002190_output_s00000938]] | ~ [decision_s00000999_activated<=merge_s00001292_activated]]

abstracting: (decision_s00000999_activated<=merge_s00001292_activated) states: 15,546 (4)
abstracting: (3<=callToTask_s00002190_output_s00000938) states: 0
abstracting: (join_s00001295_activated_s00000946<=callToTask_s00005966_inputCriterion_s00000937_used) states: 15,546 (4)
abstracting: (1<=callToProcess_s00001273_input_s00000950) states: 0
abstracting: (callToTask_s00002185_input_s00000952<=callToTask_s00002183_output_s00000956) states: 15,546 (4)
-> the formula is TRUE

FORMULA IBM5964-PT-none-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: E [~ [[callToProcess_s00002538_inputCriterion_s00000937_used<=callToTask_s00005968_output_s00000956 & 3<=callToTask_s00005967_input_s00000935]] U AF [2<=callToTask_s00002741_output_s00000981]]
normalized: E [~ [[callToProcess_s00002538_inputCriterion_s00000937_used<=callToTask_s00005968_output_s00000956 & 3<=callToTask_s00005967_input_s00000935]] U ~ [EG [~ [2<=callToTask_s00002741_output_s00000981]]]]

abstracting: (2<=callToTask_s00002741_output_s00000981) states: 0

EG iterations: 0
abstracting: (3<=callToTask_s00005967_input_s00000935) states: 0
abstracting: (callToProcess_s00002538_inputCriterion_s00000937_used<=callToTask_s00005968_output_s00000956) states: 14,783 (4)
-> the formula is FALSE

FORMULA IBM5964-PT-none-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec


Total processing time: 0m5sec


BK_STOP 1433633205978

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


iterations count:390 (2), effective:51 (0)

initing FirstDep: 0m0sec


iterations count:139 (1), effective:0 (0)

iterations count:244 (1), effective:20 (0)

iterations count:139 (1), effective:0 (0)

iterations count:239 (1), effective:19 (0)

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="IBM5964-PT-none"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/root/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/IBM5964-PT-none.tgz
mv IBM5964-PT-none 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 IBM5964-PT-none, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r232su-smll-143354324700054"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "ReachabilityComputeBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;