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

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

=== Now, execution of the tool begins

BK_START 1463749067580

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityCardinality @ PolyORBNT-PT-S10J40
FORMULA PolyORBNT-COL-S10J40-ReachabilityCardinality-0 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S10J40-ReachabilityCardinality-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S10J40-ReachabilityCardinality-2 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S10J40-ReachabilityCardinality-3 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S10J40-ReachabilityCardinality-4 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S10J40-ReachabilityCardinality-5 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S10J40-ReachabilityCardinality-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S10J40-ReachabilityCardinality-7 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S10J40-ReachabilityCardinality-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S10J40-ReachabilityCardinality-9 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S10J40-ReachabilityCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S10J40-ReachabilityCardinality-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S10J40-ReachabilityCardinality-12 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S10J40-ReachabilityCardinality-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S10J40-ReachabilityCardinality-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S10J40-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: 13194/65536 symbol table entries, 4678 collisions
lola: preprocessing...
lola: finding significant places
lola: 854 places, 12340 transitions, 742 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2698 transition conflict sets
lola: TASK
lola: reading formula from PolyORBNT-COL-S10J40-ReachabilityCardinality.task
lola: read: AG ((((3 <= mo2 OR Perform_Work_E_1 <= cJobCnt) OR 1 <= cJobCnt) OR (!(DataOnSrc_9 + DataOnSrc_8 + DataOnSrc_7 + DataOnSrc_6 + DataOnSrc_5 + DataOnSrc_1 + DataOnSrc_4 + DataOnSrc_2 + DataOnSrc_3 + DataOnSrc_10 <= mo1) OR (1 <= place_521_1 OR 1 <= place_520_1)))) : EF (TheSour_6 + TheSour_7 + TheSour_4 + TheSour_9 + TheSour_5 + TheSour_2 + TheSour_3 + TheSour_10 + TheSour_1 + TheSour_8 <= mo3) : EF... (shortened)
lola: formula length: 12667
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 ((-mo2 <= -3 OR (-cJobCnt + Perform_Work_E_1 <= 0 OR (-cJobCnt <= -1 OR (-mo1 + DataOnSrc_1 + DataOnSrc_2 + DataOnSrc_3 + DataOnSrc_4 + DataOnSrc_5 + DataOnSrc_6 + DataOnSrc_7 + DataOnSrc_8 + DataOnSrc_9 + DataOnSrc_10 > 0 OR (-place_521_1 <= -1 OR -place_520_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 2968 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 PolyORBNT-COL-S10J40-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J40-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: EF (-mo3 + TheSour_10 + TheSour_9 + TheSour_8 + TheSour_7 + TheSour_6 + TheSour_5 + TheSour_4 + TheSour_3 + TheSour_2 + TheSour_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 2968 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-S10J40-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J40-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((mi1 + -QueueJobE_1 > 0 AND (-AvailableJobId_17 + -AvailableJobId_18 + -AvailableJobId_20 + -AvailableJobId_29 + -AvailableJobId_30 + -AvailableJobId_31 + -AvailableJobId_32 + -AvailableJobId_0 + -AvailableJobId_1 + -AvailableJobId_2 + -AvailableJobId_3 + -AvailableJobId_5 + -AvailableJobId_6 + -AvailableJobId_7 + -AvailableJobId_8 + -AvailableJobId_9 + -AvailableJobId_4 + -AvailableJobId_40 +... (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 2968 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-S10J40-ReachabilityCardinality-2.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J40-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 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-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 + -Schedule_T... (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 2968 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-S10J40-ReachabilityCardinality-3.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J40-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 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-mo1 > -2 OR -CanInjectEvent + place_523_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 2968 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-S10J40-ReachabilityCardinality-4.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J40-ReachabilityCardinality-4.sara.
sara: place or transition ordering is non-deterministic
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-place_522_1 + place_460 <= 0 OR -DataOnSrc_1 + -DataOnSrc_2 + -DataOnSrc_3 + -DataOnSrc_4 + -DataOnSrc_5 + -DataOnSrc_6 + -DataOnSrc_7 + -DataOnSrc_8 + -DataOnSrc_9 + -DataOnSrc_10 <= -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 2968 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-S10J40-ReachabilityCardinality-5.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J40-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 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((-mo2 <= -2 OR -block <= -3) AND NotifyEventJobQueuedB_1_9 + NotifyEventJobQueuedB_1_8 + NotifyEventJobQueuedB_1_7 + NotifyEventJobQueuedB_1_6 + NotifyEventJobQueuedB_1_5 + NotifyEventJobQueuedB_1_4 + NotifyEventJobQueuedB_1_3 + NotifyEventJobQueuedB_1_2 + NotifyEventJobQueuedB_1_1 + NotifyEventJobQueuedB_1_0 + NotifyEventJobQueuedB_1_40 + NotifyEventJobQueuedB_1_10 + NotifyEventJobQueuedB_1... (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 2968 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 PolyORBNT-COL-S10J40-ReachabilityCardinality-6.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J40-ReachabilityCardinality-6.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 7 will run for 263 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-mo3 > -2 OR (-mo3 + cSources <= 0 OR (-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 + -Sched... (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 2968 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 PolyORBNT-COL-S10J40-ReachabilityCardinality-7.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J40-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 263 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (Perform_Work_B_1_40 + Perform_Work_B_1_39 + Perform_Work_B_1_38 + Perform_Work_B_1_37 + Perform_Work_B_1_36 + Perform_Work_B_1_35 + Perform_Work_B_1_34 + Perform_Work_B_1_33 + Perform_Work_B_1_32 + Perform_Work_B_1_31 + 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_Work_B_1_25 + Perform_Work_B_1_24 + Perform_Work_B_1_23 + ... (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 2968 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-S10J40-ReachabilityCardinality-8.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J40-ReachabilityCardinality-8.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 9 will run for 284 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-place_458 <= -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 2968 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-S10J40-ReachabilityCardinality-9.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J40-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 284 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-place_522_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 2968 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-S10J40-ReachabilityCardinality-10.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J40-ReachabilityCardinality-10.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 341 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((JobCnt + -place_522_1 <= 0 OR (-place_523_1 > -1 OR (-NotifyEventEndOfCheckSourcesE_1 <= -2 AND (-cJobCnt + NotifyEventJobQueuedE_1 <= 0 AND (-QueueJobB_1_40 + -QueueJobB_1_39 + -QueueJobB_1_38 + -QueueJobB_1_37 + -QueueJobB_1_36 + -QueueJobB_1_35 + -QueueJobB_1_34 + -QueueJobB_1_33 + -QueueJobB_1_32 + -QueueJobB_1_31 + -QueueJobB_1_30 + -QueueJobB_1_29 + -QueueJobB_1_28 + -QueueJobB_1_27 + -... (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 2968 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 PolyORBNT-COL-S10J40-ReachabilityCardinality-11.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J40-ReachabilityCardinality-11.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 426 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((-Check_Sources_E_1 <= -3 OR NotifyEventEndOfCheckSourcesE_1 + -JobCnt <= 0) AND (-cJobCnt + f2_40 + f2_39 + f2_38 + f2_37 + f2_36 + f2_35 + f2_34 + f2_33 + f2_32 + f2_31 + 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... (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 2968 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 14 literals
lola: write sara problem file to PolyORBNT-COL-S10J40-ReachabilityCardinality-12.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J40-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 427 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((-JobCnt > -1 AND -place_520_1 + NotifyEventJobQueuedE_1 > 0) OR f3_9 + f3_8 + f3_7 + f3_6 + f3_5 + f3_4 + f3_3 + f3_2 + f3_1 + f3_0 + f3_40 + f3_39 + f3_38 + f3_37 + f3_36 + f3_35 + f3_34 + f3_33 + f3_32 + f3_31 + 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 + -place_520_1... (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 2968 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-S10J40-ReachabilityCardinality-13.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J40-ReachabilityCardinality-13.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 640 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-QueueJobB_1_40 + -QueueJobB_1_39 + -QueueJobB_1_38 + -QueueJobB_1_37 + -QueueJobB_1_36 + -QueueJobB_1_35 + -QueueJobB_1_34 + -QueueJobB_1_33 + -QueueJobB_1_32 + -QueueJobB_1_31 + -QueueJobB_1_30 + -QueueJobB_1_29 + -QueueJobB_1_28 + -QueueJobB_1_27 + -QueueJobB_1_26 + -QueueJobB_1_25 + -QueueJobB_1_24 + -QueueJobB_1_23 + -QueueJobB_1_22 + -QueueJobB_1_21 + -QueueJobB_1_20 + -QueueJobB_1_19 +... (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 2968 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-S10J40-ReachabilityCardinality-14.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J40-ReachabilityCardinality-14.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 1281 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-mi3 <= -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 2968 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-S10J40-ReachabilityCardinality-15.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J40-ReachabilityCardinality-15.sara.
sara: place or transition ordering is non-deterministic
lola: time limit reached - aborting
lola: preliminary result: unknown yes unknown unknown unknown unknown yes unknown no unknown no no unknown yes yes
lola: caught signal User defined signal 1 - aborting LoLA
lola: caught signal User defined signal 1 - aborting LoLA

BK_STOP 1463752607886

--------------------
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-S10J40"
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-S10J40.tgz
mv PolyORBNT-PT-S10J40 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-S10J40, 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-146369089200979"
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 ;