NO Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: (0 + x_13^0)}> undef12, rt_11^0 -> (0 + st_17^0)}> undef22, nd_12^0 -> undef24, rv_18^0 -> undef27}> undef43, nd_12^0 -> undef45, rv_18^0 -> (0 + undef52)}> undef53}> undef65}> Fresh variables: undef12, undef22, undef24, undef27, undef31, undef43, undef45, undef52, undef53, undef65, Undef variables: undef12, undef22, undef24, undef27, undef31, undef43, undef45, undef52, undef53, undef65, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: undef12}> undef22}> undef53, lt_15^0 -> undef43}> Fresh variables: undef12, undef22, undef24, undef27, undef31, undef43, undef45, undef52, undef53, undef65, Undef variables: undef12, undef22, undef24, undef27, undef31, undef43, undef45, undef52, undef53, undef65, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: undef22, rest remain the same}> undef53, lt_15^0 -> undef43, rest remain the same}> Variables: lt_15^0, y_16^0, __disjvr_0^0 Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 undef12, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ( 3 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.004281 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001220s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004645s Trying to remove transition: undef53, lt_15^0 -> undef43, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010235s Time used: 0.009954 Trying to remove transition: undef22, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007262s Time used: 0.006605 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.019235s Time used: 0.01858 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.040062s Time used: 0.040052 LOG: SAT solveNonLinear - Elapsed time: 0.059297s Cost: 1; Total time: 0.058632 Failed at location 2: 1 + y_16^0 <= lt_15^0 Before Improving: Quasi-invariant at l2: 1 + y_16^0 <= lt_15^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.006097s Remaining time after improvement: 0.998044 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: 1 + y_16^0 <= lt_15^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: undef22, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef53, lt_15^0 -> undef43, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: undef22, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef53, lt_15^0 -> undef43, rest remain the same}> New Graphs: Calling Safety with literal 1 + y_16^0 <= lt_15^0 and entry LOG: CALL check - Post:1 + y_16^0 <= lt_15^0 - Process 1 * Exit transition: * Postcondition : 1 + y_16^0 <= lt_15^0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000544s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000615s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + y_16^0 <= lt_15^0 , Narrowing transition: undef22, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef53, lt_15^0 -> undef43, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef22, rest remain the same}> undef53, lt_15^0 -> undef43, rest remain the same}> Variables: lt_15^0, y_16^0, __disjvr_0^0 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001119s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004502s Trying to remove transition: undef53, lt_15^0 -> undef43, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008711s Time used: 0.008405 Trying to remove transition: undef22, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007529s Time used: 0.006819 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.021352s Time used: 0.020657 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.025295s Time used: 0.025286 LOG: SAT solveNonLinear - Elapsed time: 0.046647s Cost: 1; Total time: 0.045943 Failed at location 2: y_16^0 <= lt_15^0 Before Improving: Quasi-invariant at l2: y_16^0 <= lt_15^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.006206s Remaining time after improvement: 0.997994 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: y_16^0 <= lt_15^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: undef22, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef53, lt_15^0 -> undef43, 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: undef22, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef53, lt_15^0 -> undef43, rest remain the same}> New Graphs: Calling Safety with literal y_16^0 <= lt_15^0 and entry LOG: CALL check - Post:y_16^0 <= lt_15^0 - Process 2 * Exit transition: * Postcondition : y_16^0 <= lt_15^0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000599s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000678s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: y_16^0 <= lt_15^0 , Narrowing transition: undef22, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef53, lt_15^0 -> undef43, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef22, rest remain the same}> undef53, lt_15^0 -> undef43, rest remain the same}> Variables: lt_15^0, y_16^0, __disjvr_0^0 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001138s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004505s Trying to remove transition: undef53, lt_15^0 -> undef43, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008864s Time used: 0.008556 Trying to remove transition: undef22, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007394s Time used: 0.006662 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.024112s Time used: 0.023528 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002190s Time used: 4.00062 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.006713s Time used: 1.00002 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.035108s Time used: 0.014717 Proving non-termination of subgraph 1 Transitions: undef22, rest remain the same}> undef53, lt_15^0 -> undef43, rest remain the same}> Variables: lt_15^0, y_16^0, __disjvr_0^0 Checking that every undef value has an assignment... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002022s Checking conditional non-termination of SCC {l2}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.048953s Time used: 0.048511 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.198888s Time used: 0.198836 LOG: SAT solveNonLinear - Elapsed time: 0.247842s Cost: 1; Total time: 0.247347 Failed at location 2: 1 + lt_15^0 <= y_16^0 Before Improving: Quasi-invariant at l2: 1 + lt_15^0 <= y_16^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.032722s Remaining time after improvement: 0.997101 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.005263s Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: 1 + lt_15^0 <= y_16^0 Constraint over undef '1 + undef22 <= y_16^0' in transition: undef22, rest remain the same}> Constraint over undef 'undef43 <= lt_15^0' in transition: undef53, lt_15^0 -> undef43, rest remain the same}> 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): undef22, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef53, lt_15^0 -> undef43, rest remain the same}> Calling reachability with... Transition: Conditions: 1 + lt_15^0 <= y_16^0, OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: 1 + lt_15^0 <= y_16^0, OPEN EXITS: > Conditions are reachable! Program does NOT terminate