NO Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: ~(1)) /\ (arg1 > 0) /\ (undef1 > 0), par{arg1 -> undef1, arg2 -> 0, arg3 -> arg2}> ~(1)) /\ (arg3 > arg2) /\ (arg2 > ~(1)) /\ (undef4 <= arg1) /\ (arg1 > 0) /\ (undef4 > 0), par{arg1 -> undef4, arg2 -> (arg2 + undef7)}> undef8, arg2 -> undef9, arg3 -> undef10}> Fresh variables: undef1, undef4, undef7, undef8, undef9, undef10, Undef variables: undef1, undef4, undef7, undef8, undef9, undef10, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: ~(1)) /\ (undef8 > 0) /\ (undef1 > 0)> ~(1)) /\ (arg3 > arg2) /\ (arg2 > ~(1)) /\ (undef4 <= arg1) /\ (arg1 > 0) /\ (undef4 > 0), par{arg1 -> undef4, arg2 -> (arg2 + undef7)}> Fresh variables: undef1, undef4, undef7, undef8, undef9, undef10, Undef variables: undef1, undef4, undef7, undef8, undef9, undef10, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: undef4, arg2 -> arg2 + undef7, rest remain the same}> Variables: arg1, arg2, arg3 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.003699 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000958s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003719s Trying to remove transition: undef4, arg2 -> arg2 + undef7, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009765s Time used: 0.009527 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012550s Time used: 0.012011 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.018933s Time used: 0.018926 LOG: SAT solveNonLinear - Elapsed time: 0.031482s Cost: 1; Total time: 0.030937 Failed at location 2: arg1 + arg3 <= 1 Before Improving: Quasi-invariant at l2: arg1 + arg3 <= 1 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003273s Remaining time after improvement: 0.998278 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: arg1 + arg3 <= 1 [ 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: undef4, arg2 -> arg2 + undef7, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: undef4, arg2 -> arg2 + undef7, rest remain the same}> New Graphs: Calling Safety with literal arg1 + arg3 <= 1 and entry LOG: CALL check - Post:arg1 + arg3 <= 1 - Process 1 * Exit transition: * Postcondition : arg1 + arg3 <= 1 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000772s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000911s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: arg1 + arg3 <= 1 , Narrowing transition: undef4, arg2 -> arg2 + undef7, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef4, arg2 -> arg2 + undef7, rest remain the same}> Variables: arg1, arg2, arg3 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000940s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003669s Trying to remove transition: undef4, arg2 -> arg2 + undef7, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009042s Time used: 0.008742 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012687s Time used: 0.012033 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.017169s Time used: 0.017164 LOG: SAT solveNonLinear - Elapsed time: 0.029857s Cost: 1; Total time: 0.029197 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.003285s Remaining time after improvement: 0.998121 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: undef4, arg2 -> arg2 + undef7, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: undef4, arg2 -> arg2 + undef7, rest remain the same}> New Graphs: Calling Safety with literal arg2 + arg3 <= 0 and entry LOG: CALL check - Post:arg2 + arg3 <= 0 - Process 2 * Exit transition: * Postcondition : arg2 + arg3 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000709s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000871s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: arg2 + arg3 <= 0 , Narrowing transition: undef4, arg2 -> arg2 + undef7, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef4, arg2 -> arg2 + undef7, rest remain the same}> Variables: arg1, arg2, arg3 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001041s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004099s Trying to remove transition: undef4, arg2 -> arg2 + undef7, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009128s Time used: 0.00883 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012729s Time used: 0.012201 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001232s Time used: 4.00045 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.004406s Time used: 1.00047 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015286s Time used: 0.010293 Proving non-termination of subgraph 1 Transitions: undef4, arg2 -> arg2 + undef7, rest remain the same}> Variables: arg1, arg2, arg3 Checking that every undef value has an assignment... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001657s Checking conditional non-termination of SCC {l2}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.059248s Time used: 0.058746 Improving Solution with cost 8 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.161992s Time used: 0.161966 LOG: SAT solveNonLinear - Elapsed time: 0.221240s Cost: 8; Total time: 0.220712 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.023863s Number of undef constraints reduced! 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: 4 Strengthening exit transition (result): Strengthening exit transition (result): Strengthening exit transition (result): 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): undef4, arg2 -> arg2 + undef7, 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.037720s Time used: 0.037337 Improving Solution with cost 4 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.147095s Time used: 0.147086 LOG: SAT solveNonLinear - Elapsed time: 0.184816s Cost: 4; Total time: 0.184423 Failed at location 2: arg1 + arg2 <= arg3 Before Improving: Quasi-invariant at l2: arg1 + arg2 <= arg3 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.016717s Remaining time after improvement: 0.99676 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.005640s Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: arg1 + arg2 <= arg3 Constraint over undef 'undef7 <= 0' in transition: undef4, arg2 -> arg2 + undef7, rest remain the same}> Strengthening and disabling EXIT transitions... Closed exits from l2: 2 Strengthening exit transition (result): 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): undef4, arg2 -> arg2 + undef7, 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.028455s Time used: 0.028345 LOG: SAT solveNonLinear - Elapsed time: 0.028455s Cost: 0; Total time: 0.028345 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.008506s Number of undef constraints reduced! Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: 0 <= arg2 Strengthening and disabling EXIT transitions... Closed exits from l2: 2 Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef4, arg2 -> arg2 + undef7, rest remain the same}> Calling reachability with... Transition: Conditions: 1 <= arg1, arg1 + arg2 <= arg3, 0 <= arg2, OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: 1 <= arg1, arg1 + arg2 <= arg3, 0 <= arg2, OPEN EXITS: > Conditions are reachable! Program does NOT terminate