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

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


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


checking for too many tokens
===========================================================================================
S_HypercubeGrid-PT-C5K3P3B15: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityCardinality @ S_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: state equation: calling and running 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: 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 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: state equation: write sara problem file to HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-4.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
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 || 71191 markings, 73028 edges, 14238 markings/sec, 0 secs
lola: sara is running 5 secs || 118961 markings, 122440 edges, 9554 markings/sec, 5 secs
lola: sara is running 10 secs || 155100 markings, 158726 edges, 7228 markings/sec, 10 secs
lola: sara is running 15 secs || 181207 markings, 185102 edges, 5221 markings/sec, 15 secs
lola: sara is running 20 secs || 206091 markings, 210174 edges, 4977 markings/sec, 20 secs
lola: sara is running 25 secs || 229784 markings, 234542 edges, 4739 markings/sec, 25 secs
lola: sara is running 30 secs || 253458 markings, 258810 edges, 4735 markings/sec, 30 secs
lola: sara is running 35 secs || 277169 markings, 283003 edges, 4742 markings/sec, 35 secs
lola: sara is running 40 secs || 298148 markings, 304093 edges, 4196 markings/sec, 40 secs
lola: sara is running 45 secs || 317167 markings, 323112 edges, 3804 markings/sec, 45 secs
lola: sara is running 50 secs || 332254 markings, 338411 edges, 3017 markings/sec, 50 secs
lola: sara is running 55 secs || 346373 markings, 352682 edges, 2824 markings/sec, 55 secs
lola: sara is running 60 secs || 360250 markings, 366770 edges, 2775 markings/sec, 60 secs
lola: sara is running 65 secs || 373989 markings, 380684 edges, 2748 markings/sec, 65 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 70 secs || 387513 markings, 394485 edges, 2705 markings/sec, 70 secs
lola: sara is running 75 secs || 400984 markings, 408208 edges, 2694 markings/sec, 75 secs
lola: sara is running 80 secs || 414480 markings, 421942 edges, 2699 markings/sec, 80 secs
lola: sara is running 85 secs || 427984 markings, 435702 edges, 2701 markings/sec, 85 secs

lola: sara is running 90 secs || 441547 markings, 449371 edges, 2713 markings/sec, 90 secs
lola: sara is running 95 secs || 455099 markings, 463139 edges, 2710 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: state equation: write sara problem file to HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-6.sara
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: state equation: write sara problem file to HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-7.sara
lola: The predicate is reachable.
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: state equation: write sara problem file to HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-8.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 490 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: subprocess 11 will run for 686 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: lola: state equation: calling and running sara
========================================
sara: try reading problem file HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-10.sara.
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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: write sara problem file to HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-11.sara
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 858 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 || 58171 markings, 58731 edges, 11634 markings/sec, 0 secs
lola: sara is running 5 secs || 93113 markings, 94186 edges, 6988 markings/sec, 5 secs
lola: sara is running 10 secs || 121986 markings, 123070 edges, 5775 markings/sec, 10 secs
lola: sara is running 15 secs || 144402 markings, 145740 edges, 4483 markings/sec, 15 secs
lola: sara is running 20 secs || 165309 markings, 169329 edges, 4181 markings/sec, 20 secs
lola: sara is running 25 secs || 186445 markings, 193393 edges, 4227 markings/sec, 25 secs
lola: sara is running 30 secs || 207865 markings, 217903 edges, 4284 markings/sec, 30 secs
lola: sara is running 35 secs || 229295 markings, 242161 edges, 4286 markings/sec, 35 secs
lola: sara is running 40 secs || 251784 markings, 264926 edges, 4498 markings/sec, 40 secs
lola: sara is running 45 secs || 274426 markings, 287601 edges, 4528 markings/sec, 45 secs
lola: sara is running 50 secs || 297507 markings, 310682 edges, 4616 markings/sec, 50 secs
lola: sara is running 55 secs || 320540 markings, 333715 edges, 4607 markings/sec, 55 secs
lola: sara is running 60 secs || 343586 markings, 356764 edges, 4609 markings/sec, 60 secs
lola: sara is running 65 secs || 366624 markings, 379807 edges, 4608 markings/sec, 65 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 70 secs || 389624 markings, 402814 edges, 4600 markings/sec, 70 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 75 secs || 412395 markings, 425594 edges, 4554 markings/sec, 75 secs

lola: sara is running 80 secs || 434052 markings, 447261 edges, 4331 markings/sec, 80 secs
lola: sara is running 85 secs || 454991 markings, 468208 edges, 4188 markings/sec, 85 secs
lola: sara is running 90 secs || 477109 markings, 490336 edges, 4424 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: subprocess 13 will run for 1112 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 1668 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 3336 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 || 73673 markings, 74288 edges, 14735 markings/sec, 0 secs
lola: sara is running 5 secs || 110071 markings, 111173 edges, 7280 markings/sec, 5 secs
lola: sara is running 10 secs || 139162 markings, 140555 edges, 5818 markings/sec, 10 secs
lola: sara is running 15 secs || 163955 markings, 165470 edges, 4959 markings/sec, 15 secs
lola: sara is running 20 secs || 187216 markings, 189042 edges, 4652 markings/sec, 20 secs
lola: sara is running 25 secs || 210150 markings, 212458 edges, 4587 markings/sec, 25 secs
lola: sara is running 30 secs || 233462 markings, 236911 edges, 4662 markings/sec, 30 secs
lola: sara is running 35 secs || 256715 markings, 261212 edges, 4651 markings/sec, 35 secs
lola: sara is running 40 secs || 279849 markings, 285468 edges, 4627 markings/sec, 40 secs
lola: sara is running 45 secs || 302979 markings, 309812 edges, 4626 markings/sec, 45 secs
lola: sara is running 50 secs || 326102 markings, 334149 edges, 4625 markings/sec, 50 secs
lola: sara is running 55 secs || 349219 markings, 358487 edges, 4623 markings/sec, 55 secs
lola: sara is running 60 secs || 372334 markings, 382809 edges, 4623 markings/sec, 60 secs
lola: sara is running 65 secs || 395620 markings, 407276 edges, 4657 markings/sec, 65 secs
lola: sara is running 70 secs || 418863 markings, 431543 edges, 4649 markings/sec, 70 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 75 secs || 442149 markings, 455679 edges, 4657 markings/sec, 75 secs
lola: sara is running 80 secs || 465559 markings, 480300 edges, 4682 markings/sec, 80 secs

lola: sara is running 85 secs || 488786 markings, 504723 edges, 4645 markings/sec, 85 secs
lola: sara is running 90 secs || 512178 markings, 529304 edges, 4678 markings/sec, 90 secs
lola: sara is running 95 secs || 535660 markings, 553793 edges, 4696 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: 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 1496348815004

--------------------
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_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/S_HypercubeGrid-PT-C5K3P3B15.tgz
mv S_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 S_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 r118-blw7-149441649800025"
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 ;