/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.smt2 /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- NO Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: (1 + l^0)}> (1 + i^0)}> (~(1) + i^0)}> undef298, k^0 -> (1 + k^0)}> undef317, g^0 -> undef320, p^0 -> undef327, r^0 -> undef328, s^0 -> undef329}> undef443, f^0 -> undef446, r^0 -> undef455}> undef486, g^0 -> undef489, p^0 -> 0, s^0 -> (0 + undef486)}> undef525, tmp___5^0 -> (0 + (~(1) * undef525))}> undef545, tmp___5^0 -> (0 + undef545)}> undef552, r^0 -> undef560}> (1 + iter^0), tmp___2^0 -> (0 + iter^0)}> (1 + m^0)}> ((0 + undef898) + undef899), tmp^0 -> undef898, tmp___0^0 -> undef899, tmp___1^0 -> undef900}> 0}> Fresh variables: undef298, undef317, undef320, undef327, undef328, undef329, undef337, undef443, undef446, undef455, undef486, undef489, undef525, undef545, undef552, undef560, undef898, undef899, undef900, Undef variables: undef298, undef317, undef320, undef327, undef328, undef329, undef337, undef443, undef446, undef455, undef486, undef489, undef525, undef545, undef552, undef560, undef898, undef899, undef900, 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 -> undef328}> (~(1) + i^0), r^0 -> undef328}> (~(1) + i^0), r^0 -> undef455}> (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)}> undef560}> undef328}> undef328}> undef455}> undef560}> undef328}> undef328}> undef455}> undef560}> undef328}> undef328}> undef455}> undef560}> undef328}> undef328}> undef455}> undef560}> undef328}> undef328}> undef455}> undef560}> undef328}> undef328}> undef455}> Fresh variables: undef298, undef317, undef320, undef327, undef328, undef329, undef337, undef443, undef446, undef455, undef486, undef489, undef525, undef545, undef552, undef560, undef898, undef899, undef900, Undef variables: undef298, undef317, undef320, undef327, undef328, undef329, undef337, undef443, undef446, undef455, undef486, undef489, undef525, undef545, undef552, undef560, undef898, undef899, undef900, 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 -> undef328, rest remain the same}> -1 + i^0, r^0 -> undef328, rest remain the same}> -1 + i^0, r^0 -> undef455, 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}> undef560, rest remain the same}> undef328, rest remain the same}> undef328, rest remain the same}> undef455, rest remain the same}> undef560, rest remain the same}> undef328, rest remain the same}> undef328, rest remain the same}> undef455, rest remain the same}> undef560, rest remain the same}> undef328, rest remain the same}> undef328, rest remain the same}> undef455, rest remain the same}> undef560, rest remain the same}> undef328, rest remain the same}> undef328, rest remain the same}> undef455, rest remain the same}> undef560, rest remain the same}> undef328, rest remain the same}> undef328, rest remain the same}> undef455, rest remain the same}> undef560, rest remain the same}> undef328, rest remain the same}> undef328, rest remain the same}> undef455, rest remain the same}> Variables: l^0, m^0, n^0, r^0, i^0, k^0, iter^0, tmp___2^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.001769 Checking conditional termination of SCC {l6}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001354s Ranking function: -i^0 + n^0 New Graphs: Proving termination of subgraph 2 Checking unfeasibility... Time used: 1.27474 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 -> undef328, 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 -> undef328, 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 -> undef455, 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): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef560, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef328, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, rest remain the same}> Checking unfeasibility... Time used: 1.56701 Checking conditional termination of SCC {l9, l13, l15, l22}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.055710s 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 -> undef328, rest remain the same}> -1 + i^0, r^0 -> undef328, rest remain the same}> -1 + i^0, r^0 -> undef455, 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}> undef560, rest remain the same}> undef328, rest remain the same}> undef328, rest remain the same}> undef455, rest remain the same}> undef560, rest remain the same}> undef328, rest remain the same}> undef328, rest remain the same}> undef455, rest remain the same}> undef560, rest remain the same}> undef328, rest remain the same}> undef328, rest remain the same}> undef455, rest remain the same}> undef560, rest remain the same}> undef328, rest remain the same}> undef328, rest remain the same}> undef455, rest remain the same}> undef560, rest remain the same}> undef328, rest remain the same}> undef328, rest remain the same}> undef455, rest remain the same}> undef560, rest remain the same}> undef328, rest remain the same}> undef328, rest remain the same}> undef455, 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 {l9, l13, l15, l22}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.039338s 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}> 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}> undef560, rest remain the same}> undef328, rest remain the same}> undef328, rest remain the same}> undef455, rest remain the same}> undef560, rest remain the same}> undef328, rest remain the same}> undef328, rest remain the same}> undef455, rest remain the same}> undef560, rest remain the same}> undef328, rest remain the same}> undef328, rest remain the same}> undef455, rest remain the same}> undef560, rest remain the same}> undef328, rest remain the same}> undef328, rest remain the same}> undef455, rest remain the same}> undef560, rest remain the same}> undef328, rest remain the same}> undef328, rest remain the same}> undef455, rest remain the same}> undef560, rest remain the same}> undef328, rest remain the same}> undef328, rest remain the same}> undef455, 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 {l9, l13, l15, l22}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.036839s Ranking function: 2 - k^0 - l^0 + 2*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}> undef560, rest remain the same}> -1 + i^0, r^0 -> undef328, rest remain the same}> -1 + i^0, r^0 -> undef328, rest remain the same}> undef455, rest remain the same}> undef560, rest remain the same}> -1 + i^0, r^0 -> undef328, rest remain the same}> -1 + i^0, r^0 -> undef328, rest remain the same}> undef455, rest remain the same}> undef560, rest remain the same}> -1 + i^0, r^0 -> undef328, rest remain the same}> -1 + i^0, r^0 -> undef328, rest remain the same}> undef455, rest remain the same}> undef560, rest remain the same}> -1 + i^0, r^0 -> undef328, rest remain the same}> -1 + i^0, r^0 -> undef328, rest remain the same}> undef455, rest remain the same}> undef560, rest remain the same}> -1 + i^0, r^0 -> undef328, rest remain the same}> -1 + i^0, r^0 -> undef328, rest remain the same}> undef455, rest remain the same}> undef560, rest remain the same}> -1 + i^0, r^0 -> undef328, rest remain the same}> -1 + i^0, r^0 -> undef328, rest remain the same}> undef455, 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 {l9, l15, l22}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.040812s Ranking function: -34 - 34*l^0 - 35*m^0 + 69*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}> undef560, rest remain the same}> -1 + i^0, r^0 -> undef328, rest remain the same}> -1 + i^0, r^0 -> undef328, rest remain the same}> undef455, rest remain the same}> undef560, rest remain the same}> -1 + i^0, r^0 -> undef328, rest remain the same}> -1 + i^0, r^0 -> undef328, rest remain the same}> undef455, rest remain the same}> undef560, rest remain the same}> -1 + i^0, r^0 -> undef328, rest remain the same}> -1 + i^0, r^0 -> undef328, rest remain the same}> undef455, rest remain the same}> undef560, rest remain the same}> -1 + i^0, r^0 -> undef328, rest remain the same}> -1 + i^0, r^0 -> undef328, rest remain the same}> undef455, rest remain the same}> undef560, rest remain the same}> -1 + i^0, r^0 -> undef328, rest remain the same}> -1 + i^0, r^0 -> undef328, rest remain the same}> undef455, rest remain the same}> undef560, rest remain the same}> -1 + i^0, r^0 -> undef328, rest remain the same}> -1 + i^0, r^0 -> undef328, rest remain the same}> undef455, 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 {l9, l22}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.048417s Ranking function: -34 + i^0 + 34*k^0 - 33*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}> undef560, rest remain the same}> undef455, rest remain the same}> undef560, rest remain the same}> undef455, rest remain the same}> undef560, rest remain the same}> undef455, rest remain the same}> undef560, rest remain the same}> undef455, rest remain the same}> undef560, rest remain the same}> undef455, rest remain the same}> undef560, rest remain the same}> undef455, 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 {l9, l22}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.021925s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.331420s [24351 : 24448] [24351 : 24449] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.104247s Time used: 4.10018 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 LOG: CALL check - Post:1 <= 0 - Process 2 * Exit transition: * Postcondition : 1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003566s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.003649s 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 [24351 : 24453] [24351 : 24454] [24351 : 24455] LOG: Postcondition is not implied - no solution > Postcondition is not implied! LOG: RETURN check - Elapsed time: 1.288993s Cannot prove unreachability [24351 : 24456] [24351 : 24460] Successful child: 24460 Program does NOT terminate