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)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
/home/mcc/execution
total 184K
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.3K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 119 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 357 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:49 equiv_col
-rw-r--r-- 1 mcc users 8 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 9.1K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is ClientsAndServers-PT-N0010P0, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r040-smll-152646357200086
=====================================================================

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ClientsAndServers-PT-N0010P0-UpperBounds-00
FORMULA_NAME ClientsAndServers-PT-N0010P0-UpperBounds-01
FORMULA_NAME ClientsAndServers-PT-N0010P0-UpperBounds-02
FORMULA_NAME ClientsAndServers-PT-N0010P0-UpperBounds-03
FORMULA_NAME ClientsAndServers-PT-N0010P0-UpperBounds-04
FORMULA_NAME ClientsAndServers-PT-N0010P0-UpperBounds-05
FORMULA_NAME ClientsAndServers-PT-N0010P0-UpperBounds-06
FORMULA_NAME ClientsAndServers-PT-N0010P0-UpperBounds-07
FORMULA_NAME ClientsAndServers-PT-N0010P0-UpperBounds-08
FORMULA_NAME ClientsAndServers-PT-N0010P0-UpperBounds-09
FORMULA_NAME ClientsAndServers-PT-N0010P0-UpperBounds-10
FORMULA_NAME ClientsAndServers-PT-N0010P0-UpperBounds-11
FORMULA_NAME ClientsAndServers-PT-N0010P0-UpperBounds-12
FORMULA_NAME ClientsAndServers-PT-N0010P0-UpperBounds-13
FORMULA_NAME ClientsAndServers-PT-N0010P0-UpperBounds-14
FORMULA_NAME ClientsAndServers-PT-N0010P0-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1526510095442

info: Time: 3600 - MCC
===========================================================================================
prep: translating ClientsAndServers-PT-N0010P0 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating ClientsAndServers-PT-N0010P0 formula UpperBounds into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking UpperBounds @ ClientsAndServers-PT-N0010P0 @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 43/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 800
lola: finding significant places
lola: 25 places, 18 transitions, 17 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 25 transition conflict sets
lola: TASK
lola: reading formula from ClientsAndServers-PT-N0010P0-UpperBounds.task
lola: MAX(SR) : MAX(CwG) : MAX(CA) : MAX(CwA) : MAX(Uf) : MAX(CA) : MAX(SpA) : MAX(MpG) : MAX(Ci) : MAX(SpG) : MAX(SwG) : MAX(Ci) : MAX(Ci) : MAX(StR) : MAX(SR) : MAX(CwA)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(SR)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(SR)
lola: processed formula length: 7
lola: 0 rewrites
lola: closed formula file ClientsAndServers-PT-N0010P0-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 20
lola: SUBRESULT
lola: result: 20
lola: produced by: state space
lola: The maximum value of the given expression is 20
lola: 61 markings, 60 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N0010P0-UpperBounds-0 20 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(CwG)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(CwG)
lola: processed formula length: 8
lola: 0 rewrites
lola: closed formula file ClientsAndServers-PT-N0010P0-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 80
lola: SUBRESULT
lola: result: 80
lola: produced by: state space
lola: The maximum value of the given expression is 80
lola: 81 markings, 80 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N0010P0-UpperBounds-1 80 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(CA)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(CA)
lola: processed formula length: 7
lola: 0 rewrites
lola: closed formula file ClientsAndServers-PT-N0010P0-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 80
lola: SUBRESULT
lola: result: 80
lola: produced by: state space
lola: The maximum value of the given expression is 80
lola: 1361 markings, 1360 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N0010P0-UpperBounds-2 80 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(CwA)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(CwA)
lola: processed formula length: 8
lola: 0 rewrites
lola: closed formula file ClientsAndServers-PT-N0010P0-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 80
lola: SUBRESULT
lola: result: 80
lola: produced by: state space
lola: The maximum value of the given expression is 80
lola: 1024 markings, 1023 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N0010P0-UpperBounds-3 80 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(Uf)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Uf)
lola: processed formula length: 7
lola: 0 rewrites
lola: closed formula file ClientsAndServers-PT-N0010P0-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 40
lola: SUBRESULT
lola: result: 40
lola: produced by: state space
lola: The maximum value of the given expression is 40
lola: 0 markings, 0 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N0010P0-UpperBounds-4 40 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(CA)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(CA)
lola: processed formula length: 7
lola: 0 rewrites
lola: closed formula file ClientsAndServers-PT-N0010P0-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 80
lola: SUBRESULT
lola: result: 80
lola: produced by: state space
lola: The maximum value of the given expression is 80
lola: 1361 markings, 1360 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N0010P0-UpperBounds-5 80 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(SpA)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(SpA)
lola: processed formula length: 8
lola: 0 rewrites
lola: closed formula file ClientsAndServers-PT-N0010P0-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 20
lola: SUBRESULT
lola: result: 20
lola: produced by: state space
lola: The maximum value of the given expression is 20
lola: 1356 markings, 1363 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N0010P0-UpperBounds-6 20 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(MpG)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(MpG)
lola: processed formula length: 8
lola: 0 rewrites
lola: closed formula file ClientsAndServers-PT-N0010P0-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 20
lola: SUBRESULT
lola: result: 20
lola: produced by: state space
lola: The maximum value of the given expression is 20
lola: 101 markings, 100 edges
lola:
FORMULA ClientsAndServers-PT-N0010P0-UpperBounds-7 20 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(Ci)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Ci)
lola: processed formula length: 7
lola: 0 rewrites
lola: closed formula file ClientsAndServers-PT-N0010P0-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 80
lola: SUBRESULT
lola: result: 80
lola: produced by: state space
lola: The maximum value of the given expression is 80
lola: 0 markings, 0 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N0010P0-UpperBounds-8 80 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(SpG)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(SpG)
lola: processed formula length: 8
lola: 0 rewrites
lola: closed formula file ClientsAndServers-PT-N0010P0-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 20
lola: SUBRESULT
lola: result: 20
lola: produced by: state space
lola: The maximum value of the given expression is 20
lola: 141 markings, 140 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N0010P0-UpperBounds-9 20 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(SwG)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(SwG)
lola: processed formula length: 8
lola: 0 rewrites
lola: closed formula file ClientsAndServers-PT-N0010P0-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 20
lola: SUBRESULT
lola: result: 20
lola: produced by: state space
lola: The maximum value of the given expression is 20
lola: 61 markings, 60 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N0010P0-UpperBounds-10 20 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(Ci)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Ci)
lola: processed formula length: 7
lola: 0 rewrites
lola: closed formula file ClientsAndServers-PT-N0010P0-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 80
lola: SUBRESULT
lola: result: 80
lola: produced by: state space
lola: The maximum value of the given expression is 80
lola: 0 markings, 0 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N0010P0-UpperBounds-11 80 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(Ci)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Ci)
lola: processed formula length: 7
lola: 0 rewrites
lola: closed formula file ClientsAndServers-PT-N0010P0-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 80
lola: SUBRESULT
lola: result: 80
lola: produced by: state space
lola: The maximum value of the given expression is 80
lola: 0 markings, 0 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N0010P0-UpperBounds-12 80 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1190 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(StR)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(StR)
lola: processed formula length: 8
lola: 0 rewrites
lola: closed formula file ClientsAndServers-PT-N0010P0-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 20
lola: SUBRESULT
lola: result: 20
lola: produced by: state space
lola: The maximum value of the given expression is 20
lola: 41 markings, 40 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N0010P0-UpperBounds-13 20 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1785 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(SR)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(SR)
lola: processed formula length: 7
lola: 0 rewrites
lola: closed formula file ClientsAndServers-PT-N0010P0-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 20
lola: SUBRESULT
lola: result: 20
lola: produced by: state space
lola: The maximum value of the given expression is 20
lola: 61 markings, 60 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N0010P0-UpperBounds-14 20 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(CwA)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(CwA)
lola: processed formula length: 8
lola: 0 rewrites
lola: closed formula file ClientsAndServers-PT-N0010P0-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 80
lola: SUBRESULT
lola: result: 80
lola: produced by: state space
lola: The maximum value of the given expression is 80
lola: 1024 markings, 1023 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N0010P0-UpperBounds-15 80 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: 20 80 80 80 40 80 20 20 80 20 20 80 80 20 20 80
lola:
preliminary result: 20 80 80 80 40 80 20 20 80 20 20 80 80 20 20 80
lola: memory consumption: 18088 KB
lola: time consumption: 0 seconds

BK_STOP 1526510095891

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

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="ClientsAndServers-PT-N0010P0"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/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/ClientsAndServers-PT-N0010P0.tgz
mv ClientsAndServers-PT-N0010P0 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool lola"
echo " Input is ClientsAndServers-PT-N0010P0, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r040-smll-152646357200086"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '' UpperBounds.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 ;