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 PolyORBLF-PT-S02J04T10, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086kn-ebro-146369088900684
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463719068620

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityFireability @ PolyORBLF-PT-S02J04T10
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityFireability-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityFireability-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityFireability-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityFireability-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityFireability-4 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityFireability-5 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityFireability-6 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityFireability-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityFireability-8 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityFireability-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityFireability-10 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityFireability-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityFireability-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityFireability-13 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityFireability-14 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityFireability-15 CANNOT_COMPUTE
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: 2324/65536 symbol table entries, 18 collisions
lola: preprocessing...
lola: finding significant places
lola: 752 places, 1572 transitions, 698 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2143 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-COL-S02J04T10-ReachabilityFireability.task
lola: read: EF ((((((((((FIREABLE(NotifyEventSourceAdded_5) OR FIREABLE(NotifyEventSourceAdded_4)) OR FIREABLE(NotifyEventSourceAdded_7)) OR FIREABLE(NotifyEventSourceAdded_6)) OR FIREABLE(NotifyEventSourceAdded_9)) OR FIREABLE(NotifyEventSourceAdded_8)) OR FIREABLE(NotifyEventSourceAdded_2)) OR FIREABLE(NotifyEventSourceAdded_1)) OR FIREABLE(NotifyEventSourceAdded_10)) OR FIREABLE(NotifyEventSourceAdded_3)))... (shortened)
lola: formula length: 54026
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(NotifyEventSourceAdded_5) OR (FIREABLE(NotifyEventSourceAdded_4) OR (FIREABLE(NotifyEventSourceAdded_7) OR (FIREABLE(NotifyEventSourceAdded_6) OR (FIREABLE(NotifyEventSourceAdded_9) OR (FIREABLE(NotifyEventSourceAdded_8) OR (FIREABLE(NotifyEventSourceAdded_2) OR (FIREABLE(NotifyEventSourceAdded_1) OR (FIREABLE(NotifyEventSourceAdded_10) OR FIREABLE(NotifyEventSourceAdded_3)))))))))))... (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 2792 bytes per marking, with 0 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 10 literals
lola: write sara problem file to PolyORBLF-COL-S02J04T10-ReachabilityFireability.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(T_1444_1) OR (FIREABLE(T_1444_5) OR (FIREABLE(T_1444_2) OR (FIREABLE(T_1444_3) OR (FIREABLE(T_1444_4) OR (FIREABLE(T_1444_10) OR (FIREABLE(T_1444_6) OR (FIREABLE(T_1444_9) OR (FIREABLE(T_1444_8) OR FIREABLE(T_1444_7)))))))))) AND (! FIREABLE(T_1123_9_1) AND (! FIREABLE(T_1123_8_1) AND (! FIREABLE(T_1123_4_2) AND (! FIREABLE(T_1123_3_1) AND (! FIREABLE(T_1123_5_2) AND (! FIREABLE(T_1... (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 2792 bytes per marking, with 0 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 923997866000 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(WillPerformWork_1_8) OR (FIREABLE(WillPerformWork_3_7) OR (FIREABLE(WillPerformWork_2_2) OR (FIREABLE(WillPerformWork_0_1) OR (FIREABLE(WillPerformWork_1_5) OR (FIREABLE(WillPerformWork_2_10) OR (FIREABLE(WillPerformWork_1_9) OR (FIREABLE(WillPerformWork_2_6) OR (FIREABLE(WillPerformWork_2_1) OR (FIREABLE(WillPerformWork_3_6) OR (FIREABLE(WillPerformWork_4_5) OR (FIREABLE(WillPerfor... (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 2792 bytes per marking, with 0 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 230584300921369362432 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((FIREABLE(NopAbort_10) OR (FIREABLE(NopAbort_4) OR (FIREABLE(NopAbort_3) OR (FIREABLE(NopAbort_5) OR (FIREABLE(NopAbort_6) OR (FIREABLE(NopAbort_1) OR (FIREABLE(NopAbort_7) OR (FIREABLE(NopAbort_8) OR (FIREABLE(NopAbort_2) OR (FIREABLE(NopAbort_9) OR (FIREABLE(T_1722_3_9) OR (FIREABLE(T_1722_3_8) OR (FIREABLE(T_1722_4_3) OR (FIREABLE(T_1722_0_1) OR (FIREABLE(T_1722_4_6) OR (FIREABLE(T_1722_2_... (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 2792 bytes per marking, with 0 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: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(T_2294_5) OR (FIREABLE(T_2294_4) OR (FIREABLE(T_2294_6) OR (FIREABLE(T_2294_7) OR (FIREABLE(T_2294_8) OR (FIREABLE(T_2294_1) OR (FIREABLE(T_2294_9) OR (FIREABLE(T_2294_3) OR (FIREABLE(T_2294_10) OR (FIREABLE(T_2294_2) OR ((! FIREABLE(T_0383_2_9) AND (! FIREABLE(T_0383_1_10) AND (! FIREABLE(T_0383_1_3) AND (! FIREABLE(T_0383_2_2) AND (! FIREABLE(T_0383_1_6) AND (! FIREABLE(T_0383_2_6)... (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 2792 bytes per marking, with 0 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 226560 literals
lola: DNF formula is too big, sara cannot be used
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(NotifyEventJobCompleted_7) OR (FIREABLE(NotifyEventJobCompleted_6) OR (FIREABLE(NotifyEventJobCompleted_4) OR (FIREABLE(NotifyEventJobCompleted_3) OR (FIREABLE(NotifyEventJobCompleted_5) OR (FIREABLE(NotifyEventJobCompleted_10) OR (FIREABLE(NotifyEventJobCompleted_2) OR (FIREABLE(NotifyEventJobCompleted_8) OR (FIREABLE(NotifyEventJobCompleted_1) OR FIREABLE(NotifyEventJobCompleted_9... (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 2792 bytes per marking, with 0 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 1520541890 literals
lola: DNF formula is too big, sara cannot be used
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(EnterCSPW_2) OR (FIREABLE(EnterCSPW_3) OR (FIREABLE(EnterCSPW_4) OR (FIREABLE(EnterCSPW_7) OR (FIREABLE(EnterCSPW_6) OR (FIREABLE(EnterCSPW_5) OR (FIREABLE(EnterCSPW_8) OR (FIREABLE(EnterCSPW_1) OR (FIREABLE(EnterCSPW_10) OR (FIREABLE(EnterCSPW_9) OR (FIREABLE(T_2577_1_9) OR (FIREABLE(T_2577_2_3) OR (FIREABLE(T_2577_1_5) OR (FIREABLE(T_2577_2_7) OR (FIREABLE(T_2577_2_4) OR (FIREABLE... (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 2792 bytes per marking, with 0 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 22698142121975685120 literals
lola: DNF formula is too big, sara cannot be used
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((! FIREABLE(T_1146_1) AND (! FIREABLE(T_1146_7) AND (! FIREABLE(T_1146_6) AND (! FIREABLE(T_1146_5) AND (! FIREABLE(T_1146_4) AND (! FIREABLE(T_1146_8) AND (! FIREABLE(T_1146_3) AND (! FIREABLE(T_1146_2) AND (! FIREABLE(T_1146_9) AND ! FIREABLE(T_1146_10)))))))))))
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 2792 bytes per marking, with 0 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 10 literals
lola: write sara problem file to PolyORBLF-COL-S02J04T10-ReachabilityFireability-7.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 8 will run for 331 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((FIREABLE(T_1171_6) OR (FIREABLE(T_1171_9) OR (FIREABLE(T_1171_8) OR (FIREABLE(T_1171_1) OR (FIREABLE(T_1171_2) OR (FIREABLE(T_1171_3) OR (FIREABLE(T_1171_5) OR (FIREABLE(T_1171_10) OR (FIREABLE(T_1171_4) OR FIREABLE(T_1171_7)))))))))) AND (FIREABLE(WaitforBlockedTasks_1_7) OR (FIREABLE(WaitforBlockedTasks_1_9) OR (FIREABLE(WaitforBlockedTasks_2_3) OR (FIREABLE(WaitforBlockedTasks_2_8) OR (F... (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 2792 bytes per marking, with 0 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 37830237927897899008 literals
lola: DNF formula is too big, sara cannot be used
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 331 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(NoMonitoring_5) AND (! FIREABLE(NoMonitoring_10) AND (! FIREABLE(NoMonitoring_3) AND (! FIREABLE(NoMonitoring_9) AND (! FIREABLE(NoMonitoring_4) AND (! FIREABLE(NoMonitoring_8) AND (! FIREABLE(NoMonitoring_7) AND (! FIREABLE(NoMonitoring_1) AND (! FIREABLE(NoMonitoring_6) AND ! FIREABLE(NoMonitoring_2)))))))))) OR ((FIREABLE(T_1096_2) OR (FIREABLE(T_1096_8) OR (FIREABLE(T_1096_5) ... (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 2792 bytes per marking, with 0 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 82480 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 10 will run for 387 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((! FIREABLE(T_2315_1) AND (! FIREABLE(T_2315_10) AND (! FIREABLE(T_2315_2) AND (! FIREABLE(T_2315_9) AND (! FIREABLE(T_2315_4) AND (! FIREABLE(T_2315_6) AND (! FIREABLE(T_2315_5) AND (! FIREABLE(T_2315_3) AND (! FIREABLE(T_2315_8) AND ! FIREABLE(T_2315_7)))))))))) OR (FIREABLE(T_2578_2_7) OR (FIREABLE(T_2578_1_7) OR (FIREABLE(T_2578_2_2) OR (FIREABLE(T_2578_1_9) OR (FIREABLE(T_2578_1_2) OR (... (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 2792 bytes per marking, with 0 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 90908 literals
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 462 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(EnterCSPW_2) OR (FIREABLE(EnterCSPW_3) OR (FIREABLE(EnterCSPW_4) OR (FIREABLE(EnterCSPW_7) OR (FIREABLE(EnterCSPW_6) OR (FIREABLE(EnterCSPW_5) OR (FIREABLE(EnterCSPW_8) OR (FIREABLE(EnterCSPW_1) OR (FIREABLE(EnterCSPW_10) OR FIREABLE(EnterCSPW_9)))))))))))
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 2792 bytes per marking, with 0 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 20 literals
lola: write sara problem file to PolyORBLF-COL-S02J04T10-ReachabilityFireability-11.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 12 will run for 578 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(T_1722_3_9) AND (! FIREABLE(T_1722_3_8) AND (! FIREABLE(T_1722_4_3) AND (! FIREABLE(T_1722_0_1) AND (! FIREABLE(T_1722_4_6) AND (! FIREABLE(T_1722_2_8) AND (! FIREABLE(T_1722_1_5) AND (! FIREABLE(T_1722_4_9) AND (! FIREABLE(T_1722_0_7) AND (! FIREABLE(T_1722_4_5) AND (! FIREABLE(T_1722_0_10) AND (! FIREABLE(T_1722_0_4) AND (! FIREABLE(T_1722_1_8) AND (! FIREABLE(T_1722_3_5) AND (! ... (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 2792 bytes per marking, with 0 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 58508685996885999234318336 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 771 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(T_1148_8) OR (FIREABLE(T_1148_9) OR (FIREABLE(T_1148_6) OR (FIREABLE(T_1148_1) OR (FIREABLE(T_1148_7) OR (FIREABLE(T_1148_4) OR (FIREABLE(T_1148_5) OR (FIREABLE(T_1148_2) OR (FIREABLE(T_1148_10) OR FIREABLE(T_1148_3)))))))))) AND ((FIREABLE(LeaveIdle_5_5) OR (FIREABLE(LeaveIdle_4_4) OR (FIREABLE(LeaveIdle_7_7) OR (FIREABLE(LeaveIdle_6_6) OR (FIREABLE(LeaveIdle_2_2) OR (FIREABLE(Leav... (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 2792 bytes per marking, with 0 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 470017607454063844453782287416071831150067901863060785688514276859639102087102464 literals
lola: DNF formula is too big, sara cannot be used
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 771 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(T_1147_8) OR (FIREABLE(T_1147_1) OR (FIREABLE(T_1147_2) OR (FIREABLE(T_1147_10) OR (FIREABLE(T_1147_3) OR (FIREABLE(T_1147_5) OR (FIREABLE(T_1147_4) OR (FIREABLE(T_1147_7) OR (FIREABLE(T_1147_6) OR FIREABLE(T_1147_9)))))))))) AND ((FIREABLE(GoIdle_7) OR (FIREABLE(GoIdle_6) OR (FIREABLE(GoIdle_1) OR (FIREABLE(GoIdle_9) OR (FIREABLE(GoIdle_10) OR (FIREABLE(GoIdle_3) OR (FIREABLE(GoIdl... (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 2792 bytes per marking, with 0 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 234835260 literals
lola: DNF formula is too big, sara cannot be used
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 770 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(T_2317_4) OR (FIREABLE(T_2317_3) OR (FIREABLE(T_2317_9) OR (FIREABLE(T_2317_2) OR (FIREABLE(T_2317_1) OR (FIREABLE(T_2317_10) OR (FIREABLE(T_2317_7) OR (FIREABLE(T_2317_8) OR (FIREABLE(T_2317_6) OR FIREABLE(T_2317_5)))))))))) AND ((FIREABLE(T_1170_9) OR (FIREABLE(T_1170_10) OR (FIREABLE(T_1170_5) OR (FIREABLE(T_1170_4) OR (FIREABLE(T_1170_3) OR (FIREABLE(T_1170_2) OR (FIREABLE(T_117... (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 2792 bytes per marking, with 0 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 83109505060 literals
lola: DNF formula is too big, sara cannot be used
lola: local time limit reached - aborting
lola: time limit reached - aborting
lola: preliminary result: yes yes yes no unknown unknown unknown no unknown no unknown yes yes unknown unknown

BK_STOP 1463722608788

--------------------
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="PolyORBLF-PT-S02J04T10"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="lola"
export BK_RESULT_DIR="/users/gast00/fkordon/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/PolyORBLF-PT-S02J04T10.tgz
mv PolyORBLF-PT-S02J04T10 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 PolyORBLF-PT-S02J04T10, 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 r086kn-ebro-146369088900684"
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 ;