Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
..............
=====================================================================
Generated by BenchKit 2-2979
Executing tool lola
Input is PolyORBLF-PT-S02J04T10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086kn-ebro-146369088900682
=====================================================================

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBLF-COL-S02J04T10-ReachabilityCardinality-0
FORMULA_NAME PolyORBLF-COL-S02J04T10-ReachabilityCardinality-1
FORMULA_NAME PolyORBLF-COL-S02J04T10-ReachabilityCardinality-10
FORMULA_NAME PolyORBLF-COL-S02J04T10-ReachabilityCardinality-11
FORMULA_NAME PolyORBLF-COL-S02J04T10-ReachabilityCardinality-12
FORMULA_NAME PolyORBLF-COL-S02J04T10-ReachabilityCardinality-13
FORMULA_NAME PolyORBLF-COL-S02J04T10-ReachabilityCardinality-14
FORMULA_NAME PolyORBLF-COL-S02J04T10-ReachabilityCardinality-15
FORMULA_NAME PolyORBLF-COL-S02J04T10-ReachabilityCardinality-2
FORMULA_NAME PolyORBLF-COL-S02J04T10-ReachabilityCardinality-3
FORMULA_NAME PolyORBLF-COL-S02J04T10-ReachabilityCardinality-4
FORMULA_NAME PolyORBLF-COL-S02J04T10-ReachabilityCardinality-5
FORMULA_NAME PolyORBLF-COL-S02J04T10-ReachabilityCardinality-6
FORMULA_NAME PolyORBLF-COL-S02J04T10-ReachabilityCardinality-7
FORMULA_NAME PolyORBLF-COL-S02J04T10-ReachabilityCardinality-8
FORMULA_NAME PolyORBLF-COL-S02J04T10-ReachabilityCardinality-9

=== Now, execution of the tool begins

BK_START 1463718992891

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityCardinality @ PolyORBLF-PT-S02J04T10
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityCardinality-0 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityCardinality-1 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityCardinality-2 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityCardinality-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityCardinality-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityCardinality-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityCardinality-7 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityCardinality-8 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityCardinality-9 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityCardinality-10 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityCardinality-11 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityCardinality-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityCardinality-14 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S02J04T10-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: 2324/65536 symbol table entries, 18 collisions
lola: preprocessing...
lola: finding significant places
lola: 752 places, 1572 transitions, 698 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2143 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-COL-S02J04T10-ReachabilityCardinality.task
lola: read: EF (3 <= NotifyEventSourceAddedB_6 + NotifyEventSourceAddedB_8 + NotifyEventSourceAddedB_7 + NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_10 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_4 + NotifyEventSourceAddedB_9 + NotifyEventSourceAddedB_5) : AG (P_1159_7 + P_1159_1 + P_1159_8 + P_1159_9 + P_1159_3 + P_1159_4 + P_1159_2 + P_1159_10 + P_1159_5 + P_115... (shortened)
lola: formula length: 10716
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 (-NotifyEventSourceAddedB_10 + -NotifyEventSourceAddedB_9 + -NotifyEventSourceAddedB_8 + -NotifyEventSourceAddedB_7 + -NotifyEventSourceAddedB_6 + -NotifyEventSourceAddedB_5 + -NotifyEventSourceAddedB_4 + -NotifyEventSourceAddedB_3 + -NotifyEventSourceAddedB_2 + -NotifyEventSourceAddedB_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 2792 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 1 literals
lola: write sara problem file to PolyORBLF-COL-S02J04T10-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S02J04T10-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 1 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (P_1159_9 + P_1159_8 + P_1159_7 + P_1159_6 + P_1159_5 + P_1159_4 + P_1159_3 + P_1159_2 + P_1159_1 + P_1159_10 + -P_1712_4 + -P_1712_3 + -P_1712_2 + -P_1712_1 + -P_1712_0 <= 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 2792 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 1 literals
lola: write sara problem file to PolyORBLF-COL-S02J04T10-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S02J04T10-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 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((-nyo_9 + -nyo_8 + -nyo_7 + -nyo_6 + -nyo_5 + -nyo_4 + -nyo_3 + -nyo_2 + -nyo_1 + -nyo_10 <= -3 OR -ScheduleTaskE_Check_10 + AwakeTasks_10 + -ScheduleTaskE_Check_9 + -ScheduleTaskE_Check_8 + -ScheduleTaskE_Check_7 + -ScheduleTaskE_Check_6 + -ScheduleTaskE_Check_5 + -ScheduleTaskE_Check_4 + -ScheduleTaskE_Check_3 + -ScheduleTaskE_Check_2 + -ScheduleTaskE_Check_1 + AwakeTasks_9 + AwakeTasks_8 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2792 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 8 literals
lola: write sara problem file to PolyORBLF-COL-S02J04T10-ReachabilityCardinality-2.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S02J04T10-ReachabilityCardinality-2.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 3 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-P_1097 <= -1 OR -Insert_Source_E_9 + -Insert_Source_E_8 + -Insert_Source_E_7 + -Insert_Source_E_6 + -Insert_Source_E_5 + -Insert_Source_E_4 + -Insert_Source_E_3 + -Insert_Source_E_2 + -Insert_Source_E_1 + -Insert_Source_E_10 + MarkerRead <= 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 2792 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 2 literals
lola: write sara problem file to PolyORBLF-COL-S02J04T10-ReachabilityCardinality-3.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 4 will run for 239 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (IdleTasks_10 + IdleTasks_1 + IdleTasks_2 + IdleTasks_3 + IdleTasks_4 + IdleTasks_5 + IdleTasks_6 + IdleTasks_7 + IdleTasks_8 + IdleTasks_9 + -AwakeTasks_10 + -AwakeTasks_9 + -AwakeTasks_8 + -AwakeTasks_7 + -AwakeTasks_6 + -AwakeTasks_5 + -AwakeTasks_4 + -AwakeTasks_3 + -AwakeTasks_2 + -AwakeTasks_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 2792 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 1 literals
lola: write sara problem file to PolyORBLF-COL-S02J04T10-ReachabilityCardinality-4.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S02J04T10-ReachabilityCardinality-4.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 5 will run for 261 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (DataOnSrc_1 + DataOnSrc_2 + -Idle_10 + -Idle_9 + -Idle_8 + -Idle_7 + -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 2792 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 1 literals
lola: write sara problem file to PolyORBLF-COL-S02J04T10-ReachabilityCardinality-5.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S02J04T10-ReachabilityCardinality-5.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 6 will run for 287 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-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 invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2792 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 4 literals
lola: write sara problem file to PolyORBLF-COL-S02J04T10-ReachabilityCardinality-6.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S02J04T10-ReachabilityCardinality-6.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 7 will run for 319 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-PlaceSources_2 + -PlaceSources_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 2792 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 1 literals
lola: write sara problem file to PolyORBLF-COL-S02J04T10-ReachabilityCardinality-7.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S02J04T10-ReachabilityCardinality-7.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 8 will run for 319 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 + -P_2321_10 <= -2 AND (-BlockedTasks + NotifyEventSourceAddedB_10 + NotifyEventSourceAddedB_9 + NotifyEventSourceAddedB_8 + NotifyEventSourceAddedB_7 + NotifyEventSourceAddedB_6 + NotifyEventSourceAddedB_5 + NotifyEventSourceAddedB_4 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2792 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 5 literals
lola: write sara problem file to PolyORBLF-COL-S02J04T10-ReachabilityCardinality-8.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S02J04T10-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 319 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((-NotifyEventEndOfCheckSourcesB_10 + -NotifyEventEndOfCheckSourcesB_9 + -NotifyEventEndOfCheckSourcesB_8 + -NotifyEventEndOfCheckSourcesB_7 + -NotifyEventEndOfCheckSourcesB_6 + -NotifyEventEndOfCheckSourcesB_5 + -NotifyEventEndOfCheckSourcesB_4 + -NotifyEventEndOfCheckSourcesB_3 + -NotifyEventEndOfCheckSourcesB_2 + -NotifyEventEndOfCheckSourcesB_1 > -2 AND -QueueJobE_9 + -QueueJobE_8 + -Queue... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2792 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 6 literals
lola: write sara problem file to PolyORBLF-COL-S02J04T10-ReachabilityCardinality-9.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S02J04T10-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 319 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-cPollingAbort <= -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 2792 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 1 literals
lola: write sara problem file to PolyORBLF-COL-S02J04T10-ReachabilityCardinality-10.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S02J04T10-ReachabilityCardinality-10.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 11 will run for 319 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-IsMonitoring + nyo_9 + nyo_8 + nyo_7 + nyo_6 + nyo_5 + nyo_4 + nyo_3 + nyo_2 + nyo_1 + nyo_10 <= 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 2792 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 1 literals
lola: write sara problem file to PolyORBLF-COL-S02J04T10-ReachabilityCardinality-11.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S02J04T10-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 319 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 <= -2 OR (-ORB_Lock + 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_C... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2792 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 6 literals
lola: write sara problem file to PolyORBLF-COL-S02J04T10-ReachabilityCardinality-12.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S02J04T10-ReachabilityCardinality-12.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 13 will run for 426 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((-TryAllocateOneTaskB_10 + -TryAllocateOneTaskB_9 + -TryAllocateOneTaskB_8 + -TryAllocateOneTaskB_7 + -TryAllocateOneTaskB_6 + -TryAllocateOneTaskB_5 + -TryAllocateOneTaskB_4 + -TryAllocateOneTaskB_3 + -TryAllocateOneTaskB_2 + -TryAllocateOneTaskB_1 <= -1 AND (-RunE_10 + -RunE_9 + -RunE_8 + -RunE_7 + -RunE_6 + -RunE_5 + -RunE_4 + -RunE_3 + -RunE_2 + -RunE_1 + Idle_10 + Idle_9 + Idle_8 + Idle_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2792 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 6 literals
lola: write sara problem file to PolyORBLF-COL-S02J04T10-ReachabilityCardinality-13.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S02J04T10-ReachabilityCardinality-13.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 14 will run for 639 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((ScheduleTaskB_10 + ScheduleTaskB_9 + ScheduleTaskB_8 + ScheduleTaskB_7 + ScheduleTaskB_6 + ScheduleTaskB_5 + ScheduleTaskB_4 + ScheduleTaskB_3 + ScheduleTaskB_2 + ScheduleTaskB_1 + -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_So... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2792 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 19 literals
lola: write sara problem file to PolyORBLF-COL-S02J04T10-ReachabilityCardinality-14.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S02J04T10-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 640 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-P_1159_9 + -P_1159_8 + -P_1159_7 + -P_1159_6 + -P_1159_5 + -P_1159_4 + -P_1159_3 + -P_1159_2 + -P_1159_1 + -P_1159_10 + cIdleTasks <= 0 AND -Try_Check_Sources_B_10 + P_1099 + -Try_Check_Sources_B_9 + -Try_Check_Sources_B_8 + -Try_Check_Sources_B_7 + -Try_Check_Sources_B_6 + -Try_Check_Sources_B_5 + -Try_Check_Sources_B_4 + -Try_Check_Sources_B_3 + -Try_Check_Sources_B_2 + -Try_Check_Sources_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2792 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 2 literals
lola: write sara problem file to PolyORBLF-COL-S02J04T10-ReachabilityCardinality-15.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S02J04T10-ReachabilityCardinality-15.sara.
sara: place or transition ordering is non-deterministic
lola: time limit reached - aborting
lola: preliminary result: unknown unknown unknown yes no no no unknown unknown unknown unknown unknown no no unknown
lola: caught signal User defined signal 1 - aborting LoLA

BK_STOP 1463722534004

--------------------
content from stderr:

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-PT-S02J04T10"
export BK_EXAMINATION="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-S02J04T10.tgz
mv PolyORBLF-PT-S02J04T10 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool lola"
echo " Input is PolyORBLF-PT-S02J04T10, examination is 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-146369088900682"
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 ;