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-3254
Executing tool lola
Input is GlobalResAllocation-PT-05, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-blw3-149440264400502
=====================================================================

--------------------
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 1494719219484


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
ReachabilityCardinality @ GlobalResAllocation-PT-05 @ 3540 seconds
----- Start make result stdout -----
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: 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: A (G (((in_critical_s_4_1 + in_critical_s_4_2 + in_critical_s_4_3 + in_critical_s_4_4 + in_critical_s_4_5 + in_critical_s_4_6 + in_critical_s_4_7 + in_critical_s_4_8 + in_critical_s_4_9 + in_critical_s_5_1 + in_critical_s_5_2 + in_critical_s_5_3 + in_critical_s_5_4 + in_critical_s_5_5 + in_critical_s_5_6 + in_critical_s_5_7 + in_critical_s_5_8 + in_critical_s_5_9 + in_critical_s_5_10 + in_critical_s_2_8 + in_critical_s_2_7 + in_critical_s_3_10 + in_critical_s_2_10 + in_critical_s_2_6 + in_critical_s_2_5 + in_critical_s_1_1 + in_critical_s_1_2 + in_critical_s_1_3 + in_critical_s_1_4 + in_critical_s_1_5 + in_critical_s_1_6 + in_critical_s_1_7 + in_critical_s_1_8 + in_critical_s_2_4 + in_critical_s_2_3 + in_critical_s_2_2 + in_critical_s_2_1 + in_critical_s_1_9 + in_critical_s_1_10 + in_critical_s_4_10 + in_critical_s_2_9 + in_critical_s_3_1 + in_critical_s_3_2 + in_critical_s_3_3 + in_critical_s_3_4 + in_critical_s_3_5 + in_critical_s_3_6 + in_critical_s_3_7 + in_critical_s_3_8 + in_critical_s_3_9 + 1 <= Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6 + Resources_7 + Resources_8 + Resources_9 + Resources_10) OR (pr_released_4 + pr_released_5 + pr_released_3 + pr_released_2 + pr_released_1 <= 1) OR (in_critical_s_4_1 + in_critical_s_4_2 + in_critical_s_4_3 + in_critical_s_4_4 + in_critical_s_4_5 + in_critical_s_4_6 + in_critical_s_4_7 + in_critical_s_4_8 + in_critical_s_4_9 + in_critical_s_5_1 + in_critical_s_5_2 + in_critical_s_5_3 + in_critical_s_5_4 + in_critical_s_5_5 + in_critical_s_5_6 + in_critical_s_5_7 + in_critical_s_5_8 + in_critical_s_5_9 + in_critical_s_5_10 + in_critical_s_2_8 + in_critical_s_2_7 + in_critical_s_3_10 + in_critical_s_2_10 + in_critical_s_2_6 + in_critical_s_2_5 + in_critical_s_1_1 + in_critical_s_1_2 + in_critical_s_1_3 + in_critical_s_1_4 + in_critical_s_1_5 + in_critical_s_1_6 + in_critical_s_1_7 + in_critical_s_1_8 + in_critical_s_2_4 + in_critical_s_2_3 + in_critical_s_2_2 + in_critical_s_2_1 + in_critical_s_1_9 + in_critical_s_1_10 + in_critical_s_4_10 + in_critical_s_2_9 + in_critical_s_3_1 + in_critical_s_3_2 + in_critical_s_3_3 + in_critical_s_3_4 + in_critical_s_3_5 + in_critical_s_3_6 + in_critical_s_3_7 + in_critical_s_3_8 + in_critical_s_3_9 + 1 <= pr_released_4 + pr_released_5 + pr_released_3 + pr_released_2 + pr_released_1)))) : E (F (((pr_released_4 + pr_released_5 + pr_released_3 + pr_released_2 + pr_released_1 <= 2) AND (Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6 + Resources_7 + Resources_8 + Resources_9 + Resources_10 <= 2) AND ((2 <= pr_in_1 + pr_in_2 + pr_in_3 + pr_in_4 + pr_in_5) OR (2 <= Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6 + Resources_7 + Resources_8 + Resources_9 + Resources_10)) AND ((pr_released_4 + pr_released_5 + pr_released_3 + pr_released_2 + pr_released_1 <= pr_in_1 + pr_in_2 + pr_in_3 + pr_in_4 + pr_in_5) OR (2 <= pr_released_4 + pr_released_5 + pr_released_3 + pr_released_2 + pr_released_1))))) : A (G (((2 <= pr_in_1 + pr_in_2 + pr_in_3 + pr_in_4 + pr_in_5) OR (pr_in_1 + pr_in_2 + pr_in_3 + pr_in_4 + pr_in_5 <= Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6 + Resources_7 + Resources_8 + Resources_9 + Resources_10)))) : A (G (((in_critical_s_4_1 + in_critical_s_4_2 + in_critical_s_4_3 + in_critical_s_4_4 + in_critical_s_4_5 + in_critical_s_4_6 + in_critical_s_4_7 + in_critical_s_4_8 + in_critical_s_4_9 + in_critical_s_5_1 + in_critical_s_5_2 + in_critical_s_5_3 + in_critical_s_5_4 + in_critical_s_5_5 + in_critical_s_5_6 + in_critical_s_5_7 + in_critical_s_5_8 + in_critical_s_5_9 + in_critical_s_5_10 + in_critical_s_2_8 + in_critical_s_2_7 + in_critical_s_3_10 + in_critical_s_2_10 + in_critical_s_2_6 + in_critical_s_2_5 + in_critical_s_1_1 + in_critical_s_1_2 + in_critical_s_1_3 + in_critical_s_1_4 + in_critical_s_1_5 + in_critical_s_1_6 + in_critical_s_1_7 + in_critical_s_1_8 + in_critical_s_2_4 + in_critical_s_2_3 + in_critical_s_2_2 + in_critical_s_2_1 + in_critical_s_1_9 + in_critical_s_1_10 + in_critical_s_4_10 + in_critical_s_2_9 + in_critical_s_3_1 + in_critical_s_3_2 + in_critical_s_3_3 + in_critical_s_3_4 + in_critical_s_3_5 + in_critical_s_3_6 + in_critical_s_3_7 + in_critical_s_3_8 + in_critical_s_3_9 + 1 <= pr_released_4 + pr_released_5 + pr_released_3 + pr_released_2 + pr_released_1) OR (Processes_1 + Processes_2 + Processes_3 + Processes_4 + Processes_5 <= 2) OR (Processes_1 + Processes_2 + Processes_3 + Processes_4 + Processes_5 <= in_critical_s_4_1 + in_critical_s_4_2 + in_critical_s_4_3 + in_critical_s_4_4 + in_critical_s_4_5 + in_critical_s_4_6 + in_critical_s_4_7 + in_critical_s_4_8 + in_critical_s_4_9 + in_critical_s_5_1 + in_critical_s_5_2 + in_critical_s_5_3 + in_critical_s_5_4 + in_critical_s_5_5 + in_critical_s_5_6 + in_critical_s_5_7 + in_critical_s_5_8 + in_critical_s_5_9 + in_critical_s_5_10 + in_critical_s_2_8 + in_critical_s_2_7 + in_critical_s_3_10 + in_critical_s_2_10 + in_critical_s_2_6 + in_critical_s_2_5 + in_critical_s_1_1 + in_critical_s_1_2 + in_critical_s_1_3 + in_critical_s_1_4 + in_critical_s_1_5 + in_critical_s_1_6 + in_critical_s_1_7 + in_critical_s_1_8 + in_critical_s_2_4 + in_critical_s_2_3 + in_critical_s_2_2 + in_critical_s_2_1 + in_critical_s_1_9 + in_critical_s_1_10 + in_critical_s_4_10 + in_critical_s_2_9 + in_critical_s_3_1 + in_critical_s_3_2 + in_critical_s_3_3 + in_critical_s_3_4 + in_critical_s_3_5 + in_critical_s_3_6 + in_critical_s_3_7 + in_critical_s_3_8 + in_critical_s_3_9) OR (1 <= Processes_1 + Processes_2 + Processes_3 + Processes_4 + Processes_5)))) : A (G (((in_critical_s_4_1 + in_critical_s_4_2 + in_critical_s_4_3 + in_critical_s_4_4 + in_critical_s_4_5 + in_critical_s_4_6 + in_critical_s_4_7 + in_critical_s_4_8 + in_critical_s_4_9 + in_critical_s_5_1 + in_critical_s_5_2 + in_critical_s_5_3 + in_critical_s_5_4 + in_critical_s_5_5 + in_critical_s_5_6 + in_critical_s_5_7 + in_critical_s_5_8 + in_critical_s_5_9 + in_critical_s_5_10 + in_critical_s_2_8 + in_critical_s_2_7 + in_critical_s_3_10 + in_critical_s_2_10 + in_critical_s_2_6 + in_critical_s_2_5 + in_critical_s_1_1 + in_critical_s_1_2 + in_critical_s_1_3 + in_critical_s_1_4 + in_critical_s_1_5 + in_critical_s_1_6 + in_critical_s_1_7 + in_critical_s_1_8 + in_critical_s_2_4 + in_critical_s_2_3 + in_critical_s_2_2 + in_critical_s_2_1 + in_critical_s_1_9 + in_critical_s_1_10 + in_critical_s_4_10 + in_critical_s_2_9 + in_critical_s_3_1 + in_critical_s_3_2 + in_critical_s_3_3 + in_critical_s_3_4 + in_critical_s_3_5 + in_critical_s_3_6 + in_critical_s_3_7 + in_critical_s_3_8 + in_critical_s_3_9 <= 2) OR ((2 <= Processes_1 + Processes_2 + Processes_3 + Processes_4 + Processes_5) AND (3 <= Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6 + Resources_7 + Resources_8 + Resources_9 + Resources_10) AND (Processes_1 + Processes_2 + Processes_3 + Processes_4 + Processes_5 <= Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6 + Resources_7 + Resources_8 + Resources_9 + Resources_10))))) : A (G (((pr_in_1 + pr_in_2 + pr_in_3 + pr_in_4 + pr_in_5 + 1 <= Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6 + Resources_7 + Resources_8 + Resources_9 + Resources_10) OR (Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6 + Resources_7 + Resources_8 + Resources_9 + Resources_10 <= 0) OR (3 <= Processes_1 + Processes_2 + Processes_3 + Processes_4 + Processes_5)))) : A (G ((((2 <= pr_in_1 + pr_in_2 + pr_in_3 + pr_in_4 + pr_in_5) AND (1 <= Processes_1 + Processes_2 + Processes_3 + Processes_4 + Processes_5)) OR ((3 <= pr_in_1 + pr_in_2 + pr_in_3 + pr_in_4 + pr_in_5) AND (2 <= Processes_1 + Processes_2 + Processes_3 + Processes_4 + Processes_5)) OR (2 <= Processes_1 + Processes_2 + Processes_3 + Processes_4 + Processes_5) OR (Processes_1 + Processes_2 + Processes_3 + Processes_4 + Processes_5 <= in_critical_s_4_1 + in_critical_s_4_2 + in_critical_s_4_3 + in_critical_s_4_4 + in_critical_s_4_5 + in_critical_s_4_6 + in_critical_s_4_7 + in_critical_s_4_8 + in_critical_s_4_9 + in_critical_s_5_1 + in_critical_s_5_2 + in_critical_s_5_3 + in_critical_s_5_4 + in_critical_s_5_5 + in_critical_s_5_6 + in_critical_s_5_7 + in_critical_s_5_8 + in_critical_s_5_9 + in_critical_s_5_10 + in_critical_s_2_8 + in_critical_s_2_7 + in_critical_s_3_10 + in_critical_s_2_10 + in_critical_s_2_6 + in_critical_s_2_5 + in_critical_s_1_1 + in_critical_s_1_2 + in_critical_s_1_3 + in_critical_s_1_4 + in_critical_s_1_5 + in_critical_s_1_6 + in_critical_s_1_7 + in_critical_s_1_8 + in_critical_s_2_4 + in_critical_s_2_3 + in_critical_s_2_2 + in_critical_s_2_1 + in_critical_s_1_9 + in_critical_s_1_10 + in_critical_s_4_10 + in_critical_s_2_9 + in_critical_s_3_1 + in_critical_s_3_2 + in_critical_s_3_3 + in_critical_s_3_4 + in_critical_s_3_5 + in_critical_s_3_6 + in_critical_s_3_7 + in_critical_s_3_8 + in_critical_s_3_9) OR (Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6 + Resources_7 + Resources_8 + Resources_9 + Resources_10 <= 2)))) : A (G ((1 <= Processes_1 + Processes_2 + Processes_3 + Processes_4 + Processes_5))) : A (G (((pr_released_4 + pr_released_5 + pr_released_3 + pr_released_2 + pr_released_1 <= 2) OR (pr_in_1 + pr_in_2 + pr_in_3 + pr_in_4 + pr_in_5 <= 2) OR (Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6 + Resources_7 + Resources_8 + Resources_9 + Resources_10 <= 0)))) : A (G ((2 <= Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6 + Resources_7 + Resources_8 + Resources_9 + Resources_10))) : A (G ((2 <= Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6 + Resources_7 + Resources_8 + Resources_9 + Resources_10))) : E (F (())) : E (F (((pr_released_4 + pr_released_5 + pr_released_3 + pr_released_2 + pr_released_1 + 1 <= in_critical_s_4_1 + in_critical_s_4_2 + in_critical_s_4_3 + in_critical_s_4_4 + in_critical_s_4_5 + in_critical_s_4_6 + in_critical_s_4_7 + in_critical_s_4_8 + in_critical_s_4_9 + in_critical_s_5_1 + in_critical_s_5_2 + in_critical_s_5_3 + in_critical_s_5_4 + in_critical_s_5_5 + in_critical_s_5_6 + in_critical_s_5_7 + in_critical_s_5_8 + in_critical_s_5_9 + in_critical_s_5_10 + in_critical_s_2_8 + in_critical_s_2_7 + in_critical_s_3_10 + in_critical_s_2_10 + in_critical_s_2_6 + in_critical_s_2_5 + in_critical_s_1_1 + in_critical_s_1_2 + in_critical_s_1_3 + in_critical_s_1_4 + in_critical_s_1_5 + in_critical_s_1_6 + in_critical_s_1_7 + in_critical_s_1_8 + in_critical_s_2_4 + in_critical_s_2_3 + in_critical_s_2_2 + in_critical_s_2_1 + in_critical_s_1_9 + in_critical_s_1_10 + in_critical_s_4_10 + in_critical_s_2_9 + in_critical_s_3_1 + in_critical_s_3_2 + in_critical_s_3_3 + in_critical_s_3_4 + in_critical_s_3_5 + in_critical_s_3_6 + in_critical_s_3_7 + in_critical_s_3_8 + in_critical_s_3_9) AND (Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6 + Resources_7 + Resources_8 + Resources_9 + Resources_10 <= pr_in_1 + pr_in_2 + pr_in_3 + pr_in_4 + pr_in_5) AND ((pr_in_1 + pr_in_2 + pr_in_3 + pr_in_4 + pr_in_5 + 1 <= in_critical_s_4_1 + in_critical_s_4_2 + in_critical_s_4_3 + in_critical_s_4_4 + in_critical_s_4_5 + in_critical_s_4_6 + in_critical_s_4_7 + in_critical_s_4_8 + in_critical_s_4_9 + in_critical_s_5_1 + in_critical_s_5_2 + in_critical_s_5_3 + in_critical_s_5_4 + in_critical_s_5_5 + in_critical_s_5_6 + in_critical_s_5_7 + in_critical_s_5_8 + in_critical_s_5_9 + in_critical_s_5_10 + in_critical_s_2_8 + in_critical_s_2_7 + in_critical_s_3_10 + in_critical_s_2_10 + in_critical_s_2_6 + in_critical_s_2_5 + in_critical_s_1_1 + in_critical_s_1_2 + in_critical_s_1_3 + in_critical_s_1_4 + in_critical_s_1_5 + in_critical_s_1_6 + in_critical_s_1_7 + in_critical_s_1_8 + in_critical_s_2_4 + in_critical_s_2_3 + in_critical_s_2_2 + in_critical_s_2_1 + in_critical_s_1_9 + in_critical_s_1_10 + in_critical_s_4_10 + in_critical_s_2_9 + in_critical_s_3_1 + in_critical_s_3_2 + in_critical_s_3_3 + in_critical_s_3_4 + in_critical_s_3_5 + in_critical_s_3_6 + in_critical_s_3_7 + in_critical_s_3_8 + in_critical_s_3_9) OR ((3 <= pr_in_1 + pr_in_2 + pr_in_3 + pr_in_4 + pr_in_5) AND (Processes_1 + Processes_2 + Processes_3 + Processes_4 + Processes_5 <= pr_released_4 + pr_released_5 + pr_released_3 + pr_released_2 + pr_released_1)))))) : A (G (TRUE)) : E (F (((Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6 + Resources_7 + Resources_8 + Resources_9 + Resources_10 <= 2) AND ((1 <= pr_in_1 + pr_in_2 + pr_in_3 + pr_in_4 + pr_in_5) OR (3 <= pr_released_4 + pr_released_5 + pr_released_3 + pr_released_2 + pr_released_1)) AND (3 <= pr_in_1 + pr_in_2 + pr_in_3 + pr_in_4 + pr_in_5)))) : A (G (()))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((in_critical_s_4_1 + in_critical_s_4_2 + in_critical_s_4_3 + in_critical_s_4_4 + in_critical_s_4_5 + in_critical_s_4_6 + in_critical_s_4_7 + in_critical_s_4_8 + in_critical_s_4_9 + in_critical_s_5_1 + in_critical_s_5_2 + in_critical_s_5_3 + in_critical_s_5_4 + in_critical_s_5_5 + in_critical_s_5_6 + in_critical_s_5_7 + in_critical_s_5_8 + in_critical_s_5_9 + in_critical_s_5_10 + 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 (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GlobalResAllocation-COL-05-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-05-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((pr_released_4 + pr_released_5 + pr_released_3 + pr_released_2 + pr_released_1 <= 2) AND (Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6 + Resources_7 + Resources_8 + Resources_9 + Resources_10 <= 2) AND ((2 <= pr_in_1 + pr_in_2 + pr_in_3 + pr_in_4 + pr_in_5) OR (2 <= Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6 + Reso... (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 (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 16 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to GlobalResAllocation-COL-05-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-05-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= pr_in_1 + pr_in_2 + pr_in_3 + pr_in_4 + pr_in_5) OR (pr_in_1 + pr_in_2 + pr_in_3 + pr_in_4 + pr_in_5 <= Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6 + Resources_7 + Resources_8 + Resources_9 + Resources_10))))
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 (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GlobalResAllocation-COL-05-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-05-ReachabilityCardinality-2.sara.
lola: sara is running 0 secs || 20 markings, 19 edges, 4 markings/sec, 0 secs
lola: sara is running 5 secs || 113 markings, 168 edges, 19 markings/sec, 5 secs
lola: sara is running 10 secs || 494 markings, 655 edges, 76 markings/sec, 10 secs
lola: sara is running 15 secs || 957 markings, 1250 edges, 93 markings/sec, 15 secs
lola: sara is running 20 secs || 1401 markings, 1828 edges, 89 markings/sec, 20 secs
lola: sara is running 25 secs || 1849 markings, 2414 edges, 90 markings/sec, 25 secs
lola: sara is running 30 secs || 2364 markings, 3069 edges, 103 markings/sec, 30 secs
lola: sara is running 35 secs || 2806 markings, 3639 edges, 88 markings/sec, 35 secs
lola: sara is running 40 secs || 3215 markings, 4174 edges, 82 markings/sec, 40 secs
lola: sara is running 45 secs || 3669 markings, 4744 edges, 91 markings/sec, 45 secs
lola: sara is running 50 secs || 4123 markings, 5318 edges, 91 markings/sec, 50 secs
lola: sara is running 55 secs || 4560 markings, 5878 edges, 87 markings/sec, 55 secs
lola: sara is running 60 secs || 4995 markings, 6433 edges, 87 markings/sec, 60 secs
lola: sara is running 65 secs || 5471 markings, 7017 edges, 95 markings/sec, 65 secs
lola: sara is running 70 secs || 5892 markings, 7528 edges, 84 markings/sec, 70 secs
lola: sara is running 75 secs || 6314 markings, 8058 edges, 84 markings/sec, 75 secs
lola: sara is running 80 secs || 6749 markings, 8591 edges, 87 markings/sec, 80 secs
lola: sara is running 85 secs || 7143 markings, 9091 edges, 79 markings/sec, 85 secs
lola: sara is running 90 secs || 7603 markings, 9670 edges, 92 markings/sec, 90 secs
lola: sara is running 95 secs || 8055 markings, 10230 edges, 90 markings/sec, 95 secs
lola: sara is running 100 secs || 8570 markings, 10862 edges, 103 markings/sec, 100 secs
lola: sara is running 105 secs || 8986 markings, 11404 edges, 83 markings/sec, 105 secs
lola: sara is running 110 secs || 9423 markings, 11985 edges, 87 markings/sec, 110 secs
lola: sara is running 115 secs || 9822 markings, 12503 edges, 80 markings/sec, 115 secs
lola: sara is running 120 secs || 10246 markings, 13018 edges, 85 markings/sec, 120 secs
lola: sara is running 125 secs || 10756 markings, 13694 edges, 102 markings/sec, 125 secs
lola: sara is running 130 secs || 11215 markings, 14280 edges, 92 markings/sec, 130 secs
lola: sara is running 135 secs || 11686 markings, 14849 edges, 94 markings/sec, 135 secs
lola: sara is running 140 secs || 12191 markings, 15520 edges, 101 markings/sec, 140 secs
lola: sara is running 145 secs || 12665 markings, 16136 edges, 95 markings/sec, 145 secs
lola: sara is running 150 secs || 13148 markings, 16731 edges, 97 markings/sec, 150 secs
lola: sara is running 155 secs || 13600 markings, 17313 edges, 90 markings/sec, 155 secs
lola: sara is running 160 secs || 14054 markings, 17912 edges, 91 markings/sec, 160 secs
lola: sara is running 165 secs || 14492 markings, 18477 edges, 88 markings/sec, 165 secs
lola: sara is running 170 secs || 14885 markings, 18971 edges, 79 markings/sec, 170 secs
lola: sara is running 175 secs || 15363 markings, 19590 edges, 96 markings/sec, 175 secs
lola: sara is running 180 secs || 15781 markings, 20111 edges, 84 markings/sec, 180 secs
lola: sara is running 185 secs || 16132 markings, 20529 edges, 70 markings/sec, 185 secs
lola: sara is running 190 secs || 16556 markings, 21076 edges, 85 markings/sec, 190 secs
lola: sara is running 195 secs || 16979 markings, 21652 edges, 85 markings/sec, 195 secs
lola: sara is running 200 secs || 17442 markings, 22262 edges, 93 markings/sec, 200 secs
lola: sara is running 205 secs || 17858 markings, 22768 edges, 83 markings/sec, 205 secs
lola: sara is running 210 secs || 18306 markings, 23346 edges, 90 markings/sec, 210 secs
lola: sara is running 215 secs || 18740 markings, 23915 edges, 87 markings/sec, 215 secs
lola: sara is running 220 secs || 19194 markings, 24498 edges, 91 markings/sec, 220 secs
lola: sara is running 225 secs || 19662 markings, 25113 edges, 94 markings/sec, 225 secs
lola: sara is running 230 secs || 20145 markings, 25758 edges, 97 markings/sec, 230 secs
lola: sara is running 235 secs || 20588 markings, 26326 edges, 89 markings/sec, 235 secs
lola: sara is running 240 secs || 20994 markings, 26842 edges, 81 markings/sec, 240 secs
lola: sara is running 245 secs || 21418 markings, 27367 edges, 85 markings/sec, 245 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((in_critical_s_4_1 + in_critical_s_4_2 + in_critical_s_4_3 + in_critical_s_4_4 + in_critical_s_4_5 + in_critical_s_4_6 + in_critical_s_4_7 + in_critical_s_4_8 + in_critical_s_4_9 + in_critical_s_5_1 + in_critical_s_5_2 + in_critical_s_5_3 + in_critical_s_5_4 + in_critical_s_5_5 + in_critical_s_5_6 + in_critical_s_5_7 + in_critical_s_5_8 + in_critical_s_5_9 + in_critical_s_5_10 + 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 (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GlobalResAllocation-COL-05-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-05-ReachabilityCardinality-3.sara.
lola: sara is running 0 secs || 421 markings, 538 edges, 84 markings/sec, 0 secs
lola: sara is running 5 secs || 1134 markings, 1511 edges, 143 markings/sec, 5 secs
lola: sara is running 10 secs || 1759 markings, 2415 edges, 125 markings/sec, 10 secs
lola: sara is running 15 secs || 2525 markings, 3510 edges, 153 markings/sec, 15 secs
lola: sara is running 20 secs || 3161 markings, 4425 edges, 127 markings/sec, 20 secs
lola: sara is running 25 secs || 3807 markings, 5378 edges, 129 markings/sec, 25 secs
lola: sara is running 30 secs || 4480 markings, 6316 edges, 135 markings/sec, 30 secs
lola: sara is running 35 secs || 5096 markings, 7183 edges, 123 markings/sec, 35 secs
lola: sara is running 40 secs || 5751 markings, 8103 edges, 131 markings/sec, 40 secs
lola: sara is running 45 secs || 6417 markings, 9081 edges, 133 markings/sec, 45 secs
lola: sara is running 50 secs || 7209 markings, 10200 edges, 158 markings/sec, 50 secs
lola: sara is running 55 secs || 7949 markings, 11222 edges, 148 markings/sec, 55 secs
lola: sara is running 60 secs || 8752 markings, 12346 edges, 161 markings/sec, 60 secs
lola: sara is running 65 secs || 9466 markings, 13373 edges, 143 markings/sec, 65 secs
lola: sara is running 70 secs || 10212 markings, 14418 edges, 149 markings/sec, 70 secs
lola: sara is running 75 secs || 10895 markings, 15403 edges, 137 markings/sec, 75 secs
lola: sara is running 80 secs || 11683 markings, 16483 edges, 158 markings/sec, 80 secs
lola: sara is running 85 secs || 12393 markings, 17488 edges, 142 markings/sec, 85 secs
lola: sara is running 90 secs || 13135 markings, 18558 edges, 148 markings/sec, 90 secs
lola: sara is running 95 secs || 13888 markings, 19653 edges, 151 markings/sec, 95 secs
lola: sara is running 100 secs || 14565 markings, 20632 edges, 135 markings/sec, 100 secs
lola: sara is running 105 secs || 15160 markings, 21496 edges, 119 markings/sec, 105 secs
lola: sara is running 110 secs || 15836 markings, 22559 edges, 135 markings/sec, 110 secs
lola: sara is running 115 secs || 16567 markings, 23596 edges, 146 markings/sec, 115 secs
lola: sara is running 120 secs || 17234 markings, 24532 edges, 133 markings/sec, 120 secs
lola: sara is running 125 secs || 18008 markings, 25635 edges, 155 markings/sec, 125 secs
lola: sara is running 130 secs || 18660 markings, 26568 edges, 130 markings/sec, 130 secs
lola: sara is running 135 secs || 19303 markings, 27508 edges, 129 markings/sec, 135 secs
lola: sara is running 140 secs || 19929 markings, 28444 edges, 125 markings/sec, 140 secs
lola: sara is running 145 secs || 20550 markings, 29343 edges, 124 markings/sec, 145 secs
lola: sara is running 150 secs || 21211 markings, 30270 edges, 132 markings/sec, 150 secs
lola: sara is running 155 secs || 21796 markings, 31147 edges, 117 markings/sec, 155 secs
lola: sara is running 160 secs || 22495 markings, 32192 edges, 140 markings/sec, 160 secs
lola: sara is running 165 secs || 23198 markings, 33185 edges, 141 markings/sec, 165 secs
lola: sara is running 170 secs || 23885 markings, 34177 edges, 137 markings/sec, 170 secs
lola: sara is running 175 secs || 24571 markings, 35190 edges, 137 markings/sec, 175 secs
lola: sara is running 180 secs || 25263 markings, 36225 edges, 138 markings/sec, 180 secs
lola: sara is running 185 secs || 26033 markings, 37319 edges, 154 markings/sec, 185 secs
lola: sara is running 190 secs || 26935 markings, 38588 edges, 180 markings/sec, 190 secs
lola: sara is running 195 secs || 27761 markings, 39719 edges, 165 markings/sec, 195 secs
lola: sara is running 200 secs || 28545 markings, 40833 edges, 157 markings/sec, 200 secs
lola: sara is running 205 secs || 29268 markings, 41868 edges, 145 markings/sec, 205 secs
lola: sara is running 210 secs || 30116 markings, 43076 edges, 170 markings/sec, 210 secs
lola: sara is running 215 secs || 30793 markings, 44054 edges, 135 markings/sec, 215 secs
lola: sara is running 220 secs || 31558 markings, 45180 edges, 153 markings/sec, 220 secs
lola: sara is running 225 secs || 32348 markings, 46304 edges, 158 markings/sec, 225 secs
lola: sara is running 230 secs || 33047 markings, 47330 edges, 140 markings/sec, 230 secs
lola: sara is running 235 secs || 33849 markings, 48453 edges, 160 markings/sec, 235 secs
lola: sara is running 240 secs || 34599 markings, 49560 edges, 150 markings/sec, 240 secs
lola: sara is running 245 secs || 35393 markings, 50697 edges, 159 markings/sec, 245 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((in_critical_s_4_1 + in_critical_s_4_2 + in_critical_s_4_3 + in_critical_s_4_4 + in_critical_s_4_5 + in_critical_s_4_6 + in_critical_s_4_7 + in_critical_s_4_8 + in_critical_s_4_9 + in_critical_s_5_1 + in_critical_s_5_2 + in_critical_s_5_3 + in_critical_s_5_4 + in_critical_s_5_5 + in_critical_s_5_6 + in_critical_s_5_7 + in_critical_s_5_8 + in_critical_s_5_9 + in_critical_s_5_10 + 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 (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to GlobalResAllocation-COL-05-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-05-ReachabilityCardinality-4.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 5 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((pr_in_1 + pr_in_2 + pr_in_3 + pr_in_4 + pr_in_5 + 1 <= Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6 + Resources_7 + Resources_8 + Resources_9 + Resources_10) OR (Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6 + Resources_7 + Resources_8 + Resources_9 + Resources_10 <= 0) OR (3 <= Processes_1 + Processes_2 + Processes... (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 (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GlobalResAllocation-COL-05-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-05-ReachabilityCardinality-5.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 6 will run for 302 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((2 <= pr_in_1 + pr_in_2 + pr_in_3 + pr_in_4 + pr_in_5) AND (1 <= Processes_1 + Processes_2 + Processes_3 + Processes_4 + Processes_5)) OR ((3 <= pr_in_1 + pr_in_2 + pr_in_3 + pr_in_4 + pr_in_5) AND (2 <= Processes_1 + Processes_2 + Processes_3 + Processes_4 + Processes_5)) OR (2 <= Processes_1 + Processes_2 + Processes_3 + Processes_4 + Processes_5) OR (Processes_1 + Processes_2 + Proce... (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 (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 20 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to GlobalResAllocation-COL-05-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-05-ReachabilityCardinality-6.sara.
lola: sara is running 0 secs || 26 markings, 27 edges, 5 markings/sec, 0 secs
lola: sara is running 5 secs || 99 markings, 124 edges, 15 markings/sec, 5 secs
lola: sara is running 10 secs || 176 markings, 233 edges, 15 markings/sec, 10 secs
lola: sara is running 15 secs || 256 markings, 345 edges, 16 markings/sec, 15 secs
lola: sara is running 20 secs || 340 markings, 458 edges, 17 markings/sec, 20 secs
lola: sara is running 25 secs || 415 markings, 564 edges, 15 markings/sec, 25 secs
lola: sara is running 30 secs || 474 markings, 648 edges, 12 markings/sec, 30 secs
lola: sara is running 35 secs || 564 markings, 779 edges, 18 markings/sec, 35 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 7 will run for 331 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= Processes_1 + Processes_2 + Processes_3 + Processes_4 + Processes_5)))
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 (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GlobalResAllocation-COL-05-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-05-ReachabilityCardinality-7.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 8 will run for 372 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((pr_released_4 + pr_released_5 + pr_released_3 + pr_released_2 + pr_released_1 <= 2) OR (pr_in_1 + pr_in_2 + pr_in_3 + pr_in_4 + pr_in_5 <= 2) OR (Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6 + Resources_7 + Resources_8 + Resources_9 + Resources_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 220 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GlobalResAllocation-COL-05-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-05-ReachabilityCardinality-8.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 9 will run for 425 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6 + Resources_7 + Resources_8 + Resources_9 + Resources_10)))
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 (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GlobalResAllocation-COL-05-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-05-ReachabilityCardinality-9.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 10 will run for 496 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6 + Resources_7 + Resources_8 + Resources_9 + Resources_10)))
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 (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GlobalResAllocation-COL-05-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-05-ReachabilityCardinality-10.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 595 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (()))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 3 rewrites
lola: formula mentions 0 of 75 places; total mentions: 0
lola: closed formula file GlobalResAllocation-COL-05-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 12 will run for 744 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((pr_released_4 + pr_released_5 + pr_released_3 + pr_released_2 + pr_released_1 + 1 <= in_critical_s_4_1 + in_critical_s_4_2 + in_critical_s_4_3 + in_critical_s_4_4 + in_critical_s_4_5 + in_critical_s_4_6 + in_critical_s_4_7 + in_critical_s_4_8 + in_critical_s_4_9 + in_critical_s_5_1 + in_critical_s_5_2 + in_critical_s_5_3 + in_critical_s_5_4 + in_critical_s_5_5 + in_critical_s_5_6 + in_crit... (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 (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 7 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to GlobalResAllocation-COL-05-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-05-ReachabilityCardinality-12.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 991 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 3 rewrites
lola: formula mentions 0 of 75 places; total mentions: 0
lola: closed formula file GlobalResAllocation-COL-05-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 14 will run for 1487 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6 + Resources_7 + Resources_8 + Resources_9 + Resources_10 <= 2) AND ((1 <= pr_in_1 + pr_in_2 + pr_in_3 + pr_in_4 + pr_in_5) OR (3 <= pr_released_4 + pr_released_5 + pr_released_3 + pr_released_2 + pr_released_1)) AND (3 <= pr_in_1 + pr_in_2 + pr_in_3 + pr_in_4 + pr_in_5))))
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 (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to GlobalResAllocation-COL-05-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-05-ReachabilityCardinality-14.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 2974 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (()))
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 (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: State predicate is contradiction.
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: RESULT
lola:
SUMMARY: no yes unknown unknown no no no no no no no no yes yes yes yes
lola: ========================================
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494719785812

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

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished 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="GlobalResAllocation-PT-05"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/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/GlobalResAllocation-PT-05.tgz
mv GlobalResAllocation-PT-05 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is 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 r028-blw3-149440264400502"
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 ;