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

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

=== Now, execution of the tool begins

BK_START 1463726730710

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityCardinality @ PolyORBLF-PT-S04J04T10
FORMULA PolyORBLF-COL-S04J04T10-ReachabilityCardinality-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J04T10-ReachabilityCardinality-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J04T10-ReachabilityCardinality-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J04T10-ReachabilityCardinality-3 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S04J04T10-ReachabilityCardinality-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J04T10-ReachabilityCardinality-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J04T10-ReachabilityCardinality-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J04T10-ReachabilityCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J04T10-ReachabilityCardinality-8 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S04J04T10-ReachabilityCardinality-9 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S04J04T10-ReachabilityCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J04T10-ReachabilityCardinality-11 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S04J04T10-ReachabilityCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J04T10-ReachabilityCardinality-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J04T10-ReachabilityCardinality-14 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S04J04T10-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: 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-ReachabilityCardinality.task
lola: read: EF (((P_2321_9 + P_2321_7 + P_2321_6 + P_2321_5 + P_2321_4 + P_2321_3 + P_2321_10 + P_2321_2 + P_2321_8 + P_2321_1 <= FetchJobB_1 + FetchJobB_9 + FetchJobB_2 + FetchJobB_8 + FetchJobB_7 + FetchJobB_3 + FetchJobB_4 + FetchJobB_5 + FetchJobB_6 + FetchJobB_10 AND (NoSigAbort <= cIsMonitoring AND 3 <= P_1617_8 + P_1617_7 + P_1617_9 + P_1617_10 + P_1617_1 + P_1617_4 + P_1617_2 + P_1617_3 + P_1617_6 + P... (shortened)
lola: formula length: 16458
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 (((P_2321_1 + P_2321_2 + P_2321_3 + P_2321_4 + P_2321_5 + P_2321_6 + P_2321_7 + P_2321_8 + P_2321_9 + -FetchJobB_9 + -FetchJobB_8 + -FetchJobB_7 + -FetchJobB_6 + -FetchJobB_5 + -FetchJobB_4 + -FetchJobB_3 + -FetchJobB_2 + -FetchJobB_1 + P_2321_10 + -FetchJobB_10 <= 0 AND (-cIsMonitoring + NoSigAbort <= 0 AND -P_1617_10 + -P_1617_9 + -P_1617_8 + -P_1617_7 + -P_1617_6 + -P_1617_5 + -P_1617_4 + -P... (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 5 literals
lola: write sara problem file to PolyORBLF-COL-S04J04T10-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J04T10-ReachabilityCardinality.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 ((P_1716 + -RunB_9 + -RunB_8 + -RunB_7 + -RunB_6 + -RunB_5 + -RunB_4 + -RunB_3 + -RunB_2 + -RunB_1 + -RunB_10 <= 0 AND ((-NotifyEventSourceAddedE_10 + -NotifyEventSourceAddedE_9 + -NotifyEventSourceAddedE_8 + -NotifyEventSourceAddedE_7 + -NotifyEventSourceAddedE_6 + -NotifyEventSourceAddedE_5 + -NotifyEventSourceAddedE_4 + -NotifyEventSourceAddedE_3 + -NotifyEventSourceAddedE_2 + -NotifyEventSo... (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 6 literals
lola: write sara problem file to PolyORBLF-COL-S04J04T10-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J04T10-ReachabilityCardinality.sara.
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 (-DisablePollingE_1_1 + -DisablePollingE_1_2 + -DisablePollingE_1_3 + -DisablePollingE_1_4 + -DisablePollingE_2_1 + -DisablePollingE_2_2 + -DisablePollingE_2_3 + -DisablePollingE_2_4 + -DisablePollingE_9_4 + -DisablePollingE_9_3 + -DisablePollingE_9_2 + -DisablePollingE_9_1 + RunB_9 + RunB_8 + RunB_7 + RunB_6 + RunB_5 + RunB_4 + RunB_3 + RunB_2 + RunB_1 + -DisablePollingE_8_4 + -DisablePollingE... (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 1 literals
lola: write sara problem file to PolyORBLF-COL-S04J04T10-ReachabilityCardinality-2.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J04T10-ReachabilityCardinality-2.sara.
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: EF (-NotifyEventSourceAddedE_10 + -NotifyEventSourceAddedE_9 + -NotifyEventSourceAddedE_8 + -NotifyEventSourceAddedE_7 + -NotifyEventSourceAddedE_6 + -NotifyEventSourceAddedE_5 + -NotifyEventSourceAddedE_4 + -NotifyEventSourceAddedE_3 + -NotifyEventSourceAddedE_2 + -NotifyEventSourceAddedE_1 <= -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 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 1 literals
lola: write sara problem file to PolyORBLF-COL-S04J04T10-ReachabilityCardinality-3.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J04T10-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 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-Try_Check_Sources_E_10 + -Try_Check_Sources_E_9 + -Try_Check_Sources_E_8 + -Try_Check_Sources_E_7 + -Try_Check_Sources_E_6 + -Try_Check_Sources_E_5 + -Try_Check_Sources_E_4 + -Try_Check_Sources_E_3 + -Try_Check_Sources_E_2 + -Try_Check_Sources_E_1 <= -2 OR -EnablePollingB_9 + -EnablePollingB_8 + -EnablePollingB_7 + -EnablePollingB_6 + -EnablePollingB_5 + -EnablePollingB_4 + -EnablePollingB_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 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 2 literals
lola: write sara problem file to PolyORBLF-COL-S04J04T10-ReachabilityCardinality-4.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J04T10-ReachabilityCardinality-4.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 5 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((P_2318_10 + -Insert_Source_B_7_1 + -Insert_Source_B_7_2 + -Insert_Source_B_7_3 + -Insert_Source_B_7_4 + -Insert_Source_B_6_4 + -Insert_Source_B_6_3 + -Insert_Source_B_6_2 + -Insert_Source_B_6_1 + -Insert_Source_B_8_1 + -Insert_Source_B_8_2 + -Insert_Source_B_8_3 + -Insert_Source_B_8_4 + -Insert_Source_B_5_4 + -Insert_Source_B_5_3 + -Insert_Source_B_5_2 + -Insert_Source_B_5_1 + -Insert_Source_... (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 2 literals
lola: write sara problem file to PolyORBLF-COL-S04J04T10-ReachabilityCardinality-5.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J04T10-ReachabilityCardinality-5.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 6 will run for 326 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((EnablePollingE_10 + EnablePollingE_9 + EnablePollingE_8 + EnablePollingE_7 + EnablePollingE_6 + EnablePollingE_5 + EnablePollingE_4 + EnablePollingE_3 + EnablePollingE_2 + EnablePollingE_1 + -Idle_10 + -Idle_9 + -Idle_8 + -Idle_7 + -Idle_6 + -Idle_5 + -Idle_4 + -Idle_3 + -Idle_2 + -Idle_1 <= 0 OR P_1093 + -cBlockedTasks <= 0) AND (-DataOnSrc_1 + -DataOnSrc_2 + -DataOnSrc_3 + -DataOnSrc_4 + N... (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 5 literals
lola: write sara problem file to PolyORBLF-COL-S04J04T10-ReachabilityCardinality-6.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J04T10-ReachabilityCardinality-6.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 7 will run for 363 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-Insert_Source_B_7_1 + -Insert_Source_B_7_2 + -Insert_Source_B_7_3 + -Insert_Source_B_7_4 + -Insert_Source_B_6_4 + -Insert_Source_B_6_3 + -Insert_Source_B_6_2 + -Insert_Source_B_6_1 + -Insert_Source_B_8_1 + -Insert_Source_B_8_2 + -Insert_Source_B_8_3 + -Insert_Source_B_8_4 + -Insert_Source_B_5_4 + -Insert_Source_B_5_3 + -Insert_Source_B_5_2 + -Insert_Source_B_5_1 + P_1158_10 + -Insert_Source_... (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 2 literals
lola: write sara problem file to PolyORBLF-COL-S04J04T10-ReachabilityCardinality-7.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J04T10-ReachabilityCardinality-7.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 8 will run for 408 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-NotifyEventJobQueuedB_1_4 + -NotifyEventJobQueuedB_1_3 + -NotifyEventJobQueuedB_1_2 + -NotifyEventJobQueuedB_1_1 + -NotifyEventJobQueuedB_1_0 + -NotifyEventJobQueuedB_9_4 + -NotifyEventJobQueuedB_9_3 + -NotifyEventJobQueuedB_9_2 + -NotifyEventJobQueuedB_9_1 + -NotifyEventJobQueuedB_9_0 + -NotifyEventJobQueuedB_8_4 + -NotifyEventJobQueuedB_8_3 + -NotifyEventJobQueuedB_8_2 + -NotifyEventJobQue... (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 6 literals
lola: write sara problem file to PolyORBLF-COL-S04J04T10-ReachabilityCardinality-8.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J04T10-ReachabilityCardinality-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 408 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-NotifyEventSourceAddedE_10 + -NotifyEventSourceAddedE_9 + -NotifyEventSourceAddedE_8 + -NotifyEventSourceAddedE_7 + -NotifyEventSourceAddedE_6 + -NotifyEventSourceAddedE_5 + -NotifyEventSourceAddedE_4 + -NotifyEventSourceAddedE_3 + -NotifyEventSourceAddedE_2 + -NotifyEventSourceAddedE_1 <= -3 AND (SigAbort + -NotifyEventJobQueuedE_10 + -NotifyEventJobQueuedE_9 + -NotifyEventJobQueuedE_8 + -N... (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 4 literals
lola: write sara problem file to PolyORBLF-COL-S04J04T10-ReachabilityCardinality-9.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J04T10-ReachabilityCardinality-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 408 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-cPollingAbort <= -1)
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 1 literals
lola: write sara problem file to PolyORBLF-COL-S04J04T10-ReachabilityCardinality-10.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J04T10-ReachabilityCardinality-10.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 490 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-NotifyEventEndOfCheckSourcesB_10 + -NotifyEventEndOfCheckSourcesB_9 + -NotifyEventEndOfCheckSourcesB_8 + -NotifyEventEndOfCheckSourcesB_7 + -NotifyEventEndOfCheckSourcesB_6 + -NotifyEventEndOfCheckSourcesB_5 + -NotifyEventEndOfCheckSourcesB_4 + -NotifyEventEndOfCheckSourcesB_3 + -NotifyEventEndOfCheckSourcesB_2 + -NotifyEventEndOfCheckSourcesB_1 <= -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 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 1 literals
lola: write sara problem file to PolyORBLF-COL-S04J04T10-ReachabilityCardinality-11.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J04T10-ReachabilityCardinality-11.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 12 will run for 490 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-P_1119_9_4 + -P_1119_9_3 + -P_1119_9_2 + -P_1119_9_1 + -P_1119_8_4 + -P_1119_8_3 + -P_1119_8_2 + -P_1119_8_1 + -P_1119_7_4 + -P_1119_7_3 + -P_1119_7_2 + -P_1119_7_1 + -P_1119_6_4 + -P_1119_6_3 + -P_1119_6_2 + -P_1119_6_1 + -P_1119_5_4 + -P_1119_5_3 + -P_1119_5_2 + -P_1119_5_1 + Abort_Check_Sources_E_9 + Abort_Check_Sources_E_8 + Abort_Check_Sources_E_7 + Abort_Check_Sources_E_6 + Abort_Check_... (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 1 literals
lola: write sara problem file to PolyORBLF-COL-S04J04T10-ReachabilityCardinality-12.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J04T10-ReachabilityCardinality-12.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 13 will run for 653 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-QueueJobB_9_4 + -QueueJobB_9_3 + -QueueJobB_9_2 + -QueueJobB_9_1 + -QueueJobB_9_0 + -QueueJobB_8_4 + -QueueJobB_8_3 + -QueueJobB_8_2 + -QueueJobB_8_1 + -QueueJobB_8_0 + -QueueJobB_7_4 + -QueueJobB_7_3 + -QueueJobB_7_2 + -QueueJobB_7_1 + -QueueJobB_7_0 + -QueueJobB_10_4 + -QueueJobB_10_3 + -QueueJobB_10_2 + -QueueJobB_10_1 + -QueueJobB_10_0 + -QueueJobB_6_4 + -QueueJobB_6_3 + -QueueJobB_6_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 1 literals
lola: write sara problem file to PolyORBLF-COL-S04J04T10-ReachabilityCardinality-13.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J04T10-ReachabilityCardinality-13.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 980 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-DisablePollingB_10_4 + -DisablePollingB_10_3 + -DisablePollingB_10_2 + -DisablePollingB_10_1 + FetchJobB_9 + -DisablePollingB_2_4 + -DisablePollingB_2_3 + -DisablePollingB_2_2 + -DisablePollingB_2_1 + FetchJobB_8 + FetchJobB_7 + FetchJobB_6 + FetchJobB_5 + FetchJobB_4 + FetchJobB_3 + FetchJobB_2 + FetchJobB_1 + -DisablePollingB_3_1 + -DisablePollingB_3_2 + -DisablePollingB_3_3 + -DisablePoll... (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 3 literals
lola: write sara problem file to PolyORBLF-COL-S04J04T10-ReachabilityCardinality-14.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J04T10-ReachabilityCardinality-14.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 15 will run for 980 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-MarkerWrite <= -2 AND (-FetchJobB_9 + -FetchJobB_8 + -FetchJobB_7 + -FetchJobB_6 + -FetchJobB_5 + -FetchJobB_4 + -FetchJobB_3 + -FetchJobB_2 + -FetchJobB_1 + -FetchJobB_10 > -1 AND (-P_1099 <= -3 AND (-DisablePollingB_10_4 + -DisablePollingB_10_3 + -DisablePollingB_10_2 + -DisablePollingB_10_1 + BlockedTasks + -DisablePollingB_2_4 + -DisablePollingB_2_3 + -DisablePollingB_2_2 + -DisablePolli... (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 8 literals
lola: write sara problem file to PolyORBLF-COL-S04J04T10-ReachabilityCardinality-15.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J04T10-ReachabilityCardinality-15.sara.
sara: place or transition ordering is non-deterministic
lola: local time limit reached - aborting
lola: time limit reached - aborting
lola: preliminary result: yes yes yes unknown yes no no no unknown unknown no unknown no yes unknown
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola: summary: yes yes yes unknown yes no no no unknown unknown no unknown no yes unknown unknown

BK_STOP 1463730271604

--------------------
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="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-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 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-146369088900736"
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 ;