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 S_BridgeAndVehicles-PT-V04P05N02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r173kn-ebro-146433145200255
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1464792401949


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

Net: BridgeAndVehicles_PT_V04P05N02
(NrP: 28 NrTr: 52 NrArc: 326)

net check time: 0m 0.000sec

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

init dd package: 0m 7.976sec


RS generation: 0m 0.050sec


-> reachability set: #nodes 1448 (1.4e+03) #states 2,874 (3)



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

checking: EG [~ [AX [ROUTE_B<=ATTENTE_A]]]
normalized: EG [EX [~ [ROUTE_B<=ATTENTE_A]]]

abstracting: (ROUTE_B<=ATTENTE_A) states: 1,890 (3)
...................................................
EG iterations: 50
-> the formula is FALSE

FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.422sec

checking: EG [AF [[3<=ROUTE_B & 2<=ROUTE_A]]]
normalized: EG [~ [EG [~ [[3<=ROUTE_B & 2<=ROUTE_A]]]]]

abstracting: (2<=ROUTE_A) states: 940
abstracting: (3<=ROUTE_B) states: 371
.
EG iterations: 1
.......................
EG iterations: 23
-> the formula is FALSE

FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.060sec

checking: AF [EG [~ [ATTENTE_B<=sum(VIDANGE_2, VIDANGE_1)]]]
normalized: ~ [EG [~ [EG [~ [ATTENTE_B<=sum(VIDANGE_2, VIDANGE_1)]]]]]

abstracting: (ATTENTE_B<=sum(VIDANGE_2, VIDANGE_1)) states: 1,217 (3)
.....................................
EG iterations: 37

EG iterations: 0
-> the formula is FALSE

FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.419sec

checking: [AF [~ [1<=SUR_PONT_A]] & AF [AG [sum(CONTROLEUR_2, CONTROLEUR_1)<=ROUTE_A]]]
normalized: [~ [EG [1<=SUR_PONT_A]] & ~ [EG [E [true U ~ [sum(CONTROLEUR_2, CONTROLEUR_1)<=ROUTE_A]]]]]

abstracting: (sum(CONTROLEUR_2, CONTROLEUR_1)<=ROUTE_A) states: 2,566 (3)

EG iterations: 0
abstracting: (1<=SUR_PONT_A) states: 628
.............
EG iterations: 13
-> the formula is FALSE

FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.308sec

checking: AF [[2<=sum(CHOIX_2, CHOIX_1) | ROUTE_A<=SORTI_B]]
normalized: ~ [EG [~ [[2<=sum(CHOIX_2, CHOIX_1) | ROUTE_A<=SORTI_B]]]]

abstracting: (ROUTE_A<=SORTI_B) states: 2,025 (3)
abstracting: (2<=sum(CHOIX_2, CHOIX_1)) states: 0
...............................
EG iterations: 31
-> the formula is TRUE

FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.331sec

checking: ~ [AF [EG [sum(CHOIX_2, CHOIX_1)<=sum(VIDANGE_2, VIDANGE_1)]]]
normalized: EG [~ [EG [sum(CHOIX_2, CHOIX_1)<=sum(VIDANGE_2, VIDANGE_1)]]]

abstracting: (sum(CHOIX_2, CHOIX_1)<=sum(VIDANGE_2, VIDANGE_1)) states: 1,553 (3)
...........
EG iterations: 11
..........................................................
EG iterations: 58
-> the formula is FALSE

FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.943sec

checking: EG [A [sum(VIDANGE_2, VIDANGE_1)<=CAPACITE U 3<=sum(VIDANGE_2, VIDANGE_1)]]
normalized: EG [[~ [EG [~ [3<=sum(VIDANGE_2, VIDANGE_1)]]] & ~ [E [~ [3<=sum(VIDANGE_2, VIDANGE_1)] U [~ [sum(VIDANGE_2, VIDANGE_1)<=CAPACITE] & ~ [3<=sum(VIDANGE_2, VIDANGE_1)]]]]]]

abstracting: (3<=sum(VIDANGE_2, VIDANGE_1)) states: 0
abstracting: (sum(VIDANGE_2, VIDANGE_1)<=CAPACITE) states: 2,874 (3)
abstracting: (3<=sum(VIDANGE_2, VIDANGE_1)) states: 0
abstracting: (3<=sum(VIDANGE_2, VIDANGE_1)) states: 0

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

FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.348sec

checking: AG [~ [AG [2<=sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)]]]
normalized: ~ [E [true U ~ [E [true U ~ [2<=sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)]]]]]

abstracting: (2<=sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)) states: 0
-> the formula is TRUE

FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.093sec

checking: ~ [AG [[[2<=ROUTE_B | 2<=CAPACITE] | [ATTENTE_A<=SORTI_B & 2<=CAPACITE]]]]
normalized: E [true U ~ [[[ATTENTE_A<=SORTI_B & 2<=CAPACITE] | [2<=ROUTE_B | 2<=CAPACITE]]]]

abstracting: (2<=CAPACITE) states: 2,874 (3)
abstracting: (2<=ROUTE_B) states: 934
abstracting: (2<=CAPACITE) states: 2,874 (3)
abstracting: (ATTENTE_A<=SORTI_B) states: 1,950 (3)
-> the formula is FALSE

FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

checking: EX [[EG [1<=ROUTE_A] | AX [2<=sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)]]]
normalized: EX [[~ [EX [~ [2<=sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)]]] | EG [1<=ROUTE_A]]]

abstracting: (1<=ROUTE_A) states: 1,775 (3)
....................................................
EG iterations: 52
abstracting: (2<=sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)) states: 0
..-> the formula is FALSE

FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.371sec

checking: [EF [AF [ATTENTE_A<=sum(VIDANGE_2, VIDANGE_1)]] & A [1<=CAPACITE U [3<=SORTI_A & 3<=ROUTE_B]]]
normalized: [[~ [EG [~ [[3<=SORTI_A & 3<=ROUTE_B]]]] & ~ [E [~ [[3<=SORTI_A & 3<=ROUTE_B]] U [~ [1<=CAPACITE] & ~ [[3<=SORTI_A & 3<=ROUTE_B]]]]]] & E [true U ~ [EG [~ [ATTENTE_A<=sum(VIDANGE_2, VIDANGE_1)]]]]]

abstracting: (ATTENTE_A<=sum(VIDANGE_2, VIDANGE_1)) states: 1,228 (3)
....................................
EG iterations: 36
abstracting: (3<=ROUTE_B) states: 371
abstracting: (3<=SORTI_A) states: 574
abstracting: (1<=CAPACITE) states: 2,874 (3)
abstracting: (3<=ROUTE_B) states: 371
abstracting: (3<=SORTI_A) states: 574
abstracting: (3<=ROUTE_B) states: 371
abstracting: (3<=SORTI_A) states: 574
.
EG iterations: 1
-> the formula is FALSE

FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.232sec

checking: ~ [~ [[~ [[ATTENTE_A<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0) | 2<=SUR_PONT_B]] | AG [ATTENTE_A<=ATTENTE_A]]]]
normalized: [~ [E [true U ~ [ATTENTE_A<=ATTENTE_A]]] | ~ [[ATTENTE_A<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0) | 2<=SUR_PONT_B]]]

abstracting: (2<=SUR_PONT_B) states: 160
abstracting: (ATTENTE_A<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)) states: 1,863 (3)
abstracting: (ATTENTE_A<=ATTENTE_A) states: 2,874 (3)
-> the formula is TRUE

FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.122sec

checking: A [EX [ATTENTE_B<=CAPACITE] U [~ [3<=sum(VIDANGE_2, VIDANGE_1)] & [ROUTE_B<=CAPACITE & sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)<=ATTENTE_A]]]
normalized: [~ [EG [~ [[[ROUTE_B<=CAPACITE & sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)<=ATTENTE_A] & ~ [3<=sum(VIDANGE_2, VIDANGE_1)]]]]] & ~ [E [~ [[[ROUTE_B<=CAPACITE & sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)<=ATTENTE_A] & ~ [3<=sum(VIDANGE_2, VIDANGE_1)]]] U [~ [EX [ATTENTE_B<=CAPACITE]] & ~ [[[ROUTE_B<=CAPACITE & sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)<=ATTENTE_A] & ~ [3<=sum(VIDANGE_2, VIDANGE_1)]]]]]]]

abstracting: (3<=sum(VIDANGE_2, VIDANGE_1)) states: 0
abstracting: (sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)<=ATTENTE_A) states: 1,862 (3)
abstracting: (ROUTE_B<=CAPACITE) states: 2,866 (3)
abstracting: (ATTENTE_B<=CAPACITE) states: 2,866 (3)
.abstracting: (3<=sum(VIDANGE_2, VIDANGE_1)) states: 0
abstracting: (sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)<=ATTENTE_A) states: 1,862 (3)
abstracting: (ROUTE_B<=CAPACITE) states: 2,866 (3)
abstracting: (3<=sum(VIDANGE_2, VIDANGE_1)) states: 0
abstracting: (sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)<=ATTENTE_A) states: 1,862 (3)
abstracting: (ROUTE_B<=CAPACITE) states: 2,866 (3)
..............................
EG iterations: 30
-> the formula is TRUE

FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.825sec

checking: EG [AF [[SORTI_B<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0) | sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)<=ATTENTE_A]]]
normalized: EG [~ [EG [~ [[SORTI_B<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0) | sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)<=ATTENTE_A]]]]]

abstracting: (sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)<=ATTENTE_A) states: 1,862 (3)
abstracting: (SORTI_B<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)) states: 1,596 (3)
..................
EG iterations: 18
........................................................
EG iterations: 56
-> the formula is FALSE

FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.946sec

checking: EF [[3<=sum(CONTROLEUR_2, CONTROLEUR_1) & [[1<=sum(CONTROLEUR_2, CONTROLEUR_1) & ROUTE_A<=ATTENTE_B] & [SUR_PONT_A<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0) & 1<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)]]]]
normalized: E [true U [3<=sum(CONTROLEUR_2, CONTROLEUR_1) & [[SUR_PONT_A<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0) & 1<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)] & [1<=sum(CONTROLEUR_2, CONTROLEUR_1) & ROUTE_A<=ATTENTE_B]]]]

abstracting: (ROUTE_A<=ATTENTE_B) states: 1,890 (3)
abstracting: (1<=sum(CONTROLEUR_2, CONTROLEUR_1)) states: 841
abstracting: (1<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)) states: 2,874 (3)
abstracting: (SUR_PONT_A<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)) states: 2,714 (3)
abstracting: (3<=sum(CONTROLEUR_2, CONTROLEUR_1)) states: 0
-> the formula is FALSE

FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.507sec

checking: A [~ [[SORTI_A<=sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0) & sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)<=ROUTE_A]] U EF [3<=sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)]]
normalized: [~ [EG [~ [E [true U 3<=sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)]]]] & ~ [E [~ [E [true U 3<=sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)]] U [~ [E [true U 3<=sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)]] & [SORTI_A<=sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0) & sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)<=ROUTE_A]]]]]

abstracting: (sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)<=ROUTE_A) states: 1,775 (3)
abstracting: (SORTI_A<=sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)) states: 1,596 (3)
abstracting: (3<=sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)) states: 0
abstracting: (3<=sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)) states: 0
abstracting: (3<=sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)) states: 0

EG iterations: 0
-> the formula is FALSE

FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.674sec


Total processing time: 0m20.459sec


BK_STOP 1464792422455

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

check for maximal unmarked siphon
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.001sec

1263
iterations count:1718 (33), effective:171 (3)

initing FirstDep: 0m 0.000sec

1286 1364
iterations count:2221 (42), effective:193 (3)

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

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

iterations count:907 (17), effective:80 (1)

iterations count:52 (1), effective:0 (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="S_BridgeAndVehicles-PT-V04P05N02"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/users/gast00/fkordon/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_BridgeAndVehicles-PT-V04P05N02.tgz
mv S_BridgeAndVehicles-PT-V04P05N02 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 S_BridgeAndVehicles-PT-V04P05N02, 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 r173kn-ebro-146433145200255"
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 ;