NO Solver Timeout: 4 Global Timeout: 300 No parsing errors! Init Location: 0 Transitions: (~(1) * arg2)) /\ (arg2 > ~(1)) /\ (arg1 > 0), par{arg1 -> (~(1) * arg2), arg2 -> undef2}> ~(5), arg2 -> undef4}> (arg1 + 1), arg2 -> undef6}> ~(5)), par{arg1 -> (arg1 + 1), arg2 -> undef8}> undef9, arg2 -> undef10}> Fresh variables: undef2, undef4, undef6, undef8, undef9, undef10, Undef variables: undef2, undef4, undef6, undef8, undef9, undef10, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: (~(1) * undef10)) /\ (undef10 > ~(1)) /\ (undef9 > 0)> ~(5)}> (arg1 + 1)}> ~(5)), par{arg1 -> (arg1 + 1)}> Fresh variables: undef2, undef4, undef6, undef8, undef9, undef10, Undef variables: undef2, undef4, undef6, undef8, undef9, undef10, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: -5, rest remain the same}> 1 + arg1, 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.004287 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000956s Ranking function: -6 - arg1 New Graphs: Transitions: -5, 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.000514s Ranking function: -1 - arg1 New Graphs: Transitions: -5, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000238s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000670s Trying to remove transition: -5, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.299755s Time used: 0.299655 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005287s Time used: 0.003913 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.009134s Time used: 0.009132 LOG: SAT solveNonLinear - Elapsed time: 0.014420s Cost: 1; Total time: 0.013045 Failed at location 2: 0 <= arg1 Before Improving: Quasi-invariant at l2: 0 <= arg1 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002091s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000580s Remaining time after improvement: 0.9987 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: 0 <= 2 + 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: -5, 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}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 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: -5, rest remain the same}> New Graphs: Calling Safety with literal 0 <= 2 + arg1 and entry LOG: CALL check - Post:0 <= 2 + arg1 - Process 1 * Exit transition: * Postcondition : 0 <= 2 + arg1 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000193s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000231s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 0 <= 2 + arg1 , Narrowing transition: -5, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + arg1, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + arg1, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: -5, rest remain the same}> 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.000501s Ranking function: -6 - arg1 New Graphs: Transitions: -5, 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.000398s Ranking function: -1 - arg1 New Graphs: Transitions: -5, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000179s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000490s Trying to remove transition: -5, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.296058s Time used: 0.295993 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.019346s Time used: 0.01802 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.033835s Time used: 0.033833 LOG: SAT solveNonLinear - Elapsed time: 0.053181s Cost: 1; Total time: 0.051853 Failed at location 2: 0 <= 3 + arg1 Before Improving: Quasi-invariant at l2: 0 <= 3 + arg1 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002968s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000833s Remaining time after improvement: 0.998225 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: 0 <= 4 + 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: -5, 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}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 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: -5, rest remain the same}> New Graphs: Calling Safety with literal 0 <= 4 + arg1 and entry LOG: CALL check - Post:0 <= 4 + arg1 - Process 2 * Exit transition: * Postcondition : 0 <= 4 + arg1 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000220s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000260s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 0 <= 4 + arg1 , Narrowing transition: -5, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + arg1, rest remain the same}> LOG: Narrow transition size 1 It's unfeasible. Removing transition: 1 + arg1, rest remain the same}> invGraph after Narrowing: Transitions: -5, 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.000404s Ranking function: -5 - arg1 New Graphs: Transitions: -5, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000184s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000498s Trying to remove transition: -5, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.297979s Time used: 0.297906 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.003741s Time used: 4.00239 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.004641s Time used: 4.00102 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.005218s Time used: 1.00042 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.193205s Time used: 0.188496 Proving non-termination of subgraph 1 Transitions: -5, 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.007552s Time used: 0.00744 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.003879s Time used: 0.003874 LOG: SAT solveNonLinear - Elapsed time: 0.011431s Cost: 1; Total time: 0.011314 Failed at location 2: 5 + arg1 <= 0 Before Improving: Quasi-invariant at l2: 5 + arg1 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001066s Remaining time after improvement: 0.999654 Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: 5 + arg1 <= 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): -5, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg1, rest remain the same}> Calling reachability with... Transition: Conditions: 5 + arg1 <= 0, OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: 5 + arg1 <= 0, OPEN EXITS: > Conditions are reachable! Program does NOT terminate