NO Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: (1 + l^0)}> (1 + i^0)}> (~(1) + i^0)}> undef313, k^0 -> (1 + k^0)}> undef333, g^0 -> undef336, p^0 -> undef343, r^0 -> undef344, s^0 -> undef345}> undef465, f^0 -> undef468, r^0 -> undef477}> undef510, g^0 -> undef513, p^0 -> 0, s^0 -> (0 + undef510)}> undef550, tmp___5^0 -> (0 + (~(1) * undef550))}> undef571, tmp___5^0 -> (0 + undef571)}> undef579, r^0 -> undef587}> (1 + iter^0), tmp___2^0 -> (0 + iter^0)}> (1 + m^0)}> ((0 + undef941) + undef942), tmp^0 -> undef941, tmp___0^0 -> undef942, tmp___1^0 -> undef943}> 0}> Fresh variables: undef313, undef333, undef336, undef343, undef344, undef345, undef353, undef465, undef468, undef477, undef510, undef513, undef550, undef571, undef579, undef587, undef941, undef942, undef943, Undef variables: undef313, undef333, undef336, undef343, undef344, undef345, undef353, undef465, undef468, undef477, undef510, undef513, undef550, undef571, undef579, undef587, undef941, undef942, undef943, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: 0}> (1 + i^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 + l^0)}> 0, l^0 -> (1 + l^0)}> (~(1) + i^0)}> (~(1) + i^0), r^0 -> undef344}> (~(1) + i^0), r^0 -> undef344}> (~(1) + i^0), r^0 -> undef477}> (1 + k^0)}> (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)}> undef587}> undef344}> undef344}> undef477}> undef587}> undef344}> undef344}> undef477}> undef587}> undef344}> undef344}> undef477}> undef587}> undef344}> undef344}> undef477}> undef587}> undef344}> undef344}> undef477}> undef587}> undef344}> undef344}> undef477}> Fresh variables: undef313, undef333, undef336, undef343, undef344, undef345, undef353, undef465, undef468, undef477, undef510, undef513, undef550, undef571, undef579, undef587, undef941, undef942, undef943, Undef variables: undef313, undef333, undef336, undef343, undef344, undef345, undef353, undef465, undef468, undef477, undef510, undef513, undef550, undef571, undef579, undef587, undef941, undef942, undef943, 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 -> undef344, rest remain the same}> -1 + i^0, r^0 -> undef344, rest remain the same}> -1 + i^0, r^0 -> undef477, rest remain the same}> 1 + k^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 + 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}> undef587, rest remain the same}> undef344, rest remain the same}> undef344, rest remain the same}> undef477, rest remain the same}> undef587, rest remain the same}> undef344, rest remain the same}> undef344, rest remain the same}> undef477, rest remain the same}> undef587, rest remain the same}> undef344, rest remain the same}> undef344, rest remain the same}> undef477, rest remain the same}> undef587, rest remain the same}> undef344, rest remain the same}> undef344, rest remain the same}> undef477, rest remain the same}> undef587, rest remain the same}> undef344, rest remain the same}> undef344, rest remain the same}> undef477, rest remain the same}> undef587, rest remain the same}> undef344, rest remain the same}> undef344, rest remain the same}> undef477, rest remain the same}> Variables: l^0, m^0, n^0, r^0, i^0, k^0, iter^0, tmp___2^0, __const_30^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 ) ( 6 , 1 ) ( 9 , 2 ) ( 13 , 2 ) ( 15 , 2 ) ( 22 , 2 ) ( 28 , 3 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.001895 Checking conditional termination of SCC {l6}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001404s Ranking function: -i^0 + n^0 New Graphs: Proving termination of subgraph 2 Checking unfeasibility... Time used: 1.65305 Some transition disabled by a set of invariant(s): Invariant at l9: l^0 <= n^0 Invariant at l13: l^0 <= n^0 Invariant at l15: l^0 <= n^0 Invariant at l22: 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 -> undef344, 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 -> undef344, 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 -> undef477, 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): 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}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef587, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef344, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef344, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef477, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef587, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef344, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef344, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef477, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef587, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef344, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef344, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef477, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef587, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef344, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef344, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef477, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef587, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef344, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef344, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef477, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef587, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef344, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef344, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef477, rest remain the same}> Checking unfeasibility... Time used: 1.29152 Checking conditional termination of SCC {l9, l13, l15, l22}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.068003s Ranking function: -8 - 5*l^0 - 3*m^0 + 8*n^0 New Graphs: Transitions: -1 + i^0, rest remain the same}> -1 + i^0, r^0 -> undef344, rest remain the same}> -1 + i^0, r^0 -> undef344, rest remain the same}> -1 + i^0, r^0 -> undef477, rest remain the same}> 1 + k^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}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> undef587, rest remain the same}> undef344, rest remain the same}> undef344, rest remain the same}> undef477, rest remain the same}> undef587, rest remain the same}> undef344, rest remain the same}> undef344, rest remain the same}> undef477, rest remain the same}> undef587, rest remain the same}> undef344, rest remain the same}> undef344, rest remain the same}> undef477, rest remain the same}> undef587, rest remain the same}> undef344, rest remain the same}> undef344, rest remain the same}> undef477, rest remain the same}> undef587, rest remain the same}> undef344, rest remain the same}> undef344, rest remain the same}> undef477, rest remain the same}> undef587, rest remain the same}> undef344, rest remain the same}> undef344, rest remain the same}> undef477, rest remain the same}> Variables: __const_30^0, i^0, iter^0, k^0, l^0, m^0, n^0, r^0, tmp___2^0 Checking conditional termination of SCC {l9, l13, l15, l22}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.041300s Ranking function: -5 + 5*i^0 - 5*l^0 New Graphs: Transitions: -1 + i^0, rest remain the same}> 1 + k^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}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}> undef587, rest remain the same}> undef344, rest remain the same}> undef344, rest remain the same}> undef477, rest remain the same}> undef587, rest remain the same}> undef344, rest remain the same}> undef344, rest remain the same}> undef477, rest remain the same}> undef587, rest remain the same}> undef344, rest remain the same}> undef344, rest remain the same}> undef477, rest remain the same}> undef587, rest remain the same}> undef344, rest remain the same}> undef344, rest remain the same}> undef477, rest remain the same}> undef587, rest remain the same}> undef344, rest remain the same}> undef344, rest remain the same}> undef477, rest remain the same}> undef587, rest remain the same}> undef344, rest remain the same}> undef344, rest remain the same}> undef477, rest remain the same}> Variables: __const_30^0, i^0, iter^0, k^0, l^0, m^0, n^0, r^0, tmp___2^0 Checking conditional termination of SCC {l9, l13, l15, l22}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.042539s Ranking function: 2 - 4*k^0 - 2*l^0 + 6*n^0 New Graphs: Transitions: 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}> undef587, rest remain the same}> -1 + i^0, r^0 -> undef344, rest remain the same}> -1 + i^0, r^0 -> undef344, rest remain the same}> undef477, rest remain the same}> undef587, rest remain the same}> -1 + i^0, r^0 -> undef344, rest remain the same}> -1 + i^0, r^0 -> undef344, rest remain the same}> undef477, rest remain the same}> undef587, rest remain the same}> -1 + i^0, r^0 -> undef344, rest remain the same}> -1 + i^0, r^0 -> undef344, rest remain the same}> undef477, rest remain the same}> undef587, rest remain the same}> -1 + i^0, r^0 -> undef344, rest remain the same}> -1 + i^0, r^0 -> undef344, rest remain the same}> undef477, rest remain the same}> undef587, rest remain the same}> -1 + i^0, r^0 -> undef344, rest remain the same}> -1 + i^0, r^0 -> undef344, rest remain the same}> undef477, rest remain the same}> undef587, rest remain the same}> -1 + i^0, r^0 -> undef344, rest remain the same}> -1 + i^0, r^0 -> undef344, rest remain the same}> undef477, rest remain the same}> Variables: __const_30^0, i^0, iter^0, k^0, l^0, m^0, n^0, r^0, tmp___2^0 Checking conditional termination of SCC {l9, l15, l22}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.040652s Ranking function: -6 - 6*l^0 - 7*m^0 + 13*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}> undef587, rest remain the same}> -1 + i^0, r^0 -> undef344, rest remain the same}> -1 + i^0, r^0 -> undef344, rest remain the same}> undef477, rest remain the same}> undef587, rest remain the same}> -1 + i^0, r^0 -> undef344, rest remain the same}> -1 + i^0, r^0 -> undef344, rest remain the same}> undef477, rest remain the same}> undef587, rest remain the same}> -1 + i^0, r^0 -> undef344, rest remain the same}> -1 + i^0, r^0 -> undef344, rest remain the same}> undef477, rest remain the same}> undef587, rest remain the same}> -1 + i^0, r^0 -> undef344, rest remain the same}> -1 + i^0, r^0 -> undef344, rest remain the same}> undef477, rest remain the same}> undef587, rest remain the same}> -1 + i^0, r^0 -> undef344, rest remain the same}> -1 + i^0, r^0 -> undef344, rest remain the same}> undef477, rest remain the same}> undef587, rest remain the same}> -1 + i^0, r^0 -> undef344, rest remain the same}> -1 + i^0, r^0 -> undef344, rest remain the same}> undef477, rest remain the same}> Variables: __const_30^0, i^0, iter^0, k^0, l^0, m^0, n^0, r^0, tmp___2^0 Checking conditional termination of SCC {l9, l22}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.056962s Ranking function: -4 + i^0 + 4*k^0 - 3*l^0 - 2*n^0 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}> undef587, rest remain the same}> undef477, rest remain the same}> undef587, rest remain the same}> undef477, rest remain the same}> undef587, rest remain the same}> undef477, rest remain the same}> undef587, rest remain the same}> undef477, rest remain the same}> undef587, rest remain the same}> undef477, rest remain the same}> undef587, rest remain the same}> undef477, rest remain the same}> Variables: __const_30^0, i^0, iter^0, l^0, m^0, n^0, r^0, tmp___2^0 Checking conditional termination of SCC {l9, l22}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.023870s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.323087s Trying to remove transition: undef477, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.096679s Time used: 0.092985 Trying to remove transition: undef587, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.102163s Time used: 0.098656 Trying to remove transition: undef477, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.095590s Time used: 0.092084 Trying to remove transition: undef587, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.099881s Time used: 0.096492 Trying to remove transition: undef477, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.101583s Time used: 0.098169 Trying to remove transition: undef587, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.130796s Time used: 0.127403 Trying to remove transition: undef477, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.101950s Time used: 0.098301 Trying to remove transition: undef587, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.117694s Time used: 0.114248 Trying to remove transition: undef477, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.102748s Time used: 0.099203 Trying to remove transition: undef587, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.112785s Time used: 0.109367 Trying to remove transition: undef477, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.103428s Time used: 0.099862 Trying to remove transition: undef587, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.113345s Time used: 0.109868 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.119804s Time used: 0.116322 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.224383s Time used: 0.220267 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.118360s Time used: 0.114222 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.215831s Time used: 0.211867 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.176674s Time used: 0.172432 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.192912s Time used: 0.188615 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.162508s Time used: 0.158218 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.184003s Time used: 0.179984 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.133513s Time used: 0.12948 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.140577s Time used: 0.136623 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.185352s Time used: 0.18147 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.209185s Time used: 0.205201 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.004231s Time used: 4.00005 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.024478s Time used: 4.00254 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 2.147732s Time used: 2.09039 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.113826s Time used: 4.00002 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.011560s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.011680s 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.042362s Time used: 0.042088 Improving Solution with cost 51 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.008931s Time used: 1.00893 LOG: SAT solveNonLinear - Elapsed time: 1.051293s Cost: 51; Total time: 1.05102 Failed at location 6: 1 + n^0 <= i^0 Before Improving: Quasi-invariant at l6: 1 + n^0 <= i^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004203s Remaining time after improvement: 0.99784 Some transition disabled by a set of quasi-invariant(s): Quasi-invariant at l6: 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.010789s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.010933s Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.212446s Time used: 0.212113 Improving Solution with cost 51 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.008188s Time used: 1.00817 LOG: SAT solveNonLinear - Elapsed time: 1.220634s Cost: 51; Total time: 1.22029 Failed at location 6: 1 + n^0 <= i^0 Before Improving: Quasi-invariant at l6: 1 + n^0 <= i^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.006277s Remaining time after improvement: 0.997288 Some transition disabled by a set of quasi-invariant(s): Quasi-invariant at l6: 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.012357s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.012493s Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.000242s Time used: 1.00005 LOG: Postcondition is not implied - no solution > Postcondition is not implied! LOG: RETURN check - Elapsed time: 3.484785s 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 -> undef344, rest remain the same}> -1 + i^0, r^0 -> undef344, rest remain the same}> -1 + i^0, r^0 -> undef477, rest remain the same}> 1 + k^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}> undef587, rest remain the same}> undef344, rest remain the same}> undef344, rest remain the same}> undef477, rest remain the same}> undef587, rest remain the same}> undef344, rest remain the same}> undef344, rest remain the same}> undef477, rest remain the same}> undef587, rest remain the same}> undef344, rest remain the same}> undef344, rest remain the same}> undef477, rest remain the same}> undef587, rest remain the same}> undef344, rest remain the same}> undef344, rest remain the same}> undef477, rest remain the same}> undef587, rest remain the same}> undef344, rest remain the same}> undef344, rest remain the same}> undef477, rest remain the same}> undef587, rest remain the same}> undef344, rest remain the same}> undef344, rest remain the same}> undef477, rest remain the same}> Variables: l^0, m^0, n^0, r^0, i^0, k^0, iter^0, tmp___2^0, __const_30^0 Checking conditional non-termination of SCC {l9, l13, l15, l22}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.000225s Time used: 5.00005 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.038346s Time used: 5.00078 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.063737s Time used: 5.00042 > 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}> undef587, rest remain the same}> undef477, rest remain the same}> undef587, rest remain the same}> undef477, rest remain the same}> undef587, rest remain the same}> undef477, rest remain the same}> undef587, rest remain the same}> undef477, rest remain the same}> undef587, rest remain the same}> undef477, rest remain the same}> undef587, rest remain the same}> undef477, rest remain the same}> Variables: __const_30^0, i^0, iter^0, l^0, m^0, n^0, r^0, tmp___2^0 Checking conditional non-termination of SCC {l9, l22}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.189203s Time used: 4.18905 LOG: SAT solveNonLinear - Elapsed time: 4.189203s Cost: 0; Total time: 4.18905 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.175380s Number of undef constraints reduced! Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l9: 1 + l^0 <= m^0 Quasi-invariant at l22: 1 + l^0 <= m^0 Strengthening and disabling EXIT transitions... Closed exits from l9: 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): undef587, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef477, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef587, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef477, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef587, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef477, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef587, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef477, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef587, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef477, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef587, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef477, 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