fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r088-csrt-149441074500443
Last Updated
June 27, 2017

About the Execution of LoLA for S_BridgeAndVehicles-PT-V20P20N10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
729.140 1422031.00 1426553.00 95.10 1 20 1 10 20 1 10 10 10 ? 20 1 1 1 1 20 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_BridgeAndVehicles-PT-V20P20N10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r088-csrt-149441074500443
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1496347475457


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


checking for too many tokens
===========================================================================================
S_BridgeAndVehicles-PT-V20P20N10: translating PT formula UpperBounds into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
UpperBounds @ S_BridgeAndVehicles-PT-V20P20N10 @ 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: 616/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 68 places, 548 transitions, 61 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 693 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-COL-V20P20N10-UpperBounds.task
lola: MAX(NB_ATTENTE_B_10 + NB_ATTENTE_B_11 + NB_ATTENTE_B_12 + NB_ATTENTE_B_13 + NB_ATTENTE_B_14 + NB_ATTENTE_B_15 + NB_ATTENTE_B_16 + NB_ATTENTE_B_17 + NB_ATTENTE_B_18 + NB_ATTENTE_B_19 + NB_ATTENTE_B_20 + NB_ATTENTE_B_0 + NB_ATTENTE_B_1 + NB_ATTENTE_B_2 + NB_ATTENTE_B_3 + NB_ATTENTE_B_4 + NB_ATTENTE_B_5 + NB_ATTENTE_B_6 + NB_ATTENTE_B_7 + NB_ATTENTE_B_8 + NB_ATTENTE_B_9) : MAX(SORTI_A) : MAX(SUR_PONT_B) : MAX(ATTENTE_B) : MAX(CAPACITE) : MAX(NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A_20) : MAX(COMPTEUR_10 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9) : MAX(NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A_20) : MAX(NB_ATTENTE_B_10 + NB_ATTENTE_B_11 + NB_ATTENTE_B_12 + NB_ATTENTE_B_13 + NB_ATTENTE_B_14 + NB_ATTENTE_B_15 + NB_ATTENTE_B_16 + NB_ATTENTE_B_17 + NB_ATTENTE_B_18 + NB_ATTENTE_B_19 + NB_ATTENTE_B_20 + NB_ATTENTE_B_0 + NB_ATTENTE_B_1 + NB_ATTENTE_B_2 + NB_ATTENTE_B_3 + NB_ATTENTE_B_4 + NB_ATTENTE_B_5 + NB_ATTENTE_B_6 + NB_ATTENTE_B_7 + NB_ATTENTE_B_8 + NB_ATTENTE_B_9) : MAX(SORTI_A) : MAX(NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A_20) : MAX(SUR_PONT_B) : MAX(SORTI_A) : MAX(NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A_20) : MAX(SUR_PONT_A) : MAX(SUR_PONT_A)
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(NB_ATTENTE_B_10 + NB_ATTENTE_B_11 + NB_ATTENTE_B_12 + NB_ATTENTE_B_13 + NB_ATTENTE_B_14 + NB_ATTENTE_B_15 + NB_ATTENTE_B_16 + NB_ATTENTE_B_17 + NB_ATTENTE_B_18 + NB_ATTENTE_B_19 + NB_ATTENTE_B_20 + NB_ATTENTE_B_0 + NB_ATTENTE_B_1 + NB_ATTENTE_B_2 + NB_ATTENTE_B_3 + NB_ATTENTE_B_4 + NB_ATTENTE_B_5 + NB_ATTENTE_B_6 + NB_ATTENTE_B_7 + NB_ATTENTE_B_8 + NB_ATTENTE_B_9)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 244 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: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(SORTI_A)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 244 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: 173326 markings, 391657 edges, 34665 markings/sec, 0 secs
lola: 332852 markings, 734244 edges, 31905 markings/sec, 5 secs
lola: 493869 markings, 1074940 edges, 32203 markings/sec, 10 secs
lola: 671415 markings, 1437850 edges, 35509 markings/sec, 15 secs
lola: 851037 markings, 1811686 edges, 35924 markings/sec, 20 secs
lola: 1021861 markings, 2159176 edges, 34165 markings/sec, 25 secs
lola: 1194915 markings, 2507517 edges, 34611 markings/sec, 30 secs
lola: 1367396 markings, 2862085 edges, 34496 markings/sec, 35 secs
lola: 1537807 markings, 3209872 edges, 34082 markings/sec, 40 secs
lola: 1707267 markings, 3554900 edges, 33892 markings/sec, 45 secs
lola: 1881338 markings, 3890097 edges, 34814 markings/sec, 50 secs
lola: 2053724 markings, 4249051 edges, 34477 markings/sec, 55 secs
lola: 2232982 markings, 4608940 edges, 35852 markings/sec, 60 secs
lola: 2415609 markings, 4953327 edges, 36525 markings/sec, 65 secs
lola: 2587522 markings, 5308283 edges, 34383 markings/sec, 70 secs
lola: 2768486 markings, 5664546 edges, 36193 markings/sec, 75 secs
lola: 2949728 markings, 6028275 edges, 36248 markings/sec, 80 secs
lola: 3128655 markings, 6386389 edges, 35785 markings/sec, 85 secs
lola: SUBRESULT
lola: result: 20
lola: produced by: state space
lola: The maximum value of the given expression is 20
lola: ========================================
lola: subprocess 2 will run for 246 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(SUR_PONT_B)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 244 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: 167023 markings, 361788 edges, 33405 markings/sec, 0 secs
lola: 331793 markings, 736363 edges, 32954 markings/sec, 5 secs
lola: 492323 markings, 1108148 edges, 32106 markings/sec, 10 secs
lola: 641894 markings, 1457344 edges, 29914 markings/sec, 15 secs
lola: 783733 markings, 1791532 edges, 28368 markings/sec, 20 secs
lola: 925200 markings, 2124518 edges, 28293 markings/sec, 25 secs
lola: 1064881 markings, 2452090 edges, 27936 markings/sec, 30 secs
lola: 1212268 markings, 2803528 edges, 29477 markings/sec, 35 secs
lola: 1355257 markings, 3141665 edges, 28598 markings/sec, 40 secs
lola: 1493404 markings, 3469876 edges, 27629 markings/sec, 45 secs
lola: 1628589 markings, 3788981 edges, 27037 markings/sec, 50 secs
lola: 1769424 markings, 4121972 edges, 28167 markings/sec, 55 secs
lola: 1907490 markings, 4446193 edges, 27613 markings/sec, 60 secs
lola: 2041136 markings, 4762205 edges, 26729 markings/sec, 65 secs
lola: 2179057 markings, 5087203 edges, 27584 markings/sec, 70 secs
lola: 2321344 markings, 5421155 edges, 28457 markings/sec, 75 secs
lola: 2464770 markings, 5756647 edges, 28685 markings/sec, 80 secs
lola: 2606598 markings, 6090454 edges, 28366 markings/sec, 85 secs
lola: 2743932 markings, 6412142 edges, 27467 markings/sec, 90 secs
lola: 2882759 markings, 6734994 edges, 27765 markings/sec, 95 secs
lola: 3023664 markings, 7065972 edges, 28181 markings/sec, 100 secs
lola: 3163961 markings, 7393842 edges, 28059 markings/sec, 105 secs
lola: 3298900 markings, 7706198 edges, 26988 markings/sec, 110 secs
lola: 3442193 markings, 8043593 edges, 28659 markings/sec, 115 secs
lola: 3586147 markings, 8381256 edges, 28791 markings/sec, 120 secs
lola: 3720854 markings, 8693597 edges, 26941 markings/sec, 125 secs
lola: 3855282 markings, 9005394 edges, 26886 markings/sec, 130 secs
lola: 3993705 markings, 9330145 edges, 27685 markings/sec, 135 secs
lola: 4128682 markings, 9646496 edges, 26995 markings/sec, 140 secs
lola: 4262361 markings, 9955445 edges, 26736 markings/sec, 145 secs
lola: 4402584 markings, 10279728 edges, 28045 markings/sec, 150 secs
lola: 4549298 markings, 10623113 edges, 29343 markings/sec, 155 secs
lola: 4689236 markings, 10948990 edges, 27988 markings/sec, 160 secs
lola: 4829136 markings, 11274053 edges, 27980 markings/sec, 165 secs
lola: 4970983 markings, 11601572 edges, 28369 markings/sec, 170 secs
lola: 5113231 markings, 11931570 edges, 28450 markings/sec, 175 secs
lola: 5254638 markings, 12262046 edges, 28281 markings/sec, 180 secs
lola: 5394126 markings, 12587535 edges, 27898 markings/sec, 185 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 250 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(ATTENTE_B)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 244 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: 159570 markings, 291061 edges, 31914 markings/sec, 0 secs
lola: 267905 markings, 547980 edges, 21667 markings/sec, 5 secs
lola: 372663 markings, 799691 edges, 20952 markings/sec, 10 secs
lola: 472789 markings, 1046625 edges, 20025 markings/sec, 15 secs
lola: 571644 markings, 1293551 edges, 19771 markings/sec, 20 secs
lola: 666061 markings, 1536881 edges, 18883 markings/sec, 25 secs
lola: 762727 markings, 1778669 edges, 19333 markings/sec, 30 secs
lola: 855452 markings, 2023719 edges, 18545 markings/sec, 35 secs
lola: 951878 markings, 2268829 edges, 19285 markings/sec, 40 secs
lola: 1042694 markings, 2504913 edges, 18163 markings/sec, 45 secs
lola: 1120838 markings, 2723681 edges, 15629 markings/sec, 50 secs
lola: 1219700 markings, 2957381 edges, 19772 markings/sec, 55 secs
lola: 1302822 markings, 3185101 edges, 16624 markings/sec, 60 secs
lola: 1383830 markings, 3413675 edges, 16202 markings/sec, 65 secs
lola: 1490808 markings, 3675306 edges, 21396 markings/sec, 70 secs
lola: 1582171 markings, 3897897 edges, 18273 markings/sec, 75 secs
lola: 1675675 markings, 4141552 edges, 18701 markings/sec, 80 secs
lola: 1766192 markings, 4389053 edges, 18103 markings/sec, 85 secs
lola: 1866603 markings, 4638254 edges, 20082 markings/sec, 90 secs
lola: 1959330 markings, 4874959 edges, 18545 markings/sec, 95 secs
lola: 2054970 markings, 5119144 edges, 19128 markings/sec, 100 secs
lola: 2141704 markings, 5360124 edges, 17347 markings/sec, 105 secs
lola: 2232630 markings, 5609553 edges, 18185 markings/sec, 110 secs
lola: 2330926 markings, 5854475 edges, 19659 markings/sec, 115 secs
lola: 2420191 markings, 6082031 edges, 17853 markings/sec, 120 secs
lola: 2512127 markings, 6325319 edges, 18387 markings/sec, 125 secs
lola: 2601580 markings, 6575576 edges, 17891 markings/sec, 130 secs
lola: 2688561 markings, 6817570 edges, 17396 markings/sec, 135 secs
lola: 2784741 markings, 7060888 edges, 19236 markings/sec, 140 secs
lola: 2873613 markings, 7294001 edges, 17774 markings/sec, 145 secs
lola: 2964637 markings, 7524467 edges, 18205 markings/sec, 150 secs
lola: 3053657 markings, 7770583 edges, 17804 markings/sec, 155 secs
lola: 3140052 markings, 8016192 edges, 17279 markings/sec, 160 secs
lola: 3229526 markings, 8257324 edges, 17895 markings/sec, 165 secs
lola: 3320051 markings, 8493707 edges, 18105 markings/sec, 170 secs
lola: 3404547 markings, 8718027 edges, 16899 markings/sec, 175 secs
lola: 3495539 markings, 8950346 edges, 18198 markings/sec, 180 secs
lola: 3582595 markings, 9192777 edges, 17411 markings/sec, 185 secs
lola: 3666642 markings, 9435341 edges, 16809 markings/sec, 190 secs
lola: 3754724 markings, 9671915 edges, 17616 markings/sec, 195 secs
lola: 3843690 markings, 9910363 edges, 17793 markings/sec, 200 secs
lola: 3931764 markings, 10146131 edges, 17615 markings/sec, 205 secs
lola: 4018092 markings, 10369630 edges, 17266 markings/sec, 210 secs
lola: 4104162 markings, 10603996 edges, 17214 markings/sec, 215 secs
lola: 4188159 markings, 10842996 edges, 16799 markings/sec, 220 secs
lola: 4269665 markings, 11077599 edges, 16301 markings/sec, 225 secs
lola: 4348384 markings, 11290603 edges, 15744 markings/sec, 230 secs
lola: 4428281 markings, 11501773 edges, 15979 markings/sec, 235 secs
lola: 4506357 markings, 11712216 edges, 15615 markings/sec, 240 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 250 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(CAPACITE)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 244 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: 160886 markings, 368221 edges, 32177 markings/sec, 0 secs
lola: 326340 markings, 746468 edges, 33091 markings/sec, 5 secs
lola: 495873 markings, 1135204 edges, 33907 markings/sec, 10 secs
lola: 663111 markings, 1516972 edges, 33448 markings/sec, 15 secs
lola: 833624 markings, 1903040 edges, 34103 markings/sec, 20 secs
lola: 1000387 markings, 2285001 edges, 33353 markings/sec, 25 secs
lola: 1164982 markings, 2658891 edges, 32919 markings/sec, 30 secs
lola: 1323476 markings, 3018680 edges, 31699 markings/sec, 35 secs
lola: 1481560 markings, 3376517 edges, 31617 markings/sec, 40 secs
lola: 1641172 markings, 3737586 edges, 31922 markings/sec, 45 secs
lola: 1800906 markings, 4098052 edges, 31947 markings/sec, 50 secs
lola: 1963653 markings, 4464556 edges, 32549 markings/sec, 55 secs
lola: 2128274 markings, 4835477 edges, 32924 markings/sec, 60 secs
lola: 2295983 markings, 5214388 edges, 33542 markings/sec, 65 secs
lola: 2457484 markings, 5577262 edges, 32300 markings/sec, 70 secs
lola: 2620273 markings, 5944404 edges, 32558 markings/sec, 75 secs
lola: 2783712 markings, 6311373 edges, 32688 markings/sec, 80 secs
lola: 2942082 markings, 6669621 edges, 31674 markings/sec, 85 secs
lola: 3100363 markings, 7026330 edges, 31656 markings/sec, 90 secs
lola: 3260114 markings, 7382258 edges, 31950 markings/sec, 95 secs
lola: 3423382 markings, 7751645 edges, 32654 markings/sec, 100 secs
lola: 3587393 markings, 8117408 edges, 32802 markings/sec, 105 secs
lola: 3750898 markings, 8489212 edges, 32701 markings/sec, 110 secs
lola: 3910650 markings, 8845822 edges, 31950 markings/sec, 115 secs
lola: 4073216 markings, 9211798 edges, 32513 markings/sec, 120 secs
lola: 4235352 markings, 9580426 edges, 32427 markings/sec, 125 secs
lola: 4396537 markings, 9937734 edges, 32237 markings/sec, 130 secs
lola: 4551920 markings, 10284951 edges, 31077 markings/sec, 135 secs
lola: 4699922 markings, 10618216 edges, 29600 markings/sec, 140 secs
lola: SUBRESULT
lola: result: 20
lola: produced by: state space
lola: The maximum value of the given expression is 20
lola: ========================================
lola: subprocess 5 will run for 259 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A_20)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 244 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: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 6 will run for 285 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(COMPTEUR_10 + COMPTEUR_0 + COMPTEUR_1 + COMPTEUR_2 + COMPTEUR_3 + COMPTEUR_4 + COMPTEUR_5 + COMPTEUR_6 + COMPTEUR_7 + COMPTEUR_8 + COMPTEUR_9)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 244 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: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 7 will run for 317 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A_20)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 244 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: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 8 will run for 357 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(NB_ATTENTE_B_10 + NB_ATTENTE_B_11 + NB_ATTENTE_B_12 + NB_ATTENTE_B_13 + NB_ATTENTE_B_14 + NB_ATTENTE_B_15 + NB_ATTENTE_B_16 + NB_ATTENTE_B_17 + NB_ATTENTE_B_18 + NB_ATTENTE_B_19 + NB_ATTENTE_B_20 + NB_ATTENTE_B_0 + NB_ATTENTE_B_1 + NB_ATTENTE_B_2 + NB_ATTENTE_B_3 + NB_ATTENTE_B_4 + NB_ATTENTE_B_5 + NB_ATTENTE_B_6 + NB_ATTENTE_B_7 + NB_ATTENTE_B_8 + NB_ATTENTE_B_9)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 244 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: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 9 will run for 408 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(SORTI_A)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 244 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: 178125 markings, 402581 edges, 35625 markings/sec, 0 secs
lola: 360952 markings, 797045 edges, 36565 markings/sec, 5 secs
lola: 542375 markings, 1172155 edges, 36285 markings/sec, 10 secs
lola: 714841 markings, 1533770 edges, 34493 markings/sec, 15 secs
lola: 889343 markings, 1896070 edges, 34900 markings/sec, 20 secs
lola: 1067567 markings, 2260146 edges, 35645 markings/sec, 25 secs
lola: 1244810 markings, 2617278 edges, 35449 markings/sec, 30 secs
lola: 1422324 markings, 2970458 edges, 35503 markings/sec, 35 secs
lola: 1598244 markings, 3324804 edges, 35184 markings/sec, 40 secs
lola: 1759852 markings, 3659953 edges, 32322 markings/sec, 45 secs
lola: 1925943 markings, 3987907 edges, 33218 markings/sec, 50 secs
lola: 2092731 markings, 4317984 edges, 33358 markings/sec, 55 secs
lola: 2253775 markings, 4654612 edges, 32209 markings/sec, 60 secs
lola: 2422103 markings, 4967651 edges, 33666 markings/sec, 65 secs
lola: 2584023 markings, 5303039 edges, 32384 markings/sec, 70 secs
lola: 2750050 markings, 5624447 edges, 33205 markings/sec, 75 secs
lola: 2912425 markings, 5955027 edges, 32475 markings/sec, 80 secs
lola: 3080034 markings, 6280036 edges, 33522 markings/sec, 85 secs
lola: SUBRESULT
lola: result: 20
lola: produced by: state space
lola: The maximum value of the given expression is 20
lola: ========================================
lola: subprocess 10 will run for 460 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A_20)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 244 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: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 11 will run for 552 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(SUR_PONT_B)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 244 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: 159228 markings, 344440 edges, 31846 markings/sec, 0 secs
lola: 310807 markings, 688465 edges, 30316 markings/sec, 5 secs
lola: 466034 markings, 1045597 edges, 31045 markings/sec, 10 secs
lola: 612950 markings, 1389111 edges, 29383 markings/sec, 15 secs
lola: 755611 markings, 1725393 edges, 28532 markings/sec, 20 secs
lola: 900857 markings, 2066140 edges, 29049 markings/sec, 25 secs
lola: 1043892 markings, 2403855 edges, 28607 markings/sec, 30 secs
lola: 1197616 markings, 2767442 edges, 30745 markings/sec, 35 secs
lola: 1348567 markings, 3125001 edges, 30190 markings/sec, 40 secs
lola: 1496515 markings, 3477384 edges, 29590 markings/sec, 45 secs
lola: 1627809 markings, 3787168 edges, 26259 markings/sec, 50 secs
lola: 1768728 markings, 4120236 edges, 28184 markings/sec, 55 secs
lola: 1904969 markings, 4440579 edges, 27248 markings/sec, 60 secs
lola: 2039828 markings, 4759220 edges, 26972 markings/sec, 65 secs
lola: 2178000 markings, 5084802 edges, 27634 markings/sec, 70 secs
lola: 2325755 markings, 5431755 edges, 29551 markings/sec, 75 secs
lola: 2475237 markings, 5782021 edges, 29896 markings/sec, 80 secs
lola: 2625390 markings, 6133787 edges, 30031 markings/sec, 85 secs
lola: 2768755 markings, 6469940 edges, 28673 markings/sec, 90 secs
lola: 2915363 markings, 6812945 edges, 29322 markings/sec, 95 secs
lola: 3065016 markings, 7163881 edges, 29931 markings/sec, 100 secs
lola: 3212406 markings, 7507321 edges, 29478 markings/sec, 105 secs
lola: 3364098 markings, 7861404 edges, 30338 markings/sec, 110 secs
lola: 3500827 markings, 8182217 edges, 27346 markings/sec, 115 secs
lola: 3640223 markings, 8508033 edges, 27879 markings/sec, 120 secs
lola: 3784476 markings, 8841174 edges, 28851 markings/sec, 125 secs
lola: 3931453 markings, 9185837 edges, 29395 markings/sec, 130 secs
lola: 4076354 markings, 9523349 edges, 28980 markings/sec, 135 secs
lola: 4222735 markings, 9863853 edges, 29276 markings/sec, 140 secs
lola: 4359649 markings, 10181100 edges, 27383 markings/sec, 145 secs
lola: 4497556 markings, 10502027 edges, 27581 markings/sec, 150 secs
lola: 4635060 markings, 10823166 edges, 27501 markings/sec, 155 secs
lola: 4780079 markings, 11160991 edges, 29004 markings/sec, 160 secs
lola: 4915749 markings, 11473375 edges, 27134 markings/sec, 165 secs
lola: 5064254 markings, 11819041 edges, 29701 markings/sec, 170 secs
lola: 5211643 markings, 12161645 edges, 29478 markings/sec, 175 secs
lola: 5355341 markings, 12498583 edges, 28740 markings/sec, 180 secs
lola: 5496669 markings, 12823013 edges, 28266 markings/sec, 185 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 643 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(SORTI_A)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 244 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: 185729 markings, 418911 edges, 37146 markings/sec, 0 secs
lola: 368641 markings, 810818 edges, 36582 markings/sec, 5 secs
lola: 548222 markings, 1184800 edges, 35916 markings/sec, 10 secs
lola: 728172 markings, 1563355 edges, 35990 markings/sec, 15 secs
lola: 907131 markings, 1935469 edges, 35792 markings/sec, 20 secs
lola: 1085495 markings, 2299797 edges, 35673 markings/sec, 25 secs
lola: 1264615 markings, 2661067 edges, 35824 markings/sec, 30 secs
lola: 1439508 markings, 3008137 edges, 34979 markings/sec, 35 secs
lola: 1611622 markings, 3347738 edges, 34423 markings/sec, 40 secs
lola: 1776974 markings, 3691127 edges, 33070 markings/sec, 45 secs
lola: 1940537 markings, 4019732 edges, 32713 markings/sec, 50 secs
lola: 2107442 markings, 4342627 edges, 33381 markings/sec, 55 secs
lola: 2275865 markings, 4694696 edges, 33685 markings/sec, 60 secs
lola: 2444681 markings, 5016454 edges, 33763 markings/sec, 65 secs
lola: 2612919 markings, 5362128 edges, 33648 markings/sec, 70 secs
lola: 2785386 markings, 5701140 edges, 34493 markings/sec, 75 secs
lola: 2949375 markings, 6027739 edges, 32798 markings/sec, 80 secs
lola: 3113245 markings, 6352667 edges, 32774 markings/sec, 85 secs
lola: SUBRESULT
lola: result: 20
lola: produced by: state space
lola: The maximum value of the given expression is 20
lola: ========================================
lola: subprocess 13 will run for 827 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(NB_ATTENTE_A_0 + NB_ATTENTE_A_1 + NB_ATTENTE_A_2 + NB_ATTENTE_A_3 + NB_ATTENTE_A_4 + NB_ATTENTE_A_5 + NB_ATTENTE_A_6 + NB_ATTENTE_A_7 + NB_ATTENTE_A_8 + NB_ATTENTE_A_9 + NB_ATTENTE_A_10 + NB_ATTENTE_A_11 + NB_ATTENTE_A_12 + NB_ATTENTE_A_13 + NB_ATTENTE_A_14 + NB_ATTENTE_A_15 + NB_ATTENTE_A_16 + NB_ATTENTE_A_17 + NB_ATTENTE_A_18 + NB_ATTENTE_A_19 + NB_ATTENTE_A_20)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 244 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: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: ========================================
lola: subprocess 14 will run for 1240 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(SUR_PONT_A)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 244 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: 172622 markings, 401437 edges, 34524 markings/sec, 0 secs
lola: 332216 markings, 769482 edges, 31919 markings/sec, 5 secs
lola: 486100 markings, 1127029 edges, 30777 markings/sec, 10 secs
lola: 635641 markings, 1472607 edges, 29908 markings/sec, 15 secs
lola: 783036 markings, 1817146 edges, 29479 markings/sec, 20 secs
lola: 925858 markings, 2159618 edges, 28564 markings/sec, 25 secs
lola: 1086550 markings, 2535822 edges, 32138 markings/sec, 30 secs
lola: 1235489 markings, 2885761 edges, 29788 markings/sec, 35 secs
lola: 1383871 markings, 3237787 edges, 29676 markings/sec, 40 secs
lola: 1524978 markings, 3568855 edges, 28221 markings/sec, 45 secs
lola: 1667596 markings, 3901472 edges, 28524 markings/sec, 50 secs
lola: 1803994 markings, 4232241 edges, 27280 markings/sec, 55 secs
lola: 1962404 markings, 4596675 edges, 31682 markings/sec, 60 secs
lola: 2110265 markings, 4949188 edges, 29572 markings/sec, 65 secs
lola: 2269988 markings, 5315876 edges, 31945 markings/sec, 70 secs
lola: 2415655 markings, 5655847 edges, 29133 markings/sec, 75 secs
lola: 2547318 markings, 5978041 edges, 26333 markings/sec, 80 secs
lola: 2696451 markings, 6313330 edges, 29827 markings/sec, 85 secs
lola: 2834259 markings, 6636391 edges, 27562 markings/sec, 90 secs
lola: 2974956 markings, 6976595 edges, 28139 markings/sec, 95 secs
lola: 3137848 markings, 7346979 edges, 32578 markings/sec, 100 secs
lola: 3290392 markings, 7703971 edges, 30509 markings/sec, 105 secs
lola: 3440859 markings, 8064587 edges, 30093 markings/sec, 110 secs
lola: 3596052 markings, 8422812 edges, 31039 markings/sec, 115 secs
lola: 3750734 markings, 8780572 edges, 30936 markings/sec, 120 secs
lola: 3905536 markings, 9139391 edges, 30960 markings/sec, 125 secs
lola: 4039899 markings, 9471652 edges, 26873 markings/sec, 130 secs
lola: 4193117 markings, 9813687 edges, 30644 markings/sec, 135 secs
lola: 4336735 markings, 10150074 edges, 28724 markings/sec, 140 secs
lola: 4478035 markings, 10482412 edges, 28260 markings/sec, 145 secs
lola: 4607341 markings, 10796985 edges, 25861 markings/sec, 150 secs
lola: 4770218 markings, 11160324 edges, 32575 markings/sec, 155 secs
lola: 4919787 markings, 11510896 edges, 29914 markings/sec, 160 secs
lola: 5072593 markings, 11871135 edges, 30561 markings/sec, 165 secs
lola: 5212216 markings, 12207630 edges, 27925 markings/sec, 170 secs
lola: 5372676 markings, 12566636 edges, 32092 markings/sec, 175 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 2297 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(SUR_PONT_A)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 244 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: 184402 markings, 428905 edges, 36880 markings/sec, 0 secs
lola: 356021 markings, 826838 edges, 34324 markings/sec, 5 secs
lola: 524160 markings, 1217573 edges, 33628 markings/sec, 10 secs
lola: 683395 markings, 1592459 edges, 31847 markings/sec, 15 secs
lola: 842978 markings, 1966030 edges, 31917 markings/sec, 20 secs
lola: 1004528 markings, 2336584 edges, 32310 markings/sec, 25 secs
lola: 1156683 markings, 2710479 edges, 30431 markings/sec, 30 secs
lola: 1318355 markings, 3082997 edges, 32334 markings/sec, 35 secs
lola: 1469416 markings, 3444402 edges, 30212 markings/sec, 40 secs
lola: 1632931 markings, 3825584 edges, 32703 markings/sec, 45 secs
lola: 1786317 markings, 4194060 edges, 30677 markings/sec, 50 secs
lola: 1952022 markings, 4571421 edges, 33141 markings/sec, 55 secs
lola: 2102695 markings, 4930391 edges, 30135 markings/sec, 60 secs
lola: 2246755 markings, 5263489 edges, 28812 markings/sec, 65 secs
lola: 2386022 markings, 5590166 edges, 27853 markings/sec, 70 secs
lola: 2522032 markings, 5914779 edges, 27202 markings/sec, 75 secs
lola: 2673030 markings, 6260504 edges, 30200 markings/sec, 80 secs
lola: 2823355 markings, 6611838 edges, 30065 markings/sec, 85 secs
lola: 2967635 markings, 6958328 edges, 28856 markings/sec, 90 secs
lola: 3120935 markings, 7309414 edges, 30660 markings/sec, 95 secs
lola: 3267604 markings, 7655162 edges, 29334 markings/sec, 100 secs
lola: 3418874 markings, 8008040 edges, 30254 markings/sec, 105 secs
lola: 3565090 markings, 8353920 edges, 29243 markings/sec, 110 secs
lola: 3719758 markings, 8707804 edges, 30934 markings/sec, 115 secs
lola: 3875363 markings, 9062609 edges, 31121 markings/sec, 120 secs
lola: 4011043 markings, 9406967 edges, 27136 markings/sec, 125 secs
lola: 4171089 markings, 9761916 edges, 32009 markings/sec, 130 secs
lola: 4317577 markings, 10109093 edges, 29298 markings/sec, 135 secs
lola: 4470514 markings, 10462638 edges, 30587 markings/sec, 140 secs
lola: 4606998 markings, 10796194 edges, 27297 markings/sec, 145 secs
lola: 4768649 markings, 11156861 edges, 32330 markings/sec, 150 secs
lola: 4918782 markings, 11508636 edges, 30027 markings/sec, 155 secs
lola: 5069333 markings, 11862599 edges, 30110 markings/sec, 160 secs
lola: 5193454 markings, 12166919 edges, 24824 markings/sec, 165 secs
lola: 5350687 markings, 12514328 edges, 31447 markings/sec, 170 secs
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: RESULT
lola:
SUMMARY: 1 20 10 unknown 20 1 1 1 1 20 1 10 20 1 10 10
lola: ========================================
FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-0 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-1 20 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-2 10 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-3 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-4 20 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-5 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-6 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-7 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-8 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-9 20 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-10 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-11 10 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-12 20 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-13 1 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-14 10 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-15 10 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496348897488

--------------------
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_BridgeAndVehicles-PT-V20P20N10"
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_BridgeAndVehicles-PT-V20P20N10.tgz
mv S_BridgeAndVehicles-PT-V20P20N10 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_BridgeAndVehicles-PT-V20P20N10, 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-149441074500443"
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 ;