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

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

=== Now, execution of the tool begins

BK_START 1496562581524


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


checking for too many tokens
===========================================================================================
S_SquareGrid-PT-080408: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ S_SquareGrid-PT-080408 @ 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: 1952/65536 symbol table entries, 279 collisions
lola: preprocessing...
lola: finding significant places
lola: 896 places, 1056 transitions, 543 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1408 transition conflict sets
lola: TASK
lola: reading formula from SquareGrid-PT-080408-CTLCardinality.task
lola: (A (F (A (G ((2 <= pbl_3_3))))) AND E (X ((1 <= p4o_4_2)))) : (A (F (((pb1_3_1 <= p1o_5_3) AND (1 <= p1o_7_8) AND (3 <= pb4_8_3) AND (pbl_7_1 <= pb2_4_3)))) OR ((((2 <= pb4_3_5) OR (p4ol_4_5 <= p1i_4_8)) AND ((p1o_9_7 <= pb1_2_3) OR (pb4_5_1 <= p4o_6_1)) AND ((pbl_6_7 + 1 <= pbl_7_6) OR (p1i_2_2 <= 0))) AND A (G ((3 <= pbl_1_2))))) : A (X ((E (F ((p4ol_8_2 <= pbl_2_2))) AND A (G ((p4il_3_9 <= pb2_7_5)))))) : A (F (((p4i_5_9 <= p4il_1_2) AND (p1ol_1_4 <= p4o_3_6) AND ((pbl_1_1 <= 2) OR (pb3_6_3 <= 2))))) : E (F ((E (G ((2 <= pbl_1_1))) AND (pb1_5_4 <= p4i_3_9)))) : E (G (E (F ((2 <= pb3_1_6))))) : NOT(A (G (A (F ((1 <= pb3_4_3)))))) : (((A (X ((p1il_9_8 <= pbl_7_5))) AND A (G ((pb3_8_2 <= pbl_6_3)))) AND E (X (((p4o_3_9 <= pb2_2_4) AND (p1o_2_8 <= p1il_4_2))))) AND ((A (X ((p4i_1_2 <= p4i_7_4))) OR ((3 <= pb3_1_3) OR (3 <= p1il_8_1) OR (pbl_3_8 <= p4il_7_5))) OR (pb1_8_1 <= pb2_3_6))) : A (F (NOT(A (F ((pb4_7_8 <= p4o_8_1)))))) : A (G (E (((2 <= pb3_3_4) U (p1i_4_7 <= p1o_9_7))))) : E (F (A (X ((p4i_4_9 + 1 <= p4i_8_4))))) : NOT(((3 <= p4i_8_2) OR E (F ((2 <= p1i_2_6))))) : E (F (((2 <= pb3_3_1) AND (pbl_4_5 <= p1o_8_5)))) : ((p4il_3_5 <= p1ol_7_8) AND E (X (E (X ((pbl_4_7 <= p4i_6_2)))))) : E (G (A (G ((3 <= pbl_5_8))))) : (A (((2 <= pb3_5_4) U ((3 <= p1i_3_3) AND (1 <= pbl_8_7)))) AND NOT(E (F ((pbl_2_7 <= p1il_7_6)))))
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 (F (A (G ((2 <= pbl_3_3))))) AND E (X ((1 <= p4o_4_2))))
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 (F (A (G ((2 <= pbl_3_3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(E(TRUE U (pbl_3_3 <= 1))))
lola: processed formula length: 39
lola: 3 rewrites
lola: formula mentions 0 of 896 places; total mentions: 0
lola: closed formula file SquareGrid-PT-080408-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2172 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (((pb1_3_1 <= p1o_5_3) AND (1 <= p1o_7_8) AND (3 <= pb4_8_3) AND (pbl_7_1 <= pb2_4_3)))) OR ((((2 <= pb4_3_5) OR (p4ol_4_5 <= p1i_4_8)) AND ((p1o_9_7 <= pb1_2_3) OR (pb4_5_1 <= p4o_6_1)) AND ((pbl_6_7 + 1 <= pbl_7_6) OR (p1i_2_2 <= 0))) AND A (G ((3 <= pbl_1_2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((pb1_3_1 <= p1o_5_3) AND (1 <= p1o_7_8) AND (3 <= pb4_8_3) AND (pbl_7_1 <= pb2_4_3))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((pb1_3_1 <= p1o_5_3) AND (1 <= p1o_7_8) AND (3 <= pb4_8_3) AND (pbl_7_1 <= pb2_4_3)))
lola: processed formula length: 95
lola: 1 rewrites
lola: formula mentions 0 of 896 places; total mentions: 0
lola: closed formula file SquareGrid-PT-080408-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2172 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((2 <= pb4_3_5) OR (p4ol_4_5 <= p1i_4_8)) AND ((p1o_9_7 <= pb1_2_3) OR (pb4_5_1 <= p4o_6_1)) AND ((pbl_6_7 + 1 <= pbl_7_6) OR (p1i_2_2 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((2 <= pb4_3_5) OR (p4ol_4_5 <= p1i_4_8)) AND ((p1o_9_7 <= pb1_2_3) OR (pb4_5_1 <= p4o_6_1)) AND ((pbl_6_7 + 1 <= pbl_7_6) OR (p1i_2_2 <= 0)))
lola: processed formula length: 146
lola: 0 rewrites
lola: formula mentions 0 of 896 places; total mentions: 0
lola: closed formula file SquareGrid-PT-080408-CTLCardinality.task
lola: processed formula with 6 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= pbl_1_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 2172 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 SquareGrid-PT-080408-CTLCardinality-3.sara
lola: lola: SUBRESULT
========================================
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((E (F ((p4ol_8_2 <= pbl_2_2))) AND A (G ((p4il_3_9 <= pb2_7_5))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (F ((p4ol_8_2 <= pbl_2_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U (p4ol_8_2 <= pbl_2_2)))
lola: processed formula length: 35
lola: 3 rewrites
lola: formula mentions 0 of 896 places; total mentions: 0
lola: closed formula file SquareGrid-PT-080408-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2172 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (G ((p4il_3_9 <= pb2_7_5)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(NOT(E(TRUE U (pb2_7_5 + 1 <= p4il_3_9))))
lola: processed formula length: 44
lola: 4 rewrites
lola: formula mentions 0 of 896 places; total mentions: 0
lola: closed formula file SquareGrid-PT-080408-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2172 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: SUBRESULT
========================================lola:
result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((p4i_5_9 <= p4il_1_2) AND (p1ol_1_4 <= p4o_3_6) AND ((pbl_1_1 <= 2) OR (pb3_6_3 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((p4i_5_9 <= p4il_1_2) AND (p1ol_1_4 <= p4o_3_6) AND ((pbl_1_1 <= 2) OR (pb3_6_3 <= 2))))
lola: processed formula length: 99
lola: 1 rewrites
lola: formula mentions 0 of 896 places; total mentions: 0
lola: closed formula file SquareGrid-PT-080408-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2172 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((E (G ((2 <= pbl_1_1))) AND (pb1_5_4 <= p4i_3_9))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (NOT(A(TRUE U (pbl_1_1 <= 1))) AND (pb1_5_4 <= p4i_3_9)))
lola: processed formula length: 66
lola: 3 rewrites
lola: formula mentions 0 of 896 places; total mentions: 0
lola: closed formula file SquareGrid-PT-080408-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2172 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: 175426 markings, 772447 edges, 3224733188970512384 markings/sec, 0 secs
lola: 310653 markings, 1502175 edges, 27045 markings/sec, 5 secs
lola: 446914 markings, 2222421 edges, 27252 markings/sec, 10 secs
lola: 580849 markings, 2938068 edges, 26787 markings/sec, 15 secs
lola: 719004 markings, 3640189 edges, 27631 markings/sec, 20 secs
lola: 869158 markings, 4314962 edges, 30031 markings/sec, 25 secs
lola: 1032477 markings, 5002544 edges, 32664 markings/sec, 30 secs
lola: 1195775 markings, 5677417 edges, 32660 markings/sec, 35 secs
lola: 1359303 markings, 6347224 edges, 32706 markings/sec, 40 secs
lola: 1492167 markings, 6987401 edges, 26573 markings/sec, 45 secs
lola: 1567757 markings, 7532855 edges, 15118 markings/sec, 50 secs
lola: 1658778 markings, 8117763 edges, 18204 markings/sec, 55 secs
lola: 1783477 markings, 8715650 edges, 24940 markings/sec, 60 secs
lola: 1892102 markings, 9247165 edges, 21725 markings/sec, 65 secs
lola: 2044333 markings, 9887029 edges, 30446 markings/sec, 70 secs
lola: 2193643 markings, 10511959 edges, 29862 markings/sec, 75 secs
lola: 2344002 markings, 11138284 edges, 30072 markings/sec, 80 secs
lola: 2462548 markings, 11735618 edges, 23709 markings/sec, 85 secs
lola: 2525228 markings, 12227845 edges, 12536 markings/sec, 90 secs
lola: 2584548 markings, 12726436 edges, 11864 markings/sec, 95 secs
lola: 2715700 markings, 13368054 edges, 26230 markings/sec, 100 secs
lola: 2835838 markings, 14028232 edges, 24028 markings/sec, 105 secs
lola: 2960673 markings, 14672619 edges, 24967 markings/sec, 110 secs
lola: 3079777 markings, 15313151 edges, 23821 markings/sec, 115 secs
lola: 3190752 markings, 15929216 edges, 22195 markings/sec, 120 secs
lola: 3328159 markings, 16543692 edges, 27481 markings/sec, 125 secs
lola: 3453085 markings, 17100999 edges, 24985 markings/sec, 130 secs
lola: 3595323 markings, 17707384 edges, 28448 markings/sec, 135 secs
lola: 3741015 markings, 18293105 edges, 29138 markings/sec, 140 secs
lola: 3874996 markings, 18840607 edges, 26796 markings/sec, 145 secs
lola: 3999175 markings, 19377740 edges, 24836 markings/sec, 150 secs
lola: 4065701 markings, 19814509 edges, 13305 markings/sec, 155 secs
lola: 4122462 markings, 20235173 edges, 11352 markings/sec, 160 secs
lola: 4196749 markings, 20704025 edges, 14857 markings/sec, 165 secs
lola: 4300829 markings, 21203052 edges, 20816 markings/sec, 170 secs
lola: 4397796 markings, 21664302 edges, 19393 markings/sec, 175 secs
lola: 4511883 markings, 22168433 edges, 22817 markings/sec, 180 secs
lola: 4632427 markings, 22692758 edges, 24109 markings/sec, 185 secs
lola: 4759202 markings, 23211585 edges, 25355 markings/sec, 190 secs
lola: 4883452 markings, 23730426 edges, 24850 markings/sec, 195 secs
lola: 4990091 markings, 24242304 edges, 21328 markings/sec, 200 secs
lola: 5044437 markings, 24651648 edges, 10869 markings/sec, 205 secs
lola: 5094412 markings, 25061497 edges, 9995 markings/sec, 210 secs
lola: 5159329 markings, 25525197 edges, 12983 markings/sec, 215 secs
lola: 5295531 markings, 26192214 edges, 27240 markings/sec, 220 secs
lola: 5420292 markings, 26847976 edges, 24952 markings/sec, 225 secs
lola: 5541508 markings, 27493532 edges, 24243 markings/sec, 230 secs
lola: 5657836 markings, 28120845 edges, 23266 markings/sec, 235 secs
lola: 5795332 markings, 28734441 edges, 27499 markings/sec, 240 secs
lola: 5916078 markings, 29285689 edges, 24149 markings/sec, 245 secs
lola: 6063476 markings, 29894324 edges, 29480 markings/sec, 250 secs
lola: 6207216 markings, 30474860 edges, 28748 markings/sec, 255 secs
lola: 6346908 markings, 31048183 edges, 27938 markings/sec, 260 secs
lola: 6467677 markings, 31620270 edges, 24154 markings/sec, 265 secs
lola: 6534537 markings, 32095409 edges, 13372 markings/sec, 270 secs
lola: 6599439 markings, 32599860 edges, 12980 markings/sec, 275 secs
lola: 6716046 markings, 33153001 edges, 23321 markings/sec, 280 secs
lola: 6822359 markings, 33662795 edges, 21263 markings/sec, 285 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((2 <= pb3_1_6)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U (2 <= pb3_1_6)))))
lola: processed formula length: 44
lola: 2 rewrites
lola: formula mentions 0 of 896 places; total mentions: 0
lola: closed formula file SquareGrid-PT-080408-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2172 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: 305765 markings, 1138422 edges, 2317418942508826624 markings/sec, 0 secs
lola: 502127 markings, 2127747 edges, 39272 markings/sec, 5 secs
lola: 710091 markings, 3056027 edges, 41593 markings/sec, 10 secs
lola: 901341 markings, 4026554 edges, 38250 markings/sec, 15 secs
lola: 1080989 markings, 4953591 edges, 35930 markings/sec, 20 secs
lola: 1314670 markings, 5993648 edges, 46736 markings/sec, 25 secs
lola: 1511891 markings, 7056878 edges, 39444 markings/sec, 30 secs
lola: 1752681 markings, 8062811 edges, 48158 markings/sec, 35 secs
lola: 1967180 markings, 9021616 edges, 42900 markings/sec, 40 secs
lola: 2160276 markings, 9968011 edges, 38619 markings/sec, 45 secs
lola: 2300895 markings, 10937108 edges, 28124 markings/sec, 50 secs
lola: 2437046 markings, 11787433 edges, 27230 markings/sec, 55 secs
lola: 2592138 markings, 12671888 edges, 31018 markings/sec, 60 secs
lola: 2798954 markings, 13527728 edges, 41363 markings/sec, 65 secs
lola: 2958134 markings, 14468193 edges, 31836 markings/sec, 70 secs
lola: 3063940 markings, 15317028 edges, 21161 markings/sec, 75 secs
lola: 3225957 markings, 16194675 edges, 32403 markings/sec, 80 secs
lola: 3347536 markings, 17040909 edges, 24316 markings/sec, 85 secs
lola: 3494111 markings, 17886554 edges, 29315 markings/sec, 90 secs
lola: 3703506 markings, 18713753 edges, 41879 markings/sec, 95 secs
lola: 3887529 markings, 19497877 edges, 36805 markings/sec, 100 secs
lola: 4028864 markings, 20336427 edges, 28267 markings/sec, 105 secs
lola: 4172682 markings, 21329442 edges, 28764 markings/sec, 110 secs
lola: 4298525 markings, 22254910 edges, 25169 markings/sec, 115 secs
lola: 4486211 markings, 23140781 edges, 37537 markings/sec, 120 secs
lola: 4663500 markings, 23989999 edges, 35458 markings/sec, 125 secs
lola: 4806634 markings, 24828872 edges, 28627 markings/sec, 130 secs
lola: 4962772 markings, 25698762 edges, 31228 markings/sec, 135 secs
lola: 5087137 markings, 26661690 edges, 24873 markings/sec, 140 secs
lola: 5218150 markings, 27481290 edges, 26203 markings/sec, 145 secs
lola: 5321330 markings, 28327335 edges, 20636 markings/sec, 150 secs
lola: 5477307 markings, 29161662 edges, 31195 markings/sec, 155 secs
lola: 5652709 markings, 29972897 edges, 35080 markings/sec, 160 secs
lola: 5788545 markings, 30847810 edges, 27167 markings/sec, 165 secs
lola: 5863798 markings, 31643224 edges, 15051 markings/sec, 170 secs
lola: 6003842 markings, 32498725 edges, 28009 markings/sec, 175 secs
lola: 6094702 markings, 33278443 edges, 18172 markings/sec, 180 secs
lola: 6235995 markings, 34056678 edges, 28259 markings/sec, 185 secs
lola: 6337493 markings, 34867407 edges, 20300 markings/sec, 190 secs
lola: 6530933 markings, 35788261 edges, 38688 markings/sec, 195 secs
lola: 6668374 markings, 36628458 edges, 27488 markings/sec, 200 secs
lola: 6896819 markings, 37378710 edges, 45689 markings/sec, 205 secs
lola: 7048130 markings, 38126304 edges, 30262 markings/sec, 210 secs
lola: 7160061 markings, 38932018 edges, 22386 markings/sec, 215 secs
lola: 7294156 markings, 39882179 edges, 26819 markings/sec, 220 secs
lola: 7406015 markings, 40805424 edges, 22372 markings/sec, 225 secs
lola: 7636454 markings, 41815108 edges, 46088 markings/sec, 230 secs
lola: 7889263 markings, 42896687 edges, 50562 markings/sec, 235 secs
lola: 8096667 markings, 43875479 edges, 41481 markings/sec, 240 secs
lola: 8257713 markings, 44951425 edges, 32209 markings/sec, 245 secs
lola: 8414492 markings, 45859225 edges, 31356 markings/sec, 250 secs
lola: 8557031 markings, 46793900 edges, 28508 markings/sec, 255 secs
lola: 8711131 markings, 47775799 edges, 30820 markings/sec, 260 secs
lola: 8833056 markings, 48656477 edges, 24385 markings/sec, 265 secs
lola: 9035337 markings, 49571537 edges, 40456 markings/sec, 270 secs
lola: 9181138 markings, 50462481 edges, 29160 markings/sec, 275 secs
lola: 9344813 markings, 51336623 edges, 32735 markings/sec, 280 secs
lola: 9464916 markings, 52192627 edges, 24021 markings/sec, 285 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 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G (A (F ((1 <= pb3_4_3))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U (1 <= pb3_4_3))))
lola: processed formula length: 39
lola: 8 rewrites
lola: formula mentions 0 of 896 places; total mentions: 0
lola: closed formula file SquareGrid-PT-080408-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2172 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 7 will run for 327 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((A (X ((p1il_9_8 <= pbl_7_5))) AND A (G ((pb3_8_2 <= pbl_6_3)))) AND E (X (((p4o_3_9 <= pb2_2_4) AND (p1o_2_8 <= p1il_4_2))))) AND ((A (X ((p4i_1_2 <= p4i_7_4))) OR ((3 <= pb3_1_3) OR (3 <= p1il_8_1) OR (pbl_3_8 <= p4il_7_5))) OR (pb1_8_1 <= pb2_3_6)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 327 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((p1il_9_8 <= pbl_7_5)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((p1il_9_8 <= pbl_7_5))
lola: processed formula length: 25
lola: 5 rewrites
lola: formula mentions 0 of 896 places; total mentions: 0
lola: closed formula file SquareGrid-PT-080408-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2172 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 8 will run for 368 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((pb3_8_2 <= pbl_6_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 2172 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: lola: SUBRESULT
lola: state equation: write sara problem file to SquareGrid-PT-080408-CTLCardinality-8.sara
result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 368 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (NOT(A (F ((pb4_7_8 <= p4o_8_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: lola: state equation: calling and running sara
========================================
lola: processed formula: A(TRUE U NOT(A(TRUE U (pb4_7_8 <= p4o_8_1))))
lola: processed formula length: 45
lola: 6 rewrites
lola: formula mentions 0 of 896 places; total mentions: 0
lola: closed formula file SquareGrid-PT-080408-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2172 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 SquareGrid-PT-080408-CTLCardinality-8.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 9 will run for 421 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (((2 <= pb3_3_4) U (p1i_4_7 <= p1o_9_7)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(E((2 <= pb3_3_4) U (p1i_4_7 <= p1o_9_7)))))
lola: processed formula length: 60
lola: 2 rewrites
lola: formula mentions 0 of 896 places; total mentions: 0
lola: closed formula file SquareGrid-PT-080408-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2172 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: 215649 markings, 774535 edges, 3108995021618020352 markings/sec, 0 secs
lola: 411919 markings, 1488439 edges, 39254 markings/sec, 5 secs
lola: 604501 markings, 2166995 edges, 38516 markings/sec, 10 secs
lola: 803036 markings, 2854892 edges, 39707 markings/sec, 15 secs
lola: 1016918 markings, 3505289 edges, 42776 markings/sec, 20 secs
lola: 1216923 markings, 4150011 edges, 40001 markings/sec, 25 secs
lola: 1309703 markings, 4646172 edges, 18556 markings/sec, 30 secs
lola: 1384894 markings, 5134821 edges, 15038 markings/sec, 35 secs
lola: 1545026 markings, 5781533 edges, 32026 markings/sec, 40 secs
lola: 1704944 markings, 6400595 edges, 31984 markings/sec, 45 secs
lola: 1886952 markings, 7033244 edges, 36402 markings/sec, 50 secs
lola: 2036517 markings, 7612564 edges, 29913 markings/sec, 55 secs
lola: 2239712 markings, 8223231 edges, 40639 markings/sec, 60 secs
lola: 2426324 markings, 8797139 edges, 37322 markings/sec, 65 secs
lola: 2593722 markings, 9368643 edges, 33480 markings/sec, 70 secs
lola: 2676060 markings, 9829257 edges, 16468 markings/sec, 75 secs
lola: 2748156 markings, 10302008 edges, 14419 markings/sec, 80 secs
lola: 2903317 markings, 10930069 edges, 31032 markings/sec, 85 secs
lola: 3061055 markings, 11525835 edges, 31548 markings/sec, 90 secs
lola: 3226477 markings, 12103317 edges, 33084 markings/sec, 95 secs
lola: 3364317 markings, 12627346 edges, 27568 markings/sec, 100 secs
lola: 3548625 markings, 13198218 edges, 36862 markings/sec, 105 secs
lola: 3721475 markings, 13727104 edges, 34570 markings/sec, 110 secs
lola: 3893667 markings, 14277436 edges, 34438 markings/sec, 115 secs
lola: 3986500 markings, 14737881 edges, 18567 markings/sec, 120 secs
lola: 4057288 markings, 15186278 edges, 14158 markings/sec, 125 secs
lola: 4192066 markings, 15811585 edges, 26956 markings/sec, 130 secs
lola: 4386975 markings, 16552725 edges, 38982 markings/sec, 135 secs
lola: 4595892 markings, 17278022 edges, 41783 markings/sec, 140 secs
lola: 4796240 markings, 17981374 edges, 40070 markings/sec, 145 secs
lola: 5014024 markings, 18642536 edges, 43557 markings/sec, 150 secs
lola: 5214633 markings, 19286373 edges, 40122 markings/sec, 155 secs
lola: 5308122 markings, 19775915 edges, 18698 markings/sec, 160 secs
lola: 5383560 markings, 20264163 edges, 15088 markings/sec, 165 secs
lola: 5505913 markings, 20895263 edges, 24471 markings/sec, 170 secs
lola: 5621836 markings, 21470241 edges, 23185 markings/sec, 175 secs
lola: 5752787 markings, 22061603 edges, 26190 markings/sec, 180 secs
lola: 5859304 markings, 22551726 edges, 21303 markings/sec, 185 secs
lola: 5961170 markings, 23100667 edges, 20373 markings/sec, 190 secs
lola: 6126637 markings, 23687043 edges, 33093 markings/sec, 195 secs
lola: 6277962 markings, 24241211 edges, 30265 markings/sec, 200 secs
lola: 6426522 markings, 24797932 edges, 29712 markings/sec, 205 secs
lola: 6527793 markings, 25290252 edges, 20254 markings/sec, 210 secs
lola: 6586779 markings, 25693947 edges, 11797 markings/sec, 215 secs
lola: 6639650 markings, 26099110 edges, 10574 markings/sec, 220 secs
lola: 6742576 markings, 26620056 edges, 20585 markings/sec, 225 secs
lola: 6915949 markings, 27253754 edges, 34675 markings/sec, 230 secs
lola: 7088924 markings, 27862863 edges, 34595 markings/sec, 235 secs
lola: 7246716 markings, 28452871 edges, 31558 markings/sec, 240 secs
lola: 7443899 markings, 29040735 edges, 39437 markings/sec, 245 secs
lola: 7630637 markings, 29618766 edges, 37348 markings/sec, 250 secs
lola: 7780487 markings, 30176710 edges, 29970 markings/sec, 255 secs
lola: 7860339 markings, 30642557 edges, 15970 markings/sec, 260 secs
lola: 7936255 markings, 31136704 edges, 15183 markings/sec, 265 secs
lola: 8141745 markings, 31907591 edges, 41098 markings/sec, 270 secs
lola: 8351001 markings, 32644780 edges, 41851 markings/sec, 275 secs
lola: 8558096 markings, 33367710 edges, 41419 markings/sec, 280 secs
lola: 8783524 markings, 34052603 edges, 45086 markings/sec, 285 secs
lola: 8987767 markings, 34717846 edges, 40849 markings/sec, 290 secs
lola: 9082390 markings, 35237431 edges, 18925 markings/sec, 295 secs
lola: 9160713 markings, 35754739 edges, 15665 markings/sec, 300 secs
lola: 9271446 markings, 36312547 edges, 22147 markings/sec, 305 secs
lola: 9389503 markings, 36818574 edges, 23611 markings/sec, 310 secs
lola: 9505870 markings, 37330525 edges, 23273 markings/sec, 315 secs
lola: 9623385 markings, 37835175 edges, 23503 markings/sec, 320 secs
lola: 9726289 markings, 38284475 edges, 20581 markings/sec, 325 secs
lola: 9819658 markings, 38731511 edges, 18674 markings/sec, 330 secs
lola: 9944936 markings, 39196359 edges, 25056 markings/sec, 335 secs
lola: 10065282 markings, 39666589 edges, 24069 markings/sec, 340 secs
lola: 10185898 markings, 40139572 edges, 24123 markings/sec, 345 secs
lola: 10293978 markings, 40587770 edges, 21616 markings/sec, 350 secs
lola: 10413838 markings, 41047021 edges, 23972 markings/sec, 355 secs
lola: 10528511 markings, 41496819 edges, 22935 markings/sec, 360 secs
lola: 10643455 markings, 41972787 edges, 22989 markings/sec, 365 secs
lola: 10770017 markings, 42460292 edges, 25312 markings/sec, 370 secs
lola: 10902300 markings, 42976840 edges, 26457 markings/sec, 375 secs
lola: 11033507 markings, 43493438 edges, 26241 markings/sec, 380 secs
lola: 11113204 markings, 43902224 edges, 15939 markings/sec, 385 secs
lola: 11188872 markings, 44298395 edges, 15134 markings/sec, 390 secs
lola: 11260674 markings, 44695819 edges, 14360 markings/sec, 395 secs
lola: 11330382 markings, 45086167 edges, 13942 markings/sec, 400 secs
lola: 11400558 markings, 45480760 edges, 14035 markings/sec, 405 secs
lola: 11468275 markings, 45898266 edges, 13543 markings/sec, 410 secs
lola: 11547004 markings, 46335387 edges, 15746 markings/sec, 415 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 421 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (X ((p4i_4_9 + 1 <= p4i_8_4)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U AX((p4i_4_9 + 1 <= p4i_8_4)))
lola: processed formula length: 38
lola: 2 rewrites
lola: formula mentions 0 of 896 places; total mentions: 0
lola: closed formula file SquareGrid-PT-080408-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2172 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 11 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((3 <= p4i_8_2) OR E (F ((2 <= p1i_2_6)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p4i_8_2 <= 2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p4i_8_2 <= 2)
lola: processed formula length: 14
lola: 5 rewrites
lola: formula mentions 0 of 896 places; total mentions: 0
lola: closed formula file SquareGrid-PT-080408-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 12 will run for 632 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p1i_2_6 <= 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 2172 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SquareGrid-PT-080408-CTLCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file SquareGrid-PT-080408-CTLCardinality-12.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 12 will run for 631 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= pb3_3_1) AND (pbl_4_5 <= p1o_8_5))))
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 2172 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 SquareGrid-PT-080408-CTLCardinality-12.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: calling and running sara
lola: lola: subprocess 13 will run for 842 seconds at most (--localtimelimit=-1)
========================================
lola: ========================================
lola: ...considering subproblem: ((p4il_3_5 <= p1ol_7_8) AND E (X (E (X ((pbl_4_7 <= p4i_6_2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 842 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p4il_3_5 <= p1ol_7_8)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p4il_3_5 <= p1ol_7_8)sara:
try reading problem file SquareGrid-PT-080408-CTLCardinality-12.sara.lola:
processed formula length: 22
lola: 0 rewrites
lola: formula mentions 0 of 896 places; total mentions: 0
lola: closed formula file SquareGrid-PT-080408-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 14 will run for 1263 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (X ((pbl_4_7 <= p4i_6_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(EX((pbl_4_7 <= p4i_6_2)))
lola: processed formula length: 28
lola: 2 rewrites
lola: formula mentions 0 of 896 places; total mentions: 0
lola: closed formula file SquareGrid-PT-080408-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2172 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 14 will run for 1263 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (G ((3 <= pbl_5_8)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U E(TRUE U (pbl_5_8 <= 2))))
lola: processed formula length: 39
lola: 4 rewrites
lola: formula mentions 0 of 896 places; total mentions: 0
lola: closed formula file SquareGrid-PT-080408-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2172 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 15 will run for 2527 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (((2 <= pb3_5_4) U ((3 <= p1i_3_3) AND (1 <= pbl_8_7)))) AND NOT(E (F ((pbl_2_7 <= p1il_7_6)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2527 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((2 <= pb3_5_4) U ((3 <= p1i_3_3) AND (1 <= pbl_8_7))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((2 <= pb3_5_4) U ((3 <= p1i_3_3) AND (1 <= pbl_8_7)))
lola: processed formula length: 55
lola: 4 rewrites
lola: formula mentions 0 of 896 places; total mentions: 0
lola: closed formula file SquareGrid-PT-080408-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2172 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: RESULT
lola:
SUMMARY: no no no no unknown unknown yes no yes unknown yes yes yes no no no
lola: ========================================
lola: ========================================
FORMULA SquareGrid-PT-080408-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-080408-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-080408-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-080408-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-080408-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-080408-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-080408-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-080408-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-080408-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-080408-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-080408-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-080408-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-080408-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-080408-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-080408-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-080408-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496563594435

--------------------
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_SquareGrid-PT-080408"
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_SquareGrid-PT-080408.tgz
mv S_SquareGrid-PT-080408 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_SquareGrid-PT-080408, 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-149443464000138"
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 ;