NO Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: ~(1)) /\ (arg2 > 1) /\ (undef2 > ~(1)) /\ (arg1 > 0), par{arg1 -> undef1, arg2 -> undef2}> 0) /\ (arg1 > 0), par{arg1 -> arg2, arg2 -> arg1}> undef5, arg2 -> undef6}> Fresh variables: undef1, undef2, undef5, undef6, Undef variables: undef1, undef2, undef5, undef6, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: ~(1)) /\ (undef6 > 1) /\ (undef2 > ~(1)) /\ (undef5 > 0)> 0) /\ (arg1 > 0), par{arg1 -> arg2, arg2 -> arg1}> Fresh variables: undef1, undef2, undef5, undef6, Undef variables: undef1, undef2, undef5, undef6, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: arg2, arg2 -> arg1, rest remain the same}> Variables: arg1, arg2 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.002506 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000610s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001903s Trying to remove transition: arg2, arg2 -> arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006016s Time used: 0.005854 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008232s Time used: 0.007914 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.014464s Time used: 0.014461 LOG: SAT solveNonLinear - Elapsed time: 0.022696s Cost: 1; Total time: 0.022375 Failed at location 2: arg1 <= 0 Before Improving: Quasi-invariant at l2: arg1 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002014s Remaining time after improvement: 0.999016 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: arg1 <= 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: arg2, arg2 -> arg1, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: arg2, arg2 -> arg1, rest remain the same}> New Graphs: Calling Safety with literal arg1 <= 0 and entry LOG: CALL check - Post:arg1 <= 0 - Process 1 * Exit transition: * Postcondition : arg1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000621s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000764s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: arg1 <= 0 , Narrowing transition: arg2, arg2 -> arg1, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: arg2, arg2 -> arg1, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000538s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001836s Trying to remove transition: arg2, arg2 -> arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005545s Time used: 0.005404 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007940s Time used: 0.007598 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.013302s Time used: 0.013297 LOG: SAT solveNonLinear - Elapsed time: 0.021241s Cost: 1; Total time: 0.020895 Failed at location 2: arg2 <= 0 Before Improving: Quasi-invariant at l2: arg2 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001893s Remaining time after improvement: 0.999029 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: arg2 <= 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: arg2, arg2 -> arg1, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: arg2, arg2 -> arg1, rest remain the same}> New Graphs: Calling Safety with literal arg2 <= 0 and entry LOG: CALL check - Post:arg2 <= 0 - Process 2 * Exit transition: * Postcondition : arg2 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000647s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000769s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: arg2 <= 0 , Narrowing transition: arg2, arg2 -> arg1, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: arg2, arg2 -> arg1, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000533s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001813s Trying to remove transition: arg2, arg2 -> arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005497s Time used: 0.005356 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010082s Time used: 0.009784 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001007s Time used: 4.00033 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.011447s Time used: 1.00053 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008528s Time used: 0.005888 Proving non-termination of subgraph 1 Transitions: arg2, arg2 -> arg1, rest remain the same}> Variables: arg1, arg2 Checking conditional non-termination of SCC {l2}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007261s Time used: 0.007071 Improving Solution with cost 2 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.009872s Time used: 0.009867 LOG: SAT solveNonLinear - Elapsed time: 0.017133s Cost: 2; Total time: 0.016938 Failed at location 2: 1 <= arg1 Before Improving: Quasi-invariant at l2: 1 <= arg1 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001460s Remaining time after improvement: 0.999234 Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: 1 <= arg1 Strengthening and disabling EXIT transitions... Closed exits from l2: 1 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): arg2, arg2 -> arg1, 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.004653s Time used: 0.004472 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.004828s Time used: 0.004824 LOG: SAT solveNonLinear - Elapsed time: 0.009481s Cost: 1; Total time: 0.009296 Failed at location 2: 1 <= arg2 Before Improving: Quasi-invariant at l2: 1 <= arg2 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001276s Remaining time after improvement: 0.999255 Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: 1 <= arg2 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): arg2, arg2 -> arg1, rest remain the same}> Calling reachability with... Transition: Conditions: 1 <= arg1, 1 <= arg2, OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: 1 <= arg1, 1 <= arg2, OPEN EXITS: > Conditions are reachable! Program does NOT terminate