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 S_HypertorusGrid-PT-d4k3p2b08, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r118-blw7-149441649800048
=====================================================================

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


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


checking for too many tokens
===========================================================================================
S_HypertorusGrid-PT-d4k3p2b08: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ S_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: SUBRESULT
lola: 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: 264448 markings, 643310 edges, 3225861287900610560 markings/sec, 0 secs
lola: 357216 markings, 1231290 edges, 18554 markings/sec, 5 secs
lola: 493096 markings, 1786019 edges, 27176 markings/sec, 10 secs
lola: 666105 markings, 2432000 edges, 34602 markings/sec, 15 secs
lola: 748503 markings, 2983675 edges, 16480 markings/sec, 20 secs
lola: 889678 markings, 3467091 edges, 28235 markings/sec, 25 secs
lola: 1004601 markings, 4071913 edges, 22985 markings/sec, 30 secs
lola: 1110350 markings, 4633351 edges, 21150 markings/sec, 35 secs
lola: 1287205 markings, 5220085 edges, 35371 markings/sec, 40 secs
lola: 1387125 markings, 5798162 edges, 19984 markings/sec, 45 secs
lola: 1490928 markings, 6293893 edges, 20761 markings/sec, 50 secs
lola: 1617167 markings, 6778428 edges, 25248 markings/sec, 55 secs
lola: 1689924 markings, 7230112 edges, 14551 markings/sec, 60 secs
lola: 1878837 markings, 7850335 edges, 37783 markings/sec, 65 secs
lola: 1966184 markings, 8404504 edges, 17469 markings/sec, 70 secs
lola: 2081155 markings, 8872967 edges, 22994 markings/sec, 75 secs
lola: 2246448 markings, 9505268 edges, 33059 markings/sec, 80 secs
lola: 2317758 markings, 10042707 edges, 14262 markings/sec, 85 secs
lola: 2446973 markings, 10483883 edges, 25843 markings/sec, 90 secs
lola: 2506534 markings, 10974394 edges, 11912 markings/sec, 95 secs
lola: 2652085 markings, 11407639 edges, 29110 markings/sec, 100 secs
lola: 2716585 markings, 11905949 edges, 12900 markings/sec, 105 secs
lola: 2860073 markings, 12473583 edges, 28698 markings/sec, 110 secs
lola: 2997791 markings, 13047701 edges, 27544 markings/sec, 115 secs
lola: 3067180 markings, 13522957 edges, 13878 markings/sec, 120 secs
lola: 3242762 markings, 14152125 edges, 35116 markings/sec, 125 secs
lola: 3376235 markings, 14768108 edges, 26695 markings/sec, 130 secs
lola: 3462374 markings, 15294055 edges, 17228 markings/sec, 135 secs
lola: 3609369 markings, 15731964 edges, 29399 markings/sec, 140 secs
lola: 3659808 markings, 16181694 edges, 10088 markings/sec, 145 secs
lola: 3793968 markings, 16576248 edges, 26832 markings/sec, 150 secs
lola: 3832897 markings, 16984061 edges, 7786 markings/sec, 155 secs
lola: 3995567 markings, 17482220 edges, 32534 markings/sec, 160 secs
lola: 4053502 markings, 17951626 edges, 11587 markings/sec, 165 secs
lola: 4187183 markings, 18372178 edges, 26736 markings/sec, 170 secs
lola: 4262508 markings, 18883734 edges, 15065 markings/sec, 175 secs
lola: 4380676 markings, 19342553 edges, 23634 markings/sec, 180 secs
lola: 4481532 markings, 19843125 edges, 20171 markings/sec, 185 secs
lola: 4569660 markings, 20281231 edges, 17626 markings/sec, 190 secs
lola: 4700936 markings, 20768840 edges, 26255 markings/sec, 195 secs
lola: 4756271 markings, 21195710 edges, 11067 markings/sec, 200 secs
lola: 4859615 markings, 21557461 edges, 20669 markings/sec, 205 secs
lola: 4940642 markings, 21889402 edges, 16205 markings/sec, 210 secs
lola: 5005278 markings, 22269989 edges, 12927 markings/sec, 215 secs
lola: 5120726 markings, 22627943 edges, 23090 markings/sec, 220 secs
lola: 5174272 markings, 23056187 edges, 10709 markings/sec, 225 secs
lola: 5304573 markings, 23462772 edges, 26060 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: write sara problem file to HypertorusGrid-PT-d4k3p2b08-CTLCardinality-2.sara
lola: The predicate is not invariant.
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: lola: ...considering subproblem: E (X (E (G ((po_d1_n1_2_2_3_3 <= 2)))))
state equation: calling and running saralola:
========================================
lola: SUBTASK
lola: 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: 231935 markings, 802954 edges, 2474316777891299328 markings/sec, 0 secs
lola: 310256 markings, 1371765 edges, 15664 markings/sec, 5 secs
lola: 456214 markings, 1962299 edges, 29192 markings/sec, 10 secs
lola: 502287 markings, 2436982 edges, 9215 markings/sec, 15 secs
lola: 638918 markings, 3004136 edges, 27326 markings/sec, 20 secs
lola: 689501 markings, 3458036 edges, 10117 markings/sec, 25 secs
lola: 821214 markings, 4047916 edges, 26343 markings/sec, 30 secs
lola: 890443 markings, 4480583 edges, 13846 markings/sec, 35 secs
lola: 982794 markings, 5001741 edges, 18470 markings/sec, 40 secs
lola: 1088210 markings, 5481377 edges, 21083 markings/sec, 45 secs
lola: 1177059 markings, 6073158 edges, 17770 markings/sec, 50 secs
lola: 1289257 markings, 6604174 edges, 22440 markings/sec, 55 secs
lola: 1381434 markings, 7193922 edges, 18435 markings/sec, 60 secs
lola: 1489397 markings, 7719536 edges, 21593 markings/sec, 65 secs
lola: 1579221 markings, 8281595 edges, 17965 markings/sec, 70 secs
lola: 1687030 markings, 8772192 edges, 21562 markings/sec, 75 secs
lola: 1771880 markings, 9345238 edges, 16970 markings/sec, 80 secs
lola: 1885392 markings, 9884320 edges, 22702 markings/sec, 85 secs
lola: 1959839 markings, 10388310 edges, 14889 markings/sec, 90 secs
lola: 2075551 markings, 10842952 edges, 23142 markings/sec, 95 secs
lola: 2143840 markings, 11414194 edges, 13658 markings/sec, 100 secs
lola: 2277508 markings, 12012702 edges, 26734 markings/sec, 105 secs
lola: 2352133 markings, 12552285 edges, 14925 markings/sec, 110 secs
lola: 2469625 markings, 13030514 edges, 23498 markings/sec, 115 secs
lola: 2534326 markings, 13571311 edges, 12940 markings/sec, 120 secs
lola: 2664466 markings, 14106759 edges, 26028 markings/sec, 125 secs
lola: 2725216 markings, 14629768 edges, 12150 markings/sec, 130 secs
lola: 2854775 markings, 15136650 edges, 25912 markings/sec, 135 secs
lola: 2901217 markings, 15619534 edges, 9288 markings/sec, 140 secs
lola: 3017381 markings, 16085628 edges, 23233 markings/sec, 145 secs
lola: 3060254 markings, 16501307 edges, 8575 markings/sec, 150 secs
lola: 3200860 markings, 17124844 edges, 28121 markings/sec, 155 secs
lola: 3262586 markings, 17649206 edges, 12345 markings/sec, 160 secs
lola: 3411568 markings, 18252731 edges, 29796 markings/sec, 165 secs
lola: 3466498 markings, 18765176 edges, 10986 markings/sec, 170 secs
lola: 3613370 markings, 19353126 edges, 29374 markings/sec, 175 secs
lola: 3661833 markings, 19845276 edges, 9693 markings/sec, 180 secs
lola: 3780843 markings, 20333714 edges, 23802 markings/sec, 185 secs
lola: 3830322 markings, 20769482 edges, 9896 markings/sec, 190 secs
lola: 3996922 markings, 21481099 edges, 33320 markings/sec, 195 secs
lola: 4067809 markings, 22079951 edges, 14177 markings/sec, 200 secs
lola: 4201656 markings, 22620177 edges, 26769 markings/sec, 205 secs
lola: 4283811 markings, 23258700 edges, 16431 markings/sec, 210 secs
lola: 4399475 markings, 23921677 edges, 23133 markings/sec, 215 secs
lola: 4561040 markings, 24627906 edges, 32313 markings/sec, 220 secs
lola: 4632605 markings, 25229236 edges, 14313 markings/sec, 225 secs
lola: 4767979 markings, 25782577 edges, 27075 markings/sec, 230 secs
lola: 4850953 markings, 26418991 edges, 16595 markings/sec, 235 secs
lola: 4962644 markings, 27049041 edges, 22338 markings/sec, 240 secs
lola: 5064218 markings, 27570498 edges, 20315 markings/sec, 245 secs
lola: 5148269 markings, 28015365 edges, 16810 markings/sec, 250 secs
lola: 5262619 markings, 28652962 edges, 22870 markings/sec, 255 secs
lola: 5349446 markings, 29264766 edges, 17365 markings/sec, 260 secs
lola: 5501560 markings, 29871172 edges, 30423 markings/sec, 265 secs
lola: 5577073 markings, 30495866 edges, 15103 markings/sec, 270 secs
lola: 5704034 markings, 31144906 edges, 25392 markings/sec, 275 secs
lola: 5817740 markings, 31759258 edges, 22741 markings/sec, 280 secs
lola: 5888670 markings, 32272046 edges, 14186 markings/sec, 285 secs
lola: 6058408 markings, 32989101 edges, 33948 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: The predicate is reachable.
lola: state equation: write sara problem file to HypertorusGrid-PT-d4k3p2b08-CTLCardinality-7.sara
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: ========================================
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: 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: 228852 markings, 726598 edges, 3225356612063461376 markings/sec, 0 secs
lola: 263356 markings, 1341450 edges, 6901 markings/sec, 5 secs
lola: 406253 markings, 1964216 edges, 28579 markings/sec, 10 secs
lola: 490978 markings, 2514689 edges, 16945 markings/sec, 15 secs
lola: 522839 markings, 3049294 edges, 6372 markings/sec, 20 secs
lola: 681257 markings, 3595389 edges, 31684 markings/sec, 25 secs
lola: 720880 markings, 4123618 edges, 7925 markings/sec, 30 secs
lola: 779513 markings, 4658615 edges, 11727 markings/sec, 35 secs
lola: 908895 markings, 5150451 edges, 25876 markings/sec, 40 secs
lola: 948642 markings, 5634581 edges, 7949 markings/sec, 45 secs
lola: 954128 markings, 6079164 edges, 1097 markings/sec, 50 secs
lola: 1097819 markings, 6559487 edges, 28738 markings/sec, 55 secs
lola: 1175181 markings, 7027188 edges, 15472 markings/sec, 60 secs
lola: 1178571 markings, 7500864 edges, 678 markings/sec, 65 secs
lola: 1353923 markings, 8110006 edges, 35070 markings/sec, 70 secs
lola: 1403606 markings, 8672143 edges, 9937 markings/sec, 75 secs
lola: 1460965 markings, 9214042 edges, 11472 markings/sec, 80 secs
lola: 1582708 markings, 9706737 edges, 24349 markings/sec, 85 secs
lola: 1629283 markings, 10216131 edges, 9315 markings/sec, 90 secs
lola: 1654533 markings, 10700274 edges, 5050 markings/sec, 95 secs
lola: 1792046 markings, 11160885 edges, 27503 markings/sec, 100 secs
lola: 1854139 markings, 11644590 edges, 12419 markings/sec, 105 secs
lola: 1856679 markings, 12054233 edges, 508 markings/sec, 110 secs
lola: 1965222 markings, 12530681 edges, 21709 markings/sec, 115 secs
lola: 2053348 markings, 12949693 edges, 17625 markings/sec, 120 secs
lola: 2080353 markings, 13429183 edges, 5401 markings/sec, 125 secs
lola: 2143011 markings, 13940753 edges, 12532 markings/sec, 130 secs
lola: 2284570 markings, 14449226 edges, 28312 markings/sec, 135 secs
lola: 2305678 markings, 14972613 edges, 4222 markings/sec, 140 secs
lola: 2413375 markings, 15510719 edges, 21539 markings/sec, 145 secs
lola: 2522132 markings, 16002215 edges, 21751 markings/sec, 150 secs
lola: 2529313 markings, 16495089 edges, 1436 markings/sec, 155 secs
lola: 2606349 markings, 16927366 edges, 15407 markings/sec, 160 secs
lola: 2715135 markings, 17330561 edges, 21757 markings/sec, 165 secs
lola: 2750256 markings, 17762533 edges, 7024 markings/sec, 170 secs
lola: 2752572 markings, 18180061 edges, 463 markings/sec, 175 secs
lola: 2890096 markings, 18681783 edges, 27505 markings/sec, 180 secs
lola: 2971622 markings, 19163544 edges, 16305 markings/sec, 185 secs
lola: 2975065 markings, 19641267 edges, 689 markings/sec, 190 secs
lola: 3123316 markings, 20148713 edges, 29650 markings/sec, 195 secs
lola: 3193928 markings, 20624959 edges, 14122 markings/sec, 200 secs
lola: 3202843 markings, 21097864 edges, 1783 markings/sec, 205 secs
lola: 3361117 markings, 21631860 edges, 31655 markings/sec, 210 secs
lola: 3416049 markings, 22148645 edges, 10986 markings/sec, 215 secs
lola: 3467706 markings, 22682175 edges, 10331 markings/sec, 220 secs
lola: 3603025 markings, 23149036 edges, 27064 markings/sec, 225 secs
lola: 3637353 markings, 23673986 edges, 6866 markings/sec, 230 secs
lola: 3702660 markings, 24156794 edges, 13061 markings/sec, 235 secs
lola: 3816622 markings, 24534982 edges, 22792 markings/sec, 240 secs
lola: 3855468 markings, 24957490 edges, 7769 markings/sec, 245 secs
lola: 3870428 markings, 25389732 edges, 2992 markings/sec, 250 secs
lola: 3990449 markings, 25880108 edges, 24004 markings/sec, 255 secs
lola: 4069167 markings, 26331866 edges, 15744 markings/sec, 260 secs
lola: 4076344 markings, 26808216 edges, 1435 markings/sec, 265 secs
lola: 4175809 markings, 27304110 edges, 19893 markings/sec, 270 secs
lola: 4285132 markings, 27768258 edges, 21865 markings/sec, 275 secs
lola: 4294898 markings, 28248270 edges, 1953 markings/sec, 280 secs
lola: 4412071 markings, 28760279 edges, 23435 markings/sec, 285 secs
lola: 4507671 markings, 29243580 edges, 19120 markings/sec, 290 secs
lola: 4512412 markings, 29739737 edges, 948 markings/sec, 295 secs
lola: 4597662 markings, 30158307 edges, 17050 markings/sec, 300 secs
lola: 4695844 markings, 30533329 edges, 19636 markings/sec, 305 secs
lola: 4727373 markings, 30958737 edges, 6306 markings/sec, 310 secs
lola: 4729554 markings, 31341597 edges, 436 markings/sec, 315 secs
lola: 4871590 markings, 31884766 edges, 28407 markings/sec, 320 secs
lola: 4943803 markings, 32426733 edges, 14443 markings/sec, 325 secs
lola: 4993715 markings, 32992204 edges, 9982 markings/sec, 330 secs
lola: 5142371 markings, 33533908 edges, 29731 markings/sec, 335 secs
lola: 5161444 markings, 34062582 edges, 3815 markings/sec, 340 secs
lola: 5246517 markings, 34512967 edges, 17015 markings/sec, 345 secs
lola: 5346188 markings, 34873236 edges, 19934 markings/sec, 350 secs
lola: 5374541 markings, 35265187 edges, 5671 markings/sec, 355 secs
lola: 5378486 markings, 35625095 edges, 789 markings/sec, 360 secs
lola: 5486771 markings, 36059357 edges, 21657 markings/sec, 365 secs
lola: 5578822 markings, 36497627 edges, 18410 markings/sec, 370 secs
lola: 5589927 markings, 36939662 edges, 2221 markings/sec, 375 secs
lola: 5630990 markings, 37378668 edges, 8213 markings/sec, 380 secs
lola: 5778404 markings, 37901253 edges, 29483 markings/sec, 385 secs
lola: 5803587 markings, 38358075 edges, 5037 markings/sec, 390 secs
lola: 5824174 markings, 38695978 edges, 4117 markings/sec, 395 secs
lola: 5915140 markings, 38986338 edges, 18193 markings/sec, 400 secs
lola: 5975943 markings, 39217475 edges, 12161 markings/sec, 405 secs
lola: 6013513 markings, 39495777 edges, 7514 markings/sec, 410 secs
lola: 6016353 markings, 39768055 edges, 568 markings/sec, 415 secs
lola: 6017525 markings, 40011547 edges, 234 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: 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: ========================================
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: state equation: write sara problem file to HypertorusGrid-PT-d4k3p2b08-CTLCardinality-12.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
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: lola: ========================================state equation: calling and running sara

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: The predicate is reachable.
lola: state equation: write sara problem file to HypertorusGrid-PT-d4k3p2b08-CTLCardinality-12.sara
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 1496351120151

--------------------
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_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/S_HypertorusGrid-PT-d4k3p2b08.tgz
mv S_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 S_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 r118-blw7-149441649800048"
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 ;