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

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


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=ReachabilityCardinality.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.485sec


RS generation: 0m 0.037sec


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



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

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

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

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

MC time: 0m 0.001sec

checking: EF [~ [~ [[3<=SUR_PONT_A & 2<=ROUTE_B]]]]
normalized: E [true U [3<=SUR_PONT_A & 2<=ROUTE_B]]

abstracting: (2<=ROUTE_B) states: 934
abstracting: (3<=SUR_PONT_A) states: 0
-> the formula is FALSE

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

MC time: 0m 0.002sec

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

abstracting: (SORTI_A<=SORTI_A) 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: 0m 0.000sec

checking: AG [~ [[~ [2<=sum(VIDANGE_2, VIDANGE_1)] & ~ [sum(CHOIX_2, CHOIX_1)<=CAPACITE]]]]
normalized: ~ [E [true U [~ [sum(CHOIX_2, CHOIX_1)<=CAPACITE] & ~ [2<=sum(VIDANGE_2, VIDANGE_1)]]]]

abstracting: (2<=sum(VIDANGE_2, VIDANGE_1)) states: 0
abstracting: (sum(CHOIX_2, CHOIX_1)<=CAPACITE) states: 2,874 (3)
-> the formula is TRUE

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

MC time: 0m 0.116sec

checking: EF [~ [~ [[CAPACITE<=sum(VIDANGE_2, VIDANGE_1) & ATTENTE_A<=SUR_PONT_A]]]]
normalized: E [true U [CAPACITE<=sum(VIDANGE_2, VIDANGE_1) & ATTENTE_A<=SUR_PONT_A]]

abstracting: (ATTENTE_A<=SUR_PONT_A) states: 1,236 (3)
abstracting: (CAPACITE<=sum(VIDANGE_2, VIDANGE_1)) states: 0
-> the formula is FALSE

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

MC time: 0m 0.061sec

checking: EF [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 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 FALSE

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

MC time: 0m 0.059sec

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

abstracting: (2<=SORTI_B) states: 1,278 (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: (1<=sum(VIDANGE_2, VIDANGE_1)) states: 712
-> the formula is TRUE

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

MC time: 0m 0.121sec

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

abstracting: (sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)<=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: 0m 0.062sec

checking: EF [[[SORTI_A<=SUR_PONT_B & sum(CHOIX_2, CHOIX_1)<=sum(CHOIX_2, CHOIX_1)] & [[1<=ROUTE_B | 3<=SUR_PONT_A] & 3<=SORTI_A]]]
normalized: E [true U [[3<=SORTI_A & [1<=ROUTE_B | 3<=SUR_PONT_A]] & [SORTI_A<=SUR_PONT_B & sum(CHOIX_2, CHOIX_1)<=sum(CHOIX_2, CHOIX_1)]]]

abstracting: (sum(CHOIX_2, CHOIX_1)<=sum(CHOIX_2, CHOIX_1)) states: 2,874 (3)
abstracting: (SORTI_A<=SUR_PONT_B) states: 990
abstracting: (3<=SUR_PONT_A) states: 0
abstracting: (1<=ROUTE_B) states: 1,772 (3)
abstracting: (3<=SORTI_A) states: 574
-> the formula is FALSE

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

MC time: 0m 0.064sec

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

abstracting: (2<=CAPACITE) states: 2,874 (3)
abstracting: (2<=sum(CONTROLEUR_2, CONTROLEUR_1)) states: 0
abstracting: (ATTENTE_A<=sum(VIDANGE_2, VIDANGE_1)) states: 1,228 (3)
abstracting: (3<=sum(CONTROLEUR_2, CONTROLEUR_1)) states: 0
abstracting: (2<=SUR_PONT_B) states: 160
abstracting: (2<=ROUTE_A) states: 940
-> the formula is FALSE

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

MC time: 0m 0.176sec

checking: AG [[2<=CAPACITE & [[1<=sum(CONTROLEUR_2, CONTROLEUR_1) | 1<=ROUTE_A] | [1<=CAPACITE | ROUTE_A<=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<=CAPACITE & [[1<=CAPACITE | ROUTE_A<=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) | 1<=ROUTE_A]]]]]]

abstracting: (1<=ROUTE_A) states: 1,775 (3)
abstracting: (1<=sum(CONTROLEUR_2, CONTROLEUR_1)) states: 841
abstracting: (ROUTE_A<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)) states: 1,934 (3)
abstracting: (1<=CAPACITE) states: 2,874 (3)
abstracting: (2<=CAPACITE) 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: 0m 0.129sec

checking: AG [[[sum(CHOIX_2, CHOIX_1)<=sum(CHOIX_2, CHOIX_1) | [3<=ROUTE_A | ATTENTE_B<=sum(VIDANGE_2, VIDANGE_1)]] | 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) | [sum(CHOIX_2, CHOIX_1)<=sum(CHOIX_2, CHOIX_1) | [3<=ROUTE_A | ATTENTE_B<=sum(VIDANGE_2, VIDANGE_1)]]]]]]

abstracting: (ATTENTE_B<=sum(VIDANGE_2, VIDANGE_1)) states: 1,217 (3)
abstracting: (3<=ROUTE_A) states: 380
abstracting: (sum(CHOIX_2, CHOIX_1)<=sum(CHOIX_2, CHOIX_1)) states: 2,874 (3)
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 TRUE

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

MC time: 0m 0.187sec

checking: EF [[SUR_PONT_B<=CAPACITE & [[sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)<=SUR_PONT_A & CAPACITE<=SORTI_B] & [3<=SUR_PONT_B & SUR_PONT_A<=ROUTE_B]]]]
normalized: E [true U [SUR_PONT_B<=CAPACITE & [[3<=SUR_PONT_B & SUR_PONT_A<=ROUTE_B] & [sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)<=SUR_PONT_A & CAPACITE<=SORTI_B]]]]

abstracting: (CAPACITE<=SORTI_B) states: 68
abstracting: (sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)<=SUR_PONT_A) states: 628
abstracting: (SUR_PONT_A<=ROUTE_B) states: 2,608 (3)
abstracting: (3<=SUR_PONT_B) states: 0
abstracting: (SUR_PONT_B<=CAPACITE) states: 2,874 (3)
-> the formula is FALSE

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

MC time: 0m 0.066sec

checking: EF [[~ [~ [sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0)]] & 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 [sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)<=sum(NB_ATTENTE_B_4, NB_ATTENTE_B_3, NB_ATTENTE_B_2, NB_ATTENTE_B_1, NB_ATTENTE_B_0) & 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(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)<=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-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.106sec

checking: EF [[[2<=sum(CHOIX_2, CHOIX_1) & [2<=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)<=SUR_PONT_A]] & 2<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)]]
normalized: E [true U [2<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0) & [2<=sum(CHOIX_2, CHOIX_1) & [2<=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)<=SUR_PONT_A]]]]

abstracting: (sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)<=SUR_PONT_A) states: 628
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
abstracting: (2<=sum(CHOIX_2, CHOIX_1)) states: 0
abstracting: (2<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)) states: 0
-> the formula is FALSE

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

MC time: 0m 0.333sec

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

abstracting: (ATTENTE_A<=ATTENTE_A) states: 2,874 (3)
abstracting: (sum(NB_ATTENTE_A_4, NB_ATTENTE_A_3, NB_ATTENTE_A_2, NB_ATTENTE_A_1, NB_ATTENTE_A_0)<=sum(VIDANGE_2, VIDANGE_1)) states: 712
abstracting: (sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)<=ROUTE_B) states: 1,772 (3)
abstracting: (3<=sum(VIDANGE_2, VIDANGE_1)) states: 0
abstracting: (3<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)) states: 0
abstracting: (2<=SUR_PONT_B) states: 160
abstracting: (3<=sum(COMPTEUR_2, COMPTEUR_1, COMPTEUR_0)) states: 0
-> the formula is FALSE

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

MC time: 0m 0.588sec


Total processing time: 0m15.372sec


BK_STOP 1463598301536

--------------------
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.000sec

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

initing FirstDep: 0m 0.000sec

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="/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/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-2979"
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 r005kn-ebro-146347672900259"
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 ;