NO Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: undef7}> ((0 + x^0) + y^0)}> Fresh variables: undef7, Undef variables: undef7, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: undef7, x^0 -> ((0 + x^0) + y^0)}> Fresh variables: undef7, Undef variables: undef7, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: undef7, x^0 -> x^0 + y^0, rest remain the same}> Variables: __disjvr_0^0, x^0, y^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.002291 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000613s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001978s Trying to remove transition: undef7, x^0 -> x^0 + y^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006559s Time used: 0.006384 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008477s Time used: 0.007995 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.015154s Time used: 0.015148 LOG: SAT solveNonLinear - Elapsed time: 0.023631s Cost: 1; Total time: 0.023143 Failed at location 2: x^0 <= 0 Before Improving: Quasi-invariant at l2: x^0 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002199s Remaining time after improvement: 0.99905 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: 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: undef7, x^0 -> x^0 + 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: undef7, x^0 -> x^0 + y^0, rest remain the same}> New Graphs: Calling Safety with literal x^0 <= 0 and entry LOG: CALL check - Post:x^0 <= 0 - Process 1 * Exit transition: * Postcondition : x^0 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000347s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000410s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: x^0 <= 0 , Narrowing transition: undef7, x^0 -> x^0 + y^0, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef7, x^0 -> x^0 + y^0, rest remain the same}> Variables: __disjvr_0^0, x^0, y^0 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000566s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001955s Trying to remove transition: undef7, x^0 -> x^0 + y^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005622s Time used: 0.005476 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008705s Time used: 0.008169 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.014249s Time used: 0.014244 LOG: SAT solveNonLinear - Elapsed time: 0.022954s Cost: 1; Total time: 0.022413 Failed at location 2: x^0 + y^0 <= 0 Before Improving: Quasi-invariant at l2: x^0 + y^0 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002265s Remaining time after improvement: 0.998846 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): undef7, x^0 -> x^0 + 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): undef7, x^0 -> x^0 + y^0, rest remain the same}> Ranking function: x^0 New Graphs: Calling Safety with literal x^0 + y^0 <= 0 and entry LOG: CALL check - Post:x^0 + y^0 <= 0 - Process 2 * Exit transition: * Postcondition : x^0 + y^0 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000325s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000401s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: x^0 + y^0 <= 0 , Narrowing transition: undef7, x^0 -> x^0 + y^0, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef7, x^0 -> x^0 + y^0, rest remain the same}> Variables: __disjvr_0^0, x^0, y^0 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000634s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002353s Trying to remove transition: undef7, x^0 -> x^0 + y^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005774s Time used: 0.005611 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010441s Time used: 0.009893 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.015819s Time used: 0.015813 LOG: SAT solveNonLinear - Elapsed time: 0.026260s Cost: 1; Total time: 0.025706 Failed at location 2: 1 + y^0 <= 0 Before Improving: Quasi-invariant at l2: 1 + y^0 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002379s Remaining time after improvement: 0.998829 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: 1 + 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): undef7, x^0 -> x^0 + 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): undef7, x^0 -> x^0 + y^0, rest remain the same}> Ranking function: x^0 New Graphs: Calling Safety with literal 1 + y^0 <= 0 and entry LOG: CALL check - Post:1 + y^0 <= 0 - Process 3 * Exit transition: * Postcondition : 1 + y^0 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000376s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000455s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + y^0 <= 0 , Narrowing transition: undef7, x^0 -> x^0 + y^0, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef7, x^0 -> x^0 + y^0, rest remain the same}> Variables: __disjvr_0^0, x^0, y^0 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000698s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002616s Trying to remove transition: undef7, x^0 -> x^0 + y^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005844s Time used: 0.005674 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010310s Time used: 0.009863 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001159s Time used: 4.00041 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.003434s Time used: 1.00032 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.014422s Time used: 0.007374 Proving non-termination of subgraph 1 Transitions: undef7, x^0 -> x^0 + y^0, rest remain the same}> Variables: __disjvr_0^0, x^0, y^0 Checking that every undef value has an assignment... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001076s Checking conditional non-termination of SCC {l2}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.020347s Time used: 0.02005 Improving Solution with cost 3 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.071148s Time used: 0.071138 LOG: SAT solveNonLinear - Elapsed time: 0.091494s Cost: 3; Total time: 0.091188 Failed at location 2: 1 <= x^0 Before Improving: Quasi-invariant at l2: 1 <= x^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.010076s Remaining time after improvement: 0.99801 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.003521s Number of undef constraints reduced! Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: 1 <= x^0 Strengthening and disabling EXIT transitions... Closed exits from l2: 2 Strengthening exit transition (result): Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef7, x^0 -> x^0 + y^0, rest remain the same}> Checking conditional non-termination of SCC {l2}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.019927s Time used: 0.019643 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.025034s Time used: 0.025026 LOG: SAT solveNonLinear - Elapsed time: 0.044960s Cost: 1; Total time: 0.044669 Failed at location 2: 0 <= y^0 Before Improving: Quasi-invariant at l2: 0 <= y^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.008695s Remaining time after improvement: 0.998165 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.003050s Number of undef constraints reduced! Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: 0 <= y^0 Strengthening and disabling EXIT transitions... Closed exits from l2: 1 Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef7, x^0 -> x^0 + y^0, rest remain the same}> Calling reachability with... Transition: Conditions: 1 <= x^0, 0 <= y^0, OPEN EXITS: (condsUp: 0 <= y^0) --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: 1 <= x^0, 0 <= y^0, OPEN EXITS: > Conditions are reachable! Program does NOT terminate