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

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

=== Now, execution of the tool begins

BK_START 1463746984189

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityCardinality @ PolyORBNT-PT-S10J30
FORMULA PolyORBNT-COL-S10J30-ReachabilityCardinality-0 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S10J30-ReachabilityCardinality-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S10J30-ReachabilityCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S10J30-ReachabilityCardinality-3 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S10J30-ReachabilityCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S10J30-ReachabilityCardinality-5 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S10J30-ReachabilityCardinality-6 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S10J30-ReachabilityCardinality-7 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S10J30-ReachabilityCardinality-8 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S10J30-ReachabilityCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S10J30-ReachabilityCardinality-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S10J30-ReachabilityCardinality-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S10J30-ReachabilityCardinality-12 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S10J30-ReachabilityCardinality-13 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S10J30-ReachabilityCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S10J30-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: 12714/65536 symbol table entries, 4655 collisions
lola: preprocessing...
lola: finding significant places
lola: 664 places, 12050 transitions, 572 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2298 transition conflict sets
lola: TASK
lola: reading formula from PolyORBNT-COL-S10J30-ReachabilityCardinality.task
lola: read: AG (!(!((1 <= f2_28 + f2_11 + f2_7 + f2_27 + f2_14 + f2_20 + f2_21 + f2_0 + f2_22 + f2_8 + f2_26 + f2_13 + f2_25 + f2_23 + f2_5 + f2_16 + f2_15 + f2_24 + f2_6 + f2_30 + f2_17 + f2_4 + f2_18 + f2_3 + f2_29 + f2_9 + f2_2 + f2_19 + f2_10 + f2_1 + f2_12 OR mo2 <= place_462)))) : AG (Check_Sources_B_1 <= place_482_1_10 + place_482_1_3 + place_482_1_9 + place_482_1_1 + place_482_1_4 + place_482_1_2 + pl... (shortened)
lola: formula length: 14429
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-f2_30 + -f2_29 + -f2_28 + -f2_27 + -f2_26 + -f2_25 + -f2_24 + -f2_23 + -f2_22 + -f2_21 + -f2_20 + -f2_19 + -f2_18 + -f2_17 + -f2_16 + -f2_15 + -f2_14 + -f2_13 + -f2_12 + -f2_11 + -f2_10 + -f2_9 + -f2_8 + -f2_7 + -f2_6 + -f2_5 + -f2_4 + -f2_3 + -f2_2 + -f2_1 + -f2_0 <= -1 OR mo2 + -place_462 <= 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 2288 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 PolyORBNT-COL-S10J30-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J30-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 (Check_Sources_B_1 + -place_482_1_9 + -place_482_1_8 + -place_482_1_7 + -place_482_1_6 + -place_482_1_5 + -place_482_1_4 + -place_482_1_3 + -place_482_1_2 + -place_482_1_1 + -place_482_1_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 2288 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 PolyORBNT-COL-S10J30-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J30-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 2 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-NotifyEventJobQueuedE_1 > -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 2288 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 PolyORBNT-COL-S10J30-ReachabilityCardinality-2.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J30-ReachabilityCardinality-2.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 3 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-place_520_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 2288 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 PolyORBNT-COL-S10J30-ReachabilityCardinality-3.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J30-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 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-TheSour_10 + -TheSour_9 + -TheSour_8 + -TheSour_7 + -TheSour_6 + -TheSour_5 + -TheSour_4 + -TheSour_3 + -TheSour_2 + -TheSour_1 <= -1 OR Check_Sources_B_1 + -f3_9 + -f3_8 + -f3_7 + -f3_6 + -f3_5 + -f3_4 + -f3_3 + -f3_2 + -f3_1 + -f3_0 + -f3_30 + -f3_29 + -f3_28 + -f3_27 + -f3_26 + -f3_25 + -f3_24 + -f3_23 + -f3_22 + -f3_21 + -f3_20 + -f3_19 + -f3_18 + -f3_17 + -f3_16 + -f3_15 + -f3_14 + -f3_... (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 2288 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 PolyORBNT-COL-S10J30-ReachabilityCardinality-4.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J30-ReachabilityCardinality-4.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 5 will run for 278 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-block <= -1 AND (-Try_Check_Sources_B_1 <= -2 AND (-Try_Check_Sources_E_1 <= -3 AND (-place_462 <= -2 AND (place_787_1 + -Try_Check_Sources_B_1 <= 0 OR (-f1_30 + -f1_29 + -f1_28 + -f1_27 + -f1_26 + -f1_25 + -f1_24 + -f1_23 + -f1_22 + -f1_21 + -f1_20 + -f1_19 + -f1_18 + -f1_17 + -f1_16 + -f1_15 + -f1_14 + -f1_13 + -f1_12 + -f1_11 + -f1_10 + place_523_1 + -f1_9 + -f1_8 + -f1_7 + -f1_6 + -f1_5 ... (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 2288 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 15 literals
lola: write sara problem file to PolyORBNT-COL-S10J30-ReachabilityCardinality-5.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J30-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 278 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((-AvailableJobId_17 + -AvailableJobId_18 + -AvailableJobId_20 + -AvailableJobId_29 + -AvailableJobId_30 + f1_30 + -AvailableJobId_0 + -AvailableJobId_1 + -AvailableJobId_2 + -AvailableJobId_3 + -AvailableJobId_5 + -AvailableJobId_6 + -AvailableJobId_7 + -AvailableJobId_8 + -AvailableJobId_9 + -AvailableJobId_4 + f1_29 + f1_28 + f1_27 + f1_26 + f1_25 + f1_24 + f1_23 + f1_22 + f1_21 + f1_20 + 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 2288 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 PolyORBNT-COL-S10J30-ReachabilityCardinality-6.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J30-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 278 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((mo2 + -Schedule_Task_E_1_PerformWork_9 + -Schedule_Task_E_1_PerformWork_8 + -Schedule_Task_E_1_PerformWork_7 + -Schedule_Task_E_1_PerformWork_6 + -Schedule_Task_E_1_PerformWork_5 + -Schedule_Task_E_1_PerformWork_4 + -Schedule_Task_E_1_PerformWork_3 + -Schedule_Task_E_1_PerformWork_2 + -Schedule_Task_E_1_PerformWork_1 + -Schedule_Task_E_1_PerformWork_0 + -Schedule_Task_E_1_CheckSource_0 + -Sc... (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 2288 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 PolyORBNT-COL-S10J30-ReachabilityCardinality-7.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J30-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 278 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-place_518_1 <= -3 AND (ModifiedSrc_9 + ModifiedSrc_8 + ModifiedSrc_7 + ModifiedSrc_6 + ModifiedSrc_5 + ModifiedSrc_4 + ModifiedSrc_3 + ModifiedSrc_2 + ModifiedSrc_1 + ModifiedSrc_10 + -place_460 > 0 OR -NotifyEventJobQueuedB_1_9 + -NotifyEventJobQueuedB_1_8 + -NotifyEventJobQueuedB_1_7 + -NotifyEventJobQueuedB_1_6 + -NotifyEventJobQueuedB_1_5 + -NotifyEventJobQueuedB_1_4 + -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 2288 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 PolyORBNT-COL-S10J30-ReachabilityCardinality-8.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J30-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 278 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-Perform_Work_E_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 2288 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 PolyORBNT-COL-S10J30-ReachabilityCardinality-9.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J30-ReachabilityCardinality-9.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 10 will run for 305 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((f3_9 + f3_8 + f3_7 + f3_6 + f3_5 + f3_4 + f3_3 + f3_2 + f3_1 + f3_0 + f3_30 + f3_29 + f3_28 + f3_27 + f3_26 + f3_25 + f3_24 + f3_23 + f3_22 + f3_21 + f3_20 + f3_19 + f3_18 + f3_17 + f3_16 + f3_15 + f3_14 + f3_13 + f3_12 + f3_11 + f3_10 + -Try_Check_Sources_B_1 <= 0 AND -Perform_Work_B_1_30 + -Perform_Work_B_1_29 + -Perform_Work_B_1_28 + -Perform_Work_B_1_27 + -Perform_Work_B_1_26 + -Perform... (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 2288 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 12 literals
lola: write sara problem file to PolyORBNT-COL-S10J30-ReachabilityCardinality-10.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J30-ReachabilityCardinality-10.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 367 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((place_518_1 + -place_787_1 <= 0 OR -Schedule_Task_B_1 <= -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 2288 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 PolyORBNT-COL-S10J30-ReachabilityCardinality-11.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J30-ReachabilityCardinality-11.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution produced
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 430 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((-ModifiedSrc_9 + -ModifiedSrc_8 + -ModifiedSrc_7 + -ModifiedSrc_6 + -ModifiedSrc_5 + -ModifiedSrc_4 + -ModifiedSrc_3 + -ModifiedSrc_2 + -ModifiedSrc_1 + -ModifiedSrc_10 <= -3 OR (-AvailableJobId_17 + -AvailableJobId_18 + -AvailableJobId_20 + -AvailableJobId_29 + -AvailableJobId_30 + -AvailableJobId_0 + -AvailableJobId_1 + -AvailableJobId_2 + -AvailableJobId_3 + -AvailableJobId_5 + -Available... (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 2288 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 PolyORBNT-COL-S10J30-ReachabilityCardinality-12.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J30-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 431 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-AvailableJobId_17 + -AvailableJobId_18 + -AvailableJobId_20 + -AvailableJobId_29 + -AvailableJobId_30 + -AvailableJobId_0 + -AvailableJobId_1 + -AvailableJobId_2 + -AvailableJobId_3 + -AvailableJobId_5 + -AvailableJobId_6 + -AvailableJobId_7 + -AvailableJobId_8 + -AvailableJobId_9 + -AvailableJobId_4 + -AvailableJobId_28 + -AvailableJobId_27 + -AvailableJobId_26 + -AvailableJobId_25 + -Availa... (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 2288 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 PolyORBNT-COL-S10J30-ReachabilityCardinality-13.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J30-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 431 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-Schedule_Task_B_1 + Try_Check_Sources_E_1 <= 0 OR (CanInjectEvent + -place_522_1 <= 0 OR -QueueJobE_1 <= -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 2288 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 PolyORBNT-COL-S10J30-ReachabilityCardinality-14.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J30-ReachabilityCardinality-14.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution produced
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 15 will run for 750 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-CanInjectEvent + Check_Sources_B_1 <= 0 AND (-place_521_1 <= -2 AND (-place_458 <= -1 AND (-mi2 <= -1 AND -NotifyEventEndOfCheckSourcesE_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 2288 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 PolyORBNT-COL-S10J30-ReachabilityCardinality-15.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J30-ReachabilityCardinality-15.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: RESULT
lola: summary: unknown no no unknown no unknown unknown unknown unknown no yes no unknown unknown no unknown
lola: time limit reached - aborting

BK_STOP 1463750524554

--------------------
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="PolyORBNT-PT-S10J30"
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/PolyORBNT-PT-S10J30.tgz
mv PolyORBNT-PT-S10J30 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 PolyORBNT-PT-S10J30, 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-146369089200970"
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 ;