Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
......
=====================================================================
Generated by BenchKit 2-3254
Executing tool lola
Input is HypertorusGrid-PT-d4k3p2b08, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r038-blw7-149440484500048
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494616838325


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
CTLCardinality @ HypertorusGrid-PT-d4k3p2b08 @ 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: 7209/65536 symbol table entries, 1791 collisions
lola: preprocessing...
lola: finding significant places
lola: 2025 places, 5184 transitions, 1295 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 5913 transition conflict sets
lola: TASK
lola: reading formula from HypertorusGrid-PT-d4k3p2b08-CTLCardinality.task
lola: (A (F (A (X ((pil_d1_n1_2_1_3_3 <= pi_d3_n1_2_2_2_2))))) OR (E (G (((pb_d4_n2_3_3_2_3 <= pi_d1_n1_1_2_1_1) OR (po_d3_n1_1_2_2_3 <= pil_d2_n1_1_3_2_1)))) OR (3 <= pol_d1_n1_1_3_1_3))) : (((1 <= pol_d1_n1_3_3_3_2) OR (3 <= pb_d1_n2_2_2_3_1) OR (pb_d2_n1_1_3_2_2 + 1 <= pi_d2_n1_1_2_3_1)) AND (A (((pb_d3_n1_1_1_3_3 <= pb_d4_n1_2_2_1_2) U (pb_d1_n2_2_1_3_3 <= pbl_2_1_2_3))) AND E (((pol_d2_n1_1_2_2_1 <= pil_d1_n1_3_3_1_2) U (3 <= pil_d4_n1_3_1_1_1))))) : NOT(E (F (((pb_d2_n2_2_1_2_1 + 1 <= po_d3_n1_3_1_2_3) AND (pb_d3_n2_1_3_2_1 <= 0))))) : E (X (E (G ((po_d1_n1_2_2_3_3 <= 2))))) : (E (F ((((1 <= po_d4_n1_3_1_3_1) AND (2 <= pi_d4_n1_3_3_1_1)) OR (2 <= pil_d1_n1_1_1_2_1)))) OR A (X ((2 <= pil_d3_n1_2_3_1_1)))) : A (G (A (F ((pb_d4_n2_3_2_2_1 <= pb_d2_n2_3_3_1_2))))) : A (F ((A (G ((pb_d2_n2_2_2_2_2 <= pb_d2_n2_2_2_3_2))) AND (3 <= po_d4_n1_3_3_1_1)))) : ((E (F (((pb_d4_n2_3_3_3_2 <= pb_d3_n1_3_1_1_2) AND (po_d4_n1_2_2_2_3 <= pi_d2_n1_2_2_3_1)))) AND E (G ((1 <= pb_d2_n1_1_1_3_3)))) AND A (X ((((3 <= po_d1_n1_2_2_3_3) AND (2 <= pb_d4_n1_3_1_3_2)) OR (pol_d1_n1_2_3_2_2 <= pb_d3_n1_1_1_2_1))))) : A (F (A (X (((pb_d2_n1_3_1_3_3 <= po_d3_n1_2_3_2_3) AND (pb_d4_n1_3_1_2_2 <= pbl_2_3_2_3)))))) : E (X (E (((1 <= pi_d3_n1_3_3_3_1) U (pbl_1_2_2_1 <= po_d1_n1_3_2_1_3))))) : A (F (A (F ((pb_d4_n1_1_3_2_2 <= 1))))) : (E (F (E (G ((2 <= pb_d1_n2_3_1_1_1))))) AND E (F (((pil_d3_n1_1_2_3_2 + 1 <= po_d3_n1_1_1_3_1) AND (po_d1_n1_2_2_1_3 + 1 <= pi_d2_n1_1_2_1_3))))) : NOT((A (G (((2 <= pb_d4_n2_1_2_1_1) OR (2 <= pi_d2_n1_2_2_1_2)))) OR A (G ((pil_d4_n1_3_2_3_2 <= 1))))) : (NOT(NOT(E (G ((pb_d2_n1_2_1_2_2 <= pb_d3_n1_2_2_1_1))))) AND ((pb_d3_n1_3_1_2_3 <= pb_d1_n1_3_3_3_3) OR NOT(E (F ((3 <= pb_d2_n2_3_3_2_3)))))) : NOT(NOT((E (G ((pb_d2_n2_2_3_2_1 <= pb_d1_n2_1_2_1_1))) AND ((3 <= po_d3_n1_2_3_1_3) OR (2 <= pb_d4_n2_3_3_1_1) OR (pb_d4_n1_3_1_1_3 + 1 <= pil_d3_n1_2_3_1_3))))) : NOT((((pil_d4_n1_3_2_1_3 <= 1) OR (pil_d3_n1_3_1_3_1 + 1 <= pil_d4_n1_2_3_1_3) OR ((pi_d4_n1_2_1_2_1 <= 1) AND (pi_d4_n1_1_3_3_2 <= 2))) AND NOT(E (F ((3 <= pol_d1_n1_3_1_3_2))))))
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 (X ((pil_d1_n1_2_1_3_3 <= pi_d3_n1_2_2_2_2))))) OR (E (G (((pb_d4_n2_3_3_2_3 <= pi_d1_n1_1_2_1_1) OR (po_d3_n1_1_2_2_3 <= pil_d2_n1_1_3_2_1)))) OR (3 <= pol_d1_n1_1_3_1_3)))
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 (X ((pil_d1_n1_2_1_3_3 <= pi_d3_n1_2_2_2_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U AX((pil_d1_n1_2_1_3_3 <= pi_d3_n1_2_2_2_2)))
lola: processed formula length: 53
lola: 2 rewrites
lola: formula mentions 0 of 2025 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d4k3p2b08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5180 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 (G (((pb_d4_n2_3_3_2_3 <= pi_d1_n1_1_2_1_1) OR (po_d3_n1_1_2_2_3 <= pil_d2_n1_1_3_2_1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((pi_d1_n1_1_2_1_1 + 1 <= pb_d4_n2_3_3_2_3) AND (pil_d2_n1_1_3_2_1 + 1 <= po_d3_n1_1_2_2_3))))
lola: processed formula length: 107
lola: 2 rewrites
lola: formula mentions 0 of 2025 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d4k3p2b08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5180 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((1 <= pol_d1_n1_3_3_3_2) OR (3 <= pb_d1_n2_2_2_3_1) OR (pb_d2_n1_1_3_2_2 + 1 <= pi_d2_n1_1_2_3_1)) AND (A (((pb_d3_n1_1_1_3_3 <= pb_d4_n1_2_2_1_2) U (pb_d1_n2_2_1_3_3 <= pbl_2_1_2_3))) AND E (((pol_d2_n1_1_2_2_1 <= pil_d1_n1_3_3_1_2) U (3 <= pil_d4_n1_3_1_1_1)))))
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: ((1 <= pol_d1_n1_3_3_3_2) OR (3 <= pb_d1_n2_2_2_3_1) OR (pb_d2_n1_1_3_2_2 + 1 <= pi_d2_n1_1_2_3_1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= pol_d1_n1_3_3_3_2) OR (3 <= pb_d1_n2_2_2_3_1) OR (pb_d2_n1_1_3_2_2 + 1 <= pi_d2_n1_1_2_3_1))
lola: processed formula length: 101
lola: 0 rewrites
lola: formula mentions 0 of 2025 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d4k3p2b08-CTLCardinality.task
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((pb_d3_n1_1_1_3_3 <= pb_d4_n1_2_2_1_2) U (pb_d1_n2_2_1_3_3 <= pbl_2_1_2_3)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((pb_d3_n1_1_1_3_3 <= pb_d4_n1_2_2_1_2) U (pb_d1_n2_2_1_3_3 <= pbl_2_1_2_3))
lola: processed formula length: 77
lola: 1 rewrites
lola: formula mentions 0 of 2025 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d4k3p2b08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5180 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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((pol_d2_n1_1_2_2_1 <= pil_d1_n1_3_3_1_2) U (3 <= pil_d4_n1_3_1_1_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((pol_d2_n1_1_2_2_1 <= pil_d1_n1_3_3_1_2) U (3 <= pil_d4_n1_3_1_1_1))
lola: processed formula length: 70
lola: 1 rewrites
lola: formula mentions 0 of 2025 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d4k3p2b08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5180 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: 246131 markings, 600807 edges, 2317305143055351808 markings/sec, 0 secs
lola: 300908 markings, 1037008 edges, 10955 markings/sec, 5 secs
lola: 482732 markings, 1594660 edges, 36365 markings/sec, 10 secs
lola: 566212 markings, 2155694 edges, 16696 markings/sec, 15 secs
lola: 693018 markings, 2653720 edges, 25361 markings/sec, 20 secs
lola: 783653 markings, 3110289 edges, 18127 markings/sec, 25 secs
lola: 891822 markings, 3518844 edges, 21634 markings/sec, 30 secs
lola: 1014592 markings, 4097250 edges, 24554 markings/sec, 35 secs
lola: 1109972 markings, 4632647 edges, 19076 markings/sec, 40 secs
lola: 1279707 markings, 5148206 edges, 33947 markings/sec, 45 secs
lola: 1342790 markings, 5639315 edges, 12617 markings/sec, 50 secs
lola: 1486824 markings, 6132237 edges, 28807 markings/sec, 55 secs
lola: 1561191 markings, 6597815 edges, 14873 markings/sec, 60 secs
lola: 1685018 markings, 7009088 edges, 24765 markings/sec, 65 secs
lola: 1775884 markings, 7545243 edges, 18173 markings/sec, 70 secs
lola: 1885869 markings, 8064156 edges, 21997 markings/sec, 75 secs
lola: 2025878 markings, 8571836 edges, 28002 markings/sec, 80 secs
lola: 2082562 markings, 9006959 edges, 11337 markings/sec, 85 secs
lola: 2271803 markings, 9635391 edges, 37848 markings/sec, 90 secs
lola: 2336031 markings, 10117492 edges, 12846 markings/sec, 95 secs
lola: 2455382 markings, 10511708 edges, 23870 markings/sec, 100 secs
lola: 2510505 markings, 10989763 edges, 11025 markings/sec, 105 secs
lola: 2653263 markings, 11411812 edges, 28552 markings/sec, 110 secs
lola: 2700384 markings, 11847019 edges, 9424 markings/sec, 115 secs
lola: 2858662 markings, 12424552 edges, 31656 markings/sec, 120 secs
lola: 2974302 markings, 12995146 edges, 23128 markings/sec, 125 secs
lola: 3060250 markings, 13501147 edges, 17190 markings/sec, 130 secs
lola: 3241669 markings, 14128192 edges, 36284 markings/sec, 135 secs
lola: 3353024 markings, 14716253 edges, 22271 markings/sec, 140 secs
lola: 3446171 markings, 15240824 edges, 18629 markings/sec, 145 secs
lola: 3615546 markings, 15756904 edges, 33875 markings/sec, 150 secs
lola: 3675916 markings, 16239361 edges, 12074 markings/sec, 155 secs
lola: 3807571 markings, 16633095 edges, 26331 markings/sec, 160 secs
lola: 3870257 markings, 17114661 edges, 12537 markings/sec, 165 secs
lola: 4003302 markings, 17603155 edges, 26609 markings/sec, 170 secs
lola: 4092697 markings, 18094160 edges, 17879 markings/sec, 175 secs
lola: 4193347 markings, 18530554 edges, 20130 markings/sec, 180 secs
lola: 4344651 markings, 19105749 edges, 30261 markings/sec, 185 secs
lola: 4421222 markings, 19632279 edges, 15314 markings/sec, 190 secs
lola: 4564553 markings, 20105637 edges, 28666 markings/sec, 195 secs
lola: 4652344 markings, 20641618 edges, 17558 markings/sec, 200 secs
lola: 4755932 markings, 21132465 edges, 20718 markings/sec, 205 secs
lola: 4852492 markings, 21537679 edges, 19312 markings/sec, 210 secs
lola: 4940211 markings, 21873714 edges, 17544 markings/sec, 215 secs
lola: 5009266 markings, 22285350 edges, 13811 markings/sec, 220 secs
lola: 5124087 markings, 22691964 edges, 22964 markings/sec, 225 secs
lola: 5208412 markings, 23179375 edges, 16865 markings/sec, 230 secs
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F (((pb_d2_n2_2_1_2_1 + 1 <= po_d3_n1_3_1_2_3) AND (pb_d3_n2_1_3_2_1 <= 0)))))
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 5180 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 HypertorusGrid-PT-d4k3p2b08-CTLCardinality-2.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (G ((po_d1_n1_2_2_3_3 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
sara: try reading problem file HypertorusGrid-PT-d4k3p2b08-CTLCardinality-2.sara.
lola: processed formula: EX(NOT(A(TRUE U (3 <= po_d1_n1_2_2_3_3))))
lola: processed formula length: 42
lola: 3 rewrites
lola: formula mentions 0 of 2025 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d4k3p2b08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5180 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 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F ((((1 <= po_d4_n1_3_1_3_1) AND (2 <= pi_d4_n1_3_3_1_1)) OR (2 <= pil_d1_n1_1_1_2_1)))) OR A (X ((2 <= pil_d3_n1_2_3_1_1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= po_d4_n1_3_1_3_1) AND (2 <= pi_d4_n1_3_3_1_1)) OR (2 <= pil_d1_n1_1_1_2_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 5180 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 3 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d4k3p2b08-CTLCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file HypertorusGrid-PT-d4k3p2b08-CTLCardinality-4.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 5 will run for 299 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((2 <= pil_d3_n1_2_3_1_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((2 <= pil_d3_n1_2_3_1_1))
lola: processed formula length: 28
lola: 1 rewrites
lola: formula mentions 0 of 2025 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d4k3p2b08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5180 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 5 will run for 299 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((pb_d4_n2_3_2_2_1 <= pb_d2_n2_3_3_1_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U (pb_d4_n2_3_2_2_1 <= pb_d2_n2_3_3_1_2)))))
lola: processed formula length: 68
lola: 2 rewrites
lola: formula mentions 0 of 2025 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d4k3p2b08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5180 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: 239087 markings, 825372 edges, 2692683910336217088 markings/sec, 0 secs
lola: 328281 markings, 1456132 edges, 17839 markings/sec, 5 secs
lola: 477410 markings, 2065580 edges, 29826 markings/sec, 10 secs
lola: 548969 markings, 2649419 edges, 14312 markings/sec, 15 secs
lola: 684304 markings, 3236551 edges, 27067 markings/sec, 20 secs
lola: 769189 markings, 3839969 edges, 16977 markings/sec, 25 secs
lola: 888093 markings, 4387608 edges, 23781 markings/sec, 30 secs
lola: 972144 markings, 4951745 edges, 16810 markings/sec, 35 secs
lola: 1089616 markings, 5526594 edges, 23494 markings/sec, 40 secs
lola: 1202905 markings, 6184038 edges, 22658 markings/sec, 45 secs
lola: 1291557 markings, 6737682 edges, 17730 markings/sec, 50 secs
lola: 1435590 markings, 7388408 edges, 28807 markings/sec, 55 secs
lola: 1506769 markings, 7946553 edges, 14236 markings/sec, 60 secs
lola: 1654963 markings, 8549103 edges, 29639 markings/sec, 65 secs
lola: 1710095 markings, 9058737 edges, 11026 markings/sec, 70 secs
lola: 1869810 markings, 9701712 edges, 31943 markings/sec, 75 secs
lola: 1935060 markings, 10272690 edges, 13050 markings/sec, 80 secs
lola: 2069596 markings, 10799609 edges, 26907 markings/sec, 85 secs
lola: 2131970 markings, 11358245 edges, 12475 markings/sec, 90 secs
lola: 2277403 markings, 12010905 edges, 29087 markings/sec, 95 secs
lola: 2361547 markings, 12597445 edges, 16829 markings/sec, 100 secs
lola: 2473904 markings, 13109900 edges, 22471 markings/sec, 105 secs
lola: 2561694 markings, 13699783 edges, 17558 markings/sec, 110 secs
lola: 2670254 markings, 14234530 edges, 21712 markings/sec, 115 secs
lola: 2757571 markings, 14781222 edges, 17463 markings/sec, 120 secs
lola: 2864396 markings, 15286778 edges, 21365 markings/sec, 125 secs
lola: 2932801 markings, 15765501 edges, 13681 markings/sec, 130 secs
lola: 3051471 markings, 16235995 edges, 23734 markings/sec, 135 secs
lola: 3111721 markings, 16771064 edges, 12050 markings/sec, 140 secs
lola: 3248260 markings, 17357435 edges, 27308 markings/sec, 145 secs
lola: 3330815 markings, 17960810 edges, 16511 markings/sec, 150 secs
lola: 3444019 markings, 18489535 edges, 22641 markings/sec, 155 secs
lola: 3535602 markings, 19082953 edges, 18317 markings/sec, 160 secs
lola: 3637680 markings, 19612006 edges, 20416 markings/sec, 165 secs
lola: 3718493 markings, 20110567 edges, 16163 markings/sec, 170 secs
lola: 3825304 markings, 20565066 edges, 21362 markings/sec, 175 secs
lola: 3904167 markings, 21145642 edges, 15773 markings/sec, 180 secs
lola: 4019715 markings, 21748416 edges, 23110 markings/sec, 185 secs
lola: 4137427 markings, 22374593 edges, 23542 markings/sec, 190 secs
lola: 4210672 markings, 22881950 edges, 14649 markings/sec, 195 secs
lola: 4382403 markings, 23616992 edges, 34346 markings/sec, 200 secs
lola: 4461953 markings, 24259860 edges, 15910 markings/sec, 205 secs
lola: 4585530 markings, 24848612 edges, 24715 markings/sec, 210 secs
lola: 4674089 markings, 25418242 edges, 17712 markings/sec, 215 secs
lola: 4774034 markings, 25908501 edges, 19989 markings/sec, 220 secs
lola: 4893455 markings, 26580421 edges, 23884 markings/sec, 225 secs
lola: 4968654 markings, 27146095 edges, 15040 markings/sec, 230 secs
lola: 5082169 markings, 27632809 edges, 22703 markings/sec, 235 secs
lola: 5149003 markings, 28049617 edges, 13367 markings/sec, 240 secs
lola: 5275362 markings, 28694029 edges, 25272 markings/sec, 245 secs
lola: 5348545 markings, 29261453 edges, 14637 markings/sec, 250 secs
lola: 5497295 markings, 29854232 edges, 29750 markings/sec, 255 secs
lola: 5549924 markings, 30369362 edges, 10526 markings/sec, 260 secs
lola: 5700580 markings, 31039805 edges, 30131 markings/sec, 265 secs
lola: 5784699 markings, 31635781 edges, 16824 markings/sec, 270 secs
lola: 5887102 markings, 32148891 edges, 20481 markings/sec, 275 secs
lola: 6018376 markings, 32842418 edges, 26255 markings/sec, 280 secs
lola: 6098927 markings, 33452761 edges, 16110 markings/sec, 285 secs
lola: 6245315 markings, 34051886 edges, 29278 markings/sec, 290 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 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((A (G ((pb_d2_n2_2_2_2_2 <= pb_d2_n2_2_2_3_2))) AND (3 <= po_d4_n1_3_3_1_1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (NOT(E(TRUE U (pb_d2_n2_2_2_3_2 + 1 <= pb_d2_n2_2_2_2_2))) AND (3 <= po_d4_n1_3_3_1_1)))
lola: processed formula length: 97
lola: 3 rewrites
lola: formula mentions 0 of 2025 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d4k3p2b08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5180 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 333 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((E (F (((pb_d4_n2_3_3_3_2 <= pb_d3_n1_3_1_1_2) AND (po_d4_n1_2_2_2_3 <= pi_d2_n1_2_2_3_1)))) AND E (G ((1 <= pb_d2_n1_1_1_3_3)))) AND A (X ((((3 <= po_d1_n1_2_2_3_3) AND (2 <= pb_d4_n1_3_1_3_2)) OR (pol_d1_n1_2_3_2_2 <= pb_d3_n1_1_1_2_1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 333 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((pb_d4_n2_3_3_3_2 <= pb_d3_n1_3_1_1_2) AND (po_d4_n1_2_2_2_3 <= pi_d2_n1_2_2_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 5180 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: yes
lola: produced by: state space
lola: state equation: write sara problem file to HypertorusGrid-PT-d4k3p2b08-CTLCardinality-7.sara
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 375 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((1 <= pb_d2_n1_1_1_3_3)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (pb_d2_n1_1_1_3_3 <= 0)))
lola: processed formula length: 38
lola: 3 rewrites
lola: formula mentions 0 of 2025 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d4k3p2b08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5180 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 9 will run for 428 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((((3 <= po_d1_n1_2_2_3_3) AND (2 <= pb_d4_n1_3_1_3_2)) OR (pol_d1_n1_2_3_2_2 <= pb_d3_n1_1_1_2_1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((((3 <= po_d1_n1_2_2_3_3) AND (2 <= pb_d4_n1_3_1_3_2)) OR (pol_d1_n1_2_3_2_2 <= pb_d3_n1_1_1_2_1)))
lola: processed formula length: 103
lola: 2 rewrites
lola: formula mentions 0 of 2025 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d4k3p2b08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5180 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: subprocess 8 will run for 375 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (X (((pb_d2_n1_3_1_3_3 <= po_d3_n1_2_3_2_3) AND (pb_d4_n1_3_1_2_2 <= pbl_2_3_2_3))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: ========================================
lola: processed formula: A(TRUE U AX(((pb_d2_n1_3_1_3_3 <= po_d3_n1_2_3_2_3) AND (pb_d4_n1_3_1_2_2 <= pbl_2_3_2_3))))
lola: processed formula length: 92
lola: 2 rewrites
lola: formula mentions 0 of 2025 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d4k3p2b08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5180 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 9 will run for 428 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (((1 <= pi_d3_n1_3_3_3_1) U (pbl_1_2_2_1 <= po_d1_n1_3_2_1_3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(E((1 <= pi_d3_n1_3_3_3_1) U (pbl_1_2_2_1 <= po_d1_n1_3_2_1_3)))
lola: processed formula length: 66
lola: 2 rewrites
lola: formula mentions 0 of 2025 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d4k3p2b08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5180 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: 221472 markings, 689030 edges, 2073443909375098880 markings/sec, 0 secs
lola: 263173 markings, 1312607 edges, 8340 markings/sec, 5 secs
lola: 396636 markings, 1929479 edges, 26693 markings/sec, 10 secs
lola: 490598 markings, 2479008 edges, 18792 markings/sec, 15 secs
lola: 517881 markings, 3029853 edges, 5457 markings/sec, 20 secs
lola: 677594 markings, 3577184 edges, 31943 markings/sec, 25 secs
lola: 720707 markings, 4098131 edges, 8623 markings/sec, 30 secs
lola: 769170 markings, 4610868 edges, 9693 markings/sec, 35 secs
lola: 892989 markings, 5076847 edges, 24764 markings/sec, 40 secs
lola: 947728 markings, 5528029 edges, 10948 markings/sec, 45 secs
lola: 950600 markings, 5964620 edges, 574 markings/sec, 50 secs
lola: 1051223 markings, 6417798 edges, 20125 markings/sec, 55 secs
lola: 1164163 markings, 6861075 edges, 22588 markings/sec, 60 secs
lola: 1177581 markings, 7294687 edges, 2684 markings/sec, 65 secs
lola: 1250649 markings, 7779929 edges, 14614 markings/sec, 70 secs
lola: 1386675 markings, 8275320 edges, 27205 markings/sec, 75 secs
lola: 1404213 markings, 8747218 edges, 3508 markings/sec, 80 secs
lola: 1465862 markings, 9237340 edges, 12330 markings/sec, 85 secs
lola: 1573904 markings, 9667255 edges, 21608 markings/sec, 90 secs
lola: 1628420 markings, 10119054 edges, 10903 markings/sec, 95 secs
lola: 1631476 markings, 10557487 edges, 611 markings/sec, 100 secs
lola: 1743349 markings, 10995997 edges, 22375 markings/sec, 105 secs
lola: 1842483 markings, 11406754 edges, 19827 markings/sec, 110 secs
lola: 1855797 markings, 11844463 edges, 2663 markings/sec, 115 secs
lola: 1905761 markings, 12283578 edges, 9993 markings/sec, 120 secs
lola: 2000745 markings, 12676591 edges, 18997 markings/sec, 125 secs
lola: 2070382 markings, 13076873 edges, 13927 markings/sec, 130 secs
lola: 2080931 markings, 13501719 edges, 2110 markings/sec, 135 secs
lola: 2149863 markings, 13967797 edges, 13786 markings/sec, 140 secs
lola: 2277464 markings, 14410472 edges, 25520 markings/sec, 145 secs
lola: 2304942 markings, 14878808 edges, 5496 markings/sec, 150 secs
lola: 2357716 markings, 15337558 edges, 10555 markings/sec, 155 secs
lola: 2495305 markings, 15813186 edges, 27518 markings/sec, 160 secs
lola: 2527934 markings, 16284795 edges, 6526 markings/sec, 165 secs
lola: 2551882 markings, 16677906 edges, 4790 markings/sec, 170 secs
lola: 2641456 markings, 17037481 edges, 17915 markings/sec, 175 secs
lola: 2722757 markings, 17370517 edges, 16260 markings/sec, 180 secs
lola: 2750426 markings, 17783083 edges, 5534 markings/sec, 185 secs
lola: 2752537 markings, 18157168 edges, 422 markings/sec, 190 secs
lola: 2866973 markings, 18607219 edges, 22887 markings/sec, 195 secs
lola: 2962474 markings, 19019183 edges, 19100 markings/sec, 200 secs
lola: 2974143 markings, 19437158 edges, 2334 markings/sec, 205 secs
lola: 3036823 markings, 19882253 edges, 12536 markings/sec, 210 secs
lola: 3159277 markings, 20297094 edges, 24491 markings/sec, 215 secs
lola: 3195039 markings, 20743425 edges, 7152 markings/sec, 220 secs
lola: 3229680 markings, 21196753 edges, 6928 markings/sec, 225 secs
lola: 3373519 markings, 21683721 edges, 28768 markings/sec, 230 secs
lola: 3416093 markings, 22154137 edges, 8515 markings/sec, 235 secs
lola: 3442692 markings, 22587279 edges, 5320 markings/sec, 240 secs
lola: 3591084 markings, 23089454 edges, 29678 markings/sec, 245 secs
lola: 3636685 markings, 23589226 edges, 9120 markings/sec, 250 secs
lola: 3668379 markings, 24026552 edges, 6339 markings/sec, 255 secs
lola: 3778043 markings, 24380876 edges, 21933 markings/sec, 260 secs
lola: 3849730 markings, 24747991 edges, 14337 markings/sec, 265 secs
lola: 3856762 markings, 25123135 edges, 1406 markings/sec, 270 secs
lola: 3896383 markings, 25514090 edges, 7924 markings/sec, 275 secs
lola: 4001170 markings, 25928356 edges, 20957 markings/sec, 280 secs
lola: 4070238 markings, 26346547 edges, 13814 markings/sec, 285 secs
lola: 4076159 markings, 26772893 edges, 1184 markings/sec, 290 secs
lola: 4135794 markings, 27186425 edges, 11927 markings/sec, 295 secs
lola: 4259267 markings, 27607105 edges, 24695 markings/sec, 300 secs
lola: 4293463 markings, 28048920 edges, 6839 markings/sec, 305 secs
lola: 4323476 markings, 28481084 edges, 6003 markings/sec, 310 secs
lola: 4458296 markings, 28930194 edges, 26964 markings/sec, 315 secs
lola: 4509746 markings, 29361394 edges, 10290 markings/sec, 320 secs
lola: 4512423 markings, 29748852 edges, 535 markings/sec, 325 secs
lola: 4583587 markings, 30113163 edges, 14233 markings/sec, 330 secs
lola: 4676853 markings, 30437707 edges, 18653 markings/sec, 335 secs
lola: 4726018 markings, 30818834 edges, 9833 markings/sec, 340 secs
lola: 4728754 markings, 31162249 edges, 547 markings/sec, 345 secs
lola: 4763293 markings, 31535062 edges, 6908 markings/sec, 350 secs
lola: 4906077 markings, 32024097 edges, 28557 markings/sec, 355 secs
lola: 4944524 markings, 32514417 edges, 7689 markings/sec, 360 secs
lola: 4995413 markings, 32998455 edges, 10178 markings/sec, 365 secs
lola: 5139055 markings, 33514311 edges, 28728 markings/sec, 370 secs
lola: 5160976 markings, 33993844 edges, 4384 markings/sec, 375 secs
lola: 5209684 markings, 34396285 edges, 9742 markings/sec, 380 secs
lola: 5307169 markings, 34705110 edges, 19497 markings/sec, 385 secs
lola: 5370163 markings, 35053375 edges, 12599 markings/sec, 390 secs
lola: 5375547 markings, 35393268 edges, 1077 markings/sec, 395 secs
lola: 5407623 markings, 35763753 edges, 6415 markings/sec, 400 secs
lola: 5521071 markings, 36188638 edges, 22690 markings/sec, 405 secs
lola: 5586598 markings, 36607272 edges, 13105 markings/sec, 410 secs
lola: 5590432 markings, 37020796 edges, 767 markings/sec, 415 secs
lola: 5658647 markings, 37476629 edges, 13643 markings/sec, 420 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 428 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (F ((pb_d4_n1_1_3_2_2 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (pb_d4_n1_1_3_2_2 <= 1))
lola: processed formula length: 33
lola: 2 rewrites
lola: formula mentions 0 of 2025 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d4k3p2b08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5180 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 11 will run for 514 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (E (G ((2 <= pb_d1_n2_3_1_1_1))))) AND E (F (((pil_d3_n1_1_2_3_2 + 1 <= po_d3_n1_1_1_3_1) AND (po_d1_n1_2_2_1_3 + 1 <= pi_d2_n1_1_2_1_3)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 514 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((2 <= pb_d1_n2_3_1_1_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U (pb_d1_n2_3_1_1_1 <= 1))))
lola: processed formula length: 48
lola: 3 rewrites
lola: formula mentions 0 of 2025 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d4k3p2b08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5180 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 12 will run for 642 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((pil_d3_n1_1_2_3_2 + 1 <= po_d3_n1_1_1_3_1) AND (po_d1_n1_2_2_1_3 + 1 <= pi_d2_n1_1_2_1_3))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5180 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: yes
lola: produced by: state space
lola: state equation: write sara problem file to HypertorusGrid-PT-d4k3p2b08-CTLCardinality-12.sara
lola: The predicate is reachable.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 12 will run for 642 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((A (G (((2 <= pb_d4_n2_1_2_1_1) OR (2 <= pi_d2_n1_2_2_1_2)))) OR A (G ((pil_d4_n1_3_2_3_2 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 12 will run for 642 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((pb_d4_n2_1_2_1_1 <= 1) AND (pi_d2_n1_2_2_1_2 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
sara: try reading problem file HypertorusGrid-PT-d4k3p2b08-CTLCardinality-12.sara.
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5180 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: yes
lola: produced by: state space
lola: state equation: write sara problem file to HypertorusGrid-PT-d4k3p2b08-CTLCardinality-12.sara
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 857 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= pil_d4_n1_3_2_3_2)))
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 5180 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 HypertorusGrid-PT-d4k3p2b08-CTLCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file HypertorusGrid-PT-d4k3p2b08-CTLCardinality-13.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 855 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(NOT(E (G ((pb_d2_n1_2_1_2_2 <= pb_d3_n1_2_2_1_1))))) AND ((pb_d3_n1_3_1_2_3 <= pb_d1_n1_3_3_3_3) OR NOT(E (F ((3 <= pb_d2_n2_3_3_2_3))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 855 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((pb_d2_n1_2_1_2_2 <= pb_d3_n1_2_2_1_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (pb_d3_n1_2_2_1_1 + 1 <= pb_d2_n1_2_1_2_2)))
lola: processed formula length: 57
lola: 11 rewrites
lola: formula mentions 0 of 2025 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d4k3p2b08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5180 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 14 will run for 1283 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (pb_d3_n1_3_1_2_3 <= pb_d1_n1_3_3_3_3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (pb_d3_n1_3_1_2_3 <= pb_d1_n1_3_3_3_3)
lola: processed formula length: 38
lola: 9 rewrites
lola: formula mentions 0 of 2025 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d4k3p2b08-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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 14 will run for 1283 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT((E (G ((pb_d2_n2_2_3_2_1 <= pb_d1_n2_1_2_1_1))) AND ((3 <= po_d3_n1_2_3_1_3) OR (2 <= pb_d4_n2_3_3_1_1) OR (pb_d4_n1_3_1_1_3 + 1 <= pil_d3_n1_2_3_1_3)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1283 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((pb_d2_n2_2_3_2_1 <= pb_d1_n2_1_2_1_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (pb_d1_n2_1_2_1_1 + 1 <= pb_d2_n2_2_3_2_1)))
lola: processed formula length: 57
lola: 12 rewrites
lola: formula mentions 0 of 2025 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d4k3p2b08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5180 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 15 will run for 2567 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((3 <= po_d3_n1_2_3_1_3) OR (2 <= pb_d4_n2_3_3_1_1) OR (pb_d4_n1_3_1_1_3 + 1 <= pil_d3_n1_2_3_1_3))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((3 <= po_d3_n1_2_3_1_3) OR (2 <= pb_d4_n2_3_3_1_1) OR (pb_d4_n1_3_1_1_3 + 1 <= pil_d3_n1_2_3_1_3))
lola: processed formula length: 101
lola: 10 rewrites
lola: formula mentions 0 of 2025 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d4k3p2b08-CTLCardinality.task
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 15 will run for 2567 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((((pil_d4_n1_3_2_1_3 <= 1) OR (pil_d3_n1_3_1_3_1 + 1 <= pil_d4_n1_2_3_1_3) OR ((pi_d4_n1_2_1_2_1 <= 1) AND (pi_d4_n1_1_3_3_2 <= 2))) AND NOT(E (F ((3 <= pol_d1_n1_3_1_3_2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2567 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((2 <= pil_d4_n1_3_2_1_3) AND (pil_d4_n1_2_3_1_3 <= pil_d3_n1_3_1_3_1) AND ((2 <= pi_d4_n1_2_1_2_1) OR (3 <= pi_d4_n1_1_3_3_2)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((2 <= pil_d4_n1_3_2_1_3) AND (pil_d4_n1_2_3_1_3 <= pil_d3_n1_3_1_3_1) AND ((2 <= pi_d4_n1_2_1_2_1) OR (3 <= pi_d4_n1_1_3_3_2)))
lola: processed formula length: 129
lola: 8 rewrites
lola: formula mentions 0 of 2025 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d4k3p2b08-CTLCardinality.task
lola: processed formula with 4 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: 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: RESULT
lola:
SUMMARY: yes unknown no yes no unknown no yes no unknown no yes no yes yes unknown
FORMULA HypertorusGrid-PT-d4k3p2b08-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494617811616

--------------------
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="HypertorusGrid-PT-d4k3p2b08"
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/HypertorusGrid-PT-d4k3p2b08.tgz
mv HypertorusGrid-PT-d4k3p2b08 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is HypertorusGrid-PT-d4k3p2b08, 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 r038-blw7-149440484500048"
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 ;