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

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

=== Now, execution of the tool begins

BK_START 1463737230144

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityFireability @ PolyORBLF-PT-S06J06T04
FORMULA PolyORBLF-COL-S06J06T04-ReachabilityFireability-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J06T04-ReachabilityFireability-1 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S06J06T04-ReachabilityFireability-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J06T04-ReachabilityFireability-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J06T04-ReachabilityFireability-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J06T04-ReachabilityFireability-5 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S06J06T04-ReachabilityFireability-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J06T04-ReachabilityFireability-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J06T04-ReachabilityFireability-8 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S06J06T04-ReachabilityFireability-9 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S06J06T04-ReachabilityFireability-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J06T04-ReachabilityFireability-11 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S06J06T04-ReachabilityFireability-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J06T04-ReachabilityFireability-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J06T04-ReachabilityFireability-14 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S06J06T04-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: 7660/65536 symbol table entries, 4125 collisions
lola: preprocessing...
lola: finding significant places
lola: 506 places, 7154 transitions, 452 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2111 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-COL-S06J06T04-ReachabilityFireability.task
lola: read: AG ((((((((FIREABLE(LeaveCSTCS_1) OR FIREABLE(LeaveCSTCS_4)) OR FIREABLE(LeaveCSTCS_3)) OR FIREABLE(LeaveCSTCS_2)) AND (((FIREABLE(DummyIS_3) OR FIREABLE(DummyIS_2)) OR FIREABLE(DummyIS_4)) OR FIREABLE(DummyIS_1))) OR !((((((((((((((((((((((((((((FIREABLE(T_1713_4_1) OR FIREABLE(T_1713_6_2)) OR FIREABLE(T_1713_2_4)) OR FIREABLE(T_1713_6_3)) OR FIREABLE(T_1713_5_1)) OR FIREABLE(T_1713_1_4)) OR FIRE... (shortened)
lola: formula length: 25030
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(LeaveCSTCS_1) OR (FIREABLE(LeaveCSTCS_4) OR (FIREABLE(LeaveCSTCS_3) OR FIREABLE(LeaveCSTCS_2)))) AND (FIREABLE(DummyIS_3) OR (FIREABLE(DummyIS_2) OR (FIREABLE(DummyIS_4) OR FIREABLE(DummyIS_1))))) OR ((! FIREABLE(T_1713_4_1) AND (! FIREABLE(T_1713_6_2) AND (! FIREABLE(T_1713_2_4) AND (! FIREABLE(T_1713_6_3) AND (! FIREABLE(T_1713_5_1) AND (! FIREABLE(T_1713_1_4) AND (! FIREABLE(T_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 1808 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 475125988766132777118128968564736 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(DummyIS_3) OR (FIREABLE(DummyIS_2) OR (FIREABLE(DummyIS_4) OR FIREABLE(DummyIS_1)))) AND (FIREABLE(T_2577_1_2) OR (FIREABLE(T_2577_3_4) OR (FIREABLE(T_2577_2_4) OR (FIREABLE(T_2577_6_2) OR (FIREABLE(T_2577_5_2) OR (FIREABLE(T_2577_4_1) OR (FIREABLE(T_2577_3_2) OR (FIREABLE(T_2577_3_1) OR (FIREABLE(T_2577_4_2) OR (FIREABLE(T_2577_5_3) OR (FIREABLE(T_2577_2_1) OR (FIREABLE(T_2577_6_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 1808 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 384 literals
lola: write sara problem file to PolyORBLF-COL-S06J06T04-ReachabilityFireability.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J06T04-ReachabilityFireability.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 2 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((! FIREABLE(EnterCSPW_4) AND (! FIREABLE(EnterCSPW_3) AND (! FIREABLE(EnterCSPW_2) AND (! FIREABLE(EnterCSPW_1) AND (! FIREABLE(LeaveCSPW_2) AND (! FIREABLE(LeaveCSPW_3) AND (! FIREABLE(LeaveCSPW_1) AND ! FIREABLE(LeaveCSPW_4)))))))))
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 1808 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 12 literals
lola: write sara problem file to PolyORBLF-COL-S06J06T04-ReachabilityFireability-2.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J06T04-ReachabilityFireability-2.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(T_1096_1) OR (FIREABLE(T_1096_4) OR (FIREABLE(T_1096_3) OR FIREABLE(T_1096_2)))))
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 1808 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 8 literals
lola: write sara problem file to PolyORBLF-COL-S06J06T04-ReachabilityFireability-3.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J06T04-ReachabilityFireability-3.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((((FIREABLE(T_1114_3) OR (FIREABLE(T_1114_1) OR (FIREABLE(T_1114_4) OR (FIREABLE(T_1114_2) OR (FIREABLE(T_1124_2_4_2) OR (FIREABLE(T_1124_2_6_2) OR (FIREABLE(T_1124_4_2_4) OR (FIREABLE(T_1124_1_4_3) OR (FIREABLE(T_1124_1_3_2) OR (FIREABLE(T_1124_1_3_1) OR (FIREABLE(T_1124_4_1_3) OR (FIREABLE(T_1124_3_1_4) OR (FIREABLE(T_1124_3_6_2) OR (FIREABLE(T_1124_4_6_1) OR (FIREABLE(T_1124_4_3_3) OR (FIR... (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 1808 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 13828721003480 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(T_2285_1_4) AND (! FIREABLE(T_2285_2_3) AND (! FIREABLE(T_2285_3_1) AND (! FIREABLE(T_2285_4_3) AND (! FIREABLE(T_2285_2_1) AND (! FIREABLE(T_2285_4_1) AND (! FIREABLE(T_2285_3_3) AND (! FIREABLE(T_2285_1_2) AND (! FIREABLE(T_2285_2_2) AND (! FIREABLE(T_2285_3_2) AND (! FIREABLE(T_2285_4_4) AND (! FIREABLE(T_2285_3_4) AND (! FIREABLE(T_2285_4_2) AND (! FIREABLE(T_2285_1_1) 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 1808 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 7995310 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 300 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(T_1114_3) OR (FIREABLE(T_1114_1) OR (FIREABLE(T_1114_4) OR FIREABLE(T_1114_2)))))
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 1808 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 4 literals
lola: write sara problem file to PolyORBLF-COL-S06J06T04-ReachabilityFireability-6.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 7 will run for 333 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(LeaveIdle_3_3) OR (FIREABLE(LeaveIdle_1_1) OR (FIREABLE(LeaveIdle_2_2) OR (FIREABLE(LeaveIdle_4_4) OR (FIREABLE(T_0376_6_6) OR (FIREABLE(T_0376_1_1) OR (FIREABLE(T_0376_3_3) OR (FIREABLE(T_0376_2_2) OR (FIREABLE(T_0376_5_5) OR FIREABLE(T_0376_4_4)))))))))) AND (FIREABLE(LeaveCSTCS_1) OR (FIREABLE(LeaveCSTCS_4) OR (FIREABLE(LeaveCSTCS_3) OR FIREABLE(LeaveCSTCS_2))))))
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 1808 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 184 literals
lola: write sara problem file to PolyORBLF-COL-S06J06T04-ReachabilityFireability-7.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J06T04-ReachabilityFireability-7.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 375 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(GoIdle_1) OR (FIREABLE(GoIdle_3) OR (FIREABLE(GoIdle_2) OR FIREABLE(GoIdle_4)))) AND ((FIREABLE(GoCheckSource_4) OR (FIREABLE(GoCheckSource_2) OR (FIREABLE(GoCheckSource_3) OR FIREABLE(GoCheckSource_1)))) AND (FIREABLE(T_1618_1) OR (FIREABLE(T_1618_4) OR (FIREABLE(T_1618_2) OR FIREABLE(T_1618_3)))))))
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 1808 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 284 literals
lola: write sara problem file to PolyORBLF-COL-S06J06T04-ReachabilityFireability-8.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J06T04-ReachabilityFireability-8.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 9 will run for 375 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(NOPEP_1) OR (FIREABLE(NOPEP_2) OR (FIREABLE(NOPEP_3) OR FIREABLE(NOPEP_4)))) AND (! FIREABLE(T_0376_6_6) AND (! FIREABLE(T_0376_1_1) AND (! FIREABLE(T_0376_3_3) AND (! FIREABLE(T_0376_2_2) AND (! FIREABLE(T_0376_5_5) AND (! FIREABLE(T_0376_4_4) AND ((FIREABLE(NoMonitoring_1) OR (FIREABLE(NoMonitoring_3) OR (FIREABLE(NoMonitoring_2) OR FIREABLE(NoMonitoring_4)))) AND ((FIREABLE(Notif... (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 1808 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 16034552 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 10 will run for 375 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(LeaveCSTCS_1) OR (FIREABLE(LeaveCSTCS_4) OR (FIREABLE(LeaveCSTCS_3) OR FIREABLE(LeaveCSTCS_2)))))
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 1808 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 4 literals
lola: write sara problem file to PolyORBLF-COL-S06J06T04-ReachabilityFireability-10.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J06T04-ReachabilityFireability-10.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 450 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(WaitforBlockedTasks_2_3) AND (! FIREABLE(WaitforBlockedTasks_6_1) AND (! FIREABLE(WaitforBlockedTasks_4_3) AND (! FIREABLE(WaitforBlockedTasks_1_1) AND (! FIREABLE(WaitforBlockedTasks_3_3) AND (! FIREABLE(WaitforBlockedTasks_2_2) AND (! FIREABLE(WaitforBlockedTasks_4_4) AND (! FIREABLE(WaitforBlockedTasks_5_4) AND (! FIREABLE(WaitforBlockedTasks_3_2) AND (! FIREABLE(WaitforBlocked... (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 1808 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 37708411319103277788695978049536 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 12 will run for 450 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(T_1618_1) AND (! FIREABLE(T_1618_4) AND (! FIREABLE(T_1618_2) AND (! FIREABLE(T_1618_3) AND (! FIREABLE(Run_3) AND (! FIREABLE(Run_2) AND (! FIREABLE(Run_1) AND (! FIREABLE(Run_4) AND (! FIREABLE(SetSigAbort_3) AND (! FIREABLE(SetSigAbort_4) AND (! FIREABLE(SetSigAbort_1) AND ! FIREABLE(SetSigAbort_2)))))))))))) OR (FIREABLE(T_1171_2) OR (FIREABLE(T_1171_1) OR (FIREABLE(T_1171_3) ... (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 1808 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 68 literals
lola: write sara problem file to PolyORBLF-COL-S06J06T04-ReachabilityFireability-12.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J06T04-ReachabilityFireability-12.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 13 will run for 601 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(T_1094_2) OR (FIREABLE(T_1094_1) OR (FIREABLE(T_1094_3) OR FIREABLE(T_1094_4)))) AND (! FIREABLE(EnterCSTCS_3) AND (! FIREABLE(EnterCSTCS_2) AND (! FIREABLE(EnterCSTCS_1) AND (! FIREABLE(EnterCSTCS_4) AND (! FIREABLE(T_1170_4) AND (! FIREABLE(T_1170_3) AND (! FIREABLE(T_1170_2) AND (! FIREABLE(T_1170_1) AND (((FIREABLE(T_1147_3) OR (FIREABLE(T_1147_2) OR (FIREABLE(T_1147_4) OR FIREA... (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 1808 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 1099511725560 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 901 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(NoCheck_3) OR (FIREABLE(NoCheck_4) OR (FIREABLE(NoCheck_1) OR (FIREABLE(NoCheck_2) OR (FIREABLE(IsEvt_6_3) OR (FIREABLE(IsEvt_1_2) OR (FIREABLE(IsEvt_3_4) OR (FIREABLE(IsEvt_5_2) OR (FIREABLE(IsEvt_2_2) OR (FIREABLE(IsEvt_1_4) OR (FIREABLE(IsEvt_4_2) OR (FIREABLE(IsEvt_1_1) OR (FIREABLE(IsEvt_3_2) OR (FIREABLE(IsEvt_2_1) OR (FIREABLE(IsEvt_3_1) OR (FIREABLE(IsEvt_4_3) OR (FIREABLE(Is... (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 1808 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 235779661437055424 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 901 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(LeaveCSPW_2) OR (FIREABLE(LeaveCSPW_3) OR (FIREABLE(LeaveCSPW_1) OR FIREABLE(LeaveCSPW_4)))))
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 1808 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 4 literals
lola: write sara problem file to PolyORBLF-COL-S06J06T04-ReachabilityFireability-15.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J06T04-ReachabilityFireability-15.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: RESULT
lola: summary: no unknown no yes yes unknown yes yes unknown unknown yes unknown no yes unknown yes

BK_STOP 1463739869853

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