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-4022, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r158-ebro-149443464300345
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496574169231


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


checking for too many tokens
===========================================================================================
S_TriangularGrid-PT-4022: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ S_TriangularGrid-PT-4022 @ 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: 340/65536 symbol table entries, 1 collisions
lola: preprocessing...
lola: finding significant places
lola: 184 places, 156 transitions, 107 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 232 transition conflict sets
lola: TASK
lola: reading formula from TriangularGrid-PT-4022-CTLCardinality.task
lola: (A (X (E (G ((2 <= pi3_4_3))))) OR E (((2 <= pb1_3_3) U ((3 <= pb3_4_7) AND (pi2_4_3 <= pb1_3_1))))) : NOT(A (F (((pb2_4_5 <= 0) AND (pb1_4_6 + 1 <= pil2_3_1))))) : A (F (A (F ((pb3_4_4 + 1 <= pbl_3_5))))) : ((E (X ((pb2_4_1 <= pil2_2_1))) AND (po1_1_1 <= pol1_4_3)) AND ((A (X ((po2_4_3 <= pi3_4_3))) OR A (F ((3 <= pb1_1_1)))) AND (1 <= pol3_1_1))) : A (F (E (G ((pb3_3_4 + 1 <= pi1_4_3))))) : A (X (A (G (((3 <= pbl_4_7) OR (1 <= pb1_2_3)))))) : A (F ((E (G ((3 <= pi3_4_3))) OR (pil1_2_1 + 1 <= pol3_4_7)))) : (((pi2_4_5 <= pb1_4_2) OR ((((1 <= pb3_4_7) AND (3 <= po2_4_5)) OR (pi3_1_1 <= 1)) OR E (G ((pol3_2_1 <= pb2_1_1))))) AND ((A (G ((1 <= pbl_4_6))) OR A (F ((pb1_4_4 <= pil1_4_7)))) OR A (F (((3 <= pol3_3_1) AND (2 <= pb3_2_2)))))) : A (G (((1 <= pol2_3_1) OR (pi2_2_3 <= pi3_4_7)))) : ((((1 <= po2_1_1) OR (pb1_3_3 <= pol1_4_7)) OR A (X ((3 <= po3_2_3)))) OR ((E (G ((pb2_3_4 <= pbl_4_5))) AND E (F ((pi1_3_1 <= po3_3_1)))) OR E (G ((pb3_4_2 <= 1))))) : E (F (A (G (((pb3_2_3 <= pb1_3_4) AND (pbl_4_5 <= pi2_4_3)))))) : NOT(E (((pi2_3_5 <= 0) U (3 <= pi1_2_1)))) : A (G ((pi1_1_1 <= pb3_3_2))) : ((A (G (((1 <= pi1_4_3) AND (2 <= po2_3_3)))) OR A (X (((pbl_2_3 <= pb3_4_5) OR (pb2_1_1 <= pb2_2_3))))) OR E (F (A (G ((po1_2_3 <= pb3_3_2)))))) : ((A (G (((pol1_4_7 <= pbl_3_1) OR (pi3_4_5 <= pol2_3_1)))) AND (E (X ((po1_2_3 <= pol1_2_3))) OR (((pi1_2_3 <= pol1_3_3) OR (pi3_2_1 <= pbl_2_2)) AND ((3 <= pil1_4_1) OR (2 <= pol3_3_1))))) OR (A (((3 <= pil2_3_3) U (3 <= pol2_4_5))) OR (pil2_2_1 <= po2_2_3))) : A (F (((pil1_4_7 <= pb3_3_4) AND A (G ((2 <= po3_3_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: (A (X (E (G ((2 <= pi3_4_3))))) OR E (((2 <= pb1_3_3) U ((3 <= pb3_4_7) AND (pi2_4_3 <= pb1_3_1)))))
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: A (X (E (G ((2 <= pi3_4_3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(NOT(A(TRUE U (pi3_4_3 <= 1))))
lola: processed formula length: 33
lola: 3 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 428 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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((2 <= pb1_3_3) U ((3 <= pb3_4_7) AND (pi2_4_3 <= pb1_3_1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((2 <= pb1_3_3) U ((3 <= pb3_4_7) AND (pi2_4_3 <= pb1_3_1)))
lola: processed formula length: 61
lola: 1 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 428 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F (((pb2_4_5 <= 0) AND (pb1_4_6 + 1 <= pil2_3_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((pb2_4_5 <= 0) AND (pb1_4_6 + 1 <= pil2_3_1))))
lola: processed formula length: 61
lola: 5 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 428 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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (F ((pb3_4_4 + 1 <= pbl_3_5)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (pb3_4_4 + 1 <= pbl_3_5))
lola: processed formula length: 34
lola: 2 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 428 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((E (X ((pb2_4_1 <= pil2_2_1))) AND (po1_1_1 <= pol1_4_3)) AND ((A (X ((po2_4_3 <= pi3_4_3))) OR A (F ((3 <= pb1_1_1)))) AND (1 <= pol3_1_1)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((pb2_4_1 <= pil2_2_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((pb2_4_1 <= pil2_2_1))
lola: processed formula length: 25
lola: 2 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 428 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 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (po1_1_1 <= pol1_4_3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (po1_1_1 <= pol1_4_3)
lola: processed formula length: 21
lola: 1 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((po2_4_3 <= pi3_4_3)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((po2_4_3 <= pi3_4_3))
lola: processed formula length: 24
lola: 2 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 428 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 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= pb1_1_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (3 <= pb1_1_1))
lola: processed formula length: 24
lola: 2 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 428 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: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (G ((pb3_3_4 + 1 <= pi1_4_3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U (pi1_4_3 <= pb3_3_4))))
lola: processed formula length: 45
lola: 3 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 428 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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (G (((3 <= pbl_4_7) OR (1 <= pb1_2_3))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(NOT(E(TRUE U ((pbl_4_7 <= 2) AND (pb1_2_3 <= 0)))))
lola: processed formula length: 54
lola: 3 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 428 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: 345680 markings, 1810590 edges, 3224912959121653760 markings/sec, 0 secs
lola: 707360 markings, 3636195 edges, 72336 markings/sec, 5 secs
lola: 1074572 markings, 5151357 edges, 73442 markings/sec, 10 secs
lola: 1201995 markings, 6621579 edges, 25485 markings/sec, 15 secs
lola: 1203288 markings, 8077631 edges, 259 markings/sec, 20 secs
lola: 1518236 markings, 9835538 edges, 62990 markings/sec, 25 secs
lola: 1834106 markings, 11512709 edges, 63174 markings/sec, 30 secs
lola: 2202486 markings, 13046824 edges, 73676 markings/sec, 35 secs
lola: 2566200 markings, 14410472 edges, 72743 markings/sec, 40 secs
lola: 2888472 markings, 15723354 edges, 64454 markings/sec, 45 secs
lola: 3170977 markings, 17012176 edges, 56501 markings/sec, 50 secs
lola: 3412012 markings, 18302238 edges, 48207 markings/sec, 55 secs
lola: 3625504 markings, 19620095 edges, 42698 markings/sec, 60 secs
lola: 3697453 markings, 20902024 edges, 14390 markings/sec, 65 secs
lola: 3699885 markings, 22088704 edges, 486 markings/sec, 70 secs
lola: 3701451 markings, 23286640 edges, 313 markings/sec, 75 secs
lola: 3702362 markings, 24498920 edges, 182 markings/sec, 80 secs
lola: 3702979 markings, 25741373 edges, 123 markings/sec, 85 secs
lola: 3703352 markings, 27082246 edges, 75 markings/sec, 90 secs
lola: 3846906 markings, 28710391 edges, 28711 markings/sec, 95 secs
lola: 4125397 markings, 30416992 edges, 55698 markings/sec, 100 secs
lola: 4450659 markings, 32003948 edges, 65052 markings/sec, 105 secs
lola: 4656490 markings, 33552037 edges, 41166 markings/sec, 110 secs
lola: 4923713 markings, 35114555 edges, 53445 markings/sec, 115 secs
lola: 5223683 markings, 36760805 edges, 59994 markings/sec, 120 secs
lola: 5524688 markings, 38260170 edges, 60201 markings/sec, 125 secs
lola: 5846546 markings, 39710157 edges, 64372 markings/sec, 130 secs
lola: 6203096 markings, 41103084 edges, 71310 markings/sec, 135 secs
lola: 6548916 markings, 42387920 edges, 69164 markings/sec, 140 secs
lola: 6877836 markings, 43650126 edges, 65784 markings/sec, 145 secs
lola: 7188299 markings, 44971600 edges, 62093 markings/sec, 150 secs
lola: 7486532 markings, 46210961 edges, 59647 markings/sec, 155 secs
lola: 7778057 markings, 47433456 edges, 58305 markings/sec, 160 secs
lola: 8066135 markings, 48682087 edges, 57616 markings/sec, 165 secs
lola: 8341099 markings, 49916069 edges, 54993 markings/sec, 170 secs
lola: 8599991 markings, 51166895 edges, 51778 markings/sec, 175 secs
lola: 8848727 markings, 52392758 edges, 49747 markings/sec, 180 secs
lola: 9084581 markings, 53621295 edges, 47171 markings/sec, 185 secs
lola: 9310667 markings, 54853701 edges, 45217 markings/sec, 190 secs
lola: 9522595 markings, 56081320 edges, 42386 markings/sec, 195 secs
lola: 9725352 markings, 57319856 edges, 40551 markings/sec, 200 secs
lola: 9916867 markings, 58548642 edges, 38303 markings/sec, 205 secs
lola: 10110178 markings, 59799402 edges, 38662 markings/sec, 210 secs
lola: 10226481 markings, 61049419 edges, 23261 markings/sec, 215 secs
lola: 10230524 markings, 62162426 edges, 809 markings/sec, 220 secs
lola: 10232862 markings, 63279677 edges, 468 markings/sec, 225 secs
lola: 10234651 markings, 64398368 edges, 358 markings/sec, 230 secs
lola: 10236417 markings, 65576676 edges, 353 markings/sec, 235 secs
lola: 10237874 markings, 66741152 edges, 291 markings/sec, 240 secs
lola: 10238957 markings, 67906188 edges, 217 markings/sec, 245 secs
lola: 10239899 markings, 69076691 edges, 188 markings/sec, 250 secs
lola: 10240767 markings, 70251570 edges, 174 markings/sec, 255 secs
lola: 10241496 markings, 71420819 edges, 146 markings/sec, 260 secs
lola: 10242140 markings, 72585270 edges, 129 markings/sec, 265 secs
lola: 10242666 markings, 73763334 edges, 105 markings/sec, 270 secs
lola: 10243108 markings, 74952211 edges, 88 markings/sec, 275 secs
lola: 10243543 markings, 76149442 edges, 87 markings/sec, 280 secs
lola: 10243871 markings, 77339064 edges, 66 markings/sec, 285 secs
lola: 10244114 markings, 78541999 edges, 49 markings/sec, 290 secs
lola: 10244322 markings, 79752202 edges, 42 markings/sec, 295 secs
lola: 10244504 markings, 80972581 edges, 36 markings/sec, 300 secs
lola: 10244620 markings, 82269659 edges, 23 markings/sec, 305 secs
lola: 10460553 markings, 83768590 edges, 43187 markings/sec, 310 secs
lola: 10650415 markings, 85254827 edges, 37972 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: A (F ((E (G ((3 <= pi3_4_3))) OR (pil1_2_1 + 1 <= pol3_4_7))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (NOT(A(TRUE U (pi3_4_3 <= 2))) OR (pil1_2_1 + 1 <= pol3_4_7)))
lola: processed formula length: 71
lola: 3 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 428 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 7 will run for 357 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((pi2_4_5 <= pb1_4_2) OR ((((1 <= pb3_4_7) AND (3 <= po2_4_5)) OR (pi3_1_1 <= 1)) OR E (G ((pol3_2_1 <= pb2_1_1))))) AND ((A (G ((1 <= pbl_4_6))) OR A (F ((pb1_4_4 <= pil1_4_7)))) OR A (F (((3 <= pol3_3_1) AND (2 <= pb3_2_2))))))
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: (pi2_4_5 <= pb1_4_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (pi2_4_5 <= pb1_4_2)
lola: processed formula length: 20
lola: 1 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-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 8 will run for 401 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= pbl_4_6)))
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 428 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: SUBRESULT
lola: state equation: write sara problem file to TriangularGrid-PT-4022-CTLCardinality-8.sara
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 9 will run for 459 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((pb1_4_4 <= pil1_4_7)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (pb1_4_4 <= pil1_4_7))
lola: processed formula length: 31
lola: 2 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 428 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 10 will run for 535 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((3 <= pol3_3_1) AND (2 <= pb3_2_2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((3 <= pol3_3_1) AND (2 <= pb3_2_2)))
lola: processed formula length: 46
lola: 2 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 428 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: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 8 will run for 401 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= pol2_3_1) OR (pi2_2_3 <= pi3_4_7))))
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 428 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
sara: try reading problem file TriangularGrid-PT-4022-CTLCardinality-8.sara.
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: write sara problem file to TriangularGrid-PT-4022-CTLCardinality-8.sara
lola: ========================================
sara: 4: error near '': syntax error, unexpected $end, expecting FINALM
sara: error while parsing the sara problem file -- aborting [#05]
sara: see manual for a documentation of this error
lola: subprocess 9 will run for 459 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((1 <= po2_1_1) OR (pb1_3_3 <= pol1_4_7)) OR A (X ((3 <= po3_2_3)))) OR ((E (G ((pb2_3_4 <= pbl_4_5))) AND E (F ((pi1_3_1 <= po3_3_1)))) OR E (G ((pb3_4_2 <= 1)))))
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: ((1 <= po2_1_1) OR (pb1_3_3 <= pol1_4_7))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= po2_1_1) OR (pb1_3_3 <= pol1_4_7))
lola: processed formula length: 42
lola: 1 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-CTLCardinality.task
lola: processed formula with 2 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 535 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((3 <= po3_2_3)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((3 <= po3_2_3))
lola: processed formula length: 18
lola: 2 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 428 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 11 will run for 642 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((pb2_3_4 <= pbl_4_5)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (pbl_4_5 + 1 <= pb2_3_4)))
lola: processed formula length: 39
lola: 3 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 428 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 12 will run for 803 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((pi1_3_1 <= po3_3_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 428 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: SUBRESULT
lola: lola: result: yesstate equation: Generated DNF with 1 literals and 1 conjunctive subformulas

lola: The Boolean predicate is true.
lola: ========================================
lola: state equation: write sara problem file to TriangularGrid-PT-4022-CTLCardinality-12.sara
lola: ========================================
lola: subprocess 10 will run for 535 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((pb3_2_3 <= pb1_3_4) AND (pbl_4_5 <= pi2_4_3))))))
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 ((pb1_3_4 + 1 <= pb3_2_3) OR (pi2_4_3 + 1 <= pbl_4_5)))))
lola: processed formula length: 80
lola: 3 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 428 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 11 will run for 642 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (((pi2_3_5 <= 0) U (3 <= pi1_2_1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E((pi2_3_5 <= 0) U (3 <= pi1_2_1)))
lola: processed formula length: 39
lola: 7 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 428 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: 786858 markings, 2193980 edges, 3096159597753270272 markings/sec, 0 secs
lola: 1440646 markings, 4257311 edges, 130758 markings/sec, 5 secs
lola: 2184887 markings, 6353521 edges, 148848 markings/sec, 10 secs
lola: 2964731 markings, 8300901 edges, 155969 markings/sec, 15 secs
lola: 3610155 markings, 10108563 edges, 129085 markings/sec, 20 secs
lola: 4175758 markings, 11794421 edges, 113121 markings/sec, 25 secs
lola: 4757911 markings, 13439433 edges, 116431 markings/sec, 30 secs
lola: 5353088 markings, 15039225 edges, 119035 markings/sec, 35 secs
lola: 5770239 markings, 16479005 edges, 83430 markings/sec, 40 secs
lola: 6281015 markings, 18114901 edges, 102155 markings/sec, 45 secs
lola: 6801954 markings, 19738939 edges, 104188 markings/sec, 50 secs
lola: 7473713 markings, 21526816 edges, 134352 markings/sec, 55 secs
lola: 8175035 markings, 23344514 edges, 140264 markings/sec, 60 secs
lola: 8788359 markings, 25082685 edges, 122665 markings/sec, 65 secs
lola: 9295582 markings, 26757715 edges, 101445 markings/sec, 70 secs
lola: 9878071 markings, 28402768 edges, 116498 markings/sec, 75 secs
lola: 10423041 markings, 29961432 edges, 108994 markings/sec, 80 secs
lola: 10927267 markings, 31538891 edges, 100845 markings/sec, 85 secs
lola: 11508523 markings, 33075940 edges, 116251 markings/sec, 90 secs
lola: 11989017 markings, 34580426 edges, 96099 markings/sec, 95 secs
lola: 12374160 markings, 35962940 edges, 77029 markings/sec, 100 secs
lola: 12810155 markings, 37491533 edges, 87199 markings/sec, 105 secs
lola: 13271282 markings, 38999208 edges, 92225 markings/sec, 110 secs
lola: 13825177 markings, 40622274 edges, 110779 markings/sec, 115 secs
lola: 14342797 markings, 42319032 edges, 103524 markings/sec, 120 secs
lola: 14772003 markings, 43977615 edges, 85841 markings/sec, 125 secs
lola: 15217663 markings, 45635932 edges, 89132 markings/sec, 130 secs
lola: 15620667 markings, 47170230 edges, 80601 markings/sec, 135 secs
lola: 16089981 markings, 48759328 edges, 93863 markings/sec, 140 secs
lola: 16568897 markings, 50331788 edges, 95783 markings/sec, 145 secs
lola: 17020658 markings, 51784302 edges, 90352 markings/sec, 150 secs
lola: 17385184 markings, 53190523 edges, 72905 markings/sec, 155 secs
lola: 17840407 markings, 54779649 edges, 91045 markings/sec, 160 secs
lola: 18231509 markings, 56357911 edges, 78220 markings/sec, 165 secs
lola: 18744151 markings, 57776808 edges, 102528 markings/sec, 170 secs
lola: 19162168 markings, 59091612 edges, 83603 markings/sec, 175 secs
lola: 19551046 markings, 60582480 edges, 77776 markings/sec, 180 secs
lola: 19982637 markings, 62144596 edges, 86318 markings/sec, 185 secs
lola: 20399406 markings, 63637232 edges, 83354 markings/sec, 190 secs
lola: 20817406 markings, 65030389 edges, 83600 markings/sec, 195 secs
lola: 21109081 markings, 66416078 edges, 58335 markings/sec, 200 secs
lola: 21514335 markings, 67859152 edges, 81051 markings/sec, 205 secs
lola: 21844200 markings, 69188804 edges, 65973 markings/sec, 210 secs
lola: 22196340 markings, 70753368 edges, 70428 markings/sec, 215 secs
lola: 22578680 markings, 72279368 edges, 76468 markings/sec, 220 secs
lola: 23079118 markings, 73859580 edges, 100088 markings/sec, 225 secs
lola: 23569036 markings, 75388401 edges, 97984 markings/sec, 230 secs
lola: 24050696 markings, 76841073 edges, 96332 markings/sec, 235 secs
lola: 24558716 markings, 78321661 edges, 101604 markings/sec, 240 secs
lola: 24966752 markings, 79667913 edges, 81607 markings/sec, 245 secs
lola: 25310464 markings, 81061297 edges, 68742 markings/sec, 250 secs
lola: 25695968 markings, 82491523 edges, 77101 markings/sec, 255 secs
lola: 26152825 markings, 83838498 edges, 91371 markings/sec, 260 secs
lola: 26541008 markings, 84916380 edges, 77637 markings/sec, 265 secs
lola: 26948452 markings, 86004819 edges, 81489 markings/sec, 270 secs
lola: 27264310 markings, 87012138 edges, 63172 markings/sec, 275 secs
lola: 27582901 markings, 88095274 edges, 63718 markings/sec, 280 secs
lola: 27862517 markings, 89106001 edges, 55923 markings/sec, 285 secs
lola: 28342492 markings, 90386133 edges, 95995 markings/sec, 290 secs
lola: 28795405 markings, 91821360 edges, 90583 markings/sec, 295 secs
lola: 29175815 markings, 93082545 edges, 76082 markings/sec, 300 secs
lola: 29686438 markings, 94517439 edges, 102125 markings/sec, 305 secs
lola: 30080926 markings, 95893150 edges, 78898 markings/sec, 310 secs
lola: 30494543 markings, 97106009 edges, 82723 markings/sec, 315 secs
lola: 30918844 markings, 98407385 edges, 84860 markings/sec, 320 secs
lola: 31195626 markings, 99690069 edges, 55356 markings/sec, 325 secs
lola: 31550114 markings, 100948257 edges, 70898 markings/sec, 330 secs
lola: 31772424 markings, 102198748 edges, 44462 markings/sec, 335 secs
lola: 32210705 markings, 103332556 edges, 87656 markings/sec, 340 secs
lola: 32598301 markings, 104586813 edges, 77519 markings/sec, 345 secs
lola: 32914030 markings, 105625775 edges, 63146 markings/sec, 350 secs
lola: 33089120 markings, 106517063 edges, 35018 markings/sec, 355 secs
lola: 33409767 markings, 107458652 edges, 64129 markings/sec, 360 secs
lola: 33625310 markings, 108410610 edges, 43109 markings/sec, 365 secs
lola: 33925686 markings, 109517609 edges, 60075 markings/sec, 370 secs
lola: 34169627 markings, 110677797 edges, 48788 markings/sec, 375 secs
lola: 34602084 markings, 112155012 edges, 86491 markings/sec, 380 secs
lola: 35056407 markings, 113534110 edges, 90865 markings/sec, 385 secs
lola: 35422661 markings, 114594791 edges, 73251 markings/sec, 390 secs
lola: 35619846 markings, 115675517 edges, 39437 markings/sec, 395 secs
lola: 36026562 markings, 116993997 edges, 81343 markings/sec, 400 secs
lola: 36334240 markings, 118174113 edges, 61536 markings/sec, 405 secs
lola: 36737267 markings, 119484558 edges, 80605 markings/sec, 410 secs
lola: 37313646 markings, 120983262 edges, 115276 markings/sec, 415 secs
lola: 37914089 markings, 122646647 edges, 120089 markings/sec, 420 secs
lola: 38435208 markings, 124264374 edges, 104224 markings/sec, 425 secs
lola: 38934431 markings, 125847973 edges, 99845 markings/sec, 430 secs
lola: 39414450 markings, 127342687 edges, 96004 markings/sec, 435 secs
lola: 39927002 markings, 128744714 edges, 102510 markings/sec, 440 secs
lola: 40486569 markings, 130280332 edges, 111913 markings/sec, 445 secs
lola: 40910795 markings, 131695312 edges, 84845 markings/sec, 450 secs
lola: 41334818 markings, 133004309 edges, 84805 markings/sec, 455 secs
lola: 41730547 markings, 134438893 edges, 79146 markings/sec, 460 secs
lola: 42147893 markings, 135843562 edges, 83469 markings/sec, 465 secs
lola: 42696249 markings, 137396588 edges, 109671 markings/sec, 470 secs
lola: 43123118 markings, 138887570 edges, 85374 markings/sec, 475 secs
lola: 43556681 markings, 140307391 edges, 86713 markings/sec, 480 secs
lola: 43996075 markings, 141761061 edges, 87879 markings/sec, 485 secs
lola: 44394147 markings, 143087255 edges, 79614 markings/sec, 490 secs
lola: 44684970 markings, 144350943 edges, 58165 markings/sec, 495 secs
lola: 45094773 markings, 145906608 edges, 81961 markings/sec, 500 secs
lola: 45460207 markings, 147446083 edges, 73087 markings/sec, 505 secs
lola: 46013698 markings, 149011566 edges, 110698 markings/sec, 510 secs
lola: 46500150 markings, 150513532 edges, 97290 markings/sec, 515 secs
lola: 46968357 markings, 151956911 edges, 93641 markings/sec, 520 secs
lola: 47443664 markings, 153376550 edges, 95061 markings/sec, 525 secs
lola: 47787467 markings, 154646328 edges, 68761 markings/sec, 530 secs
lola: 48194263 markings, 156125364 edges, 81359 markings/sec, 535 secs
lola: 48589486 markings, 157590890 edges, 79045 markings/sec, 540 secs
lola: 49105132 markings, 159031420 edges, 103129 markings/sec, 545 secs
lola: 49609673 markings, 160389931 edges, 100908 markings/sec, 550 secs
lola: 49996192 markings, 161640909 edges, 77304 markings/sec, 555 secs
lola: 50425620 markings, 162977402 edges, 85886 markings/sec, 560 secs
lola: 50824467 markings, 164309678 edges, 79769 markings/sec, 565 secs
lola: 51368275 markings, 165861277 edges, 108762 markings/sec, 570 secs
lola: 51766929 markings, 167308249 edges, 79731 markings/sec, 575 secs
lola: 52300285 markings, 168659189 edges, 106671 markings/sec, 580 secs
lola: 52750652 markings, 170009902 edges, 90073 markings/sec, 585 secs
lola: 53207564 markings, 171260851 edges, 91382 markings/sec, 590 secs
lola: 53643372 markings, 172570197 edges, 87162 markings/sec, 595 secs
lola: 54054328 markings, 173839483 edges, 82191 markings/sec, 600 secs
lola: 54361702 markings, 175087886 edges, 61475 markings/sec, 605 secs
lola: 54687687 markings, 176348259 edges, 65197 markings/sec, 610 secs
lola: 54966232 markings, 177547666 edges, 55709 markings/sec, 615 secs
lola: 55237689 markings, 178747268 edges, 54291 markings/sec, 620 secs
lola: 55599413 markings, 179877431 edges, 72345 markings/sec, 625 secs
lola: 55874467 markings, 181023493 edges, 55011 markings/sec, 630 secs
lola: 56195298 markings, 182281194 edges, 64166 markings/sec, 635 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 642 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((pi1_1_1 <= pb3_3_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 428 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: write sara problem file to TriangularGrid-PT-4022-CTLCardinality-12.sara
lola: subprocess 13 will run for 857 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (G (((1 <= pi1_4_3) AND (2 <= po2_3_3)))) OR A (X (((pbl_2_3 <= pb3_4_5) OR (pb2_1_1 <= pb2_2_3))))) OR E (F (A (G ((po1_2_3 <= pb3_3_2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: state equation: calling and running sara
lola: lola: ========================================subprocess 13 will run for 857 seconds at most (--localtimelimit=-1)

lola: ========================================
lola: ...considering subproblem: A (G (((1 <= pi1_4_3) AND (2 <= po2_3_3))))
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 428 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 14 will run for 1285 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((pbl_2_3 <= pb3_4_5) OR (pb2_1_1 <= pb2_2_3))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(((pbl_2_3 <= pb3_4_5) OR (pb2_1_1 <= pb2_2_3)))
lola: processed formula length: 51
lola: 2 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 428 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: ========================================
sara: try reading problem file TriangularGrid-PT-4022-CTLCardinality-12.sara.
lola: subprocess 15 will run for 2571 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((po1_2_3 <= pb3_3_2)))))
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 (pb3_3_2 + 1 <= po1_2_3))))
lola: processed formula length: 49
lola: 4 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 428 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: 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 14 will run for 1285 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (G (((pol1_4_7 <= pbl_3_1) OR (pi3_4_5 <= pol2_3_1)))) AND (E (X ((po1_2_3 <= pol1_2_3))) OR (((pi1_2_3 <= pol1_3_3) OR (pi3_2_1 <= pbl_2_2)) AND ((3 <= pil1_4_1) OR (2 <= pol3_3_1))))) OR (A (((3 <= pil2_3_3) U (3 <= pol2_4_5))) OR (pil2_2_1 <= po2_2_3)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1285 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((pol1_4_7 <= pbl_3_1) OR (pi3_4_5 <= pol2_3_1))))
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 428 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 TriangularGrid-PT-4022-CTLCardinality-14.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 15 will run for 2571 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((3 <= pil2_3_3) U (3 <= pol2_4_5)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((3 <= pil2_3_3) U (3 <= pol2_4_5))
lola: processed formula length: 36
lola: 1 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 428 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: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 15 will run for 2571 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((pil1_4_7 <= pb3_3_4) AND A (G ((2 <= po3_3_5))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((pil1_4_7 <= pb3_3_4) AND NOT(E(TRUE U (po3_3_5 <= 1)))))
lola: processed formula length: 67
lola: 3 rewrites
lola: formula mentions 0 of 184 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-4022-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 428 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: RESULT
lola:
SUMMARY: yes yes no no no unknown no no no yes yes unknown no yes unknown no
lola: ========================================
FORMULA TriangularGrid-PT-4022-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-4022-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-4022-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-4022-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-4022-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-4022-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-4022-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-4022-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-4022-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-4022-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-4022-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-4022-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-4022-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-4022-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-4022-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-4022-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496575138744

--------------------
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-4022"
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/S_TriangularGrid-PT-4022.tgz
mv S_TriangularGrid-PT-4022 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-4022, 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 r158-ebro-149443464300345"
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 ;