NO Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: (0 + i3^0)}> (~(1) + j5^0)}> undef88}> 1}> (~(1) + j5^0)}> (1 + i3^0)}> (~(1) + j5^0)}> (1 + i3^0)}> undef221, i3^0 -> (1 + l6^0), j5^0 -> (0 + ir4^0)}> undef242}> undef275}> undef297}> undef339, temp9^0 -> undef341}> 1}> undef374}> (0 + undef487), flag211^0 -> undef487, ir4^0 -> (0 + undef494), k1^0 -> 10, l6^0 -> 1, n2^0 -> undef494}> Fresh variables: undef88, undef221, undef242, undef275, undef297, undef339, undef341, undef374, undef487, undef494, Undef variables: undef88, undef221, undef242, undef275, undef297, undef339, undef341, undef374, undef487, undef494, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: 1}> 1}> 1}> (~(1) + j5^0)}> (0 + i3^0)}> (~(1) + j5^0)}> (~(1) + j5^0), l6^0 -> (0 + i3^0)}> (0 + i3^0)}> (~(1) + j5^0)}> (~(1) + j5^0), l6^0 -> (0 + i3^0)}> (1 + i3^0)}> 1, l6^0 -> (0 + i3^0)}> 1, ir4^0 -> (~(1) + j5^0)}> 1, ir4^0 -> (~(1) + j5^0), l6^0 -> (0 + i3^0)}> (1 + i3^0)}> (~(1) + j5^0)}> (1 + l6^0), j5^0 -> (0 + ir4^0), l6^0 -> (0 + (1 + l6^0))}> (1 + l6^0), ir4^0 -> (~(1) + (0 + ir4^0)), j5^0 -> (0 + ir4^0)}> (1 + l6^0), ir4^0 -> (~(1) + (0 + ir4^0)), j5^0 -> (0 + ir4^0), l6^0 -> (0 + (1 + l6^0))}> (1 + l6^0), j5^0 -> (0 + ir4^0), l6^0 -> (0 + (1 + l6^0))}> (1 + l6^0), ir4^0 -> (~(1) + (0 + ir4^0)), j5^0 -> (0 + ir4^0)}> (1 + l6^0), ir4^0 -> (~(1) + (0 + ir4^0)), j5^0 -> (0 + ir4^0), l6^0 -> (0 + (1 + l6^0))}> (1 + (1 + l6^0)), j5^0 -> (0 + ir4^0)}> (1 + l6^0), j5^0 -> (0 + ir4^0), l6^0 -> (0 + (1 + l6^0))}> (1 + l6^0), ir4^0 -> (~(1) + (0 + ir4^0)), j5^0 -> (0 + ir4^0)}> (1 + l6^0), ir4^0 -> (~(1) + (0 + ir4^0)), j5^0 -> (0 + ir4^0), l6^0 -> (0 + (1 + l6^0))}> (1 + l6^0), j5^0 -> (0 + ir4^0), l6^0 -> (0 + (1 + l6^0))}> (1 + l6^0), ir4^0 -> (~(1) + (0 + ir4^0)), j5^0 -> (0 + ir4^0)}> (1 + l6^0), ir4^0 -> (~(1) + (0 + ir4^0)), j5^0 -> (0 + ir4^0), l6^0 -> (0 + (1 + l6^0))}> (1 + (1 + l6^0)), j5^0 -> (0 + ir4^0)}> (1 + l6^0), j5^0 -> (0 + ir4^0), l6^0 -> (0 + (1 + l6^0))}> (1 + l6^0), ir4^0 -> (~(1) + (0 + ir4^0)), j5^0 -> (0 + ir4^0)}> (1 + l6^0), ir4^0 -> (~(1) + (0 + ir4^0)), j5^0 -> (0 + ir4^0), l6^0 -> (0 + (1 + l6^0))}> (1 + l6^0), j5^0 -> (0 + ir4^0), l6^0 -> (0 + (1 + l6^0))}> (1 + l6^0), ir4^0 -> (~(1) + (0 + ir4^0)), j5^0 -> (0 + ir4^0)}> (1 + l6^0), ir4^0 -> (~(1) + (0 + ir4^0)), j5^0 -> (0 + ir4^0), l6^0 -> (0 + (1 + l6^0))}> (1 + (1 + l6^0)), j5^0 -> (0 + ir4^0)}> (1 + l6^0), j5^0 -> (0 + ir4^0), l6^0 -> (0 + (1 + l6^0))}> (1 + l6^0), ir4^0 -> (~(1) + (0 + ir4^0)), j5^0 -> (0 + ir4^0)}> (1 + l6^0), ir4^0 -> (~(1) + (0 + ir4^0)), j5^0 -> (0 + ir4^0), l6^0 -> (0 + (1 + l6^0))}> (1 + l6^0), j5^0 -> (0 + ir4^0), l6^0 -> (0 + (1 + l6^0))}> (1 + l6^0), ir4^0 -> (~(1) + (0 + ir4^0)), j5^0 -> (0 + ir4^0)}> (1 + l6^0), ir4^0 -> (~(1) + (0 + ir4^0)), j5^0 -> (0 + ir4^0), l6^0 -> (0 + (1 + l6^0))}> (1 + (1 + l6^0)), j5^0 -> (0 + ir4^0)}> Fresh variables: undef88, undef221, undef242, undef275, undef297, undef339, undef341, undef374, undef487, undef494, Undef variables: undef88, undef221, undef242, undef275, undef297, undef339, undef341, undef374, undef487, undef494, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 1, rest remain the same}> 1, rest remain the same}> 1, rest remain the same}> -1 + j5^0, rest remain the same}> i3^0, rest remain the same}> -1 + j5^0, rest remain the same}> -1 + j5^0, l6^0 -> i3^0, rest remain the same}> i3^0, rest remain the same}> -1 + j5^0, rest remain the same}> -1 + j5^0, l6^0 -> i3^0, rest remain the same}> 1 + i3^0, rest remain the same}> 1, l6^0 -> i3^0, rest remain the same}> 1, ir4^0 -> -1 + j5^0, rest remain the same}> 1, ir4^0 -> -1 + j5^0, l6^0 -> i3^0, rest remain the same}> 1 + i3^0, rest remain the same}> -1 + j5^0, rest remain the same}> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> 2 + l6^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> 2 + l6^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> 2 + l6^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> 2 + l6^0, j5^0 -> ir4^0, rest remain the same}> Variables: flag10^0, ir4^0, l6^0, j5^0, flag211^0, i3^0 Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ( 10 , 1 ) ( 12 , 1 ) ( 17 , 1 ) ( 24 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 1.296 Some transition disabled by a set of invariant(s): Invariant at l10: 0 <= flag211^0 Invariant at l12: 0 <= flag211^0 Invariant at l17: 1 + l6^0 <= flag10^0 + ir4^0 Strengthening and disabling transitions... > It's unfeasible. Removing transition: -1 + j5^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + j5^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): i3^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + j5^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + j5^0, l6^0 -> i3^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: i3^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + j5^0, l6^0 -> i3^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + i3^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, l6^0 -> i3^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, ir4^0 -> -1 + j5^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, ir4^0 -> -1 + j5^0, l6^0 -> i3^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + i3^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + j5^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 2 + l6^0, j5^0 -> ir4^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 2 + l6^0, j5^0 -> ir4^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 2 + l6^0, j5^0 -> ir4^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 2 + l6^0, j5^0 -> ir4^0, rest remain the same}> Checking unfeasibility... Time used: 1.17258 Some transition disabled by a set of invariant(s): Invariant at l2: 0 <= flag211^0 Invariant at l10: flag211^0 + j5^0 + l6^0 <= i3^0 + ir4^0 Invariant at l12: flag211^0 + j5^0 + l6^0 <= i3^0 + ir4^0 Invariant at l17: 0 <= flag211^0 Strengthening and disabling transitions... > It's unfeasible. Removing transition: 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + j5^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): i3^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + j5^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + j5^0, l6^0 -> i3^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + i3^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, l6^0 -> i3^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, ir4^0 -> -1 + j5^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, ir4^0 -> -1 + j5^0, l6^0 -> i3^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + i3^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + j5^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 2 + l6^0, j5^0 -> ir4^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 2 + l6^0, j5^0 -> ir4^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 2 + l6^0, j5^0 -> ir4^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 2 + l6^0, j5^0 -> ir4^0, rest remain the same}> Checking unfeasibility... Time used: 1.14005 Some transition disabled by a set of invariant(s): Invariant at l10: flag211^0 <= 0 Invariant at l12: flag211^0 <= 0 Invariant at l17: l6^0 <= 1 + flag211^0 + ir4^0 Strengthening and disabling transitions... > It's unfeasible. Removing transition: i3^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + j5^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + j5^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + j5^0, l6^0 -> i3^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + i3^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, l6^0 -> i3^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, ir4^0 -> -1 + j5^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, ir4^0 -> -1 + j5^0, l6^0 -> i3^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + i3^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + j5^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 2 + l6^0, j5^0 -> ir4^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 2 + l6^0, j5^0 -> ir4^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 2 + l6^0, j5^0 -> ir4^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 2 + l6^0, j5^0 -> ir4^0, rest remain the same}> Checking unfeasibility... Time used: 4.00205 Checking conditional termination of SCC {l2, l10, l12, l17}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.035723s Ranking function: (~(29) / 3)*flag10^0 New Graphs: Transitions: 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> 2 + l6^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> 2 + l6^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> 2 + l6^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> 2 + l6^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> 2 + l6^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> 2 + l6^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> 2 + l6^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> 2 + l6^0, j5^0 -> ir4^0, rest remain the same}> -1 + j5^0, rest remain the same}> 1 + i3^0, rest remain the same}> 1, l6^0 -> i3^0, rest remain the same}> 1, ir4^0 -> -1 + j5^0, rest remain the same}> 1, ir4^0 -> -1 + j5^0, l6^0 -> i3^0, rest remain the same}> 1 + i3^0, rest remain the same}> -1 + j5^0, rest remain the same}> Variables: flag10^0, flag211^0, i3^0, ir4^0, j5^0, l6^0 Checking conditional termination of SCC {l2, l10, l12}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.077413s Ranking function: 1 - flag211^0 New Graphs: Transitions: 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> Variables: flag10^0, flag211^0, i3^0, ir4^0, j5^0, l6^0 Transitions: -1 + j5^0, rest remain the same}> 1 + i3^0, rest remain the same}> 1 + i3^0, rest remain the same}> -1 + j5^0, rest remain the same}> Variables: flag211^0, i3^0, ir4^0, j5^0, l6^0 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.046297s Ranking function: -11 + 20*flag10^0 + 16*ir4^0 - 19*l6^0 New Graphs: Transitions: -1 + j5^0, rest remain the same}> 1 + i3^0, rest remain the same}> 1 + i3^0, rest remain the same}> -1 + j5^0, rest remain the same}> Variables: flag211^0, i3^0, ir4^0, j5^0, l6^0 Transitions: 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> Variables: flag10^0, flag211^0, i3^0, ir4^0, j5^0, l6^0 Checking conditional termination of SCC {l10, l12}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004155s Ranking function: flag211^0 - i3^0 + j5^0 New Graphs: Transitions: 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> Variables: flag10^0, flag211^0, i3^0, ir4^0, j5^0, l6^0 Transitions: 1 + i3^0, rest remain the same}> Variables: flag211^0, i3^0, ir4^0, j5^0, l6^0 Transitions: -1 + j5^0, rest remain the same}> Variables: flag211^0, i3^0, ir4^0, j5^0, l6^0 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.023582s Ranking function: 100 + 23*flag10^0 + (~(25) / 2)*l6^0 New Graphs: Transitions: 1 + i3^0, rest remain the same}> Variables: flag211^0, i3^0, ir4^0, j5^0, l6^0 Transitions: -1 + j5^0, rest remain the same}> Variables: flag211^0, i3^0, ir4^0, j5^0, l6^0 Transitions: 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> Variables: flag10^0, flag211^0, i3^0, ir4^0, j5^0, l6^0 Checking conditional termination of SCC {l12}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000875s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002966s Trying to remove transition: 1 + i3^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011223s Time used: 0.011038 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002932s Time used: 4.00203 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006284s Time used: 4.00016 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.021078s Time used: 1.00178 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.759154s Time used: 0.724677 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.002819s Time used: 1.00274 LOG: SAT solveNonLinear - Elapsed time: 1.761973s Cost: 1; Total time: 1.72742 Termination implied by a set of invariant(s): Invariant at l2: 0 <= 1 + flag211^0 Invariant at l10: j5^0 <= ir4^0 Invariant at l12: j5^0 <= ir4^0 Invariant at l17: l6^0 <= flag211^0 + ir4^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + j5^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + i3^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, l6^0 -> i3^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, ir4^0 -> -1 + j5^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, ir4^0 -> -1 + j5^0, l6^0 -> i3^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + i3^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + j5^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 2 + l6^0, j5^0 -> ir4^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 2 + l6^0, j5^0 -> ir4^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 2 + l6^0, j5^0 -> ir4^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 2 + l6^0, j5^0 -> ir4^0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + i3^0, rest remain the same}> Quasi-ranking function: 50000 - 2*i3^0 - ir4^0 + j5^0 + 2*l6^0 New Graphs: Transitions: -1 + j5^0, rest remain the same}> Variables: flag211^0, i3^0, ir4^0, j5^0, l6^0 Transitions: 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> Variables: flag10^0, flag211^0, i3^0, ir4^0, j5^0, l6^0 Transitions: 1 + i3^0, rest remain the same}> Variables: flag211^0, i3^0, ir4^0, j5^0, l6^0 Checking conditional termination of SCC {l10}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000914s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003170s Trying to remove transition: -1 + j5^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015160s Time used: 0.014952 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.004381s Time used: 4.00345 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.007538s Time used: 4.00006 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.019117s Time used: 1.00004 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.483940s Time used: 1.45079 Termination failed. Trying to show unreachability... Proving unreachability of entry: LOG: CALL check - Post:1 <= 0 - Process 1 * Exit transition: * Postcondition : 1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.019142s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.019317s Cannot prove unreachability Proving non-termination of subgraph 1 Transitions: 1, rest remain the same}> 1, rest remain the same}> 1, rest remain the same}> -1 + j5^0, rest remain the same}> 1 + i3^0, rest remain the same}> 1, l6^0 -> i3^0, rest remain the same}> 1, ir4^0 -> -1 + j5^0, rest remain the same}> 1, ir4^0 -> -1 + j5^0, l6^0 -> i3^0, rest remain the same}> 1 + i3^0, rest remain the same}> -1 + j5^0, rest remain the same}> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> 2 + l6^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> 2 + l6^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> 2 + l6^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> 2 + l6^0, j5^0 -> ir4^0, rest remain the same}> Variables: flag10^0, ir4^0, l6^0, j5^0, flag211^0, i3^0 Checking conditional non-termination of SCC {l2, l10, l12, l17}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.629979s Time used: 0.628418 Improving Solution with cost 2 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.231833s Time used: 0.23182 LOG: SAT solveNonLinear - Elapsed time: 0.861812s Cost: 2; Total time: 0.860238 Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: 0 <= flag10^0 Quasi-invariant at l10: 0 <= flag10^0 + flag211^0 Quasi-invariant at l12: 0 <= flag10^0 Quasi-invariant at l17: 0 <= flag10^0 Strengthening and disabling EXIT transitions... Closed exits from l2: 2 Strengthening exit transition (result): Strengthening exit transition (result): Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + j5^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + i3^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, l6^0 -> i3^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, ir4^0 -> -1 + j5^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, ir4^0 -> -1 + j5^0, l6^0 -> i3^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + i3^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + j5^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 2 + l6^0, j5^0 -> ir4^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 2 + l6^0, j5^0 -> ir4^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 2 + l6^0, j5^0 -> ir4^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 2 + l6^0, j5^0 -> ir4^0, rest remain the same}> Checking conditional non-termination of SCC {l2, l10, l12, l17}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.005538s Time used: 5.00509 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.007952s Time used: 5.00007 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.019863s Time used: 5.00064 > Checking if the negation of the conditions of every pending exit is quasi-invariant... NO Proving non-termination of subgraph 1 Transitions: -1 + j5^0, rest remain the same}> Variables: flag211^0, i3^0, ir4^0, j5^0, l6^0 Checking conditional non-termination of SCC {l10}... > No exit transition to close. Calling reachability with... Transition: Conditions: OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: OPEN EXITS: > Conditions are reachable! Program does NOT terminate