fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r078-ebro-149441008200076
Last Updated
June 27, 2017

About the Execution of LoLA for Solitaire-PT-EngNC7x7

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2517.690 570475.00 573086.00 142.60 TFTTFF?TT?F?TFTT 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-3253
Executing tool lola
Input is Solitaire-PT-EngNC7x7, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-ebro-149441008200076
=====================================================================


--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Solitaire-PT-EngNC7x7-CTLFireability-0
FORMULA_NAME Solitaire-PT-EngNC7x7-CTLFireability-1
FORMULA_NAME Solitaire-PT-EngNC7x7-CTLFireability-10
FORMULA_NAME Solitaire-PT-EngNC7x7-CTLFireability-11
FORMULA_NAME Solitaire-PT-EngNC7x7-CTLFireability-12
FORMULA_NAME Solitaire-PT-EngNC7x7-CTLFireability-13
FORMULA_NAME Solitaire-PT-EngNC7x7-CTLFireability-14
FORMULA_NAME Solitaire-PT-EngNC7x7-CTLFireability-15
FORMULA_NAME Solitaire-PT-EngNC7x7-CTLFireability-2
FORMULA_NAME Solitaire-PT-EngNC7x7-CTLFireability-3
FORMULA_NAME Solitaire-PT-EngNC7x7-CTLFireability-4
FORMULA_NAME Solitaire-PT-EngNC7x7-CTLFireability-5
FORMULA_NAME Solitaire-PT-EngNC7x7-CTLFireability-6
FORMULA_NAME Solitaire-PT-EngNC7x7-CTLFireability-7
FORMULA_NAME Solitaire-PT-EngNC7x7-CTLFireability-8
FORMULA_NAME Solitaire-PT-EngNC7x7-CTLFireability-9

=== Now, execution of the tool begins

BK_START 1494930367723


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
CTLFireability @ Solitaire-PT-EngNC7x7 @ 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: 142/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 66 places, 76 transitions, 33 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 152 transition conflict sets
lola: TASK
lola: reading formula from Solitaire-PT-EngNC7x7-CTLFireability.task
lola: E ((E ((FIREABLE(right46) U FIREABLE(left36))) U E (G (NOT FIREABLE(down63))))) : A (F (NOT(E (F (NOT FIREABLE(down54)))))) : E (F (E ((NOT FIREABLE(left34) U (FIREABLE(up63) AND FIREABLE(right33)))))) : E ((((NOT FIREABLE(right42) AND NOT FIREABLE(right74)) OR NOT FIREABLE(up34)) U (E (G (FIREABLE(down43))) AND (NOT FIREABLE(left14) AND NOT FIREABLE(down65))))) : (A (F (E (G (FIREABLE(left53))))) AND NOT FIREABLE(down25)) : (E (F (A (G ((FIREABLE(right52) OR FIREABLE(right53)))))) OR FIREABLE(left55)) : NOT(A (F (A (G ((FIREABLE(left74) OR FIREABLE(up47))))))) : NOT(E (X (NOT(A (F (FIREABLE(down53))))))) : E (F ((E (X (FIREABLE(right53))) AND A (F ((FIREABLE(left64) AND FIREABLE(up64))))))) : NOT((A (G (A (F (FIREABLE(down25))))) AND (NOT(A (F (FIREABLE(down23)))) OR (FIREABLE(down41) OR A (G (FIREABLE(right24))))))) : NOT(((E (G ((FIREABLE(right14) AND FIREABLE(left45)))) AND ((FIREABLE(up47) OR FIREABLE(down25)) AND (FIREABLE(right34) OR FIREABLE(up43)) AND ((FIREABLE(up44) AND FIREABLE(right64)) OR FIREABLE(down25)))) OR (FIREABLE(right53) OR (A (F (FIREABLE(left46))) OR FIREABLE(down45))))) : (NOT(A (F (FIREABLE(right42)))) OR (((FIREABLE(down44) AND FIREABLE(left74) AND FIREABLE(down64) AND FIREABLE(up55) AND ((FIREABLE(down46) AND FIREABLE(left44)) OR (FIREABLE(up33) AND FIREABLE(up55)))) AND NOT(E (X (FIREABLE(right45))))) AND A (G ((NOT FIREABLE(right45) OR NOT FIREABLE(right54)))))) : (A (F (((FIREABLE(down35) AND FIREABLE(right34)) OR FIREABLE(down44) OR FIREABLE(left45)))) OR FIREABLE(right24)) : (E ((FIREABLE(up24) U A (F (FIREABLE(left54))))) OR E ((E (X (FIREABLE(left56))) U FIREABLE(left32)))) : NOT(((A (X ((FIREABLE(up55) OR FIREABLE(left36)))) OR (A (F (FIREABLE(left36))) OR (NOT FIREABLE(right32) AND (FIREABLE(right54) OR FIREABLE(up44))))) AND NOT FIREABLE(left33))) : E (G ((NOT FIREABLE(up41) AND (NOT FIREABLE(left35) OR NOT FIREABLE(right24) OR NOT FIREABLE(up43) OR NOT FIREABLE(down34)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((E ((FIREABLE(right46) U FIREABLE(left36))) U E (G (NOT FIREABLE(down63)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(E(FIREABLE(right46) U FIREABLE(left36)) U NOT(A(TRUE U FIREABLE(down63))))
lola: processed formula length: 76
lola: 4 rewrites
lola: formula mentions 0 of 66 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngNC7x7-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (NOT(E (F (NOT FIREABLE(down54))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(E(TRUE U NOT FIREABLE(down54))))
lola: processed formula length: 45
lola: 6 rewrites
lola: formula mentions 0 of 66 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngNC7x7-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E ((NOT FIREABLE(left34) U (FIREABLE(up63) AND FIREABLE(right33))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U E(NOT FIREABLE(left34) U (FIREABLE(up63) AND FIREABLE(right33))))
lola: processed formula length: 74
lola: 2 rewrites
lola: formula mentions 0 of 66 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngNC7x7-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((NOT FIREABLE(right42) AND NOT FIREABLE(right74)) OR NOT FIREABLE(up34)) U (E (G (FIREABLE(down43))) AND (NOT FIREABLE(left14) AND NOT FIREABLE(down65)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((NOT FIREABLE(right42) AND NOT FIREABLE(right74)) OR NOT FIREABLE(up34)) U (NOT(A(TRUE U NOT FIREABLE(down43))) AND (NOT FIREABLE(left14) AND NOT FIREABLE(down65))))
lola: processed formula length: 169
lola: 3 rewrites
lola: formula mentions 0 of 66 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngNC7x7-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 474729 markings, 2736832 edges, 3689348869717491712 markings/sec, 0 secs
lola: 890874 markings, 5333098 edges, 83229 markings/sec, 5 secs
lola: 1276281 markings, 7894096 edges, 77081 markings/sec, 10 secs
lola: 1631449 markings, 10298873 edges, 71034 markings/sec, 15 secs
lola: 2010552 markings, 12798642 edges, 75821 markings/sec, 20 secs
lola: 2348364 markings, 15235641 edges, 67562 markings/sec, 25 secs
lola: 2666167 markings, 17485193 edges, 63561 markings/sec, 30 secs
lola: 2975420 markings, 19771233 edges, 61851 markings/sec, 35 secs
lola: 3328137 markings, 22155311 edges, 70543 markings/sec, 40 secs
lola: 3670839 markings, 24505351 edges, 68540 markings/sec, 45 secs
lola: 4013411 markings, 26887369 edges, 68514 markings/sec, 50 secs
lola: 4362012 markings, 29218182 edges, 69720 markings/sec, 55 secs
lola: 4683463 markings, 31566130 edges, 64290 markings/sec, 60 secs
lola: 4983307 markings, 33831410 edges, 59969 markings/sec, 65 secs
lola: 5278042 markings, 36087268 edges, 58947 markings/sec, 70 secs
lola: 5556203 markings, 38253298 edges, 55632 markings/sec, 75 secs
lola: 5864483 markings, 40498470 edges, 61656 markings/sec, 80 secs
lola: 6189282 markings, 42656088 edges, 64960 markings/sec, 85 secs
lola: 6489905 markings, 44857673 edges, 60125 markings/sec, 90 secs
lola: 6871550 markings, 47052279 edges, 76329 markings/sec, 95 secs
lola: 7157369 markings, 49270498 edges, 57164 markings/sec, 100 secs
lola: 7444155 markings, 51492510 edges, 57357 markings/sec, 105 secs
lola: 7758626 markings, 53713495 edges, 62894 markings/sec, 110 secs
lola: 8016610 markings, 55897057 edges, 51597 markings/sec, 115 secs
lola: 8267623 markings, 58123600 edges, 50203 markings/sec, 120 secs
lola: 8563538 markings, 60292545 edges, 59183 markings/sec, 125 secs
lola: 8839957 markings, 62491578 edges, 55284 markings/sec, 130 secs
lola: 9134381 markings, 64595556 edges, 58885 markings/sec, 135 secs
lola: 9399703 markings, 66739128 edges, 53064 markings/sec, 140 secs
lola: 9688989 markings, 68802056 edges, 57857 markings/sec, 145 secs
lola: 9965600 markings, 70900187 edges, 55322 markings/sec, 150 secs
lola: 10263079 markings, 73031975 edges, 59496 markings/sec, 155 secs
lola: 10549423 markings, 75162698 edges, 57269 markings/sec, 160 secs
lola: 10816663 markings, 77339095 edges, 53448 markings/sec, 165 secs
lola: 11114100 markings, 79420549 edges, 59487 markings/sec, 170 secs
lola: 11366899 markings, 81471729 edges, 50560 markings/sec, 175 secs
lola: 11616159 markings, 83569205 edges, 49852 markings/sec, 180 secs
lola: 11866576 markings, 85614043 edges, 50083 markings/sec, 185 secs
lola: 12100510 markings, 87692919 edges, 46787 markings/sec, 190 secs
lola: 12354471 markings, 89673059 edges, 50792 markings/sec, 195 secs
lola: 12607877 markings, 91692372 edges, 50681 markings/sec, 200 secs
lola: 12883842 markings, 93779385 edges, 55193 markings/sec, 205 secs
lola: 13151052 markings, 95827353 edges, 53442 markings/sec, 210 secs
lola: 13414900 markings, 97966937 edges, 52770 markings/sec, 215 secs
lola: 13679037 markings, 100040235 edges, 52827 markings/sec, 220 secs
lola: 13947866 markings, 102088943 edges, 53766 markings/sec, 225 secs
lola: 14186121 markings, 104074577 edges, 47651 markings/sec, 230 secs
lola: 14439006 markings, 106125266 edges, 50577 markings/sec, 235 secs
lola: 14704060 markings, 108110177 edges, 53011 markings/sec, 240 secs
lola: 14951084 markings, 110211347 edges, 49405 markings/sec, 245 secs
lola: 15204656 markings, 112353530 edges, 50714 markings/sec, 250 secs
lola: 15469245 markings, 114438421 edges, 52918 markings/sec, 255 secs
lola: 15732418 markings, 116429661 edges, 52635 markings/sec, 260 secs
lola: 15988584 markings, 118427799 edges, 51233 markings/sec, 265 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 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (E (G (FIREABLE(left53))))) AND NOT FIREABLE(down25))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (G (FIREABLE(left53)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U NOT FIREABLE(left53))))
lola: processed formula length: 45
lola: 3 rewrites
lola: formula mentions 0 of 66 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngNC7x7-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 297 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (A (G ((FIREABLE(right52) OR FIREABLE(right53)))))) OR FIREABLE(left55))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 297 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((FIREABLE(right52) OR FIREABLE(right53))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U (NOT FIREABLE(right52) AND NOT FIREABLE(right53)))))
lola: processed formula length: 74
lola: 3 rewrites
lola: formula mentions 0 of 66 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngNC7x7-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 539939 markings, 2911924 edges, 105933 markings/sec, 0 secs
lola: 990325 markings, 5587718 edges, 90077 markings/sec, 5 secs
lola: 1425113 markings, 8109702 edges, 86958 markings/sec, 10 secs
lola: 1814188 markings, 10629004 edges, 77815 markings/sec, 15 secs
lola: 2205698 markings, 13179140 edges, 78302 markings/sec, 20 secs
lola: 2570793 markings, 15671905 edges, 73019 markings/sec, 25 secs
lola: 2961709 markings, 18209759 edges, 78183 markings/sec, 30 secs
lola: 3336087 markings, 20760889 edges, 74876 markings/sec, 35 secs
lola: 3686788 markings, 23304944 edges, 70140 markings/sec, 40 secs
lola: 4048452 markings, 25866155 edges, 72333 markings/sec, 45 secs
lola: 4390727 markings, 28357119 edges, 68455 markings/sec, 50 secs
lola: 4717490 markings, 30871707 edges, 65353 markings/sec, 55 secs
lola: 5064981 markings, 33330770 edges, 69498 markings/sec, 60 secs
lola: 5380742 markings, 35777069 edges, 63152 markings/sec, 65 secs
lola: 5709976 markings, 38317529 edges, 65847 markings/sec, 70 secs
lola: 6005933 markings, 40658253 edges, 59191 markings/sec, 75 secs
lola: 6330790 markings, 43026469 edges, 64971 markings/sec, 80 secs
lola: 6702996 markings, 45458595 edges, 74441 markings/sec, 85 secs
lola: 7063335 markings, 47879299 edges, 72068 markings/sec, 90 secs
lola: 7408251 markings, 50255534 edges, 68983 markings/sec, 95 secs
lola: 7753418 markings, 52630656 edges, 69033 markings/sec, 100 secs
lola: 8083847 markings, 54943415 edges, 66086 markings/sec, 105 secs
lola: 8402992 markings, 57218397 edges, 63829 markings/sec, 110 secs
lola: 8737762 markings, 59547531 edges, 66954 markings/sec, 115 secs
lola: 9065284 markings, 61939618 edges, 65504 markings/sec, 120 secs
lola: 9374811 markings, 64206650 edges, 61905 markings/sec, 125 secs
lola: 9753617 markings, 66775006 edges, 75761 markings/sec, 130 secs
lola: 10087451 markings, 69226439 edges, 66767 markings/sec, 135 secs
lola: 10419121 markings, 71631412 edges, 66334 markings/sec, 140 secs
lola: 10716379 markings, 73986218 edges, 59452 markings/sec, 145 secs
lola: 11000146 markings, 76299875 edges, 56753 markings/sec, 150 secs
lola: 11302944 markings, 78570123 edges, 60560 markings/sec, 155 secs
lola: 11586692 markings, 80795242 edges, 56750 markings/sec, 160 secs
lola: 11869394 markings, 83065407 edges, 56540 markings/sec, 165 secs
lola: 12184252 markings, 85451283 edges, 62972 markings/sec, 170 secs
lola: 12487662 markings, 87757597 edges, 60682 markings/sec, 175 secs
lola: 12766998 markings, 90099278 edges, 55867 markings/sec, 180 secs
lola: 13034271 markings, 92326494 edges, 53455 markings/sec, 185 secs
lola: 13311424 markings, 94523655 edges, 55431 markings/sec, 190 secs
lola: 13559696 markings, 96718686 edges, 49654 markings/sec, 195 secs
lola: 13805077 markings, 98856316 edges, 49076 markings/sec, 200 secs
lola: 14055869 markings, 101027014 edges, 50158 markings/sec, 205 secs
lola: 14297164 markings, 103153111 edges, 48259 markings/sec, 210 secs
lola: 14528486 markings, 105239828 edges, 46264 markings/sec, 215 secs
lola: 14861595 markings, 107469431 edges, 66622 markings/sec, 220 secs
lola: 15177915 markings, 109574218 edges, 63264 markings/sec, 225 secs
lola: 15490802 markings, 111726534 edges, 62577 markings/sec, 230 secs
lola: 15783951 markings, 113824835 edges, 58630 markings/sec, 235 secs
lola: 16106635 markings, 116028919 edges, 64537 markings/sec, 240 secs
lola: 16441792 markings, 118323106 edges, 67031 markings/sec, 245 secs
lola: 16755624 markings, 120505583 edges, 62766 markings/sec, 250 secs
lola: 17066863 markings, 122665274 edges, 62248 markings/sec, 255 secs
lola: 17353439 markings, 124849592 edges, 57315 markings/sec, 260 secs
lola: 17649263 markings, 127066679 edges, 59165 markings/sec, 265 secs
lola: 17966652 markings, 129306443 edges, 63478 markings/sec, 270 secs
lola: 18247663 markings, 131471821 edges, 56202 markings/sec, 275 secs
lola: 18528166 markings, 133585478 edges, 56101 markings/sec, 280 secs
lola: 18809082 markings, 135710380 edges, 56183 markings/sec, 285 secs
lola: 19078440 markings, 137773410 edges, 53872 markings/sec, 290 secs
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 297 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F (A (G ((FIREABLE(left74) OR FIREABLE(up47)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U (NOT FIREABLE(left74) AND NOT FIREABLE(up47))))))
lola: processed formula length: 75
lola: 7 rewrites
lola: formula mentions 0 of 66 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngNC7x7-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 7 will run for 330 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (X (NOT(A (F (FIREABLE(down53)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U FIREABLE(down53)))
lola: processed formula length: 30
lola: 10 rewrites
lola: formula mentions 0 of 66 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngNC7x7-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 8 will run for 371 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((E (X (FIREABLE(right53))) AND A (F ((FIREABLE(left64) AND FIREABLE(up64)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (EX(FIREABLE(right53)) AND A(TRUE U (FIREABLE(left64) AND FIREABLE(up64)))))
lola: processed formula length: 85
lola: 3 rewrites
lola: formula mentions 0 of 66 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngNC7x7-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 9 will run for 424 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((A (G (A (F (FIREABLE(down25))))) AND (NOT(A (F (FIREABLE(down23)))) OR (FIREABLE(down41) OR A (G (FIREABLE(right24)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 424 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (G (NOT FIREABLE(down25)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U FIREABLE(down25))))
lola: processed formula length: 41
lola: 21 rewrites
lola: formula mentions 0 of 66 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngNC7x7-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 10 will run for 494 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((E (G ((FIREABLE(right14) AND FIREABLE(left45)))) AND ((FIREABLE(up47) OR FIREABLE(down25)) AND (FIREABLE(right34) OR FIREABLE(up43)) AND ((FIREABLE(up44) AND FIREABLE(right64)) OR FIREABLE(down25)))) OR (FIREABLE(right53) OR (A (F (FIREABLE(left46))) OR FIREABLE(down45)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 494 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((NOT FIREABLE(right14) OR NOT FIREABLE(left45))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (NOT FIREABLE(right14) OR NOT FIREABLE(left45)))
lola: processed formula length: 58
lola: 14 rewrites
lola: formula mentions 0 of 66 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngNC7x7-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 11 will run for 593 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(right53)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(right53)
lola: processed formula length: 21
lola: 13 rewrites
lola: formula mentions 0 of 66 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngNC7x7-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 12 will run for 742 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT FIREABLE(left46)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U FIREABLE(left46)))
lola: processed formula length: 31
lola: 15 rewrites
lola: formula mentions 0 of 66 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngNC7x7-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 13 will run for 989 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(down45)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(down45)
lola: processed formula length: 20
lola: 13 rewrites
lola: formula mentions 0 of 66 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngNC7x7-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: lola: ======================================== SUBRESULT
lola: result: yes

lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 11 will run for 593 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(A (F (FIREABLE(right42)))) OR (((FIREABLE(down44) AND FIREABLE(left74) AND FIREABLE(down64) AND FIREABLE(up55) AND ((FIREABLE(down46) AND FIREABLE(left44)) OR (FIREABLE(up33) AND FIREABLE(up55)))) AND NOT(E (X (FIREABLE(right45))))) AND A (G ((NOT FIREABLE(right45) OR NOT FIREABLE(right54))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 593 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT FIREABLE(right42)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U FIREABLE(right42)))
lola: processed formula length: 32
lola: 9 rewrites
lola: formula mentions 0 of 66 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngNC7x7-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: lola: SUBRESULT
lola: ========================================
result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 12 will run for 742 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (((FIREABLE(down35) AND FIREABLE(right34)) OR FIREABLE(down44) OR FIREABLE(left45)))) OR FIREABLE(right24))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 742 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((FIREABLE(down35) AND FIREABLE(right34)) OR FIREABLE(down44) OR FIREABLE(left45))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((FIREABLE(down35) AND FIREABLE(right34)) OR FIREABLE(down44) OR FIREABLE(left45)))
lola: processed formula length: 94
lola: 1 rewrites
lola: formula mentions 0 of 66 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngNC7x7-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 13 will run for 989 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(right24)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(right24)
lola: processed formula length: 17
lola: 0 rewrites
lola: formula mentions 0 of 66 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngNC7x7-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================lola:
SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 989 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E ((FIREABLE(up24) U A (F (FIREABLE(left54))))) OR E ((E (X (FIREABLE(left56))) U FIREABLE(left32))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 989 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((FIREABLE(up24) U A (F (FIREABLE(left54)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(FIREABLE(up24) U A(TRUE U FIREABLE(left54)))
lola: processed formula length: 46
lola: 2 rewrites
lola: formula mentions 0 of 66 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngNC7x7-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 14 will run for 1484 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((E (X (FIREABLE(left56))) U FIREABLE(left32)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(EX(FIREABLE(left56)) U FIREABLE(left32))
lola: processed formula length: 42
lola: 2 rewrites
lola: formula mentions 0 of 66 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngNC7x7-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: lola: SUBRESULT
lola: ========================================
result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 14 will run for 1484 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((A (X ((FIREABLE(up55) OR FIREABLE(left36)))) OR (A (F (FIREABLE(left36))) OR (NOT FIREABLE(right32) AND (FIREABLE(right54) OR FIREABLE(up44))))) AND NOT FIREABLE(left33)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1484 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((NOT FIREABLE(up55) AND NOT FIREABLE(left36))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((NOT FIREABLE(up55) AND NOT FIREABLE(left36)))
lola: processed formula length: 49
lola: 12 rewrites
lola: formula mentions 0 of 66 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngNC7x7-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 15 will run for 2969 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT FIREABLE(left36)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U FIREABLE(left36)))
lola: processed formula length: 31
lola: 13 rewrites
lola: formula mentions 0 of 66 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngNC7x7-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(left33)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(left33)
lola: processed formula length: 16
lola: 11 rewrites
lola: formula mentions 0 of 66 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngNC7x7-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: lola: ========================================
SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 15 will run for 2969 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((NOT FIREABLE(up41) AND (NOT FIREABLE(left35) OR NOT FIREABLE(right24) OR NOT FIREABLE(up43) OR NOT FIREABLE(down34)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (FIREABLE(up41) OR (FIREABLE(left35) AND FIREABLE(right24) AND FIREABLE(up43) AND FIREABLE(down34)))))
lola: processed formula length: 116
lola: 2 rewrites
lola: formula mentions 0 of 66 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngNC7x7-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes unknown no unknown yes no yes yes yes yes no no unknown yes
FORMULA Solitaire-PT-EngNC7x7-CTLFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngNC7x7-CTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngNC7x7-CTLFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngNC7x7-CTLFireability-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngNC7x7-CTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngNC7x7-CTLFireability-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngNC7x7-CTLFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngNC7x7-CTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngNC7x7-CTLFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngNC7x7-CTLFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngNC7x7-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngNC7x7-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngNC7x7-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngNC7x7-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngNC7x7-CTLFireability-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngNC7x7-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494930938198

--------------------
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="Solitaire-PT-EngNC7x7"
export BK_EXAMINATION="CTLFireability"
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/Solitaire-PT-EngNC7x7.tgz
mv Solitaire-PT-EngNC7x7 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3253"
echo " Executing tool lola"
echo " Input is Solitaire-PT-EngNC7x7, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r078-ebro-149441008200076"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.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 ;