fond
Model Checking Contest @ Petri Nets 2016
6th edition, Toruń, Poland, June 21, 2016
Execution%20of%20r146kn-smll-146416250000781
Last Updated
June 30, 2016

About the Execution of LoLa for S_GlobalResAllocation-PT-05

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1950.020 2856298.00 3428331.00 6340.50 FTFTT?FFF?T?FFTF normal

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 S_GlobalResAllocation-PT-05, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146kn-smll-146416250000781
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1464425623670

bkconf 3600
===========================================================================================
===========================================================================================
S_GlobalResAllocation-PT-05: translating formula ReachabilityCardinality into LoLA format
S_GlobalResAllocation-PT-05: translating Petri net model.pnml into LoLA format
===========================================================================================
===========================================================================================
/home/mcc/BenchKit/bin/formula2lola.py ReachabilityCardinality.xml
/home/mcc/BenchKit/bin/pnml2lola.py model.pnml > model.pnml.lola
touch formulae;


in benchkit_head lolaszeit 1255
ReachabilityCardinality @ S_GlobalResAllocation-PT-05
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-3 CANNOT_COMPUTE
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-5 CANNOT_COMPUTE
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-13 CANNOT_COMPUTE
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-15 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
lola: LoLA will run for 1255 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 56180/65536 symbol table entries, 36519 collisions
lola: preprocessing...
lola: finding significant places
lola: 75 places, 56105 transitions, 55 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2220 transition conflict sets
lola: TASK
lola: reading formula from GlobalResAllocation-COL-05-ReachabilityCardinality.task
lola: read: AG ((pr_in_1 + pr_in_2 + pr_in_3 + pr_in_4 + pr_in_5 <= pr_released_4 + pr_released_5 + pr_released_1 + pr_released_2 + pr_released_3 OR 3 <= Processes_1 + Processes_2 + Processes_3 + Processes_4 + Processes_5)) : EF (!((Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6 + Resources_7 + Resources_8 + Resources_10 + Resources_9 <= Processes_1 + Processes_2 + Processes... (shortened)
lola: formula length: 14443
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 78 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((pr_in_5 + -pr_released_1 + -pr_released_2 + -pr_released_3 + -pr_released_5 + -pr_released_4 + pr_in_4 + pr_in_3 + pr_in_2 + pr_in_1 <= 0 OR -Processes_5 + -Processes_4 + -Processes_3 + -Processes_2 + -Processes_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 220 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 GlobalResAllocation-COL-05-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-05-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 1 will run for 83 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((Resources_10 + -Processes_5 + -Processes_4 + -Processes_3 + -Processes_2 + -Processes_1 + Resources_9 + Resources_8 + Resources_7 + Resources_6 + Resources_5 + Resources_4 + Resources_3 + Resources_2 + Resources_1 > 0 AND in_critical_s_3_9 + in_critical_s_3_8 + in_critical_s_3_7 + in_critical_s_3_6 + in_critical_s_3_5 + in_critical_s_3_4 + in_critical_s_3_3 + in_critical_s_3_2 + in_critical_s... (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 220 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 GlobalResAllocation-COL-05-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-05-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 89 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-Processes_5 + -Processes_4 + -Processes_3 + -Processes_2 + -Processes_1 <= -3 OR (-pr_in_5 + -pr_in_4 + -pr_in_3 + -pr_in_2 + -pr_in_1 > -2 OR -in_critical_s_3_9 + -in_critical_s_3_8 + -in_critical_s_3_7 + -in_critical_s_3_6 + -in_critical_s_3_5 + -in_critical_s_3_4 + -in_critical_s_3_3 + -in_critical_s_3_2 + -in_critical_s_3_1 + -in_critical_s_2_9 + -in_critical_s_4_10 + -in_critical_s_1_10... (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 220 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 GlobalResAllocation-COL-05-ReachabilityCardinality-2.sara
lola: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-05-ReachabilityCardinality-2.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 3 will run for 95 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-Resources_10 + -Resources_9 + -Resources_8 + -Resources_7 + -Resources_6 + -Resources_5 + -Resources_4 + -Resources_3 + -Resources_2 + -Resources_1 <= -1 OR ((-Resources_10 + -Resources_9 + -Resources_8 + -Resources_7 + -Resources_6 + -Resources_5 + -Resources_4 + -Resources_3 + -Resources_2 + -Resources_1 <= -1 AND -pr_in_5 + -pr_in_4 + -pr_in_3 + -pr_in_2 + -pr_in_1 <= -3) OR -Processes_5 ... (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 220 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 GlobalResAllocation-COL-05-ReachabilityCardinality-3.sara
lola: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-05-ReachabilityCardinality-3.sara.
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 95 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-Resources_10 + -Resources_9 + -Resources_8 + -Resources_7 + -Resources_6 + -Resources_5 + -Resources_4 + -Resources_3 + -Resources_2 + -Resources_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 220 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 GlobalResAllocation-COL-05-ReachabilityCardinality-4.sara
lola: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-05-ReachabilityCardinality-4.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 5 will run for 104 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-Resources_10 + -Resources_9 + -Resources_8 + -Resources_7 + -Resources_6 + -Resources_5 + -Resources_4 + -Resources_3 + -Resources_2 + -Resources_1 <= -3 AND ((-pr_in_5 + -pr_in_4 + -pr_in_3 + -pr_in_2 + -pr_in_1 <= -1 OR in_critical_s_3_9 + in_critical_s_3_8 + in_critical_s_3_7 + in_critical_s_3_6 + in_critical_s_3_5 + in_critical_s_3_4 + in_critical_s_3_3 + in_critical_s_3_2 + in_critical_... (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 220 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 GlobalResAllocation-COL-05-ReachabilityCardinality-5.sara
lola: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-05-ReachabilityCardinality-5.sara.
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 104 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((-Resources_10 + -Resources_9 + -Resources_8 + -Resources_7 + -Resources_6 + -Resources_5 + -Resources_4 + -Resources_3 + -Resources_2 + -Resources_1 <= -2 OR -pr_in_5 + -pr_in_4 + -pr_in_3 + -pr_in_2 + -pr_in_1 <= -3) AND ((-in_critical_s_3_9 + -in_critical_s_3_8 + -in_critical_s_3_7 + -in_critical_s_3_6 + -in_critical_s_3_5 + -in_critical_s_3_4 + -in_critical_s_3_3 + -in_critical_s_3_2 + -i... (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 220 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 GlobalResAllocation-COL-05-ReachabilityCardinality-6.sara
lola: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-05-ReachabilityCardinality-6.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 7 will run for 115 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((-pr_released_1 + -pr_released_2 + -pr_released_3 + -pr_released_5 + -pr_released_4 > -1 OR -in_critical_s_3_9 + -in_critical_s_3_8 + -in_critical_s_3_7 + -in_critical_s_3_6 + -in_critical_s_3_5 + -in_critical_s_3_4 + -in_critical_s_3_3 + -in_critical_s_3_2 + -in_critical_s_3_1 + -in_critical_s_2_9 + -in_critical_s_4_10 + -in_critical_s_1_10 + -in_critical_s_1_9 + -in_critical_s_2_1 + -in_cri... (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 220 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: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 8 will run for 129 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-pr_released_1 + -pr_released_2 + -pr_released_3 + -pr_released_5 + -pr_released_4 <= -3 AND (-pr_in_5 + -pr_in_4 + -pr_in_3 + -pr_in_2 + -pr_in_1 <= -2 AND -Processes_5 + -Processes_4 + -Processes_3 + -Processes_2 + -Processes_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 220 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 GlobalResAllocation-COL-05-ReachabilityCardinality-8.sara
lola: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-05-ReachabilityCardinality-8.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 148 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((-Processes_5 + -Processes_4 + -Processes_3 + -Processes_2 + -Processes_1 <= -2 AND (-Processes_5 + -Processes_4 + -Processes_3 + -Processes_2 + -Processes_1 <= -1 OR -in_critical_s_3_9 + -in_critical_s_3_8 + -in_critical_s_3_7 + -in_critical_s_3_6 + -in_critical_s_3_5 + -in_critical_s_3_4 + -in_critical_s_3_3 + -in_critical_s_3_2 + -in_critical_s_3_1 + -in_critical_s_2_9 + -in_critical_s_4_1... (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 220 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 7 literals
lola: write sara problem file to GlobalResAllocation-COL-05-ReachabilityCardinality-9.sara
lola: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-05-ReachabilityCardinality-9.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 10 will run for 172 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file GlobalResAllocation-COL-05-ReachabilityCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 11 will run for 206 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file GlobalResAllocation-COL-05-ReachabilityCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 12 will run for 258 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-pr_in_5 + Resources_10 + Resources_9 + Resources_8 + Resources_7 + Resources_6 + Resources_5 + Resources_4 + Resources_3 + Resources_2 + Resources_1 + -pr_in_4 + -pr_in_3 + -pr_in_2 + -pr_in_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 220 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 GlobalResAllocation-COL-05-ReachabilityCardinality-12.sara
lola: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-05-ReachabilityCardinality-12.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 343 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-in_critical_s_3_9 + -in_critical_s_3_8 + -in_critical_s_3_7 + -in_critical_s_3_6 + -in_critical_s_3_5 + -in_critical_s_3_4 + -in_critical_s_3_3 + -in_critical_s_3_2 + -in_critical_s_3_1 + -in_critical_s_2_9 + -in_critical_s_4_10 + -in_critical_s_1_10 + -in_critical_s_1_9 + -in_critical_s_2_1 + -in_critical_s_2_2 + -in_critical_s_2_3 + -in_critical_s_2_4 + -in_critical_s_1_8 + -in_critical_s_... (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 220 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 GlobalResAllocation-COL-05-ReachabilityCardinality-13.sara
lola: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-05-ReachabilityCardinality-13.sara.
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 344 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (pr_released_1 + pr_released_2 + pr_released_3 + pr_released_5 + pr_released_4 + -Processes_5 + -Processes_4 + -Processes_3 + -Processes_2 + -Processes_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 220 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 GlobalResAllocation-COL-05-ReachabilityCardinality-14.sara
lola: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-05-ReachabilityCardinality-14.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 15 will run for 686 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-Resources_10 + -Resources_9 + -Resources_8 + -Resources_7 + -Resources_6 + -Resources_5 + -Resources_4 + -Resources_3 + -Resources_2 + -Resources_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 220 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 GlobalResAllocation-COL-05-ReachabilityCardinality-15.sara
lola: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-05-ReachabilityCardinality-15.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: RESULT
lola: summary: no yes no unknown yes unknown no no yes no no yes yes unknown no no

BK_STOP 1464428479968

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

parsing of model.pnml complete

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="S_GlobalResAllocation-PT-05"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/root/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/S_GlobalResAllocation-PT-05.tgz
mv S_GlobalResAllocation-PT-05 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 S_GlobalResAllocation-PT-05, 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 r146kn-smll-146416250000781"
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 ;