About the Execution of LoLA for ClientsAndServers-PT-N0005P1
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 ClientsAndServers-PT-N0005P1, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-ebro-149580919900182
=====================================================================
--------------------
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-N0005P1-UpperBounds-0
FORMULA_NAME ClientsAndServers-PT-N0005P1-UpperBounds-1
FORMULA_NAME ClientsAndServers-PT-N0005P1-UpperBounds-10
FORMULA_NAME ClientsAndServers-PT-N0005P1-UpperBounds-11
FORMULA_NAME ClientsAndServers-PT-N0005P1-UpperBounds-12
FORMULA_NAME ClientsAndServers-PT-N0005P1-UpperBounds-13
FORMULA_NAME ClientsAndServers-PT-N0005P1-UpperBounds-14
FORMULA_NAME ClientsAndServers-PT-N0005P1-UpperBounds-15
FORMULA_NAME ClientsAndServers-PT-N0005P1-UpperBounds-2
FORMULA_NAME ClientsAndServers-PT-N0005P1-UpperBounds-3
FORMULA_NAME ClientsAndServers-PT-N0005P1-UpperBounds-4
FORMULA_NAME ClientsAndServers-PT-N0005P1-UpperBounds-5
FORMULA_NAME ClientsAndServers-PT-N0005P1-UpperBounds-6
FORMULA_NAME ClientsAndServers-PT-N0005P1-UpperBounds-7
FORMULA_NAME ClientsAndServers-PT-N0005P1-UpperBounds-8
FORMULA_NAME ClientsAndServers-PT-N0005P1-UpperBounds-9
=== Now, execution of the tool begins
BK_START 1496601053712
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
ClientsAndServers-PT-N0005P1: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
ClientsAndServers-PT-N0005P1: translating PT formula UpperBounds into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
UpperBounds @ ClientsAndServers-PT-N0005P1 @ 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: 43/65536 symbol table entries, 0 collisions
lola: preprocessing...
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-N0005P1-UpperBounds.task
lola: MAX(SF) : MAX(StF) : MAX(Mi) : MAX(SF) : MAX(Cb) : MAX(MwU) : MAX(SwG) : MAX(CA) : MAX(MpG) : MAX(CwG) : MAX(Si) : MAX(MpA) : MAX(CG) : MAX(SwA) : MAX(SG) : MAX(Cb)
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(SF)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 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: 1890727 markings, 3203842 edges, 378145 markings/sec, 0 secs
lola: 3677095 markings, 6243916 edges, 357274 markings/sec, 5 secs
lola: 5548095 markings, 9424962 edges, 374200 markings/sec, 10 secs
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: subprocess 1 will run for 234 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(StF)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 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: ========================================
lola: 1721041 markings, 3090618 edges, 344208 markings/sec, 0 secs
lola: 3306035 markings, 5948744 edges, 316999 markings/sec, 5 secs
lola: 4861500 markings, 8754874 edges, 311093 markings/sec, 10 secs
lola: 6465250 markings, 11640186 edges, 320750 markings/sec, 15 secs
lola: 8101262 markings, 14569872 edges, 327202 markings/sec, 20 secs
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: ========================================
lola: subprocess 2 will run for 249 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(Mi)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 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: 1322808 markings, 2879262 edges, 264562 markings/sec, 0 secs
lola: 2612806 markings, 5763759 edges, 258000 markings/sec, 5 secs
lola: 3833423 markings, 8525713 edges, 244123 markings/sec, 10 secs
lola: 4617754 markings, 11100052 edges, 156866 markings/sec, 15 secs
lola: 5871601 markings, 14194135 edges, 250769 markings/sec, 20 secs
lola: 7027736 markings, 17016721 edges, 231227 markings/sec, 25 secs
lola: 8135124 markings, 19706915 edges, 221478 markings/sec, 30 secs
lola: 9350540 markings, 22676360 edges, 243083 markings/sec, 35 secs
lola: 10406498 markings, 25226170 edges, 211192 markings/sec, 40 secs
lola: 11620168 markings, 28178404 edges, 242734 markings/sec, 45 secs
lola: 12727456 markings, 30854614 edges, 221458 markings/sec, 50 secs
lola: 13858640 markings, 33589822 edges, 226237 markings/sec, 55 secs
lola: 15079628 markings, 36548939 edges, 244198 markings/sec, 60 secs
lola: 16207355 markings, 39262447 edges, 225545 markings/sec, 65 secs
lola: 17513158 markings, 42431348 edges, 261161 markings/sec, 70 secs
lola: 18596845 markings, 45042997 edges, 216737 markings/sec, 75 secs
lola: 19782912 markings, 47903365 edges, 237213 markings/sec, 80 secs
lola: 21051452 markings, 50969729 edges, 253708 markings/sec, 85 secs
lola: 22143152 markings, 53583940 edges, 218340 markings/sec, 90 secs
lola: 23402982 markings, 56646307 edges, 251966 markings/sec, 95 secs
lola: 24581234 markings, 59474841 edges, 235650 markings/sec, 100 secs
lola: 25716167 markings, 62198212 edges, 226987 markings/sec, 105 secs
lola: 26985724 markings, 65272186 edges, 253911 markings/sec, 110 secs
lola: 28056036 markings, 67842996 edges, 214062 markings/sec, 115 secs
lola: 29207031 markings, 70612347 edges, 230199 markings/sec, 120 secs
lola: 30391185 markings, 73482734 edges, 236831 markings/sec, 125 secs
lola: 31483613 markings, 76108687 edges, 218486 markings/sec, 130 secs
lola: 32720269 markings, 79113529 edges, 247331 markings/sec, 135 secs
lola: 33771114 markings, 81637826 edges, 210169 markings/sec, 140 secs
lola: 34984780 markings, 84580229 edges, 242733 markings/sec, 145 secs
lola: 36065163 markings, 87182754 edges, 216077 markings/sec, 150 secs
lola: 37240989 markings, 90023481 edges, 235165 markings/sec, 155 secs
lola: 38352331 markings, 92708210 edges, 222268 markings/sec, 160 secs
lola: 39515322 markings, 95515143 edges, 232598 markings/sec, 165 secs
lola: 40637850 markings, 98227830 edges, 224506 markings/sec, 170 secs
lola: 41826794 markings, 101103824 edges, 237789 markings/sec, 175 secs
lola: 42919972 markings, 103737477 edges, 218636 markings/sec, 180 secs
lola: 44132375 markings, 106674477 edges, 242481 markings/sec, 185 secs
lola: 45218356 markings, 109284700 edges, 217196 markings/sec, 190 secs
lola: 46394071 markings, 112129322 edges, 235143 markings/sec, 195 secs
lola: 47567569 markings, 114963804 edges, 234700 markings/sec, 200 secs
lola: 48675483 markings, 117629122 edges, 221583 markings/sec, 205 secs
lola: 49841334 markings, 120447006 edges, 233170 markings/sec, 210 secs
lola: 51017217 markings, 123287862 edges, 235177 markings/sec, 215 secs
lola: 52170155 markings, 126070386 edges, 230588 markings/sec, 220 secs
lola: 53283859 markings, 128748083 edges, 222741 markings/sec, 225 secs
lola: 54419365 markings, 131484789 edges, 227101 markings/sec, 230 secs
lola: 55567086 markings, 134254055 edges, 229544 markings/sec, 235 secs
lola: 56664809 markings, 136892537 edges, 219545 markings/sec, 240 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 249 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(SF)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 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: 1837314 markings, 3113792 edges, 367463 markings/sec, 0 secs
lola: 3586018 markings, 6089562 edges, 349741 markings/sec, 5 secs
lola: 5384752 markings, 9146077 edges, 359747 markings/sec, 10 secs
lola: 7141231 markings, 12115449 edges, 351296 markings/sec, 15 secs
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: ========================================
lola: subprocess 4 will run for 268 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(Cb)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 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: 2438032 markings, 2926676 edges, 487606 markings/sec, 0 secs
lola: 4832956 markings, 5802941 edges, 478985 markings/sec, 5 secs
lola: SUBRESULT
lola: result: 28
lola: produced by: state space
lola: The maximum value of the given expression is 28
lola: subprocess 5 will run for 291 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(MwU)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 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: ========================================
lola: 1825857 markings, 3261237 edges, 365171 markings/sec, 0 secs
lola: 3618376 markings, 6451141 edges, 358504 markings/sec, 5 secs
lola: 5358914 markings, 9538173 edges, 348108 markings/sec, 10 secs
lola: 7087517 markings, 12604337 edges, 345721 markings/sec, 15 secs
lola: 8849240 markings, 15724953 edges, 352345 markings/sec, 20 secs
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: ========================================
lola: subprocess 6 will run for 318 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(SwG)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 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: 1965210 markings, 3478699 edges, 393042 markings/sec, 0 secs
lola: 3927454 markings, 6959145 edges, 392449 markings/sec, 5 secs
lola: 5864345 markings, 10397982 edges, 387378 markings/sec, 10 secs
lola: 7770532 markings, 13784407 edges, 381237 markings/sec, 15 secs
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: ========================================
lola: subprocess 7 will run for 351 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(CA)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 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: 2408631 markings, 2928540 edges, 481726 markings/sec, 0 secs
lola: 4758311 markings, 5788602 edges, 469936 markings/sec, 5 secs
lola: SUBRESULT
lola: result: 40
lola: produced by: state space
lola: The maximum value of the given expression is 40
lola: subprocess 8 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(MpG)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 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: ========================================
lola: 1972271 markings, 3131478 edges, 394454 markings/sec, 0 secs
lola: 3875459 markings, 6121636 edges, 380638 markings/sec, 5 secs
lola: 5665374 markings, 8926470 edges, 357983 markings/sec, 10 secs
lola: 7408729 markings, 11667756 edges, 348671 markings/sec, 15 secs
lola: 9284415 markings, 14611950 edges, 375137 markings/sec, 20 secs
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: ========================================
lola: subprocess 9 will run for 445 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(CwG)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 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: SUBRESULT
lola: result: 40
lola: produced by: state space
lola: The maximum value of the given expression is 40
lola: ========================================
lola: subprocess 10 will run for 520 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(Si)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 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: 1445154 markings, 3195907 edges, 289031 markings/sec, 0 secs
lola: 2905887 markings, 6444523 edges, 292147 markings/sec, 5 secs
lola: 4307293 markings, 9550390 edges, 280281 markings/sec, 10 secs
lola: 5697931 markings, 12629183 edges, 278128 markings/sec, 15 secs
lola: 7083818 markings, 15695422 edges, 277177 markings/sec, 20 secs
lola: 8462511 markings, 18745432 edges, 275739 markings/sec, 25 secs
lola: 9825776 markings, 21764814 edges, 272653 markings/sec, 30 secs
lola: 11207233 markings, 24822992 edges, 276291 markings/sec, 35 secs
lola: 12555673 markings, 27806383 edges, 269688 markings/sec, 40 secs
lola: 13919712 markings, 30827464 edges, 272808 markings/sec, 45 secs
lola: 15283396 markings, 33846139 edges, 272737 markings/sec, 50 secs
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: ========================================
lola: subprocess 11 will run for 612 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(MpA)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 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: 1996031 markings, 3124916 edges, 399206 markings/sec, 0 secs
lola: 3909371 markings, 6125767 edges, 382668 markings/sec, 5 secs
lola: 5764442 markings, 9027934 edges, 371014 markings/sec, 10 secs
lola: 7558602 markings, 11839071 edges, 358832 markings/sec, 15 secs
lola: 9242601 markings, 14454690 edges, 336800 markings/sec, 20 secs
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: ========================================
lola: subprocess 12 will run for 758 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(CG)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 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: 2531172 markings, 3106792 edges, 506234 markings/sec, 0 secs
lola: 4908385 markings, 6028453 edges, 475443 markings/sec, 5 secs
lola: 7156274 markings, 8789093 edges, 449578 markings/sec, 10 secs
lola: SUBRESULT
lola: result: 28
lola: produced by: state space
lola: The maximum value of the given expression is 28
lola: ========================================
lola: subprocess 13 will run for 1006 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(SwA)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 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: 1874943 markings, 3176635 edges, 374989 markings/sec, 0 secs
lola: 3707509 markings, 6296433 edges, 366513 markings/sec, 5 secs
lola: 5492055 markings, 9328934 edges, 356909 markings/sec, 10 secs
lola: 7198192 markings, 12210042 edges, 341227 markings/sec, 15 secs
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: ========================================
lola: subprocess 14 will run for 1499 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(SG)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 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: 1985731 markings, 2896986 edges, 397146 markings/sec, 0 secs
lola: 3853134 markings, 5596997 edges, 373481 markings/sec, 5 secs
lola: 5709394 markings, 8269980 edges, 371252 markings/sec, 10 secs
lola: 7670692 markings, 11095999 edges, 392260 markings/sec, 15 secs
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: ========================================
lola: subprocess 15 will run for 2974 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(Cb)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 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: 2543164 markings, 3052927 edges, 508633 markings/sec, 0 secs
lola: 4979579 markings, 5978863 edges, 487283 markings/sec, 5 secs
lola: SUBRESULT
lola: result: 28
lola: produced by: state space
lola: The maximum value of the given expression is 28
lola: RESULT
lola:
SUMMARY: 10 10 unknown 10 28 10 10 40 10 40 10 10 28 10 10 28
lola: ========================================
FORMULA ClientsAndServers-PT-N0005P1-UpperBounds-0 10 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA ClientsAndServers-PT-N0005P1-UpperBounds-1 10 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA ClientsAndServers-PT-N0005P1-UpperBounds-2 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA ClientsAndServers-PT-N0005P1-UpperBounds-3 10 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA ClientsAndServers-PT-N0005P1-UpperBounds-4 28 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA ClientsAndServers-PT-N0005P1-UpperBounds-5 10 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA ClientsAndServers-PT-N0005P1-UpperBounds-6 10 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA ClientsAndServers-PT-N0005P1-UpperBounds-7 40 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA ClientsAndServers-PT-N0005P1-UpperBounds-8 10 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA ClientsAndServers-PT-N0005P1-UpperBounds-9 40 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA ClientsAndServers-PT-N0005P1-UpperBounds-10 10 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA ClientsAndServers-PT-N0005P1-UpperBounds-11 10 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA ClientsAndServers-PT-N0005P1-UpperBounds-12 28 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA ClientsAndServers-PT-N0005P1-UpperBounds-13 10 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA ClientsAndServers-PT-N0005P1-UpperBounds-14 10 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA ClientsAndServers-PT-N0005P1-UpperBounds-15 28 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
BK_STOP 1496601634406
--------------------
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="ClientsAndServers-PT-N0005P1"
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-N0005P1.tgz
mv ClientsAndServers-PT-N0005P1 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 ClientsAndServers-PT-N0005P1, 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 r168-ebro-149580919900182"
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 '
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 ;