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 BridgeAndVehicles-PT-V04P05N02, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r190su-smll-143330904700269
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1433548989096

Model: BridgeAndVehicles-PT-V04P05N02
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=ReachabilityCardinality.xml --memory=6 --suppress --rs-algorithm=3 --place-order=5

parse successfull
net created successfully

(NrP: 28 NrTr: 52 NrArc: 326)

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 2204 (2.2e+03) #states 2,874 (3)



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

checking: EF [[[[sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)<=ROUTE_A & 3<=sum(VIDANGE_2, VIDANGE_1)] & [3<=ATTENTE_A | sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)<=SUR_PONT_B]] & ~ [~ [ATTENTE_B<=ATTENTE_A]]]]
normalized: E [true U [ATTENTE_B<=ATTENTE_A & [[sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)<=ROUTE_A & 3<=sum(VIDANGE_2, VIDANGE_1)] & [3<=ATTENTE_A | sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)<=SUR_PONT_B]]]]

abstracting: (sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)<=SUR_PONT_B) states: 628
abstracting: (3<=ATTENTE_A) states: 420
abstracting: (3<=sum(VIDANGE_2, VIDANGE_1)) states: 0
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: (ATTENTE_B<=ATTENTE_A) states: 1,824 (3)
-> the formula is FALSE

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

MC time: 0m0sec

checking: EF [3<=sum(CHOIX_2, CHOIX_1)]
normalized: E [true U 3<=sum(CHOIX_2, CHOIX_1)]

abstracting: (3<=sum(CHOIX_2, CHOIX_1)) states: 0
-> the formula is FALSE

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

MC time: 0m0sec

checking: EF [[~ [sum(CHOIX_2, CHOIX_1)<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)] & SORTI_B<=SORTI_A]]
normalized: E [true U [SORTI_B<=SORTI_A & ~ [sum(CHOIX_2, CHOIX_1)<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)]]]

abstracting: (sum(CHOIX_2, CHOIX_1)<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)) states: 2,874 (3)
abstracting: (SORTI_B<=SORTI_A) states: 1,832 (3)
-> the formula is FALSE

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

MC time: 0m0sec

checking: AG [~ [~ [~ [3<=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(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)]]

abstracting: (3<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)) states: 0
-> the formula is TRUE

FORMULA BridgeAndVehicles-COL-V04P05N02-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [[[[3<=ROUTE_A & ROUTE_B<=CAPACITE] & [2<=sum(CONTROLEUR_2, CONTROLEUR_1) & sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)<=sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)]] & ~ [[2<=sum(CHOIX_2, CHOIX_1) | ROUTE_B<=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 [~ [[2<=sum(CHOIX_2, CHOIX_1) | ROUTE_B<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)]] & [[2<=sum(CONTROLEUR_2, CONTROLEUR_1) & sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)<=sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)] & [3<=ROUTE_A & ROUTE_B<=CAPACITE]]]]

abstracting: (ROUTE_B<=CAPACITE) states: 2,866 (3)
abstracting: (3<=ROUTE_A) states: 380
abstracting: (sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)<=sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)) states: 2,874 (3)
abstracting: (2<=sum(CONTROLEUR_2, CONTROLEUR_1)) states: 0
abstracting: (ROUTE_B<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)) states: 1,940 (3)
abstracting: (2<=sum(CHOIX_2, CHOIX_1)) states: 0
-> the formula is FALSE

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

MC time: 0m0sec

checking: AG [[1<=CAPACITE | ~ [[sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)<=sum(CHOIX_2, CHOIX_1) & CAPACITE<=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 ~ [[1<=CAPACITE | ~ [[sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)<=sum(CHOIX_2, CHOIX_1) & CAPACITE<=sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)]]]]]]

abstracting: (CAPACITE<=sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)) states: 0
abstracting: (sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)<=sum(CHOIX_2, CHOIX_1)) states: 1,321 (3)
abstracting: (1<=CAPACITE) states: 2,874 (3)
-> the formula is TRUE

FORMULA BridgeAndVehicles-COL-V04P05N02-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [[~ [~ [1<=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_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0) | [ROUTE_A<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0) | 1<=sum(VIDANGE_2, VIDANGE_1)]]]]
normalized: ~ [E [true U ~ [[1<=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_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0) | [ROUTE_A<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0) | 1<=sum(VIDANGE_2, VIDANGE_1)]]]]]]

abstracting: (1<=sum(VIDANGE_2, VIDANGE_1)) states: 712
abstracting: (ROUTE_A<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)) states: 1,934 (3)
abstracting: (sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)<=sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)) states: 2,874 (3)
abstracting: (1<=SORTI_B) states: 2,108 (3)
-> the formula is TRUE

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

MC time: 0m0sec

checking: AG [sum(CHOIX_2, CHOIX_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 ~ [sum(CHOIX_2, CHOIX_1)<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)]]]

abstracting: (sum(CHOIX_2, CHOIX_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)
-> the formula is TRUE

FORMULA BridgeAndVehicles-COL-V04P05N02-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [3<=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(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)]

abstracting: (3<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)) states: 0
-> the formula is FALSE

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

MC time: 0m0sec

checking: EF [[[[SORTI_B<=ATTENTE_B & 3<=sum(VIDANGE_2, VIDANGE_1)] & SUR_PONT_B<=ATTENTE_B] & ~ [[SUR_PONT_A<=ATTENTE_A | ATTENTE_A<=ATTENTE_B]]]]
normalized: E [true U [~ [[SUR_PONT_A<=ATTENTE_A | ATTENTE_A<=ATTENTE_B]] & [SUR_PONT_B<=ATTENTE_B & [SORTI_B<=ATTENTE_B & 3<=sum(VIDANGE_2, VIDANGE_1)]]]]

abstracting: (3<=sum(VIDANGE_2, VIDANGE_1)) states: 0
abstracting: (SORTI_B<=ATTENTE_B) states: 1,577 (3)
abstracting: (SUR_PONT_B<=ATTENTE_B) states: 2,550 (3)
abstracting: (ATTENTE_A<=ATTENTE_B) states: 1,836 (3)
abstracting: (SUR_PONT_A<=ATTENTE_A) states: 2,550 (3)
-> the formula is FALSE

FORMULA BridgeAndVehicles-COL-V04P05N02-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [[~ [[1<=ROUTE_A | sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)<=ATTENTE_B]] & [[1<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0) & 2<=sum(CONTROLEUR_2, CONTROLEUR_1)] & ~ [SORTI_B<=sum(VIDANGE_2, VIDANGE_1)]]]]
normalized: E [true U [[[1<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0) & 2<=sum(CONTROLEUR_2, CONTROLEUR_1)] & ~ [SORTI_B<=sum(VIDANGE_2, VIDANGE_1)]] & ~ [[1<=ROUTE_A | sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)<=ATTENTE_B]]]]

abstracting: (sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)<=ATTENTE_B) states: 1,874 (3)
abstracting: (1<=ROUTE_A) states: 1,775 (3)
abstracting: (SORTI_B<=sum(VIDANGE_2, VIDANGE_1)) states: 967
abstracting: (2<=sum(CONTROLEUR_2, CONTROLEUR_1)) states: 0
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)
-> the formula is FALSE

FORMULA BridgeAndVehicles-COL-V04P05N02-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [~ [[~ [sum(CHOIX_2, CHOIX_1)<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)] & ~ [ROUTE_B<=SUR_PONT_B]]]]
normalized: ~ [E [true U [~ [sum(CHOIX_2, CHOIX_1)<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)] & ~ [ROUTE_B<=SUR_PONT_B]]]]

abstracting: (ROUTE_B<=SUR_PONT_B) states: 1,326 (3)
abstracting: (sum(CHOIX_2, CHOIX_1)<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)) states: 2,874 (3)
-> the formula is TRUE

FORMULA BridgeAndVehicles-COL-V04P05N02-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [~ [~ [[3<=SORTI_A | 1<=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 ~ [[3<=SORTI_A | 1<=sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)]]]]

abstracting: (1<=sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)) states: 2,874 (3)
abstracting: (3<=SORTI_A) states: 574
-> the formula is TRUE

FORMULA BridgeAndVehicles-COL-V04P05N02-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [2<=sum(CHOIX_2, CHOIX_1)]
normalized: E [true U 2<=sum(CHOIX_2, CHOIX_1)]

abstracting: (2<=sum(CHOIX_2, CHOIX_1)) states: 0
-> the formula is FALSE

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

MC time: 0m0sec

checking: EF [~ [[[ATTENTE_A<=CAPACITE | 3<=SUR_PONT_A] | [ROUTE_B<=SUR_PONT_B | 2<=sum(CONTROLEUR_2, CONTROLEUR_1)]]]]
normalized: E [true U ~ [[[ATTENTE_A<=CAPACITE | 3<=SUR_PONT_A] | [ROUTE_B<=SUR_PONT_B | 2<=sum(CONTROLEUR_2, CONTROLEUR_1)]]]]

abstracting: (2<=sum(CONTROLEUR_2, CONTROLEUR_1)) states: 0
abstracting: (ROUTE_B<=SUR_PONT_B) states: 1,326 (3)
abstracting: (3<=SUR_PONT_A) states: 0
abstracting: (ATTENTE_A<=CAPACITE) states: 2,866 (3)
-> the formula is FALSE

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

MC time: 0m0sec

checking: EF [~ [~ [2<=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 2<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)]

abstracting: (2<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)) states: 0
-> the formula is FALSE

FORMULA BridgeAndVehicles-COL-V04P05N02-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec


Total processing time: 0m4sec


BK_STOP 1433548993969

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

928 1756
iterations count:2592 (49), effective:176 (3)

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="BridgeAndVehicles-PT-V04P05N02"
export BK_EXAMINATION="ReachabilityCardinality"
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/BridgeAndVehicles-PT-V04P05N02.tgz
mv BridgeAndVehicles-PT-V04P05N02 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 BridgeAndVehicles-PT-V04P05N02, 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 r190su-smll-143330904700269"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "ReachabilityComputeBounds" ] ; 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 ;