Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-3253
Executing tool lola
Input is S_DLCshifumi-PT-3b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-ebro-149488455900475
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496468825424


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


checking for too many tokens
===========================================================================================
S_DLCshifumi-PT-3b: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityCardinality @ S_DLCshifumi-PT-3b @ 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: 16669/65536 symbol table entries, 5526 collisions
lola: preprocessing...
lola: finding significant places
lola: 7058 places, 9611 transitions, 6776 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 12409 transition conflict sets
lola: TASK
lola: reading formula from DLCshifumi-PT-3b-ReachabilityCardinality.task
lola: E (F ((((3 <= p5475) AND (p3854 <= p2265)) OR ((3 <= p639) AND (p672 <= p2246)) OR (2 <= p5784)))) : E (F ((2 <= p719))) : A (G ((((p4631 + 1 <= p5409) AND (p3516 + 1 <= p4087)) OR (p5485 <= p3179)))) : E (F (((3 <= p2536) OR (1 <= p3254)))) : A (G ((p6809 <= p2889))) : E (F (((2 <= p5011) AND (1 <= p2935) AND (p504 <= 1) AND (p5539 <= p6985)))) : E (F ((((p4706 + 1 <= p4463) AND (2 <= p2369)) OR (2 <= p5887)))) : A (G ((((3 <= p5957) AND (p2906 <= p6451)) OR (p5442 + 1 <= p2004) OR (1 <= p6103) OR (p3593 <= p5496) OR (p1068 + 1 <= p4593)))) : E (F (((p3623 <= 1) AND (p1361 + 1 <= p1633) AND ((p4786 + 1 <= p6759) OR (p2380 + 1 <= p4183))))) : E (F (((p5976 <= 2) AND (3 <= p1658) AND (p5300 <= p3024)))) : A (G ((p1243 <= 0))) : E (F ((((p1289 + 1 <= p6437) AND (p404 <= 2)) OR (p335 + 1 <= p5734)))) : E (F (((3 <= p584) AND (p3059 <= p2560) AND ((3 <= p2933) OR (1 <= p5542)) AND (p4937 + 1 <= p471)))) : A (G (((p2009 <= 2) AND (p4046 <= 1) AND (p3759 <= 0)))) : A (G ((p4715 <= p782))) : E (F ((((p4358 + 1 <= p127) OR (p2341 + 1 <= p3092)) AND ((3 <= p6961) OR (3 <= p3779)))))
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 ((((3 <= p5475) AND (p3854 <= p2265)) OR ((3 <= p639) AND (p672 <= p2246)) OR (2 <= p5784))))
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 848 bytes per marking, with 8 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 5 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-3b-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-3b-ReachabilityCardinality.sara.
lola: sara is running 0 secs || 41973 markings, 49992 edges, 8395 markings/sec, 0 secs
lola: sara is running 5 secs || 86518 markings, 102681 edges, 8909 markings/sec, 5 secs
lola: sara is running 10 secs || 131455 markings, 156156 edges, 8987 markings/sec, 10 secs
lola: sara is running 15 secs || 175735 markings, 208957 edges, 8856 markings/sec, 15 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 20 secs || 218801 markings, 260239 edges, 8613 markings/sec, 20 secs
lola: sara is running 25 secs || 260394 markings, 309998 edges, 8319 markings/sec, 25 secs
lola: sara is running 30 secs || 301077 markings, 358448 edges, 8137 markings/sec, 30 secs
lola: sara is running 35 secs || 342170 markings, 407327 edges, 8219 markings/sec, 35 secs
lola: sara is running 40 secs || 382650 markings, 455550 edges, 8096 markings/sec, 40 secs
lola: sara is running 45 secs || 423483 markings, 504201 edges, 8167 markings/sec, 45 secs

lola: sara is running 50 secs || 464266 markings, 552788 edges, 8157 markings/sec, 50 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 1 will run for 232 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p719)))
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 848 bytes per marking, with 8 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 DLCshifumi-PT-3b-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-3b-ReachabilityCardinality.sara.
lola: sara is running 0 secs || 116511 markings, 130783 edges, 23302 markings/sec, 0 secs
lola: sara is running 5 secs || 232989 markings, 262222 edges, 23296 markings/sec, 5 secs
lola: sara is running 10 secs || 348708 markings, 392509 edges, 23144 markings/sec, 10 secs
lola: sara is running 15 secs || 460201 markings, 517946 edges, 22299 markings/sec, 15 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 20 secs || 567008 markings, 638109 edges, 21361 markings/sec, 20 secs
lola: sara is running 25 secs || 674249 markings, 758666 edges, 21448 markings/sec, 25 secs
lola: sara is running 30 secs || 781601 markings, 879335 edges, 21470 markings/sec, 30 secs

lola: sara is running 35 secs || 886136 markings, 997057 edges, 20907 markings/sec, 35 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 2 will run for 245 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p4631 + 1 <= p5409) AND (p3516 + 1 <= p4087)) OR (p5485 <= p3179))))
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 848 bytes per marking, with 8 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 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-3b-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-3b-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 264 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p2536) OR (1 <= p3254))))
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 848 bytes per marking, with 8 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 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-3b-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-3b-ReachabilityCardinality-3.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 4 will run for 286 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p6809 <= p2889)))
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 848 bytes per marking, with 8 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 DLCshifumi-PT-3b-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-3b-ReachabilityCardinality-4.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 5 will run for 312 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p5011) AND (1 <= p2935) AND (p504 <= 1) AND (p5539 <= p6985))))
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 848 bytes per marking, with 8 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 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-3b-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-3b-ReachabilityCardinality-5.sara.
lola: sara is running 0 secs || 61976 markings, 77024 edges, 12395 markings/sec, 0 secs
lola: sara is running 5 secs || 123726 markings, 155154 edges, 12350 markings/sec, 5 secs
lola: sara is running 10 secs || 185023 markings, 233080 edges, 12259 markings/sec, 10 secs
lola: sara is running 15 secs || 246321 markings, 310772 edges, 12260 markings/sec, 15 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 20 secs || 307875 markings, 388902 edges, 12311 markings/sec, 20 secs
lola: sara is running 25 secs || 368988 markings, 466330 edges, 12223 markings/sec, 25 secs

lola: sara is running 30 secs || 430298 markings, 544091 edges, 12262 markings/sec, 30 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 340 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p4706 + 1 <= p4463) AND (2 <= p2369)) OR (2 <= p5887))))
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 848 bytes per marking, with 8 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 DLCshifumi-PT-3b-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-3b-ReachabilityCardinality-6.sara.
lola: sara is running 0 secs || 111284 markings, 153251 edges, 22257 markings/sec, 0 secs
lola: sara is running 5 secs || 222704 markings, 306812 edges, 22284 markings/sec, 5 secs
lola: sara is running 10 secs || 334075 markings, 460224 edges, 22274 markings/sec, 10 secs
lola: sara is running 15 secs || 444604 markings, 612539 edges, 22106 markings/sec, 15 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 20 secs || 554717 markings, 764343 edges, 22023 markings/sec, 20 secs
lola: sara is running 25 secs || 664108 markings, 915060 edges, 21878 markings/sec, 25 secs
lola: sara is running 30 secs || 773392 markings, 1065665 edges, 21857 markings/sec, 30 secs
lola: sara is running 35 secs || 882564 markings, 1216173 edges, 21834 markings/sec, 35 secs

lola: sara is running 40 secs || 992059 markings, 1366985 edges, 21899 markings/sec, 40 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 7 will run for 373 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((3 <= p5957) AND (p2906 <= p6451)) OR (p5442 + 1 <= p2004) OR (1 <= p6103) OR (p3593 <= p5496) OR (p1068 + 1 <= p4593))))
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 848 bytes per marking, with 8 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 DLCshifumi-PT-3b-ReachabilityCardinality-7.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 8 will run for 419 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p3623 <= 1) AND (p1361 + 1 <= p1633) AND ((p4786 + 1 <= p6759) OR (p2380 + 1 <= p4183)))))
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 848 bytes per marking, with 8 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 DLCshifumi-PT-3b-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-3b-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 479 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p5976 <= 2) AND (3 <= p1658) AND (p5300 <= p3024))))
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 848 bytes per marking, with 8 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 DLCshifumi-PT-3b-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-3b-ReachabilityCardinality-9.sara.
lola: sara is running 0 secs || 116237 markings, 131019 edges, 23247 markings/sec, 0 secs
lola: sara is running 5 secs || 215334 markings, 242576 edges, 19819 markings/sec, 5 secs
lola: sara is running 10 secs || 314517 markings, 355302 edges, 19837 markings/sec, 10 secs
lola: sara is running 15 secs || 411356 markings, 464188 edges, 19368 markings/sec, 15 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 20 secs || 514488 markings, 580349 edges, 20626 markings/sec, 20 secs
lola: sara is running 25 secs || 614302 markings, 692860 edges, 19963 markings/sec, 25 secs

lola: sara is running 30 secs || 714039 markings, 805362 edges, 19947 markings/sec, 30 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 10 will run for 553 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p1243 <= 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 848 bytes per marking, with 8 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 DLCshifumi-PT-3b-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 664 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p1289 + 1 <= p6437) AND (p404 <= 2)) OR (p335 + 1 <= p5734))))
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 848 bytes per marking, with 8 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 DLCshifumi-PT-3b-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-3b-ReachabilityCardinality-11.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 12 will run for 830 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p584) AND (p3059 <= p2560) AND ((3 <= p2933) OR (1 <= p5542)) AND (p4937 + 1 <= p471))))
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 848 bytes per marking, with 8 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 DLCshifumi-PT-3b-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-3b-ReachabilityCardinality-12.sara.
lola: sara is running 0 secs || 89789 markings, 97658 edges, 17958 markings/sec, 0 secs
lola: sara is running 5 secs || 182174 markings, 198250 edges, 18477 markings/sec, 5 secs
lola: sara is running 10 secs || 271228 markings, 295150 edges, 17811 markings/sec, 10 secs
lola: sara is running 15 secs || 359088 markings, 390749 edges, 17572 markings/sec, 15 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 20 secs || 449580 markings, 489173 edges, 18098 markings/sec, 20 secs
lola: sara is running 25 secs || 534772 markings, 581852 edges, 17038 markings/sec, 25 secs
lola: sara is running 30 secs || 623797 markings, 678795 edges, 17805 markings/sec, 30 secs
lola: sara is running 35 secs || 702950 markings, 765176 edges, 15831 markings/sec, 35 secs

lola: sara is running 40 secs || 792428 markings, 862892 edges, 17896 markings/sec, 40 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 1091 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p2009 <= 2) AND (p4046 <= 1) AND (p3759 <= 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 848 bytes per marking, with 8 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 DLCshifumi-PT-3b-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-3b-ReachabilityCardinality-13.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 14 will run for 1636 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p4715 <= p782)))
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 848 bytes per marking, with 8 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 DLCshifumi-PT-3b-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-3b-ReachabilityCardinality-14.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: subprocess 15 will run for 3273 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p4358 + 1 <= p127) OR (p2341 + 1 <= p3092)) AND ((3 <= p6961) OR (3 <= p3779)))))
lola: ========================================
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 848 bytes per marking, with 8 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 4 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-3b-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-3b-ReachabilityCardinality-15.sara.
lola: sara is running 0 secs || 49533 markings, 58044 edges, 9907 markings/sec, 0 secs
lola: sara is running 5 secs || 101504 markings, 121329 edges, 10394 markings/sec, 5 secs
lola: sara is running 10 secs || 148293 markings, 180900 edges, 9358 markings/sec, 10 secs
lola: sara is running 15 secs || 196193 markings, 240403 edges, 9580 markings/sec, 15 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 20 secs || 240954 markings, 298378 edges, 8952 markings/sec, 20 secs
lola: sara is running 25 secs || 288945 markings, 358001 edges, 9598 markings/sec, 25 secs
lola: sara is running 30 secs || 334732 markings, 416474 edges, 9157 markings/sec, 30 secs
lola: sara is running 35 secs || 381753 markings, 475584 edges, 9404 markings/sec, 35 secs
lola: sara is running 40 secs || 427505 markings, 533711 edges, 9150 markings/sec, 40 secs
lola: sara is running 45 secs || 473190 markings, 591745 edges, 9137 markings/sec, 45 secs
lola: sara is running 50 secs || 520425 markings, 650426 edges, 9447 markings/sec, 50 secs
lola: sara is running 55 secs || 566634 markings, 708655 edges, 9242 markings/sec, 55 secs

lola: sara is running 60 secs || 613241 markings, 767047 edges, 9321 markings/sec, 60 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: no no no yes no no no no yes no no yes no no no no
FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496469160088

--------------------
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_DLCshifumi-PT-3b"
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_DLCshifumi-PT-3b.tgz
mv S_DLCshifumi-PT-3b execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3253"
echo " Executing tool lola"
echo " Input is S_DLCshifumi-PT-3b, 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 r098-ebro-149488455900475"
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 ;