NO Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: 0) /\ (arg2 > ~(1)), par{arg1 -> arg2, arg2 -> undef2}> ((~(1) * arg1) + 1), arg2 -> undef4}> 0), par{arg1 -> ((~(1) * arg1) + 1), arg2 -> undef6}> ~(6)) /\ (arg1 < 0), par{arg1 -> 0, arg2 -> undef8}> 0), par{arg1 -> 0, arg2 -> undef10}> 5), par{arg1 -> ((~(1) * arg1) - 1), arg2 -> undef12}> undef13, arg2 -> undef14}> Fresh variables: undef2, undef4, undef6, undef8, undef10, undef12, undef13, undef14, Undef variables: undef2, undef4, undef6, undef8, undef10, undef12, undef13, undef14, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: 0) /\ (undef14 > ~(1))> ((~(1) * arg1) + 1)}> ~(6)) /\ (arg1 < 0), par{arg1 -> 0}> 0), par{arg1 -> 0}> 5), par{arg1 -> ((~(1) * arg1) - 1)}> Fresh variables: undef2, undef4, undef6, undef8, undef10, undef12, undef13, undef14, Undef variables: undef2, undef4, undef6, undef8, undef10, undef12, undef13, undef14, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 1 - arg1, rest remain the same}> 0, rest remain the same}> 0, rest remain the same}> -1 - arg1, rest remain the same}> Variables: arg1 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.005611 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001275s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.081082s Trying to remove transition: -1 - arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010584s Time used: 0.010304 Trying to remove transition: 0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009631s Time used: 0.009064 Trying to remove transition: 0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009099s Time used: 0.008524 Trying to remove transition: 1 - arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008991s Time used: 0.00841 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.021909s Time used: 0.021341 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.079562s Time used: 0.078084 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.509569s Time used: 0.50953 LOG: SAT solveNonLinear - Elapsed time: 0.589131s Cost: 1; Total time: 0.587614 Failed at location 2: arg1 <= 0 Before Improving: Quasi-invariant at l2: arg1 <= 0 Quasi-invariant at l2: 0 <= 1 + arg1 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.035758s Remaining time after improvement: 0.996823 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: arg1 <= 0 Quasi-invariant at l2: 0 <= 1 + 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, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 0, 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, 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, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 0, 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, rest remain the same}> New Graphs: Transitions: 0, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000644s Ranking function: -1 - arg1 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.000565s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000660s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: arg1 <= 0 , 0 <= 1 + arg1 , Narrowing transition: 1 - arg1, rest remain the same}> LOG: Narrow transition size 2 It's unfeasible. Removing transition: 0, rest remain the same}> It's unfeasible. Removing transition: 0, rest remain the same}> Narrowing transition: -1 - arg1, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: 1 - arg1, rest remain the same}> -1 - arg1, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000709s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.008592s Trying to remove transition: -1 - arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005991s Time used: 0.005824 Trying to remove transition: 1 - arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005568s Time used: 0.00533 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010346s Time used: 0.010112 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.023234s Time used: 0.022538 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.091507s Time used: 0.091485 LOG: SAT solveNonLinear - Elapsed time: 0.114741s Cost: 1; Total time: 0.114023 Failed at location 2: arg1 <= 1 Before Improving: Quasi-invariant at l2: arg1 <= 1 Quasi-invariant at l2: 0 <= arg1 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.012444s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001794s Remaining time after improvement: 0.995814 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: arg1 <= 2 Quasi-invariant at l2: 1 <= 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, 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, 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, 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, rest remain the same}> New Graphs: Calling Safety with literal arg1 <= 2 and entry LOG: CALL check - Post:arg1 <= 2 - Process 2 * Exit transition: * Postcondition : arg1 <= 2 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000668s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000767s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 <= arg1 , arg1 <= 2 , Narrowing transition: 1 - arg1, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: -1 - arg1, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: 1 - arg1, rest remain the same}> -1 - arg1, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000742s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.008685s Trying to remove transition: -1 - arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006167s Time used: 0.00601 Trying to remove transition: 1 - arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005699s Time used: 0.005466 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009347s Time used: 0.009101 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.076682s Time used: 0.076044 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.103112s Time used: 0.103098 LOG: SAT solveNonLinear - Elapsed time: 0.179793s Cost: 1; Total time: 0.179142 Failed at location 2: arg1 <= 5 Before Improving: Quasi-invariant at l2: arg1 <= 5 Quasi-invariant at l2: 0 <= arg1 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.013186s Remaining time after improvement: 0.998085 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: arg1 <= 5 Quasi-invariant at l2: 0 <= 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, 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, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: -1 - 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, rest remain the same}> New Graphs: Calling Safety with literal arg1 <= 5 and entry LOG: CALL check - Post:arg1 <= 5 - Process 3 * Exit transition: * Postcondition : arg1 <= 5 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000845s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000945s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 0 <= arg1 , arg1 <= 5 , Narrowing transition: 1 - arg1, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: -1 - arg1, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: 1 - arg1, rest remain the same}> -1 - arg1, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000751s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.008763s Trying to remove transition: -1 - arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006208s Time used: 0.006049 Trying to remove transition: 1 - arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005726s Time used: 0.00549 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009394s Time used: 0.00916 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001715s Time used: 4.00085 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.011327s Time used: 1.00065 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.018438s Time used: 0.00935 Proving non-termination of subgraph 1 Transitions: 1 - arg1, rest remain the same}> -1 - arg1, rest remain the same}> Variables: arg1 Checking conditional non-termination of SCC {l2}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005632s Time used: 0.00553 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.001995s Time used: 5.00145 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.007981s Time used: 5.0016 > Checking if the negation of the conditions of every pending exit is quasi-invariant... YES Calling reachability with... Transition: Conditions: 6 <= arg1, 0 <= 5 + arg1, Transition: Conditions: arg1 <= 5, 6 + arg1 <= 0, OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: 6 <= arg1, Transition: Conditions: 6 + arg1 <= 0, OPEN EXITS: > Conditions are reachable! Program does NOT terminate