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

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


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
CTLCardinality @ 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: 345873 markings, 2074559 edges, 3108938671647096832 markings/sec, 0 secs
lola: 811508 markings, 4015500 edges, 93127 markings/sec, 5 secs
lola: 1167297 markings, 5678332 edges, 71158 markings/sec, 10 secs
lola: 1202925 markings, 7318637 edges, 7126 markings/sec, 15 secs
lola: 1364172 markings, 9168368 edges, 32249 markings/sec, 20 secs
lola: 1718123 markings, 11046826 edges, 70790 markings/sec, 25 secs
lola: 2119740 markings, 12762310 edges, 80323 markings/sec, 30 secs
lola: 2519295 markings, 14232502 edges, 79911 markings/sec, 35 secs
lola: 2880488 markings, 15689290 edges, 72239 markings/sec, 40 secs
lola: 3192238 markings, 17120621 edges, 62350 markings/sec, 45 secs
lola: 3456071 markings, 18565509 edges, 52767 markings/sec, 50 secs
lola: 3692426 markings, 20047536 edges, 47271 markings/sec, 55 secs
lola: 3698599 markings, 21444541 edges, 1235 markings/sec, 60 secs
lola: 3700976 markings, 22815743 edges, 475 markings/sec, 65 secs
lola: 3702192 markings, 24203997 edges, 243 markings/sec, 70 secs
lola: 3702943 markings, 25617439 edges, 150 markings/sec, 75 secs
lola: 3703350 markings, 27065070 edges, 81 markings/sec, 80 secs
lola: 3849460 markings, 28754030 edges, 29222 markings/sec, 85 secs
lola: 4125448 markings, 30481305 edges, 55198 markings/sec, 90 secs
lola: 4456730 markings, 32028008 edges, 66256 markings/sec, 95 secs
lola: 4656467 markings, 33547827 edges, 39947 markings/sec, 100 secs
lola: 4923472 markings, 35075519 edges, 53401 markings/sec, 105 secs
lola: 5205721 markings, 36704026 edges, 56450 markings/sec, 110 secs
lola: 5516988 markings, 38166429 edges, 62253 markings/sec, 115 secs
lola: 5816945 markings, 39606115 edges, 59991 markings/sec, 120 secs
lola: 6171555 markings, 40983680 edges, 70922 markings/sec, 125 secs
lola: 6514207 markings, 42256181 edges, 68530 markings/sec, 130 secs
lola: 6844728 markings, 43521589 edges, 66104 markings/sec, 135 secs
lola: 7172117 markings, 44907005 edges, 65478 markings/sec, 140 secs
lola: 7498919 markings, 46262900 edges, 65360 markings/sec, 145 secs
lola: 7814107 markings, 47587406 edges, 63038 markings/sec, 150 secs
lola: 8116439 markings, 48904120 edges, 60466 markings/sec, 155 secs
lola: 8404094 markings, 50210858 edges, 57531 markings/sec, 160 secs
lola: 8675138 markings, 51527536 edges, 54209 markings/sec, 165 secs
lola: 8935809 markings, 52833674 edges, 52134 markings/sec, 170 secs
lola: 9176873 markings, 54122026 edges, 48213 markings/sec, 175 secs
lola: 9407569 markings, 55404525 edges, 46139 markings/sec, 180 secs
lola: 9624807 markings, 56693758 edges, 43448 markings/sec, 185 secs
lola: 9829378 markings, 57982808 edges, 40914 markings/sec, 190 secs
lola: 10025348 markings, 59277792 edges, 39194 markings/sec, 195 secs
lola: 10223105 markings, 60621141 edges, 39551 markings/sec, 200 secs
lola: 10229814 markings, 61877296 edges, 1342 markings/sec, 205 secs
lola: 10232483 markings, 63086246 edges, 534 markings/sec, 210 secs
lola: 10234474 markings, 64291017 edges, 398 markings/sec, 215 secs
lola: 10236344 markings, 65495061 edges, 374 markings/sec, 220 secs
lola: 10237845 markings, 66700195 edges, 300 markings/sec, 225 secs
lola: 10238956 markings, 67899975 edges, 222 markings/sec, 230 secs
lola: 10239925 markings, 69110284 edges, 194 markings/sec, 235 secs
lola: 10240843 markings, 70335833 edges, 184 markings/sec, 240 secs
lola: 10241594 markings, 71562188 edges, 150 markings/sec, 245 secs
lola: 10242256 markings, 72798264 edges, 132 markings/sec, 250 secs
lola: 10242765 markings, 74045777 edges, 102 markings/sec, 255 secs
lola: 10243245 markings, 75299310 edges, 96 markings/sec, 260 secs
lola: 10243659 markings, 76557789 edges, 83 markings/sec, 265 secs
lola: 10243971 markings, 77822333 edges, 62 markings/sec, 270 secs
lola: 10244209 markings, 79098928 edges, 48 markings/sec, 275 secs
lola: 10244412 markings, 80396006 edges, 41 markings/sec, 280 secs
lola: 10244575 markings, 81717807 edges, 33 markings/sec, 285 secs
lola: 10300804 markings, 83098265 edges, 11246 markings/sec, 290 secs
lola: 10571561 markings, 84676625 edges, 54151 markings/sec, 295 secs
lola: 10941962 markings, 86201443 edges, 74080 markings/sec, 300 secs
lola: 11259449 markings, 87542203 edges, 63497 markings/sec, 305 secs
lola: 11409230 markings, 88857886 edges, 29956 markings/sec, 310 secs
lola: 11411662 markings, 90086553 edges, 486 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: result: no
lola: produced by: state space
lola: The predicate is not invariant.
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: ========================================
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
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: lola: lola: ========================================subprocess 9 will run for 459 seconds at most (--localtimelimit=-1)state equation: calling and running sara


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: sara: formula mentions 0 of 184 places; total mentions: 0
try reading problem file TriangularGrid-PT-4022-CTLCardinality-8.sara.
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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: SUBRESULT
lola: lola: result: yes
state equation: write sara problem file to TriangularGrid-PT-4022-CTLCardinality-12.sara
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: state equation: calling and running sara
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).
sara: try reading problem file TriangularGrid-PT-4022-CTLCardinality-12.sara.
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).
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: 779800 markings, 2174345 edges, 155960 markings/sec, 0 secs
lola: 1447258 markings, 4283709 edges, 133492 markings/sec, 5 secs
lola: 2204736 markings, 6412872 edges, 151496 markings/sec, 10 secs
lola: 2991731 markings, 8383069 edges, 157399 markings/sec, 15 secs
lola: 3654161 markings, 10220932 edges, 132486 markings/sec, 20 secs
lola: 4235042 markings, 11939988 edges, 116176 markings/sec, 25 secs
lola: 4836665 markings, 13644129 edges, 120325 markings/sec, 30 secs
lola: 5427884 markings, 15263314 edges, 118244 markings/sec, 35 secs
lola: 5853606 markings, 16795247 edges, 85144 markings/sec, 40 secs
lola: 6348133 markings, 18526376 edges, 98905 markings/sec, 45 secs
lola: 7036665 markings, 20347586 edges, 137706 markings/sec, 50 secs
lola: 7701264 markings, 22177821 edges, 132920 markings/sec, 55 secs
lola: 8402291 markings, 23965748 edges, 140205 markings/sec, 60 secs
lola: 8996125 markings, 25720842 edges, 118767 markings/sec, 65 secs
lola: 9505918 markings, 27433511 edges, 101959 markings/sec, 70 secs
lola: 10083339 markings, 29068998 edges, 115484 markings/sec, 75 secs
lola: 10627137 markings, 30680147 edges, 108760 markings/sec, 80 secs
lola: 11259312 markings, 32377069 edges, 126435 markings/sec, 85 secs
lola: 11802743 markings, 33929324 edges, 108686 markings/sec, 90 secs
lola: 12230351 markings, 35468095 edges, 85522 markings/sec, 95 secs
lola: 12654328 markings, 36976954 edges, 84795 markings/sec, 100 secs
lola: 13139844 markings, 38578886 edges, 97103 markings/sec, 105 secs
lola: 13710565 markings, 40285867 edges, 114144 markings/sec, 110 secs
lola: 14263537 markings, 42082680 edges, 110594 markings/sec, 115 secs
lola: 14713638 markings, 43772631 edges, 90020 markings/sec, 120 secs
lola: 15165721 markings, 45479570 edges, 90417 markings/sec, 125 secs
lola: 15588338 markings, 47054648 edges, 84523 markings/sec, 130 secs
lola: 16071256 markings, 48679296 edges, 96584 markings/sec, 135 secs
lola: 16562558 markings, 50312277 edges, 98260 markings/sec, 140 secs
lola: 17033407 markings, 51824781 edges, 94170 markings/sec, 145 secs
lola: 17422076 markings, 53326999 edges, 77734 markings/sec, 150 secs
lola: 17905869 markings, 54997695 edges, 96759 markings/sec, 155 secs
lola: 18313666 markings, 56665154 edges, 81559 markings/sec, 160 secs
lola: 18864841 markings, 58103274 edges, 110235 markings/sec, 165 secs
lola: 19233888 markings, 59497312 edges, 73809 markings/sec, 170 secs
lola: 19680541 markings, 61135890 edges, 89331 markings/sec, 175 secs
lola: 20183906 markings, 62824160 edges, 100673 markings/sec, 180 secs
lola: 20620338 markings, 64328463 edges, 87286 markings/sec, 185 secs
lola: 21026106 markings, 65746013 edges, 81154 markings/sec, 190 secs
lola: 21295757 markings, 67152774 edges, 53930 markings/sec, 195 secs
lola: 21694778 markings, 68592067 edges, 79804 markings/sec, 200 secs
lola: 22002448 markings, 69954877 edges, 61534 markings/sec, 205 secs
lola: 22444327 markings, 71578699 edges, 88376 markings/sec, 210 secs
lola: 22826261 markings, 73177532 edges, 76387 markings/sec, 215 secs
lola: 23377040 markings, 74742372 edges, 110156 markings/sec, 220 secs
lola: 23882952 markings, 76263165 edges, 101182 markings/sec, 225 secs
lola: 24348370 markings, 77751640 edges, 93084 markings/sec, 230 secs
lola: 24840264 markings, 79197573 edges, 98379 markings/sec, 235 secs
lola: 25182795 markings, 80586856 edges, 68506 markings/sec, 240 secs
lola: 25633559 markings, 82147927 edges, 90153 markings/sec, 245 secs
lola: 26097897 markings, 83689883 edges, 92868 markings/sec, 250 secs
lola: 26641308 markings, 85169064 edges, 108682 markings/sec, 255 secs
lola: 27141928 markings, 86568497 edges, 100124 markings/sec, 260 secs
lola: 27542910 markings, 87984463 edges, 80196 markings/sec, 265 secs
lola: 27944846 markings, 89340972 edges, 80387 markings/sec, 270 secs
lola: 28531187 markings, 90921881 edges, 117268 markings/sec, 275 secs
lola: 28947458 markings, 92483911 edges, 83254 markings/sec, 280 secs
lola: 29510109 markings, 93993130 edges, 112530 markings/sec, 285 secs
lola: 29967714 markings, 95526928 edges, 91521 markings/sec, 290 secs
lola: 30444246 markings, 96943764 edges, 95306 markings/sec, 295 secs
lola: 30900592 markings, 98337896 edges, 91269 markings/sec, 300 secs
lola: 31214067 markings, 99745567 edges, 62695 markings/sec, 305 secs
lola: 31587601 markings, 101116831 edges, 74707 markings/sec, 310 secs
lola: 31884574 markings, 102430244 edges, 59395 markings/sec, 315 secs
lola: 32363041 markings, 103781327 edges, 95693 markings/sec, 320 secs
lola: 32778975 markings, 105135791 edges, 83187 markings/sec, 325 secs
lola: 33050259 markings, 106429938 edges, 54257 markings/sec, 330 secs
lola: 33452961 markings, 107625572 edges, 80540 markings/sec, 335 secs
lola: 33769913 markings, 108903710 edges, 63390 markings/sec, 340 secs
lola: 34053040 markings, 110256756 edges, 56625 markings/sec, 345 secs
lola: 34511537 markings, 111867258 edges, 91699 markings/sec, 350 secs
lola: 35043266 markings, 113500541 edges, 106346 markings/sec, 355 secs
lola: 35512603 markings, 114871184 edges, 93867 markings/sec, 360 secs
lola: 35757456 markings, 116278948 edges, 48971 markings/sec, 365 secs
lola: 36224203 markings, 117838462 edges, 93349 markings/sec, 370 secs
lola: 36715682 markings, 119394235 edges, 98296 markings/sec, 375 secs
lola: 37314791 markings, 120986466 edges, 119822 markings/sec, 380 secs
lola: 37936891 markings, 122716642 edges, 124420 markings/sec, 385 secs
lola: 38465684 markings, 124402762 edges, 105759 markings/sec, 390 secs
lola: 39017363 markings, 126065007 edges, 110336 markings/sec, 395 secs
lola: 39528965 markings, 127620421 edges, 102320 markings/sec, 400 secs
lola: 40081136 markings, 129124119 edges, 110434 markings/sec, 405 secs
lola: 40638339 markings, 130717379 edges, 111441 markings/sec, 410 secs
lola: 41081313 markings, 132170252 edges, 88595 markings/sec, 415 secs
lola: 41474173 markings, 133548073 edges, 78572 markings/sec, 420 secs
lola: 41965553 markings, 135111484 edges, 98276 markings/sec, 425 secs
lola: 42452979 markings, 136660196 edges, 97485 markings/sec, 430 secs
lola: 42948567 markings, 138270159 edges, 99118 markings/sec, 435 secs
lola: 43432952 markings, 139844040 edges, 96877 markings/sec, 440 secs
lola: 43869418 markings, 141405515 edges, 87293 markings/sec, 445 secs
lola: 44342579 markings, 142907289 edges, 94632 markings/sec, 450 secs
lola: 44667702 markings, 144268355 edges, 65025 markings/sec, 455 secs
lola: 45091851 markings, 145897555 edges, 84830 markings/sec, 460 secs
lola: 45470232 markings, 147496245 edges, 75676 markings/sec, 465 secs
lola: 46045982 markings, 149117226 edges, 115150 markings/sec, 470 secs
lola: 46560480 markings, 150677856 edges, 102900 markings/sec, 475 secs
lola: 47033392 markings, 152203510 edges, 94582 markings/sec, 480 secs
lola: 47529465 markings, 153660744 edges, 99215 markings/sec, 485 secs
lola: 47876766 markings, 155030053 edges, 69460 markings/sec, 490 secs
lola: 48324959 markings, 156582432 edges, 89639 markings/sec, 495 secs
lola: 48757874 markings, 158106743 edges, 86583 markings/sec, 500 secs
lola: 49305857 markings, 159574891 edges, 109597 markings/sec, 505 secs
lola: 49812215 markings, 160983040 edges, 101272 markings/sec, 510 secs
lola: 50208248 markings, 162375514 edges, 79207 markings/sec, 515 secs
lola: 50637157 markings, 163764409 edges, 85782 markings/sec, 520 secs
lola: 51196647 markings, 165331908 edges, 111898 markings/sec, 525 secs
lola: 51615250 markings, 166851349 edges, 83721 markings/sec, 530 secs
lola: 52157543 markings, 168325060 edges, 108459 markings/sec, 535 secs
lola: 52652332 markings, 169752533 edges, 98958 markings/sec, 540 secs
lola: 53144747 markings, 171094750 edges, 98483 markings/sec, 545 secs
lola: 53611854 markings, 172467482 edges, 93421 markings/sec, 550 secs
lola: 54049895 markings, 173824665 edges, 87608 markings/sec, 555 secs
lola: 54385150 markings, 175166522 edges, 67051 markings/sec, 560 secs
lola: 54706837 markings, 176507007 edges, 64337 markings/sec, 565 secs
lola: 55040430 markings, 177797792 edges, 66719 markings/sec, 570 secs
lola: 55322985 markings, 179061499 edges, 56511 markings/sec, 575 secs
lola: 55700604 markings, 180250461 edges, 75524 markings/sec, 580 secs
lola: 56014236 markings, 181515171 edges, 62726 markings/sec, 585 secs
lola: 56273513 markings, 182847791 edges, 51855 markings/sec, 590 secs
lola: 56759783 markings, 184472839 edges, 97254 markings/sec, 595 secs
lola: 57278159 markings, 186049381 edges, 103675 markings/sec, 600 secs
lola: 57733769 markings, 187392432 edges, 91122 markings/sec, 605 secs
lola: 57987371 markings, 188784937 edges, 50720 markings/sec, 610 secs
lola: 58500029 markings, 190371839 edges, 102532 markings/sec, 615 secs
lola: 58869966 markings, 191759005 edges, 73987 markings/sec, 620 secs
lola: 59444318 markings, 193143314 edges, 114870 markings/sec, 625 secs
lola: 59970171 markings, 194508400 edges, 105171 markings/sec, 630 secs
lola: 60358464 markings, 195746373 edges, 77659 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: ========================================
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: 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: state equation: Generated DNF with 2 literals and 2 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-13.sara
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: ========================================
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).
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 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: 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-14.sara
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 1494946973692

--------------------
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="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/TriangularGrid-PT-4022.tgz
mv 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 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 r078-ebro-149441008700345"
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 ;