About the Execution of LoLA for RobotManipulation-PT-00500
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 RobotManipulation-PT-00500, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r208-smll-149581172800263
=====================================================================
--------------------
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 RobotManipulation-PT-00500-UpperBounds-0
FORMULA_NAME RobotManipulation-PT-00500-UpperBounds-1
FORMULA_NAME RobotManipulation-PT-00500-UpperBounds-10
FORMULA_NAME RobotManipulation-PT-00500-UpperBounds-11
FORMULA_NAME RobotManipulation-PT-00500-UpperBounds-12
FORMULA_NAME RobotManipulation-PT-00500-UpperBounds-13
FORMULA_NAME RobotManipulation-PT-00500-UpperBounds-14
FORMULA_NAME RobotManipulation-PT-00500-UpperBounds-15
FORMULA_NAME RobotManipulation-PT-00500-UpperBounds-2
FORMULA_NAME RobotManipulation-PT-00500-UpperBounds-3
FORMULA_NAME RobotManipulation-PT-00500-UpperBounds-4
FORMULA_NAME RobotManipulation-PT-00500-UpperBounds-5
FORMULA_NAME RobotManipulation-PT-00500-UpperBounds-6
FORMULA_NAME RobotManipulation-PT-00500-UpperBounds-7
FORMULA_NAME RobotManipulation-PT-00500-UpperBounds-8
FORMULA_NAME RobotManipulation-PT-00500-UpperBounds-9
=== Now, execution of the tool begins
BK_START 1496344034847
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
RobotManipulation-PT-00500: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
RobotManipulation-PT-00500: translating PT formula UpperBounds into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
UpperBounds @ RobotManipulation-PT-00500 @ 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: 26/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 15 places, 11 transitions, 9 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 14 transition conflict sets
lola: TASK
lola: reading formula from RobotManipulation-PT-00500-UpperBounds.task
lola: MAX(r_stopped) : MAX(p_m) : MAX(initialize) : MAX(off) : MAX(p_m) : MAX(p_i1) : MAX(access) : MAX(p_i2) : MAX(p_rel) : MAX(p_m) : MAX(initialized) : MAX(p_rdy) : MAX(off) : MAX(initialize) : MAX(initialize) : MAX(p_sc)
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(r_stopped)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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: 4967232 markings, 6437677 edges, 993446 markings/sec, 0 secs
lola: 8494315 markings, 13522984 edges, 705417 markings/sec, 5 secs
lola: 11489890 markings, 20076385 edges, 599115 markings/sec, 10 secs
lola: 14448253 markings, 26551831 edges, 591673 markings/sec, 15 secs
lola: 17810779 markings, 34099679 edges, 672505 markings/sec, 20 secs
lola: 21712087 markings, 40384785 edges, 780262 markings/sec, 25 secs
lola: 25402248 markings, 46280038 edges, 738032 markings/sec, 30 secs
lola: 27279887 markings, 51238749 edges, 375528 markings/sec, 35 secs
lola: 28634896 markings, 56136252 edges, 271002 markings/sec, 40 secs
lola: 30144576 markings, 62189456 edges, 301936 markings/sec, 45 secs
lola: 30601583 markings, 66713423 edges, 91401 markings/sec, 50 secs
lola: SUBRESULT
lola: result: 1000
lola: produced by: state space
lola: The maximum value of the given expression is 1000
lola: ========================================
lola: subprocess 1 will run for 232 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p_m)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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: 4778330 markings, 7913625 edges, 955666 markings/sec, 0 secs
lola: 9582135 markings, 15875032 edges, 960761 markings/sec, 5 secs
lola: 12348737 markings, 22978890 edges, 553320 markings/sec, 10 secs
lola: 15705313 markings, 27843997 edges, 671315 markings/sec, 15 secs
lola: 19341232 markings, 33116194 edges, 727184 markings/sec, 20 secs
lola: 21226102 markings, 37613168 edges, 376974 markings/sec, 25 secs
lola: 22619436 markings, 41329514 edges, 278667 markings/sec, 30 secs
lola: SUBRESULT
lola: result: 1000
lola: produced by: state space
lola: The maximum value of the given expression is 1000
lola: ========================================
lola: subprocess 2 will run for 245 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(initialize)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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: 4695184 markings, 7881477 edges, 939037 markings/sec, 0 secs
lola: 9450338 markings, 15879763 edges, 951031 markings/sec, 5 secs
lola: 12458508 markings, 22237082 edges, 601634 markings/sec, 10 secs
lola: 15935287 markings, 27619142 edges, 695356 markings/sec, 15 secs
lola: 19390656 markings, 32965802 edges, 691074 markings/sec, 20 secs
lola: 22781010 markings, 38208802 edges, 678071 markings/sec, 25 secs
lola: 26381627 markings, 43650948 edges, 720123 markings/sec, 30 secs
lola: 28485101 markings, 48824545 edges, 420695 markings/sec, 35 secs
lola: 29458242 markings, 52555576 edges, 194628 markings/sec, 40 secs
lola: SUBRESULT
lola: result: 1001
lola: produced by: state space
lola: The maximum value of the given expression is 1001
lola: ========================================
lola: subprocess 3 will run for 260 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(off)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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: 4385885 markings, 8204765 edges, 877177 markings/sec, 0 secs
lola: 8831554 markings, 16535955 edges, 889134 markings/sec, 5 secs
lola: 11287308 markings, 23978478 edges, 491151 markings/sec, 10 secs
lola: 14366336 markings, 29353825 edges, 615806 markings/sec, 15 secs
lola: 17537480 markings, 34864119 edges, 634229 markings/sec, 20 secs
lola: 20709048 markings, 40352564 edges, 634314 markings/sec, 25 secs
lola: 23972926 markings, 45966303 edges, 652776 markings/sec, 30 secs
lola: 27017294 markings, 51477345 edges, 608874 markings/sec, 35 secs
lola: 27917827 markings, 55732116 edges, 180107 markings/sec, 40 secs
lola: 28596750 markings, 59601463 edges, 135785 markings/sec, 45 secs
lola: SUBRESULT
lola: result: 1000
lola: produced by: state space
lola: The maximum value of the given expression is 1000
lola: ========================================
lola: subprocess 4 will run for 278 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p_m)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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: 4499902 markings, 7452570 edges, 899980 markings/sec, 0 secs
lola: 9286938 markings, 15386169 edges, 957407 markings/sec, 5 secs
lola: 12109917 markings, 22632872 edges, 564596 markings/sec, 10 secs
lola: 15443851 markings, 27464506 edges, 666787 markings/sec, 15 secs
lola: 19055497 markings, 32701756 edges, 722329 markings/sec, 20 secs
lola: 21127722 markings, 37346740 edges, 414445 markings/sec, 25 secs
lola: 22531968 markings, 41093457 edges, 280849 markings/sec, 30 secs
lola: 23873234 markings, 44674014 edges, 268253 markings/sec, 35 secs
lola: SUBRESULT
lola: result: 1000
lola: produced by: state space
lola: The maximum value of the given expression is 1000
lola: ========================================
lola: subprocess 5 will run for 299 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p_i1)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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: 4397909 markings, 8227076 edges, 879582 markings/sec, 0 secs
lola: 8860898 markings, 16591644 edges, 892598 markings/sec, 5 secs
lola: 11342466 markings, 24074061 edges, 496314 markings/sec, 10 secs
lola: 14470977 markings, 29533903 edges, 625702 markings/sec, 15 secs
lola: 17686476 markings, 35122751 edges, 643100 markings/sec, 20 secs
lola: 20942849 markings, 40754610 edges, 651275 markings/sec, 25 secs
lola: 24263053 markings, 46465036 edges, 664041 markings/sec, 30 secs
lola: 27109920 markings, 51890983 edges, 569373 markings/sec, 35 secs
lola: 28004264 markings, 56183264 edges, 178869 markings/sec, 40 secs
lola: 28671366 markings, 60104439 edges, 133420 markings/sec, 45 secs
lola: SUBRESULT
lola: result: 1001
lola: produced by: state space
lola: The maximum value of the given expression is 1001
lola: subprocess 6 will run for 324 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(access)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: ========================================
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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: 5836323 markings, 7660471 edges, 1167265 markings/sec, 0 secs
lola: 11382546 markings, 14940481 edges, 1109245 markings/sec, 5 secs
lola: 16676113 markings, 21889367 edges, 1058713 markings/sec, 10 secs
lola: 21787129 markings, 28597653 edges, 1022203 markings/sec, 15 secs
lola: SUBRESULT
lola: result: 1000
lola: produced by: state space
lola: The maximum value of the given expression is 1000
lola: ========================================
lola: subprocess 7 will run for 358 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p_i2)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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: 4619083 markings, 7753198 edges, 923817 markings/sec, 0 secs
lola: 9330116 markings, 15677421 edges, 942207 markings/sec, 5 secs
lola: 12345646 markings, 22063279 edges, 603106 markings/sec, 10 secs
lola: 15806459 markings, 27420569 edges, 692163 markings/sec, 15 secs
lola: 19262874 markings, 32768345 edges, 691283 markings/sec, 20 secs
lola: 22665109 markings, 38029552 edges, 680447 markings/sec, 25 secs
lola: 26285354 markings, 43506257 edges, 724049 markings/sec, 30 secs
lola: 28461691 markings, 48751516 edges, 435267 markings/sec, 35 secs
lola: 29459315 markings, 52557725 edges, 199525 markings/sec, 40 secs
lola: SUBRESULT
lola: result: 1001
lola: produced by: state space
lola: The maximum value of the given expression is 1001
lola: ========================================
lola: subprocess 8 will run for 396 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p_rel)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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: 6528042 markings, 8169116 edges, 1305608 markings/sec, 0 secs
lola: 12005587 markings, 15664037 edges, 1095509 markings/sec, 5 secs
lola: 17083856 markings, 22530688 edges, 1015654 markings/sec, 10 secs
lola: 21538855 markings, 28800695 edges, 891000 markings/sec, 15 secs
lola: 24040557 markings, 33800172 edges, 500340 markings/sec, 20 secs
lola: SUBRESULT
lola: result: 1000
lola: produced by: state space
lola: The maximum value of the given expression is 1000
lola: ========================================
lola: subprocess 9 will run for 449 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p_m)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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: 4784086 markings, 7923523 edges, 956817 markings/sec, 0 secs
lola: 9599875 markings, 15904105 edges, 963158 markings/sec, 5 secs
lola: 12346037 markings, 22975511 edges, 549232 markings/sec, 10 secs
lola: 15721424 markings, 27867793 edges, 675077 markings/sec, 15 secs
lola: 19407673 markings, 33213054 edges, 737250 markings/sec, 20 secs
lola: 21273127 markings, 37733542 edges, 373091 markings/sec, 25 secs
lola: 22667411 markings, 41452586 edges, 278857 markings/sec, 30 secs
lola: SUBRESULT
lola: result: 1000
lola: produced by: state space
lola: The maximum value of the given expression is 1000
lola: ========================================
lola: subprocess 10 will run for 517 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(initialized)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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: 4171195 markings, 6261310 edges, 834239 markings/sec, 0 secs
lola: 8819008 markings, 12608307 edges, 929563 markings/sec, 5 secs
lola: 13108803 markings, 18322042 edges, 857959 markings/sec, 10 secs
lola: 14693833 markings, 22356168 edges, 317006 markings/sec, 15 secs
lola: 18223538 markings, 27249154 edges, 705941 markings/sec, 20 secs
lola: 22208860 markings, 32756265 edges, 797064 markings/sec, 25 secs
lola: 26395300 markings, 38524217 edges, 837288 markings/sec, 30 secs
lola: 29284882 markings, 43352991 edges, 577916 markings/sec, 35 secs
lola: 31469462 markings, 47858557 edges, 436916 markings/sec, 40 secs
lola: SUBRESULT
lola: result: 1000
lola: produced by: state space
lola: The maximum value of the given expression is 1000
lola: ========================================
lola: subprocess 11 will run for 611 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p_rdy)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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: 4214843 markings, 7815975 edges, 842969 markings/sec, 0 secs
lola: 8266847 markings, 15421410 edges, 810401 markings/sec, 5 secs
lola: 12360665 markings, 23175705 edges, 818764 markings/sec, 10 secs
lola: 16421180 markings, 31043679 edges, 812103 markings/sec, 15 secs
lola: 20386324 markings, 39140917 edges, 793029 markings/sec, 20 secs
lola: 24280821 markings, 47198939 edges, 778899 markings/sec, 25 secs
lola: 28141660 markings, 55185006 edges, 772168 markings/sec, 30 secs
lola: 31963483 markings, 63092179 edges, 764365 markings/sec, 35 secs
lola: 35855598 markings, 71144827 edges, 778423 markings/sec, 40 secs
lola: 39557514 markings, 79196567 edges, 740383 markings/sec, 45 secs
lola: 39952800 markings, 84667768 edges, 79057 markings/sec, 50 secs
lola: 40567196 markings, 89595983 edges, 122879 markings/sec, 55 secs
lola: 41229959 markings, 94086714 edges, 132553 markings/sec, 60 secs
lola: 41952934 markings, 98723817 edges, 144595 markings/sec, 65 secs
lola: 45434007 markings, 105847516 edges, 696215 markings/sec, 70 secs
lola: 48904025 markings, 112874202 edges, 694004 markings/sec, 75 secs
lola: 52516630 markings, 120190027 edges, 722521 markings/sec, 80 secs
lola: 55100751 markings, 127162674 edges, 516824 markings/sec, 85 secs
lola: SUBRESULT
lola: result: 1000
lola: produced by: state space
lola: The maximum value of the given expression is 1000
lola: ========================================
lola: subprocess 12 will run for 740 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(off)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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: 4397225 markings, 8225733 edges, 879445 markings/sec, 0 secs
lola: 8859013 markings, 16587945 edges, 892358 markings/sec, 5 secs
lola: 11339250 markings, 24068236 edges, 496047 markings/sec, 10 secs
lola: 14454283 markings, 29506967 edges, 623007 markings/sec, 15 secs
lola: 17672273 markings, 35098299 edges, 643598 markings/sec, 20 secs
lola: 20928187 markings, 40728976 edges, 651183 markings/sec, 25 secs
lola: 24244062 markings, 46433950 edges, 663175 markings/sec, 30 secs
lola: 27109839 markings, 51890484 edges, 573155 markings/sec, 35 secs
lola: 28081446 markings, 56591967 edges, 194321 markings/sec, 40 secs
lola: 28765718 markings, 60770993 edges, 136854 markings/sec, 45 secs
lola: SUBRESULT
lola: result: 1000
lola: produced by: state space
lola: The maximum value of the given expression is 1000
lola: subprocess 13 will run for 969 seconds at most (--localtimelimit=-1)
lola: lola: ================================================================================
lola: ...considering subproblem: MAX(initialize)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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: 4693637 markings, 7878898 edges, 938727 markings/sec, 0 secs
lola: 9448844 markings, 15877185 edges, 951041 markings/sec, 5 secs
lola: 12437025 markings, 22205165 edges, 597636 markings/sec, 10 secs
lola: 15910650 markings, 27581666 edges, 694725 markings/sec, 15 secs
lola: 19393081 markings, 32969551 edges, 696486 markings/sec, 20 secs
lola: 22823679 markings, 38274670 edges, 686120 markings/sec, 25 secs
lola: 26507851 markings, 43840273 edges, 736834 markings/sec, 30 secs
lola: 28642729 markings, 49320236 edges, 426976 markings/sec, 35 secs
lola: 29713141 markings, 54021880 edges, 214082 markings/sec, 40 secs
lola: SUBRESULT
lola: result: 1001
lola: produced by: state space
lola: The maximum value of the given expression is 1001
lola: ========================================
lola: subprocess 14 will run for 1430 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(initialize)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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: 4466660 markings, 7497003 edges, 893332 markings/sec, 0 secs
lola: 8883901 markings, 14926910 edges, 883448 markings/sec, 5 secs
lola: 12121174 markings, 21715252 edges, 647455 markings/sec, 10 secs
lola: 15887138 markings, 27544486 edges, 753193 markings/sec, 15 secs
lola: 19725465 markings, 33483734 edges, 767665 markings/sec, 20 secs
lola: 23607787 markings, 39486090 edges, 776464 markings/sec, 25 secs
lola: 27709011 markings, 45643646 edges, 820245 markings/sec, 30 secs
lola: 29058811 markings, 50793837 edges, 269960 markings/sec, 35 secs
lola: 29875934 markings, 55237407 edges, 163425 markings/sec, 40 secs
lola: SUBRESULT
lola: result: 1001
lola: produced by: state space
lola: The maximum value of the given expression is 1001
lola: ========================================
lola: subprocess 15 will run for 2815 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p_sc)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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: 4133309 markings, 7834455 edges, 826662 markings/sec, 0 secs
lola: 8499259 markings, 16113104 edges, 873190 markings/sec, 5 secs
lola: 11107477 markings, 23657585 edges, 521644 markings/sec, 10 secs
lola: 14550362 markings, 29601182 edges, 688577 markings/sec, 15 secs
lola: 18096134 markings, 35789810 edges, 709154 markings/sec, 20 secs
lola: 21577920 markings, 41969648 edges, 696357 markings/sec, 25 secs
lola: 25164110 markings, 48308182 edges, 717238 markings/sec, 30 secs
lola: 27689508 markings, 54264612 edges, 505080 markings/sec, 35 secs
lola: 28396917 markings, 59041404 edges, 141482 markings/sec, 40 secs
lola: SUBRESULT
lola: result: 1000
lola: produced by: state space
lola: The maximum value of the given expression is 1000
lola: RESULT
lola:
SUMMARY: 1000 1000 1001 1000 1000 1001 1000 1001 1000 1000 1000 1000 1000 1001 1001 1000
lola: ========================================
FORMULA RobotManipulation-PT-00500-UpperBounds-0 1000 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA RobotManipulation-PT-00500-UpperBounds-1 1000 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA RobotManipulation-PT-00500-UpperBounds-2 1001 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA RobotManipulation-PT-00500-UpperBounds-3 1000 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA RobotManipulation-PT-00500-UpperBounds-4 1000 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA RobotManipulation-PT-00500-UpperBounds-5 1001 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA RobotManipulation-PT-00500-UpperBounds-6 1000 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA RobotManipulation-PT-00500-UpperBounds-7 1001 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA RobotManipulation-PT-00500-UpperBounds-8 1000 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA RobotManipulation-PT-00500-UpperBounds-9 1000 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA RobotManipulation-PT-00500-UpperBounds-10 1000 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA RobotManipulation-PT-00500-UpperBounds-11 1000 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA RobotManipulation-PT-00500-UpperBounds-12 1000 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA RobotManipulation-PT-00500-UpperBounds-13 1001 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA RobotManipulation-PT-00500-UpperBounds-14 1001 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA RobotManipulation-PT-00500-UpperBounds-15 1000 TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
BK_STOP 1496344809063
--------------------
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="RobotManipulation-PT-00500"
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/RobotManipulation-PT-00500.tgz
mv RobotManipulation-PT-00500 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 RobotManipulation-PT-00500, 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 r208-smll-149581172800263"
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 ;