YES Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: 0) /\ (0 = arg2), par{arg1 -> 0, arg2 -> 0, arg3 -> 0, arg4 -> 0, arg5 -> 0}> 0) /\ (undef6 > ~(1)) /\ (1 = arg2), par{arg1 -> undef6, arg2 -> 0, arg3 -> 0, arg4 -> 1, arg5 -> 1}> ~(1)) /\ (undef11 > ~(1)) /\ (arg1 > 0) /\ (2 = arg2), par{arg1 -> undef11, arg2 -> 0, arg3 -> undef13, arg4 -> 2, arg5 -> 2}> ~(1)) /\ (arg2 > 2) /\ (undef21 > ~(1)) /\ (undef17 > ~(1)) /\ (arg1 > 0), par{arg1 -> undef16, arg2 -> undef17, arg3 -> (undef21 - undef17), arg4 -> arg2, arg5 -> 3}> arg1) /\ (arg1 > ~(1)) /\ (arg3 > 0) /\ (arg5 >= arg4) /\ (arg4 > ~(1)) /\ (arg1 = arg2), par{arg1 -> (arg1 + 1), arg2 -> (arg1 + 1), arg3 -> (10 - (arg1 + 1))}> 0) /\ (((arg1 + 1) + undef32) >= 1) /\ (arg4 > ~(1)) /\ (arg5 > ~(1)) /\ (arg5 < arg4) /\ (arg1 > ~(1)) /\ (undef32 > ~(1)) /\ (arg1 = arg2), par{arg1 -> ((arg1 + 1) + undef32), arg2 -> ((arg1 + 1) + undef32), arg3 -> (10 - ((arg1 + 1) + undef32)), arg5 -> (arg5 + 1)}> undef33, arg2 -> undef34, arg3 -> undef35, arg4 -> undef36, arg5 -> undef37}> Fresh variables: undef6, undef11, undef13, undef16, undef17, undef21, undef32, undef33, undef34, undef35, undef36, undef37, Undef variables: undef6, undef11, undef13, undef16, undef17, undef21, undef32, undef33, undef34, undef35, undef36, undef37, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: 0) /\ (0 = undef34), par{arg1 -> 0, arg2 -> 0, arg3 -> 0, arg4 -> 0, arg5 -> 0}> 0) /\ (undef6 > ~(1)) /\ (1 = undef34), par{arg1 -> undef6, arg2 -> 0, arg3 -> 0, arg4 -> 1, arg5 -> 1}> ~(1)) /\ (undef11 > ~(1)) /\ (undef33 > 0) /\ (2 = undef34), par{arg1 -> undef11, arg2 -> 0, arg3 -> undef13, arg4 -> 2, arg5 -> 2}> ~(1)) /\ (undef34 > 2) /\ (undef21 > ~(1)) /\ (undef17 > ~(1)) /\ (undef33 > 0), par{arg1 -> undef16, arg2 -> undef17, arg3 -> (undef21 - undef17), arg4 -> undef34, arg5 -> 3}> arg1) /\ (arg1 > ~(1)) /\ (arg3 > 0) /\ (arg5 >= arg4) /\ (arg4 > ~(1)) /\ (arg1 = arg2), par{arg1 -> (arg1 + 1), arg2 -> (arg1 + 1), arg3 -> (10 - (arg1 + 1))}> 0) /\ (((arg1 + 1) + undef32) >= 1) /\ (arg4 > ~(1)) /\ (arg5 > ~(1)) /\ (arg5 < arg4) /\ (arg1 > ~(1)) /\ (undef32 > ~(1)) /\ (arg1 = arg2), par{arg1 -> ((arg1 + 1) + undef32), arg2 -> ((arg1 + 1) + undef32), arg3 -> (10 - ((arg1 + 1) + undef32)), arg5 -> (arg5 + 1)}> Fresh variables: undef6, undef11, undef13, undef16, undef17, undef21, undef32, undef33, undef34, undef35, undef36, undef37, Undef variables: undef6, undef11, undef13, undef16, undef17, undef21, undef32, undef33, undef34, undef35, undef36, undef37, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}> 1 + arg1 + undef32, arg2 -> 1 + arg1 + undef32, arg3 -> 9 - arg1 - undef32, arg5 -> 1 + arg5, rest remain the same}> Variables: arg1, arg2, arg3, arg4, arg5 Precedence: Graph 0 Graph 1 0, arg2 -> 0, arg3 -> 0, arg4 -> 0, arg5 -> 0, rest remain the same}> undef6, arg2 -> 0, arg3 -> 0, arg4 -> 1, arg5 -> 1, rest remain the same}> undef11, arg2 -> 0, arg3 -> undef13, arg4 -> 2, arg5 -> 2, rest remain the same}> undef16, arg2 -> undef17, arg3 -> -undef17 + undef21, arg4 -> undef34, arg5 -> 3, rest remain the same}> 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.013626 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002666s Ranking function: arg4 - arg5 New Graphs: Transitions: 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}> Variables: arg1, arg2, arg3, arg4, arg5 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000835s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003330s Trying to remove transition: 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.987447s Time used: 1.98684 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.040894s Time used: 0.032445 Improving Solution with cost 2 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.567709s Time used: 0.567495 LOG: SAT solveNonLinear - Elapsed time: 0.608603s Cost: 2; Total time: 0.59994 Failed at location 2: arg2 + arg3 <= 0 Failed at location 2: arg2 + arg3 <= 0 Before Improving: Quasi-invariant at l2: arg2 + arg3 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.018744s Remaining time after improvement: 0.997003 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: arg2 + arg3 <= 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: 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + arg1 + undef32, arg2 -> 1 + arg1 + undef32, arg3 -> 9 - arg1 - undef32, arg5 -> 1 + arg5, 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: 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}> New Graphs: Calling Safety with literal arg2 + arg3 <= 0 and entry undef11, arg2 -> 0, arg3 -> undef13, arg4 -> 2, arg5 -> 2, rest remain the same}> LOG: CALL check - Post:arg2 + arg3 <= 0 - Process 1 * Exit transition: undef11, arg2 -> 0, arg3 -> undef13, arg4 -> 2, arg5 -> 2, rest remain the same}> * Postcondition : arg2 + arg3 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000738s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000878s Calling Safety with literal arg2 + arg3 <= 0 and entry undef16, arg2 -> undef17, arg3 -> -undef17 + undef21, arg4 -> undef34, arg5 -> 3, rest remain the same}> LOG: CALL check - Post:arg2 + arg3 <= 0 - Process 2 * Exit transition: undef16, arg2 -> undef17, arg3 -> -undef17 + undef21, arg4 -> undef34, arg5 -> 3, rest remain the same}> * Postcondition : arg2 + arg3 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000667s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000790s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: arg2 + arg3 <= 0 , Narrowing transition: 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + arg1 + undef32, arg2 -> 1 + arg1 + undef32, arg3 -> 9 - arg1 - undef32, arg5 -> 1 + arg5, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}> 1 + arg1 + undef32, arg2 -> 1 + arg1 + undef32, arg3 -> 9 - arg1 - undef32, arg5 -> 1 + arg5, rest remain the same}> Variables: arg1, arg2, arg3, arg4, arg5 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002495s Ranking function: -3 + 3*arg4 - 3*arg5 New Graphs: Transitions: 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}> Variables: arg1, arg2, arg3, arg4, arg5 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000945s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003869s Trying to remove transition: 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 2.191596s Time used: 2.19101 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.035751s Time used: 0.031613 Improving Solution with cost 2 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000568s Time used: 1.00045 LOG: SAT solveNonLinear - Elapsed time: 1.036319s Cost: 2; Total time: 1.03206 Failed at location 2: arg1 + arg3 + arg5 <= 0 Failed at location 2: arg1 + arg3 + arg5 <= 0 Before Improving: Quasi-invariant at l2: arg1 + arg3 + arg5 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.019372s Remaining time after improvement: 0.996995 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: arg1 + arg3 + arg5 <= 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: 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + arg1 + undef32, arg2 -> 1 + arg1 + undef32, arg3 -> 9 - arg1 - undef32, arg5 -> 1 + arg5, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}> New Graphs: Calling Safety with literal arg1 + arg3 + arg5 <= 0 and entry undef11, arg2 -> 0, arg3 -> undef13, arg4 -> 2, arg5 -> 2, rest remain the same}> LOG: CALL check - Post:arg1 + arg3 + arg5 <= 0 - Process 3 * Exit transition: undef11, arg2 -> 0, arg3 -> undef13, arg4 -> 2, arg5 -> 2, rest remain the same}> * Postcondition : arg1 + arg3 + arg5 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000897s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001017s Calling Safety with literal arg1 + arg3 + arg5 <= 0 and entry undef16, arg2 -> undef17, arg3 -> -undef17 + undef21, arg4 -> undef34, arg5 -> 3, rest remain the same}> LOG: CALL check - Post:arg1 + arg3 + arg5 <= 0 - Process 4 * Exit transition: undef16, arg2 -> undef17, arg3 -> -undef17 + undef21, arg4 -> undef34, arg5 -> 3, rest remain the same}> * Postcondition : arg1 + arg3 + arg5 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000798s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000932s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: arg1 + arg3 + arg5 <= 0 , Narrowing transition: 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + arg1 + undef32, arg2 -> 1 + arg1 + undef32, arg3 -> 9 - arg1 - undef32, arg5 -> 1 + arg5, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}> 1 + arg1 + undef32, arg2 -> 1 + arg1 + undef32, arg3 -> 9 - arg1 - undef32, arg5 -> 1 + arg5, rest remain the same}> Variables: arg1, arg2, arg3, arg4, arg5 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002879s Ranking function: arg4 - arg5 New Graphs: Transitions: 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}> Variables: arg1, arg2, arg3, arg4, arg5 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001025s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004749s Trying to remove transition: 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 2.244756s Time used: 2.24412 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.070246s Time used: 0.065824 Improving Solution with cost 2 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.538441s Time used: 0.538383 LOG: SAT solveNonLinear - Elapsed time: 0.608687s Cost: 2; Total time: 0.604207 Failed at location 2: 1 + arg2 <= arg1 Failed at location 2: 1 + arg2 <= arg1 Before Improving: Quasi-invariant at l2: 1 + arg2 <= arg1 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.043046s Remaining time after improvement: 0.996599 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: 1 + arg2 <= arg1 [ 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: 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + arg1 + undef32, arg2 -> 1 + arg1 + undef32, arg3 -> 9 - arg1 - undef32, arg5 -> 1 + arg5, 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: 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}> New Graphs: Calling Safety with literal 1 + arg2 <= arg1 and entry undef11, arg2 -> 0, arg3 -> undef13, arg4 -> 2, arg5 -> 2, rest remain the same}> LOG: CALL check - Post:1 + arg2 <= arg1 - Process 5 * Exit transition: undef11, arg2 -> 0, arg3 -> undef13, arg4 -> 2, arg5 -> 2, rest remain the same}> * Postcondition : 1 + arg2 <= arg1 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001023s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001148s Calling Safety with literal 1 + arg2 <= arg1 and entry undef16, arg2 -> undef17, arg3 -> -undef17 + undef21, arg4 -> undef34, arg5 -> 3, rest remain the same}> LOG: CALL check - Post:1 + arg2 <= arg1 - Process 6 * Exit transition: undef16, arg2 -> undef17, arg3 -> -undef17 + undef21, arg4 -> undef34, arg5 -> 3, rest remain the same}> * Postcondition : 1 + arg2 <= arg1 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000881s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001027s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + arg2 <= arg1 , Narrowing transition: 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + arg1 + undef32, arg2 -> 1 + arg1 + undef32, arg3 -> 9 - arg1 - undef32, arg5 -> 1 + arg5, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}> 1 + arg1 + undef32, arg2 -> 1 + arg1 + undef32, arg3 -> 9 - arg1 - undef32, arg5 -> 1 + arg5, rest remain the same}> Variables: arg1, arg2, arg3, arg4, arg5 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003021s Ranking function: arg4 - arg5 New Graphs: Transitions: 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}> Variables: arg1, arg2, arg3, arg4, arg5 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001042s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004796s Trying to remove transition: 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 2.253024s Time used: 2.25241 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.064181s Time used: 0.059923 Improving Solution with cost 2 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000591s Time used: 1.00047 LOG: SAT solveNonLinear - Elapsed time: 1.064772s Cost: 2; Total time: 1.06039 Failed at location 2: 1 + arg1 <= arg2 Failed at location 2: 1 + arg1 <= arg2 Before Improving: Quasi-invariant at l2: 1 + arg1 <= arg2 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.020502s Remaining time after improvement: 0.996729 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: 1 + arg1 <= arg2 [ 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: 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + arg1 + undef32, arg2 -> 1 + arg1 + undef32, arg3 -> 9 - arg1 - undef32, arg5 -> 1 + arg5, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}> New Graphs: Calling Safety with literal 1 + arg1 <= arg2 and entry undef11, arg2 -> 0, arg3 -> undef13, arg4 -> 2, arg5 -> 2, rest remain the same}> LOG: CALL check - Post:1 + arg1 <= arg2 - Process 7 * Exit transition: undef11, arg2 -> 0, arg3 -> undef13, arg4 -> 2, arg5 -> 2, rest remain the same}> * Postcondition : 1 + arg1 <= arg2 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001015s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001139s Calling Safety with literal 1 + arg1 <= arg2 and entry undef16, arg2 -> undef17, arg3 -> -undef17 + undef21, arg4 -> undef34, arg5 -> 3, rest remain the same}> LOG: CALL check - Post:1 + arg1 <= arg2 - Process 8 * Exit transition: undef16, arg2 -> undef17, arg3 -> -undef17 + undef21, arg4 -> undef34, arg5 -> 3, rest remain the same}> * Postcondition : 1 + arg1 <= arg2 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001122s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001271s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + arg1 <= arg2 , Narrowing transition: 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + arg1 + undef32, arg2 -> 1 + arg1 + undef32, arg3 -> 9 - arg1 - undef32, arg5 -> 1 + arg5, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}> 1 + arg1 + undef32, arg2 -> 1 + arg1 + undef32, arg3 -> 9 - arg1 - undef32, arg5 -> 1 + arg5, rest remain the same}> Variables: arg1, arg2, arg3, arg4, arg5 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003051s Ranking function: arg4 - arg5 New Graphs: Transitions: 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}> Variables: arg1, arg2, arg3, arg4, arg5 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001069s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004760s Trying to remove transition: 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 2.257198s Time used: 2.2566 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.077211s Time used: 0.072293 Improving Solution with cost 2 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.909738s Time used: 0.90963 LOG: SAT solveNonLinear - Elapsed time: 0.986950s Cost: 2; Total time: 0.981923 Failed at location 2: 1 + arg3 <= 0 Failed at location 2: 1 + arg3 <= 0 Before Improving: Quasi-invariant at l2: 1 + arg3 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.020217s Remaining time after improvement: 0.996651 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: 1 + arg3 <= 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: 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + arg1 + undef32, arg2 -> 1 + arg1 + undef32, arg3 -> 9 - arg1 - undef32, arg5 -> 1 + arg5, 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: 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}> New Graphs: Calling Safety with literal 1 + arg3 <= 0 and entry undef11, arg2 -> 0, arg3 -> undef13, arg4 -> 2, arg5 -> 2, rest remain the same}> LOG: CALL check - Post:1 + arg3 <= 0 - Process 9 * Exit transition: undef11, arg2 -> 0, arg3 -> undef13, arg4 -> 2, arg5 -> 2, rest remain the same}> * Postcondition : 1 + arg3 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001025s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001155s Calling Safety with literal 1 + arg3 <= 0 and entry undef16, arg2 -> undef17, arg3 -> -undef17 + undef21, arg4 -> undef34, arg5 -> 3, rest remain the same}> LOG: CALL check - Post:1 + arg3 <= 0 - Process 10 * Exit transition: undef16, arg2 -> undef17, arg3 -> -undef17 + undef21, arg4 -> undef34, arg5 -> 3, rest remain the same}> * Postcondition : 1 + arg3 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000956s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001102s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + arg3 <= 0 , Narrowing transition: 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + arg1 + undef32, arg2 -> 1 + arg1 + undef32, arg3 -> 9 - arg1 - undef32, arg5 -> 1 + arg5, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}> 1 + arg1 + undef32, arg2 -> 1 + arg1 + undef32, arg3 -> 9 - arg1 - undef32, arg5 -> 1 + arg5, rest remain the same}> Variables: arg1, arg2, arg3, arg4, arg5 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003085s Ranking function: arg4 - arg5 New Graphs: Transitions: 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}> Variables: arg1, arg2, arg3, arg4, arg5 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001070s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004829s Trying to remove transition: 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 2.276182s Time used: 2.27557 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.068754s Time used: 0.063826 Improving Solution with cost 2 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000911s Time used: 1.00065 LOG: SAT solveNonLinear - Elapsed time: 1.069665s Cost: 2; Total time: 1.06448 Failed at location 2: arg1 + arg3 <= arg2 Failed at location 2: arg1 + arg3 <= arg2 Before Improving: Quasi-invariant at l2: arg1 + arg3 <= arg2 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.020287s Remaining time after improvement: 0.995927 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: arg1 + arg3 <= arg2 [ 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: 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + arg1 + undef32, arg2 -> 1 + arg1 + undef32, arg3 -> 9 - arg1 - undef32, arg5 -> 1 + arg5, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}> New Graphs: Calling Safety with literal arg1 + arg3 <= arg2 and entry undef11, arg2 -> 0, arg3 -> undef13, arg4 -> 2, arg5 -> 2, rest remain the same}> LOG: CALL check - Post:arg1 + arg3 <= arg2 - Process 11 * Exit transition: undef11, arg2 -> 0, arg3 -> undef13, arg4 -> 2, arg5 -> 2, rest remain the same}> * Postcondition : arg1 + arg3 <= arg2 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001098s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001241s Calling Safety with literal arg1 + arg3 <= arg2 and entry undef16, arg2 -> undef17, arg3 -> -undef17 + undef21, arg4 -> undef34, arg5 -> 3, rest remain the same}> LOG: CALL check - Post:arg1 + arg3 <= arg2 - Process 12 * Exit transition: undef16, arg2 -> undef17, arg3 -> -undef17 + undef21, arg4 -> undef34, arg5 -> 3, rest remain the same}> * Postcondition : arg1 + arg3 <= arg2 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001052s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001221s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: arg1 + arg3 <= arg2 , Narrowing transition: 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + arg1 + undef32, arg2 -> 1 + arg1 + undef32, arg3 -> 9 - arg1 - undef32, arg5 -> 1 + arg5, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}> 1 + arg1 + undef32, arg2 -> 1 + arg1 + undef32, arg3 -> 9 - arg1 - undef32, arg5 -> 1 + arg5, rest remain the same}> Variables: arg1, arg2, arg3, arg4, arg5 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003398s Ranking function: -2 + 3*arg4 - 3*arg5 New Graphs: Transitions: 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}> Variables: arg1, arg2, arg3, arg4, arg5 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001182s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004715s Trying to remove transition: 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 2.215700s Time used: 2.21508 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005916s Time used: 4.00061 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.008315s Time used: 4.00058 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.848450s Time used: 0.828723 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.054229s Time used: 0.031483 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.340083s Time used: 0.339897 LOG: SAT solveNonLinear - Elapsed time: 0.394312s Cost: 1; Total time: 0.37138 Termination implied by a set of invariant(s): Invariant at l2: 0 <= 1 + arg2 + arg4 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg1 + undef32, arg2 -> 1 + arg1 + undef32, arg3 -> 9 - arg1 - undef32, arg5 -> 1 + arg5, 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): 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}> Quasi-ranking function: 50000 - arg2 New Graphs: Transitions: 1 + arg1, arg2 -> 1 + arg1, arg3 -> 9 - arg1, rest remain the same}> Variables: arg1, arg2, arg3, arg4, arg5 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002194s Ranking function: (~(1) / 49993) + (1 / 49993)*arg3 New Graphs: INVARIANTS: 2: 0 <= 1 + arg2 + arg4 , Quasi-INVARIANTS to narrow Graph: 2: Program Terminates