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-5a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-ebro-149488456000502
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496471116869


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


checking for too many tokens
===========================================================================================
S_DLCshifumi-PT-5a: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityCardinality @ S_DLCshifumi-PT-5a @ 3539 seconds
----- Start make result stdout -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 17027/65536 symbol table entries, 5854 collisions
lola: preprocessing...
lola: finding significant places
lola: 2162 places, 14865 transitions, 784 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 12838 transition conflict sets
lola: TASK
lola: reading formula from DLCshifumi-PT-5a-ReachabilityCardinality.task
lola: A (G (((p1435 <= p491) OR (1 <= p1183) OR ((p1364 <= p1623) AND (p1671 <= p70)) OR (p82 <= p1024)))) : A (G (((p1713 <= p1190) AND (p617 <= p404)))) : A (G ((p628 <= 1))) : E (F (((3 <= p1850) AND (p396 <= 1) AND ((p2133 <= p1058) OR ((1 <= p414) AND (p1560 <= p1995)))))) : A (G ((p1786 <= p2083))) : E (F ((((p1805 + 1 <= p1872) OR (p1560 + 1 <= p257)) AND ((2 <= p607) OR (p1925 + 1 <= p66))))) : E (F (((3 <= p1748) AND ((p861 + 1 <= p295) OR (p1478 <= 1))))) : E (F ((p1223 + 1 <= p954))) : E (F ((((p443 <= p273) AND (p1513 <= p1766) AND (2 <= p1645)) OR ((2 <= p1738) AND ((p1941 <= p1037) OR (p1263 <= p1133)))))) : A (G (((p1480 <= p1257) OR (((p726 <= p1889) OR (p1692 <= p1438)) AND (1 <= p526))))) : A (G (((p1215 <= 2) OR (p1788 <= 0) OR ((p1496 + 1 <= p854) AND (p1907 + 1 <= p4))))) : A (G ((p45 <= p1916))) : A (G (((p91 <= p763) OR (p1764 <= 1) OR (3 <= p539)))) : A (G ((((p813 + 1 <= p508) AND (p636 + 1 <= p727)) OR ((p955 <= p1804) AND (p1947 <= 2))))) : E (F ((((p1434 <= p1513) OR (3 <= p638) OR (p241 <= 1)) AND (2 <= p1064)))) : A (G (((p1541 <= 2) OR (p673 <= 1) OR (p292 + 1 <= p1367))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p1435 <= p491) OR (1 <= p1183) OR ((p1364 <= p1623) AND (p1671 <= p70)) OR (p82 <= p1024))))
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 100 bytes per marking, with 16 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-5a-ReachabilityCardinality.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p1713 <= p1190) AND (p617 <= p404))))
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 100 bytes per marking, with 16 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-5a-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 ((p628 <= 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 100 bytes per marking, with 16 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-5a-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-5a-ReachabilityCardinality-2.sara.
lola: sara is running 0 secs || 2002 markings, 16298 edges, 400 markings/sec, 0 secs
lola: sara is running 5 secs || 4017 markings, 36342 edges, 403 markings/sec, 5 secs
lola: sara is running 10 secs || 6027 markings, 56619 edges, 402 markings/sec, 10 secs
lola: sara is running 15 secs || 8044 markings, 77190 edges, 403 markings/sec, 15 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 20 secs || 10071 markings, 97159 edges, 405 markings/sec, 20 secs

lola: sara is running 25 secs || 12093 markings, 117613 edges, 404 markings/sec, 25 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 3 will run for 269 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p1850) AND (p396 <= 1) AND ((p2133 <= p1058) OR ((1 <= p414) AND (p1560 <= p1995))))))
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 100 bytes per marking, with 16 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 7 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-5a-ReachabilityCardinality-3.sara
lola: lola: SUBRESULT
state equation: calling and running sara
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
sara: try reading problem file DLCshifumi-PT-5a-ReachabilityCardinality-3.sara.
lola: ========================================
lola: subprocess 4 will run for 292 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p1786 <= p2083)))
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 100 bytes per marking, with 16 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: state equation: write sara problem file to DLCshifumi-PT-5a-ReachabilityCardinality-4.sara
lola: subprocess 5 will run for 318 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p1805 + 1 <= p1872) OR (p1560 + 1 <= p257)) AND ((2 <= p607) OR (p1925 + 1 <= p66)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: ========================================
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 100 bytes per marking, with 16 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-5a-ReachabilityCardinality-4.sara.
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-5a-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-5a-ReachabilityCardinality-5.sara.
lola: sara is running 0 secs || 2039 markings, 15034 edges, 408 markings/sec, 0 secs
lola: sara is running 5 secs || 4054 markings, 30964 edges, 403 markings/sec, 5 secs
lola: sara is running 10 secs || 6074 markings, 47838 edges, 404 markings/sec, 10 secs
lola: sara is running 15 secs || 8100 markings, 64984 edges, 405 markings/sec, 15 secs
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: sara is running 20 secs || 10112 markings, 81802 edges, 402 markings/sec, 20 secs
sara: place or transition ordering is non-deterministic


lola: sara is running 25 secs || 12133 markings, 99182 edges, 404 markings/sec, 25 secs

lola: sara is running 30 secs || 14160 markings, 116182 edges, 405 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 346 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p1748) AND ((p861 + 1 <= p295) OR (p1478 <= 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 100 bytes per marking, with 16 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-5a-ReachabilityCardinality-6.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 7 will run for 385 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p1223 + 1 <= p954)))
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 100 bytes per marking, with 16 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: state equation: write sara problem file to DLCshifumi-PT-5a-ReachabilityCardinality-7.sara
lola: subprocess 8 will run for 433 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p443 <= p273) AND (p1513 <= p1766) AND (2 <= p1645)) OR ((2 <= p1738) AND ((p1941 <= p1037) OR (p1263 <= p1133))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: ========================================
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-5a-ReachabilityCardinality-7.sara.
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 100 bytes per marking, with 16 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 7 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-5a-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 9 will run for 495 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p1480 <= p1257) OR (((p726 <= p1889) OR (p1692 <= p1438)) AND (1 <= p526)))))
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 100 bytes per marking, with 16 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: state equation: write sara problem file to DLCshifumi-PT-5a-ReachabilityCardinality-9.sara
lola: subprocess 10 will run for 578 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p1215 <= 2) OR (p1788 <= 0) OR ((p1496 + 1 <= p854) AND (p1907 + 1 <= p4)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: ========================================
lola: state equation: calling and running sara
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 100 bytes per marking, with 16 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
sara: try reading problem file DLCshifumi-PT-5a-ReachabilityCardinality-9.sara.
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-5a-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 11 will run for 693 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p45 <= p1916)))
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 100 bytes per marking, with 16 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-5a-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-5a-ReachabilityCardinality-11.sara.
lola: sara is running 0 secs || 1326 markings, 11119 edges, 265 markings/sec, 0 secs
lola: sara is running 5 secs || 2648 markings, 24916 edges, 264 markings/sec, 5 secs
lola: sara is running 10 secs || 3968 markings, 40174 edges, 264 markings/sec, 10 secs
lola: sara is running 15 secs || 5293 markings, 55776 edges, 265 markings/sec, 15 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 20 secs || 6617 markings, 70987 edges, 265 markings/sec, 20 secs
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic



lola: sara is running 25 secs || 7948 markings, 86588 edges, 266 markings/sec, 25 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 12 will run for 859 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p91 <= p763) OR (p1764 <= 1) OR (3 <= p539))))
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 100 bytes per marking, with 16 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-5a-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 13 will run for 1145 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p813 + 1 <= p508) AND (p636 + 1 <= p727)) OR ((p955 <= p1804) AND (p1947 <= 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 100 bytes per marking, with 16 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-5a-ReachabilityCardinality-13.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 14 will run for 1718 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p1434 <= p1513) OR (3 <= p638) OR (p241 <= 1)) AND (2 <= p1064))))
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 100 bytes per marking, with 16 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 DLCshifumi-PT-5a-ReachabilityCardinality-14.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 15 will run for 3436 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p1541 <= 2) OR (p673 <= 1) OR (p292 + 1 <= p1367))))
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 100 bytes per marking, with 16 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-5a-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-5a-ReachabilityCardinality-15.sara.
lola: sara is running 0 secs || 1342 markings, 11199 edges, 268 markings/sec, 0 secs
lola: sara is running 5 secs || 2675 markings, 26196 edges, 267 markings/sec, 5 secs
lola: sara is running 10 secs || 3999 markings, 41498 edges, 265 markings/sec, 10 secs
lola: sara is running 15 secs || 5326 markings, 56935 edges, 265 markings/sec, 15 secs
lola: sara is running 20 secs || 6662 markings, 72402 edges, 267 markings/sec, 20 secs
sara: place or transition ordering is non-deterministic

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

BK_STOP 1496471253743

--------------------
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-5a"
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-5a.tgz
mv S_DLCshifumi-PT-5a 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-5a, 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-149488456000502"
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 ;