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

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

=== Now, execution of the tool begins

BK_START 1463720142323

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityCardinality @ PolyORBLF-PT-S02J06T06
FORMULA PolyORBLF-COL-S02J06T06-ReachabilityCardinality-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T06-ReachabilityCardinality-1 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S02J06T06-ReachabilityCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T06-ReachabilityCardinality-3 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S02J06T06-ReachabilityCardinality-4 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S02J06T06-ReachabilityCardinality-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T06-ReachabilityCardinality-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T06-ReachabilityCardinality-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T06-ReachabilityCardinality-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T06-ReachabilityCardinality-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T06-ReachabilityCardinality-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T06-ReachabilityCardinality-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T06-ReachabilityCardinality-12 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S02J06T06-ReachabilityCardinality-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T06-ReachabilityCardinality-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T06-ReachabilityCardinality-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: 1600/65536 symbol table entries, 7 collisions
lola: preprocessing...
lola: finding significant places
lola: 536 places, 1064 transitions, 486 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1483 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-COL-S02J06T06-ReachabilityCardinality.task
lola: read: EF (cBlockedTasks <= NotifyEventJobQueuedE_1 + NotifyEventJobQueuedE_2 + NotifyEventJobQueuedE_3 + NotifyEventJobQueuedE_6 + NotifyEventJobQueuedE_4 + NotifyEventJobQueuedE_5) : EF (!((!(P_1716 <= Idle_5 + Idle_4 + Idle_3 + Idle_2 + Idle_1 + Idle_6) OR (1 <= cBlockedTasks OR DisablePollingE_6_1 + DisablePollingE_1_2 + DisablePollingE_1_1 + DisablePollingE_2_2 + DisablePollingE_3_2 + DisablePolling... (shortened)
lola: formula length: 8809
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 (cBlockedTasks + -NotifyEventJobQueuedE_6 + -NotifyEventJobQueuedE_5 + -NotifyEventJobQueuedE_4 + -NotifyEventJobQueuedE_3 + -NotifyEventJobQueuedE_2 + -NotifyEventJobQueuedE_1 <= 0)
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 1944 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 1 literals
lola: write sara problem file to PolyORBLF-COL-S02J06T06-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S02J06T06-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((P_1716 + -Idle_6 + -Idle_5 + -Idle_4 + -Idle_3 + -Idle_2 + -Idle_1 <= 0 AND (-cBlockedTasks > -1 AND DisablePollingE_1_1 + DisablePollingE_1_2 + DisablePollingE_2_1 + DisablePollingE_2_2 + -NotifyEventJobCompletedE_6 + -NotifyEventJobCompletedE_5 + -NotifyEventJobCompletedE_4 + -NotifyEventJobCompletedE_3 + -NotifyEventJobCompletedE_2 + -NotifyEventJobCompletedE_1 + DisablePollingE_6_2 + Disa... (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 1944 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 3 literals
lola: write sara problem file to PolyORBLF-COL-S02J06T06-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S02J06T06-ReachabilityCardinality.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 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((-P_2318_6 + -P_2318_5 + -P_2318_4 + -P_2318_3 + -P_2318_2 + -P_2318_1 > -2 OR -JobCnt > -1) AND (-P_1099 > -1 AND -P_1113_6 + DisablePollingE_1_1 + DisablePollingE_1_2 + DisablePollingE_2_1 + DisablePollingE_2_2 + -P_1113_1 + -P_1113_2 + -P_1113_3 + -P_1113_4 + -P_1113_5 + DisablePollingE_6_2 + DisablePollingE_6_1 + DisablePollingE_5_2 + DisablePollingE_5_1 + DisablePollingE_4_2 + DisablePol... (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 1944 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-S02J06T06-ReachabilityCardinality-2.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S02J06T06-ReachabilityCardinality-2.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 3 will run for 253 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-PollingAbort + Abort_Check_Sources_B_6 + Abort_Check_Sources_B_5 + Abort_Check_Sources_B_4 + Abort_Check_Sources_B_3 + Abort_Check_Sources_B_2 + Abort_Check_Sources_B_1 > 0 OR AvailableJobId_0 + AvailableJobId_1 + AvailableJobId_2 + AvailableJobId_3 + AvailableJobId_4 + AvailableJobId_5 + AvailableJobId_6 + -Insert_Source_B_6_2 + -Insert_Source_B_6_1 + -Insert_Source_B_5_2 + -Insert_Source_B... (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 1944 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 2 literals
lola: write sara problem file to PolyORBLF-COL-S02J06T06-ReachabilityCardinality-3.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S02J06T06-ReachabilityCardinality-3.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 4 will run for 253 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((-IsMonitoring > -3 OR -Check_Sources_E_6 + -Check_Sources_E_5 + -Check_Sources_E_4 + -Check_Sources_E_3 + -Check_Sources_E_2 + -Check_Sources_E_1 > -3) AND (-P_1725_6 + -P_1725_5 + -P_1725_4 + -P_1725_3 + -P_1725_2 + -P_1725_1 + -P_1725_0 > -3 OR FetchJobE_6_6 + FetchJobE_6_5 + FetchJobE_6_4 + FetchJobE_6_3 + FetchJobE_6_2 + FetchJobE_6_1 + FetchJobE_6_0 + FetchJobE_5_6 + FetchJobE_5_5 + Fet... (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 1944 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-S02J06T06-ReachabilityCardinality-4.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S02J06T06-ReachabilityCardinality-4.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 5 will run for 253 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (Insert_Source_E_6 + Insert_Source_E_5 + Insert_Source_E_4 + Insert_Source_E_3 + Insert_Source_E_2 + Insert_Source_E_1 + -P_2318_6 + -P_2318_5 + -P_2318_4 + -P_2318_3 + -P_2318_2 + -P_2318_1 <= 0)
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 1944 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 1 literals
lola: write sara problem file to PolyORBLF-COL-S02J06T06-ReachabilityCardinality-5.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S02J06T06-ReachabilityCardinality-5.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 6 will run for 278 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-Insert_Source_B_6_2 + -Insert_Source_B_6_1 + -Insert_Source_B_5_2 + -Insert_Source_B_5_1 + -Insert_Source_B_4_2 + -Insert_Source_B_4_1 + -Insert_Source_B_3_2 + -Insert_Source_B_3_1 + -Insert_Source_B_2_2 + -Insert_Source_B_2_1 + -Insert_Source_B_1_2 + -Insert_Source_B_1_1 <= -3 OR -NotifyEventEndOfCheckSourcesB_6 + -NotifyEventEndOfCheckSourcesB_5 + -NotifyEventEndOfCheckSourcesB_4 + -Notify... (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 1944 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 2 literals
lola: write sara problem file to PolyORBLF-COL-S02J06T06-ReachabilityCardinality-6.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S02J06T06-ReachabilityCardinality-6.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 7 will run for 309 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-P_1727 > -3)
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 1944 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 1 literals
lola: write sara problem file to PolyORBLF-COL-S02J06T06-ReachabilityCardinality-7.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S02J06T06-ReachabilityCardinality-7.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 8 will run for 340 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((SigAbort + -P_1712_6 + -P_1712_5 + -P_1712_4 + -P_1712_3 + -P_1712_2 + -P_1712_1 + -P_1712_0 > 0 AND (-NotifyEventJobQueuedE_6 + -NotifyEventJobQueuedE_5 + -NotifyEventJobQueuedE_4 + -NotifyEventJobQueuedE_3 + -NotifyEventJobQueuedE_2 + -NotifyEventJobQueuedE_1 > -2 AND -ORB_Lock <= -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 1944 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 3 literals
lola: write sara problem file to PolyORBLF-COL-S02J06T06-ReachabilityCardinality-8.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S02J06T06-ReachabilityCardinality-8.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 9 will run for 387 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-P_1113_6 + -P_1113_1 + -P_1113_2 + -P_1113_3 + -P_1113_4 + -P_1113_5 + P_1724_6 + P_1724_5 + P_1724_4 + P_1724_3 + P_1724_2 + P_1724_1 + P_1724_0 > 0 AND (-NotifyEventJobQueuedB_1_6 + -NotifyEventJobQueuedB_1_5 + -NotifyEventJobQueuedB_1_4 + -NotifyEventJobQueuedB_1_3 + -NotifyEventJobQueuedB_1_2 + -NotifyEventJobQueuedB_1_1 + -NotifyEventJobQueuedB_1_0 + -NotifyEventJobQueuedB_6_6 + -Notify... (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 1944 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 6 literals
lola: write sara problem file to PolyORBLF-COL-S02J06T06-ReachabilityCardinality-9.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S02J06T06-ReachabilityCardinality-9.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 452 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (ScheduleTaskE_Idle_6 + -ModifiedSrc_2 + -ModifiedSrc_1 + ScheduleTaskE_Idle_5 + ScheduleTaskE_Idle_4 + ScheduleTaskE_Idle_3 + ScheduleTaskE_Idle_2 + ScheduleTaskE_Idle_1 > 0)
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 1944 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 1 literals
lola: write sara problem file to PolyORBLF-COL-S02J06T06-ReachabilityCardinality-10.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S02J06T06-ReachabilityCardinality-10.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 542 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-EnablePollingE_6 + -EnablePollingE_5 + -EnablePollingE_4 + -EnablePollingE_3 + -EnablePollingE_2 + -EnablePollingE_1 + Idle_6 + Idle_5 + Idle_4 + Idle_3 + Idle_2 + Idle_1 > 0)
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 1944 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 1 literals
lola: write sara problem file to PolyORBLF-COL-S02J06T06-ReachabilityCardinality-11.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S02J06T06-ReachabilityCardinality-11.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 678 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((-Insert_Source_E_6 + -Insert_Source_E_5 + -Insert_Source_E_4 + -Insert_Source_E_3 + -Insert_Source_E_2 + -Insert_Source_E_1 > -3 OR -Insert_Source_E_6 + -Insert_Source_E_5 + -Insert_Source_E_4 + -Insert_Source_E_3 + -Insert_Source_E_2 + -Insert_Source_E_1 <= -2) AND -ORB_Lock <= -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 1944 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-S02J06T06-ReachabilityCardinality-12.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S02J06T06-ReachabilityCardinality-12.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 13 will run for 677 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((DisablePollingB_4_2 + DisablePollingB_2_1 + DisablePollingB_1_2 + DisablePollingB_1_1 + DisablePollingB_2_2 + DisablePollingB_3_1 + DisablePollingB_3_2 + -FetchJobE_6_6 + -FetchJobE_6_5 + -FetchJobE_6_4 + -FetchJobE_6_3 + -FetchJobE_6_2 + -FetchJobE_6_1 + -FetchJobE_6_0 + -FetchJobE_5_6 + -FetchJobE_5_5 + -FetchJobE_5_4 + -FetchJobE_5_3 + -FetchJobE_5_2 + -FetchJobE_5_1 + -FetchJobE_5_0 + -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 1944 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-S02J06T06-ReachabilityCardinality-13.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1016 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((NotifyEventJobCompletedB_6 + NotifyEventJobCompletedB_5 + NotifyEventJobCompletedB_4 + NotifyEventJobCompletedB_3 + NotifyEventJobCompletedB_2 + NotifyEventJobCompletedB_1 + -cIdleTasks <= 0 AND Insert_Source_B_6_2 + Insert_Source_B_6_1 + Insert_Source_B_5_2 + Insert_Source_B_5_1 + Insert_Source_B_4_2 + Insert_Source_B_4_1 + Insert_Source_B_3_2 + Insert_Source_B_3_1 + Insert_Source_B_2_2 + In... (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 1944 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 2 literals
lola: write sara problem file to PolyORBLF-COL-S02J06T06-ReachabilityCardinality-14.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S02J06T06-ReachabilityCardinality-14.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 2033 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((P_1158_6 + P_1158_5 + P_1158_4 + P_1158_3 + P_1158_2 + P_1158_1 + -nyo_6 + -nyo_5 + -nyo_4 + -nyo_3 + -nyo_2 + -nyo_1 <= 0 AND IdleTasks_1 + IdleTasks_2 + IdleTasks_3 + IdleTasks_4 + IdleTasks_5 + IdleTasks_6 + -cSources <= 0) OR (-EnablePollingE_6 + -EnablePollingE_5 + -EnablePollingE_4 + -EnablePollingE_3 + -EnablePollingE_2 + -EnablePollingE_1 + NotifyEventEndOfCheckSourcesB_6 + NotifyEve... (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 1944 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 18 literals
lola: write sara problem file to PolyORBLF-COL-S02J06T06-ReachabilityCardinality-15.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S02J06T06-ReachabilityCardinality-15.sara.
sara: place or transition ordering is non-deterministic
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola: summary: no unknown no unknown unknown no yes yes no yes yes no unknown yes yes unknown

BK_STOP 1463722738941

--------------------
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-S02J06T06"
export BK_EXAMINATION="ReachabilityCardinality"
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-S02J06T06.tgz
mv PolyORBLF-PT-S02J06T06 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-S02J06T06, examination is ReachabilityCardinality"
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-146369088900691"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.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 ;