fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r188-blw3-149581034500210
Last Updated
June 27, 2017

About the Execution of LoLA for HexagonalGrid-PT-316

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15947.770 1403604.00 1406029.00 805.20 T?FFTT?TTTTF?TTF 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 HexagonalGrid-PT-316, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r188-blw3-149581034500210
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1496503214863


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


checking for too many tokens
===========================================================================================
HexagonalGrid-PT-316: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ HexagonalGrid-PT-316 @ 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: 1135/65536 symbol table entries, 147 collisions
lola: preprocessing...
lola: finding significant places
lola: 421 places, 714 transitions, 257 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 877 transition conflict sets
lola: TASK
lola: reading formula from HexagonalGrid-PT-316-CTLCardinality.task
lola: (((((pol1_4_2 <= 2) OR (pol3_4_2 <= pol1_4_1)) AND (pi1_2_1 + 1 <= pb1_3_3)) AND (E (F ((po1_1_2 <= pil3_4_1))) AND (pb4_3_1 <= pbl_3_2))) AND A (F (E (G ((pi3_2_2 <= pil2_4_4)))))) : (NOT(A (X (((po2_4_2 <= pol5_4_1) OR (po2_3_2 <= pil1_3_1))))) OR A (G (E (F ((pb4_2_1 <= po3_1_3)))))) : A (X (E (X (((pol3_3_4 <= pbl_1_2) AND (pi2_1_2 <= po2_4_1)))))) : NOT(NOT((E (F ((pbl_4_2 <= pb1_4_3))) OR E (F ((pbl_3_3 <= pi4_5_1)))))) : A (X (E (X (((3 <= po4_5_2) OR (pb6_3_2 <= pol1_1_1)))))) : E (X (A (X (((pb5_4_1 <= pb1_5_2) AND (pb6_3_3 <= pi3_1_1)))))) : E ((((po1_4_1 + 1 <= pb4_2_2) AND (pol1_3_2 + 1 <= pi1_1_2)) U E (F ((2 <= pi3_3_4))))) : (NOT(A (X (((2 <= pil2_4_2) OR (3 <= pi2_4_2))))) AND A (X (E (F ((pil2_5_1 <= pol1_5_2)))))) : E ((E (F ((pb5_1_3 <= pb6_4_1))) U A (G ((1 <= pol3_1_1))))) : ((2 <= pil5_2_1) OR NOT(NOT(A (F ((pb2_2_2 <= po1_1_1)))))) : A (F ((2 <= pb1_5_1))) : ((A (F ((pb1_5_2 <= 0))) OR ((((pbl_3_2 <= pb5_5_3) OR (pi1_4_4 <= po2_5_3)) AND ((pil1_1_1 <= pb6_5_2) OR (2 <= pol3_3_2))) AND E (G ((po1_4_3 <= pil2_3_4))))) AND A (G ((pi3_5_1 <= pil3_3_5)))) : E (G (E (F (((pb3_4_2 <= pb3_4_3) AND (pol1_2_2 <= pol3_5_1)))))) : NOT((((pol3_5_3 + 1 <= pol1_1_2) OR (pol2_2_3 + 1 <= pb3_3_1) OR (pi1_2_1 <= 1)) AND E (F (((pb6_4_2 <= pi2_2_1) AND (3 <= pi3_4_2)))))) : A (G (NOT(A (G ((1 <= pbl_4_3)))))) : E (F ((E (G ((pi1_3_5 <= po3_5_2))) OR E (G ((3 <= pb6_4_1))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((((pol1_4_2 <= 2) OR (pol3_4_2 <= pol1_4_1)) AND (pi1_2_1 + 1 <= pb1_3_3)) AND (E (F ((po1_1_2 <= pil3_4_1))) AND (pb4_3_1 <= pbl_3_2))) AND A (F (E (G ((pi3_2_2 <= pil2_4_4))))))
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: (((pol1_4_2 <= 2) OR (pol3_4_2 <= pol1_4_1)) AND (pi1_2_1 + 1 <= pb1_3_3))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((pol1_4_2 <= 2) OR (pol3_4_2 <= pol1_4_1)) AND (pi1_2_1 + 1 <= pb1_3_3))
lola: processed formula length: 75
lola: 2 rewrites
lola: formula mentions 0 of 421 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-316-CTLCardinality.task
lola: processed formula with 3 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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((po1_1_2 <= pil3_4_1)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1028 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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (pb4_3_1 <= pbl_3_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (pb4_3_1 <= pbl_3_2)
lola: processed formula length: 20
lola: 2 rewrites
lola: formula mentions 0 of 421 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-316-CTLCardinality.task
lola: processed formula with 1 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 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (G ((pi3_2_2 <= pil2_4_4)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U (pil2_4_4 + 1 <= pi3_2_2))))
lola: processed formula length: 50
lola: 5 rewrites
lola: formula mentions 0 of 421 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-316-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1028 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: SUBRESULTlola:
lola: ========================================
result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(A (X (((po2_4_2 <= pol5_4_1) OR (po2_3_2 <= pil1_3_1))))) OR A (G (E (F ((pb4_2_1 <= po3_1_3))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (((pol5_4_1 + 1 <= po2_4_2) AND (pil1_3_1 + 1 <= po2_3_2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(((pol5_4_1 + 1 <= po2_4_2) AND (pil1_3_1 + 1 <= po2_3_2)))
lola: processed formula length: 61
lola: 4 rewrites
lola: formula mentions 0 of 421 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-316-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1028 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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((pb4_2_1 <= po3_1_3)))))
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 (pb4_2_1 <= po3_1_3)))))
lola: processed formula length: 50
lola: 5 rewrites
lola: formula mentions 0 of 421 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-316-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1028 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: 686948 markings, 3457177 edges, 137390 markings/sec, 0 secs
lola: 1145161 markings, 6692790 edges, 91643 markings/sec, 5 secs
lola: 1537604 markings, 9787378 edges, 78489 markings/sec, 10 secs
lola: 2010026 markings, 12599536 edges, 94484 markings/sec, 15 secs
lola: 2547370 markings, 15783205 edges, 107469 markings/sec, 20 secs
lola: 2933516 markings, 18743328 edges, 77229 markings/sec, 25 secs
lola: 3342909 markings, 21655024 edges, 81879 markings/sec, 30 secs
lola: 3730132 markings, 24555111 edges, 77445 markings/sec, 35 secs
lola: 4196423 markings, 27331447 edges, 93258 markings/sec, 40 secs
lola: 4530158 markings, 30184269 edges, 66747 markings/sec, 45 secs
lola: 4853440 markings, 33188554 edges, 64656 markings/sec, 50 secs
lola: 5135693 markings, 35681282 edges, 56451 markings/sec, 55 secs
lola: 5354099 markings, 38338752 edges, 43681 markings/sec, 60 secs
lola: 5598224 markings, 40697221 edges, 48825 markings/sec, 65 secs
lola: 5964360 markings, 43542092 edges, 73227 markings/sec, 70 secs
lola: 6395616 markings, 46349562 edges, 86251 markings/sec, 75 secs
lola: 6769580 markings, 49088092 edges, 74793 markings/sec, 80 secs
lola: 7227328 markings, 51869039 edges, 91550 markings/sec, 85 secs
lola: 7530690 markings, 54629109 edges, 60672 markings/sec, 90 secs
lola: 7801834 markings, 57003937 edges, 54229 markings/sec, 95 secs
lola: 8034636 markings, 59273771 edges, 46560 markings/sec, 100 secs
lola: 8275140 markings, 61548524 edges, 48101 markings/sec, 105 secs
lola: 8682085 markings, 64127676 edges, 81389 markings/sec, 110 secs
lola: 9065444 markings, 66626054 edges, 76672 markings/sec, 115 secs
lola: 9386369 markings, 69136148 edges, 64185 markings/sec, 120 secs
lola: 9606994 markings, 71566865 edges, 44125 markings/sec, 125 secs
lola: 9798928 markings, 73786858 edges, 38387 markings/sec, 130 secs
lola: 10142925 markings, 76158716 edges, 68799 markings/sec, 135 secs
lola: 10527590 markings, 78427324 edges, 76933 markings/sec, 140 secs
lola: 10992079 markings, 81176719 edges, 92898 markings/sec, 145 secs
lola: 11352679 markings, 83426042 edges, 72120 markings/sec, 150 secs
lola: 11678354 markings, 85853064 edges, 65135 markings/sec, 155 secs
lola: 11960852 markings, 87995381 edges, 56500 markings/sec, 160 secs
lola: 12386966 markings, 90643725 edges, 85223 markings/sec, 165 secs
lola: 12771873 markings, 93418185 edges, 76981 markings/sec, 170 secs
lola: 13210422 markings, 96180839 edges, 87710 markings/sec, 175 secs
lola: 13580203 markings, 98959945 edges, 73956 markings/sec, 180 secs
lola: 14037062 markings, 101752612 edges, 91372 markings/sec, 185 secs
lola: 14498280 markings, 104530802 edges, 92244 markings/sec, 190 secs
lola: 14875333 markings, 107157159 edges, 75411 markings/sec, 195 secs
lola: 15239422 markings, 109771390 edges, 72818 markings/sec, 200 secs
lola: 15684996 markings, 112541560 edges, 89115 markings/sec, 205 secs
lola: 15992675 markings, 115227650 edges, 61536 markings/sec, 210 secs
lola: 16293927 markings, 117659938 edges, 60250 markings/sec, 215 secs
lola: 16508120 markings, 119939213 edges, 42839 markings/sec, 220 secs
lola: 16726293 markings, 122247110 edges, 43635 markings/sec, 225 secs
lola: 17142844 markings, 124782609 edges, 83310 markings/sec, 230 secs
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (X (((pol3_3_4 <= pbl_1_2) AND (pi2_1_2 <= po2_4_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(EX(((pol3_3_4 <= pbl_1_2) AND (pi2_1_2 <= po2_4_1))))
lola: processed formula length: 56
lola: 2 rewrites
lola: formula mentions 0 of 421 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-316-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1028 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 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT((E (F ((pbl_4_2 <= pb1_4_3))) OR E (F ((pbl_3_3 <= pi4_5_1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((pbl_4_2 <= pb1_4_3)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1028 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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HexagonalGrid-PT-316-CTLCardinality-3.sara
lola: SUBRESULT
lola: lola: result: yes
state equation: calling and running saralola:
produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (X (((3 <= po4_5_2) OR (pb6_3_2 <= pol1_1_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(EX(((3 <= po4_5_2) OR (pb6_3_2 <= pol1_1_1))))
lola: processed formula length: 50
lola: 2 rewrites
lola: formula mentions 0 of 421 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-316-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1028 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 5 will run for 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (X (((pb5_4_1 <= pb1_5_2) AND (pb6_3_3 <= pi3_1_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(AX(((pb5_4_1 <= pb1_5_2) AND (pb6_3_3 <= pi3_1_1))))
lola: processed formula length: 55
lola: 2 rewrites
lola: formula mentions 0 of 421 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-316-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1028 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 6 will run for 330 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((po1_4_1 + 1 <= pb4_2_2) AND (pol1_3_2 + 1 <= pi1_1_2)) U E (F ((2 <= pi3_3_4)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
sara: try reading problem file HexagonalGrid-PT-316-CTLCardinality-3.sara.
lola: processed formula: E(((po1_4_1 + 1 <= pb4_2_2) AND (pol1_3_2 + 1 <= pi1_1_2)) U E(TRUE U (2 <= pi3_3_4)))
lola: processed formula length: 86
lola: 2 rewrites
lola: formula mentions 0 of 421 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-316-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1028 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).
sara: place or transition ordering is non-deterministic

lola: 769606 markings, 2255484 edges, 3095528478078926848 markings/sec, 0 secs
lola: 1258836 markings, 4114221 edges, 97846 markings/sec, 5 secs
lola: 1719653 markings, 5882693 edges, 92163 markings/sec, 10 secs
lola: 2164170 markings, 7649475 edges, 88903 markings/sec, 15 secs
lola: 2560128 markings, 9385179 edges, 79192 markings/sec, 20 secs
lola: 2775350 markings, 10897105 edges, 43044 markings/sec, 25 secs
lola: 3044439 markings, 12301852 edges, 53818 markings/sec, 30 secs
lola: 3489129 markings, 13956762 edges, 88938 markings/sec, 35 secs
lola: 3795173 markings, 15506054 edges, 61209 markings/sec, 40 secs
lola: 4268273 markings, 17178605 edges, 94620 markings/sec, 45 secs
lola: 4884931 markings, 18445200 edges, 123332 markings/sec, 50 secs
lola: 5425054 markings, 19816391 edges, 108025 markings/sec, 55 secs
lola: 5986454 markings, 21075450 edges, 112280 markings/sec, 60 secs
lola: 6542837 markings, 22475609 edges, 111277 markings/sec, 65 secs
lola: 6829277 markings, 23831775 edges, 57288 markings/sec, 70 secs
lola: 7028081 markings, 25047155 edges, 39761 markings/sec, 75 secs
lola: 7203577 markings, 26240952 edges, 35099 markings/sec, 80 secs
lola: 7357217 markings, 27395862 edges, 30728 markings/sec, 85 secs
lola: 7493941 markings, 28509764 edges, 27345 markings/sec, 90 secs
lola: 7614887 markings, 29570128 edges, 24189 markings/sec, 95 secs
lola: 7728420 markings, 30671200 edges, 22707 markings/sec, 100 secs
lola: 8079824 markings, 32216122 edges, 70281 markings/sec, 105 secs
lola: 8554883 markings, 33888465 edges, 95012 markings/sec, 110 secs
lola: 8992600 markings, 35540402 edges, 87543 markings/sec, 115 secs
lola: 9349425 markings, 37107354 edges, 71365 markings/sec, 120 secs
lola: 9763307 markings, 38751404 edges, 82776 markings/sec, 125 secs
lola: 10037742 markings, 40156931 edges, 54887 markings/sec, 130 secs
lola: 10257897 markings, 41526001 edges, 44031 markings/sec, 135 secs
lola: 10592458 markings, 43048105 edges, 66912 markings/sec, 140 secs
lola: 10871466 markings, 44354224 edges, 55802 markings/sec, 145 secs
lola: 11268178 markings, 45971099 edges, 79342 markings/sec, 150 secs
lola: 11770293 markings, 47301739 edges, 100423 markings/sec, 155 secs
lola: 12321828 markings, 48457056 edges, 110307 markings/sec, 160 secs
lola: 12815833 markings, 49734029 edges, 98801 markings/sec, 165 secs
lola: 13337382 markings, 50916682 edges, 104310 markings/sec, 170 secs
lola: 13850000 markings, 52241080 edges, 102524 markings/sec, 175 secs
lola: 14102722 markings, 53489214 edges, 50544 markings/sec, 180 secs
lola: 14293495 markings, 54652086 edges, 38155 markings/sec, 185 secs
lola: 14462574 markings, 55782112 edges, 33816 markings/sec, 190 secs
lola: 14610706 markings, 56902213 edges, 29626 markings/sec, 195 secs
lola: 14748952 markings, 58006013 edges, 27649 markings/sec, 200 secs
lola: 14874857 markings, 59095657 edges, 25181 markings/sec, 205 secs
lola: 14989146 markings, 60186067 edges, 22858 markings/sec, 210 secs
lola: 15247920 markings, 61443030 edges, 51755 markings/sec, 215 secs
lola: 15574351 markings, 62705893 edges, 65286 markings/sec, 220 secs
lola: 15830770 markings, 63930295 edges, 51284 markings/sec, 225 secs
lola: 16089149 markings, 65062651 edges, 51676 markings/sec, 230 secs
lola: 16503685 markings, 66819067 edges, 82907 markings/sec, 235 secs
lola: 16838375 markings, 68263754 edges, 66938 markings/sec, 240 secs
lola: 17023001 markings, 69759325 edges, 36925 markings/sec, 245 secs
lola: 17443807 markings, 71304986 edges, 84161 markings/sec, 250 secs
lola: 17854279 markings, 72921254 edges, 82094 markings/sec, 255 secs
lola: 18218438 markings, 74396038 edges, 72832 markings/sec, 260 secs
lola: 18560924 markings, 75777447 edges, 68497 markings/sec, 265 secs
lola: 18871520 markings, 77309402 edges, 62119 markings/sec, 270 secs
lola: 19368670 markings, 78761346 edges, 99430 markings/sec, 275 secs
lola: 19896372 markings, 80064578 edges, 105540 markings/sec, 280 secs
lola: 20447280 markings, 81248691 edges, 110182 markings/sec, 285 secs
lola: 20981761 markings, 82451082 edges, 106896 markings/sec, 290 secs
lola: 21510040 markings, 83783096 edges, 105656 markings/sec, 295 secs
lola: 21791651 markings, 85087882 edges, 56322 markings/sec, 300 secs
lola: 21991299 markings, 86305778 edges, 39930 markings/sec, 305 secs
lola: 22165362 markings, 87471853 edges, 34813 markings/sec, 310 secs
lola: 22318110 markings, 88611137 edges, 30550 markings/sec, 315 secs
lola: 22455648 markings, 89734897 edges, 27508 markings/sec, 320 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 330 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(A (X (((2 <= pil2_4_2) OR (3 <= pi2_4_2))))) AND A (X (E (F ((pil2_5_1 <= pol1_5_2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 330 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (((pil2_4_2 <= 1) AND (pi2_4_2 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(((pil2_4_2 <= 1) AND (pi2_4_2 <= 2)))
lola: processed formula length: 40
lola: 4 rewrites
lola: formula mentions 0 of 421 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-316-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1028 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 8 will run for 371 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (F ((pil2_5_1 <= pol1_5_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U (pil2_5_1 <= pol1_5_2)))
lola: processed formula length: 36
lola: 5 rewrites
lola: formula mentions 0 of 421 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-316-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1028 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 8 will run for 371 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((E (F ((pb5_1_3 <= pb6_4_1))) U A (G ((1 <= pol3_1_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(E(TRUE U (pb5_1_3 <= pb6_4_1)) U NOT(E(TRUE U (pol3_1_1 <= 0))))
lola: processed formula length: 66
lola: 4 rewrites
lola: formula mentions 0 of 421 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-316-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1028 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 9 will run for 424 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((2 <= pil5_2_1) OR NOT(NOT(A (F ((pb2_2_2 <= po1_1_1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 424 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (2 <= pil5_2_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= pil5_2_1)
lola: processed formula length: 15
lola: 6 rewrites
lola: formula mentions 0 of 421 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-316-CTLCardinality.task
lola: processed formula with 1 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 495 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((pb2_2_2 <= po1_1_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (pb2_2_2 <= po1_1_1))
lola: processed formula length: 30
lola: 7 rewrites
lola: formula mentions 0 of 421 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-316-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1028 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 10 will run for 495 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= pb1_5_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (2 <= pb1_5_1))
lola: processed formula length: 24
lola: 1 rewrites
lola: formula mentions 0 of 421 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-316-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1028 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 11 will run for 594 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (F ((pb1_5_2 <= 0))) OR ((((pbl_3_2 <= pb5_5_3) OR (pi1_4_4 <= po2_5_3)) AND ((pil1_1_1 <= pb6_5_2) OR (2 <= pol3_3_2))) AND E (G ((po1_4_3 <= pil2_3_4))))) AND A (G ((pi3_5_1 <= pil3_3_5))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 594 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((pb1_5_2 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (pb1_5_2 <= 0))
lola: processed formula length: 24
lola: 1 rewrites
lola: formula mentions 0 of 421 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-316-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1028 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 12 will run for 743 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((pbl_3_2 <= pb5_5_3) OR (pi1_4_4 <= po2_5_3)) AND ((pil1_1_1 <= pb6_5_2) OR (2 <= pol3_3_2)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((pbl_3_2 <= pb5_5_3) OR (pi1_4_4 <= po2_5_3)) AND ((pil1_1_1 <= pb6_5_2) OR (2 <= pol3_3_2)))
lola: processed formula length: 97
lola: 0 rewrites
lola: formula mentions 0 of 421 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-316-CTLCardinality.task
lola: processed formula with 4 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 13 will run for 990 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((po1_4_3 <= pil2_3_4)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (pil2_3_4 + 1 <= po1_4_3)))
lola: processed formula length: 40
lola: 2 rewrites
lola: formula mentions 0 of 421 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-316-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1028 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 1486 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((pi3_5_1 <= pil3_3_5)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1028 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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HexagonalGrid-PT-316-CTLCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file HexagonalGrid-PT-316-CTLCardinality-14.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 12 will run for 743 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (F (((pb3_4_2 <= pb3_4_3) AND (pol1_2_2 <= pol3_5_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U ((pb3_4_2 <= pb3_4_3) AND (pol1_2_2 <= pol3_5_1))))))
lola: processed formula length: 79
lola: 2 rewrites
lola: formula mentions 0 of 421 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-316-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1028 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 13 will run for 990 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((((pol3_5_3 + 1 <= pol1_1_2) OR (pol2_2_3 + 1 <= pb3_3_1) OR (pi1_2_1 <= 1)) AND E (F (((pb6_4_2 <= pi2_2_1) AND (3 <= pi3_4_2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 990 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((pol1_1_2 <= pol3_5_3) AND (pb3_3_1 <= pol2_2_3) AND (2 <= pi1_2_1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((pol1_1_2 <= pol3_5_3) AND (pb3_3_1 <= pol2_2_3) AND (2 <= pi1_2_1))
lola: processed formula length: 69
lola: 5 rewrites
lola: formula mentions 0 of 421 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-316-CTLCardinality.task
lola: processed formula with 3 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 14 will run for 1486 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((pi2_2_1 + 1 <= pb6_4_2) OR (pi3_4_2 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1028 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: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HexagonalGrid-PT-316-CTLCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file HexagonalGrid-PT-316-CTLCardinality-14.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 14 will run for 1486 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT(A (G ((1 <= pbl_4_3))))))
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 (pbl_4_3 <= 0)))))
lola: processed formula length: 44
lola: 5 rewrites
lola: formula mentions 0 of 421 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-316-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1028 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: 753114 markings, 2724771 edges, 3096159597753270272 markings/sec, 0 secs
lola: 1184456 markings, 4933125 edges, 86268 markings/sec, 5 secs
lola: 1620060 markings, 6921349 edges, 87121 markings/sec, 10 secs
lola: 1978165 markings, 8893130 edges, 71621 markings/sec, 15 secs
lola: 2205846 markings, 10557631 edges, 45536 markings/sec, 20 secs
lola: 2548380 markings, 12501922 edges, 68507 markings/sec, 25 secs
lola: 2980098 markings, 14454874 edges, 86344 markings/sec, 30 secs
lola: 3299869 markings, 16177631 edges, 63954 markings/sec, 35 secs
lola: 3671298 markings, 17925244 edges, 74286 markings/sec, 40 secs
lola: 3956883 markings, 19689642 edges, 57117 markings/sec, 45 secs
lola: 4382403 markings, 21575517 edges, 85104 markings/sec, 50 secs
lola: 4921538 markings, 23205816 edges, 107827 markings/sec, 55 secs
lola: 5432209 markings, 24813501 edges, 102134 markings/sec, 60 secs
lola: 5906489 markings, 26493588 edges, 94856 markings/sec, 65 secs
lola: 6379074 markings, 28224304 edges, 94517 markings/sec, 70 secs
lola: 6630285 markings, 29699727 edges, 50242 markings/sec, 75 secs
lola: 6837291 markings, 31099835 edges, 41401 markings/sec, 80 secs
lola: 7013247 markings, 32426324 edges, 35191 markings/sec, 85 secs
lola: 7169288 markings, 33714944 edges, 31208 markings/sec, 90 secs
lola: 7315589 markings, 34987572 edges, 29260 markings/sec, 95 secs
lola: 7448706 markings, 36249028 edges, 26623 markings/sec, 100 secs
lola: 7759016 markings, 37845076 edges, 62062 markings/sec, 105 secs
lola: 8140588 markings, 39229675 edges, 76314 markings/sec, 110 secs
lola: 8482983 markings, 40624739 edges, 68479 markings/sec, 115 secs
lola: 8797053 markings, 42006913 edges, 62814 markings/sec, 120 secs
lola: 9061489 markings, 43465321 edges, 52887 markings/sec, 125 secs
lola: 9322458 markings, 44858622 edges, 52194 markings/sec, 130 secs
lola: 9618088 markings, 46267018 edges, 59126 markings/sec, 135 secs
lola: 9926932 markings, 47892741 edges, 61769 markings/sec, 140 secs
lola: 10224647 markings, 49438310 edges, 59543 markings/sec, 145 secs
lola: 10498992 markings, 50959193 edges, 54869 markings/sec, 150 secs
lola: 10781896 markings, 52548976 edges, 56581 markings/sec, 155 secs
lola: 11071964 markings, 54073634 edges, 58014 markings/sec, 160 secs
lola: 11340996 markings, 55490531 edges, 53806 markings/sec, 165 secs
lola: 11592963 markings, 56889427 edges, 50393 markings/sec, 170 secs
lola: 11835454 markings, 58203496 edges, 48498 markings/sec, 175 secs
lola: 12074844 markings, 59562294 edges, 47878 markings/sec, 180 secs
lola: 12303904 markings, 60894103 edges, 45812 markings/sec, 185 secs
lola: 12543609 markings, 62326337 edges, 47941 markings/sec, 190 secs
lola: 12717719 markings, 63545491 edges, 34822 markings/sec, 195 secs
lola: 12839933 markings, 64898018 edges, 24443 markings/sec, 200 secs
lola: 12866199 markings, 65992561 edges, 5253 markings/sec, 205 secs
lola: 12993386 markings, 67317429 edges, 25437 markings/sec, 210 secs
lola: 13371417 markings, 69129485 edges, 75606 markings/sec, 215 secs
lola: 13672671 markings, 70865342 edges, 60251 markings/sec, 220 secs
lola: 14012982 markings, 72573322 edges, 68062 markings/sec, 225 secs
lola: 14220197 markings, 74103671 edges, 41443 markings/sec, 230 secs
lola: 14571844 markings, 75856309 edges, 70329 markings/sec, 235 secs
lola: 14845813 markings, 77417481 edges, 54794 markings/sec, 240 secs
lola: 15216506 markings, 79229661 edges, 74139 markings/sec, 245 secs
lola: 15541107 markings, 80916698 edges, 64920 markings/sec, 250 secs
lola: 15845262 markings, 82621431 edges, 60831 markings/sec, 255 secs
lola: 16121355 markings, 84216831 edges, 55219 markings/sec, 260 secs
lola: 16409949 markings, 85821274 edges, 57719 markings/sec, 265 secs
lola: 16466478 markings, 87142027 edges, 11306 markings/sec, 270 secs
lola: 16777671 markings, 88716498 edges, 62239 markings/sec, 275 secs
lola: 17008211 markings, 89946103 edges, 46108 markings/sec, 280 secs
lola: 17214152 markings, 91184114 edges, 41188 markings/sec, 285 secs
lola: 17407589 markings, 92422109 edges, 38687 markings/sec, 290 secs
lola: 17588523 markings, 93630541 edges, 36187 markings/sec, 295 secs
lola: 17766937 markings, 94865303 edges, 35683 markings/sec, 300 secs
lola: 17944011 markings, 96112777 edges, 35415 markings/sec, 305 secs
lola: 18116868 markings, 97366395 edges, 34571 markings/sec, 310 secs
lola: 18280245 markings, 98584302 edges, 32675 markings/sec, 315 secs
lola: 18436758 markings, 99824090 edges, 31303 markings/sec, 320 secs
lola: 18555999 markings, 101004056 edges, 23848 markings/sec, 325 secs
lola: 18647179 markings, 102116778 edges, 18236 markings/sec, 330 secs
lola: 18721574 markings, 103190505 edges, 14879 markings/sec, 335 secs
lola: 18849924 markings, 104392595 edges, 25670 markings/sec, 340 secs
lola: 19180267 markings, 105794552 edges, 66069 markings/sec, 345 secs
lola: 19526733 markings, 107185538 edges, 69293 markings/sec, 350 secs
lola: 19876116 markings, 108408330 edges, 69877 markings/sec, 355 secs
lola: 20226233 markings, 109658880 edges, 70023 markings/sec, 360 secs
lola: 20573160 markings, 110916018 edges, 69385 markings/sec, 365 secs
lola: 20923182 markings, 112209233 edges, 70004 markings/sec, 370 secs
lola: 21263911 markings, 113497016 edges, 68146 markings/sec, 375 secs
lola: 21615710 markings, 114855354 edges, 70360 markings/sec, 380 secs
lola: 21865432 markings, 116043564 edges, 49944 markings/sec, 385 secs
lola: 22048870 markings, 117247518 edges, 36688 markings/sec, 390 secs
lola: 22199876 markings, 118363417 edges, 30201 markings/sec, 395 secs
lola: 22341639 markings, 119488588 edges, 28353 markings/sec, 400 secs
lola: 22473156 markings, 120589635 edges, 26303 markings/sec, 405 secs
lola: 22589685 markings, 121659468 edges, 23306 markings/sec, 410 secs
lola: 22693411 markings, 122672172 edges, 20745 markings/sec, 415 secs
lola: 22793179 markings, 123713666 edges, 19954 markings/sec, 420 secs
lola: 22882834 markings, 124726173 edges, 17931 markings/sec, 425 secs
lola: 22964371 markings, 125744313 edges, 16307 markings/sec, 430 secs
lola: 23095310 markings, 126890156 edges, 26188 markings/sec, 435 secs
lola: 23541032 markings, 128907391 edges, 89144 markings/sec, 440 secs
lola: 23906709 markings, 130628669 edges, 73135 markings/sec, 445 secs
lola: 24237608 markings, 132382800 edges, 66180 markings/sec, 450 secs
lola: 24555519 markings, 134055094 edges, 63582 markings/sec, 455 secs
lola: 24715165 markings, 135534330 edges, 31929 markings/sec, 460 secs
lola: 25061016 markings, 137303638 edges, 69170 markings/sec, 465 secs
lola: 25406711 markings, 138977831 edges, 69139 markings/sec, 470 secs
lola: 25769353 markings, 140605815 edges, 72528 markings/sec, 475 secs
lola: 26056553 markings, 142134478 edges, 57440 markings/sec, 480 secs
lola: 26252946 markings, 143526542 edges, 39279 markings/sec, 485 secs
lola: 26627225 markings, 145294151 edges, 74856 markings/sec, 490 secs
lola: 27008232 markings, 146707374 edges, 76201 markings/sec, 495 secs
lola: 27408964 markings, 147925985 edges, 80146 markings/sec, 500 secs
lola: 27813902 markings, 149194770 edges, 80988 markings/sec, 505 secs
lola: 28198485 markings, 150567891 edges, 76917 markings/sec, 510 secs
lola: 28625487 markings, 151989681 edges, 85400 markings/sec, 515 secs
lola: 28965548 markings, 153460510 edges, 68012 markings/sec, 520 secs
lola: 29165199 markings, 154701077 edges, 39930 markings/sec, 525 secs
lola: 29339346 markings, 155886228 edges, 34829 markings/sec, 530 secs
lola: 29490580 markings, 157022314 edges, 30247 markings/sec, 535 secs
lola: 29626127 markings, 158121578 edges, 27109 markings/sec, 540 secs
lola: 29742456 markings, 159130356 edges, 23266 markings/sec, 545 secs
lola: 29861003 markings, 160177183 edges, 23709 markings/sec, 550 secs
lola: 29961511 markings, 161155236 edges, 20102 markings/sec, 555 secs
lola: 30309254 markings, 162878863 edges, 69549 markings/sec, 560 secs
lola: 30632388 markings, 164402279 edges, 64627 markings/sec, 565 secs
lola: 30889795 markings, 165927238 edges, 51481 markings/sec, 570 secs
lola: 31267842 markings, 167886011 edges, 75609 markings/sec, 575 secs
lola: 31575238 markings, 169503976 edges, 61479 markings/sec, 580 secs
lola: 31690088 markings, 170995680 edges, 22970 markings/sec, 585 secs
lola: 32078574 markings, 172738585 edges, 77697 markings/sec, 590 secs
lola: 32460628 markings, 174494529 edges, 76411 markings/sec, 595 secs
lola: 32773459 markings, 176032924 edges, 62566 markings/sec, 600 secs
lola: 33140557 markings, 177820248 edges, 73420 markings/sec, 605 secs
lola: 33618048 markings, 179256059 edges, 95498 markings/sec, 610 secs
lola: 34084311 markings, 180709784 edges, 93253 markings/sec, 615 secs
lola: 34495619 markings, 182166748 edges, 82262 markings/sec, 620 secs
lola: 34898629 markings, 183505337 edges, 80602 markings/sec, 625 secs
lola: 35237759 markings, 184901342 edges, 67826 markings/sec, 630 secs
lola: 35434920 markings, 186077542 edges, 39432 markings/sec, 635 secs
lola: 35607581 markings, 187245678 edges, 34532 markings/sec, 640 secs
lola: 35765154 markings, 188393956 edges, 31515 markings/sec, 645 secs
lola: 35892558 markings, 189395777 edges, 25481 markings/sec, 650 secs
lola: 36009994 markings, 190382903 edges, 23487 markings/sec, 655 secs
lola: 36136581 markings, 191497670 edges, 25317 markings/sec, 660 secs
lola: 36244938 markings, 192524614 edges, 21671 markings/sec, 665 secs
lola: 36484659 markings, 193829007 edges, 47944 markings/sec, 670 secs
lola: 36817268 markings, 195097986 edges, 66522 markings/sec, 675 secs
lola: 37118178 markings, 196269884 edges, 60182 markings/sec, 680 secs
lola: 37413466 markings, 197515621 edges, 59058 markings/sec, 685 secs
lola: 37656522 markings, 198810369 edges, 48611 markings/sec, 690 secs
lola: 37889429 markings, 200056543 edges, 46581 markings/sec, 695 secs
lola: 38128004 markings, 201314424 edges, 47715 markings/sec, 700 secs
lola: 38418205 markings, 202714930 edges, 58040 markings/sec, 705 secs
lola: 38681359 markings, 204068949 edges, 52631 markings/sec, 710 secs
lola: 38945119 markings, 205471297 edges, 52752 markings/sec, 715 secs
lola: 39176980 markings, 206748139 edges, 46372 markings/sec, 720 secs
lola: 39426136 markings, 208143021 edges, 49831 markings/sec, 725 secs
lola: 39689034 markings, 209520813 edges, 52580 markings/sec, 730 secs
lola: 39916422 markings, 210722524 edges, 45478 markings/sec, 735 secs
lola: 40130841 markings, 211893143 edges, 42884 markings/sec, 740 secs
lola: 40360617 markings, 213134423 edges, 45955 markings/sec, 745 secs
lola: 40564003 markings, 214267971 edges, 40677 markings/sec, 750 secs
lola: 40773960 markings, 215445838 edges, 41991 markings/sec, 755 secs
lola: 40991695 markings, 216724291 edges, 43547 markings/sec, 760 secs
lola: 41198620 markings, 217974956 edges, 41385 markings/sec, 765 secs
lola: 41358969 markings, 219083806 edges, 32070 markings/sec, 770 secs
lola: 41481288 markings, 220291638 edges, 24464 markings/sec, 775 secs
lola: 41507948 markings, 221324837 edges, 5332 markings/sec, 780 secs
lola: 41526866 markings, 222188702 edges, 3784 markings/sec, 785 secs
lola: 41783389 markings, 223534859 edges, 51305 markings/sec, 790 secs
lola: 42006328 markings, 224816089 edges, 44588 markings/sec, 795 secs
lola: 42237750 markings, 226029454 edges, 46284 markings/sec, 800 secs
lola: 42543495 markings, 227677029 edges, 61149 markings/sec, 805 secs
lola: 42840680 markings, 229032345 edges, 59437 markings/sec, 810 secs
lola: 43033291 markings, 230244615 edges, 38522 markings/sec, 815 secs
lola: 43238572 markings, 231428853 edges, 41056 markings/sec, 820 secs
lola: 43474124 markings, 232760413 edges, 47110 markings/sec, 825 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 2137 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((E (G ((pi1_3_5 <= po3_5_2))) OR E (G ((3 <= pb6_4_1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2137 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((pi1_3_5 <= po3_5_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U (po3_5_2 + 1 <= pi1_3_5))))
lola: processed formula length: 49
lola: 4 rewrites
lola: formula mentions 0 of 421 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-316-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1028 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: RESULT
lola: lola:
SUMMARY: yes unknown yes yes yes no unknown yes yes no no no yes yes unknown yes
========================================
lola: ========================================
FORMULA HexagonalGrid-PT-316-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-316-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-316-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-316-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-316-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-316-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-316-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-316-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-316-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-316-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-316-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-316-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-316-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-316-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-316-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-316-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496504618467

--------------------
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="HexagonalGrid-PT-316"
export BK_EXAMINATION="CTLCardinality"
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/HexagonalGrid-PT-316.tgz
mv HexagonalGrid-PT-316 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 HexagonalGrid-PT-316, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r188-blw3-149581034500210"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;