NO Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: (1 + l^0)}> (~(1) + i^0)}> undef256, k^0 -> (1 + k^0)}> undef296, g^0 -> undef299, p^0 -> undef306, r^0 -> undef307, s^0 -> undef308}> undef401, f^0 -> undef404, r^0 -> undef413}> undef444, g^0 -> undef447, p^0 -> 0, s^0 -> (0 + undef444)}> undef483, tmp___5^0 -> (0 + (~(1) * undef483))}> undef503, tmp___5^0 -> (0 + undef503)}> undef510, r^0 -> undef518}> (1 + i^0)}> (1 + iter^0), tmp___2^0 -> (0 + iter^0)}> (1 + m^0)}> ((0 + undef877) + undef878), tmp^0 -> undef877, tmp___0^0 -> undef878, tmp___1^0 -> undef879}> 0}> Fresh variables: undef256, undef296, undef299, undef306, undef307, undef308, undef316, undef401, undef404, undef413, undef444, undef447, undef483, undef503, undef510, undef518, undef877, undef878, undef879, Undef variables: undef256, undef296, undef299, undef306, undef307, undef308, undef316, undef401, undef404, undef413, undef444, undef447, undef483, undef503, undef510, undef518, undef877, undef878, undef879, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: (1 + l^0)}> 0, l^0 -> (1 + l^0)}> (1 + l^0)}> 0, l^0 -> (1 + l^0)}> (1 + l^0)}> 0, l^0 -> (1 + l^0)}> (1 + l^0)}> 0, l^0 -> (1 + l^0)}> (~(1) + i^0)}> (~(1) + i^0), r^0 -> undef307}> (~(1) + i^0), r^0 -> undef307}> (~(1) + i^0), r^0 -> undef413}> (1 + k^0)}> 0}> (1 + i^0)}> undef518}> undef307}> undef307}> undef413}> undef518}> undef307}> undef307}> undef413}> undef518}> undef307}> undef307}> undef413}> undef518}> undef307}> undef307}> undef413}> undef518}> undef307}> undef307}> undef413}> undef518}> undef307}> undef307}> undef413}> (1 + l^0)}> (1 + iter^0), tmp___2^0 -> (0 + iter^0)}> (1 + iter^0), tmp___2^0 -> (0 + iter^0)}> (1 + m^0)}> (1 + m^0)}> 0, l^0 -> (1 + l^0)}> (1 + iter^0), tmp___2^0 -> (0 + iter^0)}> (1 + iter^0), tmp___2^0 -> (0 + iter^0)}> Fresh variables: undef256, undef296, undef299, undef306, undef307, undef308, undef316, undef401, undef404, undef413, undef444, undef447, undef483, undef503, undef510, undef518, undef877, undef878, undef879, Undef variables: undef256, undef296, undef299, undef306, undef307, undef308, undef316, undef401, undef404, undef413, undef444, undef447, undef483, undef503, undef510, undef518, undef877, undef878, undef879, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 1 + i^0, rest remain the same}> Variables: i^0, n^0 Graph 2: Transitions: 0, l^0 -> 1 + l^0, rest remain the same}> 0, l^0 -> 1 + l^0, rest remain the same}> 0, l^0 -> 1 + l^0, rest remain the same}> 0, l^0 -> 1 + l^0, rest remain the same}> -1 + i^0, rest remain the same}> -1 + i^0, r^0 -> undef307, rest remain the same}> -1 + i^0, r^0 -> undef307, rest remain the same}> -1 + i^0, r^0 -> undef413, rest remain the same}> 1 + k^0, rest remain the same}> undef518, rest remain the same}> undef307, rest remain the same}> undef307, rest remain the same}> undef413, rest remain the same}> undef518, rest remain the same}> undef307, rest remain the same}> undef307, rest remain the same}> undef413, rest remain the same}> undef518, rest remain the same}> undef307, rest remain the same}> undef307, rest remain the same}> undef413, rest remain the same}> undef518, rest remain the same}> undef307, rest remain the same}> undef307, rest remain the same}> undef413, rest remain the same}> undef518, rest remain the same}> undef307, rest remain the same}> undef307, rest remain the same}> undef413, rest remain the same}> undef518, rest remain the same}> undef307, rest remain the same}> undef307, rest remain the same}> undef413, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + m^0, rest remain the same}> 1 + m^0, rest remain the same}> 0, l^0 -> 1 + l^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> Variables: l^0, m^0, n^0, r^0, i^0, k^0, tmp___2^0, iter^0 Graph 3: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 0, rest remain the same}> Graph 3 1 + l^0, rest remain the same}> 1 + l^0, rest remain the same}> 1 + l^0, rest remain the same}> 1 + l^0, rest remain the same}> 1 + l^0, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 7 , 2 ) ( 11 , 2 ) ( 19 , 1 ) ( 20 , 2 ) ( 25 , 2 ) ( 28 , 3 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.001847 Checking conditional termination of SCC {l19}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001373s Ranking function: -i^0 + n^0 New Graphs: Proving termination of subgraph 2 Checking unfeasibility... Time used: 1.27851 Some transition disabled by a set of invariant(s): Invariant at l7: l^0 <= n^0 Invariant at l11: l^0 <= n^0 Invariant at l20: l^0 <= n^0 Invariant at l25: l^0 <= n^0 Strengthening and disabling transitions... > It's unfeasible. Removing transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, l^0 -> 1 + l^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): 0, l^0 -> 1 + l^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): 0, l^0 -> 1 + l^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): 0, l^0 -> 1 + l^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 + i^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + i^0, r^0 -> undef307, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + i^0, r^0 -> undef307, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + i^0, r^0 -> undef413, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + k^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef518, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef307, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef307, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef413, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef518, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef307, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef307, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef413, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef518, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef307, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef307, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef413, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef518, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef307, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef307, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef413, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef518, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef307, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef307, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef413, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef518, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef307, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef307, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef413, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + m^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + m^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, l^0 -> 1 + l^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> Checking unfeasibility... Time used: 1.09336 Checking conditional termination of SCC {l7, l11, l20, l25}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.062021s Ranking function: -38 - 35*l^0 - 3*m^0 + 38*n^0 New Graphs: Transitions: -1 + i^0, rest remain the same}> -1 + i^0, r^0 -> undef307, rest remain the same}> -1 + i^0, r^0 -> undef307, rest remain the same}> -1 + i^0, r^0 -> undef413, rest remain the same}> 1 + k^0, rest remain the same}> undef518, rest remain the same}> undef307, rest remain the same}> undef307, rest remain the same}> undef413, rest remain the same}> undef518, rest remain the same}> undef307, rest remain the same}> undef307, rest remain the same}> undef413, rest remain the same}> undef518, rest remain the same}> undef307, rest remain the same}> undef307, rest remain the same}> undef413, rest remain the same}> undef518, rest remain the same}> undef307, rest remain the same}> undef307, rest remain the same}> undef413, rest remain the same}> undef518, rest remain the same}> undef307, rest remain the same}> undef307, rest remain the same}> undef413, rest remain the same}> undef518, rest remain the same}> undef307, rest remain the same}> undef307, rest remain the same}> undef413, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + m^0, rest remain the same}> 1 + m^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> Variables: i^0, iter^0, k^0, l^0, m^0, n^0, r^0, tmp___2^0 Checking conditional termination of SCC {l7, l11, l20, l25}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.043545s Ranking function: -35 + 35*i^0 - 35*l^0 New Graphs: Transitions: -1 + i^0, rest remain the same}> 1 + k^0, rest remain the same}> undef518, rest remain the same}> undef307, rest remain the same}> undef307, rest remain the same}> undef413, rest remain the same}> undef518, rest remain the same}> undef307, rest remain the same}> undef307, rest remain the same}> undef413, rest remain the same}> undef518, rest remain the same}> undef307, rest remain the same}> undef307, rest remain the same}> undef413, rest remain the same}> undef518, rest remain the same}> undef307, rest remain the same}> undef307, rest remain the same}> undef413, rest remain the same}> undef518, rest remain the same}> undef307, rest remain the same}> undef307, rest remain the same}> undef413, rest remain the same}> undef518, rest remain the same}> undef307, rest remain the same}> undef307, rest remain the same}> undef413, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + m^0, rest remain the same}> 1 + m^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> Variables: i^0, iter^0, k^0, l^0, m^0, n^0, r^0, tmp___2^0 Checking conditional termination of SCC {l7, l11, l20, l25}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.035618s Ranking function: 2 - k^0 - l^0 + 2*n^0 New Graphs: Transitions: undef518, rest remain the same}> -1 + i^0, r^0 -> undef307, rest remain the same}> -1 + i^0, r^0 -> undef307, rest remain the same}> undef413, rest remain the same}> undef518, rest remain the same}> -1 + i^0, r^0 -> undef307, rest remain the same}> -1 + i^0, r^0 -> undef307, rest remain the same}> undef413, rest remain the same}> undef518, rest remain the same}> -1 + i^0, r^0 -> undef307, rest remain the same}> -1 + i^0, r^0 -> undef307, rest remain the same}> undef413, rest remain the same}> undef518, rest remain the same}> -1 + i^0, r^0 -> undef307, rest remain the same}> -1 + i^0, r^0 -> undef307, rest remain the same}> undef413, rest remain the same}> undef518, rest remain the same}> -1 + i^0, r^0 -> undef307, rest remain the same}> -1 + i^0, r^0 -> undef307, rest remain the same}> undef413, rest remain the same}> undef518, rest remain the same}> -1 + i^0, r^0 -> undef307, rest remain the same}> -1 + i^0, r^0 -> undef307, rest remain the same}> undef413, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + m^0, rest remain the same}> 1 + m^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> Variables: i^0, iter^0, k^0, l^0, m^0, n^0, r^0, tmp___2^0 Checking conditional termination of SCC {l7, l20, l25}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.034462s Ranking function: -34 + i^0 + 34*k^0 - 31*l^0 - 4*n^0 New Graphs: Transitions: undef518, rest remain the same}> undef413, rest remain the same}> undef518, rest remain the same}> undef413, rest remain the same}> undef518, rest remain the same}> undef413, rest remain the same}> undef518, rest remain the same}> undef413, rest remain the same}> undef518, rest remain the same}> undef413, rest remain the same}> undef518, rest remain the same}> undef413, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + m^0, rest remain the same}> 1 + m^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> Variables: i^0, iter^0, l^0, m^0, n^0, r^0, tmp___2^0 Checking conditional termination of SCC {l7, l20, l25}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.018810s Ranking function: -m^0 + n^0 It's unfeasible after collapsing. Removing transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> It's unfeasible after collapsing. Removing transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> It's unfeasible after collapsing. Removing transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> It's unfeasible after collapsing. Removing transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> It's unfeasible after collapsing. Removing transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> It's unfeasible after collapsing. Removing transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> It's unfeasible after collapsing. Removing transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> It's unfeasible after collapsing. Removing transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> It's unfeasible after collapsing. Removing transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> It's unfeasible after collapsing. Removing transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> It's unfeasible after collapsing. Removing transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> It's unfeasible after collapsing. Removing transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> New Graphs: Transitions: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> undef518, rest remain the same}> undef413, rest remain the same}> undef518, rest remain the same}> undef413, rest remain the same}> undef518, rest remain the same}> undef413, rest remain the same}> undef518, rest remain the same}> undef413, rest remain the same}> undef518, rest remain the same}> undef413, rest remain the same}> undef518, rest remain the same}> undef413, rest remain the same}> Variables: i^0, iter^0, l^0, m^0, n^0, r^0, tmp___2^0 Checking conditional termination of SCC {l7, l20}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.022514s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.357577s Trying to remove transition: undef413, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.179218s Time used: 0.176036 Trying to remove transition: undef518, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.192569s Time used: 0.18915 Trying to remove transition: undef413, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.178851s Time used: 0.175394 Trying to remove transition: undef518, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.192092s Time used: 0.188647 Trying to remove transition: undef413, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.084695s Time used: 0.081281 Trying to remove transition: undef518, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.088761s Time used: 0.085667 Trying to remove transition: undef413, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.085057s Time used: 0.081999 Trying to remove transition: undef518, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.089187s Time used: 0.086181 Trying to remove transition: undef413, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.094083s Time used: 0.091033 Trying to remove transition: undef518, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.103489s Time used: 0.100358 Trying to remove transition: undef413, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.092347s Time used: 0.089118 Trying to remove transition: undef518, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.096605s Time used: 0.093444 Trying to remove transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.135827s Time used: 0.132733 Trying to remove transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.236524s Time used: 0.232522 Trying to remove transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.123471s Time used: 0.119165 Trying to remove transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.163552s Time used: 0.159676 Trying to remove transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.196946s Time used: 0.192599 Trying to remove transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.137389s Time used: 0.13325 Trying to remove transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.121375s Time used: 0.117407 Trying to remove transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.145635s Time used: 0.141884 Trying to remove transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.125203s Time used: 0.12133 Trying to remove transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.159828s Time used: 0.156077 Trying to remove transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.135328s Time used: 0.131419 Trying to remove transition: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.182315s Time used: 0.17856 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.004196s Time used: 4.00017 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.023147s Time used: 4.00463 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.884503s Time used: 1.83549 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.092865s Time used: 4.00004 Termination failed. Trying to show unreachability... Proving unreachability of entry: 0, rest remain the same}> LOG: CALL check - Post:1 <= 0 - Process 1 * Exit transition: 0, rest remain the same}> * Postcondition : 1 <= 0 Postcodition moved up: 1 <= 0 LOG: Try proving POST Postcondition: 1 <= 0 LOG: CALL check - Post:1 <= 0 - Process 2 * Exit transition: * Postcondition : 1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.010704s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.010816s LOG: NarrowEntry size 1 Narrowing transition: 1 + i^0, rest remain the same}> LOG: Narrow transition size 1 ENTRIES: END ENTRIES: GRAPH: 1 + i^0, rest remain the same}> END GRAPH: EXIT: 0, rest remain the same}> POST: 1 <= 0 LOG: Try proving POST Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.040802s Time used: 0.040529 Improving Solution with cost 51 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.028431s Time used: 1.02838 LOG: SAT solveNonLinear - Elapsed time: 1.069233s Cost: 51; Total time: 1.0689 Failed at location 19: 1 + n^0 <= i^0 Before Improving: Quasi-invariant at l19: 1 + n^0 <= i^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004378s Remaining time after improvement: 0.997769 Some transition disabled by a set of quasi-invariant(s): Quasi-invariant at l19: 1 + n^0 <= i^0 LOG: NEXT CALL check - disable LOG: CALL check - Post:1 + n^0 <= i^0 - Process 3 * Exit transition: * Postcondition : 1 + n^0 <= i^0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.010119s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.010250s Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.209885s Time used: 0.209555 Improving Solution with cost 51 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.008005s Time used: 1.00795 LOG: SAT solveNonLinear - Elapsed time: 1.217889s Cost: 51; Total time: 1.2175 Failed at location 19: 1 + n^0 <= i^0 Before Improving: Quasi-invariant at l19: 1 + n^0 <= i^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005983s Remaining time after improvement: 0.997638 Some transition disabled by a set of quasi-invariant(s): Quasi-invariant at l19: 1 + n^0 <= i^0 LOG: NEXT CALL check - disable LOG: CALL check - Post:1 + n^0 <= i^0 - Process 4 * Exit transition: * Postcondition : 1 + n^0 <= i^0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.012359s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.012482s Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.000390s Time used: 1.00017 LOG: Postcondition is not implied - no solution > Postcondition is not implied! LOG: RETURN check - Elapsed time: 3.495248s Cannot prove unreachability Proving non-termination of subgraph 2 Transitions: 0, l^0 -> 1 + l^0, rest remain the same}> 0, l^0 -> 1 + l^0, rest remain the same}> 0, l^0 -> 1 + l^0, rest remain the same}> 0, l^0 -> 1 + l^0, rest remain the same}> -1 + i^0, rest remain the same}> -1 + i^0, r^0 -> undef307, rest remain the same}> -1 + i^0, r^0 -> undef307, rest remain the same}> -1 + i^0, r^0 -> undef413, rest remain the same}> 1 + k^0, rest remain the same}> undef518, rest remain the same}> undef307, rest remain the same}> undef307, rest remain the same}> undef413, rest remain the same}> undef518, rest remain the same}> undef307, rest remain the same}> undef307, rest remain the same}> undef413, rest remain the same}> undef518, rest remain the same}> undef307, rest remain the same}> undef307, rest remain the same}> undef413, rest remain the same}> undef518, rest remain the same}> undef307, rest remain the same}> undef307, rest remain the same}> undef413, rest remain the same}> undef518, rest remain the same}> undef307, rest remain the same}> undef307, rest remain the same}> undef413, rest remain the same}> undef518, rest remain the same}> undef307, rest remain the same}> undef307, rest remain the same}> undef413, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + m^0, rest remain the same}> 1 + m^0, rest remain the same}> 0, l^0 -> 1 + l^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> Variables: l^0, m^0, n^0, r^0, i^0, k^0, tmp___2^0, iter^0 Checking conditional non-termination of SCC {l7, l11, l20, l25}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.000475s Time used: 5.00009 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.030633s Time used: 5.00037 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.053693s Time used: 5.0003 > Checking if the negation of the conditions of every pending exit is quasi-invariant... NO Proving non-termination of subgraph 2 Transitions: 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> undef518, rest remain the same}> undef413, rest remain the same}> undef518, rest remain the same}> undef413, rest remain the same}> undef518, rest remain the same}> undef413, rest remain the same}> undef518, rest remain the same}> undef413, rest remain the same}> undef518, rest remain the same}> undef413, rest remain the same}> undef518, rest remain the same}> undef413, rest remain the same}> Variables: i^0, iter^0, l^0, m^0, n^0, r^0, tmp___2^0 Checking conditional non-termination of SCC {l7, l20}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 3.817863s Time used: 3.81755 LOG: SAT solveNonLinear - Elapsed time: 3.817863s Cost: 0; Total time: 3.81755 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.171972s Number of undef constraints reduced! Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l7: 1 + l^0 <= m^0 Quasi-invariant at l20: 1 + l^0 <= m^0 Strengthening and disabling EXIT transitions... Closed exits from l7: 4 Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + iter^0, tmp___2^0 -> iter^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 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + iter^0, tmp___2^0 -> iter^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 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + iter^0, tmp___2^0 -> iter^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 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + iter^0, tmp___2^0 -> iter^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 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef518, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef413, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef518, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef413, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef518, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef413, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef518, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef413, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef518, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef413, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef518, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef413, rest remain the same}> Calling reachability with... Transition: Conditions: OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: 0, rest remain the same}> Conditions: OPEN EXITS: 0, rest remain the same}> (condsUp: l^0 <= n^0) --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: 1 + n^0 <= i^0, l^0 <= n^0, OPEN EXITS: > Conditions are reachable! Program does NOT terminate