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 ProductionCell-PT-none, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-149440926200189
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494753302807


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
ReachabilityFireability @ ProductionCell-PT-none @ 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: 310/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 176 places, 134 transitions, 126 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 200 transition conflict sets
lola: TASK
lola: reading formula from ProductionCell-PT-none-ReachabilityFireability.task
lola: A (G ((NOT FIREABLE(t46) AND (NOT FIREABLE(t119) OR FIREABLE(t76))))) : E (F (FIREABLE(t56))) : E (F ((FIREABLE(t60) AND FIREABLE(t66) AND NOT FIREABLE(t78) AND NOT FIREABLE(t85) AND NOT FIREABLE(t47) AND NOT FIREABLE(t29)))) : E (F ((FIREABLE(t19) AND ((FIREABLE(t132) AND FIREABLE(t111)) OR FIREABLE(t103)) AND NOT FIREABLE(t125) AND NOT FIREABLE(t114) AND (NOT FIREABLE(t24) OR NOT FIREABLE(t98))))) : E (F ((FIREABLE(t23) AND (FIREABLE(t83) OR FIREABLE(t86)) AND (NOT FIREABLE(t29) OR NOT FIREABLE(t79) OR FIREABLE(t51) OR FIREABLE(t38) OR FIREABLE(t34))))) : E (F (FIREABLE(t16))) : A (G ((NOT FIREABLE(t56) AND (NOT FIREABLE(t30) OR NOT FIREABLE(t55) OR (NOT FIREABLE(t70) AND NOT FIREABLE(t96)))))) : E (F ((FIREABLE(t101) AND FIREABLE(t7) AND (FIREABLE(t53) OR FIREABLE(t102) OR FIREABLE(t115)) AND FIREABLE(t103)))) : E (F (((NOT FIREABLE(t126) OR NOT FIREABLE(t77)) AND FIREABLE(t83) AND (FIREABLE(t100) OR FIREABLE(t36) OR NOT FIREABLE(t39)) AND FIREABLE(t102)))) : E (F ((((FIREABLE(t133) AND FIREABLE(t87)) OR NOT FIREABLE(t24)) AND FIREABLE(t126) AND NOT FIREABLE(t41)))) : A (G ((NOT FIREABLE(t56) OR FIREABLE(t18) OR (NOT FIREABLE(t107) AND (FIREABLE(t96) OR FIREABLE(t39))) OR FIREABLE(t98) OR FIREABLE(t116) OR (FIREABLE(t125) AND FIREABLE(t8)) OR FIREABLE(t87)))) : E (F (((FIREABLE(t58) OR FIREABLE(t101)) AND (FIREABLE(t127) OR FIREABLE(t129))))) : A (G (((NOT FIREABLE(t85) AND NOT FIREABLE(t22) AND (NOT FIREABLE(t92) OR NOT FIREABLE(t76))) OR (FIREABLE(t33) AND NOT FIREABLE(t115))))) : E (F (((NOT FIREABLE(t13) OR NOT FIREABLE(t81)) AND FIREABLE(t24) AND NOT FIREABLE(t115)))) : A (G ((NOT FIREABLE(t104) OR NOT FIREABLE(t17) OR NOT FIREABLE(t100) OR NOT FIREABLE(t105) OR ((FIREABLE(t5) OR NOT FIREABLE(t1)) AND NOT FIREABLE(t116))))) : E (F ((FIREABLE(t67) AND FIREABLE(t103))))
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 ((NOT FIREABLE(t46) AND (NOT FIREABLE(t119) OR FIREABLE(t76)))))
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 16 bytes per marking, with 2 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 ProductionCell-PT-none-ReachabilityFireability.sara
lola: 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 (FIREABLE(t56)))
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 16 bytes per marking, with 2 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 ProductionCell-PT-none-ReachabilityFireability.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t60) AND FIREABLE(t66) AND NOT FIREABLE(t78) AND NOT FIREABLE(t85) AND NOT FIREABLE(t47) AND NOT FIREABLE(t29))))
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 16 bytes per marking, with 2 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 ProductionCell-PT-none-ReachabilityFireability-2.sara
lola: state equation: calling and running sara
sara: try reading problem file ProductionCell-PT-none-ReachabilityFireability-2.sara.
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 3)
lola: sara is running 0 secs || 1215690 markings, 3712063 edges, 243138 markings/sec, 0 secs
lola: sara is running 5 secs || 2385825 markings, 7430715 edges, 234027 markings/sec, 5 secs
lola: sara is running 10 secs || 3530024 markings, 11071261 edges, 228840 markings/sec, 10 secs
lola: sara is running 15 secs || 4636295 markings, 14697777 edges, 221254 markings/sec, 15 secs
lola: sara is running 20 secs || 5723667 markings, 18393933 edges, 217474 markings/sec, 20 secs
lola: sara is running 25 secs || 6834720 markings, 22183931 edges, 222211 markings/sec, 25 secs
lola: sara is running 30 secs || 7906944 markings, 25901848 edges, 214445 markings/sec, 30 secs
lola: sara is running 35 secs || 8925640 markings, 29552639 edges, 203739 markings/sec, 35 secs
lola: sara is running 40 secs || 9902481 markings, 33187297 edges, 195368 markings/sec, 40 secs
lola: sara is running 45 secs || 11122146 markings, 36991220 edges, 243933 markings/sec, 45 secs
lola: sara is running 50 secs || 12267164 markings, 40748607 edges, 229004 markings/sec, 50 secs
lola: sara is running 55 secs || 13378011 markings, 44501110 edges, 222169 markings/sec, 55 secs
lola: sara is running 60 secs || 14425244 markings, 48200918 edges, 209447 markings/sec, 60 secs
lola: sara is running 65 secs || 15535501 markings, 51947813 edges, 222051 markings/sec, 65 secs
lola: sara is running 70 secs || 16655773 markings, 55726374 edges, 224054 markings/sec, 70 secs
lola: sara is running 75 secs || 17800888 markings, 59453512 edges, 229023 markings/sec, 75 secs
lola: sara is running 80 secs || 18928085 markings, 62923629 edges, 225439 markings/sec, 80 secs
lola: sara is running 85 secs || 20078742 markings, 66454977 edges, 230131 markings/sec, 85 secs
lola: sara is running 90 secs || 21198590 markings, 69939413 edges, 223970 markings/sec, 90 secs
lola: sara is running 95 secs || 22312660 markings, 73433724 edges, 222814 markings/sec, 95 secs
lola: sara is running 100 secs || 23416799 markings, 76959639 edges, 220828 markings/sec, 100 secs
lola: sara is running 105 secs || 24481985 markings, 80447347 edges, 213037 markings/sec, 105 secs
lola: sara is running 110 secs || 25581239 markings, 83908582 edges, 219851 markings/sec, 110 secs
lola: sara is running 115 secs || 26621491 markings, 87344944 edges, 208050 markings/sec, 115 secs
lola: sara is running 120 secs || 27673388 markings, 90736581 edges, 210379 markings/sec, 120 secs
lola: sara is running 125 secs || 28702567 markings, 94139008 edges, 205836 markings/sec, 125 secs
lola: sara is running 130 secs || 29735114 markings, 97566335 edges, 206509 markings/sec, 130 secs
lola: sara is running 135 secs || 30749286 markings, 100991277 edges, 202834 markings/sec, 135 secs
lola: sara is running 140 secs || 31728500 markings, 104359327 edges, 195843 markings/sec, 140 secs
lola: sara is running 145 secs || 32867298 markings, 108037574 edges, 227760 markings/sec, 145 secs
lola: sara is running 150 secs || 33899270 markings, 111578673 edges, 206394 markings/sec, 150 secs
lola: sara is running 155 secs || 34879197 markings, 114955003 edges, 195985 markings/sec, 155 secs
lola: sara is running 160 secs || 35910953 markings, 118519744 edges, 206351 markings/sec, 160 secs
lola: sara is running 165 secs || 36879385 markings, 122018087 edges, 193686 markings/sec, 165 secs
lola: sara is running 170 secs || 37824825 markings, 125452392 edges, 189088 markings/sec, 170 secs
lola: sara is running 175 secs || 38730766 markings, 128719380 edges, 181188 markings/sec, 175 secs
lola: sara is running 180 secs || 39653542 markings, 132013180 edges, 184555 markings/sec, 180 secs
lola: sara is running 185 secs || 40617203 markings, 135506075 edges, 192732 markings/sec, 185 secs
lola: sara is running 190 secs || 41550140 markings, 138936037 edges, 186587 markings/sec, 190 secs
lola: sara is running 195 secs || 42467381 markings, 142292388 edges, 183448 markings/sec, 195 secs
lola: sara is running 200 secs || 43393468 markings, 145788821 edges, 185217 markings/sec, 200 secs
lola: sara is running 205 secs || 44285830 markings, 149221206 edges, 178472 markings/sec, 205 secs
lola: sara is running 210 secs || 45157417 markings, 152592068 edges, 174317 markings/sec, 210 secs
lola: sara is running 215 secs || 45985641 markings, 155794707 edges, 165645 markings/sec, 215 secs
lola: sara is running 220 secs || 46895305 markings, 158996142 edges, 181933 markings/sec, 220 secs
lola: sara is running 225 secs || 47972677 markings, 162564630 edges, 215474 markings/sec, 225 secs
lola: sara is running 230 secs || 48999667 markings, 166116924 edges, 205398 markings/sec, 230 secs
lola: sara is running 235 secs || 50003624 markings, 169615270 edges, 200791 markings/sec, 235 secs
lola: sara is running 240 secs || 50970341 markings, 173085486 edges, 193343 markings/sec, 240 secs
lola: sara is running 245 secs || 51891373 markings, 176322611 edges, 184206 markings/sec, 245 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t19) AND ((FIREABLE(t132) AND FIREABLE(t111)) OR FIREABLE(t103)) AND NOT FIREABLE(t125) AND NOT FIREABLE(t114) AND (NOT FIREABLE(t24) OR NOT FIREABLE(t98)))))
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 16 bytes per marking, with 2 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 420 literals and 60 conjunctive subformulas
lola: state equation: write sara problem file to ProductionCell-PT-none-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 273 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t23) AND (FIREABLE(t83) OR FIREABLE(t86)) AND (NOT FIREABLE(t29) OR NOT FIREABLE(t79) OR FIREABLE(t51) OR FIREABLE(t38) OR FIREABLE(t34)))))
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 16 bytes per marking, with 2 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 62 literals and 13 conjunctive subformulas
lola: state equation: write sara problem file to ProductionCell-PT-none-ReachabilityFireability-4.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 5 will run for 298 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t16)))
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 16 bytes per marking, with 2 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 ProductionCell-PT-none-ReachabilityFireability-5.sara
sara: try reading problem file ProductionCell-PT-none-ReachabilityFireability-4.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 328 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t56) AND (NOT FIREABLE(t30) OR NOT FIREABLE(t55) OR (NOT FIREABLE(t70) AND NOT FIREABLE(t96))))))
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 16 bytes per marking, with 2 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 11 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to ProductionCell-PT-none-ReachabilityFireability-6.sara
lola: SUBRESULT
lola: state equation: calling and running sara
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 7 will run for 365 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t101) AND FIREABLE(t7) AND (FIREABLE(t53) OR FIREABLE(t102) OR FIREABLE(t115)) AND FIREABLE(t103))))
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 16 bytes per marking, with 2 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 21 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to ProductionCell-PT-none-ReachabilityFireability-7.sara
sara: try reading problem file ProductionCell-PT-none-ReachabilityFireability-6.sara.
lola: state equation: calling and running sara
sara: try reading problem file ProductionCell-PT-none-ReachabilityFireability-7.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
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 8 will run for 410 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(t126) OR NOT FIREABLE(t77)) AND FIREABLE(t83) AND (FIREABLE(t100) OR FIREABLE(t36) OR NOT FIREABLE(t39)) AND FIREABLE(t102))))
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 16 bytes per marking, with 2 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 57 literals and 9 conjunctive subformulas
lola: state equation: write sara problem file to ProductionCell-PT-none-ReachabilityFireability-8.sara
lola: state equation: calling and running sara
sara: try reading problem file ProductionCell-PT-none-ReachabilityFireability-8.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: subprocess 9 will run for 469 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((FIREABLE(t133) AND FIREABLE(t87)) OR NOT FIREABLE(t24)) AND FIREABLE(t126) AND NOT FIREABLE(t41))))
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 16 bytes per marking, with 2 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 20 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to ProductionCell-PT-none-ReachabilityFireability-9.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 547 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t56) OR FIREABLE(t18) OR (NOT FIREABLE(t107) AND (FIREABLE(t96) OR FIREABLE(t39))) OR FIREABLE(t98) OR FIREABLE(t116) OR (FIREABLE(t125) AND FIREABLE(t8)) OR FIREABLE(t87))))
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 16 bytes per marking, with 2 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: ========================================
lola: subprocess 11 will run for 657 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t58) OR FIREABLE(t101)) AND (FIREABLE(t127) OR FIREABLE(t129)))))
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 16 bytes per marking, with 2 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 ProductionCell-PT-none-ReachabilityFireability-11.sara
lola: state equation: calling and running sara
sara: try reading problem file ProductionCell-PT-none-ReachabilityFireability-11.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: subprocess 12 will run for 821 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t85) AND NOT FIREABLE(t22) AND (NOT FIREABLE(t92) OR NOT FIREABLE(t76))) OR (FIREABLE(t33) AND NOT FIREABLE(t115)))))
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 16 bytes per marking, with 2 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 9 conjunctive subformulas
lola: state equation: write sara problem file to ProductionCell-PT-none-ReachabilityFireability-12.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 13 will run for 1095 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(t13) OR NOT FIREABLE(t81)) AND FIREABLE(t24) AND NOT FIREABLE(t115))))
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 16 bytes per marking, with 2 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 6 conjunctive subformulas
lola: state equation: write sara problem file to ProductionCell-PT-none-ReachabilityFireability-13.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1643 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t104) OR NOT FIREABLE(t17) OR NOT FIREABLE(t100) OR NOT FIREABLE(t105) OR ((FIREABLE(t5) OR NOT FIREABLE(t1)) AND NOT FIREABLE(t116)))))
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 16 bytes per marking, with 2 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 31 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ProductionCell-PT-none-ReachabilityFireability-14.sara
lola: state equation: calling and running sara
sara: try reading problem file ProductionCell-PT-none-ReachabilityFireability-14.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 15 will run for 3287 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t67) AND FIREABLE(t103))))
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 16 bytes per marking, with 2 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 ProductionCell-PT-none-ReachabilityFireability-15.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes unknown yes yes yes no no yes yes no yes no yes yes yes
FORMULA ProductionCell-PT-none-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ProductionCell-PT-none-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ProductionCell-PT-none-ReachabilityFireability-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ProductionCell-PT-none-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ProductionCell-PT-none-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ProductionCell-PT-none-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ProductionCell-PT-none-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ProductionCell-PT-none-ReachabilityFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ProductionCell-PT-none-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ProductionCell-PT-none-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ProductionCell-PT-none-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ProductionCell-PT-none-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ProductionCell-PT-none-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ProductionCell-PT-none-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ProductionCell-PT-none-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ProductionCell-PT-none-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494753555246

--------------------
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="ProductionCell-PT-none"
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/ProductionCell-PT-none.tgz
mv ProductionCell-PT-none 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 ProductionCell-PT-none, 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 r058-smll-149440926200189"
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 ;