fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r038-blw7-149440484700211
Last Updated
June 27, 2017

About the Execution of LoLA for MAPK-PT-320

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15937.970 852092.00 855322.00 585.40 ??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 MAPK-PT-320, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r038-blw7-149440484700211
=====================================================================

--------------------
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 1494630176317


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
CTLFireability @ 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: 2903449 markings, 10096441 edges, 3689348869717491712 markings/sec, 0 secs
lola: 5718019 markings, 19891577 edges, 562914 markings/sec, 5 secs
lola: 8459513 markings, 29424364 edges, 548299 markings/sec, 10 secs
lola: 11192088 markings, 38928607 edges, 546515 markings/sec, 15 secs
lola: 13720003 markings, 47719560 edges, 505583 markings/sec, 20 secs
lola: 16335207 markings, 56814989 edges, 523041 markings/sec, 25 secs
lola: 18692585 markings, 65022892 edges, 471476 markings/sec, 30 secs
lola: 21372314 markings, 74342048 edges, 535946 markings/sec, 35 secs
lola: 23917219 markings, 83192263 edges, 508981 markings/sec, 40 secs
lola: 26361647 markings, 91694634 edges, 488886 markings/sec, 45 secs
lola: 28705696 markings, 99843916 edges, 468810 markings/sec, 50 secs
lola: 31450965 markings, 109390575 edges, 549054 markings/sec, 55 secs
lola: 33784236 markings, 117506250 edges, 466654 markings/sec, 60 secs
lola: 36014104 markings, 125266416 edges, 445974 markings/sec, 65 secs
lola: 38267805 markings, 133107440 edges, 450740 markings/sec, 70 secs
lola: 40501437 markings, 140872509 edges, 446726 markings/sec, 75 secs
lola: 42870207 markings, 149113807 edges, 473754 markings/sec, 80 secs
lola: 44991431 markings, 156494547 edges, 424245 markings/sec, 85 secs
lola: 47461056 markings, 165082714 edges, 493925 markings/sec, 90 secs
lola: 49775025 markings, 173131796 edges, 462794 markings/sec, 95 secs
lola: 52050149 markings, 181045451 edges, 455025 markings/sec, 100 secs
lola: 54360941 markings, 189088425 edges, 462158 markings/sec, 105 secs
lola: 56815116 markings, 197620591 edges, 490835 markings/sec, 110 secs
lola: 58848400 markings, 204693977 edges, 406657 markings/sec, 115 secs
lola: 61115823 markings, 212583542 edges, 453485 markings/sec, 120 secs
lola: 63445603 markings, 220684549 edges, 465956 markings/sec, 125 secs
lola: 65532396 markings, 227949059 edges, 417359 markings/sec, 130 secs
lola: 67861844 markings, 236053114 edges, 465890 markings/sec, 135 secs
lola: 70138666 markings, 243974203 edges, 455364 markings/sec, 140 secs
lola: 72380304 markings, 251776773 edges, 448328 markings/sec, 145 secs
lola: 74564965 markings, 259383012 edges, 436932 markings/sec, 150 secs
lola: 76704205 markings, 266826389 edges, 427848 markings/sec, 155 secs
lola: 79009564 markings, 274844121 edges, 461072 markings/sec, 160 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 224 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 224 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 240 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 280 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: 2947193 markings, 11790466 edges, 3689348869717491712 markings/sec, 0 secs
lola: 5741111 markings, 23024117 edges, 558784 markings/sec, 5 secs
lola: 8660208 markings, 34719734 edges, 583819 markings/sec, 10 secs
lola: 11530521 markings, 46174689 edges, 574063 markings/sec, 15 secs
lola: 14124707 markings, 56780754 edges, 518837 markings/sec, 20 secs
lola: 16695908 markings, 67267712 edges, 514240 markings/sec, 25 secs
lola: 19599812 markings, 78909010 edges, 580781 markings/sec, 30 secs
lola: 22210395 markings, 89496266 edges, 522117 markings/sec, 35 secs
lola: 24801285 markings, 99918682 edges, 518178 markings/sec, 40 secs
lola: 27621044 markings, 111254580 edges, 563952 markings/sec, 45 secs
lola: 30328485 markings, 122141927 edges, 541488 markings/sec, 50 secs
lola: 32926464 markings, 132636532 edges, 519596 markings/sec, 55 secs
lola: 35580794 markings, 143409460 edges, 530866 markings/sec, 60 secs
lola: 37946627 markings, 152932300 edges, 473167 markings/sec, 65 secs
lola: 40552776 markings, 163327322 edges, 521230 markings/sec, 70 secs
lola: 43122176 markings, 173738091 edges, 513880 markings/sec, 75 secs
lola: 45463965 markings, 183177459 edges, 468358 markings/sec, 80 secs
lola: 47859276 markings, 193101095 edges, 479062 markings/sec, 85 secs
lola: 50214882 markings, 202542888 edges, 471121 markings/sec, 90 secs
lola: 52549990 markings, 212215904 edges, 467022 markings/sec, 95 secs
lola: 55178342 markings, 222700409 edges, 525670 markings/sec, 100 secs
lola: 57889353 markings, 233507096 edges, 542202 markings/sec, 105 secs
lola: 60631069 markings, 244531206 edges, 548343 markings/sec, 110 secs
lola: 63455293 markings, 255883803 edges, 564845 markings/sec, 115 secs
lola: 66022950 markings, 266213341 edges, 513531 markings/sec, 120 secs
lola: 68559704 markings, 276332550 edges, 507351 markings/sec, 125 secs
lola: 71378601 markings, 287666226 edges, 563779 markings/sec, 130 secs
lola: 74136601 markings, 298754171 edges, 551600 markings/sec, 135 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: subprocess 2 will run for 230 seconds at most (--localtimelimit=-1)
lola: ========================================
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 230 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 268 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: 2306163 markings, 11415522 edges, 3689348869717491712 markings/sec, 0 secs
lola: 4531614 markings, 22657708 edges, 445090 markings/sec, 5 secs
lola: 7316256 markings, 33929707 edges, 556928 markings/sec, 10 secs
lola: 9499032 markings, 44746158 edges, 436555 markings/sec, 15 secs
lola: 12544441 markings, 56344752 edges, 609082 markings/sec, 20 secs
lola: 15327099 markings, 66600352 edges, 556532 markings/sec, 25 secs
lola: 17194995 markings, 76794103 edges, 373579 markings/sec, 30 secs
lola: 19420153 markings, 88304398 edges, 445032 markings/sec, 35 secs
lola: 21681457 markings, 98690464 edges, 452261 markings/sec, 40 secs
lola: 23792311 markings, 108169645 edges, 422171 markings/sec, 45 secs
lola: 26904521 markings, 119038498 edges, 622442 markings/sec, 50 secs
lola: 29648707 markings, 130091917 edges, 548837 markings/sec, 55 secs
lola: 32352530 markings, 140077433 edges, 540765 markings/sec, 60 secs
lola: 33010172 markings, 149808146 edges, 131528 markings/sec, 65 secs
lola: 35579181 markings, 159819183 edges, 513802 markings/sec, 70 secs
lola: 37779063 markings, 168629990 edges, 439976 markings/sec, 75 secs
lola: 40019171 markings, 178821503 edges, 448022 markings/sec, 80 secs
lola: 42920783 markings, 188954725 edges, 580322 markings/sec, 85 secs
lola: 45450680 markings, 199005485 edges, 505979 markings/sec, 90 secs
lola: 47308119 markings, 208343998 edges, 371488 markings/sec, 95 secs
lola: 49263013 markings, 218820407 edges, 390979 markings/sec, 100 secs
lola: 50941419 markings, 227891545 edges, 335681 markings/sec, 105 secs
lola: 52591957 markings, 237363880 edges, 330108 markings/sec, 110 secs
lola: 54592468 markings, 247994028 edges, 400102 markings/sec, 115 secs
lola: 57219621 markings, 258470175 edges, 525431 markings/sec, 120 secs
lola: 60307262 markings, 269253935 edges, 617528 markings/sec, 125 secs
lola: 63151109 markings, 280775546 edges, 568769 markings/sec, 130 secs
lola: 66095459 markings, 291944680 edges, 588870 markings/sec, 135 secs
lola: 68923245 markings, 302113986 edges, 565557 markings/sec, 140 secs
lola: 69909203 markings, 312841911 edges, 197192 markings/sec, 145 secs
lola: 72584568 markings, 323773715 edges, 535073 markings/sec, 150 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 278 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 235 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 235 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 255 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 278 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 306 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 340 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: subprocess 4 will run for 255 seconds at most (--localtimelimit=-1)
lola: ========================================
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: 2250840 markings, 11064591 edges, 2748697705579544576 markings/sec, 0 secs
lola: 4538712 markings, 22091197 edges, 457574 markings/sec, 5 secs
lola: 6607027 markings, 33251469 edges, 413663 markings/sec, 10 secs
lola: 8282505 markings, 44176368 edges, 335096 markings/sec, 15 secs
lola: 10100138 markings, 54281175 edges, 363527 markings/sec, 20 secs
lola: 12235385 markings, 64678791 edges, 427049 markings/sec, 25 secs
lola: 14172832 markings, 75568610 edges, 387489 markings/sec, 30 secs
lola: 16266566 markings, 86209282 edges, 418747 markings/sec, 35 secs
lola: 17959285 markings, 95729270 edges, 338544 markings/sec, 40 secs
lola: 19681482 markings, 105349755 edges, 344439 markings/sec, 45 secs
lola: 21513514 markings, 115474613 edges, 366406 markings/sec, 50 secs
lola: 23152009 markings, 124233066 edges, 327699 markings/sec, 55 secs
lola: 24858397 markings, 133658404 edges, 341278 markings/sec, 60 secs
lola: 26605279 markings, 143219478 edges, 349376 markings/sec, 65 secs
lola: 28503916 markings, 152878273 edges, 379727 markings/sec, 70 secs
lola: 30397628 markings, 162804854 edges, 378742 markings/sec, 75 secs
lola: 32295054 markings, 172014890 edges, 379485 markings/sec, 80 secs
lola: 34423675 markings, 182000502 edges, 425724 markings/sec, 85 secs
lola: 36133766 markings, 190970688 edges, 342018 markings/sec, 90 secs
lola: 37643213 markings, 200220052 edges, 301889 markings/sec, 95 secs
lola: 39618801 markings, 210542445 edges, 395118 markings/sec, 100 secs
lola: 41380596 markings, 220836521 edges, 352359 markings/sec, 105 secs
lola: 43814399 markings, 230112974 edges, 486761 markings/sec, 110 secs
lola: 45262401 markings, 238988102 edges, 289600 markings/sec, 115 secs
lola: 46189846 markings, 248364614 edges, 185489 markings/sec, 120 secs
lola: 48049678 markings, 257903689 edges, 371966 markings/sec, 125 secs
lola: 49296444 markings, 267080323 edges, 249353 markings/sec, 130 secs
lola: 51521131 markings, 275733691 edges, 444937 markings/sec, 135 secs
lola: 52773878 markings, 286129241 edges, 250549 markings/sec, 140 secs
lola: 54316013 markings, 296096558 edges, 308427 markings/sec, 145 secs
lola: 56426394 markings, 305560209 edges, 422076 markings/sec, 150 secs
lola: 58211802 markings, 314381307 edges, 357082 markings/sec, 155 secs
lola: 59928757 markings, 323343566 edges, 343391 markings/sec, 160 secs
lola: 61357652 markings, 331861164 edges, 285779 markings/sec, 165 secs
lola: 63610412 markings, 341963238 edges, 450552 markings/sec, 170 secs
lola: 65877566 markings, 352826967 edges, 453431 markings/sec, 175 secs
lola: 67498213 markings, 361737966 edges, 324129 markings/sec, 180 secs
lola: 69227078 markings, 370565498 edges, 345773 markings/sec, 185 secs
lola: 70989420 markings, 379767556 edges, 352468 markings/sec, 190 secs
lola: 72837501 markings, 389807545 edges, 369616 markings/sec, 195 secs
lola: 74817016 markings, 400674636 edges, 395903 markings/sec, 200 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 259 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 259 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: ========================================
lola: subprocess 6 will run for 285 seconds at most (--localtimelimit=-1)
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 317 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: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 285 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: 3698789 markings, 9407847 edges, 3689348869717491712 markings/sec, 0 secs
lola: 7608465 markings, 19159637 edges, 781935 markings/sec, 5 secs
lola: 11541776 markings, 28970447 edges, 786662 markings/sec, 10 secs
lola: 15084382 markings, 37806217 edges, 708521 markings/sec, 15 secs
lola: 19050310 markings, 47698366 edges, 793186 markings/sec, 20 secs
lola: 22508784 markings, 56325090 edges, 691695 markings/sec, 25 secs
lola: 26224906 markings, 65594055 edges, 743224 markings/sec, 30 secs
lola: 29872582 markings, 74692280 edges, 729535 markings/sec, 35 secs
lola: 33637863 markings, 84083866 edges, 753056 markings/sec, 40 secs
lola: 37377947 markings, 93412773 edges, 748017 markings/sec, 45 secs
lola: 41287740 markings, 103164997 edges, 781959 markings/sec, 50 secs
lola: 45176796 markings, 112864809 edges, 777811 markings/sec, 55 secs
lola: 49018079 markings, 122446255 edges, 768257 markings/sec, 60 secs
lola: 52353567 markings, 130765459 edges, 667098 markings/sec, 65 secs
lola: 56153712 markings, 140244542 edges, 760029 markings/sec, 70 secs
lola: 60078202 markings, 150032719 edges, 784898 markings/sec, 75 secs
lola: 63813609 markings, 159350382 edges, 747081 markings/sec, 80 secs
lola: 67484024 markings, 168505110 edges, 734083 markings/sec, 85 secs
lola: 71262282 markings, 177928720 edges, 755652 markings/sec, 90 secs
lola: 74845964 markings, 186868152 edges, 716736 markings/sec, 95 secs
lola: 78481897 markings, 195936910 edges, 727187 markings/sec, 100 secs
lola: 82241755 markings, 205314854 edges, 751972 markings/sec, 105 secs
lola: 85911084 markings, 214466837 edges, 733866 markings/sec, 110 secs
lola: 89263358 markings, 222828226 edges, 670455 markings/sec, 115 secs
lola: 92987559 markings, 232117313 edges, 744840 markings/sec, 120 secs
lola: 96805978 markings, 241642342 edges, 763684 markings/sec, 125 secs
lola: 100580048 markings, 251055757 edges, 754814 markings/sec, 130 secs
lola: 104098578 markings, 259831904 edges, 703706 markings/sec, 135 secs
lola: 107730928 markings, 268891910 edges, 726470 markings/sec, 140 secs
lola: 111293595 markings, 277778119 edges, 712533 markings/sec, 145 secs
lola: 115085965 markings, 287237260 edges, 758474 markings/sec, 150 secs
lola: 118808199 markings, 296521530 edges, 744447 markings/sec, 155 secs
lola: 122685425 markings, 306192244 edges, 775445 markings/sec, 160 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 298 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 336 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: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 336 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((NOT FIREABLE(k10) OR NOT FIREABLE(k5))))
lola: ========================================
lola: SUBTASK
lola: 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: SUBRESULT
lola: result: yes
lola: lola: ========================================The Boolean predicate is true.

lola: ========================================
lola: subprocess 9 will run for 384 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 448 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 537 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 672 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 896 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 896 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: SUBRESULT
lola: lola: ========================================
result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 14 will run for 1344 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 2688 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 2688 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 1494631028409

--------------------
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="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/MAPK-PT-320.tgz
mv 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 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 r038-blw7-149440484700211"
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 ;