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 DLCround-PT-11b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-csrt-149580961900358
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496544046001


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


checking for too many tokens
===========================================================================================
DLCround-PT-11b: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityCardinality @ DLCround-PT-11b @ 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: 11366/65536 symbol table entries, 3163 collisions
lola: preprocessing...
lola: finding significant places
lola: 4375 places, 6991 transitions, 4131 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 10066 transition conflict sets
lola: TASK
lola: reading formula from DLCround-PT-11b-ReachabilityCardinality.task
lola: E (F ((p4263 + 1 <= p3888))) : A (G ((p1637 <= p3830))) : A (G ((p3541 <= p1025))) : E (F ((3 <= p753))) : A (G ((p3978 <= p662))) : E (F ((((3 <= p734) OR (1 <= p3024)) AND (p746 + 1 <= p3242) AND (((p1922 <= p642) AND (p3337 <= p196)) OR (p1540 <= p1773))))) : A (G (((p1611 <= p3927) OR (3 <= p1577) OR (p2460 <= p4152) OR ((p3405 <= 0) AND (p2479 <= 1))))) : A (G (((p3457 <= p1629) OR (p749 <= p285) OR (p2175 <= p2017) OR (3 <= p2208)))) : A (G ((((p1589 <= p2739) AND (p3985 <= p934) AND (p326 <= 0)) OR ((p3924 <= p2729) AND (p2397 <= p642))))) : E (F ((1 <= p1845))) : A (G ((p1347 <= p3371))) : E (F (((p1673 <= p4076) AND (p2821 + 1 <= p2609)))) : A (G ((p1540 <= 1))) : E (F (((p4344 <= p2602) AND ((p1398 + 1 <= p3965) OR ((3 <= p3109) AND (2 <= p575)))))) : E (F ((3 <= p930))) : A (G ((((p45 <= p3470) OR (p1595 <= 2)) AND (p1537 <= 2))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p4263 + 1 <= p3888)))
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 520 bytes per marking, with 29 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 DLCround-PT-11b-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 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p1637 <= p3830)))
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 520 bytes per marking, with 29 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 DLCround-PT-11b-ReachabilityCardinality.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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p3541 <= p1025)))
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 520 bytes per marking, with 29 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 DLCround-PT-11b-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-11b-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: E (F ((3 <= p753)))
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 520 bytes per marking, with 29 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 DLCround-PT-11b-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-11b-ReachabilityCardinality-3.sara.
lola: sara is running 0 secs || 113664 markings, 131517 edges, 22733 markings/sec, 0 secs
lola: sara is running 5 secs || 229206 markings, 266266 edges, 23108 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 4 will run for 293 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p3978 <= p662)))
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 520 bytes per marking, with 29 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 DLCround-PT-11b-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-11b-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 320 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((3 <= p734) OR (1 <= p3024)) AND (p746 + 1 <= p3242) AND (((p1922 <= p642) AND (p3337 <= p196)) OR (p1540 <= p1773)))))
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 520 bytes per marking, with 29 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 14 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-11b-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-11b-ReachabilityCardinality-5.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 352 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p1611 <= p3927) OR (3 <= p1577) OR (p2460 <= p4152) OR ((p3405 <= 0) AND (p2479 <= 1)))))
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 520 bytes per marking, with 29 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 DLCround-PT-11b-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-11b-ReachabilityCardinality-6.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 7 will run for 391 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p3457 <= p1629) OR (p749 <= p285) OR (p2175 <= p2017) OR (3 <= p2208))))
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 520 bytes per marking, with 29 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 DLCround-PT-11b-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-11b-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 440 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p1589 <= p2739) AND (p3985 <= p934) AND (p326 <= 0)) OR ((p3924 <= p2729) AND (p2397 <= p642)))))
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 520 bytes per marking, with 29 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 12 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-11b-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-11b-ReachabilityCardinality-8.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 9 will run for 503 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p1845)))
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 520 bytes per marking, with 29 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 DLCround-PT-11b-ReachabilityCardinality-9.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 587 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p1347 <= p3371)))
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 520 bytes per marking, with 29 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 DLCround-PT-11b-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-11b-ReachabilityCardinality-10.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 704 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p1673 <= p4076) AND (p2821 + 1 <= p2609))))
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 520 bytes per marking, with 29 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 DLCround-PT-11b-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-11b-ReachabilityCardinality-11.sara.
lola: sara is running 0 secs || 27377 markings, 32486 edges, 5475 markings/sec, 0 secs
lola: sara is running 5 secs || 53008 markings, 62818 edges, 5126 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 77915 markings, 92964 edges, 4981 markings/sec, 10 secs
lola: sara is running 15 secs || 104255 markings, 124278 edges, 5268 markings/sec, 15 secs
lola: sara is running 20 secs || 130564 markings, 155668 edges, 5262 markings/sec, 20 secs
lola: sara is running 25 secs || 156593 markings, 186877 edges, 5206 markings/sec, 25 secs
lola: sara is running 30 secs || 181985 markings, 217192 edges, 5078 markings/sec, 30 secs
lola: sara is running 35 secs || 206167 markings, 246333 edges, 4836 markings/sec, 35 secs
lola: sara is running 40 secs || 230463 markings, 275458 edges, 4859 markings/sec, 40 secs
lola: sara is running 45 secs || 254277 markings, 304178 edges, 4763 markings/sec, 45 secs
lola: sara is running 50 secs || 278067 markings, 332841 edges, 4758 markings/sec, 50 secs
lola: sara is running 55 secs || 302214 markings, 361658 edges, 4829 markings/sec, 55 secs
lola: sara is running 60 secs || 326160 markings, 390741 edges, 4789 markings/sec, 60 secs
lola: sara is running 65 secs || 349831 markings, 418836 edges, 4734 markings/sec, 65 secs
lola: sara is running 70 secs || 373719 markings, 447942 edges, 4778 markings/sec, 70 secs
lola: sara is running 75 secs || 398020 markings, 477126 edges, 4860 markings/sec, 75 secs
lola: sara is running 80 secs || 422135 markings, 506299 edges, 4823 markings/sec, 80 secs
lola: sara is running 85 secs || 446311 markings, 535267 edges, 4835 markings/sec, 85 secs
lola: sara is running 90 secs || 470386 markings, 564322 edges, 4815 markings/sec, 90 secs
lola: sara is running 95 secs || 494695 markings, 593831 edges, 4862 markings/sec, 95 secs
lola: sara is running 100 secs || 518951 markings, 622786 edges, 4851 markings/sec, 100 secs
lola: sara is running 105 secs || 543211 markings, 652190 edges, 4852 markings/sec, 105 secs
lola: sara is running 110 secs || 567853 markings, 681768 edges, 4928 markings/sec, 110 secs
lola: sara is running 115 secs || 592542 markings, 711611 edges, 4938 markings/sec, 115 secs
lola: sara is running 120 secs || 617122 markings, 741072 edges, 4916 markings/sec, 120 secs
lola: sara is running 125 secs || 641430 markings, 770425 edges, 4862 markings/sec, 125 secs
lola: sara is running 130 secs || 665873 markings, 800082 edges, 4889 markings/sec, 130 secs
lola: sara is running 135 secs || 689984 markings, 828910 edges, 4822 markings/sec, 135 secs
lola: sara is running 140 secs || 713940 markings, 858214 edges, 4791 markings/sec, 140 secs
lola: sara is running 145 secs || 737724 markings, 887931 edges, 4757 markings/sec, 145 secs
lola: sara is running 150 secs || 762111 markings, 918553 edges, 4877 markings/sec, 150 secs
lola: sara is running 155 secs || 786681 markings, 949547 edges, 4914 markings/sec, 155 secs
lola: sara is running 160 secs || 811413 markings, 980331 edges, 4946 markings/sec, 160 secs
lola: sara is running 165 secs || 836524 markings, 1011670 edges, 5022 markings/sec, 165 secs

lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 12 will run for 837 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p1540 <= 1)))
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 520 bytes per marking, with 29 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 DLCround-PT-11b-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-11b-ReachabilityCardinality-12.sara.
lola: sara is running 0 secs || 98943 markings, 120514 edges, 19789 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 185271 markings, 225435 edges, 17266 markings/sec, 5 secs

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 13 will run for 1112 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p4344 <= p2602) AND ((p1398 + 1 <= p3965) OR ((3 <= p3109) AND (2 <= p575))))))
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 520 bytes per marking, with 29 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 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-11b-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-11b-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 ((3 <= p930)))
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 520 bytes per marking, with 29 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 DLCround-PT-11b-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-11b-ReachabilityCardinality-14.sara.
lola: sara is running 0 secs || 76729 markings, 90697 edges, 15346 markings/sec, 0 secs
lola: sara is running 5 secs || 157570 markings, 187332 edges, 16168 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 15 will run for 3322 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p45 <= p3470) OR (p1595 <= 2)) AND (p1537 <= 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 520 bytes per marking, with 29 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 DLCround-PT-11b-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-11b-ReachabilityCardinality-15.sara.
lola: sara is running 0 secs || 29924 markings, 34299 edges, 5985 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 57480 markings, 65884 edges, 5511 markings/sec, 5 secs

lola: sara is running 10 secs || 83657 markings, 95917 edges, 5235 markings/sec, 10 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no no no yes no no no yes no yes yes yes no yes
FORMULA DLCround-PT-11b-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-11b-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-11b-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-11b-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-11b-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-11b-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-11b-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-11b-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-11b-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-11b-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-11b-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-11b-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-11b-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-11b-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-11b-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-11b-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496544279897

--------------------
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="DLCround-PT-11b"
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/DLCround-PT-11b.tgz
mv DLCround-PT-11b 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 DLCround-PT-11b, 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 r178-csrt-149580961900358"
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 ;