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-2979
Executing tool lola
Input is DrinkVendingMachine-PT-02, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r038kn-smll-146351480400072
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463515933729

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityFireability @ DrinkVendingMachine-PT-02
FORMULA DrinkVendingMachine-COL-02-ReachabilityFireability-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DrinkVendingMachine-COL-02-ReachabilityFireability-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DrinkVendingMachine-COL-02-ReachabilityFireability-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DrinkVendingMachine-COL-02-ReachabilityFireability-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DrinkVendingMachine-COL-02-ReachabilityFireability-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DrinkVendingMachine-COL-02-ReachabilityFireability-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DrinkVendingMachine-COL-02-ReachabilityFireability-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DrinkVendingMachine-COL-02-ReachabilityFireability-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DrinkVendingMachine-COL-02-ReachabilityFireability-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DrinkVendingMachine-COL-02-ReachabilityFireability-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DrinkVendingMachine-COL-02-ReachabilityFireability-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DrinkVendingMachine-COL-02-ReachabilityFireability-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DrinkVendingMachine-COL-02-ReachabilityFireability-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DrinkVendingMachine-COL-02-ReachabilityFireability-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DrinkVendingMachine-COL-02-ReachabilityFireability-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA DrinkVendingMachine-COL-02-ReachabilityFireability-15 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
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: 96/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 24 places, 72 transitions, 12 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 90 transition conflict sets
lola: TASK
lola: reading formula from DrinkVendingMachine-COL-02-ReachabilityFireability.task
lola: read: AG ((((((((((((((((((((FIREABLE(elaborate2_1_1_5_1) OR FIREABLE(elaborate2_1_1_6_1)) OR FIREABLE(elaborate2_2_2_5_1)) OR FIREABLE(elaborate2_1_2_5_1)) OR FIREABLE(elaborate2_2_1_5_1)) OR FIREABLE(elaborate2_2_1_5_2)) OR FIREABLE(elaborate2_1_2_5_2)) OR FIREABLE(elaborate2_2_2_5_2)) OR FIREABLE(elaborate2_1_1_6_2)) OR FIREABLE(elaborate2_2_1_6_1)) OR FIREABLE(elaborate2_1_2_6_1)) OR FIREABLE(elabor... (shortened)
lola: formula length: 22733
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((((FIREABLE(elaborate2_1_1_5_1) OR (FIREABLE(elaborate2_1_1_6_1) OR (FIREABLE(elaborate2_2_2_5_1) OR (FIREABLE(elaborate2_1_2_5_1) OR (FIREABLE(elaborate2_2_1_5_1) OR (FIREABLE(elaborate2_2_1_5_2) OR (FIREABLE(elaborate2_1_2_5_2) OR (FIREABLE(elaborate2_2_2_5_2) OR (FIREABLE(elaborate2_1_1_6_2) OR (FIREABLE(elaborate2_2_1_6_1) OR (FIREABLE(elaborate2_1_2_6_1) OR (FIREABLE(elaborate2_2_2_6_1)... (shortened)
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 4 bytes per marking, with 20 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 482874357808 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((! FIREABLE(elaborate3_1_1_7_1_1) AND (! FIREABLE(elaborate3_1_2_7_1_1) AND (! FIREABLE(elaborate3_2_1_7_1_1) AND (! FIREABLE(elaborate3_1_1_8_1_1) AND (! FIREABLE(elaborate3_2_2_7_1_1) AND (! FIREABLE(elaborate3_2_2_8_1_1) AND (! FIREABLE(elaborate3_1_1_7_2_1) AND (! FIREABLE(elaborate3_2_1_8_1_1) AND (! FIREABLE(elaborate3_1_2_8_1_1) AND (! FIREABLE(elaborate3_2_2_7_2_1) AND (! FIREABLE(elab... (shortened)
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 4 bytes per marking, with 20 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 120 literals
lola: write sara problem file to DrinkVendingMachine-COL-02-ReachabilityFireability.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(addProduct_1) OR FIREABLE(addProduct_2)) AND ((FIREABLE(addOption_2) OR FIREABLE(addOption_1)) AND ((FIREABLE(serve_3) OR (FIREABLE(serve_2) OR (FIREABLE(serve_5) OR (FIREABLE(serve_4) OR (FIREABLE(serve_1) OR (FIREABLE(serve_7) OR (FIREABLE(serve_6) OR FIREABLE(serve_8)))))))) AND ((FIREABLE(elaborate2_1_1_5_1) OR (FIREABLE(elaborate2_1_1_6_1) OR (FIREABLE(elaborate2_2_2_5_1) OR (F... (shortened)
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 4 bytes per marking, with 20 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 176534284 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(addOption_2) AND ! FIREABLE(addOption_1)) OR ((! FIREABLE(elaborate2_1_1_5_1) AND (! FIREABLE(elaborate2_1_1_6_1) AND (! FIREABLE(elaborate2_2_2_5_1) AND (! FIREABLE(elaborate2_1_2_5_1) AND (! FIREABLE(elaborate2_2_1_5_1) AND (! FIREABLE(elaborate2_2_1_5_2) AND (! FIREABLE(elaborate2_1_2_5_2) AND (! FIREABLE(elaborate2_2_2_5_2) AND (! FIREABLE(elaborate2_1_1_6_2) AND (! FIREABLE(e... (shortened)
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 4 bytes per marking, with 20 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 222330 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(elaborate1_2_3_1) AND (! FIREABLE(elaborate1_1_4_1) AND (! FIREABLE(elaborate1_2_4_1) AND (! FIREABLE(elaborate1_1_3_2) AND (! FIREABLE(elaborate1_1_3_1) AND (! FIREABLE(elaborate1_1_4_2) AND (! FIREABLE(elaborate1_2_3_2) AND ! FIREABLE(elaborate1_2_4_2)))))))) OR ((! FIREABLE(elaborate1_2_3_1) AND (! FIREABLE(elaborate1_1_4_1) AND (! FIREABLE(elaborate1_2_4_1) AND (! FIREABLE(ela... (shortened)
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 4 bytes per marking, with 20 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 1261824 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(addOption_2) OR (FIREABLE(addOption_1) OR (FIREABLE(serve_3) OR (FIREABLE(serve_2) OR (FIREABLE(serve_5) OR (FIREABLE(serve_4) OR (FIREABLE(serve_1) OR (FIREABLE(serve_7) OR (FIREABLE(serve_6) OR (FIREABLE(serve_8) OR ((! FIREABLE(addOption_2) AND ! FIREABLE(addOption_1)) OR ((! FIREABLE(elaborate1_2_3_1) AND (! FIREABLE(elaborate1_1_4_1) AND (! FIREABLE(elaborate1_2_4_1) AND (! FIRE... (shortened)
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 4 bytes per marking, with 20 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 958 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(elaborate0_1_2) AND (! FIREABLE(elaborate0_2_1) AND (! FIREABLE(elaborate0_2_2) AND (! FIREABLE(elaborate0_1_1) AND (FIREABLE(elaborate3_1_1_7_1_1) OR (FIREABLE(elaborate3_1_2_7_1_1) OR (FIREABLE(elaborate3_2_1_7_1_1) OR (FIREABLE(elaborate3_1_1_8_1_1) OR (FIREABLE(elaborate3_2_2_7_1_1) OR (FIREABLE(elaborate3_2_2_8_1_1) OR (FIREABLE(elaborate3_1_1_7_2_1) OR (FIREABLE(elaborate3_2_... (shortened)
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 4 bytes per marking, with 20 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 2902 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(elaborate1_2_3_1) OR (FIREABLE(elaborate1_1_4_1) OR (FIREABLE(elaborate1_2_4_1) OR (FIREABLE(elaborate1_1_3_2) OR (FIREABLE(elaborate1_1_3_1) OR (FIREABLE(elaborate1_1_4_2) OR (FIREABLE(elaborate1_2_3_2) OR FIREABLE(elaborate1_2_4_2)))))))) AND ((FIREABLE(addProduct_1) OR FIREABLE(addProduct_2)) AND (FIREABLE(elaborate3_1_1_7_1_1) OR (FIREABLE(elaborate3_1_2_7_1_1) OR (FIREABLE(elab... (shortened)
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 4 bytes per marking, with 20 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 3224 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(elaborate1_2_3_1) OR (FIREABLE(elaborate1_1_4_1) OR (FIREABLE(elaborate1_2_4_1) OR (FIREABLE(elaborate1_1_3_2) OR (FIREABLE(elaborate1_1_3_1) OR (FIREABLE(elaborate1_1_4_2) OR (FIREABLE(elaborate1_2_3_2) OR (FIREABLE(elaborate1_2_4_2) OR (! FIREABLE(elaborate1_2_3_1) AND (! FIREABLE(elaborate1_1_4_1) AND (! FIREABLE(elaborate1_2_4_1) AND (! FIREABLE(elaborate1_1_3_2) AND (! FIREABLE(... (shortened)
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 4 bytes per marking, with 20 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 246000 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((! FIREABLE(elaborate3_1_1_7_1_1) AND (! FIREABLE(elaborate3_1_2_7_1_1) AND (! FIREABLE(elaborate3_2_1_7_1_1) AND (! FIREABLE(elaborate3_1_1_8_1_1) AND (! FIREABLE(elaborate3_2_2_7_1_1) AND (! FIREABLE(elaborate3_2_2_8_1_1) AND (! FIREABLE(elaborate3_1_1_7_2_1) AND (! FIREABLE(elaborate3_2_1_8_1_1) AND (! FIREABLE(elaborate3_1_2_8_1_1) AND (! FIREABLE(elaborate3_2_2_7_2_1) AND (! FIREABLE(elab... (shortened)
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 4 bytes per marking, with 20 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 120 literals
lola: write sara problem file to DrinkVendingMachine-COL-02-ReachabilityFireability-9.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(elaborate0_1_2) OR (FIREABLE(elaborate0_2_1) OR (FIREABLE(elaborate0_2_2) OR FIREABLE(elaborate0_1_1)))) AND (! FIREABLE(elaborate0_1_2) AND (! FIREABLE(elaborate0_2_1) AND (! FIREABLE(elaborate0_2_2) AND (! FIREABLE(elaborate0_1_1) AND ((FIREABLE(elaborate0_1_2) OR (FIREABLE(elaborate0_2_1) OR (FIREABLE(elaborate0_2_2) OR FIREABLE(elaborate0_1_1)))) AND (! FIREABLE(elaborate0_1_2) ... (shortened)
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 4 bytes per marking, with 20 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 279800 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(elaborate0_1_2) AND (! FIREABLE(elaborate0_2_1) AND (! FIREABLE(elaborate0_2_2) AND (! FIREABLE(elaborate0_1_1) AND ((! FIREABLE(addOption_2) AND ! FIREABLE(addOption_1)) OR (! FIREABLE(elaborate0_1_2) AND (! FIREABLE(elaborate0_2_1) AND (! FIREABLE(elaborate0_2_2) AND ! FIREABLE(elaborate0_1_1))))))))) OR ((! FIREABLE(elaborate3_1_1_7_1_1) AND (! FIREABLE(elaborate3_1_2_7_1_1) AN... (shortened)
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 4 bytes per marking, with 20 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 2680 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((! FIREABLE(elaborate3_1_1_7_1_1) AND (! FIREABLE(elaborate3_1_2_7_1_1) AND (! FIREABLE(elaborate3_2_1_7_1_1) AND (! FIREABLE(elaborate3_1_1_8_1_1) AND (! FIREABLE(elaborate3_2_2_7_1_1) AND (! FIREABLE(elaborate3_2_2_8_1_1) AND (! FIREABLE(elaborate3_1_1_7_2_1) AND (! FIREABLE(elaborate3_2_1_8_1_1) AND (! FIREABLE(elaborate3_1_2_8_1_1) AND (! FIREABLE(elaborate3_2_2_7_2_1) AND (! FIREABLE(elab... (shortened)
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 4 bytes per marking, with 20 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 120 literals
lola: write sara problem file to DrinkVendingMachine-COL-02-ReachabilityFireability-12.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(addProduct_1) OR (FIREABLE(addProduct_2) OR ((! FIREABLE(elaborate2_1_1_5_1) AND (! FIREABLE(elaborate2_1_1_6_1) AND (! FIREABLE(elaborate2_2_2_5_1) AND (! FIREABLE(elaborate2_1_2_5_1) AND (! FIREABLE(elaborate2_2_1_5_1) AND (! FIREABLE(elaborate2_2_1_5_2) AND (! FIREABLE(elaborate2_1_2_5_2) AND (! FIREABLE(elaborate2_2_2_5_2) AND (! FIREABLE(elaborate2_1_1_6_2) AND (! FIREABLE(elabo... (shortened)
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 4 bytes per marking, with 20 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 242 literals
lola: write sara problem file to DrinkVendingMachine-COL-02-ReachabilityFireability-13.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(elaborate3_1_1_7_1_1) AND (! FIREABLE(elaborate3_1_2_7_1_1) AND (! FIREABLE(elaborate3_2_1_7_1_1) AND (! FIREABLE(elaborate3_1_1_8_1_1) AND (! FIREABLE(elaborate3_2_2_7_1_1) AND (! FIREABLE(elaborate3_2_2_8_1_1) AND (! FIREABLE(elaborate3_1_1_7_2_1) AND (! FIREABLE(elaborate3_2_1_8_1_1) AND (! FIREABLE(elaborate3_1_2_8_1_1) AND (! FIREABLE(elaborate3_2_2_7_2_1) AND (! FIREABLE(ela... (shortened)
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 4 bytes per marking, with 20 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 2584 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(addProduct_1) OR (FIREABLE(addProduct_2) OR (((FIREABLE(elaborate1_2_3_1) OR (FIREABLE(elaborate1_1_4_1) OR (FIREABLE(elaborate1_2_4_1) OR (FIREABLE(elaborate1_1_3_2) OR (FIREABLE(elaborate1_1_3_1) OR (FIREABLE(elaborate1_1_4_2) OR (FIREABLE(elaborate1_2_3_2) OR FIREABLE(elaborate1_2_4_2)))))))) AND ((FIREABLE(elaborate2_1_1_5_1) OR (FIREABLE(elaborate2_1_1_6_1) OR (FIREABLE(elaborat... (shortened)
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 4 bytes per marking, with 20 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 44666567681 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: RESULT
lola: summary: yes yes no yes yes yes no no yes yes no yes yes yes yes yes

BK_STOP 1463515933991

--------------------
content from 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="DrinkVendingMachine-PT-02"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="lola"
export BK_RESULT_DIR="/root/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/DrinkVendingMachine-PT-02.tgz
mv DrinkVendingMachine-PT-02 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool lola"
echo " Input is DrinkVendingMachine-PT-02, 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 r038kn-smll-146351480400072"
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 ;