About the Execution of LoLA for S_MAPK-PT-320
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15942.390 | 828283.00 | 830921.00 | 611.10 | ??FTFFTF?T?T?FTF | 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_MAPK-PT-320, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r118-blw7-149441650000211
=====================================================================
--------------------
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 MAPK-PT-320-CTLFireability-0
FORMULA_NAME MAPK-PT-320-CTLFireability-1
FORMULA_NAME MAPK-PT-320-CTLFireability-10
FORMULA_NAME MAPK-PT-320-CTLFireability-11
FORMULA_NAME MAPK-PT-320-CTLFireability-12
FORMULA_NAME MAPK-PT-320-CTLFireability-13
FORMULA_NAME MAPK-PT-320-CTLFireability-14
FORMULA_NAME MAPK-PT-320-CTLFireability-15
FORMULA_NAME MAPK-PT-320-CTLFireability-2
FORMULA_NAME MAPK-PT-320-CTLFireability-3
FORMULA_NAME MAPK-PT-320-CTLFireability-4
FORMULA_NAME MAPK-PT-320-CTLFireability-5
FORMULA_NAME MAPK-PT-320-CTLFireability-6
FORMULA_NAME MAPK-PT-320-CTLFireability-7
FORMULA_NAME MAPK-PT-320-CTLFireability-8
FORMULA_NAME MAPK-PT-320-CTLFireability-9
=== Now, execution of the tool begins
BK_START 1496361682620
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_MAPK-PT-320: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
S_MAPK-PT-320: translating PT formula CTLFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLFireability @ S_MAPK-PT-320 @ 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: 52/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 22 places, 30 transitions, 15 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 25 transition conflict sets
lola: TASK
lola: reading formula from MAPK-PT-320-CTLFireability.task
lola: NOT(E ((NOT FIREABLE(k19) U E (G (FIREABLE(k27)))))) : ((A (F ((FIREABLE(k18) AND NOT FIREABLE(k28)))) OR (FIREABLE(k1) AND E ((FIREABLE(k23) U FIREABLE(k27))))) OR NOT(E (F (A (G (FIREABLE(k22))))))) : (((A ((FIREABLE(k20) U FIREABLE(k27))) OR E (F ((FIREABLE(k13) OR FIREABLE(k29))))) AND A (G (E (F (FIREABLE(k5)))))) AND NOT(((FIREABLE(k4) OR FIREABLE(k17) OR (FIREABLE(k22) AND FIREABLE(k26)) OR (FIREABLE(k29) AND FIREABLE(k11) AND FIREABLE(k23))) AND A ((FIREABLE(k17) U FIREABLE(k7)))))) : ((((NOT FIREABLE(k22) AND NOT FIREABLE(k29) AND FIREABLE(k17)) OR ((NOT FIREABLE(k4) AND NOT FIREABLE(k7)) OR A (G (FIREABLE(k27))))) AND (FIREABLE(k8) AND FIREABLE(k22))) OR ((A ((FIREABLE(k7) U FIREABLE(k2))) OR E (F ((FIREABLE(k27) AND FIREABLE(k15))))) OR E (X (A (X (FIREABLE(k17))))))) : E (F (A (G (((FIREABLE(k7) AND FIREABLE(k3)) OR FIREABLE(k29)))))) : (A (G (((NOT FIREABLE(k29) AND NOT FIREABLE(k9)) OR (FIREABLE(k28))))) OR ((FIREABLE(k28) AND (FIREABLE(k30) OR FIREABLE(k5))) OR E ((NOT FIREABLE(k8) U NOT FIREABLE(k1))))) : E ((NOT(A (F (FIREABLE(k21)))) U A (G (FIREABLE(k4))))) : FIREABLE(k5) : NOT(((E (G ((FIREABLE(k10) AND FIREABLE(k5)))) AND ()) AND A (G (E (F (FIREABLE(k8))))))) : FIREABLE(k9) : E ((A (G (NOT FIREABLE(k29))) U (FIREABLE(k28) AND FIREABLE(k26)))) : E (X (E (G ((NOT FIREABLE(k5) OR NOT FIREABLE(k12)))))) : A ((NOT FIREABLE(k29) U A ((FIREABLE(k20) U FIREABLE(k5))))) : (((A (G ((FIREABLE(k15) AND FIREABLE(k9)))) AND A ((FIREABLE(k28) U FIREABLE(k6)))) AND FIREABLE(k22)) AND FIREABLE(k17)) : NOT FIREABLE(k15) : (FIREABLE(k25) AND A ((FIREABLE(k11) U FIREABLE(k8))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E ((NOT FIREABLE(k19) U E (G (FIREABLE(k27))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(NOT FIREABLE(k19) U NOT(A(TRUE U NOT FIREABLE(k27)))))
lola: processed formula length: 60
lola: 9 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-320-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 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: 3008789 markings, 10462686 edges, 3689348869717491712 markings/sec, 0 secs
lola: 5638671 markings, 19614893 edges, 525976 markings/sec, 5 secs
lola: 8400802 markings, 29219975 edges, 552426 markings/sec, 10 secs
lola: 11163081 markings, 38827328 edges, 552456 markings/sec, 15 secs
lola: 13778039 markings, 47921688 edges, 522992 markings/sec, 20 secs
lola: 16531442 markings, 57499314 edges, 550681 markings/sec, 25 secs
lola: 19015408 markings, 66145110 edges, 496793 markings/sec, 30 secs
lola: 21768508 markings, 75719493 edges, 550620 markings/sec, 35 secs
lola: 24281644 markings, 84461715 edges, 502627 markings/sec, 40 secs
lola: 26799976 markings, 93218554 edges, 503666 markings/sec, 45 secs
lola: 29323992 markings, 101993080 edges, 504803 markings/sec, 50 secs
lola: 31905411 markings, 110970796 edges, 516284 markings/sec, 55 secs
lola: 34179336 markings, 118880053 edges, 454785 markings/sec, 60 secs
lola: 36598108 markings, 127297593 edges, 483754 markings/sec, 65 secs
lola: 38754191 markings, 134797041 edges, 431217 markings/sec, 70 secs
lola: 41239250 markings, 143440335 edges, 497012 markings/sec, 75 secs
lola: 43647569 markings, 151819944 edges, 481664 markings/sec, 80 secs
lola: 46051325 markings, 160179543 edges, 480751 markings/sec, 85 secs
lola: 48570927 markings, 168942266 edges, 503920 markings/sec, 90 secs
lola: 50930917 markings, 177152615 edges, 471998 markings/sec, 95 secs
lola: 53344377 markings, 185553552 edges, 482692 markings/sec, 100 secs
lola: 55934506 markings, 194558752 edges, 518026 markings/sec, 105 secs
lola: 58270748 markings, 202684354 edges, 467248 markings/sec, 110 secs
lola: 60561530 markings, 210652520 edges, 458156 markings/sec, 115 secs
lola: 62978804 markings, 219060478 edges, 483455 markings/sec, 120 secs
lola: 65204086 markings, 226807988 edges, 445056 markings/sec, 125 secs
lola: 67633569 markings, 235259176 edges, 485897 markings/sec, 130 secs
lola: 69990358 markings, 243457463 edges, 471358 markings/sec, 135 secs
lola: 72332729 markings, 251611331 edges, 468474 markings/sec, 140 secs
lola: 74604095 markings, 259519026 edges, 454273 markings/sec, 145 secs
lola: 76829668 markings, 267263278 edges, 445115 markings/sec, 150 secs
lola: 79190854 markings, 275473919 edges, 472237 markings/sec, 155 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 225 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (F ((FIREABLE(k18) AND NOT FIREABLE(k28)))) OR (FIREABLE(k1) AND E ((FIREABLE(k23) U FIREABLE(k27))))) OR NOT(E (F (A (G (FIREABLE(k22)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 225 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((FIREABLE(k18) AND NOT FIREABLE(k28))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (FIREABLE(k18) AND NOT FIREABLE(k28)))
lola: processed formula length: 47
lola: 7 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-320-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 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 2 will run for 241 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(k1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(k1)
lola: processed formula length: 12
lola: 6 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-320-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 3 will run for 259 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((FIREABLE(k23) U FIREABLE(k27)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(FIREABLE(k23) U FIREABLE(k27))
lola: processed formula length: 32
lola: 7 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-320-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 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 4 will run for 281 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (NOT FIREABLE(k22)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U NOT FIREABLE(k22)))))
lola: processed formula length: 47
lola: 8 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-320-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 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: 2791009 markings, 11135114 edges, 3689348869717491712 markings/sec, 0 secs
lola: 5563306 markings, 22315980 edges, 554459 markings/sec, 5 secs
lola: 8510489 markings, 34121757 edges, 589437 markings/sec, 10 secs
lola: 11366823 markings, 45522350 edges, 571267 markings/sec, 15 secs
lola: 14046278 markings, 56467890 edges, 535891 markings/sec, 20 secs
lola: 16651202 markings, 67089706 edges, 520985 markings/sec, 25 secs
lola: 19558551 markings, 78744892 edges, 581470 markings/sec, 30 secs
lola: 22154936 markings, 89274534 edges, 519277 markings/sec, 35 secs
lola: 24864380 markings, 100170024 edges, 541889 markings/sec, 40 secs
lola: 27696998 markings, 111557623 edges, 566524 markings/sec, 45 secs
lola: 30418273 markings, 122500650 edges, 544255 markings/sec, 50 secs
lola: 33019355 markings, 133048401 edges, 520216 markings/sec, 55 secs
lola: 35801159 markings, 144288451 edges, 556361 markings/sec, 60 secs
lola: 38316260 markings, 154408678 edges, 503020 markings/sec, 65 secs
lola: 40938083 markings, 164950758 edges, 524365 markings/sec, 70 secs
lola: 43481000 markings, 175157210 edges, 508583 markings/sec, 75 secs
lola: 45975826 markings, 185328602 edges, 498965 markings/sec, 80 secs
lola: 48546969 markings, 195819236 edges, 514229 markings/sec, 85 secs
lola: 51008437 markings, 205867934 edges, 492294 markings/sec, 90 secs
lola: 53504836 markings, 216024452 edges, 499280 markings/sec, 95 secs
lola: 56140339 markings, 226541168 edges, 527101 markings/sec, 100 secs
lola: 58878185 markings, 237452235 edges, 547569 markings/sec, 105 secs
lola: 61660268 markings, 248723114 edges, 556417 markings/sec, 110 secs
lola: 64372484 markings, 259628092 edges, 542443 markings/sec, 115 secs
lola: 67178540 markings, 270824335 edges, 561211 markings/sec, 120 secs
lola: 69950831 markings, 281884260 edges, 554458 markings/sec, 125 secs
lola: 72793603 markings, 293312224 edges, 568554 markings/sec, 130 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 2 will run for 231 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((A ((FIREABLE(k20) U FIREABLE(k27))) OR E (F ((FIREABLE(k13) OR FIREABLE(k29))))) AND A (G (E (F (FIREABLE(k5)))))) AND NOT(((FIREABLE(k4) OR FIREABLE(k17) OR (FIREABLE(k22) AND FIREABLE(k26)) OR (FIREABLE(k29) AND FIREABLE(k11) AND FIREABLE(k23))) AND A ((FIREABLE(k17) U FIREABLE(k7))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 231 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(k20) U FIREABLE(k27)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(FIREABLE(k20) U FIREABLE(k27))
lola: processed formula length: 32
lola: 8 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-320-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 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 3 will run for 248 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(k13) OR FIREABLE(k29))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 4 will run for 269 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (FIREABLE(k5)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U FIREABLE(k5)))))
lola: processed formula length: 42
lola: 9 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-320-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 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: 2225511 markings, 11214319 edges, 3689348869717491712 markings/sec, 0 secs
lola: 4212362 markings, 21543027 edges, 397370 markings/sec, 5 secs
lola: 6783995 markings, 31347908 edges, 514327 markings/sec, 10 secs
lola: 9028260 markings, 42504225 edges, 448853 markings/sec, 15 secs
lola: 11824601 markings, 53830981 edges, 559268 markings/sec, 20 secs
lola: 14653723 markings, 64000791 edges, 565824 markings/sec, 25 secs
lola: 16673580 markings, 74142980 edges, 403971 markings/sec, 30 secs
lola: 18701667 markings, 85690007 edges, 405617 markings/sec, 35 secs
lola: 21308968 markings, 96574758 edges, 521460 markings/sec, 40 secs
lola: 23483794 markings, 107090527 edges, 434965 markings/sec, 45 secs
lola: 26675643 markings, 118239317 edges, 638370 markings/sec, 50 secs
lola: 29416020 markings, 129254231 edges, 548075 markings/sec, 55 secs
lola: 32191790 markings, 139676652 edges, 555154 markings/sec, 60 secs
lola: 33066118 markings, 150004573 edges, 174866 markings/sec, 65 secs
lola: 35993976 markings, 161267831 edges, 585572 markings/sec, 70 secs
lola: 38285868 markings, 171204335 edges, 458378 markings/sec, 75 secs
lola: 40950818 markings, 182074491 edges, 532990 markings/sec, 80 secs
lola: 43981787 markings, 192674271 edges, 606194 markings/sec, 85 secs
lola: 46199976 markings, 202748396 edges, 443638 markings/sec, 90 secs
lola: 48068039 markings, 212536158 edges, 373613 markings/sec, 95 secs
lola: 50000569 markings, 222637970 edges, 386506 markings/sec, 100 secs
lola: 51714264 markings, 232556190 edges, 342739 markings/sec, 105 secs
lola: 53600748 markings, 242425809 edges, 377297 markings/sec, 110 secs
lola: 55613305 markings, 252858198 edges, 402511 markings/sec, 115 secs
lola: 58767684 markings, 263877263 edges, 630876 markings/sec, 120 secs
lola: 61951803 markings, 274997810 edges, 636824 markings/sec, 125 secs
lola: 64678842 markings, 286109108 edges, 545408 markings/sec, 130 secs
lola: 67127659 markings, 297317237 edges, 489763 markings/sec, 135 secs
lola: 69329636 markings, 307573553 edges, 440395 markings/sec, 140 secs
lola: 71705084 markings, 319257621 edges, 475090 markings/sec, 145 secs
lola: 74536257 markings, 330589886 edges, 566235 markings/sec, 150 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 279 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT FIREABLE(k4) AND NOT FIREABLE(k17) AND (NOT FIREABLE(k22) OR NOT FIREABLE(k26)) AND (NOT FIREABLE(k29) OR NOT FIREABLE(k11) OR NOT FIREABLE(k23)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NOT FIREABLE(k4) AND NOT FIREABLE(k17) AND (NOT FIREABLE(k22) OR NOT FIREABLE(k26)) AND (NOT FIREABLE(k29) OR NOT FIREABLE(k11) OR NOT FIREABLE(k23)))
lola: processed formula length: 154
lola: 7 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-320-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: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: subprocess 3 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: lola: ========================================
========================================
lola: ...considering subproblem: ((((NOT FIREABLE(k22) AND NOT FIREABLE(k29) AND FIREABLE(k17)) OR ((NOT FIREABLE(k4) AND NOT FIREABLE(k7)) OR A (G (FIREABLE(k27))))) AND (FIREABLE(k8) AND FIREABLE(k22))) OR ((A ((FIREABLE(k7) U FIREABLE(k2))) OR E (F ((FIREABLE(k27) AND FIREABLE(k15))))) OR E (X (A (X (FIREABLE(k17)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT FIREABLE(k22) AND NOT FIREABLE(k29) AND FIREABLE(k17))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NOT FIREABLE(k22) AND NOT FIREABLE(k29) AND FIREABLE(k17))
lola: processed formula length: 59
lola: 1 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-320-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: subprocess 4 will run for 256 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT FIREABLE(k4) AND NOT FIREABLE(k7))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NOT FIREABLE(k4) AND NOT FIREABLE(k7))
lola: processed formula length: 39
lola: 1 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-320-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 5 will run for 279 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(k8) AND FIREABLE(k22))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(k8) AND FIREABLE(k22))
lola: processed formula length: 32
lola: 1 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-320-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: subprocess 6 will run for 307 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(k7) U FIREABLE(k2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(FIREABLE(k7) U FIREABLE(k2))
lola: processed formula length: 30
lola: 2 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-320-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 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 7 will run for 341 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(k27) AND FIREABLE(k15))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 256 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((FIREABLE(k7) AND FIREABLE(k3)) OR FIREABLE(k29))))))
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(k7) OR NOT FIREABLE(k3)) AND NOT FIREABLE(k29)))))
lola: processed formula length: 88
lola: 3 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-320-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 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: 2345322 markings, 11965707 edges, 2633358660947935232 markings/sec, 0 secs
lola: 4538712 markings, 22993669 edges, 438678 markings/sec, 5 secs
lola: 6607027 markings, 34304054 edges, 413663 markings/sec, 10 secs
lola: 8487482 markings, 45208910 edges, 376091 markings/sec, 15 secs
lola: 10406853 markings, 55698709 edges, 383874 markings/sec, 20 secs
lola: 12637892 markings, 66439137 edges, 446208 markings/sec, 25 secs
lola: 14520652 markings, 77500578 edges, 376552 markings/sec, 30 secs
lola: 16786931 markings, 88929187 edges, 453256 markings/sec, 35 secs
lola: 18649937 markings, 99300730 edges, 372601 markings/sec, 40 secs
lola: 20549359 markings, 109572739 edges, 379884 markings/sec, 45 secs
lola: 22202980 markings, 119336843 edges, 330724 markings/sec, 50 secs
lola: 24288515 markings, 130015280 edges, 417107 markings/sec, 55 secs
lola: 26060021 markings, 139983035 edges, 354301 markings/sec, 60 secs
lola: 27893001 markings, 150178341 edges, 366596 markings/sec, 65 secs
lola: 29873818 markings, 160454980 edges, 396163 markings/sec, 70 secs
lola: 31874285 markings, 170126558 edges, 400093 markings/sec, 75 secs
lola: 34108231 markings, 180238671 edges, 446789 markings/sec, 80 secs
lola: 35853855 markings, 189982655 edges, 349125 markings/sec, 85 secs
lola: 37643213 markings, 200046485 edges, 357872 markings/sec, 90 secs
lola: 39654639 markings, 211038364 edges, 402285 markings/sec, 95 secs
lola: 41555611 markings, 221929942 edges, 380194 markings/sec, 100 secs
lola: 43814399 markings, 232299147 edges, 451758 markings/sec, 105 secs
lola: 46189846 markings, 241715595 edges, 475089 markings/sec, 110 secs
lola: 46737509 markings, 252544755 edges, 109533 markings/sec, 115 secs
lola: 49087354 markings, 261120642 edges, 469969 markings/sec, 120 secs
lola: 50736609 markings, 270671312 edges, 329851 markings/sec, 125 secs
lola: 51521131 markings, 280505630 edges, 156904 markings/sec, 130 secs
lola: 53316293 markings, 290570575 edges, 359032 markings/sec, 135 secs
lola: 55315296 markings, 300578035 edges, 399801 markings/sec, 140 secs
lola: 57545180 markings, 310378171 edges, 445977 markings/sec, 145 secs
lola: 59281138 markings, 320056665 edges, 347192 markings/sec, 150 secs
lola: 61067495 markings, 329625835 edges, 357271 markings/sec, 155 secs
lola: 62905063 markings, 338799325 edges, 367514 markings/sec, 160 secs
lola: 65357166 markings, 349801188 edges, 490421 markings/sec, 165 secs
lola: 67161752 markings, 359880248 edges, 360917 markings/sec, 170 secs
lola: 68850650 markings, 368924656 edges, 337780 markings/sec, 175 secs
lola: 70744446 markings, 378340754 edges, 378759 markings/sec, 180 secs
lola: 72736759 markings, 388311807 edges, 398463 markings/sec, 185 secs
lola: 74624206 markings, 399511846 edges, 377489 markings/sec, 190 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 261 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (((NOT FIREABLE(k29) AND NOT FIREABLE(k9)) OR (FIREABLE(k28))))) OR ((FIREABLE(k28) AND (FIREABLE(k30) OR FIREABLE(k5))) OR E ((NOT FIREABLE(k8) U NOT FIREABLE(k1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 261 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(k29) AND NOT FIREABLE(k9)) OR (FIREABLE(k28)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: subprocess 6 will run for 287 seconds at most (--localtimelimit=-1)
lola: lola: ========================================
========================================
lola: ...considering subproblem: (FIREABLE(k28) AND (FIREABLE(k30) OR FIREABLE(k5)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(k28) AND (FIREABLE(k30) OR FIREABLE(k5)))
lola: processed formula length: 52
lola: 0 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-320-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: subprocess 7 will run for 319 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((NOT FIREABLE(k8) U NOT FIREABLE(k1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(NOT FIREABLE(k8) U NOT FIREABLE(k1))
lola: processed formula length: 38
lola: 1 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-320-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 6 will run for 287 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((NOT(A (F (FIREABLE(k21)))) U A (G (FIREABLE(k4)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(NOT(A(TRUE U FIREABLE(k21))) U NOT(E(TRUE U NOT FIREABLE(k4))))
lola: processed formula length: 65
lola: 8 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-320-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 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: 3794818 markings, 9647367 edges, 3689348869717491712 markings/sec, 0 secs
lola: 7686509 markings, 19354257 edges, 778338 markings/sec, 5 secs
lola: 11634096 markings, 29200655 edges, 789517 markings/sec, 10 secs
lola: 15524984 markings, 38905548 edges, 778178 markings/sec, 15 secs
lola: 19397030 markings, 48563603 edges, 774409 markings/sec, 20 secs
lola: 23213808 markings, 58083404 edges, 763356 markings/sec, 25 secs
lola: 27039132 markings, 67624638 edges, 765065 markings/sec, 30 secs
lola: 30935270 markings, 77342566 edges, 779228 markings/sec, 35 secs
lola: 34793778 markings, 86966651 edges, 771702 markings/sec, 40 secs
lola: 38527591 markings, 96279906 edges, 746763 markings/sec, 45 secs
lola: 42395049 markings, 105926602 edges, 773492 markings/sec, 50 secs
lola: 46186776 markings, 115384358 edges, 758345 markings/sec, 55 secs
lola: 50042465 markings, 125000957 edges, 771138 markings/sec, 60 secs
lola: 53925158 markings, 134685751 edges, 776539 markings/sec, 65 secs
lola: 57711695 markings, 144130001 edges, 757307 markings/sec, 70 secs
lola: 61450756 markings, 153456727 edges, 747812 markings/sec, 75 secs
lola: 65251240 markings, 162935676 edges, 760097 markings/sec, 80 secs
lola: 69079054 markings, 172483903 edges, 765563 markings/sec, 85 secs
lola: 72958534 markings, 182160005 edges, 775896 markings/sec, 90 secs
lola: 76803195 markings, 191749325 edges, 768932 markings/sec, 95 secs
lola: 80713920 markings, 201504491 edges, 782145 markings/sec, 100 secs
lola: 84608838 markings, 211219156 edges, 778984 markings/sec, 105 secs
lola: 88349050 markings, 220548040 edges, 748042 markings/sec, 110 secs
lola: 92234446 markings, 230239065 edges, 777079 markings/sec, 115 secs
lola: 96088021 markings, 239850666 edges, 770715 markings/sec, 120 secs
lola: 99837519 markings, 249203941 edges, 749900 markings/sec, 125 secs
lola: 103686343 markings, 258803781 edges, 769765 markings/sec, 130 secs
lola: 107535273 markings, 268403938 edges, 769786 markings/sec, 135 secs
lola: 111342928 markings, 277901276 edges, 761531 markings/sec, 140 secs
lola: 115176587 markings, 287463372 edges, 766732 markings/sec, 145 secs
lola: 119003438 markings, 297008393 edges, 765370 markings/sec, 150 secs
lola: 122862125 markings, 306632971 edges, 771737 markings/sec, 155 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 301 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(k5)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(k5)
lola: processed formula length: 12
lola: 0 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-320-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: subprocess 8 will run for 339 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((E (G ((FIREABLE(k10) AND FIREABLE(k5)))) AND ()) AND A (G (E (F (FIREABLE(k8)))))))
lola: ========================================
lola: SUBTASK
lola: lola: checking a Boolean combination of formulas
========================================
lola: RUNNING
lola: subprocess 8 will run for 339 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((NOT FIREABLE(k10) OR NOT FIREABLE(k5))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (NOT FIREABLE(k10) OR NOT FIREABLE(k5)))
lola: processed formula length: 50
lola: 12 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-320-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 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 9 will run for 387 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(k9)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(k9)
lola: processed formula length: 12
lola: 0 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-320-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: subprocess 10 will run for 452 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((A (G (NOT FIREABLE(k29))) U (FIREABLE(k28) AND FIREABLE(k26))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(NOT(E(TRUE U FIREABLE(k29))) U (FIREABLE(k28) AND FIREABLE(k26)))
lola: processed formula length: 67
lola: 3 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-320-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 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 11 will run for 542 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (G ((NOT FIREABLE(k5) OR NOT FIREABLE(k12))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(A(TRUE U (FIREABLE(k5) AND FIREABLE(k12)))))
lola: processed formula length: 51
lola: 3 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-320-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 12 will run for 678 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((NOT FIREABLE(k29) U A ((FIREABLE(k20) U FIREABLE(k5)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(NOT FIREABLE(k29) U A(FIREABLE(k20) U FIREABLE(k5)))
lola: processed formula length: 54
lola: 2 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-320-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 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 13 will run for 904 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((A (G ((FIREABLE(k15) AND FIREABLE(k9)))) AND A ((FIREABLE(k28) U FIREABLE(k6)))) AND FIREABLE(k22)) AND FIREABLE(k17))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 904 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(k15) AND FIREABLE(k9))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: lola: SUBRESULT========================================
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 14 will run for 1356 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(k15)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(k15)
lola: processed formula length: 17
lola: 0 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-320-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 15 will run for 2712 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(k25) AND A ((FIREABLE(k11) U FIREABLE(k8))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2712 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(k25)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(k25)
lola: processed formula length: 13
lola: 0 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-320-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: RESULT
lola:
SUMMARY: unknown unknown unknown yes unknown yes unknown no yes no no yes no no yes no
FORMULA MAPK-PT-320-CTLFireability-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-320-CTLFireability-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-320-CTLFireability-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-320-CTLFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-320-CTLFireability-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-320-CTLFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-320-CTLFireability-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-320-CTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-320-CTLFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-320-CTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-320-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-320-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-320-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-320-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-320-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-320-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
BK_STOP 1496362510903
--------------------
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_MAPK-PT-320"
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/S_MAPK-PT-320.tgz
mv S_MAPK-PT-320 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_MAPK-PT-320, 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 r118-blw7-149441650000211"
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 '
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 ;