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

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

=== Now, execution of the tool begins

BK_START 1463727068836

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityFireability @ PolyORBLF-PT-S04J04T10
FORMULA PolyORBLF-COL-S04J04T10-ReachabilityFireability-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J04T10-ReachabilityFireability-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J04T10-ReachabilityFireability-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J04T10-ReachabilityFireability-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J04T10-ReachabilityFireability-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J04T10-ReachabilityFireability-5 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S04J04T10-ReachabilityFireability-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J04T10-ReachabilityFireability-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J04T10-ReachabilityFireability-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J04T10-ReachabilityFireability-9 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S04J04T10-ReachabilityFireability-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J04T10-ReachabilityFireability-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J04T10-ReachabilityFireability-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J04T10-ReachabilityFireability-13 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S04J04T10-ReachabilityFireability-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J04T10-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: 5904/65536 symbol table entries, 1496 collisions
lola: preprocessing...
lola: finding significant places
lola: 870 places, 5034 transitions, 812 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 3097 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-COL-S04J04T10-ReachabilityFireability.task
lola: read: AG (!((((((((((FIREABLE(T_1145_9) OR FIREABLE(T_1145_6)) OR FIREABLE(T_1145_7)) OR FIREABLE(T_1145_8)) OR FIREABLE(T_1145_1)) OR FIREABLE(T_1145_4)) OR FIREABLE(T_1145_3)) OR FIREABLE(T_1145_5)) OR FIREABLE(T_1145_2)) OR FIREABLE(T_1145_10)))) : EF ((((((((((FIREABLE(NopAbort_2) OR FIREABLE(NopAbort_5)) OR FIREABLE(NopAbort_4)) OR FIREABLE(NopAbort_7)) OR FIREABLE(NopAbort_1)) OR FIREABLE(NopAbort... (shortened)
lola: formula length: 130064
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 198 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((! FIREABLE(T_1145_9) AND (! FIREABLE(T_1145_6) AND (! FIREABLE(T_1145_7) AND (! FIREABLE(T_1145_8) AND (! FIREABLE(T_1145_1) AND (! FIREABLE(T_1145_4) AND (! FIREABLE(T_1145_3) AND (! FIREABLE(T_1145_5) AND (! FIREABLE(T_1145_2) AND ! FIREABLE(T_1145_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 3248 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-S04J04T10-ReachabilityFireability.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 1 will run for 212 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(NopAbort_2) OR (FIREABLE(NopAbort_5) OR (FIREABLE(NopAbort_4) OR (FIREABLE(NopAbort_7) OR (FIREABLE(NopAbort_1) OR (FIREABLE(NopAbort_6) OR (FIREABLE(NopAbort_9) OR (FIREABLE(NopAbort_3) OR (FIREABLE(NopAbort_8) OR FIREABLE(NopAbort_10)))))))))))
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 3248 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-S04J04T10-ReachabilityFireability.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J04T10-ReachabilityFireability.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 226 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(T_1146_8) OR (FIREABLE(T_1146_1) OR (FIREABLE(T_1146_7) OR (FIREABLE(T_1146_6) OR (FIREABLE(T_1146_5) OR (FIREABLE(T_1146_10) OR (FIREABLE(T_1146_4) OR (FIREABLE(T_1146_3) OR (FIREABLE(T_1146_2) OR FIREABLE(T_1146_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 3248 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-S04J04T10-ReachabilityFireability-2.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 3 will run for 243 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((! FIREABLE(T_1098_5) AND (! FIREABLE(T_1098_6) AND (! FIREABLE(T_1098_7) AND (! FIREABLE(T_1098_9) AND (! FIREABLE(T_1098_8) AND (! FIREABLE(T_1098_1) AND (! FIREABLE(T_1098_2) AND (! FIREABLE(T_1098_3) AND (! FIREABLE(T_1098_10) AND (! FIREABLE(T_1098_4) AND (FIREABLE(T_1100_2) OR (FIREABLE(T_1100_10) OR (FIREABLE(T_1100_8) OR (FIREABLE(T_1100_9) OR (FIREABLE(T_1100_1) OR (FIREABLE(T_1100_6... (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 3248 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 43266 literals
lola: write sara problem file to PolyORBLF-COL-S04J04T10-ReachabilityFireability-3.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J04T10-ReachabilityFireability-3.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 4 will run for 260 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((((! FIREABLE(T_2315_5) AND (! FIREABLE(T_2315_4) AND (! FIREABLE(T_2315_6) AND (! FIREABLE(T_2315_7) AND (! FIREABLE(T_2315_8) AND (! FIREABLE(T_2315_1) AND (! FIREABLE(T_2315_9) AND (! FIREABLE(T_2315_10) AND (! FIREABLE(T_2315_3) AND ! FIREABLE(T_2315_2)))))))))) OR (! FIREABLE(T_0383_2_9) AND (! FIREABLE(T_0383_1_5) AND (! FIREABLE(T_0383_1_1) AND (! FIREABLE(T_0383_2_2) AND (! FIREABLE(T... (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 3248 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 5 will run for 284 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(GoCheckSource_5) AND (! FIREABLE(GoCheckSource_2) AND (! FIREABLE(GoCheckSource_3) AND (! FIREABLE(GoCheckSource_8) AND (! FIREABLE(GoCheckSource_9) AND (! FIREABLE(GoCheckSource_6) AND (! FIREABLE(GoCheckSource_4) AND (! FIREABLE(GoCheckSource_7) AND (! FIREABLE(GoCheckSource_10) AND ! FIREABLE(GoCheckSource_1)))))))))) OR (! FIREABLE(WillPerformWork_1_2) AND (! FIREABLE(WillPerf... (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 3248 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 1500 literals
lola: write sara problem file to PolyORBLF-COL-S04J04T10-ReachabilityFireability-5.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J04T10-ReachabilityFireability-5.sara.
sara: place or transition ordering is non-deterministic
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 284 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(T_1618_3) OR (FIREABLE(T_1618_6) OR (FIREABLE(T_1618_1) OR (FIREABLE(T_1618_8) OR (FIREABLE(T_1618_7) OR (FIREABLE(T_1618_4) OR (FIREABLE(T_1618_10) OR (FIREABLE(T_1618_5) OR (FIREABLE(T_1618_2) OR (FIREABLE(T_1618_9) OR (FIREABLE(SetSigAbort_7) OR (FIREABLE(SetSigAbort_1) OR (FIREABLE(SetSigAbort_4) OR (FIREABLE(SetSigAbort_9) OR (FIREABLE(SetSigAbort_6) OR (FIREABLE(SetSigAbort_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 3248 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 63680 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 7 will run for 316 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(NotifyEventSourceAdded_5) OR (FIREABLE(NotifyEventSourceAdded_8) OR (FIREABLE(NotifyEventSourceAdded_10) OR (FIREABLE(NotifyEventSourceAdded_3) OR (FIREABLE(NotifyEventSourceAdded_7) OR (FIREABLE(NotifyEventSourceAdded_1) OR (FIREABLE(NotifyEventSourceAdded_4) OR (FIREABLE(NotifyEventSourceAdded_9) OR (FIREABLE(NotifyEventSourceAdded_6) OR FIREABLE(NotifyEventSourceAdded_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 3248 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-S04J04T10-ReachabilityFireability-7.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J04T10-ReachabilityFireability-7.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 355 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(GoCheckSource_5) OR (FIREABLE(GoCheckSource_2) OR (FIREABLE(GoCheckSource_3) OR (FIREABLE(GoCheckSource_8) OR (FIREABLE(GoCheckSource_9) OR (FIREABLE(GoCheckSource_6) OR (FIREABLE(GoCheckSource_4) OR (FIREABLE(GoCheckSource_7) OR (FIREABLE(GoCheckSource_10) OR FIREABLE(GoCheckSource_1)))))))))) AND (((FIREABLE(T_1171_3) OR (FIREABLE(T_1171_2) OR (FIREABLE(T_1171_5) OR (FIREABLE(T_11... (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 3248 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 108980 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 406 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(T_2541_5) OR (FIREABLE(T_2541_10) OR (FIREABLE(T_2541_1) OR (FIREABLE(T_2541_9) OR (FIREABLE(T_2541_6) OR (FIREABLE(T_2541_8) OR (FIREABLE(T_2541_7) OR (FIREABLE(T_2541_4) OR (FIREABLE(T_2541_2) OR FIREABLE(T_2541_3)))))))))) AND ((FIREABLE(EnterCSTCS_6) OR (FIREABLE(EnterCSTCS_9) OR (FIREABLE(EnterCSTCS_1) OR (FIREABLE(EnterCSTCS_8) OR (FIREABLE(EnterCSTCS_5) OR (FIREABLE(EnterCSTC... (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 3248 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 3380 literals
lola: write sara problem file to PolyORBLF-COL-S04J04T10-ReachabilityFireability-9.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J04T10-ReachabilityFireability-9.sara.
sara: place or transition ordering is non-deterministic
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 406 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((FIREABLE(IsEvt_1_8) OR (FIREABLE(IsEvt_1_1) OR (FIREABLE(IsEvt_2_5) OR (FIREABLE(IsEvt_3_3) OR (FIREABLE(IsEvt_1_3) OR (FIREABLE(IsEvt_2_4) OR (FIREABLE(IsEvt_4_7) OR (FIREABLE(IsEvt_2_9) OR (FIREABLE(IsEvt_3_6) OR (FIREABLE(IsEvt_3_9) OR (FIREABLE(IsEvt_4_10) OR (FIREABLE(IsEvt_3_8) OR (FIREABLE(IsEvt_2_2) OR (FIREABLE(IsEvt_4_5) OR (FIREABLE(IsEvt_1_5) OR (FIREABLE(IsEvt_4_8) 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 3248 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 1404080 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 488 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(EnterCSPW_1) OR (FIREABLE(EnterCSPW_6) OR (FIREABLE(EnterCSPW_7) OR (FIREABLE(EnterCSPW_2) OR (FIREABLE(EnterCSPW_3) OR (FIREABLE(EnterCSPW_10) OR (FIREABLE(EnterCSPW_5) OR (FIREABLE(EnterCSPW_4) OR (FIREABLE(EnterCSPW_8) 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 3248 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-S04J04T10-ReachabilityFireability-11.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J04T10-ReachabilityFireability-11.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 12 will run for 610 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(T_1126_6_2_4_4_1) AND (! FIREABLE(T_1126_1_1_2_2_2) AND (! FIREABLE(T_1126_6_1_3_2_1) AND (! FIREABLE(T_1126_9_4_2_3_3) AND (! FIREABLE(T_1126_6_4_4_4_4) AND (! FIREABLE(T_1126_3_2_2_3_1) AND (! FIREABLE(T_1126_6_2_4_3_4) AND (! FIREABLE(T_1126_6_3_1_3_1) AND (! FIREABLE(T_1126_2_2_3_2_4) AND (! FIREABLE(T_1126_8_4_2_2_3) AND (! FIREABLE(T_1126_7_4_2_2_2) AND (! FIREABLE(T_1126_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 3248 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 13 will run for 812 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(DummyOR1_2) AND (! FIREABLE(DummyOR1_4) AND (! FIREABLE(DummyOR1_3) AND (! FIREABLE(DummyOR1_6) AND (! FIREABLE(DummyOR1_1) AND (! FIREABLE(DummyOR1_7) AND (! FIREABLE(DummyOR1_8) AND (! FIREABLE(DummyOR1_9) AND (! FIREABLE(DummyOR1_5) AND (! FIREABLE(DummyOR1_10) AND (! FIREABLE(T_1115_4_3_6) AND (! FIREABLE(T_1115_3_4_3) AND (! FIREABLE(T_1115_0_3_10) AND (! FIREABLE(T_1115_0_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 3248 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 34664570 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 813 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(T_1147_10) AND (! FIREABLE(T_1147_5) AND (! FIREABLE(T_1147_6) AND (! FIREABLE(T_1147_9) AND (! FIREABLE(T_1147_7) AND (! FIREABLE(T_1147_1) AND (! FIREABLE(T_1147_8) AND (! FIREABLE(T_1147_3) AND (! FIREABLE(T_1147_2) AND (! FIREABLE(T_1147_4) AND (! FIREABLE(T_2296_5) AND (! FIREABLE(T_2296_10) AND (! FIREABLE(T_2296_2) AND (! FIREABLE(T_2296_7) AND (! FIREABLE(T_2296_4) AND (! 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 3248 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 770526 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 1626 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(T_1146_8) OR (FIREABLE(T_1146_1) OR (FIREABLE(T_1146_7) OR (FIREABLE(T_1146_6) OR (FIREABLE(T_1146_5) OR (FIREABLE(T_1146_10) OR (FIREABLE(T_1146_4) OR (FIREABLE(T_1146_3) OR (FIREABLE(T_1146_2) OR (FIREABLE(T_1146_9) OR ((! FIREABLE(EnterCSIS_1_1) AND (! FIREABLE(EnterCSIS_4_7) AND (! FIREABLE(EnterCSIS_1_3) AND (! FIREABLE(EnterCSIS_2_4) AND (! FIREABLE(EnterCSIS_3_6) AND (! FIREAB... (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 3248 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 70855890 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: no yes yes yes no unknown yes yes yes unknown yes yes no unknown yes
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola: summary: no yes yes yes no unknown yes yes yes unknown yes yes no unknown yes unknown

BK_STOP 1463730609800

--------------------
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-S04J04T10"
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-S04J04T10.tgz
mv PolyORBLF-PT-S04J04T10 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-S04J04T10, 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-146369088900738"
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 ;