YES Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: undef2, z^0 -> ((0 + undef2) + z^0)}> (~(1) + x^0), y^0 -> (~(1) + y^0)}> Fresh variables: undef2, Undef variables: undef2, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: undef2, z^0 -> ((0 + undef2) + z^0)}> (~(1) + x^0), y^0 -> (~(1) + y^0)}> Fresh variables: undef2, Undef variables: undef2, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: undef2, z^0 -> z^0 + undef2, rest remain the same}> -1 + x^0, y^0 -> -1 + y^0, rest remain the same}> Variables: x^0, y^0, z^0 Precedence: Graph 0 Graph 1 Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.004098 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001497s Ranking function: x^0 New Graphs: Transitions: undef2, z^0 -> z^0 + undef2, rest remain the same}> Variables: x^0, y^0, z^0 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000731s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002617s Trying to remove transition: undef2, z^0 -> z^0 + undef2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007812s Time used: 0.007617 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012974s Time used: 0.012258 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.021186s Time used: 0.02118 LOG: SAT solveNonLinear - Elapsed time: 0.034160s Cost: 1; Total time: 0.033438 Failed at location 2: 1 + x^0 + z^0 <= 0 Before Improving: Quasi-invariant at l2: 1 + x^0 + z^0 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003530s Remaining time after improvement: 0.998571 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: 1 + x^0 + z^0 <= 0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef2, z^0 -> z^0 + undef2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + x^0, y^0 -> -1 + y^0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef2, z^0 -> z^0 + undef2, rest remain the same}> Ranking function: -3*y^0 + 2*z^0 New Graphs: Calling Safety with literal 1 + x^0 + z^0 <= 0 and entry LOG: CALL check - Post:1 + x^0 + z^0 <= 0 - Process 1 * Exit transition: * Postcondition : 1 + x^0 + z^0 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000323s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000392s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + x^0 + z^0 <= 0 , Narrowing transition: undef2, z^0 -> z^0 + undef2, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + x^0, y^0 -> -1 + y^0, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef2, z^0 -> z^0 + undef2, rest remain the same}> -1 + x^0, y^0 -> -1 + y^0, rest remain the same}> Variables: x^0, y^0, z^0 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001578s Ranking function: x^0 New Graphs: Transitions: undef2, z^0 -> z^0 + undef2, rest remain the same}> Variables: x^0, y^0, z^0 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000752s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003003s Trying to remove transition: undef2, z^0 -> z^0 + undef2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007040s Time used: 0.006867 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012555s Time used: 0.012031 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.017651s Time used: 0.017646 LOG: SAT solveNonLinear - Elapsed time: 0.030207s Cost: 1; Total time: 0.029677 Failed at location 2: 1 + x^0 + z^0 <= y^0 Before Improving: Quasi-invariant at l2: 1 + x^0 + z^0 <= y^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003792s Remaining time after improvement: 0.998309 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: 1 + x^0 + z^0 <= y^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef2, z^0 -> z^0 + undef2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + x^0, y^0 -> -1 + y^0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: undef2, z^0 -> z^0 + undef2, rest remain the same}> New Graphs: Calling Safety with literal 1 + x^0 + z^0 <= y^0 and entry LOG: CALL check - Post:1 + x^0 + z^0 <= y^0 - Process 2 * Exit transition: * Postcondition : 1 + x^0 + z^0 <= y^0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000521s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000608s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + x^0 + z^0 <= y^0 , Narrowing transition: undef2, z^0 -> z^0 + undef2, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + x^0, y^0 -> -1 + y^0, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef2, z^0 -> z^0 + undef2, rest remain the same}> -1 + x^0, y^0 -> -1 + y^0, rest remain the same}> Variables: x^0, y^0, z^0 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001885s Ranking function: x^0 New Graphs: Transitions: undef2, z^0 -> z^0 + undef2, rest remain the same}> Variables: x^0, y^0, z^0 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000855s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003374s Trying to remove transition: undef2, z^0 -> z^0 + undef2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009770s Time used: 0.009591 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013872s Time used: 0.013277 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.024251s Time used: 0.024246 LOG: SAT solveNonLinear - Elapsed time: 0.038123s Cost: 1; Total time: 0.037523 Failed at location 2: 1 + x^0 <= 0 Before Improving: Quasi-invariant at l2: 1 + x^0 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004073s Remaining time after improvement: 0.998081 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: 1 + x^0 <= 0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef2, z^0 -> z^0 + undef2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + x^0, y^0 -> -1 + y^0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef2, z^0 -> z^0 + undef2, rest remain the same}> New Graphs: Calling Safety with literal 1 + x^0 <= 0 and entry LOG: CALL check - Post:1 + x^0 <= 0 - Process 3 * Exit transition: * Postcondition : 1 + x^0 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000609s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000717s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + x^0 <= 0 , Narrowing transition: undef2, z^0 -> z^0 + undef2, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + x^0, y^0 -> -1 + y^0, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef2, z^0 -> z^0 + undef2, rest remain the same}> -1 + x^0, y^0 -> -1 + y^0, rest remain the same}> Variables: x^0, y^0, z^0 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001967s Ranking function: x^0 New Graphs: Transitions: undef2, z^0 -> z^0 + undef2, rest remain the same}> Variables: x^0, y^0, z^0 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000878s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003418s Trying to remove transition: undef2, z^0 -> z^0 + undef2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009754s Time used: 0.009566 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015158s Time used: 0.014519 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.021236s Time used: 0.021231 LOG: SAT solveNonLinear - Elapsed time: 0.036394s Cost: 1; Total time: 0.03575 Failed at location 2: 1 + x^0 + y^0 <= 0 Before Improving: Quasi-invariant at l2: 1 + x^0 + y^0 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005232s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002104s Remaining time after improvement: 0.995102 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: x^0 + y^0 <= 0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef2, z^0 -> z^0 + undef2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + x^0, y^0 -> -1 + y^0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef2, z^0 -> z^0 + undef2, rest remain the same}> Ranking function: x^0 + z^0 New Graphs: Calling Safety with literal x^0 + y^0 <= 0 and entry LOG: CALL check - Post:x^0 + y^0 <= 0 - Process 4 * Exit transition: * Postcondition : x^0 + y^0 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000527s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000646s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: x^0 + y^0 <= 0 , Narrowing transition: undef2, z^0 -> z^0 + undef2, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + x^0, y^0 -> -1 + y^0, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef2, z^0 -> z^0 + undef2, rest remain the same}> -1 + x^0, y^0 -> -1 + y^0, rest remain the same}> Variables: x^0, y^0, z^0 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002172s Ranking function: x^0 + y^0 New Graphs: Program Terminates