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 S_AutoFlight-PT-06a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r088-csrt-149441074100200
=====================================================================

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


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_AutoFlight-PT-06a: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
S_AutoFlight-PT-06a: translating PT formula UpperBounds into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
UpperBounds @ S_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: 959331 markings, 4998199 edges, 191866 markings/sec, 0 secs
lola: 1763948 markings, 9888072 edges, 160923 markings/sec, 5 secs
lola: 2449278 markings, 14636981 edges, 137066 markings/sec, 10 secs
lola: 3265731 markings, 19619614 edges, 163291 markings/sec, 15 secs
lola: 3953048 markings, 24294265 edges, 137463 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: 826023 markings, 4584394 edges, 165205 markings/sec, 0 secs
lola: 1447242 markings, 9089968 edges, 124244 markings/sec, 5 secs
lola: 1964029 markings, 14012508 edges, 103357 markings/sec, 10 secs
lola: 2474924 markings, 18527896 edges, 102179 markings/sec, 15 secs
lola: 3023491 markings, 23159754 edges, 109713 markings/sec, 20 secs
lola: 3549087 markings, 27956140 edges, 105119 markings/sec, 25 secs
lola: 3991012 markings, 32742329 edges, 88385 markings/sec, 30 secs
lola: 4417739 markings, 37632553 edges, 85345 markings/sec, 35 secs
lola: 4870717 markings, 42546865 edges, 90596 markings/sec, 40 secs
lola: 5350463 markings, 47181607 edges, 95949 markings/sec, 45 secs
lola: 5665476 markings, 51581186 edges, 63003 markings/sec, 50 secs
lola: 5714808 markings, 55431181 edges, 9866 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: 975961 markings, 4781620 edges, 195192 markings/sec, 0 secs
lola: 1788880 markings, 9453145 edges, 162584 markings/sec, 5 secs
lola: 2592524 markings, 14245162 edges, 160729 markings/sec, 10 secs
lola: 3284325 markings, 18917296 edges, 138360 markings/sec, 15 secs
lola: 3905295 markings, 23504975 edges, 124194 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: 859498 markings, 4886626 edges, 171900 markings/sec, 0 secs
lola: 1740797 markings, 9761929 edges, 176260 markings/sec, 5 secs
lola: 2534617 markings, 14608923 edges, 158764 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 4 will run for 284 seconds at most (--localtimelimit=-1)
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: 954815 markings, 4900089 edges, 190963 markings/sec, 0 secs
lola: 1786030 markings, 9877046 edges, 166243 markings/sec, 5 secs
lola: 2566512 markings, 14988821 edges, 156096 markings/sec, 10 secs
lola: 3317470 markings, 19982586 edges, 150192 markings/sec, 15 secs
lola: 4013612 markings, 24880035 edges, 139228 markings/sec, 20 secs
lola: 4650322 markings, 29650919 edges, 127342 markings/sec, 25 secs
lola: 5352191 markings, 34499188 edges, 140374 markings/sec, 30 secs
lola: 5979278 markings, 39409796 edges, 125417 markings/sec, 35 secs
lola: 6611542 markings, 44174410 edges, 126453 markings/sec, 40 secs
lola: 7220785 markings, 48754681 edges, 121849 markings/sec, 45 secs
lola: 7785195 markings, 53061836 edges, 112882 markings/sec, 50 secs
lola: 8358769 markings, 57772425 edges, 114715 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: 980139 markings, 5167407 edges, 196028 markings/sec, 0 secs
lola: 1799910 markings, 10199214 edges, 163954 markings/sec, 5 secs
lola: 2505494 markings, 15090359 edges, 141117 markings/sec, 10 secs
lola: 3363672 markings, 20359904 edges, 171636 markings/sec, 15 secs
lola: 4072366 markings, 25220080 edges, 141739 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: 811944 markings, 4963203 edges, 162389 markings/sec, 0 secs
lola: 1437202 markings, 10124953 edges, 125052 markings/sec, 5 secs
lola: 2075630 markings, 15200483 edges, 127686 markings/sec, 10 secs
lola: 2659298 markings, 20505352 edges, 116734 markings/sec, 15 secs
lola: 3145119 markings, 25540747 edges, 97164 markings/sec, 20 secs
lola: 3603899 markings, 30167681 edges, 91756 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: 902308 markings, 5152402 edges, 180462 markings/sec, 0 secs
lola: 1885000 markings, 10653535 edges, 196538 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 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: 941633 markings, 5384318 edges, 188327 markings/sec, 0 secs
lola: 1909074 markings, 10805652 edges, 193488 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 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: 956240 markings, 5231321 edges, 191248 markings/sec, 0 secs
lola: 1660749 markings, 10309109 edges, 140902 markings/sec, 5 secs
lola: 2259192 markings, 15458627 edges, 119689 markings/sec, 10 secs
lola: 3089480 markings, 20740453 edges, 166058 markings/sec, 15 secs
lola: 3706401 markings, 25793157 edges, 123384 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 538 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: 1033753 markings, 5142929 edges, 206751 markings/sec, 0 secs
lola: 1870469 markings, 10053353 edges, 167343 markings/sec, 5 secs
lola: 2690694 markings, 15151047 edges, 164045 markings/sec, 10 secs
lola: 3466400 markings, 20348815 edges, 155141 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: 888647 markings, 5099654 edges, 177729 markings/sec, 0 secs
lola: 1811554 markings, 10226597 edges, 184581 markings/sec, 5 secs
lola: 2602113 markings, 15187834 edges, 158112 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 797 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: 775939 markings, 5230491 edges, 155188 markings/sec, 0 secs
lola: 1394897 markings, 10509837 edges, 123792 markings/sec, 5 secs
lola: 1993941 markings, 15699000 edges, 119809 markings/sec, 10 secs
lola: 2557857 markings, 20856014 edges, 112783 markings/sec, 15 secs
lola: 3091329 markings, 26073609 edges, 106694 markings/sec, 20 secs
lola: 3595656 markings, 31262271 edges, 100865 markings/sec, 25 secs
lola: 4112910 markings, 36609385 edges, 103451 markings/sec, 30 secs
lola: 4550399 markings, 41959746 edges, 87498 markings/sec, 35 secs
lola: 5082922 markings, 47082959 edges, 106505 markings/sec, 40 secs
lola: 5566989 markings, 52052460 edges, 96813 markings/sec, 45 secs
lola: 6001949 markings, 57105525 edges, 86992 markings/sec, 50 secs
lola: 6281573 markings, 62180130 edges, 55925 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 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 1564 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: 926927 markings, 5303275 edges, 185385 markings/sec, 0 secs
lola: 1865484 markings, 10532389 edges, 187711 markings/sec, 5 secs
lola: 2632642 markings, 15343546 edges, 153432 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 15 will run for 3113 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: 842395 markings, 5128980 edges, 168479 markings/sec, 0 secs
lola: 1505425 markings, 10287704 edges, 132606 markings/sec, 5 secs
lola: 2104060 markings, 15542392 edges, 119727 markings/sec, 10 secs
lola: 2635600 markings, 20881763 edges, 106308 markings/sec, 15 secs
lola: 3160472 markings, 26243059 edges, 104974 markings/sec, 20 secs
lola: 3698315 markings, 31212765 edges, 107569 markings/sec, 25 secs
lola: 3998523 markings, 36077395 edges, 60042 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 1496334825536

--------------------
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="S_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/S_AutoFlight-PT-06a.tgz
mv S_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 S_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 r088-csrt-149441074100200"
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 ;