fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r098-ebro-149488455700279
Last Updated
June 27, 2017

About the Execution of LoLA for S_DES-PT-20b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2845.480 188625.00 543331.00 67.80 FTTTTTTTFTTFTFTF normal

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_DES-PT-20b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-ebro-149488455700279
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1496452742271


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


checking for too many tokens
===========================================================================================
S_DES-PT-20b: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityFireability @ S_DES-PT-20b @ 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: 671/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 360 places, 311 transitions, 295 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 408 transition conflict sets
lola: TASK
lola: reading formula from DES-PT-20b-ReachabilityFireability.task
lola: A (G (((FIREABLE(t54) AND FIREABLE(t228)) OR NOT FIREABLE(t274) OR (NOT FIREABLE(t48) AND NOT FIREABLE(t118)) OR FIREABLE(t124)))) : E (F ((NOT FIREABLE(t236) AND (FIREABLE(t0) OR FIREABLE(t159)) AND (NOT FIREABLE(t145) OR NOT FIREABLE(t76)) AND FIREABLE(t116) AND FIREABLE(t262)))) : A (G ((FIREABLE(t88) OR FIREABLE(t195) OR FIREABLE(t242) OR FIREABLE(t157) OR (NOT FIREABLE(t80) AND NOT FIREABLE(t253)) OR (FIREABLE(t126) AND (FIREABLE(t109) OR FIREABLE(t18) OR (FIREABLE(t124) AND FIREABLE(t157))))))) : E (F (((FIREABLE(t22) OR FIREABLE(t25) OR (FIREABLE(t68) AND FIREABLE(t157))) AND FIREABLE(t70) AND FIREABLE(t111)))) : E (F (FIREABLE(t279))) : A (G (((NOT FIREABLE(t74) AND NOT FIREABLE(t236)) OR (NOT FIREABLE(t84) AND NOT FIREABLE(t247)) OR (NOT FIREABLE(t225) AND (NOT FIREABLE(t224) OR NOT FIREABLE(t183)))))) : E (F (FIREABLE(t80))) : A (G ((FIREABLE(t65) OR FIREABLE(t114) OR NOT FIREABLE(t292) OR FIREABLE(t299) OR ((FIREABLE(t172) OR FIREABLE(t17)) AND (FIREABLE(t174) OR FIREABLE(t97)))))) : E (F (((FIREABLE(t120) OR FIREABLE(t72) OR (FIREABLE(t301) AND FIREABLE(t42)) OR (FIREABLE(t76) AND FIREABLE(t249) AND FIREABLE(t303))) AND (FIREABLE(t288) OR NOT FIREABLE(t120) OR (FIREABLE(t240) AND FIREABLE(t3) AND (FIREABLE(t112) OR FIREABLE(t265))))))) : A (G (NOT FIREABLE(t248))) : E (F (FIREABLE(t307))) : E (F ((NOT FIREABLE(t217) AND FIREABLE(t41)))) : E (F ((FIREABLE(t217) AND (FIREABLE(t96) OR NOT FIREABLE(t55) OR ((FIREABLE(t236) OR FIREABLE(t262)) AND (FIREABLE(t175) OR FIREABLE(t238))))))) : E (F ((NOT FIREABLE(t44) AND (FIREABLE(t176) OR FIREABLE(t41) OR FIREABLE(t273))))) : E (F (FIREABLE(t225))) : E (F (((FIREABLE(t8) OR (FIREABLE(t91) AND FIREABLE(t24) AND FIREABLE(t130) AND FIREABLE(t201))) AND NOT FIREABLE(t271))))
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 (((FIREABLE(t54) AND FIREABLE(t228)) OR NOT FIREABLE(t274) OR (NOT FIREABLE(t48) AND NOT FIREABLE(t118)) OR FIREABLE(t124))))
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 40 bytes per marking, with 25 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 30 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-20b-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-20b-ReachabilityFireability.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t236) AND (FIREABLE(t0) OR FIREABLE(t159)) AND (NOT FIREABLE(t145) OR NOT FIREABLE(t76)) AND FIREABLE(t116) AND FIREABLE(t262))))
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 40 bytes per marking, with 25 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 60 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-20b-ReachabilityFireability.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: lola: ========================================
========================================
lola: ...considering subproblem: A (G ((FIREABLE(t88) OR FIREABLE(t195) OR FIREABLE(t242) OR FIREABLE(t157) OR (NOT FIREABLE(t80) AND NOT FIREABLE(t253)) OR (FIREABLE(t126) AND (FIREABLE(t109) OR FIREABLE(t18) OR (FIREABLE(t124) AND FIREABLE(t157)))))))
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 40 bytes per marking, with 25 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: Generated DNF with 188 literals and 24 conjunctive subformulas
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t22) OR FIREABLE(t25) OR (FIREABLE(t68) AND FIREABLE(t157))) AND FIREABLE(t70) AND FIREABLE(t111))))
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 40 bytes per marking, with 25 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 3 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-20b-ReachabilityFireability-3.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t279)))
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 40 bytes per marking, with 25 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 DES-PT-20b-ReachabilityFireability-4.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-20b-ReachabilityFireability-4.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t74) AND NOT FIREABLE(t236)) OR (NOT FIREABLE(t84) AND NOT FIREABLE(t247)) OR (NOT FIREABLE(t225) AND (NOT FIREABLE(t224) OR NOT FIREABLE(t183))))))
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 40 bytes per marking, with 25 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 48 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-20b-ReachabilityFireability-5.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-20b-ReachabilityFireability-5.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 705379 markings, 1377367 edges, 141076 markings/sec, 0 secs
lola: sara is running 5 secs || 1378035 markings, 2686491 edges, 134531 markings/sec, 5 secs
lola: sara is running 10 secs || 2173939 markings, 3747570 edges, 159181 markings/sec, 10 secs
lola: sara is running 15 secs || 2955362 markings, 4645309 edges, 156285 markings/sec, 15 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 6 will run for 351 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t80)))
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 40 bytes per marking, with 25 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 DES-PT-20b-ReachabilityFireability-6.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-20b-ReachabilityFireability-6.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 7 will run for 391 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t65) OR FIREABLE(t114) OR NOT FIREABLE(t292) OR FIREABLE(t299) OR ((FIREABLE(t172) OR FIREABLE(t17)) AND (FIREABLE(t174) OR FIREABLE(t97))))))
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 40 bytes per marking, with 25 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 56 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-20b-ReachabilityFireability-7.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-20b-ReachabilityFireability-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 439 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t120) OR FIREABLE(t72) OR (FIREABLE(t301) AND FIREABLE(t42)) OR (FIREABLE(t76) AND FIREABLE(t249) AND FIREABLE(t303))) AND (FIREABLE(t288) OR NOT FIREABLE(t120) OR (FIREABLE(t240) AND FIREABLE(t3) AND (FIREABLE(t112) OR FIREABLE(t265)))))))
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 40 bytes per marking, with 25 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 94 literals and 15 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: write sara problem file to DES-PT-20b-ReachabilityFireability-8.sara
lola: The predicate is reachable.
lola: subprocess 9 will run for 502 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t248)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: lola: lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
state equation: calling and running sara========================================

lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 25 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 DES-PT-20b-ReachabilityFireability-9.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-20b-ReachabilityFireability-8.sara.
sara: try reading problem file DES-PT-20b-ReachabilityFireability-9.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic

lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 10 will run for 586 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t307)))
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 40 bytes per marking, with 25 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: write sara problem file to DES-PT-20b-ReachabilityFireability-10.sara
lola: subprocess 11 will run for 703 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t217) AND FIREABLE(t41))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: lola: ========================================
Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: state equation: calling and running sara
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 25 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 DES-PT-20b-ReachabilityFireability-11.sara
sara: try reading problem file DES-PT-20b-ReachabilityFireability-10.sara.
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-20b-ReachabilityFireability-11.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


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 879 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t217) AND (FIREABLE(t96) OR NOT FIREABLE(t55) OR ((FIREABLE(t236) OR FIREABLE(t262)) AND (FIREABLE(t175) OR FIREABLE(t238)))))))
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 40 bytes per marking, with 25 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 30 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-20b-ReachabilityFireability-12.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-20b-ReachabilityFireability-12.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 627741 markings, 1487363 edges, 125548 markings/sec, 0 secs
lola: sara is running 5 secs || 1195546 markings, 2943027 edges, 113561 markings/sec, 5 secs
lola: sara is running 10 secs || 1775610 markings, 4335651 edges, 116013 markings/sec, 10 secs
lola: sara is running 15 secs || 2326474 markings, 5736227 edges, 110173 markings/sec, 15 secs
lola: sara is running 20 secs || 2852656 markings, 7095702 edges, 105236 markings/sec, 20 secs
lola: sara is running 25 secs || 3525018 markings, 8451226 edges, 134472 markings/sec, 25 secs
lola: sara is running 30 secs || 4083414 markings, 9844470 edges, 111679 markings/sec, 30 secs
lola: sara is running 35 secs || 4646184 markings, 11168492 edges, 112554 markings/sec, 35 secs
lola: sara is running 40 secs || 5176307 markings, 12491557 edges, 106025 markings/sec, 40 secs
lola: sara is running 45 secs || 5698581 markings, 13813506 edges, 104455 markings/sec, 45 secs
lola: sara is running 50 secs || 6306737 markings, 15094621 edges, 121631 markings/sec, 50 secs
lola: sara is running 55 secs || 6898136 markings, 16472582 edges, 118280 markings/sec, 55 secs
lola: sara is running 60 secs || 7496859 markings, 17785515 edges, 119745 markings/sec, 60 secs
lola: sara is running 65 secs || 8069775 markings, 19066217 edges, 114583 markings/sec, 65 secs
lola: sara is running 70 secs || 8670546 markings, 20321262 edges, 120154 markings/sec, 70 secs
lola: sara is running 75 secs || 9233191 markings, 21601594 edges, 112529 markings/sec, 75 secs
lola: sara is running 80 secs || 9826464 markings, 22858187 edges, 118655 markings/sec, 80 secs
lola: sara is running 85 secs || 10372191 markings, 24109206 edges, 109145 markings/sec, 85 secs
lola: sara is running 90 secs || 10956874 markings, 25360533 edges, 116937 markings/sec, 90 secs
lola: sara is running 95 secs || 11533965 markings, 26588980 edges, 115418 markings/sec, 95 secs
lola: sara is running 100 secs || 12074814 markings, 27792026 edges, 108170 markings/sec, 100 secs
lola: sara is running 105 secs || 12648900 markings, 28987558 edges, 114817 markings/sec, 105 secs
lola: sara is running 110 secs || 13168831 markings, 30180992 edges, 103986 markings/sec, 110 secs
lola: sara is running 115 secs || 13732785 markings, 31362883 edges, 112791 markings/sec, 115 secs
lola: sara is running 120 secs || 14223724 markings, 32493308 edges, 98188 markings/sec, 120 secs
lola: sara is running 125 secs || 14784985 markings, 33647634 edges, 112252 markings/sec, 125 secs
lola: sara is running 130 secs || 15295415 markings, 34801398 edges, 102086 markings/sec, 130 secs
lola: sara is running 135 secs || 15827947 markings, 35932575 edges, 106506 markings/sec, 135 secs
lola: sara is running 140 secs || 16291535 markings, 37009027 edges, 92718 markings/sec, 140 secs
lola: sara is running 145 secs || 16838362 markings, 38138741 edges, 109365 markings/sec, 145 secs
lola: sara is running 150 secs || 17337533 markings, 39246366 edges, 99834 markings/sec, 150 secs
lola: sara is running 155 secs || 17855721 markings, 40353433 edges, 103638 markings/sec, 155 secs
lola: sara is running 160 secs || 18308958 markings, 41407113 edges, 90647 markings/sec, 160 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 1117 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t44) AND (FIREABLE(t176) OR FIREABLE(t41) OR FIREABLE(t273)))))
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 40 bytes per marking, with 25 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 3 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-20b-ReachabilityFireability-13.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 14 will run for 1676 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t225)))
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 40 bytes per marking, with 25 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 DES-PT-20b-ReachabilityFireability-14.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-20b-ReachabilityFireability-14.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 3352 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t8) OR (FIREABLE(t91) AND FIREABLE(t24) AND FIREABLE(t130) AND FIREABLE(t201))) AND NOT FIREABLE(t271))))
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 40 bytes per marking, with 25 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 18 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-20b-ReachabilityFireability-15.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-20b-ReachabilityFireability-15.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no yes yes no yes no yes no yes yes yes yes yes yes
FORMULA DES-PT-20b-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-ReachabilityFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-ReachabilityFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-ReachabilityFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496452930896

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