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-3253
Executing tool lola
Input is S_TCPcondis-PT-05, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r158-ebro-149443464100200
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496564931684


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


checking for too many tokens
===========================================================================================
S_TCPcondis-PT-05: translating PT formula UpperBounds into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
UpperBounds @ S_TCPcondis-PT-05 @ 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: 62/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 30 places, 32 transitions, 21 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 48 transition conflict sets
lola: TASK
lola: reading formula from TCPcondis-PT-05-UpperBounds.task
lola: MAX(xCLOSED) : MAX(FINACK) : MAX(FINWAIT1) : MAX(TIMEWAIT) : MAX(xSYNSENT) : MAX(FINWAIT1) : MAX(xLISTEN) : MAX(LASTACK) : MAX(CLOSED) : MAX(xLISTEN) : MAX(xCLOSED) : MAX(xCLOSED) : MAX(xFINACK) : MAX(xLASTACK) : MAX(xESTAB) : MAX(xLISTEN)
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(xCLOSED)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 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: 706996 markings, 2255393 edges, 141399 markings/sec, 0 secs
lola: 1289614 markings, 4508284 edges, 116524 markings/sec, 5 secs
lola: 1833884 markings, 6771983 edges, 108854 markings/sec, 10 secs
lola: 2378908 markings, 9162712 edges, 109005 markings/sec, 15 secs
lola: 2599149 markings, 11327781 edges, 44048 markings/sec, 20 secs
lola: 2620611 markings, 13362790 edges, 4292 markings/sec, 25 secs
lola: SUBRESULT
lola: result: 5
lola: produced by: state space
lola: The maximum value of the given expression is 5
lola: ========================================
lola: subprocess 1 will run for 233 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(FINACK)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 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: 830891 markings, 2345079 edges, 166178 markings/sec, 0 secs
lola: 1426997 markings, 4519639 edges, 119221 markings/sec, 5 secs
lola: 1986656 markings, 6719064 edges, 111932 markings/sec, 10 secs
lola: 2512288 markings, 8995094 edges, 105126 markings/sec, 15 secs
lola: 2592090 markings, 10907695 edges, 15960 markings/sec, 20 secs
lola: SUBRESULT
lola: result: 5
lola: produced by: state space
lola: The maximum value of the given expression is 5
lola: ========================================
lola: subprocess 2 will run for 248 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(FINWAIT1)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 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: 904129 markings, 2346304 edges, 180826 markings/sec, 0 secs
lola: 1585084 markings, 4572032 edges, 136191 markings/sec, 5 secs
lola: 2208721 markings, 6940001 edges, 124727 markings/sec, 10 secs
lola: 2524101 markings, 9139562 edges, 63076 markings/sec, 15 secs
lola: 2549178 markings, 11099658 edges, 5015 markings/sec, 20 secs
lola: SUBRESULT
lola: result: 5
lola: produced by: state space
lola: The maximum value of the given expression is 5
lola: ========================================
lola: subprocess 3 will run for 265 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(TIMEWAIT)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 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: 647864 markings, 2079484 edges, 129573 markings/sec, 0 secs
lola: 1116283 markings, 3929832 edges, 93684 markings/sec, 5 secs
lola: 1536651 markings, 5719993 edges, 84074 markings/sec, 10 secs
lola: 1941951 markings, 7517549 edges, 81060 markings/sec, 15 secs
lola: 2402315 markings, 9508290 edges, 92073 markings/sec, 20 secs
lola: 2609035 markings, 11223935 edges, 41344 markings/sec, 25 secs
lola: 2630670 markings, 12668945 edges, 4327 markings/sec, 30 secs
lola: SUBRESULT
lola: result: 5
lola: produced by: state space
lola: The maximum value of the given expression is 5
lola: subprocess 4 will run for 284 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(xSYNSENT)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: lola: ========================================
using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 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: 737807 markings, 2364061 edges, 147561 markings/sec, 0 secs
lola: 1330985 markings, 4455112 edges, 118636 markings/sec, 5 secs
lola: 1878479 markings, 6512424 edges, 109499 markings/sec, 10 secs
lola: 2393896 markings, 8750314 edges, 103083 markings/sec, 15 secs
lola: 2456285 markings, 10292560 edges, 12478 markings/sec, 20 secs
lola: 2460063 markings, 11881329 edges, 756 markings/sec, 25 secs
lola: SUBRESULT
lola: result: 5
lola: produced by: state space
lola: The maximum value of the given expression is 5
lola: ========================================
lola: subprocess 5 will run for 307 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(FINWAIT1)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 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: 899535 markings, 2332658 edges, 179907 markings/sec, 0 secs
lola: 1576604 markings, 4542268 edges, 135414 markings/sec, 5 secs
lola: 2195633 markings, 6890653 edges, 123806 markings/sec, 10 secs
lola: 2521814 markings, 9070416 edges, 65236 markings/sec, 15 secs
lola: 2548225 markings, 10973037 edges, 5282 markings/sec, 20 secs
lola: SUBRESULT
lola: result: 5
lola: produced by: state space
lola: The maximum value of the given expression is 5
lola: ========================================
lola: subprocess 6 will run for 335 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(xLISTEN)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 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: 832102 markings, 2344795 edges, 166420 markings/sec, 0 secs
lola: 1443015 markings, 4421166 edges, 122183 markings/sec, 5 secs
lola: 2012927 markings, 6486744 edges, 113982 markings/sec, 10 secs
lola: 2401188 markings, 8422767 edges, 77652 markings/sec, 15 secs
lola: 2422307 markings, 9933800 edges, 4224 markings/sec, 20 secs
lola: SUBRESULT
lola: result: 5
lola: produced by: state space
lola: The maximum value of the given expression is 5
lola: ========================================
lola: subprocess 7 will run for 370 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(LASTACK)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 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: 910943 markings, 2066930 edges, 182189 markings/sec, 0 secs
lola: 1546218 markings, 4014510 edges, 127055 markings/sec, 5 secs
lola: 2140206 markings, 6162438 edges, 118798 markings/sec, 10 secs
lola: 2216141 markings, 7653559 edges, 15187 markings/sec, 15 secs
lola: SUBRESULT
lola: result: 5
lola: produced by: state space
lola: The maximum value of the given expression is 5
lola: ========================================
lola: subprocess 8 will run for 413 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(CLOSED)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 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: 746134 markings, 2343023 edges, 149227 markings/sec, 0 secs
lola: 1304694 markings, 4435170 edges, 111712 markings/sec, 5 secs
lola: 1801928 markings, 6596810 edges, 99447 markings/sec, 10 secs
lola: 2288690 markings, 8940427 edges, 97352 markings/sec, 15 secs
lola: 2683479 markings, 11288018 edges, 78958 markings/sec, 20 secs
lola: 2702372 markings, 13133682 edges, 3779 markings/sec, 25 secs
lola: SUBRESULT
lola: result: 5
lola: produced by: state space
lola: The maximum value of the given expression is 5
lola: ========================================
lola: subprocess 9 will run for 467 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(xLISTEN)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 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: 814383 markings, 2288148 edges, 162877 markings/sec, 0 secs
lola: 1413067 markings, 4314416 edges, 119737 markings/sec, 5 secs
lola: 1965717 markings, 6314196 edges, 110530 markings/sec, 10 secs
lola: 2397410 markings, 8326172 edges, 86339 markings/sec, 15 secs
lola: 2422058 markings, 9825455 edges, 4930 markings/sec, 20 secs
lola: SUBRESULT
lola: result: 5
lola: produced by: state space
lola: The maximum value of the given expression is 5
lola: ========================================
lola: subprocess 10 will run for 541 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(xCLOSED)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 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: 691218 markings, 2198548 edges, 138244 markings/sec, 0 secs
lola: 1255260 markings, 4370186 edges, 112808 markings/sec, 5 secs
lola: 1775896 markings, 6525529 edges, 104127 markings/sec, 10 secs
lola: 2306153 markings, 8829550 edges, 106051 markings/sec, 15 secs
lola: 2583617 markings, 10835946 edges, 55493 markings/sec, 20 secs
lola: 2613904 markings, 12349583 edges, 6057 markings/sec, 25 secs
lola: SUBRESULT
lola: result: 5
lola: produced by: state space
lola: The maximum value of the given expression is 5
lola: ========================================
lola: subprocess 11 will run for 642 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(xCLOSED)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 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: 730425 markings, 2341317 edges, 146085 markings/sec, 0 secs
lola: 1239713 markings, 4307158 edges, 101858 markings/sec, 5 secs
lola: 1703093 markings, 6214755 edges, 92676 markings/sec, 10 secs
lola: 2155601 markings, 8164266 edges, 90502 markings/sec, 15 secs
lola: 2556118 markings, 10249664 edges, 80103 markings/sec, 20 secs
lola: 2607486 markings, 11766159 edges, 10274 markings/sec, 25 secs
lola: 2620514 markings, 13347621 edges, 2606 markings/sec, 30 secs
lola: SUBRESULT
lola: result: 5
lola: produced by: state space
lola: The maximum value of the given expression is 5
lola: ========================================
lola: subprocess 12 will run for 794 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(xFINACK)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 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: 774978 markings, 2111268 edges, 154996 markings/sec, 0 secs
lola: 1304701 markings, 3969747 edges, 105945 markings/sec, 5 secs
lola: 1797334 markings, 5798246 edges, 98527 markings/sec, 10 secs
lola: 2303129 markings, 7851634 edges, 101159 markings/sec, 15 secs
lola: 2500832 markings, 9579656 edges, 39541 markings/sec, 20 secs
lola: 2531285 markings, 11078129 edges, 6091 markings/sec, 25 secs
lola: SUBRESULT
lola: result: 5
lola: produced by: state space
lola: The maximum value of the given expression is 5
lola: ========================================
lola: subprocess 13 will run for 1048 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(xLASTACK)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 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: 988313 markings, 2345407 edges, 197663 markings/sec, 0 secs
lola: 1723687 markings, 4626458 edges, 147075 markings/sec, 5 secs
lola: 2125368 markings, 6825726 edges, 80336 markings/sec, 10 secs
lola: SUBRESULT
lola: result: 5
lola: produced by: state space
lola: The maximum value of the given expression is 5
lola: ========================================
lola: subprocess 14 will run for 1563 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(xESTAB)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 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: 679484 markings, 2244780 edges, 135897 markings/sec, 0 secs
lola: 1233076 markings, 4241318 edges, 110718 markings/sec, 5 secs
lola: 1761916 markings, 6210971 edges, 105768 markings/sec, 10 secs
lola: 2288119 markings, 8281442 edges, 105241 markings/sec, 15 secs
lola: 2511720 markings, 10089101 edges, 44720 markings/sec, 20 secs
lola: 2539352 markings, 11573278 edges, 5526 markings/sec, 25 secs
lola: SUBRESULT
lola: result: 5
lola: produced by: state space
lola: The maximum value of the given expression is 5
lola: ========================================
lola: subprocess 15 will run for 3094 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(xLISTEN)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 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: 910015 markings, 2598954 edges, 182003 markings/sec, 0 secs
lola: 1613078 markings, 5028216 edges, 140613 markings/sec, 5 secs
lola: 2288587 markings, 7520425 edges, 135102 markings/sec, 10 secs
lola: 2421534 markings, 9621518 edges, 26589 markings/sec, 15 secs
lola: SUBRESULT
lola: result: 5
lola: produced by: state space
lola: The maximum value of the given expression is 5
lola: RESULT
lola:
SUMMARY: 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5
lola: ========================================
FORMULA TCPcondis-PT-05-UpperBounds-0 5 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA TCPcondis-PT-05-UpperBounds-1 5 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA TCPcondis-PT-05-UpperBounds-2 5 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA TCPcondis-PT-05-UpperBounds-3 5 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA TCPcondis-PT-05-UpperBounds-4 5 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA TCPcondis-PT-05-UpperBounds-5 5 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA TCPcondis-PT-05-UpperBounds-6 5 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA TCPcondis-PT-05-UpperBounds-7 5 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA TCPcondis-PT-05-UpperBounds-8 5 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA TCPcondis-PT-05-UpperBounds-9 5 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA TCPcondis-PT-05-UpperBounds-10 5 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA TCPcondis-PT-05-UpperBounds-11 5 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA TCPcondis-PT-05-UpperBounds-12 5 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA TCPcondis-PT-05-UpperBounds-13 5 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA TCPcondis-PT-05-UpperBounds-14 5 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA TCPcondis-PT-05-UpperBounds-15 5 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496565399583

--------------------
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_TCPcondis-PT-05"
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_TCPcondis-PT-05.tgz
mv S_TCPcondis-PT-05 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3253"
echo " Executing tool lola"
echo " Input is S_TCPcondis-PT-05, 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 r158-ebro-149443464100200"
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 ;