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-3254
Executing tool lola
Input is AutoFlight-PT-06a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r008-csrt-149436126000200
=====================================================================

--------------------
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 AutoFlight-PT-06a-UpperBounds-0
FORMULA_NAME AutoFlight-PT-06a-UpperBounds-1
FORMULA_NAME AutoFlight-PT-06a-UpperBounds-10
FORMULA_NAME AutoFlight-PT-06a-UpperBounds-11
FORMULA_NAME AutoFlight-PT-06a-UpperBounds-12
FORMULA_NAME AutoFlight-PT-06a-UpperBounds-13
FORMULA_NAME AutoFlight-PT-06a-UpperBounds-14
FORMULA_NAME AutoFlight-PT-06a-UpperBounds-15
FORMULA_NAME AutoFlight-PT-06a-UpperBounds-2
FORMULA_NAME AutoFlight-PT-06a-UpperBounds-3
FORMULA_NAME AutoFlight-PT-06a-UpperBounds-4
FORMULA_NAME AutoFlight-PT-06a-UpperBounds-5
FORMULA_NAME AutoFlight-PT-06a-UpperBounds-6
FORMULA_NAME AutoFlight-PT-06a-UpperBounds-7
FORMULA_NAME AutoFlight-PT-06a-UpperBounds-8
FORMULA_NAME AutoFlight-PT-06a-UpperBounds-9

=== Now, execution of the tool begins

BK_START 1494599669848


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
UpperBounds @ AutoFlight-PT-06a @ 3540 seconds
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 312/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 157 places, 155 transitions, 117 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 152 transition conflict sets
lola: TASK
lola: reading formula from AutoFlight-PT-06a-UpperBounds.task
lola: MAX(p108) : MAX(p122) : MAX(p93) : MAX(p71) : MAX(p4) : MAX(p109) : MAX(p53) : MAX(p81) : MAX(p74) : MAX(p22) : MAX(p98) : MAX(p61) : MAX(p41) : MAX(p48) : MAX(p74) : MAX(p58)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p108)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 11 unused bits
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: 951493 markings, 4957100 edges, 190299 markings/sec, 0 secs
lola: 1754978 markings, 9824457 edges, 160697 markings/sec, 5 secs
lola: 2483826 markings, 14863582 edges, 145770 markings/sec, 10 secs
lola: 3368899 markings, 20296879 edges, 177015 markings/sec, 15 secs
lola: 4065046 markings, 25102025 edges, 139229 markings/sec, 20 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 1 will run for 234 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p122)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 11 unused bits
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: 776115 markings, 4258834 edges, 155223 markings/sec, 0 secs
lola: 1399223 markings, 8689529 edges, 124622 markings/sec, 5 secs
lola: 1930407 markings, 13578670 edges, 106237 markings/sec, 10 secs
lola: 2424007 markings, 18023669 edges, 98720 markings/sec, 15 secs
lola: 2932937 markings, 22325962 edges, 101786 markings/sec, 20 secs
lola: 3418706 markings, 26750986 edges, 97154 markings/sec, 25 secs
lola: 3863081 markings, 31248753 edges, 88875 markings/sec, 30 secs
lola: 4282504 markings, 36124696 edges, 83885 markings/sec, 35 secs
lola: 4699942 markings, 40642643 edges, 83488 markings/sec, 40 secs
lola: 5152863 markings, 45222852 edges, 90584 markings/sec, 45 secs
lola: 5555295 markings, 49709098 edges, 80486 markings/sec, 50 secs
lola: 5710589 markings, 54191958 edges, 31059 markings/sec, 55 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: subprocess 2 will run for 246 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: MAX(p93)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 11 unused bits
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: 973792 markings, 4767788 edges, 194758 markings/sec, 0 secs
lola: 1793924 markings, 9480287 edges, 164026 markings/sec, 5 secs
lola: 2601705 markings, 14293714 edges, 161556 markings/sec, 10 secs
lola: 3302306 markings, 19020161 edges, 140120 markings/sec, 15 secs
lola: 3937068 markings, 23745687 edges, 126952 markings/sec, 20 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 3 will run for 263 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p71)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 11 unused bits
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: 859818 markings, 4888493 edges, 171964 markings/sec, 0 secs
lola: 1726724 markings, 9683392 edges, 173381 markings/sec, 5 secs
lola: 2536229 markings, 14695650 edges, 161901 markings/sec, 10 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: subprocess 4 will run for 284 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: MAX(p4)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 11 unused bits
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: 1011682 markings, 5258099 edges, 202336 markings/sec, 0 secs
lola: 1857432 markings, 10322645 edges, 169150 markings/sec, 5 secs
lola: 2634926 markings, 15420244 edges, 155499 markings/sec, 10 secs
lola: 3365452 markings, 20305508 edges, 146105 markings/sec, 15 secs
lola: 4075300 markings, 25278582 edges, 141970 markings/sec, 20 secs
lola: 4687364 markings, 29941697 edges, 122413 markings/sec, 25 secs
lola: 5375897 markings, 34704082 edges, 137707 markings/sec, 30 secs
lola: 5990579 markings, 39505564 edges, 122936 markings/sec, 35 secs
lola: 6633173 markings, 44337497 edges, 128519 markings/sec, 40 secs
lola: 7250700 markings, 49012013 edges, 123505 markings/sec, 45 secs
lola: 7832052 markings, 53445078 edges, 116270 markings/sec, 50 secs
lola: 8407245 markings, 58120005 edges, 115039 markings/sec, 55 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 5 will run for 304 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p109)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 11 unused bits
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: 987684 markings, 5205490 edges, 197537 markings/sec, 0 secs
lola: 1814829 markings, 10295282 edges, 165429 markings/sec, 5 secs
lola: 2536699 markings, 15288691 edges, 144374 markings/sec, 10 secs
lola: 3410087 markings, 20619439 edges, 174678 markings/sec, 15 secs
lola: 4116302 markings, 25548783 edges, 141243 markings/sec, 20 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 6 will run for 331 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p53)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 11 unused bits
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: 784905 markings, 4722826 edges, 156981 markings/sec, 0 secs
lola: 1393030 markings, 9721770 edges, 121625 markings/sec, 5 secs
lola: 1988901 markings, 14512378 edges, 119174 markings/sec, 10 secs
lola: 2552420 markings, 19459097 edges, 112704 markings/sec, 15 secs
lola: 3036348 markings, 24481213 edges, 96786 markings/sec, 20 secs
lola: 3534510 markings, 29142402 edges, 99632 markings/sec, 25 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 7 will run for 364 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p81)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 11 unused bits
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: 898707 markings, 5131617 edges, 179741 markings/sec, 0 secs
lola: 1824978 markings, 10261864 edges, 185254 markings/sec, 5 secs
lola: 2610122 markings, 15250156 edges, 157029 markings/sec, 10 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 8 will run for 408 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p74)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 11 unused bits
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: 898920 markings, 5127191 edges, 179784 markings/sec, 0 secs
lola: 1831024 markings, 10288581 edges, 186421 markings/sec, 5 secs
lola: 2635929 markings, 15358871 edges, 160981 markings/sec, 10 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 9 will run for 464 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p22)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 11 unused bits
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: 939209 markings, 5119368 edges, 187842 markings/sec, 0 secs
lola: 1647402 markings, 10214913 edges, 141639 markings/sec, 5 secs
lola: 2247077 markings, 15366011 edges, 119935 markings/sec, 10 secs
lola: 3072567 markings, 20627713 edges, 165098 markings/sec, 15 secs
lola: 3695193 markings, 25571621 edges, 124525 markings/sec, 20 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 10 will run for 537 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p98)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 11 unused bits
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: 1024166 markings, 5088729 edges, 204833 markings/sec, 0 secs
lola: 1850710 markings, 9919511 edges, 165309 markings/sec, 5 secs
lola: 2658386 markings, 14962863 edges, 161535 markings/sec, 10 secs
lola: 3412603 markings, 20025085 edges, 150843 markings/sec, 15 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 11 will run for 640 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p61)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 11 unused bits
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: 866961 markings, 4970273 edges, 173392 markings/sec, 0 secs
lola: 1785913 markings, 10066342 edges, 183790 markings/sec, 5 secs
lola: 2569297 markings, 14992858 edges, 156677 markings/sec, 10 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 12 will run for 796 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p41)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 11 unused bits
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: 779970 markings, 5265192 edges, 155994 markings/sec, 0 secs
lola: 1422926 markings, 10745721 edges, 128591 markings/sec, 5 secs
lola: 2021402 markings, 15947057 edges, 119695 markings/sec, 10 secs
lola: 2604000 markings, 21291212 edges, 116520 markings/sec, 15 secs
lola: 3151624 markings, 26665031 edges, 109525 markings/sec, 20 secs
lola: 3673073 markings, 32079625 edges, 104290 markings/sec, 25 secs
lola: 4167126 markings, 37562636 edges, 98811 markings/sec, 30 secs
lola: 4648149 markings, 43077012 edges, 96205 markings/sec, 35 secs
lola: 5213300 markings, 48362784 edges, 113030 markings/sec, 40 secs
lola: 5696032 markings, 53487389 edges, 96546 markings/sec, 45 secs
lola: 6113488 markings, 58642812 edges, 83491 markings/sec, 50 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 13 will run for 1042 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p48)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 11 unused bits
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: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 14 will run for 1563 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p74)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 11 unused bits
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: 924832 markings, 5291051 edges, 184966 markings/sec, 0 secs
lola: 1891836 markings, 10691301 edges, 193401 markings/sec, 5 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 15 will run for 3112 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p58)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 11 unused bits
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: 862617 markings, 5285210 edges, 172523 markings/sec, 0 secs
lola: 1553814 markings, 10706871 edges, 138239 markings/sec, 5 secs
lola: 2150626 markings, 15948318 edges, 119362 markings/sec, 10 secs
lola: 2680579 markings, 21452718 edges, 105991 markings/sec, 15 secs
lola: 3232391 markings, 26799086 edges, 110362 markings/sec, 20 secs
lola: 3754058 markings, 31813111 edges, 104333 markings/sec, 25 secs
lola: 3998627 markings, 36857465 edges, 48914 markings/sec, 30 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: RESULT
lola:
SUMMARY: 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
lola: ========================================
FORMULA AutoFlight-PT-06a-UpperBounds-0 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA AutoFlight-PT-06a-UpperBounds-1 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA AutoFlight-PT-06a-UpperBounds-2 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA AutoFlight-PT-06a-UpperBounds-3 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA AutoFlight-PT-06a-UpperBounds-4 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA AutoFlight-PT-06a-UpperBounds-5 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA AutoFlight-PT-06a-UpperBounds-6 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA AutoFlight-PT-06a-UpperBounds-7 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA AutoFlight-PT-06a-UpperBounds-8 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA AutoFlight-PT-06a-UpperBounds-9 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA AutoFlight-PT-06a-UpperBounds-10 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA AutoFlight-PT-06a-UpperBounds-11 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA AutoFlight-PT-06a-UpperBounds-12 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA AutoFlight-PT-06a-UpperBounds-13 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA AutoFlight-PT-06a-UpperBounds-14 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA AutoFlight-PT-06a-UpperBounds-15 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494600132266

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

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished 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="AutoFlight-PT-06a"
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/AutoFlight-PT-06a.tgz
mv AutoFlight-PT-06a execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is AutoFlight-PT-06a, 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 r008-csrt-149436126000200"
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 ;