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

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

=== Now, execution of the tool begins

BK_START 1463735191722

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityCardinality @ PolyORBLF-PT-S06J04T08
FORMULA PolyORBLF-COL-S06J04T08-ReachabilityCardinality-0 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S06J04T08-ReachabilityCardinality-1 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S06J04T08-ReachabilityCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J04T08-ReachabilityCardinality-3 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S06J04T08-ReachabilityCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J04T08-ReachabilityCardinality-5 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S06J04T08-ReachabilityCardinality-6 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S06J04T08-ReachabilityCardinality-7 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S06J04T08-ReachabilityCardinality-8 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S06J04T08-ReachabilityCardinality-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J04T08-ReachabilityCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J04T08-ReachabilityCardinality-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J04T08-ReachabilityCardinality-12 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S06J04T08-ReachabilityCardinality-13 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S06J04T08-ReachabilityCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J04T08-ReachabilityCardinality-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: 14824/65536 symbol table entries, 9110 collisions
lola: preprocessing...
lola: finding significant places
lola: 810 places, 14014 transitions, 752 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 3639 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-COL-S06J04T08-ReachabilityCardinality.task
lola: read: EF ((!(!(3 <= P_1158_6 + P_1158_7 + P_1158_4 + P_1158_5 + P_1158_2 + P_1158_3 + P_1158_1 + P_1158_8)) AND AwakeTasks_4 + AwakeTasks_6 + AwakeTasks_5 + AwakeTasks_3 + AwakeTasks_2 + AwakeTasks_1 + AwakeTasks_7 + AwakeTasks_8 <= P_1093)) : AG (!(3 <= SigAbort)) : AG ((!(!(Abort_Check_Sources_E_5 + Abort_Check_Sources_E_6 + Abort_Check_Sources_E_4 + Abort_Check_Sources_E_3 + Abort_Check_Sources_E_2 +... (shortened)
lola: formula length: 11628
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_1158_8 + -P_1158_7 + -P_1158_6 + -P_1158_5 + -P_1158_4 + -P_1158_3 + -P_1158_2 + -P_1158_1 <= -3 AND -P_1093 + AwakeTasks_8 + AwakeTasks_7 + AwakeTasks_6 + AwakeTasks_5 + AwakeTasks_4 + AwakeTasks_3 + AwakeTasks_2 + AwakeTasks_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 3008 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-S06J04T08-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J04T08-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 (-SigAbort > -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 3008 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-S06J04T08-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J04T08-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: AG ((Abort_Check_Sources_E_8 + Abort_Check_Sources_E_7 + Abort_Check_Sources_E_6 + Abort_Check_Sources_E_5 + Abort_Check_Sources_E_4 + Abort_Check_Sources_E_3 + Abort_Check_Sources_E_2 + Abort_Check_Sources_E_1 + -NotifyEventSourceAddedE_8 + -NotifyEventSourceAddedE_7 + -NotifyEventSourceAddedE_6 + -NotifyEventSourceAddedE_5 + -NotifyEventSourceAddedE_4 + -NotifyEventSourceAddedE_3 + -NotifyEventS... (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 3008 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-S06J04T08-ReachabilityCardinality-2.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J04T08-ReachabilityCardinality-2.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 3 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((-TryAllocateOneTaskE_8 + -TryAllocateOneTaskE_7 + -TryAllocateOneTaskE_6 + -TryAllocateOneTaskE_5 + -TryAllocateOneTaskE_4 + -TryAllocateOneTaskE_3 + -TryAllocateOneTaskE_2 + -TryAllocateOneTaskE_1 <= -2 AND Check_Sources_B_8 + Check_Sources_B_7 + Check_Sources_B_6 + Check_Sources_B_5 + Check_Sources_B_4 + Check_Sources_B_3 + Check_Sources_B_2 + Check_Sources_B_1 + -Idle_8 + -Idle_7 + -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 3008 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-S06J04T08-ReachabilityCardinality-3.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J04T08-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 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-NotifyEventJobCompletedE_8 + -NotifyEventJobCompletedE_7 + -NotifyEventJobCompletedE_6 + -NotifyEventJobCompletedE_5 + -NotifyEventJobCompletedE_4 + -NotifyEventJobCompletedE_3 + -NotifyEventJobCompletedE_2 + -NotifyEventJobCompletedE_1 + P_1617_8 + P_1617_7 + P_1617_6 + P_1617_5 + P_1617_4 + P_1617_3 + P_1617_2 + P_1617_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 3008 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-S06J04T08-ReachabilityCardinality-4.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J04T08-ReachabilityCardinality-4.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 5 will run for 259 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-ORB_Lock > -3 OR (ModifiedSrc_6 + ModifiedSrc_5 + ModifiedSrc_4 + ModifiedSrc_3 + ModifiedSrc_2 + ModifiedSrc_1 + -Idle_8 + -Idle_7 + -Idle_6 + -Idle_5 + -Idle_4 + -Idle_3 + -Idle_2 + -Idle_1 > 0 AND -NotifyEventJobQueuedE_8 + -NotifyEventJobQueuedE_7 + -NotifyEventJobQueuedE_6 + -NotifyEventJobQueuedE_5 + -NotifyEventJobQueuedE_4 + -NotifyEventJobQueuedE_3 + -NotifyEventJobQueuedE_2 + -Noti... (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 3008 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-S06J04T08-ReachabilityCardinality-5.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J04T08-ReachabilityCardinality-5.sara.
sara: place or transition ordering is non-deterministic
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 259 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((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 + -ScheduleTaskE_Check_8 + -ScheduleTaskE_Check_7 + -ScheduleTaskE_Check_6 + -ScheduleTaskE_Check_5 + -ScheduleTaskE_Check_4 + -ScheduleTaskE_Check_3 + -ScheduleTaskE_Check_2 + -ScheduleTaskE_Check_1 <= 0 AND (-nyo_8 + -nyo_7 + -nyo_6 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3008 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 10 literals
lola: write sara problem file to PolyORBLF-COL-S06J04T08-ReachabilityCardinality-6.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J04T08-ReachabilityCardinality-6.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 7 will run for 260 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((-cSources + 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 <= 0 AND (-Abort_Check_Sources_E_8 + -Abort_Check_Sources_E_7 + -Abort_Check_Sources_E_6 + -Abort_Check_Sources_E_5 + -Abort_Check_Sources_E_4 + -Abort_Check_Sources_E_3 + -Abort_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 3008 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-S06J04T08-ReachabilityCardinality-7.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J04T08-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 260 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-ScheduleTaskB_8 + -ScheduleTaskB_7 + -ScheduleTaskB_6 + -ScheduleTaskB_5 + -ScheduleTaskB_4 + -ScheduleTaskB_3 + -ScheduleTaskB_2 + -ScheduleTaskB_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 3008 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-S06J04T08-ReachabilityCardinality-8.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J04T08-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 260 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((MarkerWrite + -P_1727 <= 0 AND ((-P_2321_1 + -P_2321_2 + -P_2321_3 + -P_2321_4 + -P_2321_5 + -P_2321_6 + -P_2321_7 + -P_2321_8 + NotifyEventSourceAddedB_8 + NotifyEventSourceAddedB_7 + NotifyEventSourceAddedB_6 + NotifyEventSourceAddedB_5 + NotifyEventSourceAddedB_4 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_1 <= 0 OR -NotifyEventSourceAddedE_8 + -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 3008 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-S06J04T08-ReachabilityCardinality-9.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J04T08-ReachabilityCardinality-9.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 300 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-P_1113_8 + FetchJobE_8_4 + FetchJobE_8_3 + FetchJobE_8_2 + FetchJobE_8_1 + FetchJobE_8_0 + FetchJobE_7_4 + FetchJobE_7_3 + FetchJobE_7_2 + FetchJobE_7_1 + FetchJobE_7_0 + -P_1113_1 + -P_1113_2 + -P_1113_3 + FetchJobE_6_4 + FetchJobE_6_3 + FetchJobE_6_2 + FetchJobE_6_1 + FetchJobE_6_0 + -P_1113_4 + -P_1113_5 + -P_1113_6 + FetchJobE_5_4 + FetchJobE_5_3 + FetchJobE_5_2 + FetchJobE_5_1 + FetchJob... (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 3008 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-S06J04T08-ReachabilityCardinality-10.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J04T08-ReachabilityCardinality-10.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 360 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-AwakeTasks_8 + -AwakeTasks_7 + -AwakeTasks_6 + -AwakeTasks_5 + -AwakeTasks_4 + -AwakeTasks_3 + -AwakeTasks_2 + -AwakeTasks_1 <= -2 AND (-P_1725_4 + -P_1725_3 + -P_1725_2 + -P_1725_1 + -P_1725_0 > -1 AND -P_1727 + FetchJobE_8_4 + FetchJobE_8_3 + FetchJobE_8_2 + FetchJobE_8_1 + FetchJobE_8_0 + FetchJobE_7_4 + FetchJobE_7_3 + FetchJobE_7_2 + FetchJobE_7_1 + FetchJobE_7_0 + FetchJobE_6_4 + Fetch... (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 3008 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-S06J04T08-ReachabilityCardinality-11.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J04T08-ReachabilityCardinality-11.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 12 will run for 450 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-cIdleTasks <= -3 OR (AbourtToModifySrc_6 + AbourtToModifySrc_5 + AbourtToModifySrc_4 + AbourtToModifySrc_3 + AbourtToModifySrc_2 + AbourtToModifySrc_1 + -ORB_Lock <= 0 OR (-P_1155_8 + -P_1155_7 + -P_1155_6 + -P_1155_5 + -P_1155_4 + -P_1155_3 + -P_1155_2 + -P_1155_1 + P_1725_4 + P_1725_3 + P_1725_2 + P_1725_1 + P_1725_0 <= 0 OR (-Abort_Check_Sources_E_8 + -Abort_Check_Sources_E_7 + -Abort_Che... (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 3008 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-S06J04T08-ReachabilityCardinality-12.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J04T08-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 450 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((-ScheduleTaskE_Check_8 + -ScheduleTaskE_Check_7 + -ScheduleTaskE_Check_6 + -ScheduleTaskE_Check_5 + -ScheduleTaskE_Check_4 + -ScheduleTaskE_Check_3 + -ScheduleTaskE_Check_2 + -ScheduleTaskE_Check_1 > -1 AND -cBlockedTasks > -3) OR -P_1155_8 + -P_1155_7 + -P_1155_6 + -P_1155_5 + -P_1155_4 + -P_1155_3 + -P_1155_2 + -P_1155_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 3008 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-S06J04T08-ReachabilityCardinality-13.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J04T08-ReachabilityCardinality-13.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 14 will run for 449 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((AbourtToModifySrc_6 + AbourtToModifySrc_5 + AbourtToModifySrc_4 + AbourtToModifySrc_3 + AbourtToModifySrc_2 + AbourtToModifySrc_1 + -cIdleTasks <= 0 AND -AvailableJobId_0 + -AvailableJobId_1 + -AvailableJobId_2 + -AvailableJobId_3 + -AvailableJobId_4 <= -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 3008 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-S06J04T08-ReachabilityCardinality-14.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J04T08-ReachabilityCardinality-14.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 15 will run for 899 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (IsMonitoring + -ScheduleTaskE_Work_8_4 + -ScheduleTaskE_Work_8_3 + -ScheduleTaskE_Work_8_2 + -ScheduleTaskE_Work_8_1 + -ScheduleTaskE_Work_8_0 + -ScheduleTaskE_Work_7_4 + -ScheduleTaskE_Work_7_3 + -ScheduleTaskE_Work_7_2 + -ScheduleTaskE_Work_7_1 + -ScheduleTaskE_Work_7_0 + -ScheduleTaskE_Work_6_4 + -ScheduleTaskE_Work_6_3 + -ScheduleTaskE_Work_6_2 + -ScheduleTaskE_Work_6_1 + -ScheduleTaskE_Wo... (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 3008 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-S06J04T08-ReachabilityCardinality-15.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J04T08-ReachabilityCardinality-15.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: RESULT
lola: summary: unknown unknown no unknown no unknown unknown unknown unknown yes no yes unknown unknown no yes

BK_STOP 1463737833011

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