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-2979
Executing tool marcie
Input is SafeBus-COL-03, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r113kn-smll-146373293100120
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463762848348


Marcie rev. 8535M (built: crohr on 2016-04-27)
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 --mcc-mode --memory=6 --suppress

parse successfull
net created successfully

Unfolding complete |P|=60|T|=97|A|=568
Time for unfolding: 0m 1.483sec

Net: SafeBus_COL_03
(NrP: 60 NrTr: 97 NrArc: 568)

net check time: 0m 0.000sec

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

init dd package: 0m 3.588sec


RS generation: 0m 0.296sec


-> reachability set: #nodes 4334 (4.3e+03) #states 4,650 (3)



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

checking: EF [2<=T_out_dot]
normalized: E [true U 2<=T_out_dot]

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

FORMULA SafeBus-COL-03-CTLCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: A [cable_free_dot<=R_tout_dot U 1<=S_tout_dot]
normalized: [~ [E [~ [1<=S_tout_dot] U [~ [1<=S_tout_dot] & ~ [cable_free_dot<=R_tout_dot]]]] & ~ [EG [~ [1<=S_tout_dot]]]]

abstracting: (1<=S_tout_dot) states: 2,559 (3)
.
EG iterations: 1
abstracting: (cable_free_dot<=R_tout_dot) states: 4,305 (3)
abstracting: (1<=S_tout_dot) states: 2,559 (3)
abstracting: (1<=S_tout_dot) states: 2,559 (3)
-> the formula is FALSE

FORMULA SafeBus-COL-03-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.093sec

checking: AF [~ [[[3<=S_tout_dot | 2<=S_tout_dot] | 1<=sum(Cpt2_It3, Cpt2_It2, Cpt2_It1)]]]
normalized: ~ [EG [[1<=sum(Cpt2_It3, Cpt2_It2, Cpt2_It1) | [3<=S_tout_dot | 2<=S_tout_dot]]]]

abstracting: (2<=S_tout_dot) states: 0
abstracting: (3<=S_tout_dot) states: 0
abstracting: (1<=sum(Cpt2_It3, Cpt2_It2, Cpt2_It1)) states: 4,650 (3)

EG iterations: 0
-> the formula is FALSE

FORMULA SafeBus-COL-03-CTLCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.057sec

checking: EG [AX [[3<=R_tout_dot | sum(RMC_It3, RMC_It2, RMC_It1)<=S_tout_dot]]]
normalized: EG [~ [EX [~ [[3<=R_tout_dot | sum(RMC_It3, RMC_It2, RMC_It1)<=S_tout_dot]]]]]

abstracting: (sum(RMC_It3, RMC_It2, RMC_It1)<=S_tout_dot) states: 3,831 (3)
abstracting: (3<=R_tout_dot) states: 0
......
EG iterations: 5
-> the formula is TRUE

FORMULA SafeBus-COL-03-CTLCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.289sec

checking: EG [~ [[~ [cable_free_dot<=sum(listen_It3, listen_It2, listen_It1)] & ~ [3<=sum(MSG_It3, MSG_It2, MSG_It1)]]]]
normalized: EG [~ [[~ [3<=sum(MSG_It3, MSG_It2, MSG_It1)] & ~ [cable_free_dot<=sum(listen_It3, listen_It2, listen_It1)]]]]

abstracting: (cable_free_dot<=sum(listen_It3, listen_It2, listen_It1)) states: 4,344 (3)
abstracting: (3<=sum(MSG_It3, MSG_It2, MSG_It1)) states: 0
.......
EG iterations: 7
-> the formula is TRUE

FORMULA SafeBus-COL-03-CTLCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.208sec

checking: EG [E [FMCb_dot<=sum(Cpt1_It3, Cpt1_It2, Cpt1_It1) U 3<=sum(wait_msg_It3, wait_msg_It2, wait_msg_It1)]]
normalized: EG [E [FMCb_dot<=sum(Cpt1_It3, Cpt1_It2, Cpt1_It1) U 3<=sum(wait_msg_It3, wait_msg_It2, wait_msg_It1)]]

abstracting: (3<=sum(wait_msg_It3, wait_msg_It2, wait_msg_It1)) states: 0
abstracting: (FMCb_dot<=sum(Cpt1_It3, Cpt1_It2, Cpt1_It1)) states: 4,650 (3)
.
EG iterations: 1
-> the formula is FALSE

FORMULA SafeBus-COL-03-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.073sec

checking: EX [AF [[3<=sum(listen_It3, listen_It2, listen_It1) & sum(Cpt1_It3, Cpt1_It2, Cpt1_It1)<=sum(listen_It3, listen_It2, listen_It1)]]]
normalized: EX [~ [EG [~ [[3<=sum(listen_It3, listen_It2, listen_It1) & sum(Cpt1_It3, Cpt1_It2, Cpt1_It1)<=sum(listen_It3, listen_It2, listen_It1)]]]]]

abstracting: (sum(Cpt1_It3, Cpt1_It2, Cpt1_It1)<=sum(listen_It3, listen_It2, listen_It1)) states: 2,022 (3)
abstracting: (3<=sum(listen_It3, listen_It2, listen_It1)) states: 24
.
EG iterations: 1
.-> the formula is FALSE

FORMULA SafeBus-COL-03-CTLCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.095sec

checking: ~ [~ [[EG [sum(RMC_It3, RMC_It2, RMC_It1)<=sum(msgl_It3, msgl_It2, msgl_It1)] | AF [1<=sum(FMC_It3, FMC_It2, FMC_It1)]]]]
normalized: [~ [EG [~ [1<=sum(FMC_It3, FMC_It2, FMC_It1)]]] | EG [sum(RMC_It3, RMC_It2, RMC_It1)<=sum(msgl_It3, msgl_It2, msgl_It1)]]

abstracting: (sum(RMC_It3, RMC_It2, RMC_It1)<=sum(msgl_It3, msgl_It2, msgl_It1)) states: 4,650 (3)

EG iterations: 0
abstracting: (1<=sum(FMC_It3, FMC_It2, FMC_It1)) states: 1,152 (3)
..........10:3481..........20:0.
EG iterations: 21
-> the formula is TRUE

FORMULA SafeBus-COL-03-CTLCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.472sec

checking: AF [~ [[[3<=sum(cable_used_It3, cable_used_It2, cable_used_It1) | 3<=sum(cable_used_It3, cable_used_It2, cable_used_It1)] & ~ [3<=sum(MSG_It3, MSG_It2, MSG_It1)]]]]
normalized: ~ [EG [[[3<=sum(cable_used_It3, cable_used_It2, cable_used_It1) | 3<=sum(cable_used_It3, cable_used_It2, cable_used_It1)] & ~ [3<=sum(MSG_It3, MSG_It2, MSG_It1)]]]]

abstracting: (3<=sum(MSG_It3, MSG_It2, MSG_It1)) states: 0
abstracting: (3<=sum(cable_used_It3, cable_used_It2, cable_used_It1)) states: 0
abstracting: (3<=sum(cable_used_It3, cable_used_It2, cable_used_It1)) states: 0
.
EG iterations: 1
-> the formula is TRUE

FORMULA SafeBus-COL-03-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.121sec

checking: [EF [AX [2<=S_tout_dot]] | A [2<=S_tout_dot U [3<=sum(cable_used_It3, cable_used_It2, cable_used_It1) & sum(FMC_It3, FMC_It2, FMC_It1)<=sum(listen_It3, listen_It2, listen_It1)]]]
normalized: [E [true U ~ [EX [~ [2<=S_tout_dot]]]] | [~ [EG [~ [[3<=sum(cable_used_It3, cable_used_It2, cable_used_It1) & sum(FMC_It3, FMC_It2, FMC_It1)<=sum(listen_It3, listen_It2, listen_It1)]]]] & ~ [E [~ [[3<=sum(cable_used_It3, cable_used_It2, cable_used_It1) & sum(FMC_It3, FMC_It2, FMC_It1)<=sum(listen_It3, listen_It2, listen_It1)]] U [~ [2<=S_tout_dot] & ~ [[3<=sum(cable_used_It3, cable_used_It2, cable_used_It1) & sum(FMC_It3, FMC_It2, FMC_It1)<=sum(listen_It3, listen_It2, listen_It1)]]]]]]]

abstracting: (sum(FMC_It3, FMC_It2, FMC_It1)<=sum(listen_It3, listen_It2, listen_It1)) states: 4,164 (3)
abstracting: (3<=sum(cable_used_It3, cable_used_It2, cable_used_It1)) states: 0
abstracting: (2<=S_tout_dot) states: 0
abstracting: (sum(FMC_It3, FMC_It2, FMC_It1)<=sum(listen_It3, listen_It2, listen_It1)) states: 4,164 (3)
abstracting: (3<=sum(cable_used_It3, cable_used_It2, cable_used_It1)) states: 0
abstracting: (sum(FMC_It3, FMC_It2, FMC_It1)<=sum(listen_It3, listen_It2, listen_It1)) states: 4,164 (3)
abstracting: (3<=sum(cable_used_It3, cable_used_It2, cable_used_It1)) states: 0

EG iterations: 0
abstracting: (2<=S_tout_dot) states: 0
.-> the formula is FALSE

FORMULA SafeBus-COL-03-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.317sec

checking: ~ [~ [AF [~ [sum(wait_ack_It3_It3, wait_ack_It3_It2, wait_ack_It3_It1, wait_ack_It2_It3, wait_ack_It2_It2, wait_ack_It2_It1, wait_ack_It1_It3, wait_ack_It1_It2, wait_ack_It1_It1)<=sum(RMC_It3, RMC_It2, RMC_It1)]]]]
normalized: ~ [EG [sum(wait_ack_It3_It3, wait_ack_It3_It2, wait_ack_It3_It1, wait_ack_It2_It3, wait_ack_It2_It2, wait_ack_It2_It1, wait_ack_It1_It3, wait_ack_It1_It2, wait_ack_It1_It1)<=sum(RMC_It3, RMC_It2, RMC_It1)]]

abstracting: (sum(wait_ack_It3_It3, wait_ack_It3_It2, wait_ack_It3_It1, wait_ack_It2_It3, wait_ack_It2_It2, wait_ack_It2_It1, wait_ack_It1_It3, wait_ack_It1_It2, wait_ack_It1_It1)<=sum(RMC_It3, RMC_It2, RMC_It1)) states: 3,120 (3)
......
EG iterations: 6
-> the formula is FALSE

FORMULA SafeBus-COL-03-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.146sec

checking: A [~ [[sum(msgl_It3, msgl_It2, msgl_It1)<=ACK_dot | sum(Cpt2_It3, Cpt2_It2, Cpt2_It1)<=ACK_dot]] U EG [ACK_dot<=sum(loop_em_It3, loop_em_It2, loop_em_It1)]]
normalized: [~ [EG [~ [EG [ACK_dot<=sum(loop_em_It3, loop_em_It2, loop_em_It1)]]]] & ~ [E [~ [EG [ACK_dot<=sum(loop_em_It3, loop_em_It2, loop_em_It1)]] U [[sum(msgl_It3, msgl_It2, msgl_It1)<=ACK_dot | sum(Cpt2_It3, Cpt2_It2, Cpt2_It1)<=ACK_dot] & ~ [EG [ACK_dot<=sum(loop_em_It3, loop_em_It2, loop_em_It1)]]]]]]

abstracting: (ACK_dot<=sum(loop_em_It3, loop_em_It2, loop_em_It1)) states: 4,038 (3)
.
EG iterations: 1
abstracting: (sum(Cpt2_It3, Cpt2_It2, Cpt2_It1)<=ACK_dot) states: 936
abstracting: (sum(msgl_It3, msgl_It2, msgl_It1)<=ACK_dot) states: 0
abstracting: (ACK_dot<=sum(loop_em_It3, loop_em_It2, loop_em_It1)) states: 4,038 (3)
.
EG iterations: 1
abstracting: (ACK_dot<=sum(loop_em_It3, loop_em_It2, loop_em_It1)) states: 4,038 (3)
.
EG iterations: 1
........
EG iterations: 8
-> the formula is TRUE

FORMULA SafeBus-COL-03-CTLCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.283sec

checking: EG [[EF [sum(FMC_It3, FMC_It2, FMC_It1)<=FMCb_dot] | [[3<=T_out_dot | cable_free_dot<=sum(Cpt2_It3, Cpt2_It2, Cpt2_It1)] | sum(PMC_It3, PMC_It2, PMC_It1)<=T_out_dot]]]
normalized: EG [[E [true U sum(FMC_It3, FMC_It2, FMC_It1)<=FMCb_dot] | [sum(PMC_It3, PMC_It2, PMC_It1)<=T_out_dot | [3<=T_out_dot | cable_free_dot<=sum(Cpt2_It3, Cpt2_It2, Cpt2_It1)]]]]

abstracting: (cable_free_dot<=sum(Cpt2_It3, Cpt2_It2, Cpt2_It1)) states: 4,650 (3)
abstracting: (3<=T_out_dot) states: 0
abstracting: (sum(PMC_It3, PMC_It2, PMC_It1)<=T_out_dot) states: 4,182 (3)
abstracting: (sum(FMC_It3, FMC_It2, FMC_It1)<=FMCb_dot) states: 3,498 (3)

EG iterations: 0
-> the formula is TRUE

FORMULA SafeBus-COL-03-CTLCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.117sec

checking: EF [EG [[3<=sum(msgl_It3, msgl_It2, msgl_It1) & FMCb_dot<=sum(wait_ack_It3_It3, wait_ack_It3_It2, wait_ack_It3_It1, wait_ack_It2_It3, wait_ack_It2_It2, wait_ack_It2_It1, wait_ack_It1_It3, wait_ack_It1_It2, wait_ack_It1_It1)]]]
normalized: E [true U EG [[3<=sum(msgl_It3, msgl_It2, msgl_It1) & FMCb_dot<=sum(wait_ack_It3_It3, wait_ack_It3_It2, wait_ack_It3_It1, wait_ack_It2_It3, wait_ack_It2_It2, wait_ack_It2_It1, wait_ack_It1_It3, wait_ack_It1_It2, wait_ack_It1_It1)]]]

abstracting: (FMCb_dot<=sum(wait_ack_It3_It3, wait_ack_It3_It2, wait_ack_It3_It1, wait_ack_It2_It3, wait_ack_It2_It2, wait_ack_It2_It1, wait_ack_It1_It3, wait_ack_It1_It2, wait_ack_It1_It1)) states: 3,492 (3)
abstracting: (3<=sum(msgl_It3, msgl_It2, msgl_It1)) states: 4,650 (3)
..........10:2525..........20:0.
EG iterations: 21
-> the formula is FALSE

FORMULA SafeBus-COL-03-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.227sec

checking: AF [AG [[sum(cable_used_It3, cable_used_It2, cable_used_It1)<=sum(wait_ack_It3_It3, wait_ack_It3_It2, wait_ack_It3_It1, wait_ack_It2_It3, wait_ack_It2_It2, wait_ack_It2_It1, wait_ack_It1_It3, wait_ack_It1_It2, wait_ack_It1_It1) | T_out_dot<=S_tout_dot]]]
normalized: ~ [EG [E [true U ~ [[sum(cable_used_It3, cable_used_It2, cable_used_It1)<=sum(wait_ack_It3_It3, wait_ack_It3_It2, wait_ack_It3_It1, wait_ack_It2_It3, wait_ack_It2_It2, wait_ack_It2_It1, wait_ack_It1_It3, wait_ack_It1_It2, wait_ack_It1_It1) | T_out_dot<=S_tout_dot]]]]]

abstracting: (T_out_dot<=S_tout_dot) states: 4,650 (3)
abstracting: (sum(cable_used_It3, cable_used_It2, cable_used_It1)<=sum(wait_ack_It3_It3, wait_ack_It3_It2, wait_ack_It3_It1, wait_ack_It2_It3, wait_ack_It2_It2, wait_ack_It2_It1, wait_ack_It1_It3, wait_ack_It1_It2, wait_ack_It1_It1)) states: 3,030 (3)
.
EG iterations: 1
-> the formula is TRUE

FORMULA SafeBus-COL-03-CTLCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.040sec

checking: [~ [[AX [3<=sum(AMC_It3_It3, AMC_It3_It2, AMC_It3_It1, AMC_It2_It3, AMC_It2_It2, AMC_It2_It1, AMC_It1_It3, AMC_It1_It2, AMC_It1_It1)] | EF [3<=sum(wait_ack_It3_It3, wait_ack_It3_It2, wait_ack_It3_It1, wait_ack_It2_It3, wait_ack_It2_It2, wait_ack_It2_It1, wait_ack_It1_It3, wait_ack_It1_It2, wait_ack_It1_It1)]]] | EG [2<=FMCb_dot]]
normalized: [~ [[~ [EX [~ [3<=sum(AMC_It3_It3, AMC_It3_It2, AMC_It3_It1, AMC_It2_It3, AMC_It2_It2, AMC_It2_It1, AMC_It1_It3, AMC_It1_It2, AMC_It1_It1)]]] | E [true U 3<=sum(wait_ack_It3_It3, wait_ack_It3_It2, wait_ack_It3_It1, wait_ack_It2_It3, wait_ack_It2_It2, wait_ack_It2_It1, wait_ack_It1_It3, wait_ack_It1_It2, wait_ack_It1_It1)]]] | EG [2<=FMCb_dot]]

abstracting: (2<=FMCb_dot) states: 0
.
EG iterations: 1
abstracting: (3<=sum(wait_ack_It3_It3, wait_ack_It3_It2, wait_ack_It3_It1, wait_ack_It2_It3, wait_ack_It2_It2, wait_ack_It2_It1, wait_ack_It1_It3, wait_ack_It1_It2, wait_ack_It1_It1)) states: 0
abstracting: (3<=sum(AMC_It3_It3, AMC_It3_It2, AMC_It3_It1, AMC_It2_It3, AMC_It2_It2, AMC_It2_It1, AMC_It1_It3, AMC_It1_It2, AMC_It1_It1)) states: 144
.-> the formula is TRUE

FORMULA SafeBus-COL-03-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.073sec


Total processing time: 0m 9.483sec


BK_STOP 1463762857865

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

check for maximal unmarked siphon
found
The net has a maximal unmarked siphon:
wait_ack_It2_It2
wait_ack_It3_It3
wait_ack_It1_It1

The net has transition(s) that can never fire:
I_reemit_1_1
I_free_0_0
I_free_1_1
I_free_2_2
I_reemit_2_2
I_reemit_0_0

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

.........10 4334...........

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="SafeBus-COL-03"
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/SafeBus-COL-03.tgz
mv SafeBus-COL-03 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool marcie"
echo " Input is SafeBus-COL-03, 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 r113kn-smll-146373293100120"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; 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 ;