Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-3253
Executing tool lola
Input is S_TriangularGrid-PT-5020, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r158-ebro-149443464300355
=====================================================================

--------------------
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 TriangularGrid-PT-5020-CTLFireability-0
FORMULA_NAME TriangularGrid-PT-5020-CTLFireability-1
FORMULA_NAME TriangularGrid-PT-5020-CTLFireability-10
FORMULA_NAME TriangularGrid-PT-5020-CTLFireability-11
FORMULA_NAME TriangularGrid-PT-5020-CTLFireability-12
FORMULA_NAME TriangularGrid-PT-5020-CTLFireability-13
FORMULA_NAME TriangularGrid-PT-5020-CTLFireability-14
FORMULA_NAME TriangularGrid-PT-5020-CTLFireability-15
FORMULA_NAME TriangularGrid-PT-5020-CTLFireability-2
FORMULA_NAME TriangularGrid-PT-5020-CTLFireability-3
FORMULA_NAME TriangularGrid-PT-5020-CTLFireability-4
FORMULA_NAME TriangularGrid-PT-5020-CTLFireability-5
FORMULA_NAME TriangularGrid-PT-5020-CTLFireability-6
FORMULA_NAME TriangularGrid-PT-5020-CTLFireability-7
FORMULA_NAME TriangularGrid-PT-5020-CTLFireability-8
FORMULA_NAME TriangularGrid-PT-5020-CTLFireability-9

=== Now, execution of the tool begins

BK_START 1496575094322


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


checking for too many tokens
===========================================================================================
S_TriangularGrid-PT-5020: translating PT formula CTLFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLFireability @ S_TriangularGrid-PT-5020 @ 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: 520/65536 symbol table entries, 4 collisions
lola: preprocessing...
lola: finding significant places
lola: 280 places, 240 transitions, 164 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 355 transition conflict sets
lola: TASK
lola: reading formula from TriangularGrid-PT-5020-CTLFireability.task
lola: (((E (F (NOT FIREABLE(ti3_1_5_7))) OR A (X (NOT FIREABLE(ti3_2_5_3)))) AND A (F ((FIREABLE(to1_2_1) AND FIREABLE(ti1_2_5_1) AND (FIREABLE(to1_4_7) OR FIREABLE(to2_3_4)))))) AND FIREABLE(to2_5_9)) : A (F (E (((FIREABLE(ti3_1_4_2) AND FIREABLE(ti1_2_3_4)) U NOT FIREABLE(to2_4_6))))) : A (X ((FIREABLE(ti2_1_5_2) OR A (F (FIREABLE(to3_5_7)))))) : E (G (A (F (NOT FIREABLE(to3_2_3))))) : (E ((FIREABLE(to2_4_3) U ((FIREABLE(to2_5_3) AND FIREABLE(ti1_2_3_1)) OR FIREABLE(ti1_2_1_1)))) OR E (G (A ((FIREABLE(ti1_2_3_4) U FIREABLE(ti2_1_5_1)))))) : E (F (NOT(E (F (NOT FIREABLE(ti2_3_5_5)))))) : (E (F (A (X (FIREABLE(ti2_3_5_3))))) AND E (X (A (X (FIREABLE(ti2_3_3_1)))))) : NOT(((FIREABLE(to1_3_3) AND A (F ((FIREABLE(to2_5_2) AND FIREABLE(ti1_2_4_4))))) OR (NOT FIREABLE(ti2_3_5_2) AND (A (G (FIREABLE(ti2_1_4_7))) AND (FIREABLE(ti2_3_3_4) AND FIREABLE(ti1_2_2_3) AND FIREABLE(to3_4_2) AND FIREABLE(to1_2_3)))))) : (((E (X ((FIREABLE(to3_5_4) OR FIREABLE(t_5_0)))) OR (A (X (FIREABLE(to2_5_6))) AND FIREABLE(to3_4_5))) AND E (G ((NOT FIREABLE(ti3_1_4_7) OR NOT FIREABLE(ti3_1_4_3))))) OR FIREABLE(ti2_3_5_6)) : NOT((A (F (((FIREABLE(ti3_2_4_6) OR FIREABLE(ti3_2_5_2)) AND NOT FIREABLE(to1_5_1)))) AND NOT(((FIREABLE(ti2_1_4_4) OR FIREABLE(to3_5_7) OR NOT FIREABLE(ti1_2_4_1)) AND A (X (FIREABLE(ti3_1_4_3))))))) : E (F (E (F ((FIREABLE(ti2_3_5_7) AND FIREABLE(ti2_1_4_5) AND (FIREABLE(ti1_3_3_5) OR FIREABLE(ti1_3_5_3))))))) : (NOT(A (G ((NOT FIREABLE(to3_5_2) AND NOT FIREABLE(ti1_2_5_7))))) AND A (G ((NOT FIREABLE(to1_4_4) OR NOT FIREABLE(ti2_3_3_5) OR FIREABLE(ti2_1_3_2))))) : ((((FIREABLE(t_1_6) OR A (X (FIREABLE(to2_5_4)))) OR A (G ((FIREABLE(ti2_3_3_4) OR FIREABLE(t_6_3))))) OR A ((NOT FIREABLE(ti1_2_5_8) U NOT FIREABLE(ti3_2_5_9)))) AND (A ((FIREABLE(t_6_9) U (FIREABLE(to2_4_7) OR FIREABLE(ti1_3_4_3)))) AND E (X (A (X (FIREABLE(to1_5_8))))))) : NOT((A (F ((FIREABLE(ti3_2_5_6) AND FIREABLE(to3_5_4) AND FIREABLE(ti3_1_4_2)))) OR (E (X (FIREABLE(ti3_1_3_5))) AND (NOT FIREABLE(to3_3_2) AND FIREABLE(to2_5_6))))) : ((A (G ((FIREABLE(ti3_2_5_1) OR FIREABLE(to1_3_3) OR FIREABLE(to1_4_1) OR FIREABLE(ti2_3_4_2)))) OR A (F (FIREABLE(ti1_2_4_7)))) OR ((FIREABLE(to2_2_3) AND A ((FIREABLE(ti2_3_3_4) U FIREABLE(ti3_2_5_3)))) AND NOT(NOT(A (F (FIREABLE(ti1_3_4_5))))))) : ((A (F (A (X (FIREABLE(ti3_2_2_2))))) AND E (F (A (X (FIREABLE(t_1_6)))))) OR NOT(NOT((((FIREABLE(ti3_1_5_3) OR FIREABLE(ti2_1_4_2)) AND FIREABLE(to1_5_3)) AND E (G (FIREABLE(ti1_2_5_5)))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((E (F (NOT FIREABLE(ti3_1_5_7))) OR A (X (NOT FIREABLE(ti3_2_5_3)))) AND A (F ((FIREABLE(to1_2_1) AND FIREABLE(ti1_2_5_1) AND (FIREABLE(to1_4_7) OR FIREABLE(to2_3_4)))))) AND FIREABLE(to2_5_9))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (NOT FIREABLE(ti3_1_5_7)))
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 656 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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((FIREABLE(to1_2_1) AND FIREABLE(ti1_2_5_1) AND (FIREABLE(to1_4_7) OR FIREABLE(to2_3_4)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (FIREABLE(to1_2_1) AND FIREABLE(ti1_2_5_1) AND (FIREABLE(to1_4_7) OR FIREABLE(to2_3_4))))
lola: processed formula length: 99
lola: 2 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5020-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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: SUBRESULT
lola: ========================================
result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (((FIREABLE(ti3_1_4_2) AND FIREABLE(ti1_2_3_4)) U NOT FIREABLE(to2_4_6)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E((FIREABLE(ti3_1_4_2) AND FIREABLE(ti1_2_3_4)) U NOT FIREABLE(to2_4_6)))
lola: processed formula length: 82
lola: 2 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5020-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((FIREABLE(ti2_1_5_2) OR A (F (FIREABLE(to3_5_7))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((FIREABLE(ti2_1_5_2) OR A(TRUE U FIREABLE(to3_5_7))))
lola: processed formula length: 56
lola: 2 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5020-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (F (NOT FIREABLE(to3_2_3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U NOT FIREABLE(to3_2_3)))))
lola: processed formula length: 51
lola: 2 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5020-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E ((FIREABLE(to2_4_3) U ((FIREABLE(to2_5_3) AND FIREABLE(ti1_2_3_1)) OR FIREABLE(ti1_2_1_1)))) OR E (G (A ((FIREABLE(ti1_2_3_4) U FIREABLE(ti2_1_5_1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((FIREABLE(to2_4_3) U ((FIREABLE(to2_5_3) AND FIREABLE(ti1_2_3_1)) OR FIREABLE(ti1_2_1_1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(FIREABLE(to2_4_3) U ((FIREABLE(to2_5_3) AND FIREABLE(ti1_2_3_1)) OR FIREABLE(ti1_2_1_1)))
lola: processed formula length: 92
lola: 1 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5020-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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: lola: result: yes
========================================lola:
The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (NOT(E (F (NOT FIREABLE(ti2_3_5_5))))))
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(ti2_3_5_5))))
lola: processed formula length: 48
lola: 6 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5020-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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: 507172 markings, 2063179 edges, 3689348869717491712 markings/sec, 0 secs
lola: 915538 markings, 3895674 edges, 81673 markings/sec, 5 secs
lola: 1245077 markings, 5579148 edges, 65908 markings/sec, 10 secs
lola: 1661284 markings, 7252979 edges, 83241 markings/sec, 15 secs
lola: 2108279 markings, 9260102 edges, 89399 markings/sec, 20 secs
lola: 2554211 markings, 11324451 edges, 89186 markings/sec, 25 secs
lola: 2933437 markings, 13242746 edges, 75845 markings/sec, 30 secs
lola: 3344378 markings, 15086883 edges, 82188 markings/sec, 35 secs
lola: 3787227 markings, 16965070 edges, 88570 markings/sec, 40 secs
lola: 4134082 markings, 18804362 edges, 69371 markings/sec, 45 secs
lola: 4462985 markings, 20538163 edges, 65781 markings/sec, 50 secs
lola: 4791110 markings, 22298844 edges, 65625 markings/sec, 55 secs
lola: 5135335 markings, 24123143 edges, 68845 markings/sec, 60 secs
lola: 5421188 markings, 25931480 edges, 57171 markings/sec, 65 secs
lola: 5770871 markings, 27696355 edges, 69937 markings/sec, 70 secs
lola: 6129694 markings, 29331603 edges, 71765 markings/sec, 75 secs
lola: 6528969 markings, 30872554 edges, 79855 markings/sec, 80 secs
lola: 6916832 markings, 32401051 edges, 77573 markings/sec, 85 secs
lola: 7201140 markings, 33927690 edges, 56862 markings/sec, 90 secs
lola: 7505660 markings, 35580945 edges, 60904 markings/sec, 95 secs
lola: 7834760 markings, 37263346 edges, 65820 markings/sec, 100 secs
lola: 8159187 markings, 38921307 edges, 64885 markings/sec, 105 secs
lola: 8505232 markings, 40497529 edges, 69209 markings/sec, 110 secs
lola: 8788775 markings, 41866260 edges, 56709 markings/sec, 115 secs
lola: 9061083 markings, 43276533 edges, 54462 markings/sec, 120 secs
lola: 9317865 markings, 44724959 edges, 51356 markings/sec, 125 secs
lola: 9462685 markings, 46046253 edges, 28964 markings/sec, 130 secs
lola: 9638204 markings, 47447781 edges, 35104 markings/sec, 135 secs
lola: 9895133 markings, 49014561 edges, 51386 markings/sec, 140 secs
lola: 10243865 markings, 50684447 edges, 69746 markings/sec, 145 secs
lola: 10677094 markings, 52328330 edges, 86646 markings/sec, 150 secs
lola: 11099996 markings, 54020584 edges, 84580 markings/sec, 155 secs
lola: 11480616 markings, 56014398 edges, 76124 markings/sec, 160 secs
lola: 11845502 markings, 57962786 edges, 72977 markings/sec, 165 secs
lola: 12266942 markings, 59811936 edges, 84288 markings/sec, 170 secs
lola: 12641974 markings, 61268364 edges, 75006 markings/sec, 175 secs
lola: 12954746 markings, 62713889 edges, 62554 markings/sec, 180 secs
lola: 13265980 markings, 64501749 edges, 62247 markings/sec, 185 secs
lola: 13624631 markings, 66399483 edges, 71730 markings/sec, 190 secs
lola: 13960556 markings, 68228758 edges, 67185 markings/sec, 195 secs
lola: 14287383 markings, 69847011 edges, 65365 markings/sec, 200 secs
lola: 14535475 markings, 71209336 edges, 49618 markings/sec, 205 secs
lola: 14682583 markings, 72500531 edges, 29422 markings/sec, 210 secs
lola: 15057367 markings, 74219467 edges, 74957 markings/sec, 215 secs
lola: 15545289 markings, 75918397 edges, 97584 markings/sec, 220 secs
lola: 15937864 markings, 77739191 edges, 78515 markings/sec, 225 secs
lola: 16326487 markings, 79640599 edges, 77725 markings/sec, 230 secs
lola: 16676365 markings, 81427886 edges, 69976 markings/sec, 235 secs
lola: 17015458 markings, 83298106 edges, 67819 markings/sec, 240 secs
lola: 17305503 markings, 85055184 edges, 58009 markings/sec, 245 secs
lola: 17622600 markings, 86775397 edges, 63419 markings/sec, 250 secs
lola: 17923728 markings, 88498977 edges, 60226 markings/sec, 255 secs
lola: 18188686 markings, 90205068 edges, 52992 markings/sec, 260 secs
lola: 18507418 markings, 91814963 edges, 63746 markings/sec, 265 secs
lola: 18777233 markings, 93419774 edges, 53963 markings/sec, 270 secs
lola: 19047476 markings, 95123553 edges, 54049 markings/sec, 275 secs
lola: 19314368 markings, 96693519 edges, 53378 markings/sec, 280 secs
lola: 19622887 markings, 98363787 edges, 61704 markings/sec, 285 secs
lola: 19982439 markings, 100213492 edges, 71910 markings/sec, 290 secs
lola: 20324458 markings, 102043548 edges, 68404 markings/sec, 295 secs
lola: 20625520 markings, 103973128 edges, 60212 markings/sec, 300 secs
lola: 20947802 markings, 105663555 edges, 64456 markings/sec, 305 secs
lola: 21227977 markings, 107443754 edges, 56035 markings/sec, 310 secs
lola: 21490243 markings, 109207230 edges, 52453 markings/sec, 315 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (A (X (FIREABLE(ti2_3_5_3))))) AND E (X (A (X (FIREABLE(ti2_3_3_1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (X (FIREABLE(ti2_3_5_3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U AX(FIREABLE(ti2_3_5_3)))
lola: processed formula length: 33
lola: 2 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5020-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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 7 will run for 357 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (X (FIREABLE(ti2_3_3_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(AX(FIREABLE(ti2_3_3_1)))
lola: processed formula length: 27
lola: 2 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5020-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 7 will run for 357 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((FIREABLE(to1_3_3) AND A (F ((FIREABLE(to2_5_2) AND FIREABLE(ti1_2_4_4))))) OR (NOT FIREABLE(ti2_3_5_2) AND (A (G (FIREABLE(ti2_1_4_7))) AND (FIREABLE(ti2_3_3_4) AND FIREABLE(ti1_2_2_3) AND FIREABLE(to3_4_2) AND FIREABLE(to1_2_3))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 357 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(to1_3_3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(to1_3_3)
lola: processed formula length: 21
lola: 13 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5020-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 8 will run for 402 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((NOT FIREABLE(to2_5_2) OR NOT FIREABLE(ti1_2_4_4))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (FIREABLE(to2_5_2) AND FIREABLE(ti1_2_4_4))))
lola: processed formula length: 58
lola: 15 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5020-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 9 will run for 459 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(ti2_3_5_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(ti2_3_5_2)
lola: processed formula length: 19
lola: 13 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5020-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 536 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (NOT FIREABLE(ti2_1_4_7)))
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 656 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 8 will run for 402 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((E (X ((FIREABLE(to3_5_4) OR FIREABLE(t_5_0)))) OR (A (X (FIREABLE(to2_5_6))) AND FIREABLE(to3_4_5))) AND E (G ((NOT FIREABLE(ti3_1_4_7) OR NOT FIREABLE(ti3_1_4_3))))) OR FIREABLE(ti2_3_5_6))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 402 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((FIREABLE(to3_5_4) OR FIREABLE(t_5_0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((FIREABLE(to3_5_4) OR FIREABLE(t_5_0)))
lola: processed formula length: 43
lola: 1 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5020-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 9 will run for 459 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((NOT FIREABLE(ti3_1_4_7) OR NOT FIREABLE(ti3_1_4_3))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (FIREABLE(ti3_1_4_7) AND FIREABLE(ti3_1_4_3))))
lola: processed formula length: 60
lola: 2 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5020-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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 459 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((A (F (((FIREABLE(ti3_2_4_6) OR FIREABLE(ti3_2_5_2)) AND NOT FIREABLE(to1_5_1)))) AND NOT(((FIREABLE(ti2_1_4_4) OR FIREABLE(to3_5_7) OR NOT FIREABLE(ti1_2_4_1)) AND A (X (FIREABLE(ti3_1_4_3)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 459 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((NOT FIREABLE(ti3_2_4_6) AND NOT FIREABLE(ti3_2_5_2)) OR FIREABLE(to1_5_1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((FIREABLE(ti3_2_4_6) OR FIREABLE(ti3_2_5_2)) AND NOT FIREABLE(to1_5_1))))
lola: processed formula length: 88
lola: 16 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5020-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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 10 will run for 536 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (F ((FIREABLE(ti2_3_5_7) AND FIREABLE(ti2_1_4_5) AND (FIREABLE(ti1_3_3_5) OR FIREABLE(ti1_3_5_3)))))))
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 656 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 11 will run for 643 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(A (G ((NOT FIREABLE(to3_5_2) AND NOT FIREABLE(ti1_2_5_7))))) AND A (G ((NOT FIREABLE(to1_4_4) OR NOT FIREABLE(ti2_3_3_5) OR FIREABLE(ti2_1_3_2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 643 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(to3_5_2) OR FIREABLE(ti1_2_5_7))))
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 656 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 12 will run for 804 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(to1_4_4) OR NOT FIREABLE(ti2_3_3_5) OR FIREABLE(ti2_1_3_2))))
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 656 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 12 will run for 804 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((FIREABLE(t_1_6) OR A (X (FIREABLE(to2_5_4)))) OR A (G ((FIREABLE(ti2_3_3_4) OR FIREABLE(t_6_3))))) OR A ((NOT FIREABLE(ti1_2_5_8) U NOT FIREABLE(ti3_2_5_9)))) AND (A ((FIREABLE(t_6_9) U (FIREABLE(to2_4_7) OR FIREABLE(ti1_3_4_3)))) AND E (X (A (X (FIREABLE(to1_5_8)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 804 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t_1_6)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t_1_6)
lola: processed formula length: 15
lola: 3 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5020-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 13 will run for 1072 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (FIREABLE(to2_5_4)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(FIREABLE(to2_5_4))
lola: processed formula length: 21
lola: 4 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5020-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 14 will run for 1609 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(ti2_3_3_4) OR FIREABLE(t_6_3))))
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 656 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 15 will run for 3218 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((NOT FIREABLE(ti1_2_5_8) U NOT FIREABLE(ti3_2_5_9)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(NOT FIREABLE(ti1_2_5_8) U NOT FIREABLE(ti3_2_5_9))
lola: processed formula length: 52
lola: 4 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5020-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (X (FIREABLE(to1_5_8)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(AX(FIREABLE(to1_5_8)))
lola: processed formula length: 25
lola: 5 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5020-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: lola: SUBRESULT
lola: ======================================== result: no

lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 1072 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((A (F ((FIREABLE(ti3_2_5_6) AND FIREABLE(to3_5_4) AND FIREABLE(ti3_1_4_2)))) OR (E (X (FIREABLE(ti3_1_3_5))) AND (NOT FIREABLE(to3_3_2) AND FIREABLE(to2_5_6)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1072 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((NOT FIREABLE(ti3_2_5_6) OR NOT FIREABLE(to3_5_4) OR NOT FIREABLE(ti3_1_4_2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (FIREABLE(ti3_2_5_6) AND FIREABLE(to3_5_4) AND FIREABLE(ti3_1_4_2))))
lola: processed formula length: 82
lola: 11 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5020-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 14 will run for 1609 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (NOT FIREABLE(ti3_1_3_5)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(NOT FIREABLE(ti3_1_3_5))
lola: processed formula length: 27
lola: 10 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5020-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: SUBRESULT
lola: lola: result: yes========================================

lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 14 will run for 1609 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (G ((FIREABLE(ti3_2_5_1) OR FIREABLE(to1_3_3) OR FIREABLE(to1_4_1) OR FIREABLE(ti2_3_4_2)))) OR A (F (FIREABLE(ti1_2_4_7)))) OR ((FIREABLE(to2_2_3) AND A ((FIREABLE(ti2_3_3_4) U FIREABLE(ti3_2_5_3)))) AND NOT(NOT(A (F (FIREABLE(ti1_3_4_5)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1609 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(ti3_2_5_1) OR FIREABLE(to1_3_3) OR FIREABLE(to1_4_1) OR FIREABLE(ti2_3_4_2))))
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 656 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 15 will run for 3218 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(ti1_2_4_7)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U FIREABLE(ti1_2_4_7))
lola: processed formula length: 29
lola: 9 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5020-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(ti2_3_3_4) U FIREABLE(ti3_2_5_3)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(FIREABLE(ti2_3_3_4) U FIREABLE(ti3_2_5_3))
lola: processed formula length: 44
lola: 9 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5020-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 15 will run for 3218 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (F (A (X (FIREABLE(ti3_2_2_2))))) AND E (F (A (X (FIREABLE(t_1_6)))))) OR NOT(NOT((((FIREABLE(ti3_1_5_3) OR FIREABLE(ti2_1_4_2)) AND FIREABLE(to1_5_3)) AND E (G (FIREABLE(ti1_2_5_5)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3218 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (X (FIREABLE(ti3_2_2_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U AX(FIREABLE(ti3_2_2_2)))
lola: processed formula length: 33
lola: 12 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5020-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (FIREABLE(ti1_2_5_5)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT FIREABLE(ti1_2_5_5)))
lola: processed formula length: 38
lola: 12 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5020-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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: SUBRESULT
lola: lola: result: no
========================================
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no yes unknown no yes yes yes yes no no yes no no
FORMULA TriangularGrid-PT-5020-CTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5020-CTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5020-CTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5020-CTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5020-CTLFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5020-CTLFireability-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5020-CTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5020-CTLFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5020-CTLFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5020-CTLFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5020-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5020-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5020-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5020-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5020-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5020-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496575416255

--------------------
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_TriangularGrid-PT-5020"
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_TriangularGrid-PT-5020.tgz
mv S_TriangularGrid-PT-5020 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3253"
echo " Executing tool lola"
echo " Input is S_TriangularGrid-PT-5020, 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 r158-ebro-149443464300355"
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 ;