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 HypercubeGrid-PT-C5K3P3B15, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r038-blw7-149440484500025
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494615587635


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
ReachabilityCardinality @ HypercubeGrid-PT-C5K3P3B15 @ 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: 34263/65536 symbol table entries, 18076 collisions
lola: preprocessing...
lola: finding significant places
lola: 9153 places, 25110 transitions, 5669 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 28593 transition conflict sets
lola: TASK
lola: reading formula from HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality.task
lola: E (F (((pil_d4_n1_3_2_1_1_1 + 1 <= po_d2_n1_2_2_2_2_1) AND (pbl_1_2_2_3_3 <= 0)))) : E (F (((pil_d3_n1_2_1_3_1_1 <= po_d4_n1_2_1_2_4_2) OR (pil_d3_n1_2_2_3_2_2 <= 0) OR (pb_d2_n2_3_1_3_3_1 <= 2)))) : A (G (((pb_d1_n1_3_1_1_1_2 <= pb_d2_n1_3_1_3_1_2) OR (pol_d1_n1_4_3_3_3_1 <= pol_d2_n1_1_2_2_1_3)))) : A (G (((3 <= pb_d4_n2_2_3_1_3_3) OR (3 <= pb_d2_n2_1_3_1_3_2)))) : E (F ((((pi_d2_n1_3_2_3_2_2 + 1 <= pil_d5_n1_2_1_2_1_1) AND (pil_d4_n1_1_3_1_1_1 + 1 <= pol_d5_n1_3_3_3_2_2)) OR (pb_d5_n1_1_3_1_2_3 <= 2)))) : E (F (((1 <= pb_d2_n2_3_1_2_3_2) AND (pb_d3_n2_3_2_3_1_1 <= pi_d3_n1_2_1_4_2_1) AND (1 <= pi_d2_n1_2_1_2_1_2) AND (3 <= pol_d4_n1_1_2_1_4_1) AND ((pil_d3_n1_2_3_1_3_1 <= pil_d5_n1_3_3_1_3_1) OR (po_d5_n1_3_2_3_2_3 + 1 <= pb_d5_n2_3_3_3_1_1))))) : E (F (((pol_d2_n1_3_3_2_1_1 <= po_d4_n1_1_3_1_3_1) AND (pi_d2_n1_3_4_3_2_1 <= pol_d4_n1_2_2_1_1_1) AND (pil_d3_n1_1_2_3_3_2 <= pb_d1_n1_2_2_2_2_1) AND ((pil_d3_n1_3_1_1_2_3 <= 1) OR (po_d5_n1_1_1_2_2_2 <= 0))))) : E (F (((pi_d2_n1_3_2_3_2_2 <= pol_d3_n1_1_3_1_3_3) AND (1 <= pi_d5_n1_1_3_3_3_1) AND ((pol_d4_n1_1_2_1_2_3 <= pb_d3_n1_2_3_3_1_3) OR (2 <= pil_d3_n1_1_2_3_2_1)) AND (pi_d5_n1_1_1_3_3_1 <= 1)))) : E (F ((pb_d3_n2_2_2_3_2_3 <= pol_d5_n1_1_3_3_1_4))) : A (G (((1 <= pb_d4_n2_2_2_2_1_1) OR ((2 <= pi_d2_n1_3_2_3_2_3) AND (po_d2_n1_2_4_1_2_2 <= pil_d3_n1_2_1_1_2_3) AND (3 <= pol_d3_n1_2_1_4_3_2))))) : E (F (((pb_d3_n2_3_3_3_3_1 + 1 <= pil_d2_n1_1_4_1_1_2) AND (po_d4_n1_3_2_3_3_3 <= 2) AND (1 <= pil_d2_n1_1_3_1_1_3)))) : A (G ((((pb_d3_n1_1_2_2_1_1 + 1 <= pol_d3_n1_1_2_4_2_3) OR ((1 <= pb_d5_n2_3_2_2_1_3) AND (pb_d3_n1_1_3_1_2_2 <= pb_d5_n1_1_2_2_1_1))) AND ((pil_d5_n1_2_2_2_3_3 <= pb_d5_n1_1_1_2_3_2) OR (1 <= po_d3_n1_1_3_4_1_2) OR ((1 <= pol_d2_n1_3_4_2_3_1) AND (pil_d4_n1_3_2_2_3_3 <= pil_d5_n1_1_3_1_2_4)))))) : E (F (((pi_d4_n1_1_2_2_2_3 + 1 <= pi_d5_n1_1_2_2_3_4) AND (pb_d2_n2_3_2_1_3_1 <= 1) AND (2 <= po_d3_n1_1_2_2_3_3)))) : E (F ((pb_d2_n1_3_2_3_1_3 <= 0))) : E (F (((pbl_3_1_3_2_2 <= 1) AND (pi_d3_n1_2_3_2_2_1 <= 2) AND ((pb_d3_n2_2_3_3_3_3 <= 2) OR (po_d1_n1_3_3_2_1_3 <= 2))))) : E (F (((3 <= pol_d5_n1_1_2_3_3_2) AND (3 <= pol_d5_n1_3_1_1_1_3))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((pil_d4_n1_3_2_1_1_1 + 1 <= po_d2_n1_2_2_2_2_1) AND (pbl_1_2_2_3_3 <= 0))))
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 22676 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 HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((pil_d3_n1_2_1_3_1_1 <= po_d4_n1_2_1_2_4_2) OR (pil_d3_n1_2_2_3_2_2 <= 0) OR (pb_d2_n2_3_1_3_3_1 <= 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 22676 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 3 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((pb_d1_n1_3_1_1_1_2 <= pb_d2_n1_3_1_3_1_2) OR (pol_d1_n1_4_3_3_3_1 <= pol_d2_n1_1_2_2_1_3))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 22676 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 HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-2.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= pb_d4_n2_2_3_1_3_3) OR (3 <= pb_d2_n2_1_3_1_3_2))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 22676 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 HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-3.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((pi_d2_n1_3_2_3_2_2 + 1 <= pil_d5_n1_2_1_2_1_1) AND (pil_d4_n1_1_3_1_1_1 + 1 <= pol_d5_n1_3_3_3_2_2)) OR (pb_d5_n1_1_3_1_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 22676 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: write sara problem file to HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-4.sara
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= pb_d2_n2_3_1_2_3_2) AND (pb_d3_n2_3_2_3_1_1 <= pi_d3_n1_2_1_4_2_1) AND (1 <= pi_d2_n1_2_1_2_1_2) AND (3 <= pol_d4_n1_1_2_1_4_1) AND ((pil_d3_n1_2_3_1_3_1 <= pil_d5_n1_3_3_1_3_1) OR (po_d5_n1_3_2_3_2_3 + 1 <= pb_d5_n2_3_3_3_1_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 22676 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 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-5.sara.
lola: sara is running 0 secs || 70877 markings, 72710 edges, 14175 markings/sec, 0 secs
lola: sara is running 5 secs || 118570 markings, 122044 edges, 9539 markings/sec, 5 secs
lola: sara is running 10 secs || 154552 markings, 158178 edges, 7196 markings/sec, 10 secs
lola: sara is running 15 secs || 180527 markings, 184403 edges, 5195 markings/sec, 15 secs
lola: sara is running 20 secs || 203751 markings, 207822 edges, 4645 markings/sec, 20 secs
lola: sara is running 25 secs || 226979 markings, 231644 edges, 4646 markings/sec, 25 secs
lola: sara is running 30 secs || 250480 markings, 255763 edges, 4700 markings/sec, 30 secs
lola: sara is running 35 secs || 274464 markings, 280265 edges, 4797 markings/sec, 35 secs
lola: sara is running 40 secs || 295919 markings, 301864 edges, 4291 markings/sec, 40 secs
lola: sara is running 45 secs || 314925 markings, 320870 edges, 3801 markings/sec, 45 secs
lola: sara is running 50 secs || 330426 markings, 336508 edges, 3100 markings/sec, 50 secs
lola: sara is running 55 secs || 344708 markings, 350991 edges, 2856 markings/sec, 55 secs
lola: sara is running 60 secs || 358523 markings, 365021 edges, 2763 markings/sec, 60 secs
lola: sara is running 65 secs || 372250 markings, 378915 edges, 2745 markings/sec, 65 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 70 secs || 385689 markings, 392632 edges, 2688 markings/sec, 70 secs
lola: sara is running 75 secs || 399133 markings, 406322 edges, 2689 markings/sec, 75 secs
lola: sara is running 80 secs || 412604 markings, 420036 edges, 2694 markings/sec, 80 secs

lola: sara is running 85 secs || 425822 markings, 433500 edges, 2644 markings/sec, 85 secs
lola: sara is running 90 secs || 439092 markings, 446896 edges, 2654 markings/sec, 90 secs
lola: sara is running 95 secs || 452367 markings, 460359 edges, 2655 markings/sec, 95 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 6 will run for 343 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((pol_d2_n1_3_3_2_1_1 <= po_d4_n1_1_3_1_3_1) AND (pi_d2_n1_3_4_3_2_1 <= pol_d4_n1_2_2_1_1_1) AND (pil_d3_n1_1_2_3_3_2 <= pb_d1_n1_2_2_2_2_1) AND ((pil_d3_n1_3_1_1_2_3 <= 1) OR (po_d5_n1_1_1_2_2_2 <= 0)))))
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 22676 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 8 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 7 will run for 381 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((pi_d2_n1_3_2_3_2_2 <= pol_d3_n1_1_3_1_3_3) AND (1 <= pi_d5_n1_1_3_3_3_1) AND ((pol_d4_n1_1_2_1_2_3 <= pb_d3_n1_2_3_3_1_3) OR (2 <= pil_d3_n1_1_2_3_2_1)) AND (pi_d5_n1_1_1_3_3_1 <= 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 22676 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 8 literals and 2 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 HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-7.sara
lola: ========================================
lola: subprocess 8 will run for 429 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((pb_d3_n2_2_2_3_2_3 <= pol_d5_n1_1_3_3_1_4)))
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 22676 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: write sara problem file to HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-8.sara
lola: ========================================
lola: subprocess 9 will run for 491 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= pb_d4_n2_2_2_2_1_1) OR ((2 <= pi_d2_n1_3_2_3_2_3) AND (po_d2_n1_2_4_1_2_2 <= pil_d3_n1_2_1_1_2_3) AND (3 <= pol_d3_n1_2_1_4_3_2)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 22676 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 6 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-9.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 10 will run for 572 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((pb_d3_n2_3_3_3_3_1 + 1 <= pil_d2_n1_1_4_1_1_2) AND (po_d4_n1_3_2_3_3_3 <= 2) AND (1 <= pil_d2_n1_1_3_1_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 22676 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 1 conjunctive subformulas
lola: state equation: write sara problem file to HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-10.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 687 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((pb_d3_n1_1_2_2_1_1 + 1 <= pol_d3_n1_1_2_4_2_3) OR ((1 <= pb_d5_n2_3_2_2_1_3) AND (pb_d3_n1_1_3_1_2_2 <= pb_d5_n1_1_2_2_1_1))) AND ((pil_d5_n1_2_2_2_3_3 <= pb_d5_n1_1_1_2_3_2) OR (1 <= po_d3_n1_1_3_4_1_2) OR ((1 <= pol_d2_n1_3_4_2_3_1) AND (pil_d4_n1_3_2_2_3_3 <= pil_d5_n1_1_3_1_2_4))))))
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 22676 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 10 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-11.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 859 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((pi_d4_n1_1_2_2_2_3 + 1 <= pi_d5_n1_1_2_2_3_4) AND (pb_d2_n2_3_2_1_3_1 <= 1) AND (2 <= po_d3_n1_1_2_2_3_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 22676 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 1 conjunctive subformulas
lola: state equation: write sara problem file to HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-12.sara.
lola: sara is running 0 secs || 61415 markings, 62021 edges, 12283 markings/sec, 0 secs
lola: sara is running 5 secs || 97696 markings, 98780 edges, 7256 markings/sec, 5 secs
lola: sara is running 10 secs || 125783 markings, 126905 edges, 5617 markings/sec, 10 secs
lola: sara is running 15 secs || 147818 markings, 149439 edges, 4407 markings/sec, 15 secs
lola: sara is running 20 secs || 168909 markings, 173423 edges, 4218 markings/sec, 20 secs
lola: sara is running 25 secs || 189959 markings, 197411 edges, 4210 markings/sec, 25 secs
lola: sara is running 30 secs || 211214 markings, 221724 edges, 4251 markings/sec, 30 secs
lola: sara is running 35 secs || 232619 markings, 245713 edges, 4281 markings/sec, 35 secs
lola: sara is running 40 secs || 255145 markings, 268293 edges, 4505 markings/sec, 40 secs
lola: sara is running 45 secs || 277896 markings, 291071 edges, 4550 markings/sec, 45 secs
lola: sara is running 50 secs || 300688 markings, 313863 edges, 4558 markings/sec, 50 secs
lola: sara is running 55 secs || 323406 markings, 336581 edges, 4544 markings/sec, 55 secs
lola: sara is running 60 secs || 346167 markings, 359346 edges, 4552 markings/sec, 60 secs
lola: sara is running 65 secs || 368934 markings, 382117 edges, 4553 markings/sec, 65 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 70 secs || 391780 markings, 404971 edges, 4569 markings/sec, 70 secs

lola: sara is running 75 secs || 414598 markings, 427799 edges, 4564 markings/sec, 75 secs
lola: sara is running 80 secs || 437418 markings, 450628 edges, 4564 markings/sec, 80 secs
lola: sara is running 85 secs || 460308 markings, 473528 edges, 4578 markings/sec, 85 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 13 will run for 1114 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((pb_d2_n1_3_2_3_1_3 <= 0)))
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 22676 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 HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-13.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1671 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((pbl_3_1_3_2_2 <= 1) AND (pi_d3_n1_2_3_2_2_1 <= 2) AND ((pb_d3_n2_2_3_3_3_3 <= 2) OR (po_d1_n1_3_3_2_1_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 22676 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 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-14.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 3343 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= pol_d5_n1_1_2_3_3_2) AND (3 <= pol_d5_n1_3_1_1_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 22676 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 HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-15.sara.
lola: sara is running 0 secs || 74254 markings, 74869 edges, 14851 markings/sec, 0 secs
lola: sara is running 5 secs || 110519 markings, 111621 edges, 7253 markings/sec, 5 secs
lola: sara is running 10 secs || 139679 markings, 141072 edges, 5832 markings/sec, 10 secs
lola: sara is running 15 secs || 164462 markings, 165977 edges, 4957 markings/sec, 15 secs
lola: sara is running 20 secs || 187728 markings, 189557 edges, 4653 markings/sec, 20 secs
lola: sara is running 25 secs || 210649 markings, 212972 edges, 4584 markings/sec, 25 secs
lola: sara is running 30 secs || 233966 markings, 237434 edges, 4663 markings/sec, 30 secs
lola: sara is running 35 secs || 257223 markings, 261739 edges, 4651 markings/sec, 35 secs
lola: sara is running 40 secs || 280355 markings, 285995 edges, 4626 markings/sec, 40 secs
lola: sara is running 45 secs || 303450 markings, 310311 edges, 4619 markings/sec, 45 secs
lola: sara is running 50 secs || 326525 markings, 334592 edges, 4615 markings/sec, 50 secs
lola: sara is running 55 secs || 349658 markings, 358944 edges, 4627 markings/sec, 55 secs
lola: sara is running 60 secs || 372407 markings, 382888 edges, 4550 markings/sec, 60 secs
lola: sara is running 65 secs || 394409 markings, 406013 edges, 4400 markings/sec, 65 secs
lola: sara is running 70 secs || 416494 markings, 429073 edges, 4417 markings/sec, 70 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 75 secs || 439751 markings, 453190 edges, 4651 markings/sec, 75 secs
lola: sara is running 80 secs || 463083 markings, 477681 edges, 4666 markings/sec, 80 secs

lola: sara is running 85 secs || 486274 markings, 502081 edges, 4638 markings/sec, 85 secs
lola: sara is running 90 secs || 508779 markings, 525750 edges, 4501 markings/sec, 90 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes no no yes no yes yes yes no yes no no yes yes no
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494615884123

--------------------
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="HypercubeGrid-PT-C5K3P3B15"
export BK_EXAMINATION="ReachabilityCardinality"
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/HypercubeGrid-PT-C5K3P3B15.tgz
mv HypercubeGrid-PT-C5K3P3B15 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 HypercubeGrid-PT-C5K3P3B15, examination is ReachabilityCardinality"
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-149440484500025"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.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 ;