fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r108-blw3-149441612600569
Last Updated
June 27, 2017

About the Execution of LoLA for S_GPPP-PT-C1000N0000000010

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
6214.570 994786.00 996882.00 547.60 7 3 2000 7000 7 7 47 20 10 10 7 47 47 7 47 3000 normal

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_GPPP-PT-C1000N0000000010, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r108-blw3-149441612600569
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1496398249298


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


checking for too many tokens
===========================================================================================
S_GPPP-PT-C1000N0000000010: translating PT formula UpperBounds into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
UpperBounds @ S_GPPP-PT-C1000N0000000010 @ 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: 55/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 33 places, 22 transitions, 21 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 30 transition conflict sets
lola: TASK
lola: reading formula from GPPP-PT-C1000N0000000010-UpperBounds.task
lola: MAX(PEP) : MAX(FBP) : MAX(GSSG) : MAX(GSSG) : MAX(DHAP) : MAX(G6P) : MAX(ATP) : MAX(Lac) : MAX(Ru5P) : MAX(b1) : MAX(a1) : MAX(c2) : MAX(_1_3_BPG) : MAX(Lac) : MAX(Xu5P) : MAX(NADPplus)
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(PEP)
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: 4389947 markings, 7280464 edges, 877989 markings/sec, 0 secs
lola: 8278985 markings, 13766125 edges, 777808 markings/sec, 5 secs
lola: 12168447 markings, 20312732 edges, 777892 markings/sec, 10 secs
lola: 15973435 markings, 27016510 edges, 760998 markings/sec, 15 secs
lola: 19744066 markings, 33819384 edges, 754126 markings/sec, 20 secs
lola: 23239729 markings, 40805056 edges, 699133 markings/sec, 25 secs
lola: 26576887 markings, 47723340 edges, 667432 markings/sec, 30 secs
lola: 30188726 markings, 54337175 edges, 722368 markings/sec, 35 secs
lola: 34125687 markings, 61381391 edges, 787392 markings/sec, 40 secs
lola: 37863305 markings, 68182983 edges, 747524 markings/sec, 45 secs
lola: 41070552 markings, 74205899 edges, 641449 markings/sec, 50 secs
lola: 44618238 markings, 81020373 edges, 709537 markings/sec, 55 secs
lola: 47821444 markings, 87742809 edges, 640641 markings/sec, 60 secs
lola: SUBRESULT
lola: result: 7
lola: produced by: state space
lola: The maximum value of the given expression is 7
lola: ========================================
lola: subprocess 1 will run for 231 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(FBP)
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: 3051331 markings, 9373290 edges, 610266 markings/sec, 0 secs
lola: 5973661 markings, 18371035 edges, 584466 markings/sec, 5 secs
lola: 8602298 markings, 26098824 edges, 525727 markings/sec, 10 secs
lola: 11169618 markings, 33796411 edges, 513464 markings/sec, 15 secs
lola: 13718763 markings, 41552256 edges, 509829 markings/sec, 20 secs
lola: 16275520 markings, 49395043 edges, 511351 markings/sec, 25 secs
lola: 18802819 markings, 57065574 edges, 505460 markings/sec, 30 secs
lola: 21266485 markings, 64637670 edges, 492733 markings/sec, 35 secs
lola: 23780098 markings, 72302732 edges, 502723 markings/sec, 40 secs
lola: 26274589 markings, 79901676 edges, 498898 markings/sec, 45 secs
lola: 28787205 markings, 87583062 edges, 502523 markings/sec, 50 secs
lola: 31350326 markings, 95391224 edges, 512624 markings/sec, 55 secs
lola: 33864090 markings, 103226090 edges, 502753 markings/sec, 60 secs
lola: 36024305 markings, 110019081 edges, 432043 markings/sec, 65 secs
lola: 38237370 markings, 117072882 edges, 442613 markings/sec, 70 secs
lola: 40224785 markings, 123445806 edges, 397483 markings/sec, 75 secs
lola: 42363511 markings, 130603515 edges, 427745 markings/sec, 80 secs
lola: 44366461 markings, 137261588 edges, 400590 markings/sec, 85 secs
lola: 46219163 markings, 143649141 edges, 370540 markings/sec, 90 secs
lola: 48160603 markings, 150407424 edges, 388288 markings/sec, 95 secs
lola: 49813642 markings, 157314992 edges, 330608 markings/sec, 100 secs
lola: 51461257 markings, 164154501 edges, 329523 markings/sec, 105 secs
lola: 53256689 markings, 170733728 edges, 359086 markings/sec, 110 secs
lola: 55269714 markings, 177446426 edges, 402605 markings/sec, 115 secs
lola: SUBRESULT
lola: result: 3
lola: produced by: state space
lola: The maximum value of the given expression is 3
lola: ========================================
lola: subprocess 2 will run for 239 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(GSSG)
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: 5104683 markings, 7729702 edges, 1020937 markings/sec, 0 secs
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: ========================================
lola: subprocess 3 will run for 257 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(GSSG)
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: 5134707 markings, 7773363 edges, 1026941 markings/sec, 0 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 278 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(DHAP)
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: 3242161 markings, 9466288 edges, 648432 markings/sec, 0 secs
lola: 6052785 markings, 17331227 edges, 562125 markings/sec, 5 secs
lola: 8706345 markings, 24755485 edges, 530712 markings/sec, 10 secs
lola: 11305453 markings, 32027403 edges, 519822 markings/sec, 15 secs
lola: 13929845 markings, 39371641 edges, 524878 markings/sec, 20 secs
lola: 16590017 markings, 47037062 edges, 532034 markings/sec, 25 secs
lola: 18960882 markings, 54405194 edges, 474173 markings/sec, 30 secs
lola: 21344133 markings, 62011511 edges, 476650 markings/sec, 35 secs
lola: 23475267 markings, 69456283 edges, 426227 markings/sec, 40 secs
lola: 25549082 markings, 76791838 edges, 414763 markings/sec, 45 secs
lola: 27637067 markings, 84202173 edges, 417597 markings/sec, 50 secs
lola: 29729999 markings, 91655159 edges, 418586 markings/sec, 55 secs
lola: 31853995 markings, 99222967 edges, 424799 markings/sec, 60 secs
lola: 34061537 markings, 106972335 edges, 441508 markings/sec, 65 secs
lola: 36534950 markings, 114664241 edges, 494683 markings/sec, 70 secs
lola: 38641061 markings, 121863030 edges, 421222 markings/sec, 75 secs
lola: 40569540 markings, 129556517 edges, 385696 markings/sec, 80 secs
lola: 42518677 markings, 137355484 edges, 389827 markings/sec, 85 secs
lola: 44721691 markings, 145410351 edges, 440603 markings/sec, 90 secs
lola: 46896647 markings, 153057712 edges, 434991 markings/sec, 95 secs
lola: 48921317 markings, 161053806 edges, 404934 markings/sec, 100 secs
lola: 50598087 markings, 167805121 edges, 335354 markings/sec, 105 secs
lola: 52667231 markings, 175312037 edges, 413829 markings/sec, 110 secs
lola: 54561584 markings, 182792741 edges, 378871 markings/sec, 115 secs
lola: 56580330 markings, 190320787 edges, 403749 markings/sec, 120 secs
lola: 58521770 markings, 197478757 edges, 388288 markings/sec, 125 secs
lola: 60481428 markings, 204735715 edges, 391932 markings/sec, 130 secs
lola: SUBRESULT
lola: result: 7
lola: produced by: state space
lola: The maximum value of the given expression is 7
lola: ========================================
lola: subprocess 5 will run for 290 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(G6P)
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: 2619065 markings, 8797926 edges, 523813 markings/sec, 0 secs
lola: 4789114 markings, 16695178 edges, 434010 markings/sec, 5 secs
lola: 6844534 markings, 24545210 edges, 411084 markings/sec, 10 secs
lola: 8700620 markings, 32178328 edges, 371217 markings/sec, 15 secs
lola: 10535542 markings, 39988328 edges, 366984 markings/sec, 20 secs
lola: 12456375 markings, 47919131 edges, 384167 markings/sec, 25 secs
lola: 14191055 markings, 54881988 edges, 346936 markings/sec, 30 secs
lola: 16286025 markings, 61450619 edges, 418994 markings/sec, 35 secs
lola: 18216661 markings, 68248235 edges, 386127 markings/sec, 40 secs
lola: 20136602 markings, 75693593 edges, 383988 markings/sec, 45 secs
lola: 21727893 markings, 82746560 edges, 318258 markings/sec, 50 secs
lola: 23487155 markings, 89645016 edges, 351852 markings/sec, 55 secs
lola: 25009400 markings, 97048563 edges, 304449 markings/sec, 60 secs
lola: 26622991 markings, 104150044 edges, 322718 markings/sec, 65 secs
lola: 28712201 markings, 111409549 edges, 417842 markings/sec, 70 secs
lola: 30203841 markings, 118773562 edges, 298328 markings/sec, 75 secs
lola: 31635349 markings, 125366059 edges, 286302 markings/sec, 80 secs
lola: 33302246 markings, 132704547 edges, 333379 markings/sec, 85 secs
lola: 34647632 markings, 139484552 edges, 269077 markings/sec, 90 secs
lola: 36277300 markings, 146578351 edges, 325934 markings/sec, 95 secs
lola: 37667323 markings, 153798813 edges, 278005 markings/sec, 100 secs
lola: 39152822 markings, 160589399 edges, 297100 markings/sec, 105 secs
lola: 40642672 markings, 167854337 edges, 297970 markings/sec, 110 secs
lola: 42110670 markings, 174788851 edges, 293600 markings/sec, 115 secs
lola: 43633397 markings, 182099267 edges, 304545 markings/sec, 120 secs
lola: 45073366 markings, 188879621 edges, 287994 markings/sec, 125 secs
lola: 46546723 markings, 196048514 edges, 294671 markings/sec, 130 secs
lola: 48123277 markings, 203133899 edges, 315311 markings/sec, 135 secs
lola: 49496359 markings, 210110340 edges, 274616 markings/sec, 140 secs
lola: 51067026 markings, 217338934 edges, 314133 markings/sec, 145 secs
lola: 52582509 markings, 224544076 edges, 303097 markings/sec, 150 secs
lola: 54045615 markings, 231682224 edges, 292621 markings/sec, 155 secs
lola: 55526784 markings, 238698443 edges, 296234 markings/sec, 160 secs
lola: 57072084 markings, 245915608 edges, 309060 markings/sec, 165 secs
lola: 58596902 markings, 253119603 edges, 304964 markings/sec, 170 secs
lola: 60145420 markings, 260500290 edges, 309704 markings/sec, 175 secs
lola: 61678311 markings, 267847278 edges, 306578 markings/sec, 180 secs
lola: 63169389 markings, 275077989 edges, 298216 markings/sec, 185 secs
lola: 64762077 markings, 282459077 edges, 318538 markings/sec, 190 secs
lola: 66326636 markings, 289901761 edges, 312912 markings/sec, 195 secs
lola: 67969255 markings, 297649255 edges, 328524 markings/sec, 200 secs
lola: SUBRESULT
lola: result: 47
lola: produced by: state space
lola: The maximum value of the given expression is 47
lola: ========================================
lola: subprocess 6 will run for 298 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(ATP)
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: 3387911 markings, 9044264 edges, 677582 markings/sec, 0 secs
lola: 6433429 markings, 17140413 edges, 609104 markings/sec, 5 secs
lola: 9446064 markings, 25400025 edges, 602527 markings/sec, 10 secs
lola: 12102520 markings, 33369002 edges, 531291 markings/sec, 15 secs
lola: 14809362 markings, 41489698 edges, 541368 markings/sec, 20 secs
lola: 17753665 markings, 49452037 edges, 588861 markings/sec, 25 secs
lola: 20253409 markings, 57065190 edges, 499949 markings/sec, 30 secs
lola: 22686772 markings, 64479339 edges, 486673 markings/sec, 35 secs
lola: 25039299 markings, 72112216 edges, 470505 markings/sec, 40 secs
lola: 27429818 markings, 79746024 edges, 478104 markings/sec, 45 secs
lola: 29986712 markings, 87658262 edges, 511379 markings/sec, 50 secs
lola: 32384425 markings, 95541198 edges, 479543 markings/sec, 55 secs
lola: 34658797 markings, 102827312 edges, 454874 markings/sec, 60 secs
lola: 37081732 markings, 110430896 edges, 484587 markings/sec, 65 secs
lola: 39570165 markings, 118257069 edges, 497687 markings/sec, 70 secs
lola: 42514233 markings, 125866988 edges, 588814 markings/sec, 75 secs
lola: 44678346 markings, 132748200 edges, 432823 markings/sec, 80 secs
lola: 47211935 markings, 139644057 edges, 506718 markings/sec, 85 secs
lola: 49201294 markings, 146013176 edges, 397872 markings/sec, 90 secs
lola: 51506744 markings, 153209997 edges, 461090 markings/sec, 95 secs
lola: 53711478 markings, 160291253 edges, 440947 markings/sec, 100 secs
lola: 56032510 markings, 167623256 edges, 464206 markings/sec, 105 secs
lola: 58363827 markings, 175001093 edges, 466263 markings/sec, 110 secs
lola: 60671071 markings, 182454537 edges, 461449 markings/sec, 115 secs
lola: 62882739 markings, 189484361 edges, 442334 markings/sec, 120 secs
lola: 65244568 markings, 196880642 edges, 472366 markings/sec, 125 secs
lola: 67851173 markings, 204230508 edges, 521321 markings/sec, 130 secs
lola: 70233975 markings, 211450329 edges, 476560 markings/sec, 135 secs
lola: 72381175 markings, 218356205 edges, 429440 markings/sec, 140 secs
lola: 74556375 markings, 225358157 edges, 435040 markings/sec, 145 secs
lola: 76758286 markings, 232428148 edges, 440382 markings/sec, 150 secs
lola: SUBRESULT
lola: result: 47
lola: produced by: state space
lola: The maximum value of the given expression is 47
lola: ========================================
lola: subprocess 7 will run for 314 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(Lac)
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: 4682266 markings, 8127955 edges, 936453 markings/sec, 0 secs
lola: 9173459 markings, 15742508 edges, 898239 markings/sec, 5 secs
lola: 12954349 markings, 22693995 edges, 756178 markings/sec, 10 secs
lola: 17488654 markings, 29725369 edges, 906861 markings/sec, 15 secs
lola: 21649842 markings, 36816877 edges, 832238 markings/sec, 20 secs
lola: 25888894 markings, 43487637 edges, 847810 markings/sec, 25 secs
lola: 29431438 markings, 50183917 edges, 708509 markings/sec, 30 secs
lola: 32797150 markings, 56799870 edges, 673142 markings/sec, 35 secs
lola: SUBRESULT
lola: result: 7
lola: produced by: state space
lola: The maximum value of the given expression is 7
lola: ========================================
lola: subprocess 8 will run for 349 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(Ru5P)
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: 5118039 markings, 7750122 edges, 1023608 markings/sec, 0 secs
lola: SUBRESULT
lola: result: 47
lola: produced by: state space
lola: The maximum value of the given expression is 47
lola: ========================================
lola: subprocess 9 will run for 398 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(b1)
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: 5162841 markings, 7815739 edges, 1032568 markings/sec, 0 secs
lola: SUBRESULT
lola: result: 3000
lola: produced by: state space
lola: The maximum value of the given expression is 3000
lola: ========================================
lola: subprocess 10 will run for 463 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(a1)
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: SUBRESULT
lola: result: 2000
lola: produced by: state space
lola: The maximum value of the given expression is 2000
lola: ========================================
lola: subprocess 11 will run for 556 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(c2)
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: 3879597 markings, 9381953 edges, 775919 markings/sec, 0 secs
lola: 7140316 markings, 17178129 edges, 652144 markings/sec, 5 secs
lola: 10287426 markings, 24694799 edges, 629422 markings/sec, 10 secs
lola: 13470213 markings, 32293393 edges, 636557 markings/sec, 15 secs
lola: 16752560 markings, 40377482 edges, 656469 markings/sec, 20 secs
lola: 19710958 markings, 48106949 edges, 591680 markings/sec, 25 secs
lola: 22249467 markings, 55688078 edges, 507702 markings/sec, 30 secs
lola: 24751775 markings, 63203118 edges, 500462 markings/sec, 35 secs
lola: 27259857 markings, 70755606 edges, 501616 markings/sec, 40 secs
lola: 29781548 markings, 78357540 edges, 504338 markings/sec, 45 secs
lola: 32462173 markings, 86237685 edges, 536125 markings/sec, 50 secs
lola: 35344342 markings, 94051603 edges, 576434 markings/sec, 55 secs
lola: 37975789 markings, 101930344 edges, 526289 markings/sec, 60 secs
lola: 40871796 markings, 110082537 edges, 579201 markings/sec, 65 secs
lola: 43210700 markings, 117072321 edges, 467781 markings/sec, 70 secs
lola: 45883546 markings, 124708662 edges, 534569 markings/sec, 75 secs
lola: 48254835 markings, 132141758 edges, 474258 markings/sec, 80 secs
lola: 50568207 markings, 139470508 edges, 462674 markings/sec, 85 secs
lola: SUBRESULT
lola: result: 7000
lola: produced by: state space
lola: The maximum value of the given expression is 7000
lola: ========================================
lola: subprocess 12 will run for 671 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(_1_3_BPG)
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: 3835031 markings, 9274891 edges, 767006 markings/sec, 0 secs
lola: 7095598 markings, 17072103 edges, 652113 markings/sec, 5 secs
lola: 10307557 markings, 24742588 edges, 642392 markings/sec, 10 secs
lola: 13539383 markings, 32457801 edges, 646365 markings/sec, 15 secs
lola: 16838588 markings, 40599124 edges, 659841 markings/sec, 20 secs
lola: 19802157 markings, 48376110 edges, 592714 markings/sec, 25 secs
lola: 22337864 markings, 55951586 edges, 507141 markings/sec, 30 secs
lola: 24828781 markings, 63436231 edges, 498183 markings/sec, 35 secs
lola: 27333020 markings, 70977048 edges, 500848 markings/sec, 40 secs
lola: 29868029 markings, 78615132 edges, 507002 markings/sec, 45 secs
lola: 32593235 markings, 86569433 edges, 545041 markings/sec, 50 secs
lola: 35461249 markings, 94400822 edges, 573603 markings/sec, 55 secs
lola: 38091048 markings, 102276484 edges, 525960 markings/sec, 60 secs
lola: 41000332 markings, 110465299 edges, 581857 markings/sec, 65 secs
lola: 43355367 markings, 117506327 edges, 471007 markings/sec, 70 secs
lola: 46080872 markings, 125291986 edges, 545101 markings/sec, 75 secs
lola: 48427162 markings, 132686638 edges, 469258 markings/sec, 80 secs
lola: 50782616 markings, 140148648 edges, 471091 markings/sec, 85 secs
lola: SUBRESULT
lola: result: 7
lola: produced by: state space
lola: The maximum value of the given expression is 7
lola: subprocess 13 will run for 864 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(Lac)
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: 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: 4778165 markings, 8274322 edges, 955633 markings/sec, 0 secs
lola: 9253033 markings, 15872212 edges, 894974 markings/sec, 5 secs
lola: 13130153 markings, 22956054 edges, 775424 markings/sec, 10 secs
lola: 17660959 markings, 30036800 edges, 906161 markings/sec, 15 secs
lola: 21892774 markings, 37193967 edges, 846363 markings/sec, 20 secs
lola: 26084097 markings, 43809987 edges, 838265 markings/sec, 25 secs
lola: 29650662 markings, 50614865 edges, 713313 markings/sec, 30 secs
lola: SUBRESULT
lola: result: 7
lola: produced by: state space
lola: The maximum value of the given expression is 7
lola: ========================================
lola: subprocess 14 will run for 1276 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(Xu5P)
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: SUBRESULT
lola: result: 47
lola: produced by: state space
lola: The maximum value of the given expression is 47
lola: ========================================
lola: subprocess 15 will run for 2552 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(NADPplus)
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: 5303663 markings, 8027639 edges, 1060733 markings/sec, 0 secs
lola: SUBRESULT
lola: result: 20
lola: produced by: state space
lola: The maximum value of the given expression is 20
lola: RESULT
lola:
SUMMARY: 7 3 10 10 7 47 47 7 47 3000 2000 7000 7 7 47 20
lola: ========================================
FORMULA GPPP-PT-C1000N0000000010-UpperBounds-0 7 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-UpperBounds-1 3 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-UpperBounds-2 10 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-UpperBounds-3 10 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-UpperBounds-4 7 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-UpperBounds-5 47 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-UpperBounds-6 47 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-UpperBounds-7 7 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-UpperBounds-8 47 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-UpperBounds-9 3000 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-UpperBounds-10 2000 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-UpperBounds-11 7000 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-UpperBounds-12 7 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-UpperBounds-13 7 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-UpperBounds-14 47 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GPPP-PT-C1000N0000000010-UpperBounds-15 20 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496399244084

--------------------
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_GPPP-PT-C1000N0000000010"
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_GPPP-PT-C1000N0000000010.tgz
mv S_GPPP-PT-C1000N0000000010 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_GPPP-PT-C1000N0000000010, 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 r108-blw3-149441612600569"
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 ;